1 and ConnectionInfo[ConnInfoInd['station_to']] == EndStation: \r\n if CheckIfPathTerminatesSuccessfully(ConnectionInfo, PathInfo, RouteConditions, EndStation):\r\n \tif Cond.IfTestRouteSearch:\r\n \t\tprint \"End Station is reached!\"\t\r\n \treturn [PathInfo]\r\n\r\n # current (this iteration's) path length\r\n CurPathLen = len(PathInfo)\r\n\r\n # get next connections\r\n start_station = ConnectionInfo[ConnInfoInd['station_to']]\r\n departure_hour = ConnectionInfo[ConnInfoInd['arrival_hour']] \t\r\n departure_min = ConnectionInfo[ConnInfoInd['arrival_min']]\r\n\r\n # TEST BU2019\r\n if False:\r\n\t print 'ConnInfoInd: ' + str(ConnectionInfo)\r\n\t print 'start_station,departure_hour,departure_min: %s, %s, %s' % (start_station, departure_hour, departure_min)\r\n\t time.sleep(0.1)\r\n \r\n # mandatory conditions\r\n WaitLimit = RouteConditions[Cond.MaxWaitingTimeAtStation][0]\r\n \r\n # get next connections from the station\r\n ConnectionInfoList = GetListOfNextConnections(TimeTableList, TimeTableIndex, StationHourIndex, start_station, departure_hour, departure_min, WaitLimit)\r\n\r\n # insert on-foot connections (Zu Fuss, ZF) to nearby stations into ConnectionInfoList\r\n # cancel (Tunc 4/3/2019)\r\n if False:\r\n\t StationMeasurementTime = ReqStationMeasureTime\r\n\t \r\n\t if Cond.MaxNumberOfSubsequentStationPassagesOnFoot in RouteConditions \\\r\n\t \tand RouteConditions[Cond.MaxNumberOfSubsequentStationPassagesOnFoot][0] > 0:\r\n\r\n\t\t if RouteConditions.has_key(Cond.MeasureStations):\r\n\t\t \tStationMeasurementTime = RouteConditions[Cond.MeasureStations][1]\r\n\t\t Connections = GetOnFootStationChangeConnections(start_station, departure_hour, departure_min, StationMeasurementTime)\r\n\t\t \r\n\t\t if Connections:\t\t# i.e. if Connections is not None\r\n\t\t \t(OnFootConnections1, OnFootConnections2) = Connections \r\n\t\t \tConnectionInfoList = AddConnectionsToListAfterDepartureTime(ConnectionInfoList, OnFootConnections1)\r\n\t\t \tConnectionInfoList = AddConnectionsToListAfterDepartureTime(ConnectionInfoList, OnFootConnections2)\r\n\r\n if Cond.IfTestRouteSearch:\r\n\t\tprint \"Next connections:\"\r\n\t\tfor c in ConnectionInfoList:\r\n\t\t\tprint c\r\n\t\ttime.sleep(Cond.TestWaitingTime)\r\n\r\n if not ConnectionInfoList:\t\t# Endstation: Node w/o successor nodes\r\n \treturn []\r\n\r\n PathInfoList = []\r\n\r\n for ConnectionInfo in ConnectionInfoList:\r\n\t\tres = Cond.CheckIfConnectionShouldBeSelected(ConnectionInfo, PathInfo, EndStation, RouteConditions)\r\n\r\n\t\t# test\r\n\t\tif Cond.IfTestRouteSearch:\r\n\t\t\tif res == None or res == False:\r\n\t\t\t\tprint \"CheckIfConnectionShouldBeSelected: %s\" % res\r\n\r\n\t \tif res == None: return[] \r\n\t \tif res == False: continue\r\n\r\n\t \t# recursive call\r\n\t\textended_paths = FindAllRoutesRec(ConnectionInfo, EndStation, RouteConditions, \\\r\n\t\t\tTimeTableList, TimeTableIndex, StationHourIndex, PathInfo)\r\n\r\n\t\t# report status\r\n\t\tif Cond.ReportDuringRouteSearch in RouteConditions:\r\n\t\t\tTimeIntv = default_timer() - Cond.SearchStartTime\r\n\t\t\tRouteSearchReportingIntervalInSeconds = RouteConditions[Cond.ReportDuringRouteSearch][0]\r\n\t\t\tif TimeIntv > Cond.RouteSearchReportCounter * RouteSearchReportingIntervalInSeconds:\r\n\t\t\t\tCond.RouteSearchReportCounter += 1 \r\n\t\t\t\tprint \"%s seconds passed... \" % \"{:.2f}\".format(TimeIntv)\r\n\t\t\t\tprint \"%s routes found so far, that passed all connection selection criteria (before route selection)\" \\\r\n\t\t\t\t\t% Cond.RouteCountAfterConnectionSelection\t\r\n\t\t\t\tprint \"%s routes found so far, that passed all route selection criteria (before final route filtering)\" \\\r\n\t\t\t\t\t% Cond.RouteCountAfterRouteSelection\t\r\n\t\t\t\tprint \"----------------------\"\t\r\n\r\n\t\t# append to path list\r\n\t\tfor p in extended_paths:\r\n\t\t\t# no need to recheck route unless current connection is the last one \r\n\t\t\t# LastConnection = (ConnectionInfo == p[-1])\r\n\t\t\tLastConnection = (CurPathLen == len(p) -1 and ConnectionInfo == p[-1])\r\n\t\t\t\r\n\t\t\tif LastConnection:\r\n\r\n\t\t\t\tif Cond.CheckIfRouteShouldBeSelected(p, RouteConditions):\r\n\t\t\t\t\tPathInfoList.append(p)\r\n\t\t\t\t\tCond.SelectedRoutes.append(ApplyAllRouteInfoCorrections(p))\r\n\r\n\t\t\t\t\t# evaluate route\r\n\t\t\t\t\t# cancel for BU2019\r\n\r\n\t\t\t\t\tif Cond.IfTestRouteSearch:\r\n\t\t\t\t\t\tprint \"%s routes found so far, that passed all connection selection criteria (before route selection)\" \\\r\n\t\t\t\t\t\t\t% Cond.RouteCountAfterConnectionSelection\r\n\t\t\t\t\t\tprint \"%s routes found so far, that passed all route selection criteria (before final route filtering)\\n\" \\\r\n\t\t\t\t\t\t\t% Cond.RouteCountAfterRouteSelection\t\t\r\n\t\t\t\t\t\tprint \"----------------------\"\t\r\n\r\n\t\t\t\t\t# test\r\n\t\t\t\t\tIncrementDicValue(Cond.RouteCountPerRouteLength, CurPathLen)\r\n\t\t\t\t\t\r\n\t\t\telse:\r\n\t\t\t\t# not last connection, no need to recheck the route\r\n\t\t\t\t# PathInfoList.append(p)\r\n\t\t\t\t# IncrementDicValue(SelectedRoutesPerLevel, CurPathLen)\r\n\t\t\t\tpass\r\n \r\n return PathInfoList","def _sort_routes(self):\n sorted_routes = OrderedDict()\n for inp_lab, inp in self.inputs.items():\n if inp_lab not in self.routes:\n continue\n sorted_routes[inp_lab] = OrderedDict()\n for out_lab, out in self.outputs.items():\n if out_lab not in self.routes[inp_lab]:\n continue\n routes = self.routes[inp_lab][out_lab]\n # If multiple routes between a certain input and output exist,\n # order the routes by length\n if len(routes) > 1:\n route_lengths = [len(route) for route in routes]\n sorted_indices = np.argsort(route_lengths)\n routes = [routes[i] for i in sorted_indices]\n sorted_routes[inp_lab][out_lab] = routes\n self.routes = sorted_routes","def find_routes(\r\n stops,\r\n measurement_units = \"\"\"Minutes\"\"\",\r\n analysis_region = None,\r\n reorder_stops_to_find_optimal_routes = False,\r\n preserve_terminal_stops = \"\"\"Preserve First\"\"\",\r\n return_to_start = False,\r\n use_time_windows = False,\r\n time_of_day = None,\r\n time_zone_for_time_of_day = \"\"\"Geographically Local\"\"\",\r\n uturn_at_junctions = \"\"\"Allowed Only at Intersections and Dead Ends\"\"\",\r\n point_barriers = None,\r\n line_barriers = None,\r\n polygon_barriers = None,\r\n use_hierarchy = True,\r\n restrictions = None,\r\n attribute_parameter_values = None,\r\n route_shape = \"\"\"True Shape\"\"\",\r\n route_line_simplification_tolerance = None,\r\n populate_route_edges = False,\r\n populate_directions = True,\r\n directions_language = \"\"\"en\"\"\",\r\n directions_distance_units = \"\"\"Miles\"\"\",\r\n directions_style_name = \"\"\"NA Desktop\"\"\",\r\n travel_mode = \"\"\"Custom\"\"\",\r\n impedance = \"\"\"Drive Time\"\"\",\r\n gis = None):\r\n kwargs = locals()\r\n\r\n if stops is None:\r\n stops = default_stops\r\n\r\n if point_barriers is None:\r\n point_barriers = default_point_barriers\r\n\r\n if line_barriers is None:\r\n line_barriers = default_line_barriers\r\n\r\n if polygon_barriers is None:\r\n polygon_barriers = default_polygon_barriers\r\n\r\n if restrictions is None:\r\n restrictions = default_restrictions\r\n\r\n if attribute_parameter_values is None:\r\n attribute_parameter_values = default_attributes\r\n\r\n if route_line_simplification_tolerance is None:\r\n route_line_simplification_tolerance = default_tolerance\r\n\r\n param_db = {\r\n \"stops\": (FeatureSet, \"Stops\"),\r\n \"measurement_units\": (str, \"Measurement_Units\"),\r\n \"analysis_region\": (str, \"Analysis_Region\"),\r\n \"reorder_stops_to_find_optimal_routes\": (bool, \"Reorder_Stops_to_Find_Optimal_Routes\"),\r\n \"preserve_terminal_stops\": (str, \"Preserve_Terminal_Stops\"),\r\n \"return_to_start\": (bool, \"Return_to_Start\"),\r\n \"use_time_windows\": (bool, \"Use_Time_Windows\"),\r\n \"time_of_day\": (datetime, \"Time_of_Day\"),\r\n \"time_zone_for_time_of_day\": (str, \"Time_Zone_for_Time_of_Day\"),\r\n \"uturn_at_junctions\": (str, \"UTurn_at_Junctions\"),\r\n \"point_barriers\": (FeatureSet, \"Point_Barriers\"),\r\n \"line_barriers\": (FeatureSet, \"Line_Barriers\"),\r\n \"polygon_barriers\": (FeatureSet, \"Polygon_Barriers\"),\r\n \"use_hierarchy\": (bool, \"Use_Hierarchy\"),\r\n \"restrictions\": (str, \"Restrictions\"),\r\n \"attribute_parameter_values\": (FeatureSet, \"Attribute_Parameter_Values\"),\r\n \"route_shape\": (str, \"Route_Shape\"),\r\n \"route_line_simplification_tolerance\": (LinearUnit, \"Route_Line_Simplification_Tolerance\"),\r\n \"populate_route_edges\": (bool, \"Populate_Route_Edges\"),\r\n \"populate_directions\": (bool, \"Populate_Directions\"),\r\n \"directions_language\": (str, \"Directions_Language\"),\r\n \"directions_distance_units\": (str, \"Directions_Distance_Units\"),\r\n \"directions_style_name\": (str, \"Directions_Style_Name\"),\r\n \"travel_mode\": (str, \"Travel_Mode\"),\r\n \"impedance\": (str, \"Impedance\"),\r\n \"solve_succeeded\": (bool, \"Solve Succeeded\"),\r\n \"output_routes\": (FeatureSet, \"Output Routes\"),\r\n \"output_route_edges\": (FeatureSet, \"Output Route Edges\"),\r\n \"output_directions\": (FeatureSet, \"Output Directions\"),\r\n \"output_stops\": (FeatureSet, \"Output Stops\"),\r\n }\r\n return_values = [\r\n {\"name\": \"solve_succeeded\", \"display_name\": \"Solve Succeeded\", \"type\": bool},\r\n {\"name\": \"output_routes\", \"display_name\": \"Output Routes\", \"type\": FeatureSet},\r\n {\"name\": \"output_route_edges\", \"display_name\": \"Output Route Edges\", \"type\": FeatureSet},\r\n {\"name\": \"output_directions\", \"display_name\": \"Output Directions\", \"type\": FeatureSet},\r\n {\"name\": \"output_stops\", \"display_name\": \"Output Stops\", \"type\": FeatureSet},\r\n ]\r\n\r\n if gis is None:\r\n gis = arcgis.env.active_gis\r\n\r\n url = gis.properties.helperServices.asyncRoute.url\r\n return _execute_gp_tool(gis, \"FindRoutes\", kwargs, param_db, return_values, _use_async, url)","def get_self_origin(self, routes):\n # TODO\n outroutes = {}\n\n for ip in routes.keys():\n if routes[ip][SORG]:\n outroutes[ip] = routes[ip]\n\n return outroutes","def gtfs_routes(gtfs, output_f):\n\n\t# Load up the stop times so we can find which are the best routes.\n\t#TODO\n\tstop_times_file = [x for x in gtfs.namelist() if 'stop_times' in x][0]\n\n\tstoptimes_c = csv.reader((gtfs.open(stop_times_file, 'r')))\n\theader = stoptimes_c.next()\n\ttrip_id_col = header.index('trip_id')\n\tarrtime_col = header.index('arrival_time')\n\tdeptime_col = header.index('departure_time')\n\tstopseq_col = header.index('stop_sequence')\n\ttrip_times = {}\n\tfor row in stoptimes_c:\n\t\tif row[trip_id_col] not in trip_times:\n\t\t\t# earliest seq, latest seq, earliest seq dep time, latest seq dep time\n\t\t\ttrip_times[row[trip_id_col]] = [None, None, None, None]\n\n\t\tarrtime = time_as_timedelta(row[arrtime_col])\n\t\tdeptime = time_as_timedelta(row[deptime_col])\n\t\tif arrtime is None or deptime is None:\n\t\t\t# bad data, skip!\n\t\t\tcontinue\n\t\tseq = int(row[stopseq_col])\n\n\t\t# Find if this is an earlier item in the sequence\n\t\tif trip_times[row[trip_id_col]][0] is None or trip_times[row[trip_id_col]][0] > seq:\n\t\t\ttrip_times[row[trip_id_col]][0] = seq\n\t\t\ttrip_times[row[trip_id_col]][2] = deptime\n\n\t\t# Find if this is an later item in the sequence\n\t\tif trip_times[row[trip_id_col]][1] is None or trip_times[row[trip_id_col]][1] < seq:\n\t\t\ttrip_times[row[trip_id_col]][1] = seq\n\t\t\ttrip_times[row[trip_id_col]][3] = arrtime\n\n\t# Load the shapes into a map that we can lookup.\n\t# We should do all the geometry processing here so that we only have to do\n\t# this once-off.\n\t#TODO\n\tshapes_file = [x for x in gtfs.namelist() if 'shapes' in x][0]\n\tshapes_c = csv.reader(swallow_windows_unicode(gtfs.open(shapes_file, 'r')))\n\n\theader = shapes_c.next()\n\tshape_id_col = header.index('shape_id')\n\tshape_lat_col = header.index('shape_pt_lat')\n\tshape_lng_col = header.index('shape_pt_lon')\n\tshape_seq_col = header.index('shape_pt_sequence')\n\tshape_dist_col = header.index('shape_dist_traveled') if 'shape_dist_traveled' in header else None\n\n\tshapes = {}\n\tshape_lengths = {}\n\tfor row in shapes_c:\n\t\tif row[shape_id_col] not in shapes:\n\t\t\tshapes[row[shape_id_col]] = {}\n\n\t\tshapes[row[shape_id_col]][int(row[shape_seq_col])] = (Decimal(row[shape_lng_col]), Decimal(row[shape_lat_col]))\n\n\t\t# Calculate length according to GTFS\n\t\t# This could also be calculated by the geometry, but we trust GTFS, right...\n\t\tif shape_dist_col is not None and row[shape_dist_col]:\n\t\t\tlength = Decimal(row[shape_dist_col])\n\t\t\tif row[shape_id_col] not in shape_lengths or shape_lengths[row[shape_id_col]] < length:\n\t\t\t\tshape_lengths[row[shape_id_col]] = length\n\n\t# translate the shapes into a LineString for use by the GeoJSON module\n\tfor shape_id in shapes.iterkeys():\n\t\tshape_keys = shapes[shape_id].keys()\n\t\tshape_keys.sort()\n\t\tshape = []\n\t\tfor ordinal in shape_keys:\n\t\t\tshape.append(shapes[shape_id][ordinal])\n\n\t\tshapes[shape_id] = shape\n\n\t# Make a matching dict between routes and shapes\n\ttrips = {}\n\ttrips_ref = {}\n\troute_time = {}\n\n\t#TODO\n\ttrips_file = [x for x in gtfs.namelist() if 'trips' in x][0]\n\n\ttrips_c = csv.reader(swallow_windows_unicode(gtfs.open(trips_file, 'r')))\n\theader = trips_c.next()\n\troute_id_col = header.index('route_id')\n\tshape_id_col = header.index('shape_id')\n\ttrip_id_col = header.index('trip_id')\n\tfor row in trips_c:\n\t\t# reference count the shapes\n\t\tif row[route_id_col] not in trips_ref:\n\t\t\t# route is unknown, create dict\n\t\t\ttrips_ref[row[route_id_col]] = {}\n\t\t\troute_time[row[route_id_col]] = trip_times[row[trip_id_col]]\n\n\t\tif row[shape_id_col] not in trips_ref[row[route_id_col]]:\n\t\t\t# shape is unknown, create counter\n\t\t\ttrips_ref[row[route_id_col]][row[shape_id_col]] = 0\n\n\t\t# increment counter\n\t\ttrips_ref[row[route_id_col]][row[shape_id_col]] += 1\n\n\t# now we're done, iterate through the reference-counters and find the best\n\t# shape\n\tfor route_id, candidate_shapes in trips_ref.iteritems():\n\t\tpopular_shape, popular_shape_refs = None, 0\n\t\tfor shape_id, refs in candidate_shapes.iteritems():\n\t\t\tif refs > popular_shape_refs:\n\t\t\t\tpopular_shape, popular_shape_refs = shape_id, refs\n\n\t\t# now we should have the route's shape\n\t\tassert popular_shape is not None, 'Couldn\\'t find a shape for route %r' % route_id\n\t\ttrips[route_id] = popular_shape\n\n\t# Cleanup unused variables\n\tdel trip_times\n\n\t# lets setup our output file\n\toutput_layer = geojson.FeatureCollection([])\n\t# assume WGS84 CRS\n\toutput_layer.crs = geojson.crs.Named('urn:ogc:def:crs:OGC:1.3:CRS84')\n\n\t# now we have all the shapes available, translate the routes\n\t#TODO\n\troutes_file = [x for x in gtfs.namelist() if 'routes' in x][0]\n\n\troutes_c = csv.reader(swallow_windows_unicode(gtfs.open(routes_file, 'r')))\n\theader = routes_c.next()\n\troute_id_col = header.index('route_id')\n\n\tfor row in routes_c:\n\t\t# make dict of other properties\n\t\tprops = dict()\n\t\tfor i, h in enumerate(header):\n\t\t\tif row[i] != '':\n\t\t\t\tprops[h] = row[i]\n\n\t\tif row[route_id_col] not in trips:\n\t\t\t# Route has no trips!\n\t\t\tprint \"Warning: route has no trips, skipping: %r\" % (row,)\n\t\t\tcontinue\n\n\t\tprops['shape_id'] = trips[row[route_id_col]]\n\t\tprops['shape_refs'] = trips_ref[row[route_id_col]][props['shape_id']]\n\t\tif shape_dist_col is not None and len(shape_lengths) > 0:\n\t\t\tprops['shape_length'] = shape_lengths[props['shape_id']]\n\t\tprops['duration_sec'] = (route_time[row[route_id_col]][3] - route_time[row[route_id_col]][2]).total_seconds()\n\n\t\toutput_layer.features.append(geojson.Feature(\n\t\t\tgeometry=geojson.LineString(\n\t\t\t\tcoordinates=shapes[trips[row[route_id_col]]]\n\t\t\t),\n\t\t\tproperties=props,\n\t\t\tid=row[route_id_col]\n\t\t))\n\n\t# now flush the GeoJSON layer to a file.\n\tgeojson.dump(output_layer, output_f, cls=DecimalEncoder)","def _build_path(self):\n for point_3d in self.path_coordinates:\n self.connect_point_with_neighbors(point_3d)","def route(self, mn, direction=None, via_tag=None):\n mn = np.asarray(mn)\n _mn = list()\n for i in range(1, mn.shape[0]): \n # when more than two points are given,\n # create a multi-point wire compose of sub-routing wires\n # connecting the points given by mn in sequence.\n _mn.append([mn[i - 1, :], mn[i, :]])\n route = list()\n # via at the starting point\n if via_tag is not None:\n if via_tag[0] is True:\n route.append(self.via(mn=_mn[0][0], params=None))\n # routing wires\n for i, __mn in enumerate(_mn):\n xy0 = self.abs2phy[__mn[0]]\n xy1 = self.abs2phy[__mn[1]]\n _xy = np.array([[xy0[0], xy0[1]], [xy1[0], xy1[1]]])\n if np.all(xy0 == xy1): # if two points are identical, generate a metal stub on the bottom layer.\n if (direction == 'vertical') or ((direction is None) and (self.primary_grid == 'vertical')):\n width = self.vwidth[__mn[0][0]]\n hextension = int(width/2)\n vextension = self.vextension0[__mn[0][0]]\n layer = self.vlayer[__mn[0][0]]\n else:\n width = self.hwidth[__mn[0][1]]\n hextension = self.hextension0[__mn[0][1]]\n vextension = int(width/2)\n layer = self.hlayer[__mn[0][1]]\n else:\n if (xy0[0] == xy1[0]) or (direction == 'vertical'): # vertical routing\n width = self.vwidth[__mn[0][0]]\n hextension = int(width/2)\n vextension = self.vextension[__mn[0][0]]\n layer = self.vlayer[__mn[0][0]]\n color = self.xcolor[__mn[0][0]%self.xcolor.shape[0]]\n\n else: # horizontal routing\n width = self.hwidth[__mn[0][1]]\n hextension = self.hextension[__mn[0][1]]\n vextension = int(width/2)\n layer = self.hlayer[__mn[0][1]]\n color = self.ycolor[__mn[0][1]%self.ycolor.shape[0]] # ycolor is determined by its grid layer.\n p = laygo2.object.physical.Rect(xy=_xy, layer=layer, hextension=hextension, vextension=vextension, color=color)\n route.append(p)\n # via placement\n if via_tag is None:\n if (i > 0) and (i < mn.shape[0] - 1):\n route.append(self.via(mn=__mn[0], params=None))\n else:\n if via_tag[i + 1] == True:\n route.append(self.via(mn=__mn[1], params=None))\n if len(route) == 1: # not isinstance(mn[0][0], list):\n return route[0]\n else:\n return route","def test_parse_routes(self):\n\n params = get_params()\n estimator = LinearEstimator()\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\n model_builder = OptimizationModelBuilder(\n constraints=[CapacityConstraint()]\n )\n riders = parse_models(model_dicts=test_riders, cls=Rider)\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\n depots = parse_models(model_dicts=test_depots, cls=Depot)\n problem = problem_builder.build(riders, vehicles, depots)\n model = model_builder.build(problem)\n solution = model.solve()\n routes = Router._parse_routes(problem, solution)\n self.assertTrue(routes, msg='Routes could not be built.')\n\n for route in routes:\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\n self.assertTrue(\n len(route['stops']) > 1,\n msg='Route with single stop.'\n )","def create_url(_origin_details, travel_start_date, travel_start_time, destination_list):\n prefix = 'https://timetable.search.ch/api/route.json?one_to_many=1'\n\n origin_body = f'&from={_origin_details}&date={travel_start_date}&time={travel_start_time}'\n\n # Build iteratively with necessary syntax between destinations\n destination_body = ''\n for i, dest in enumerate(destination_list):\n destination_body = f'{destination_body}&to[{i}]={dest}'\n\n return f'{prefix}{origin_body}{destination_body}'","def main(edges=[(0, 1, 3), (1, 3, 4), (2, 3, 3), (0, 2, 2) ], num=4):\n\n # initialize routers array\n routers = []\n for x in range(num):\n routers.append([1000] * num)\n routers[x][x] = 0\n \n # set distance to all neighbours \n for edge in edges:\n routers[edge[0]][edge[1]] = edge[2]\n routers[edge[1]][edge[0]] = edge[2]\n\n start_table = routers.copy()\n\n flag = True\n while flag:\n upflag = False\n for nbrs in edges:\n routers[nbrs[0]], up_flag1 = update_table(routers[nbrs[0]], routers[nbrs[1]], dist=nbrs[2])\n routers[nbrs[1]], up_flag2 = update_table(routers[nbrs[1]], routers[nbrs[0]], dist=nbrs[2])\n upflag = upflag or up_flag1 or up_flag2\n\n flag = upflag\n\n return start_table, routers","def evaluateAllRroutes(self):\n isTrain = 1 # 1 for train, 0 for test\n\n performance = 0\n normalizedPerformance = 0\n priceTolerance = 5 # price to be tolerated\n\n normPerforms = []\n for i in range(8):\n print \"Route: {}\".format(i)\n [perfor, normaPerfor] = self.evaluateOneRouteForMultipleTimes(self.routes[i], priceTolerance)\n normPerforms.append(normaPerfor)\n performance += perfor\n normalizedPerformance += normaPerfor\n\n performance = round(performance/8, 2)\n normalizedPerformance = round(normalizedPerformance/8, 2)\n\n if self.isTrain:\n print \"\\nTRAIN:\"\n else:\n print \"\\nTEST:\"\n print \"Average Performance: {}%\".format(performance)\n print \"Average Normalized Performance: {}%\".format(normalizedPerformance)\n print \"Normalized Performance Variance: {}\".format(np.var(normPerforms))","def connection_route_from_hosts(self, ingr, egr):\n assert(ingr is not None)\n assert(egr is not None)\n LOG.info(\"Try to connection-route %s -> %s\", ingr, egr)\n\n call_id = CallID(ingr)\n try:\n cep_src = ConnectionEP(ingr)\n cep_dst = ConnectionEP(egr)\n lsp = LspParams()\n\n (wero, pero) = self.routing.connectionRoute(cep_src.ident,\n cep_dst.ident,\n call_id.ident,\n lsp.ident,\n [])\n # in any case flush the call\n self.routing.callFlush(call_id.ident)\n\n return (wero, pero)\n\n except PCERA.CannotFetchConnEndPoint, exe:\n LOG.error(\"CannotFetchConnEndPoint exception: %s\", str(exe))\n except PCERA.ConnectionParamsMismatch, exe:\n LOG.error(\"ConnectionParamsMismatch exception: %s\", str(exe))\n except PCERA.ConnectionEroMismatch, exe:\n LOG.error(\"ConnectionEroMismatch exception: %s\", str(exe))\n except PCERA.ConnectionEroMismatch, exe:\n LOG.error(\"ConnectionEroMismatch exception: %s\", str(exe))\n except PCERA.NoRoute, exe:\n LOG.error(\"NoRoute exception: %s\", str(exe))\n except PCERA.CannotFetchCall, exe:\n LOG.error(\"CannotFetchCall exception: %s\", str(exe))\n except PCERA.InternalProblems, exe:\n LOG.error(\"InternalProblems exception: %s\", str(exe))\n except Exception, exe:\n LOG.error(\"Generic exception: %s\", str(exe))\n\n return (None, None)","def get_route(start_id, dest_id, csv):\n\n # route is not computed yet\n if csv[start_id][dest_id] is None:\n return -1\n\n route = [start_id]\n\n while route[-1] != dest_id:\n # append the next node on this route\n route.append(csv[route[-1]][dest_id])\n\n return route","def writeRouteSequence(self):\n print \"writing route sequence\"\n f = open(PublicTransit.OUTFILE_NAME, 'wb')\n if (PublicTransit.LINE_FILE_TYPE == LineFileType.PTLINE):\n lines = [\";;<<PT>><<LINE>>;;\" + os.linesep]\n elif (PublicTransit.LINE_FILE_TYPE == LineFileType.TRNBUILD):\n lines = [\";;<<Trnbuild>>;;\" + os.linesep]\n\n for t in self.transitRoutes:\n if t in self.stopsByRoute:\n i = 0\n self.transitRoutes[t].nodeSequence = []\n prevLinkId = -1\n # Bus routes have a link sequence from BusRouteTraversalEdges. Others just have stops.\n if (len(self.transitRoutes[t].linkSequence) > 0):\n for link in self.transitRoutes[t].linkSequence:\n # make sure this link is within the region (i.e., it is in linksDict)\n if (link in self.linksDict):\n nodeToAppend = -1\n if (i == 0):\n nodeToAppend = self.stopsByRoute[t][0].tanaNode\n if (nodeToAppend == -1):\n if (self.linksDict[link].oneWay == \"FT\"):\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\n elif (self.linksDict[link].oneWay == \"TF\"):\n nodeToAppend = -self.linksDict[link].toNode.nodeId\n else: # open in both directions; determine traversal direction\n nodeToAppend = -self.linksDict[link].fromNode.nodeId \n elif (i == 1):\n if (len(self.transitRoutes[t].nodeSequence) > 0):\n if (self.linksDict[link].oneWay == \"FT\"):\n if (self.stopsByRoute[t][0].tanaNode != self.linksDict[link].fromNode.nodeId):\n self.transitRoutes[t].nodeSequence.append(-self.linksDict[link].fromNode.nodeId)\n nodeToAppend = -self.linksDict[link].toNode.nodeId\n elif (self.linksDict[link].oneWay == \"TF\"):\n if (self.stopsByRoute[t][0].tanaNode != self.linksDict[link].toNode.nodeId):\n self.transitRoutes[t].nodeSequence.append(-self.linksDict[link].toNode.nodeId)\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\n else: # open in both directions\n if (abs(self.transitRoutes[t].nodeSequence[0]) == self.linksDict[link].fromNode.nodeId):\n nodeToAppend = -self.linksDict[link].toNode.nodeId\n elif (abs(self.transitRoutes[t].nodeSequence[0]) == self.linksDict[link].toNode.nodeId):\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\n elif (self.transitRoutes[t].linkSequence[0] in self.linksDict and \n self.linksDict[self.transitRoutes[t].linkSequence[0]].toNode.nodeId == self.linksDict[link].fromNode.nodeId):\n self.transitRoutes[t].nodeSequence.append(-self.linksDict[link].fromNode.nodeId)\n nodeToAppend = -self.linksDict[link].toNode.nodeId\n elif (self.transitRoutes[t].linkSequence[0] in self.linksDict and \n self.linksDict[self.transitRoutes[t].linkSequence[0]].fromNode.nodeId == self.linksDict[link].toNode.nodeId):\n self.transitRoutes[t].nodeSequence.append(-self.linksDict[link].toNode.nodeId)\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\n\n elif (prevLinkId != link and prevLinkId != -1): # ensure there are no repeated links\n if (self.linksDict[link].oneWay == \"FT\"):\n if (len(self.transitRoutes[t].nodeSequence) > 0 and \n abs(self.transitRoutes[t].nodeSequence[-1]) == self.linksDict[link].fromNode.nodeId):\n nodeToAppend = -self.linksDict[link].toNode.nodeId\n elif (len(self.transitRoutes[t].nodeSequence) > 0):\n self.transitRoutes[t].nodeSequence.pop()\n if (len(self.transitRoutes[t].nodeSequence) > 0 and\n abs(self.transitRoutes[t].nodeSequence[-1]) == self.linksDict[link].fromNode.nodeId):\n nodeToAppend = -self.linksDict[link].toNode.nodeId\n\n elif (self.linksDict[link].oneWay == \"TF\"):\n if (len(self.transitRoutes[t].nodeSequence) > 0 and\n abs(self.transitRoutes[t].nodeSequence[-1]) == self.linksDict[link].toNode.nodeId):\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\n elif (len(self.transitRoutes[t].nodeSequence) > 0):\n self.transitRoutes[t].nodeSequence.pop()\n if (len(self.transitRoutes[t].nodeSequence) > 0 and\n abs(self.transitRoutes[t].nodeSequence[-1]) == self.linksDict[link].toNode.nodeId):\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\n\n else: # open in both directions\n if (len(self.transitRoutes[t].nodeSequence) > 0):\n # determine direction based on the previous node in the sequence. If the previous\n # node is the same as this link's from node, append the toNode; otherwise append the fromNode.\n if (abs(self.transitRoutes[t].nodeSequence[-1]) == \\\n self.linksDict[link].fromNode.nodeId):\n nodeToAppend = -self.linksDict[link].toNode.nodeId\n elif (abs(self.transitRoutes[t].nodeSequence[-1]) == \\\n self.linksDict[link].toNode.nodeId):\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\n # previous link doesn't connect to this because the previous link was a duplicate\n else:\n self.transitRoutes[t].nodeSequence.pop()\n if (len(self.transitRoutes[t].nodeSequence) > 0):\n # remove the last node in the sequence and check if the one before connects to this one\n if (abs(self.transitRoutes[t].nodeSequence[-1]) == \\\n self.linksDict[link].fromNode.nodeId):\n nodeToAppend = -self.linksDict[link].toNode.nodeId\n elif (abs(self.transitRoutes[t].nodeSequence[-1]) == \\\n self.linksDict[link].toNode.nodeId):\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\n\n # if the node is a stop on this route, set the node ID positive\n if (nodeToAppend != -1):\n if (i > 0 and abs(nodeToAppend) in [st.tanaNode for st in self.stopsByRoute[t]]):\n nodeToAppend = -1 * nodeToAppend\n self.transitRoutes[t].nodeSequence.append(nodeToAppend)\n prevLinkId = link\n \n i += 1\n # if the last node is not a stop, remove it\n if (len(self.transitRoutes[t].nodeSequence) > 0 and self.transitRoutes[t].nodeSequence[-1] < 0):\n del(self.transitRoutes[t].nodeSequence[-1])\n \n # if there are no links for the route, just record the stops as the nodes\n else:\n self.transitRoutes[t].nodeSequence = [n.tanaNode for n in self.stopsByRoute[t] if n.tanaNode != -1]\n \n # Only write routes with a node sequence.\n if (len(self.transitRoutes[t].nodeSequence) > 0):\n lines.append(self.__getPrintString(t, PublicTransit.LINE_FILE_TYPE) + os.linesep)\n else:\n print \"No node sequence for \" + str(t) + \" (\" + self.transitRoutes[t].new_name + \")\"\n f.writelines(lines)\n f.close()","def pairing(self):\n if len(self._paths) == 0:\n second_values = self.data\n get_flight = lambda x: x\n first = True\n else:\n second_values = self._paths\n get_flight = lambda x: x.get_last_flight()\n first = False\n\n for value in second_values:\n f1 = get_flight(value)\n for f2 in self.data:\n if f1.connects_to(f2):\n if first:\n self._paths.append(FlightPath(f1, f2))\n else:\n path_copy = copy.copy(value)\n added = path_copy.try_add(f2)\n if added:\n self._paths.append(path_copy)","def plan_trip():\n origins = []\n destinations = []\n\n origin_stop = request.args.get('origin', False)\n destination_stop = request.args.get('destination', False)\n origin_is_suburb = request.args.get('origin_suburb', False)\n dest_is_suburb = request.args.get('dest_suburb', False)\n origin_is_suburb = bool(origin_is_suburb)\n dest_is_suburb = bool(dest_is_suburb)\n if origin_stop and destination_stop:\n client = api.connection()\n origins = client.find_stops_by_name('any', origin_stop, True)\n\n if client.error == 404:\n render_template(\n \"trip-planner.jinja2\", origins=[], destinations=[], err=404\n )\n\n destinations = client.find_stops_by_name('any', destination_stop, True)\n if client.error == 404:\n render_template(\n \"trip-planner.jinja2\", origins=[], destinations=[], err=404\n )\n\n origins = stop_information_generator(\n origins.locations, [], origin_stop, origin_is_suburb\n )\n destinations = stop_information_generator(\n destinations.locations, [], destination_stop, dest_is_suburb\n )\n\n return render_template(\n \"trip-planner.jinja2\", origins=origins, destinations=destinations, err=200\n )","def __compute_unit_routes(self):\n unit_rules_graph = NearCNF.__UnitRulesGraph(self)\n unit_routes_as_trees = {var: self.__dijkstra_max_prob_tree(unit_rules_graph, var)\n for var in unit_rules_graph.vertices}\n\n def tree_to_lists(root, current_route=[], routes=None):\n if routes is None:\n routes = []\n current_route.append(root.key)\n if not root.children:\n routes.append(current_route[:])\n else:\n for child in root.children:\n tree_to_lists(child, current_route, routes)\n current_route.pop()\n return routes\n\n unit_routes_as_lists = {var: tree_to_lists(tree.root)\n for var, tree in unit_routes_as_trees.items()}\n return unit_routes_as_lists","def prepare_gates(chip, source_gate, target_gate):\n crossroad = []\n travelled_path = []\n\n # Source and target always on z-axis 0\n source_coords = [chip.gates[source_gate][\"x\"], chip.gates[source_gate][\"y\"], 0]\n target_coords = [chip.gates[target_gate][\"x\"], chip.gates[target_gate][\"y\"], 0]\n\n chip = calculate_distance(target_coords, chip)\n\n start = chip.coordinates[0][source_coords[1]][source_coords[0]]\n start_node = nd.Node(source_coords, None, 1, start.cost + start.distance_to_goal)\n goal_node = nd.Node(target_coords, None, 1, 0)\n crossroad.append(start_node)\n\n return run_algorithm(target_coords, start_node, goal_node, chip, crossroad, travelled_path)","def bus_routes_direction():\n route_list = []\n os.chdir(\"../Data\")\n for file in glob.glob(\"*.csv\"):\n print(file) #useful for monitoring progress of function\n reader = csv.reader(open(file))\n for line in reader:\n route = extract_route_and_direction(line[3]) # Journey ID field\n if route not in route_list and route != \"\": # error handling for extract_bus_routes function\n route_list.append(route)\n return route_list","def connect(data, x1, y1, x2, y2):\n flag1, points1 = oneRoadConnect(data, x1, y1, x2, y2)\n if flag1:\n return flag1, points1\n flag2, points2 = twoRoadConnect(data, x1, y1, x2, y2)\n if flag2:\n return flag2, points2\n flag3, points3 = threeRoadConnect(data, x1, y1, x2, y2)\n if flag3:\n return flag3, points3\n return False, []","def routes(x, y, results_dict):\n if (x, y) in results_dict: # if the value is already in the results cache then we don't need to calculate again\n return results_dict[(x, y)]\n\n # we only look at the top half of the grid\n # (as if you swap moves right/down you get equivalent number of paths)\n elif x > y:\n r = routes(y, x, results_dict)\n\n elif x == 0:\n return 1 # only one path when x coordinate is 0\n\n # from any one point you can either go down or left, then the sum of the positions gives the total for the original\n else:\n r = routes(x - 1, y, results_dict) + routes(x, y - 1, results_dict)\n results_dict[(x, y)] = r\n return r","def lookup_routes(self, daddr):\n outroutes = []\n for entry in self.routes:\n for varat in entry[\"varats\"]:\n ip = varat[\"network\"].split(\".\")\n netmask = varat[\"netmask\"].split(\".\")\n\n mask_bit = \"\".join([ format(int(quad), \"08b\") for quad in netmask ])\n num_ones = mask_bit.count(\"1\")\n ip_bin = \"\".join([ format(int(quad), \"08b\") for quad in ip ])\n ip_start = ip_bin[:num_ones]\n daddr_bin = \"\".join([ format(int(quad), \"08b\") for quad in daddr.split(\".\") ])\n if daddr_bin.startswith(ip_start):\n outroutes.append({\"peer\": entry[\"peer\"], \"us\": entry[\"us\"], \"ghoti\": num_ones, \"msg\": varat})\n\n #print(\"outroutessssssssssssssssssssss\", outroutes)\n return outroutes","def run(self):\n source = str(self.form.source_text.toPlainText())\n dest = str(self.form.destination_text.toPlainText())\n \n self.form.source_text.clear()\n self.form.destination_text.clear()\n \n if not source or not dest:\n self.show_dialog(\"Empty argument.\")\n return \n\n \n if self.G.has_node(source) and self.G.has_node(dest):\n if source in nx.algorithms.descendants(self.G, dest):\n graph = nx.to_dict_of_dicts(self.G) # converting to dict based graph.\n dijkstra = Dijkstra(graph)\n parents, visited = dijkstra.find_route(source, dest)\n shortest_path = dijkstra.generate_path(parents, source, dest)\n shortest_path = \" -> \".join(shortest_path)\n result = f\"Distance is {visited[dest]} units.\\nShortest path from {source} to {dest} is {shortest_path}\"\n self.form.result_text.setText(result)\n else:\n self.show_dialog(f\"There is no connection between {source} and {dest}.\")\n else:\n self.show_dialog(f\"Please check source and destination.\")","def solve_tsp(list_of_locations, list_of_homes, starting_car_location, adjacency_matrix, params=[]):\n drop_off_dict = {}\n car_path = []\n home_map = {}\n home_indexes = convert_locations_to_indices(list_of_homes, list_of_locations)\n\n start = list_of_locations.index(starting_car_location)\n graph, msg = adjacency_matrix_to_graph(adjacency_matrix)\n all_paths = dict(nx.all_pairs_dijkstra(graph))\n\n start_in_home = start in home_indexes\n if start in home_indexes:\n home_indexes.remove(start)\n home_indexes.insert(0, start)\n home_count = 0;\n\n for home in home_indexes:\n #print(home, end = \" \")\n home_map[home_count] = home\n home_count += 1\n # Instantiate the data problem.\n #print(len(home_map))\n data = create_data_model(home_indexes, 0)\n\n # Create the routing index manager.\n manager = pywrapcp.RoutingIndexManager(len(data['locations']),\n data['num_vehicles'], data['depot'])\n\n #print(manager.NodeToIndex(15))\n # Create Routing Model.\n routing = pywrapcp.RoutingModel(manager)\n\n def distance_callback(from_index, to_index):\n \"\"\"Returns the distance between the two nodes.\"\"\"\n # Convert from routing variable Index to distance matrix NodeIndex.\n #print(home_map[to_index], end = \" \")\n from_index = manager.IndexToNode(from_index)\n to_index = manager.IndexToNode(to_index)\n dist_to = all_paths.get(home_map[from_index])[0][home_map[to_index]]\n #if from_index >= 25 or to_index >= 25:\n # print(\"from\" if from_index >= 25 else \"to\", end = \" \")\n #dist_to = all_paths[from_index][0][to_index]\n return dist_to\n\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\n\n # Define cost of each arc.\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\n\n # Setting first solution heuristic.\n \"\"\"\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\n search_parameters.first_solution_strategy = (\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\n \"\"\"\n\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\n search_parameters.local_search_metaheuristic = (\n routing_enums_pb2.LocalSearchMetaheuristic.GUIDED_LOCAL_SEARCH)\n search_parameters.time_limit.seconds = 3\n #search_parameters.log_search = True\n\n # Solve the problem.\n assignment = routing.SolveWithParameters(search_parameters)\n\n # if assignment:\n # print_solution(manager, routing, assignment)\n # Print solution on console.\n\n if start in home_indexes:\n drop_off_dict[start] = [start]\n\n\n index = routing.Start(0)\n car_path.append(start)\n\n while not routing.IsEnd(index):\n previous_index = manager.IndexToNode(index)\n index = assignment.Value(routing.NextVar(index))\n\n car_path.pop();\n to_index = manager.IndexToNode(index)\n path_to = all_paths.get(home_map[previous_index])[1][home_map[to_index]]\n drop_off_dict[home_map[to_index]] = [home_map[to_index]]\n #print(to_index, end = ' ')\n car_path.extend(path_to)\n #route_distance += routing.GetArcCostForVehicle(previous_index, index, 0)\n # for i in car_path:\n # print(i)\n if start in drop_off_dict.keys() and not start_in_home:\n drop_off_dict.pop(start, None)\n\n return car_path, drop_off_dict","def get_bundle_corner(\n ports1: List[Port],\n ports2: List[Port],\n route_filter: Callable[..., Route] = get_route_from_waypoints,\n separation: float = 5.0,\n path_length_match_loops: int = None,\n path_length_match_extra_length: float = 0.0,\n path_length_match_modify_segment_i: int = -2,\n **kwargs,\n) -> List[Route]:\n if \"straight\" in kwargs.keys():\n _ = kwargs.pop(\"straight\")\n\n routes = _get_bundle_corner_waypoints(\n ports1,\n ports2,\n routing_func=generate_manhattan_waypoints,\n separation=separation,\n **kwargs,\n )\n if path_length_match_loops:\n routes = [np.array(route) for route in routes]\n routes = path_length_matched_points(\n routes,\n extra_length=path_length_match_extra_length,\n nb_loops=path_length_match_loops,\n modify_segment_i=path_length_match_modify_segment_i,\n **kwargs,\n )\n\n return [route_filter(r, **kwargs) for r in routes]","def skyroute(startroute, endroute, grid):\n # Find the start and end point\n start = startroute[-1]\n end = endroute[-1]\n path = astar(grid, start, end)\n\n # If a path is found, stitch the routes together\n if path != None: \n for location in reversed(startroute[:-1]):\n path.insert(0, location)\n\n for location in reversed(endroute[:-1]):\n path.insert(len(path), location)\n\n return path","def __dfs_roads_directions(self, with_prints=False) -> Set[JuncRoadSingleConnection]:\n\n roads: Set[JuncRoadSingleConnection] = set()\n visited_indices: Set[JuncIndices] = set()\n\n def dfs_rec(junc: JuncNode):\n \"\"\"\n recursively run from the input junction\n :param junc: the junction to run from\n \"\"\"\n # add to visited\n visited_indices.add(junc.indices)\n # run on neighbors\n for neighbor in self.get_connected_juncs(junc):\n # go over unvisited juncs and add roads to them from current\n if neighbor.indices not in visited_indices:\n if with_prints:\n print(junc.indices, neighbor.indices)\n directions = self.get_connection_directions(junc, neighbor)\n roads.add(JuncRoadSingleConnection(junc.indices, neighbor.indices, directions[0], directions[1]))\n dfs_rec(neighbor)\n \"\"\"\n there is a case where we are currently at junc 1, which has neighbors 2,3.\n from junc 1 wwe move to 2, that moves to 3 from it.\n 3 will not go to 1 because 1 is visited, so the road 3->1 will not be created.\n when returning to 1, it will not go to 3, because 3 is visited, so the road 1->3 will not be created.\n so we result in a conncetion with no road, fix it:\n \"\"\"\n if neighbor.indices in visited_indices \\\n and JuncRoadSingleConnection(junc.indices, neighbor.indices) not in roads \\\n and JuncRoadSingleConnection(neighbor.indices, junc.indices) not in roads:\n if with_prints:\n print(\"special\", junc.indices, neighbor.indices)\n directions = self.get_connection_directions(junc, neighbor)\n roads.add(JuncRoadSingleConnection(junc.indices, neighbor.indices, directions[0], directions[1]))\n # do not call dfs recursivly\n\n def first_node(junc: JuncNode):\n \"\"\"\n run specifically for a group-start junction\n :param junc: a junction that is the first in a connected group\n \"\"\"\n # add to visited\n visited_indices.add(junc.indices)\n #\n \"\"\"\n first, choose a random road to be in-road. this prevents a first node with only out-roads.\n a problem: if this is not the first first_node, it is possible that the random road will be \n an already existing road, in the otehr direction. so we need to make sure that the random road we choose\n is not already set in the other side.\n \"\"\"\n neighbors = self.get_connected_juncs(junc).copy()\n in_checked_indices: Set[JuncIndices] = set()\n in_road_junc = choice(neighbors)\n in_checked_indices.add(in_road_junc.indices)\n while JuncRoadSingleConnection(junc.indices, in_road_junc.indices) in roads and len(\n in_checked_indices) != len(neighbors):\n in_road_junc = choice(neighbors)\n in_checked_indices.add(in_road_junc.indices)\n if len(in_checked_indices) != len(neighbors):\n # regular stop, we have found a road to be in_road.\n directions = self.get_connection_directions(in_road_junc, junc)\n roads.add(JuncRoadSingleConnection(in_road_junc.indices, junc.indices, directions[0], directions[1]))\n if with_prints:\n print(\"first in-road\", in_road_junc.indices, junc.indices)\n # run for the rest of the neighbors\n neighbors.remove(in_road_junc)\n # else, this junc has only out-roads and this cannot be fixed.\n for neighbor in neighbors:\n if neighbor.indices not in visited_indices: # the other case is handled through the neighbor in dfs_rec\n if with_prints:\n print(\"first\", junc.indices, neighbor.indices)\n directions = self.get_connection_directions(junc, neighbor)\n roads.add(JuncRoadSingleConnection(junc.indices, neighbor.indices, directions[0], directions[1]))\n dfs_rec(neighbor)\n\n all_juncs_indices: Set[JuncIndices] = {junc.indices for junc in self.get_all_juncs()}\n # the graph may not be connected, should run until all connected parts are visited\n while len(all_juncs_indices) != len(visited_indices):\n # now choose a junc and run on it.\n start_junc = self.get_junc(sample(all_juncs_indices.difference(visited_indices), 1)[0])\n first_node(start_junc)\n return roads","def calculate_routes(outposts, vehicles, graph, starting_point=0, **kwargs):\n number_of_vehicles = len(vehicles)\n number_of_nodes = len(outposts) - 1\n\n # Source: https://stackoverflow.com/questions/28965734/general-bars-and-stars\n vehicles_partitions = []\n total_load = outposts.load.sum()\n capacities = list(vehicles.capacity)\n for combination in itertools.combinations(range(number_of_nodes+number_of_vehicles-1), number_of_vehicles-1):\n current_partition = [b-a-1 for a, b in zip((-1,) + combination, combination+(number_of_nodes+number_of_vehicles-1,))]\n current_partition = sorted(current_partition)\n if current_partition not in vehicles_partitions:\n vehicle_presence_vector = [0 if number==0 else 1 for number in current_partition]\n total_capacity = np.dot(vehicle_presence_vector, capacities)\n if total_capacity >= total_load:\n vehicles_partitions.append(current_partition)\n\n dwave_solver = DWaveEngine.default()\n if 'use_capacity_constraints' in kwargs:\n use_capacity_constraints = kwargs['use_capacity_constraints']\n del kwargs['use_capacity_constraints']\n else:\n use_capacity_constraints = True\n print(\"All partitions:\", vehicles_partitions)\n best_solution = None\n for current_partition in vehicles_partitions:\n print(\"Current partition: \", current_partition)\n problem = Problem(vehicles=vehicles,\n outposts=outposts,\n vehicles_partition=current_partition,\n graph=graph,\n starting_point=starting_point,\n use_capacity_constraints=use_capacity_constraints)\n current_solution = dwave_solver.solve(problem)\n if current_solution is None:\n print(\"No valid solutions found with D-Wave\")\n elif best_solution is None:\n best_solution = current_solution\n else:\n current_cost = sum(sub_solution[2] for sub_solution in current_solution)\n best_cost = best_solution.total_cost\n if current_cost < best_cost:\n best_solution = current_solution\n\n if best_solution is None:\n return None\n return best_solution.to_dataframe()","def launch_parallel_rt_pairs():\r\n # Create the parser\r\n parser = argparse.ArgumentParser(description=globals().get(\"__doc__\", \"\"), fromfile_prefix_chars='@')\r\n\r\n # Define Arguments supported by the command line utility\r\n\r\n # --pair-type parameter\r\n help_string = \"The type of origin-destination pair assignment to use. Either one_to_one or many_to_many.\"\r\n parser.add_argument(\"-pt\", \"--pair-type\", action=\"store\", dest=\"pair_type_str\", help=help_string, required=True)\r\n\r\n # --origins parameter\r\n help_string = \"The full catalog path to the feature class containing the origins.\"\r\n parser.add_argument(\"-o\", \"--origins\", action=\"store\", dest=\"origins\", help=help_string, required=True)\r\n\r\n # --origins-id-field parameter\r\n help_string = \"The name of the unique ID field in origins.\"\r\n parser.add_argument(\r\n \"-oif\", \"--origins-id-field\", action=\"store\", dest=\"origin_id_field\", help=help_string, required=True)\r\n\r\n # --destinations parameter\r\n help_string = \"The full catalog path to the feature class containing the destinations.\"\r\n parser.add_argument(\"-d\", \"--destinations\", action=\"store\", dest=\"destinations\", help=help_string, required=True)\r\n\r\n # --destinations-id-field parameter\r\n help_string = \"The name of the unique ID field in destinations.\"\r\n parser.add_argument(\r\n \"-dif\", \"--destinations-id-field\", action=\"store\", dest=\"dest_id_field\", help=help_string, required=True)\r\n\r\n # --network-data-source parameter\r\n help_string = \"The full catalog path to the network dataset or a portal url that will be used for the analysis.\"\r\n parser.add_argument(\r\n \"-n\", \"--network-data-source\", action=\"store\", dest=\"network_data_source\", help=help_string, required=True)\r\n\r\n # --travel-mode parameter\r\n help_string = (\r\n \"The name or JSON string representation of the travel mode from the network data source that will be used for \"\r\n \"the analysis.\"\r\n )\r\n parser.add_argument(\"-tm\", \"--travel-mode\", action=\"store\", dest=\"travel_mode\", help=help_string, required=True)\r\n\r\n # --time-units parameter\r\n help_string = \"String name of the time units for the analysis. These units will be used in the output.\"\r\n parser.add_argument(\"-tu\", \"--time-units\", action=\"store\", dest=\"time_units\", help=help_string, required=True)\r\n\r\n # --distance-units parameter\r\n help_string = \"String name of the distance units for the analysis. These units will be used in the output.\"\r\n parser.add_argument(\r\n \"-du\", \"--distance-units\", action=\"store\", dest=\"distance_units\", help=help_string, required=True)\r\n\r\n # --max-routes parameter\r\n help_string = \"Maximum number of routes that can be in one chunk for parallel processing of Route solves.\"\r\n parser.add_argument(\r\n \"-mr\", \"--max-routes\", action=\"store\", dest=\"max_routes\", type=int, help=help_string, required=True)\r\n\r\n # --max-processes parameter\r\n help_string = \"Maximum number parallel processes to use for the Route solves.\"\r\n parser.add_argument(\r\n \"-mp\", \"--max-processes\", action=\"store\", dest=\"max_processes\", type=int, help=help_string, required=True)\r\n\r\n # --reverse-direction parameter\r\n help_string = \"Whether to reverse the direction of travel (destination to origin).\"\r\n parser.add_argument(\r\n \"-rd\", \"--reverse-direction\", action=\"store\", type=lambda x: bool(strtobool(x)),\r\n dest=\"reverse_direction\", help=help_string, required=True)\r\n\r\n # --out-routes parameter\r\n help_string = \"The full catalog path to the output routes feature class.\"\r\n parser.add_argument(\"-r\", \"--out-routes\", action=\"store\", dest=\"out_routes\", help=help_string, required=True)\r\n\r\n # --scratch-folder parameter\r\n help_string = \"The full catalog path to the scratch folder where intermediate outputs will be stored.\"\r\n parser.add_argument(\r\n \"-sf\", \"--scratch-folder\", action=\"store\", dest=\"scratch_folder\", help=help_string, required=True)\r\n\r\n # --assigned-dest-field parameter\r\n help_string = (\"The name of the field in origins indicating the assigned destination. \"\r\n \"Required for one_to_one pair-type\")\r\n parser.add_argument(\r\n \"-adf\", \"--assigned-dest-field\", action=\"store\", dest=\"assigned_dest_field\", help=help_string, required=False)\r\n\r\n # --od-pair-table parameter\r\n help_string = \"CSV file holding preassigned OD pairs. Required for many_to_many pair-type.\"\r\n parser.add_argument(\r\n \"-odp\", \"--od-pair-table\", action=\"store\", dest=\"od_pair_table\", help=help_string, required=False)\r\n\r\n # --time-of-day parameter\r\n help_string = (f\"The time of day for the analysis. Must be in {helpers.DATETIME_FORMAT} format. Set to None for \"\r\n \"time neutral.\")\r\n parser.add_argument(\"-tod\", \"--time-of-day\", action=\"store\", dest=\"time_of_day\", help=help_string, required=False)\r\n\r\n # --barriers parameter\r\n help_string = \"A list of catalog paths to the feature classes containing barriers to use in the Route.\"\r\n parser.add_argument(\r\n \"-b\", \"--barriers\", action=\"store\", dest=\"barriers\", help=help_string, nargs='*', required=False)\r\n\r\n try:\r\n # Get arguments as dictionary.\r\n args = vars(parser.parse_args())\r\n\r\n # Initialize a parallel Route calculator class\r\n rt_calculator = ParallelRoutePairCalculator(**args)\r\n # Solve the Route in parallel chunks\r\n start_time = time.time()\r\n rt_calculator.solve_route_in_parallel()\r\n LOGGER.info(f\"Parallel Route calculation completed in {round((time.time() - start_time) / 60, 2)} minutes\")\r\n\r\n except Exception: # pylint: disable=broad-except\r\n LOGGER.error(\"Error in parallelization subprocess.\")\r\n errs = traceback.format_exc().splitlines()\r\n for err in errs:\r\n LOGGER.error(err)\r\n raise","def dist(a, b):\n base_url=\"https://route.api.here.com/routing/7.2/calculateroute.json?\"\n payload = {'app_id':HERE_ID, \n 'app_code':HERE_CODE,\n 'waypoint0':'geo!'+','.join([str(i) for i in a]),\n 'waypoint1':'geo!'+','.join([str(i) for i in b]),\n 'mode':'fastest;car;traffic:disabled',\n }\n resp = requests.get(base_url, params=payload)\n data = json.loads(resp.content)\n #import ipdb; ipdb.set_trace()\n summary = data['response']['route'][0]['summary']\n return {\"distance\" : summary['distance'], \n \"trafficTime\" : summary[\"trafficTime\"],\n \"baseTime\" : summary[\"baseTime\"]}","def get_self_origin(self, routes):\n outroutes = []\n if len(routes) == 0:\n return routes\n\n for route in routes:\n if route[\"msg\"][\"selfOrigin\"]:\n outroutes.append(route)\n \n if len(outroutes) == 0:\n outroutes = routes\n \n return outroutes","def Option3_routing(self, S, D, L):\n if self.has_path(S, D): \n Shortest_path = nx.dijkstra_path(self.G, S, D, weight='w') \n Opt_path = Shortest_path\n path_cost_with_concave_function = self.calculate_path_cost_with_concave_function(Shortest_path, 'c1', 'c2')\n return path_cost_with_concave_function, Opt_path\n while len(Shortest_path) != 0:\n path_cost = self.additive_path_cost(Shortest_path, 'w') \n #self.logger.info('Path cost - %d', path_cost)\n if path_cost <= L:\n \"\"\"go to path cost with weighted sum\"\"\"\n path_cost_with_concave_function = self.calculate_path_cost_with_concave_function(Shortest_path, 'c1', 'c2')\n self.G = self.rm_edge_constraint(path_cost_with_concave_function) # remove all links where the concave link is greater than PathConcave_cost \n Opt_path = Shortest_path\n if self.has_path(S, D):\n Shortest_path = nx.dijkstra_path(self.G, S, D, weight='w')\n else:\n Shortest_path = [] \n else:\n break \n else:\n self.logger.info('No path from %s to %s', S, D)\n Opt_path = []\n path_cost_with_concave_function = 0\n return path_cost_with_concave_function, Opt_path","def _map(inputs, n_units, connection_type):\n\tif len(inputs) == n_units:\n\t\toutput = [[inputs[i-1],inputs[i]] for i in range(n_units)]\n\telif len(inputs) < n_units:\n\t\toutput = []\n\t\tinput_dim = len(inputs)\n\t\t#Units that can connect staight forwards\n\t\toutput = [[inputs[i-1],inputs[i]] for i in range(input_dim)]\n\t\tn_units -= input_dim\n\t\tcurrent_input_index = 0\n\t\t#Begin successively connecting units to the least conneceted input\n\t\twhile n_units > 0:\n\t\t\toutput.append([inputs[current_input_index], inputs[current_input_index]])\n\t\t\tn_units -= 1\n\t\t\tcurrent_input_index += 1\n\t\t\t#Run to end of list --> All units are equally connected. (Got to beginning)\n\t\t\tif current_input_index == input_dim:\n\t\t\t\tcurrent_input_index = 0\n\telse: #(len(inputs) > n_units)\n\t\tcollpase_units = len(inputs) - n_units\n\t\tif n_units == 1:\n\t\t\tpass\n\t\telif collpase_units % 2 == 1:\n\t\t\traise ValueError('Must be an even difference between previous layer and next layer')\n\t\toutput = [[inputs[2*i],inputs[2*i + 1]] for i in range(collpase_units)]\n\t\tfor i in range(2*collpase_units, n_units):\n\t\t\tif i == 2*collpase_units:\n\t\t\t\toutput.append([inputs[-1],inputs[i]])\n\t\t\telse:\n\t\t\t\toutput.append([inputs[i-1],inputs[i]])\n\tif connection_type == 'shuffle':\n\t\treturn _shuffle(output)\n\telse:\n\t\treturn output","def routing_step(self, layout: dict, circuit: Circuit):\n\n _, final_mapping = self.routing_algorithm(circuit, layout)\n return final_mapping","def _route_to_dest(self):\n # Ask the network\n self.route = self.network.determine_route(self.start, self.dest)\n # Set the index to where we are now\n self.route_index = 0"],"string":"[\n \"def solve_route_in_parallel(self):\\r\\n # Validate Route settings. Essentially, create a dummy Route class instance and set up the\\r\\n # solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes\\r\\n # that are guaranteed to all fail.\\r\\n self._validate_route_settings()\\r\\n\\r\\n # Check if the input origins and destinations have any fields we should use in the route analysis\\r\\n self._populate_input_data_transfer_fields()\\r\\n\\r\\n # Compute Route in parallel\\r\\n LOGGER.info(f\\\"Beginning parallelized Route solves ({self.total_jobs} chunks)\\\")\\r\\n completed_jobs = 0 # Track the number of jobs completed so far to use in logging\\r\\n # Use the concurrent.futures ProcessPoolExecutor to spin up parallel processes that solve the routes\\r\\n with futures.ProcessPoolExecutor(max_workers=self.max_processes) as executor:\\r\\n # Each parallel process calls the solve_route() function with the rt_inputs dictionary for the\\r\\n # given origin ranges and their assigned destinations.\\r\\n jobs = {executor.submit(solve_route, self.rt_inputs, range): range for range in self.chunks}\\r\\n # As each job is completed, add some logging information and store the results to post-process later\\r\\n for future in futures.as_completed(jobs):\\r\\n try:\\r\\n # The Route job returns a results dictionary. Retrieve it.\\r\\n result = future.result()\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # If we couldn't retrieve the result, some terrible error happened and the job errored.\\r\\n # Note: This does not mean solve failed. It means some unexpected error was thrown. The most likely\\r\\n # causes are:\\r\\n # a) If you're calling a service, the service was temporarily down.\\r\\n # b) You had a temporary file read/write or resource issue on your machine.\\r\\n # c) If you're actively updating the code, you introduced an error.\\r\\n # To make the tool more robust against temporary glitches, retry submitting the job up to the number\\r\\n # of times designated in helpers.MAX_RETRIES. If the job is still erroring after that many retries,\\r\\n # fail the entire tool run.\\r\\n errs = traceback.format_exc().splitlines()\\r\\n failed_range = jobs[future]\\r\\n LOGGER.debug((\\r\\n f\\\"Failed to get results for Route chunk {failed_range} from the parallel process. Will retry \\\"\\r\\n f\\\"up to {helpers.MAX_RETRIES} times. Errors: {errs}\\\"\\r\\n ))\\r\\n job_failed = True\\r\\n num_retries = 0\\r\\n while job_failed and num_retries < helpers.MAX_RETRIES:\\r\\n num_retries += 1\\r\\n try:\\r\\n future = executor.submit(solve_route, self.rt_inputs, failed_range)\\r\\n result = future.result()\\r\\n job_failed = False\\r\\n LOGGER.debug(f\\\"Route chunk {failed_range} succeeded after {num_retries} retries.\\\")\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # Update exception info to the latest error\\r\\n errs = traceback.format_exc().splitlines()\\r\\n if job_failed:\\r\\n # The job errored and did not succeed after retries. Fail the tool run because something\\r\\n # terrible is happening.\\r\\n LOGGER.debug(f\\\"Route chunk {failed_range} continued to error after {num_retries} retries.\\\")\\r\\n LOGGER.error(\\\"Failed to get Route result from parallel processing.\\\")\\r\\n errs = traceback.format_exc().splitlines()\\r\\n for err in errs:\\r\\n LOGGER.error(err)\\r\\n raise\\r\\n\\r\\n # If we got this far, the job completed successfully and we retrieved results.\\r\\n completed_jobs += 1\\r\\n LOGGER.info(\\r\\n f\\\"Finished Route calculation {completed_jobs} of {self.total_jobs}.\\\")\\r\\n\\r\\n # Parse the results dictionary and store components for post-processing.\\r\\n if result[\\\"solveSucceeded\\\"]:\\r\\n self.route_fcs.append(result[\\\"outputRoutes\\\"])\\r\\n else:\\r\\n # Typically, a solve fails because no destinations were found for any of the origins in the chunk,\\r\\n # and this is a perfectly legitimate failure. It is not an error. However, they may be other, less\\r\\n # likely, reasons for solve failure. Write solve messages to the main GP message thread in debug\\r\\n # mode only in case the user is having problems. The user can also check the individual OD log\\r\\n # files.\\r\\n LOGGER.debug(f\\\"Solve failed for job id {result['jobId']}.\\\")\\r\\n LOGGER.debug(result[\\\"solveMessages\\\"])\\r\\n\\r\\n # Post-process outputs\\r\\n if self.route_fcs:\\r\\n LOGGER.info(\\\"Post-processing Route results...\\\")\\r\\n self.route_fcs = sorted(self.route_fcs)\\r\\n self._post_process_route_fcs()\\r\\n else:\\r\\n LOGGER.warning(\\\"All Route solves failed, so no output was produced.\\\")\\r\\n\\r\\n # Clean up\\r\\n # Delete the job folders if the job succeeded\\r\\n if DELETE_INTERMEDIATE_OUTPUTS:\\r\\n LOGGER.info(\\\"Deleting intermediate outputs...\\\")\\r\\n try:\\r\\n shutil.rmtree(self.scratch_folder, ignore_errors=True)\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # If deletion doesn't work, just throw a warning and move on. This does not need to kill the tool.\\r\\n LOGGER.warning(f\\\"Unable to delete intermediate Route output folder {self.scratch_folder}.\\\")\\r\\n\\r\\n LOGGER.info(\\\"Finished calculating Routes.\\\")\",\n \"def compute_waypoints(self, source_loc, destination_loc):\\n start_waypoint = self._map.get_waypoint(\\n source_loc,\\n project_to_road=True,\\n lane_type=carla.LaneType.Driving)\\n end_waypoint = self._map.get_waypoint(\\n destination_loc,\\n project_to_road=True,\\n lane_type=carla.LaneType.Driving)\\n assert start_waypoint and end_waypoint, 'Map could not find waypoints'\\n route = self._grp.trace_route(\\n start_waypoint.transform.location,\\n end_waypoint.transform.location)\\n # TODO(ionel): The planner returns several options in intersections.\\n # We always take the first one, but this is not correct.\\n return deque([to_pylot_transform(waypoint[0].transform)\\n for waypoint in route])\",\n \"def compute_travel_cost_adjlist(\\n origins, destinations, network, index_orig=None, index_dest=None\\n):\\n\\n # NOTE: need to add an option/check for symmetric networks so we only need half the routing calls\\n\\n origins = origins.copy()\\n destinations = destinations.copy()\\n\\n origins[\\\"osm_ids\\\"] = network.get_node_ids(\\n origins.centroid.x, origins.centroid.y\\n ).astype(int)\\n destinations[\\\"osm_ids\\\"] = network.get_node_ids(\\n destinations.centroid.x, destinations.centroid.y\\n ).astype(int)\\n\\n ods = []\\n\\n if not index_orig:\\n origins[\\\"idx\\\"] = origins.index.values\\n index_orig = \\\"idx\\\"\\n if not index_dest:\\n destinations[\\\"idx\\\"] = destinations.index.values\\n index_dest = \\\"idx\\\"\\n\\n # I dont think there's a way to do this in parallel, so we can at least show a progress bar\\n with tqdm(total=len(origins[\\\"osm_ids\\\"])) as pbar:\\n for origin in origins[\\\"osm_ids\\\"]:\\n df = pd.DataFrame()\\n df[\\\"cost\\\"] = network.shortest_path_lengths(\\n [origin for d in destinations[\\\"osm_ids\\\"]],\\n [d for d in destinations[\\\"osm_ids\\\"]],\\n )\\n df[\\\"destination\\\"] = destinations[index_dest].values\\n df[\\\"origin\\\"] = origins[origins.osm_ids == origin][index_orig].values[0]\\n\\n ods.append(df)\\n pbar.update(1)\\n\\n combined = pd.concat(ods)\\n # reorder the columns\\n return combined[['origin', 'destination', 'cost']]\",\n \"def _insert_stops_one_to_one(self): # pylint: disable=too-many-locals\\r\\n # Use an insertCursor to insert Stops into the Route analysis\\r\\n destinations = {}\\r\\n destination_rows = []\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.origin_unique_id_field_name, \\\"SHAPE@\\\", self.dest_unique_id_field_name] +\\r\\n self.origin_transfer_fields\\r\\n ) as icur:\\r\\n # Loop through origins and insert them into Stops along with their assigned destinations\\r\\n for origin in arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_origins_layer,\\r\\n [\\\"SHAPE@\\\", self.origin_id_field, self.assigned_dest_field] + self.origin_transfer_fields\\r\\n ):\\r\\n dest_id = origin[2]\\r\\n if dest_id is None:\\r\\n continue\\r\\n if dest_id not in destinations:\\r\\n dest_val = f\\\"'{dest_id}'\\\" if isinstance(dest_id, str) else dest_id\\r\\n with arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_destinations_layer,\\r\\n [\\\"SHAPE@\\\", self.dest_id_field] + self.destination_transfer_fields,\\r\\n where_clause=f\\\"{self.dest_id_field} = {dest_val}\\\"\\r\\n ) as cur:\\r\\n try:\\r\\n destinations[dest_id] = next(cur)\\r\\n except StopIteration:\\r\\n # The origin's destination is not present in the destinations table. Just skip the origin.\\r\\n continue\\r\\n # Insert origin and destination\\r\\n destination = destinations[dest_id]\\r\\n if self.reverse_direction:\\r\\n route_name = f\\\"{dest_id} - {origin[1]}\\\"\\r\\n origin_sequence = 2\\r\\n destination_sequence = 1\\r\\n else:\\r\\n route_name = f\\\"{origin[1]} - {dest_id}\\\"\\r\\n origin_sequence = 1\\r\\n destination_sequence = 2\\r\\n # Define the final origin and destination rows for the input Stops\\r\\n origin_row = [route_name, origin_sequence, origin[1], origin[0], None] + list(origin)[3:]\\r\\n destination_row = [route_name, destination_sequence, None, destination[0], destination[1]] + \\\\\\r\\n list(destination)[2:]\\r\\n icur.insertRow(origin_row)\\r\\n destination_rows.append(destination_row)\\r\\n\\r\\n # Insert destinations\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.origin_unique_id_field_name, \\\"SHAPE@\\\", self.dest_unique_id_field_name] +\\r\\n self.destination_transfer_fields\\r\\n ) as dcur:\\r\\n for row in destination_rows:\\r\\n dcur.insertRow(row)\",\n \"def solve_route(inputs, chunk):\\r\\n rt = Route(**inputs)\\r\\n if inputs[\\\"pair_type\\\"] is helpers.PreassignedODPairType.one_to_one:\\r\\n rt.logger.info(f\\\"Processing origins OID {chunk[0]} to {chunk[1]} as job id {rt.job_id}\\\")\\r\\n elif inputs[\\\"pair_type\\\"] is helpers.PreassignedODPairType.many_to_many:\\r\\n rt.logger.info(f\\\"Processing chunk {chunk[0]} as job id {rt.job_id}\\\")\\r\\n rt.solve(chunk)\\r\\n rt.teardown_logger()\\r\\n return rt.job_result\",\n \"def traveling_salesman(destinations_1):\\n # Instantiate the data problem.\\n data = create_data_model()\\n\\n # NEW SPOT TO MAKE distance_matrix\\n distance_matrix = compute_euclidean_distance_matrix(destinations_1)\\n manager = pywrapcp.RoutingIndexManager(\\n len(destinations_1), data['num_vehicles'], data['depot'])\\n\\n# # Create the routing index manager.\\n# manager = pywrapcp.RoutingIndexManager(\\n# len(data['locations']), data['num_vehicles'], data['depot'])\\n\\n # Create Routing Model.\\n routing = pywrapcp.RoutingModel(manager)\\n\\n# distance_matrix = compute_euclidean_distance_matrix(data['locations'])\\n\\n def distance_callback(from_index, to_index):\\n \\\"\\\"\\\"Returns the distance between the two nodes.\\\"\\\"\\\"\\n # Convert from routing variable Index to distance matrix NodeIndex.\\n from_node = manager.IndexToNode(from_index)\\n to_node = manager.IndexToNode(to_index)\\n return distance_matrix[from_node][to_node]\\n\\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\\n\\n # Define cost of each arc.\\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\\n\\n # Setting first solution heuristic.\\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\\n search_parameters.first_solution_strategy = (\\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\\n\\n # Solve the problem.\\n assignment = routing.SolveWithParameters(search_parameters)\\n\\n # Print solution on console.\\n# if assignment:\\n# print_solution(manager, routing, assignment)\\n if assignment:\\n address1,address2,address3,address4,address5,address6,address7,address8,address9,address10=\\\\\\n set_address_path(manager, routing, assignment,destinations_1)\\n return address1,address2,address3,address4,address5,address6,address7,address8,address9,address10\",\n \"def route_matrix(client, origins, destinations, **kwargs):\\n\\n sep_pattern = re.compile(r'[,;|]')\\n CN_pattern = re.compile(u'[\\\\u4e00-\\\\u9fa5]+')\\n\\n is_origins_str = isinstance(origins, str)\\n is_origins_list = isinstance(origins, list)\\n if not any([is_origins_str, is_origins_list]):\\n raise ValueError('\\\"origins\\\" must be str or list!')\\n elif is_origins_str:\\n sep_origins = sep_pattern.split(origins)\\n u_origins = origins.decode('utf-8')\\n CN_pattern = re.compile(u'[\\\\u4e00-\\\\u9fa5]+')\\n match = CN_pattern.search(u_origins)\\n if match:\\n if len(sep_origins) > 5:\\n raise ValueError('\\\"origins\\\" incorrect! upper limits is 5.')\\n else:\\n origins = '|'.join(sep_origins)\\n else:\\n if len(sep_origins) > 10:\\n raise ValueError('\\\"origins\\\"incorrect! upper limits is 5.')\\n else:\\n temp = [','.join(sep_origins[(2*x):(2*x+2)][::-1])\\n for x in range(0, len(sep_origins)/2)]\\n origins = '|'.join(temp)\\n\\n else:\\n # element in list is CN_pattern characters.\\n if len(origins[0]) == 1:\\n origins = '|'.join(origins)\\n # element in list is list/tuple of lng,lat.\\n else:\\n origins = [map(str, l) for l in origins]\\n origins = '|'.join([','.join(l[::-1]) for l in origins])\\n\\n is_destinations_str = isinstance(destinations, str)\\n is_destinations_list = isinstance(destinations, list)\\n\\n if not any([is_destinations_str, is_destinations_list]):\\n raise ValueError('\\\"destinations\\\" must be str or list!')\\n elif is_destinations_str:\\n sep_destinations = sep_pattern.split(destinations)\\n u_destinations = destinations.decode('utf-8')\\n CN_pattern = re.compile(u'[\\\\u4e00-\\\\u9fa5]+')\\n match = CN_pattern.search(u_destinations)\\n if match:\\n if len(sep_destinations) > 5:\\n raise ValueError('\\\"destinations\\\" incorrect! upper limits is \\\\\\n 5.')\\n else:\\n destinations = '|'.join(sep_destinations)\\n else:\\n if len(sep_destinations) > 10:\\n raise ValueError('\\\"destinations\\\"incorrect! upper limits is 5.')\\n else:\\n temp = [','.join(sep_destinations[(2*x):(2*x+2)][::-1])\\n for x in range(0, len(sep_destinations)/2)]\\n destinations = '|'.join(temp)\\n\\n else:\\n if len(destinations[0]) == 1:\\n destinations = '|'.join(destinations)\\n else:\\n # first, map to str.\\n destinations = [map(str, l) for l in destinations]\\n destinations = '|'.join([','.join(l[::-1]) for l in destinations])\\n\\n kwargs.update({'server_name': 'direction', 'version': 'v1',\\n 'subserver_name': 'routematrix', 'origins': origins,\\n 'destinations': destinations})\\n\\n return client.get(kwargs)\",\n \"def directions_calc(self):\\n \\n # create route_dict, {'radio_button_name': {'geometries': list of coords,\\n # 'values': list of values}}\\n route_dict = self._selectInput()\\n \\n # generate lists with locations and values\\n (start_layer_name,\\n end_layer_name) = [x.objectName() for x in self.radio_buttons]\\n \\n locations_list = list(product(route_dict[start_layer_name]['geometries'],\\n route_dict[end_layer_name]['geometries']))\\n values_list = list(product(route_dict[start_layer_name]['values'],\\n route_dict[end_layer_name]['values']))\\n \\n # If row-by-row in two-layer mode, then only zip the locations\\n if all([button.isChecked() for button in self.radio_buttons]) and self.dlg.routing_twolayer_rowbyrow.isChecked():\\n locations_list = list(zip(route_dict[start_layer_name]['geometries'],\\n route_dict[end_layer_name]['geometries']))\\n\\n values_list = list(zip(route_dict[start_layer_name]['values'],\\n route_dict[end_layer_name]['values']))\\n\\n # Add via point if specified\\n route_via = None\\n if self.dlg.routing_via_label.text() != 'Long,Lat':\\n route_via = [float(x) for x in self.dlg.routing_via_label.text().split(\\\",\\\")]\\n \\n message_bar, progress_widget = progressbar.pushProgressBar(self.iface)\\n \\n responses = []\\n delete_values = []\\n for i, coords_tuple in enumerate(locations_list):\\n if coords_tuple[0] == coords_tuple[-1]:\\n # Skip when same location\\n delete_values.append(i)\\n continue\\n if route_via:\\n # add via coords\\n coords_tuple = list(coords_tuple)\\n coords_tuple.insert(1, route_via)\\n \\n # Update progress bar\\n percent = (i/len(locations_list)) * 100\\n message_bar.setValue(percent)\\n \\n # Make the request\\n self.params['coordinates'] = convert.build_coords(coords_tuple)\\n responses.append(self.client.request(self.url, self.params))\\n \\n # Delete entries in values_list where coords where the same\\n values_list = [value for idx, value in enumerate(values_list) if idx not in delete_values]\\n \\n # Only proceed when there actual responses\\n if responses: \\n layer_out = self._addLine(responses, values_list)\\n layer_out.updateExtents()\\n \\n QgsProject.instance().addMapLayer(layer_out)\\n \\n self.iface.messageBar().popWidget(progress_widget)\",\n \"def main(sources: gpd.GeoDataFrame, destinations: gpd.GeoDataFrame, router, annotations='duration', threads: int = 10, mts: int = 2000, keep_columns=None) -> write_stream:\\n\\tt = table_route(sources['geometry'], destinations['geometry'], router, annotations=annotations, max_table_size=mts, threads=threads)\\n\\n\\tif keep_columns is not None:\\n\\t\\tkeep_columns = keep_columns.split(',')\\n\\t\\tfor k in keep_columns:\\n\\t\\t\\tif k not in sources and k not in destinations:\\n\\t\\t\\t\\traise CommandError(f'column {k} not present in sources, nor in destinations. Available columns are: sources: {\\\", \\\".join(list(sources))}, destinations: {\\\", \\\".join(list(sources))}')\\n\\t\\tsub_sources = sources[[k for k in keep_columns if k in sources]]\\n\\t\\tsub_destinations = destinations[[k for k in keep_columns if k in destinations]]\\n\\n\\tfor df in t:\\n\\t\\tdf['geometry'] = utils.linestring_between(df.geometry, df.geometry_dest)\\n\\t\\tdf.drop('geometry_dest', axis=1, inplace=True)\\n\\t\\tif keep_columns is not None:\\n\\t\\t\\tdf = df.merge(sub_sources, left_on='source', right_index=True, suffixes=('', '_source'))\\n\\t\\t\\tdf = df.merge(sub_destinations, left_on='destination', right_index=True, suffixes=('', '_dest'))\\n\\n\\t\\tyield gpd.GeoDataFrame(df, crs=4326)\",\n \"def _route_chunk(data, host_url, annotations='duration', retries=10, extra_params=None):\\n\\t# offsets are used to make correct indice of the result dataframe\\n\\tsources, destinations, sources_offset, destinations_offset = data\\n\\tsources_count = len(sources)\\n\\tdestinations_count = len(destinations)\\n\\n\\t# OSRM takes all points as one list, and then numbers of sources & dests in it\\n\\tall_points = sources + destinations\\n\\tencoded = encode_poly([(p.y, p.x) for p in all_points])\\n\\n\\t# numerate sources & dests. sources come first\\n\\tsource_numbers = ';'.join(map(str, range(sources_count)))\\n\\tdestination_numbers = ';'.join(map(str,\\n\\t\\trange(sources_count, sources_count + destinations_count)))\\n\\n\\n\\textra_params = extra_params or {}\\n\\tparams = {\\n\\t\\t'sources': source_numbers,\\n\\t\\t'destinations': destination_numbers,\\n\\t\\t'generate_hints': 'false',\\n\\t\\t'annotations': annotations,\\n\\t\\t**extra_params\\n\\t}\\n\\n\\tencoded_params = urllib.parse.quote_plus(urllib.parse.urlencode(params))\\n\\t# if we pass url and params separately to requests.get, it will make a malformed URL\\n\\tencoded_url = f'{host_url}/table/v1/driving/polyline({encoded})?{encoded_params}'\\n\\tresp = get_retry(encoded_url, {}, retries)\\n\\n\\tif resp.status_code != 200:\\n\\t\\traise RuntimeError(f'OSRM server responded with {resp.status_code} code. Content: {resp.content}')\\n\\n\\tresp_data = resp.json()\\n\\tif resp_data.get('code', 'Ok') != 'Ok':\\n\\t\\traise RuntimeError(f'OSRM server responded with error message: {resp_data[\\\"message\\\"]}')\\n\\n\\t# if 'duration' is requested, then take resp_data['durations'], or resp_data['distances'] if distances.\\n\\t# also, 'duration,distance' might be requested, then take both and concatenate results (= join columns)\\n\\tresults = []\\n\\t\\n\\tfor key in annotations.split(','):\\n\\t\\tdf = pd.DataFrame(resp_data[f'{key}s']).reset_index().rename(columns={'index': 'source'}).melt(id_vars='source', var_name='destination', value_name=key)\\n\\t\\tdf[key] = df[key].astype(float)\\n\\t\\tif len(results) > 0:\\n\\t\\t\\t# only append the data column\\n\\t\\t\\tresults.append(df[[key]])\\n\\t\\telse:\\n\\t\\t\\tresults.append(df)\\n\\n\\tresult_df = pd.concat(results, axis=1)\\n\\n\\t# snapping distances\\n\\tresult_df['source_snap'] = result_df.source.map(pd.DataFrame(resp_data['sources'])['distance'])\\n\\tresult_df['destination_snap'] = result_df.destination.map(pd.DataFrame(resp_data['destinations'])['distance'])\\n\\n\\t# instead of join/merge lookup\\n\\tresult_df['geometry'] = result_df['source'].map({i: g for i, g in enumerate(sources)})\\n\\tresult_df['geometry_dest'] = result_df['destination'].map({i: g for i, g in enumerate(destinations)})\\n\\n\\t# shift back by the given offset\\n\\tresult_df['destination'] = result_df['destination'].astype(int) + destinations_offset\\n\\tresult_df['source'] = result_df['source'].astype(int) + sources_offset\\n\\treturn result_df\",\n \"def possible_routes(srcLat, srcLon, destLat, destLon, searchPreference, dateTime):\\n\\n dateTime = dateTime.split(\\\",\\\")\\n\\n routes = Db().get_best_route(srcLat, srcLon, destLat, destLon)\\n try:\\n best_routes = get_three_best_routes(routes, searchPreference, dateTime)\\n except IndexError:\\n best_routes = \\\"No Journey Found\\\"\\n\\n # Get the address for map display purposes\\n try:\\n for i in range(len(best_routes)):\\n #address is a dataframe, hency the use of .loc\\n address = Db().get_single_address(best_routes[i][2]).loc[0,\\\"Address\\\"]\\n best_routes[i].append(address)\\n except IndexError:\\n # In case the source is outside Dublin\\n best_routes = \\\"No Journey Found\\\"\\n\\n return json.dumps(best_routes, ensure_ascii=False)\",\n \"def route(vertices_resources, nets, machine, constraints,\\n placements, allocations, algorithm, core_resource):\\n if algorithm == \\\"default\\\":\\n module = \\\"rig.place_and_route\\\"\\n algorithm = \\\"default\\\"\\n else:\\n module = \\\"rig.place_and_route.route.{}\\\".format(algorithm)\\n \\n try:\\n router = getattr(import_module(module), \\\"route\\\")\\n except (ImportError, AttributeError):\\n sys.stderr.write(\\n \\\"Routing algorithm {} does not exist\\\\n\\\".format(algorithm))\\n sys.exit(1)\\n \\n logger.info(\\\"Routing netlist using '{}'...\\\".format(algorithm))\\n \\n before = time.time()\\n routes = router(vertices_resources, nets, machine, constraints,\\n placements, allocations, core_resource)\\n after = time.time()\\n \\n logger.info(\\\"Routed netlist in {:.2f}s\\\".format(after - before))\\n \\n return routes\",\n \"def roadSegments(locations, API_key=\\\"Avah46_M-gfFeQ3P1w09Qq1ElAV9ZEHFDm9b8JRCRa8qPP5uVn21hDqAPVJgV4i_\\\"): \\n \\n # Base URL\\n uri = 'http://dev.virtualearth.net/' # Resource URL \\n path = 'REST/v1/Routes?'\\n \\n \\n # URL Parameters\\n params = { 'wayPoint.0' : locations[0]+',Singapore',\\n 'wayPoint.1' : locations[1]+',Singapore',\\n 'routeAttributes':'routePath',\\n 'key' : API_Key} # by default 'optimize' : 'time'} # this is by default\\n \\n url = uri+path\\n\\n results = requests.get(\\n url,\\n params = params\\n ).json()# ['resourceSets']\\n\\n # Retrieving values\\n statusCode = results['statusCode']\\n if statusCode == 200:\\n # print(statusCode)\\n\\n # TODO review the exceptions and modify these basic exception handlings\\n try:\\n travelDistance = results['resourceSets'][0]['resources'][0]['travelDistance']\\n except:\\n travelDistance = 0\\n try:\\n travelDuration = results['resourceSets'][0]['resources'][0]['travelDuration']\\n except:\\n travelDuration = 0\\n try:\\n travelDurationTraffic = results['resourceSets'][0]['resources'][0]['travelDurationTraffic']\\n except:\\n travelDurationTraffic = 0\\n\\n try:\\n numberSegments = len(results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\\\\n ['itineraryItems'])\\n except:\\n numberSegments = 0\\n try:\\n itineraryItems = results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\\\\n ['itineraryItems']\\n except:\\n itineraryItems = 'No items'\\n\\n pathCoord = results['resourceSets'][0]['resources'][0]['routePath']['line']['coordinates']\\n\\n roadName = []\\n travelDistances = []\\n travelDurations = []\\n maneuverType = []\\n\\n for seg in itineraryItems:\\n for i in range(len(seg['details'])):\\n # print(i)\\n try:\\n roadName.append(seg['details'][i]['names'])\\n except:\\n roadName.append(0)\\n try:\\n travelDistances.append(seg['travelDistance'])\\n except:\\n travelDistances.append(0)\\n\\n try:\\n travelDurations.append(seg['travelDuration'])\\n except:\\n travelDurations.append(0)\\n try:\\n maneuverType.append(seg['details'][i]['maneuverType'])\\n except:\\n maneuverType.append(0)\\n\\n\\n return statusCode,travelDistance,travelDuration,travelDurationTraffic,numberSegments,roadName, \\\\\\n travelDistances, travelDurations, maneuverType, pathCoord\\n\\n else:\\n print(\\\"Unsuccessful route calculation.\\\")\",\n \"def _get_route(self, inp):\\n inp = self.connector_by_label(inp)\\n inp_routes = []\\n # get the routes starting at the input and the maximum route length\\n max_length = 0\\n for routes in self.routes[inp.label].values():\\n for route in routes:\\n inp_routes.append(route)\\n if len(route) > max_length:\\n max_length = len(route)\\n\\n # to find the outputs, the switches on possible routes are\\n # successively measured. Routes that do not fit the measured switch\\n # states are eliminated, such that following switches do not have\\n # to be read.\\n outputs = [] # list for the outputs\\n routes = inp_routes\\n measured_switch_states = {} # store already measured switches\\n for k in range(max_length):\\n routes_left = [] # list to store remaining routes\\n if len(routes) == 0:\\n break\\n for route in routes:\\n # action only required if start or end of the\\n # connection route[k] is a switch output\\n if route[k].start.is_switch_output():\\n # check if the switch is already measured\\n if route[k].start.switch.label in measured_switch_states:\\n state = measured_switch_states[\\n route[k].start.switch.label]\\n else:\\n # measure switch and store result\\n state = route[k].start.switch.mode()\\n measured_switch_states[\\n route[k].start.switch.label] = state\\n # got to next route (such that this one is not added to\\n # the remaining routes)\\n if route[k].start.output_nr != state:\\n continue\\n # if a output is reached, add it to outputs\\n if route[k].end.is_box_output():\\n outputs.append(route[k].end.label)\\n continue\\n # continue analogously to above\\n elif route[k].end.is_switch_output():\\n if route[k].end.switch.label in measured_switch_states:\\n state = measured_switch_states[\\n route[k].end.switch.label]\\n else:\\n state = route[k].end.switch.mode()\\n measured_switch_states[\\n route[k].end.switch.label] = state\\n if route[k].end.output_nr != state:\\n continue\\n # the route has not been eliminated,\\n # add it to the remaining routes\\n routes_left.append(route)\\n # set routes to routes_left before starting the next iteration\\n routes = routes_left\\n\\n # returns\\n if len(outputs) == 0:\\n return None\\n elif len(outputs) == 1:\\n return outputs[0]\\n else:\\n outputs = [out for out in self.outputs if out in outputs]\\n return outputs\",\n \"def coalesce_helper(self, netmask, routes):\\n # decrement netmask by 1\\n netmask = netmask - 1\\n routes_checked = []\\n # iterate through every route combination\\n for r1 in routes:\\n for r2 in routes:\\n # skip if routes are same, already checked, or source IPs arent matching\\n if r1 == r2 or r2 in routes_checked or r1[SRC_IF] != r2[SRC_IF]:\\n continue\\n # calculate route 1's network prefix and pad until 32 bits\\n r1_network = self.ip_to_binary(r1[MESG][NTWK])\\n r1_netmask = self.ip_to_binary(r1[MESG][NMSK]).count('1')\\n r1_prefix = self.pad_end(r1_network[:r1_netmask], '0', IP4_BIT_MAX)\\n # calculate route 2's network prefix and pad until 32 bits\\n r2_network = self.ip_to_binary(r2[MESG][NTWK])\\n r2_netmask = self.ip_to_binary(r2[MESG][NMSK]).count('1')\\n r2_prefix = self.pad_end(r2_network[:r2_netmask], '0', IP4_BIT_MAX)\\n # check if same next-hop router\\n if r1_prefix[:netmask] == r2_prefix[:netmask]:\\n # check if other attributes are matching\\n if (r1[MESG][LPRF] == r2[MESG][LPRF] and r1[MESG][ORIG] == r2[MESG][ORIG]\\n and r1[MESG][APTH] == r2[MESG][APTH] and r1[MESG][SORG] == r2[MESG][SORG]\\n and r1[MESG][SORG] == r2[MESG][SORG]):\\n # remove unnecessary route\\n self.routes.remove(r2)\\n # update netmask for keeper route\\n base_bits = self.pad_end('', '1', netmask)\\n final_bits = self.pad_end(base_bits, '0', IP4_BIT_MAX)\\n r1[MESG][NMSK] = self.binary_to_ip(final_bits)\\n #Check if the new netmask is able to aggregate with another\\n recheck_routes = []\\n r1_nmsk = final_bits.count('1')\\n for r in self.routes:\\n r_nmsk = self.ip_to_binary(r[MESG][NMSK]).count('1')\\n if r1_nmsk == r_nmsk:\\n recheck_routes.append(r)\\n recheck_routes.append(r1)\\n self.coalesce_helper(r_nmsk, recheck_routes)\\n # done checking, add to routes checked list\\n routes_checked.append(r1)\",\n \"def processTradeRoutes(self):\\n try:\\n nextRound = self.currentRound+1\\n resultslist = []\\n for trID in self.tradeRoutes.keys():\\n myTradeRoute = self.tradeRoutes[trID]\\n (systemFromID, systemToID, tradeRouteType) = string.split(trID, '-')\\n systemFrom = self.systems[systemFromID]\\n systemTo = self.systems[systemToID]\\n cancel = 0\\n warpReq = 0\\n # choose trade route type\\n if tradeRouteType == 'GEN':\\n # update what system sends based on what it makes\\n myTradeRoute.AL = systemFrom.prodAL\\n myTradeRoute.EC = systemFrom.prodEC\\n myTradeRoute.IA = systemFrom.prodIA\\n \\n # check if trade route is adjacent or requires warp gate capacity\\n if systemTo.id in systemFrom.warpGateSystems:\\n warpReq = myTradeRoute.getWarpRequired()\\n if warpReq > (systemFrom.availWGC-systemFrom.usedWGC) or warpReq > (systemTo.availWGC-systemTo.usedWGC):\\n cancel = 1\\n elif systemTo.id not in systemFrom.connectedSystems:\\n cancel = 1\\n \\n if (systemFrom.AL >= myTradeRoute.AL and\\n systemFrom.EC >= myTradeRoute.EC and\\n systemFrom.IA >= myTradeRoute.IA and \\n cancel == 0):\\n # process trade route\\n systemFrom.AL -= myTradeRoute.AL\\n systemFrom.EC -= myTradeRoute.EC\\n systemFrom.IA -= myTradeRoute.IA\\n systemTo.AL += myTradeRoute.AL\\n systemTo.EC += myTradeRoute.EC\\n systemTo.IA += myTradeRoute.IA\\n # deduct properly if empires are different\\n empireFrom = self.empires[systemFrom.myEmpireID]\\n empireTo = self.empires[systemTo.myEmpireID]\\n if empireFrom <> empireTo:\\n empireFrom.AL -= myTradeRoute.AL\\n empireFrom.EC -= myTradeRoute.EC\\n empireFrom.IA -= myTradeRoute.IA\\n empireTo.AL += myTradeRoute.AL\\n empireTo.EC += myTradeRoute.EC\\n empireTo.IA += myTradeRoute.IA\\n \\n if warpReq > 0:\\n systemFrom.usedWGC += warpReq\\n systemTo.usedWGC += warpReq\\n \\n # mail trade route completion\\n resultslist.append('Trade from System:%s to System:%s complete' % (systemFrom.id, systemTo.id))\\n self.mailTradeInfo('completed', myTradeRoute, nextRound)\\n else:\\n cancel = 1\\n \\n # check if route should be cancelled\\n if cancel == 1:\\n resultslist.append('cancel trade route=%s' % myTradeRoute.id)\\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\\n elif myTradeRoute.oneTime == 1:\\n resultslist.append('one time trade route=%s' % myTradeRoute.id)\\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\\n \\n return str(resultslist)\\n except:\\n return 'galaxy->processTradeRoutes error'\",\n \"def make_connections(self):\\n return\\n destinations={}\\n sources={}\\n for gsq in self.gatesqs:\\n destinations[self.local2global(gsq)]=set()\\n sources[self.local2global(gsq)]=set()\\n if rm.all_sols=='timeout':\\n return\\n for sol in self.all_sols:\\n for sa in sol:\\n start,indv,path,covered,end=sa\\n destinations[self.local2global(start)].add((self.local2global(end),tuple(path)))\\n sources[self.local2global(end)].add((self.local2global(start),tuple(path)))\\n self.sources=sources\\n self.destinations=destinations\",\n \"def optimizedRoutePossibilities(routes,cities):\\n\\tgraph = createOptimizedGraph(routes)\\n\\tfor couple in permutationsFromOrigin(cities):\\n\\t\\tif couple is not None:\\n\\t\\t\\t#yield find_all_paths2(graph,couple[0],couple[1])[0]\\n\\t\\t\\tprint(find_all_paths2(graph,couple[0],couple[1])[0])\",\n \"def route(self, ori, dest, pois):\\n #find one route from ori to dest\\n departure_time = int(time.time())\\n routes = util.query_routes(origin=ori, \\n destination=dest,\\n departure_time=departure_time)\\n if routes is None or routes['status'] != \\\"OK\\\":\\n print ',=====',routes\\n return None\\n\\n route = routes[\\\"routes\\\"][0] #get the first route\\n\\n #get the points in the route to search the potential poi\\n points = util.extract_points(route)\\n\\n if points is None or len(points) ==0:\\n print \\\"Error in extracting points\\\"\\n return None\\n #get the candiates in the route\\n candidates = []\\n way_points = pois.split(\\\"|\\\")\\n for point in points:\\n information = {}\\n information[\\\"location\\\"] = point\\n for way_p in way_points:\\n response = util.get_nearby_points(location=point, keyword=way_p)\\n if response is None or response[\\\"status\\\"] != \\\"OK\\\":\\n information[way_p] = []\\n continue\\n ps = []\\n for result in response[\\\"results\\\"]:\\n poi = {\\\"geometry\\\": result[\\\"geometry\\\"],\\n \\\"name\\\": result[\\\"name\\\"],\\n \\\"price_level\\\": result.get(\\\"price_level\\\", None),\\n \\\"rating\\\": result.get(\\\"rating\\\", None),\\n \\\"vicinity\\\": result[\\\"vicinity\\\"]}\\n ps.append(poi)\\n information[way_p] = ps\\n candidates.append(information)\\n \\n cost_matrix = waypoint.find_waypoints([candidates], way_points)\\n cost_matrix.sort(key=lambda x:x[1])\\n\\n top_candidate = cost_matrix[0]\\n json.dump(top_candidate, open('./top_candidate.json','w'))\\n final_route = self.get_direction(ori, dest, top_candidate)\\n json.dump(final_route, open(\\\"./real_route.json\\\", \\\"w\\\"))\\n\\n return final_route, top_candidate\",\n \"def __init__(self, **kwargs):\\r\\n self.pair_type = kwargs[\\\"pair_type\\\"]\\r\\n self.origins = kwargs[\\\"origins\\\"]\\r\\n self.origin_id_field = kwargs[\\\"origin_id_field\\\"]\\r\\n self.destinations = kwargs[\\\"destinations\\\"]\\r\\n self.dest_id_field = kwargs[\\\"dest_id_field\\\"]\\r\\n self.network_data_source = kwargs[\\\"network_data_source\\\"]\\r\\n self.travel_mode = kwargs[\\\"travel_mode\\\"]\\r\\n self.time_units = kwargs[\\\"time_units\\\"]\\r\\n self.distance_units = kwargs[\\\"distance_units\\\"]\\r\\n self.time_of_day = kwargs[\\\"time_of_day\\\"]\\r\\n self.reverse_direction = kwargs[\\\"reverse_direction\\\"]\\r\\n self.scratch_folder = kwargs[\\\"scratch_folder\\\"]\\r\\n self.assigned_dest_field = kwargs[\\\"assigned_dest_field\\\"]\\r\\n self.od_pair_table = kwargs[\\\"od_pair_table\\\"]\\r\\n self.origin_transfer_fields = kwargs[\\\"origin_transfer_fields\\\"]\\r\\n self.destination_transfer_fields = kwargs[\\\"destination_transfer_fields\\\"]\\r\\n self.barriers = []\\r\\n if \\\"barriers\\\" in kwargs:\\r\\n self.barriers = kwargs[\\\"barriers\\\"]\\r\\n\\r\\n # Create a job ID and a folder for this job\\r\\n self._create_job_folder()\\r\\n\\r\\n # Setup the class logger. Logs for each parallel process are not written to the console but instead to a\\r\\n # process-specific log file.\\r\\n self.setup_logger(\\\"RoutePairs\\\")\\r\\n\\r\\n # Get field objects for the origin and destination ID fields since we need this in multiple places\\r\\n self.origin_id_field_obj = arcpy.ListFields(self.origins, wild_card=self.origin_id_field)[0]\\r\\n self.dest_id_field_obj = arcpy.ListFields(self.destinations, wild_card=self.dest_id_field)[0]\\r\\n\\r\\n # Set up other instance attributes\\r\\n self.is_service = helpers.is_nds_service(self.network_data_source)\\r\\n self.rt_solver = None\\r\\n self.solve_result = None\\r\\n self.input_origins_layer = \\\"InputOrigins\\\" + self.job_id\\r\\n self.input_destinations_layer = \\\"InputDestinations\\\" + self.job_id\\r\\n self.input_origins_layer_obj = None\\r\\n self.input_dests_layer_obj = None\\r\\n self.origin_unique_id_field_name = \\\"OriginUniqueID\\\"\\r\\n self.dest_unique_id_field_name = \\\"DestinationUniqueID\\\"\\r\\n self.od_pairs = None\\r\\n\\r\\n # Create a network dataset layer if needed\\r\\n if not self.is_service:\\r\\n self._make_nds_layer()\\r\\n\\r\\n # Prepare a dictionary to store info about the analysis results\\r\\n self.job_result = {\\r\\n \\\"jobId\\\": self.job_id,\\r\\n \\\"jobFolder\\\": self.job_folder,\\r\\n \\\"solveSucceeded\\\": False,\\r\\n \\\"solveMessages\\\": \\\"\\\",\\r\\n \\\"outputRoutes\\\": \\\"\\\",\\r\\n \\\"logFile\\\": self.log_file\\r\\n }\",\n \"def _build_routes(self, routes, allow_redundant_targets=True):\\n routes = routes or ()\\n joins = {}\\n targets_seen = set()\\n\\n for route in routes:\\n if isinstance(route, dict):\\n source_label = route.get('source')\\n target_label = route.get('target')\\n field_label = route.get('field')\\n symmetrical = route.get('symmetrical')\\n else:\\n warnings.warn('Routes are now defined as dicts',\\n DeprecationWarning)\\n source_label, target_label, field_label, symmetrical = route\\n\\n # get models\\n source = self.get_model(source_label, local=False)\\n target = self.get_model(target_label, local=False)\\n\\n field = None\\n\\n # get field\\n if field_label:\\n model_name, field_name = field_label.split('.', 1)\\n model_name = model_name.lower()\\n\\n # determine which model the join field specified exists on\\n if model_name == source.__name__.lower():\\n field = self.get_field(field_name, source)\\n elif model_name == target.__name__.lower():\\n field = self.get_field(field_name, target)\\n else:\\n raise TypeError('model for join field, \\\"{0}\\\", '\\n 'does not exist'.format(field_name))\\n\\n if isinstance(field, RelatedObject):\\n field = field.field\\n\\n if not allow_redundant_targets:\\n if target in targets_seen:\\n raise ValueError('Model {0} cannot be the target of '\\n 'more than one route in this list'\\n .format(target_label))\\n else:\\n targets_seen.add(target)\\n\\n # The `joins` hash defines pairs which are explicitly joined\\n # via the specified field. If no field is defined, then the\\n # join field is implied or does not matter; the route is reduced\\n # to a straight lookup.\\n joins[(source, target)] = field\\n\\n if symmetrical:\\n if not allow_redundant_targets:\\n if source in targets_seen:\\n raise ValueError('Model {0} cannot be the target of '\\n 'more than one route in this list'\\n .format(source_label))\\n else:\\n targets_seen.add(source)\\n\\n joins[(target, source)] = field\\n\\n return joins\",\n \"def build_links(self):\\n xygrid = self.xymap.xygrid\\n\\n # we must use the xygrid coordinates\\n x, y = self.x, self.y\\n\\n # scan in all directions for links\\n for direction, (dx, dy) in MAPSCAN.items():\\n\\n lx, ly = x + dx, y + dy\\n\\n if lx in xygrid and ly in xygrid[lx]:\\n link = xygrid[lx][ly]\\n\\n # just because there is a link here, doesn't mean it has a\\n # connection in this direction. If so, the `end_node` will be None.\\n end_node, weight, steps = link.traverse(REVERSE_DIRECTIONS[direction])\\n\\n if end_node:\\n # the link could be followed to an end node!\\n\\n self.first_links[direction] = link\\n\\n # check the actual direction-alias to use, since this may be\\n # different than the xygrid cardinal directions. There must be\\n # no duplicates out of this node or there will be a\\n # multi-match error later!\\n first_step_name = steps[0].direction_aliases.get(direction, direction)\\n if first_step_name in self.closest_neighbor_names:\\n raise MapParserError(\\n f\\\"has more than one outgoing direction '{first_step_name}'. \\\"\\n \\\"All directions out of a node must be unique.\\\",\\n self,\\n )\\n self.closest_neighbor_names[first_step_name] = direction\\n\\n node_index = end_node.node_index\\n self.weights[node_index] = weight\\n self.links[direction] = end_node\\n # this is useful for map building later - there could be multiple\\n # links tied together until getting to the node\\n self.xy_steps_to_node[direction] = steps\\n\\n # used for building the shortest path. Note that we store the\\n # aliased link directions here, for quick display by the\\n # shortest-route solver\\n shortest_route = self.shortest_route_to_node.get(node_index, (\\\"\\\", [], BIGVAL))[\\n 2\\n ]\\n if weight < shortest_route:\\n self.shortest_route_to_node[node_index] = (first_step_name, steps, weight)\",\n \"def connect(src, *destinations, exclude=set(), fit=False):\\n assignemnts = []\\n for dst in destinations:\\n assignemnts.extend(_connect(src, dst, exclude, fit))\\n \\n return assignemnts\",\n \"def compute_shortest_routes(start_ids, dest_ids, G):\\n return ox.distance.shortest_path(G, start_ids, dest_ids, weight='travel_time', cpus=6)\",\n \"def naiveGlobalRouting(self):\\n for e_list in self.s2e.values():\\n for e in e_list:\\n slot_path = []\\n src_slot = self.v2s[e.src]\\n dst_slot = self.v2s[e.dst]\\n slot_path.append(src_slot)\\n\\n curr = src_slot\\n len_x = src_slot.getLenX()\\n len_y = src_slot.getLenY()\\n\\n # first go in X direction\\n x_diff = curr.getPositionX() - dst_slot.getPositionX()\\n if x_diff:\\n dir = 'LEFT' if x_diff > 0 else 'RIGHT'\\n for i in range(int(abs(x_diff/len_x))):\\n curr = self.slot_manager.createSlotForRouting(curr.getNeighborSlotName(dir))\\n slot_path.append(curr)\\n\\n y_diff = curr.getPositionY() - dst_slot.getPositionY()\\n if y_diff:\\n dir = 'DOWN' if y_diff > 0 else 'UP'\\n for i in range(int(abs(y_diff/len_y))):\\n curr = self.slot_manager.createSlotForRouting(curr.getNeighborSlotName(dir))\\n slot_path.append(curr)\\n \\n assert curr == dst_slot\\n \\n slot_path = slot_path[1:-1] # exclude the src and the dst\\n logging.info(f'{e.name}: {self.v2s[e.src].getName()} -> {self.v2s[e.dst].getName()} : ' + ' '.join(s.getName() for s in slot_path))\\n self.e_name2path[e.name] = slot_path\",\n \"def _find_routes(self, start_node, previous_nodes=None):\\n if previous_nodes is None:\\n previous_nodes = []\\n\\n routes = []\\n for con in self.connections:\\n if start_node == con.end:\\n con.flip()\\n if start_node == con.start:\\n # if the connection ends in a box output,\\n # add the connection (as a route of length 1)\\n if con.end.is_box_output():\\n routes.append([con])\\n elif con.end.is_box_input():\\n raise Exception(\\\"Route in connections detected, \\\"\\n \\\"that ends at an input.\\\")\\n elif con.end.is_switch_output():\\n # check if there is conflict with previous nodes\\n if con.end.switch in previous_nodes:\\n raise Exception(\\\"Loop detected in connections at\\\"\\n f\\\"switch {con.end.switch}.\\\")\\n # check orientation\\n if con.end.switch.orientation == 1:\\n raise Exception(\\\"Conflicting switch orientation \\\"\\n f\\\"for switch {con.end.switch}\\\")\\n # Set orientation of the switch\\n con.end.switch.orientation = -1\\n # Add the node to the previous nodes and call the method\\n # for the next node\\n if con.start.parent_type == 'switch':\\n previous_nodes.append(con.start.switch)\\n else:\\n previous_nodes.append(con.start)\\n next_step = self._find_routes(\\n con.end.switch.input,\\n previous_nodes=previous_nodes\\n )\\n # Merge the current connection with the resulting routes\\n for route in next_step:\\n routes.append([con] + route)\\n # proceed the analogously for a switch input\\n elif con.end.is_switch_input():\\n if con.end.switch in previous_nodes:\\n raise Exception(\\\"Loop detected in connections at\\\"\\n f\\\"switch {con.end.switch}.\\\")\\n if con.end.switch.orientation == -1:\\n raise Exception(\\\"Conflicting switch orientation \\\"\\n f\\\"for switch {con.end.switch}\\\")\\n con.end.switch.orientation = 1\\n if con.start.parent_type == 'switch':\\n previous_nodes.append(con.start.switch)\\n else:\\n previous_nodes.append(con.start)\\n\\n # continue with both outputs\\n next_step0 = self._find_routes(\\n con.end.switch.output[0],\\n previous_nodes=previous_nodes\\n )\\n\\n next_step1 = self._find_routes(\\n con.end.switch.output[1],\\n previous_nodes=previous_nodes\\n )\\n\\n for route in next_step0:\\n routes.append([con] + route)\\n for route in next_step1:\\n routes.append([con] + route)\\n\\n else:\\n raise TypeError(f\\\"Node {con.end} not recognised\\\")\\n\\n return routes\",\n \"def work(params) -> Union[None, float]:\\n try:\\n # either HTTP or bindings\\n if host:\\n path = action if action == \\\"route\\\" else \\\"sources_to_targets\\\"\\n params_str = delimit_tuple(\\n tuple((delimit_tuple(x) for x in params)), delimiter=\\\";\\\"\\n )\\n route = requests.get(f\\\"{host}/{path}/v1/driving/{params_str}\\\")\\n else:\\n route = router.route(params) if action == \\\"route\\\" else None\\n except (RuntimeError, requests.exceptions.BaseHTTPError):\\n return None\\n\\n if (\\n random() > 0.95\\n ): # assume that large number of routes will be tested, only print sample in debug mode\\n LOGGER.debug(f\\\"Calculated route between {params[0]} and {params[1]}\\\")\\n\\n if report:\\n result = route.json()\\n if action == \\\"route\\\":\\n try:\\n dist = sum([x[\\\"distance\\\"] for x in result[\\\"routes\\\"]])\\n except KeyError:\\n LOGGER.critical(\\n f\\\"No route was found from {params[0]} to {params[1]}. \\\"\\n f\\\"Try regenerating the locations or specify a more narrow bounding box.\\\"\\n )\\n return None\\n else:\\n dists = [\\n inner[\\\"distance\\\"]\\n for outer in route[\\\"sources_to_targets\\\"]\\n for inner in outer\\n ]\\n dist: float = mean(filter(lambda x: x is not None, dists))\\n\\n return dist\",\n \"def bicycle_route(\\n self,\\n origin: List,\\n destination: List,\\n via: Optional[List[Tuple]] = None,\\n origin_place_options: Optional[PlaceOptions] = None,\\n destination_place_options: Optional[PlaceOptions] = None,\\n via_place_options: Optional[PlaceOptions] = None,\\n destination_waypoint_options: Optional[WayPointOptions] = None,\\n via_waypoint_options: Optional[WayPointOptions] = None,\\n departure_time: Optional[datetime] = None,\\n routing_mode: str = \\\"fast\\\",\\n alternatives: int = 0,\\n units: str = \\\"metric\\\",\\n lang: str = \\\"en-US\\\",\\n return_results: Optional[List] = None,\\n spans: Optional[List] = None,\\n avoid_features: Optional[List[str]] = None,\\n avoid_areas: Optional[List[AvoidBoundingBox]] = None,\\n exclude: Optional[List[str]] = None,\\n ) -> RoutingResponse: # noqa E501\\n resp = self.routing_api.route(\\n transport_mode=\\\"bicycle\\\",\\n origin=origin,\\n destination=destination,\\n via=via,\\n origin_place_options=origin_place_options,\\n destination_place_options=destination_place_options,\\n via_place_options=via_place_options,\\n destination_waypoint_options=destination_waypoint_options,\\n via_waypoint_options=via_waypoint_options,\\n departure_time=departure_time,\\n routing_mode=routing_mode,\\n alternatives=alternatives,\\n units=units,\\n lang=lang,\\n return_results=return_results,\\n spans=spans,\\n avoid_features=avoid_features,\\n avoid_areas=avoid_areas,\\n exclude=exclude,\\n )\\n return RoutingResponse.new(resp.json())\",\n \"def _insert_stops_many_to_many(self):\\r\\n # Store data of the relevant origins and destinations in dictionaries for quick lookups and reuse\\r\\n o_data = {} # {Origin ID: [Shape, transferred fields]}\\r\\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_origins_layer,\\r\\n [self.origin_id_field, \\\"SHAPE@\\\"] + self.origin_transfer_fields\\r\\n ):\\r\\n o_data[row[0]] = row[1:]\\r\\n d_data = {} # {Destination ID: [Shape, transferred fields]}\\r\\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_destinations_layer,\\r\\n [self.dest_id_field, \\\"SHAPE@\\\"] + self.destination_transfer_fields\\r\\n ):\\r\\n d_data[row[0]] = row[1:]\\r\\n\\r\\n # Insert origins from each OD pair into the Route analysis\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.origin_unique_id_field_name, \\\"SHAPE@\\\"] + self.origin_transfer_fields\\r\\n ) as icur:\\r\\n for od_pair in self.od_pairs:\\r\\n origin_id, dest_id = od_pair\\r\\n try:\\r\\n origin_data = o_data[origin_id]\\r\\n except KeyError:\\r\\n # This should never happen because we should have preprocessed this out.\\r\\n self.logger.debug(\\r\\n f\\\"Origin from OD Pairs not found in inputs. Skipped pair {od_pair}.\\\")\\r\\n continue\\r\\n route_name = f\\\"{origin_id} - {dest_id}\\\"\\r\\n icur.insertRow((route_name, 1, origin_id) + origin_data)\\r\\n\\r\\n # Insert destinations from each OD pair into the Route analysis\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.dest_unique_id_field_name, \\\"SHAPE@\\\"] + self.destination_transfer_fields\\r\\n ) as icur:\\r\\n for od_pair in self.od_pairs:\\r\\n origin_id, dest_id = od_pair\\r\\n try:\\r\\n dest_data = d_data[dest_id]\\r\\n except KeyError:\\r\\n # This should never happen because we should have preprocessed this out.\\r\\n self.logger.debug(\\r\\n f\\\"Destination from OD Pairs not found in inputs. Skipped pair {od_pair}.\\\")\\r\\n continue\\r\\n route_name = f\\\"{origin_id} - {dest_id}\\\"\\r\\n icur.insertRow((route_name, 2, dest_id) + dest_data)\",\n \"def get_routing_solution(self):\\n G = self.base_digraph\\n s1 = self.sources[0]\\n s2 = self.sources[1]\\n t1 = self.destinations[0]\\n t2 = self.destinations[1]\\n\\n try:\\n m = Model('routing')\\n m.setParam('OutputFlag', False)\\n\\n # variables,\\n # We have one variable per edge per session\\n # e is the dict of dict for the variables\\n e = {}\\n r = {}\\n for i in [1,2]:\\n e[i] = {}\\n r[i] = m.addVar()\\n for u,v in G.edges():\\n e[i][u,v] = m.addVar(lb=0)\\n\\n m.update()\\n\\n obj = quicksum(r.values())\\n m.setObjective(obj, GRB.MAXIMIZE)\\n\\n # constraints\\n # 1. conservations of flow at all intermediate nodes\\n # 2. capacity constraints for each edge\\n\\n for u,v in G.edges():\\n m.addConstr(e[1][u,v] + e[2][u,v] <= G[u][v]['capacity'])\\n\\n m.addConstr(quicksum(e[1][u,v] for u,v in G.out_edges(s1)) == r[1])\\n m.addConstr(quicksum(e[2][u,v] for u,v in G.out_edges(s2)) == r[2])\\n m.addConstr(quicksum(e[1][u,v] for u,v in G.out_edges(s2)) == 0)\\n m.addConstr(quicksum(e[2][u,v] for u,v in G.out_edges(s1)) == 0)\\n m.addConstr(quicksum(e[1][u,v] for u,v in G.in_edges(t1)) == r[1])\\n m.addConstr(quicksum(e[2][u,v] for u,v in G.in_edges(t2)) == r[2])\\n\\n for n in G.nodes():\\n if n not in [s1, s2, t1, t2]:\\n for i in [1, 2]:\\n inflow = quicksum(e[i][u,v] for u,v in G.in_edges(n))\\n outflow = quicksum(e[i][u,v] for u,v in G.out_edges(n))\\n m.addConstr(inflow == outflow)\\n\\n m.optimize()\\n\\n if m.status == GRB.status.OPTIMAL:\\n for u, v in G.edges():\\n G[u][v]['Routing'] = {}\\n G[u][v]['Routing'][1] = e[1][u,v].x\\n G[u][v]['Routing'][2] = e[2][u,v].x\\n return (m.objVal, r[1].x, r[2].x)\\n else:\\n # something went wrong...err...\\n print \\\"Something was wrong, no optimal solution obtained\\\"\\n return None, None, None\\n\\n except GurobiError:\\n Print ('Error Report from Gurobi')\",\n \"def _calculate_emissions(self):\\n parameters = self._get_pollutants_for_vehicle()\\n\\n self.routes = RouteSet()\\n\\n if \\\"routes\\\" not in self._json_data:\\n log.debug(\\\"Error in returned JSON data from web service.\\\")\\n log.debug(\\\"data: {}\\\".format(self._json_data))\\n return\\n\\n # Create a \\\"set\\\" of Routes. The planner web service will\\n # return 2-4 routes with different paths.\\n for idx, r in enumerate(self._json_data[\\\"routes\\\"][\\\"features\\\"]):\\n attributes = r.get(\\\"attributes\\\")\\n route = Route(distance=attributes.get(\\\"Total_Meters\\\"),\\n minutes=attributes.get(\\\"Total_Minutes\\\"),\\n path=r.get(\\\"geometry\\\").get(\\\"paths\\\")[0], id = idx)\\n self.routes.add(route)\\n\\n log.debug(\\\"Nr of routes: {}\\\".format(len(self.routes)))\\n for i, route in enumerate(self.routes):\\n # A list of x,y,z points that all together represents the route\\n path_coordinates = route.path\\n distances = []\\n\\n # Nifty little trick to loop over 'path_coordinates',\\n # but keep a reference to the 'prev' item to calculate the\\n # distance between them\\n iter_points = iter(path_coordinates)\\n prev = next(iter_points)\\n for point in path_coordinates:\\n if not distances:\\n # first point\\n distances.append(Planner._get_distance_3d(prev, point) / 1000)\\n else:\\n distances.append(distances[-1] + Planner._get_distance_3d(prev, point) / 1000)\\n\\n point_slope = Planner._get_slope(prev, point)\\n\\n # Calculate emission for each pollutants the user has asked for\\n for p in self._pollutants:\\n parms = [x for x in parameters if x.pollutant.name.startswith(p)]\\n calc_emission = self.get_emission(parms, point_slope)\\n route.add_pollutant(p, calc_emission)\\n\\n prev = point\\n\\n route.add_distances(distances)\",\n \"def optimizedRoutePossibilities2(routes,cities):\\n\\tgraph = createOptimizedGraph(routes)\\n\\tfor couple in permutationsFromOrigin(cities):\\n\\t\\tif couple is not None:\\n\\t\\t\\t#yield find_all_paths2(graph,couple[0],couple[1])[0]\\n\\t\\t\\tpath = find_all_paths2(graph,couple[0],couple[1])[0]\\n\\t\\t\\tif couple[0] in graph[path[-1]]:\\n\\t\\t\\t\\tyield path\",\n \"def main():\\n # Instantiate the data problem.\\n data = create_data_model()\\n\\n # NEW SPOT TO MAKE distance_matrix\\n distance_matrix = compute_euclidean_distance_matrix(destinations_1)\\n manager = pywrapcp.RoutingIndexManager(\\n len(destinations_1), data['num_vehicles'], data['depot'])\\n\\n# # Create the routing index manager.\\n# manager = pywrapcp.RoutingIndexManager(\\n# len(data['locations']), data['num_vehicles'], data['depot'])\\n\\n # Create Routing Model.\\n routing = pywrapcp.RoutingModel(manager)\",\n \"def get_origin_routes(self, routes):\\n outroutes = []\\n current_best = \\\"UNK\\\"\\n # iterate through routes in given list updating the current best if a better\\n # option is discovered\\n for route in routes:\\n if route[ORIG] == current_best:\\n outroutes.append(route)\\n elif (route[ORIG] == \\\"EGP\\\" and current_best != \\\"IGP\\\") or route[ORIG] == \\\"IGP\\\":\\n # if the current best is worse than EGP and the current is EGP,\\n # update best and start a new list\\n # if the current best is worse than IGP and the current is IGP,\\n # update best and start a new list\\n current_best = route[ORIG]\\n outroutes = [route]\\n\\n return outroutes\",\n \"def route(self, is_check_lanes=True):\\n print 'route'\\n # TODO: if too mant vtypes, better go through id_modes\\n exectime_start = time.clock()\\n\\n net = self.get_scenario().net\\n edges = net.edges\\n vtypes = self.parent.vtypes\\n\\n ids_edges = []\\n ids_trip = []\\n costs = []\\n for id_vtype in self.get_vtypes():\\n id_mode = vtypes.ids_mode[id_vtype]\\n\\n # no routing for pedestrians\\n if id_mode != net.modes.get_id_mode('pedestrian'):\\n weights = edges.get_times(id_mode=id_mode,\\n speed_max=vtypes.speeds_max[id_vtype],\\n is_check_lanes=is_check_lanes)\\n\\n ids_trip_vtype = self.get_trips_for_vtype(id_vtype)\\n # print ' id_vtype,id_mode',id_vtype,id_mode#,ids_trip_vtype\\n # print ' weights',weights\\n ids_edge_depart = self.ids_edge_depart[ids_trip_vtype]\\n ids_edge_arrival = self.ids_edge_arrival[ids_trip_vtype]\\n\\n for id_trip, id_edge_depart, id_edge_arrival in zip(ids_trip_vtype, ids_edge_depart, ids_edge_arrival):\\n cost, route = routing.get_mincostroute_edge2edge(id_edge_depart,\\n id_edge_arrival,\\n edges=edges,\\n weights=weights)\\n if len(route) > 0:\\n ids_edges.append(route)\\n ids_trip.append(id_trip)\\n costs.append(cost)\\n\\n ids_route = self.routes.get_value().add_rows(ids_trip=ids_trip,\\n ids_edges=ids_edges,\\n costs=costs,\\n )\\n self.add_routes(ids_trip, ids_route)\\n print ' exectime', time.clock()-exectime_start\\n return ids_trip, ids_route\",\n \"def airline_connections(region):\\n\\n outgoing_routes = region.airlines\\n ingoing_routes = []\\n\\n for other_region in regions.values():\\n if other_region == region: continue\\n\\n for airline in other_region.airlines:\\n if airline.destination == region:\\n ingoing_routes.append(airline)\\n\\n return (outgoing_routes, ingoing_routes)\",\n \"def filter_relationships(self, srcip, routes):\\n outroutes = []\\n return outroutes\",\n \"def run_destination_reduction(self):\\n s = self.sources\\n t = self.destinations\\n\\n # get the union set of source edges\\n s_edges = [self.out_edges(x) for x in s]\\n s_edges_idx = [set(self.get_edges_indices(src)) for src in s_edges]\\n S = set.union(*s_edges_idx)\\n\\n # now starting from the sources\\n T_curr = [set(self.in_edges(x)) for x in t]\\n T_curr_idx = [set(self.get_edges_indices(x)) for x in T_curr]\\n T_union = set.union(*[set(x) for x in T_curr])\\n T_union_idx = set.union(*T_curr_idx)\\n self.dst_evolution_rec = [T_curr_idx]\\n\\n while not T_union_idx.issubset(S):\\n # get the edges out of the max-ordered node\\n tail_nodes = set([x[0] for x in T_union])\\n tail_nodes = tail_nodes - set(s)\\n v = max(tail_nodes, key=lambda p: self.node[p]['index'])\\n\\n E = set([edge for edge in T_union if edge[0] == v])\\n E_curr = [x.intersection(E) for x in T_curr]\\n\\n T_next = []\\n Uv = self.in_edges(v)\\n for (Ex, Tx) in zip(E_curr, T_curr):\\n if Ex:\\n T_next.append((Tx - Ex).union(Uv))\\n else:\\n T_next.append(Tx)\\n\\n T_curr = T_next\\n T_curr_idx = [set(self.get_edges_indices(x)) for x in T_curr]\\n self.dst_evolution_rec.append(T_curr_idx)\\n\\n T_union = set.union(*[set(x) for x in T_curr])\\n T_union_idx = set.union(*T_curr_idx)\",\n \"def aggregate_routes(self, route1, route2):\\n # get current prefix length and subtract 1\\n if route1[NMSK] != route2[NMSK] or route1[NTWK] != route2[NTWK]:\\n p_len = self.get_prefix(route1) - 1\\n else:\\n p_len = self.get_prefix(route1)\\n # convert new prefix length into netmask ip format (255.255.255.0, e.g.)\\n # append (32 - (prefix length)) many 0's -> bin to ip that\\n bin_nmsk = (\\\"1\\\" * p_len).ljust(32, \\\"0\\\")\\n nmsk_ip = self.binary_to_ipv4(bin_nmsk)\\n # make a new entry with ^^^^ NMSK and lower of the two IPs (compare_ip())\\n lower_ip = None\\n if self.compare_ip(route1[NTWK], route2[NTWK]) == 1:\\n lower_ip = route2[NTWK]\\n else:\\n lower_ip = route1[NTWK]\\n # create new route with original SRCE, DEST and new msg -> NTWK and NMSK\\n copy_of_route = copy.deepcopy(route1)\\n copy_of_route[NTWK] = lower_ip\\n copy_of_route[NMSK] = nmsk_ip\\n copy_of_route[\\\"CIDR\\\"] = p_len\\n return copy_of_route\",\n \"def global_plan(\\n world: carla.World, # pylint: disable=no-member\\n origin: carla.Location, # pylint: disable=no-member\\n destination: carla.Location, # pylint: disable=no-member\\n) -> Tuple[Sequence[carla.Waypoint], Sequence[Any], float]: # pylint: disable=no-member\\n try:\\n from agents.navigation.global_route_planner import GlobalRoutePlanner # pylint: disable=import-error\\n from agents.navigation.global_route_planner_dao import GlobalRoutePlannerDAO # pylint: disable=import-error\\n except ImportError:\\n raise ImportError(\\n \\\"Missing CARLA installation, \\\"\\n \\\"make sure the environment variable CARLA_ROOT is provided \\\"\\n \\\"and that the PythonAPI is `easy_install`ed\\\")\\n\\n # Setup global planner.\\n grp_dao = GlobalRoutePlannerDAO(wmap=world.get_map(), sampling_resolution=1)\\n grp = GlobalRoutePlanner(grp_dao)\\n grp.setup()\\n # Generate plan.\\n waypoints, roadoptions = zip(*grp.trace_route(origin, destination))\\n # Accummulate pairwise distance.\\n distances = [0.0]\\n for i in range(1, len(waypoints)):\\n loc_tm1 = waypoints[i - 1].transform.location\\n loc_tm1 = np.asarray([loc_tm1.x, loc_tm1.y, loc_tm1.z])\\n loc_t = waypoints[i].transform.location\\n loc_t = np.asarray([loc_t.x, loc_t.y, loc_t.z])\\n distances.append(np.linalg.norm(loc_tm1 - loc_t))\\n\\n return waypoints, roadoptions, distances\",\n \"def car_route(\\n self,\\n origin: List,\\n destination: List,\\n via: Optional[List[Tuple]] = None,\\n origin_place_options: Optional[PlaceOptions] = None,\\n destination_place_options: Optional[PlaceOptions] = None,\\n via_place_options: Optional[PlaceOptions] = None,\\n destination_waypoint_options: Optional[WayPointOptions] = None,\\n via_waypoint_options: Optional[WayPointOptions] = None,\\n departure_time: Optional[datetime] = None,\\n routing_mode: str = \\\"fast\\\",\\n alternatives: int = 0,\\n units: str = \\\"metric\\\",\\n lang: str = \\\"en-US\\\",\\n return_results: Optional[List] = None,\\n spans: Optional[List] = None,\\n avoid_features: Optional[List[str]] = None,\\n avoid_areas: Optional[List[AvoidBoundingBox]] = None,\\n exclude: Optional[List[str]] = None,\\n ) -> RoutingResponse: # noqa: E501\\n resp = self.routing_api.route(\\n transport_mode=\\\"car\\\",\\n origin=origin,\\n destination=destination,\\n via=via,\\n origin_place_options=origin_place_options,\\n destination_place_options=destination_place_options,\\n via_place_options=via_place_options,\\n destination_waypoint_options=destination_waypoint_options,\\n via_waypoint_options=via_waypoint_options,\\n departure_time=departure_time,\\n routing_mode=routing_mode,\\n alternatives=alternatives,\\n units=units,\\n lang=lang,\\n return_results=return_results,\\n spans=spans,\\n avoid_features=avoid_features,\\n avoid_areas=avoid_areas,\\n exclude=exclude,\\n )\\n return RoutingResponse.new(resp.json())\",\n \"def route_layout(self):\\n self.route_pins()\\n self.route_internal()\\n self.route_supplies()\",\n \"def coalesce(self):\\n routes = []\\n # loop through every possible subnet mask\\n for netmask in range(0, IP4_BIT_MAX):\\n routes.clear() # clear and restart each time\\n for r in self.routes:\\n r_nmsk = self.ip_to_binary(r[MESG][NMSK]).count('1')\\n if netmask == r_nmsk:\\n routes.append(r)\\n # attempt to coalesce final route choices\\n self.coalesce_helper(netmask, routes)\",\n \"def table_route(sources, destinations, router, max_table_size=2_000, threads=10, annotations='duration', pbar=True, cache_name=None, executor='process', extra_params=None):\\n\\timport re\\n\\tif router not in CONFIG['routers'] and not re.match(r'^https?\\\\://.*', router):\\n\\t\\traise ValueError(f'router must be a key in erde config routers section, or a URL. got: \\\\'{router}\\\\'')\\n\\n\\tsources_indices = {i: v for i, v in enumerate(_index(sources))}\\n\\tdestinations_indices = {i: v for i, v in enumerate(_index(destinations))}\\n\\tsources = _tolist(sources, 'sources')\\n\\tdestinations = _tolist(destinations, 'destinations')\\n\\n\\tann_set = set(annotations.split(','))\\n\\tif ann_set & {'duration', 'distance'} != ann_set:\\n\\t\\traise ValueError(\\\"annotations must be one of these: 'duration', 'distance', or 'duration,distance' (order does not matter)\\\")\\n\\n\\tmts = max_table_size\\n\\thost_url = CONFIG['routers'].get(router, router)\\n\\n\\ttotal_rows, total_cols = rows, cols = len(sources), len(destinations)\\n\\tif cols * rows > mts:\\n\\t\\tif rows < cols:\\n\\t\\t\\t# split by sources\\n\\t\\t\\trows = max(mts // cols, 1) # max(,1) beacuse if 1 row does not fit, then at least split by 1 row\\n\\t\\t\\tcols = min(mts, cols)\\n\\t\\telse:\\n\\t\\t\\tcols = max(mts // rows, 1)\\n\\t\\t\\trows = min(mts, rows)\\n\\n\\t_route_partial = partial(_route_chunk, host_url=host_url, annotations=annotations, extra_params=extra_params)\\n\\n\\twith tqdm(total=total_rows * total_cols, desc='Table routing', disable=(not pbar)) as t, ThreadPoolExecutor(max_workers=threads) as tpe:\\n\\t\\tcombos = list(product(range(0, total_rows, rows), range(0, total_cols, cols)))\\n\\t\\tslices = ((sources[s:s + rows], destinations[d:d + cols], s, d) for s, d in combos)\\n\\n\\t\\t# process/thread/an instance of executor\\n\\t\\tfor df in tpe.map(_route_partial, slices):\\n\\t\\t\\tdf['source'] = df['source'].map(sources_indices)\\n\\t\\t\\tdf['destination'] = df['destination'].map(destinations_indices)\\n\\t\\t\\tyield df\\n\\t\\t\\tt.update(len(df))\",\n \"def routes_with_criteria(self, src, target, criteria):\\n\\n # BFS\\n routes = []\\n q = deque() # <- [ ... ] <-\\n stops = 0\\n distance = 0 # not true for this app, but it works out in the conditional check\\n q.append((src, stops, distance, [src]))\\n\\n while q:\\n # this city, stops to this city, distance to this city, route to this city\\n city, stops, distance, route = q.popleft()\\n if target == city and distance: # no self-loops!\\n r = list(route)\\n routes.append(r)\\n for dest, cost in self.G[city].items():\\n if criteria(stops + 1, distance + cost):\\n new_route = list(route)\\n new_route.append(dest)\\n q.append((dest, stops + 1, distance + cost, new_route))\\n return routes\",\n \"def run_router(self, detour_scale):\\n\\n # Double check source and taget are not same node, if so, we are done!\\n for k,v in self.rg.map.items():\\n if v.source and v.target:\\n debug.error(\\\"Grid cell is source and target! {}\\\".format(k))\\n return False\\n \\n # returns the path in tracks\\n (path,cost) = self.rg.route(detour_scale)\\n if path:\\n debug.info(1,\\\"Found path: cost={0} \\\".format(cost))\\n debug.info(1,str(path))\\n\\n self.paths.append(path)\\n self.add_route(path)\\n \\n path_set = grid_utils.flatten_set(path)\\n self.path_blockages.append(path_set)\\n else:\\n self.write_debug_gds(\\\"failed_route.gds\\\")\\n # clean up so we can try a reroute\\n self.rg.reinit()\\n return False\\n return True\",\n \"def read_routes(routes_source: TextIO, airports: AirportDict) -> RouteDict:\\n #RouteDict = Dict[str, Set[str]]\\n routes_list = routes_source.readlines()\\n d = {}\\n src_index = ROUTE_DATA_INDEXES['Source airport']\\n dst_index = ROUTE_DATA_INDEXES['Destination airport']\\n \\n for i in range(len(routes_list)):\\n source_airport = get_routes_information(routes_list[i], src_index)\\n destination_airport = get_routes_information(routes_list[i], dst_index)\\n \\n if source_airport in airports and destination_airport in airports\\\\\\n and source_airport not in d:\\n \\n routes = set() # it's a set\\n routes.add(destination_airport)\\n d[source_airport] = routes\\n \\n elif source_airport in airports and destination_airport in \\\\\\n airports and source_airport in d:\\n d[source_airport].add(destination_airport)\\n return d\",\n \"def chunk_user_route(detail_of_trip):\\n\\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\\n # since I can't get javascript to load, here's a hacky way of loading json\\n # that details the route based on the user's point A and point B\\n # detail_of_trip = api.directions(\\n # (40.760350, -73.976209),\\n # (40.754009, -73.981097),\\n # mode=\\\"walking\\\"\\n # )[0]\\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\\n\\n # now that I have javascript sending over the json, load json that details\\n # the route based on the user's point A and point B\\n\\n # -------------- This section is for interpolation/splitting using shapely\\n first = True # to see if this is the start position for the entire route\\n line_points = [] # stores all the points to the route based on dict passed\\n\\n for leg in detail_of_trip['legs']:\\n for step in leg['steps']:\\n # Create a list of two element lists that represent points along the\\n # route. via google. line_points = [ [lat1, lng1], [lat2, lng2],...]\\n # Only add the starting point the first time. Every other iteration\\n # we will just tack on the end points to our line.\\n if first:\\n line_points.append([step['start_location']['lat'], step['start_location']['lng']])\\n first = False\\n line_points.append([step['end_location']['lat'], step['end_location']['lng']])\\n\\n # Now load those points into a geometry, here shapely's LineString type.\\n route_line = LineString(line_points)\\n return (route_line, line_points)\",\n \"def routes(self) -> List[Tuple[int, bytes]]:\\n raise NotImplementedError() # pragma: no cover\",\n \"def savings2routes(self,r1,r2):\\n newRoute = VRP_Route(r1.route+r2.route)\\n newRoute.update_route(self.vrpdata) # compute distance, quantity for newRoute, check whether valid\\n if newRoute.tourValid:\\n return r1.distance + r2.distance - newRoute.distance\\n return -1\",\n \"def buildRouteLinkSequence(self):\\n arcpy.env.workspace = PublicTransit.RTD_PATH\\n linkSeq = arcpy.SearchCursor(PublicTransit.BUS_ROUTE_TRAVERSAL_EDGES, \\\"\\\", \\\"\\\", \\\"\\\", \\\"RouteId A; Cumul_Distance A\\\")\\n prevRouteId = -1\\n for e in linkSeq:\\n if (e.RouteId in self.routeXref):\\n routePattern = self.routeXref[e.RouteId]\\n if (routePattern in self.transitRoutes): #not all routes are in RTD, so check\\n if (prevRouteId != e.RouteId):\\n self.transitRoutes[routePattern].linkSequence = []\\n self.transitRoutes[routePattern].linkSequence.append(e.SourceOID)\\n prevRouteId = e.RouteId\\n del e\\n del linkSeq\",\n \"def set_dests(self, increment=1000000):\\n modified = 0\\n pb = Progress(len(self.graph.routers), 'Setting destinations', increment=increment, callback=lambda: 'Modified {:,d}'.format(modified))\\n for router in pb.iterator(self.graph.routers.values()):\\n for interface in router.interfaces:\\n # Copy destination ASes to avoid messing up original\\n idests: Set[int] = set(interface.dests)\\n # If last hop, interface has non-IXP AS mapping, and interface has destination ASes\\n if not router.succ and idests and interface.asn > 0:\\n origin = interface.asn\\n # Interface must have exactly 2 destination ASes and one must be its origin AS\\n if len(idests) == 2 and origin in idests:\\n other_asn = peek(idests - {origin}) # other AS\\n # If other AS is likely customer of interface origin AS, and it's a small AS\\n if self.bgp.conesize[origin] > self.bgp.conesize[other_asn] and self.bgp.conesize[other_asn] < 5:\\n idests.discard(origin)\\n modified += 1\\n # Add all remaining destination ASes to the router destination AS set\\n router.dests.update(idests)\",\n \"def stops_on_routes_with_direction():\\n routes_and_stops = {}\\n routes = ['102y', '102z', '104y', '104z', '111y', '111z', '114y', '114z', '116y', '116z', '118y', '11y', '11z', '120y', '120z', '122y', '122z', '123y', '123z', '130y', '130z', '13y', '13z', '140y', '140z', '142y', '142z', '145y', '145z', '14Cy', '14Cz', '14y', '14z', '150y', '150z', '151y', '151z', '15Ay', '15Az', '15By', '15Bz', '15y', '15z', '161y', '161z', '16Cy', '16Cz', '16y', '16z', '17Ay', '17Az', '17y', '17z', '184y', '184z', '185y', '185z', '18y', '18z', '1y', '1z', '220y', '220z', '236y', '236z', '238y', '238z', '239y', '239z', '25Ay', '25Az', '25By', '25Bz', '25Xy', '25Xz', '25y', '25z', '26y', '26z', '270y', '270z', '27Ay', '27Az', '27By', '27Bz', '27Xy', '27Xz', '27y', '27z', '29Ay', '29Az', '31Ay', '31Az', '31By', '31Bz', '31y', '31z', '32Ay', '32Az', '32By', '32Bz', '32Xy', '32Xz', '32y', '32z', '33Ay', '33Az', '33By', '33Bz', '33Xy', '33Xz', '33y', '33z', '37y', '37z', '38Ay', '38Az', '38By', '38Bz', '38y', '38z', '39Ay', '39Az', '39y', '39z', '40By', '40Bz', '40Dy', '40Dz', '40y', '40z', '41Ay', '41By', '41Bz', '41Cy', '41Cz', '41Xy', '41Xz', '41y', '41z', '42y', '42z', '43y', '43z', '44By', '44Bz', '44y', '44z', '45Ay', '45Az', '46Ay', '46Az', '46Ey', '47y', '47z', '49y', '49z', '4y', '4z', '51Dy', '51Dz', '51Xy', '53By', '53Bz', '53y', '53z', '54Ay', '54Az', '56Ay', '56Az', '59y', '59z', '61y', '61z', '63y', '63z', '65By', '65Bz', '65y', '65z', '66Ay', '66Az', '66By', '66Bz', '66Xy', '66Xz', '66y', '66z', '67Xy', '67Xz', '67y', '67z', '68Ay', '68Az', '68y', '68z', '69Xy', '69Xz', '69y', '69z', '70y', '70z', '747y', '747z', '75y', '75z', '76Ay', '76Az', '76y', '76z', '77Ay', '77Az', '79Ay', '79Az', '79y', '79z', '7By', '7Bz', '7Dy', '7Dz', '7y', '7z', '83Ay', '83Az', '83y', '83z', '84Ay', '84Az', '84Xy', '84Xz', '84y', '84z', '8y', '8z', '9y', '9z']\\n for route in routes:\\n routes_and_stops[route] = [] # new array value for each route key\\n reader = csv.reader(open(\\\"../Data/Sorted Data/stopped_bus_data.csv\\\"))\\n for line in reader:\\n try:\\n current_route = extract_route_and_direction(line[3])\\n if int(line[13]) not in routes_and_stops[current_route]:\\n routes_and_stops[current_route].append(int(line[13]))\\n except:\\n continue\\n return routes_and_stops\",\n \"def matrix(\\n self,\\n origins: List[Dict],\\n region_definition: Union[\\n CircleRegion, BoundingBoxRegion, PolygonRegion, AutoCircleRegion, WorldRegion\\n ],\\n async_req: bool = False,\\n destinations: Optional[List[Dict]] = None,\\n profile: Optional[str] = None,\\n departure_time: Optional[Union[datetime, str]] = None,\\n routing_mode: Optional[str] = None,\\n transport_mode: Optional[str] = None,\\n avoid_features: Optional[List[str]] = None,\\n avoid_areas: Optional[List[AvoidBoundingBox]] = None,\\n truck: Optional[Truck] = None,\\n matrix_attributes: Optional[List[str]] = None,\\n ) -> MatrixRoutingResponse: # noqa E501\\n if profile and type(region_definition) != WorldRegion:\\n raise ValueError(\\\"profile must be used with WorldRegion only.\\\")\\n if truck and transport_mode != \\\"truck\\\":\\n raise ValueError(\\\"Truck option must be used when transport_mode is truck\\\")\\n if async_req is True:\\n resp = self.matrix_routing_api.matrix_route_async(\\n origins=origins,\\n region_definition=region_definition,\\n destinations=destinations,\\n profile=profile,\\n departure_time=departure_time,\\n routing_mode=routing_mode,\\n transport_mode=transport_mode,\\n avoid_features=avoid_features,\\n avoid_areas=avoid_areas,\\n truck=truck,\\n matrix_attributes=matrix_attributes,\\n )\\n status_url = resp[\\\"statusUrl\\\"]\\n while True:\\n resp_status = self.matrix_routing_api.get_async_matrix_route_status(status_url)\\n if resp_status.status_code == 200 and resp_status.json().get(\\\"error\\\"):\\n raise ApiError(resp_status)\\n elif resp_status.status_code == 303:\\n result_url = resp_status.json()[\\\"resultUrl\\\"]\\n break\\n elif resp_status.status_code in (401, 403, 404, 500):\\n raise ApiError(resp_status)\\n sleep(2)\\n result = self.matrix_routing_api.get_async_matrix_route_results(result_url)\\n return MatrixRoutingResponse.new(result)\\n else:\\n resp = self.matrix_routing_api.matrix_route(\\n origins=origins,\\n region_definition=region_definition,\\n destinations=destinations,\\n profile=profile,\\n departure_time=departure_time,\\n routing_mode=routing_mode,\\n transport_mode=transport_mode,\\n avoid_features=avoid_features,\\n avoid_areas=avoid_areas,\\n truck=truck,\\n matrix_attributes=matrix_attributes,\\n )\\n return MatrixRoutingResponse.new(resp)\",\n \"def _process_connections(self, connections):\\n # create connection\\n for con in connections:\\n self._add_connection(con)\\n\\n for inp_lab, inp in self.inputs.items():\\n # use self._find_routes() to find routes from input inp\\n routes_inp = self._find_routes(inp)\\n # create routes\\n for route in routes_inp:\\n self._add_route(route)\\n # sort the routes dictionary\\n self._sort_routes()\",\n \"def findRoute(self, x1, y1, x2, y2):\\r\\n\\r\\n\\t\\t# Check to see if the start and end node are the same\\r\\n\\t\\tif x1 == x2 and y1 == y2:\\r\\n\\t\\t\\treturn [(x1, y1)]\\r\\n\\r\\n\\t\\troot_node = DijkstraNode(x1, y1, None, 0)\\r\\n\\t\\troot_node.neighbours = self.getNeighbours(x1, y1)\\r\\n\\r\\n\\t\\t# Create a dictionary to store all of the nodes\\r\\n\\t\\tall_nodes = {(x1, y1): root_node}\\r\\n\\t\\t# If no starting place is found return nothing\\r\\n\\t\\tif len(root_node.neighbours) == 0:\\r\\n\\t\\t\\treturn []\\r\\n\\t\\tcurrent_node = root_node\\r\\n\\t\\twhile (x2, y2) not in all_nodes:\\r\\n\\r\\n\\t\\t\\t# If the algorithm hasn't found the target node and cannot explore further then return empty path\\r\\n\\t\\t\\tif current_node is None:\\r\\n\\t\\t\\t\\treturn []\\r\\n\\r\\n\\t\\t\\tcurrent_node.neighbours = self.getNeighbours(current_node.x, current_node.y)\\r\\n\\r\\n\\t\\t\\t# The distance from the root node through the current node to the neighbour\\r\\n\\t\\t\\tcurrent_neighbour_dist = current_node.dist + 1\\r\\n\\r\\n\\t\\t\\tfor neighbour in current_node.neighbours:\\r\\n\\t\\t\\t\\tif neighbour in all_nodes:\\r\\n\\t\\t\\t\\t\\tneighbour_node = all_nodes[neighbour]\\r\\n\\t\\t\\t\\t\\tif current_neighbour_dist < neighbour_node.dist:\\r\\n\\t\\t\\t\\t\\t\\t# The new best path is through the current node\\r\\n\\t\\t\\t\\t\\t\\tneighbour_node.parent = current_node\\r\\n\\t\\t\\t\\t\\t\\tneighbour_node.dist = current_neighbour_dist\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\t# Add a new node if it doesn't exist within the currently explored nodes\\r\\n\\t\\t\\t\\t\\tall_nodes[neighbour] = DijkstraNode(neighbour[0], neighbour[1], current_node, current_neighbour_dist)\\r\\n\\r\\n\\t\\t\\t# Mark the current node as being explored as you have checked all the neighbours\\r\\n\\t\\t\\tcurrent_node.explored = True\\r\\n\\r\\n\\t\\t\\t# Gets a list of all of the unexplored nodes to check for the next node to explore\\r\\n\\t\\t\\tunexplored_nodes = [node for _, node in all_nodes.items() if not node.explored]\\r\\n\\r\\n\\t\\t\\tif len(unexplored_nodes) > 0:\\r\\n\\t\\t\\t\\t# Go to the next node with the smallest distance that hasn't been explored\\r\\n\\t\\t\\t\\tcurrent_node = min(unexplored_nodes, key=lambda node: node.dist)\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tcurrent_node = None\\r\\n\\r\\n\\t\\t# Make your way back from the target node\\r\\n\\t\\tcurrent_node = all_nodes[(x2, y2)]\\r\\n\\t\\t# Initialise a list to hold the path going from the target to the root\\r\\n\\t\\treversed_path = []\\r\\n\\t\\t# This will end when the root node tries to travel to a None node\\r\\n\\t\\twhile current_node is not None:\\r\\n\\t\\t\\t# Add the current node to the list\\r\\n\\t\\t\\treversed_path.append((current_node.x, current_node.y))\\r\\n\\t\\t\\t# Travel to the parent node\\r\\n\\t\\t\\tcurrent_node = current_node.parent\\r\\n\\t\\t\\t# current_node will be None at the root because the parent of the root node is 'None'\\r\\n\\r\\n\\t\\t# Return the list in the correct order\\r\\n\\t\\treturn list(reversed(reversed_path))\",\n \"def __routes(self, with_return):\\n nonzeo_pois = list(filter(None, self.pois.keys()))\\n\\n for path in itertools.permutations(nonzeo_pois):\\n steps = self.poi_distance(0, path[0])\\n for i, j in zip(path, path[1:]):\\n steps += self.poi_distance(i, j)\\n if with_return:\\n steps += self.poi_distance(path[-1], 0)\\n yield steps\",\n \"def lookup_routes(self, daddr):\\n outroutes = []\\n binary_of_dest = self.ip_to_binary(daddr)\\n best_cidr = float('-inf')\\n\\n for r in self.routes:\\n # convert network and netmask to binary for longest prefix matching\\n binary_of_network = self.ip_to_binary(r[MESG][NTWK])\\n cidr_of_netmask = self.ip_to_binary(r[MESG][NMSK]).count('1')\\n # use subnet mask to get the prefix\\n dst = binary_of_dest[:cidr_of_netmask]\\n ntk = binary_of_network[:cidr_of_netmask]\\n # matching prefixes?\\n if dst == ntk:\\n # found better match. clear and start over with just this route\\n if best_cidr < cidr_of_netmask:\\n best_cidr = cidr_of_netmask\\n outroutes.clear()\\n outroutes.append(r)\\n # 1 to 1 match, add route to list\\n if best_cidr == cidr_of_netmask:\\n outroutes.append(r)\\n\\n return outroutes\",\n \"def compute_distances_for_sources_and_mics(self,\\n source_points):\\n points = {\\\"m1\\\": self.m1, \\\"m2\\\": self.m2}\\n points.update(dict([(\\\"s\\\"+str(i+1), xy)\\n for (i, xy) in enumerate(source_points)]))\\n distances = {}\\n\\n for point_1, xy1 in points.items():\\n for point_2, xy2 in points.items():\\n distances[point_1+point_2] = dst.euclidean(xy1, xy2)\\n\\n return distances\",\n \"def two_user_route_statistics(i,j, source_data, destination_data, source_destination_data, delta=1.2):\\n\\toccupancy_ratio = 0.0\\n\\tminimum_distance_so_far = 0.0\\n\\tcommon_travel_distance = 0.0\\n\\n\\ttry:\\n\\t\\tif source_destination_data[j][i] + source_data[i][j] <= 1.2*source_destination_data[i][i] and source_destination_data[j][i] + destination_data[i][j] <= 1.2*source_destination_data[j][j]:\\n\\t\\t\\tfirst = ((source_destination_data[j][i] + source_data[i][j])/(source_destination_data[j][i] + source_data[i][j]+destination_data[i][j]))\\n\\t\\t\\tsecond = ((source_destination_data[j][i] + destination_data[i][j])/(source_destination_data[j][i] + source_data[i][j]+destination_data[i][j]))\\n\\t\\t\\toccupancy_ratio = (first+second)/2\\n\\t\\t\\tcommon_travel_distance = source_destination_data[j][i]\\n\\t\\t\\tminimum_distance_so_far = source_data[i][j] + source_destination_data[j][i] + destination_data[i][j]\\n\\n\\t\\tif source_destination_data[i][j] + destination_data[j][i] <= 1.2*source_destination_data[i][i] and source_destination_data[i][j] + source_data[j][i] <= 1.2*source_destination_data[j][j]:\\n\\t\\t\\tfirst = ((source_destination_data[i][j] + destination_data[j][i])/(source_destination_data[i][j] + destination_data[j][i]+source_data[j][i]))\\t\\t\\n\\t\\t\\tsecond = ((source_destination_data[i][j] + source_data[j][i])/(source_destination_data[i][j] + destination_data[j][i]+source_data[j][i]))\\n\\t\\t\\ttotal_distance = source_data[j][i] + source_destination_data[i][j] + destination_data[j][i]\\n\\n\\t\\t\\tif total_distance < minimum_distance_so_far:\\n\\t\\t\\t\\tminimum_distance_so_far = total_distance\\n\\t\\t\\t\\tcommon_travel_distance = source_destination_data[i][j]\\n\\t\\t\\t\\toccupancy_ratio = (first+second)/2\\n\\n\\t\\tif source_data[i][j]+source_destination_data[j][j]+destination_data[j][i] <= 1.2*source_destination_data[i][i]:\\n\\t\\t\\tfirst = (1)\\n\\t\\t\\tsecond = (source_destination_data[j][j]/(source_data[i][j]+source_destination_data[j][j]+destination_data[j][i]))\\n\\n\\t\\t\\ttotal_distance = source_data[i][j] + source_destination_data[j][j] + destination_data[j][i]\\n\\n\\t\\t\\tif total_distance < minimum_distance_so_far:\\n\\t\\t\\t\\tminimum_distance_so_far = total_distance\\n\\t\\t\\t\\tcommon_travel_distance = source_destination_data[j][j]\\n\\t\\t\\t\\toccupancy_ratio = (first+second)/2\\n\\n\\t\\tif source_data[j][i]+source_destination_data[i][i]+destination_data[i][j] <= 1.2*source_destination_data[j][j]:\\n\\t\\t\\tfirst = (source_destination_data[i][i]/(source_data[j][i]+source_destination_data[i][i]+destination_data[i][j]))\\n\\t\\t\\tsecond = (1)\\n\\n\\t\\t\\ttotal_distance = source_data[j][i]+source_destination_data[i][i]+destination_data[i][j]\\n\\n\\t\\t\\tif total_distance < minimum_distance_so_far:\\n\\t\\t\\t\\tminimum_distance_so_far = total_distance\\n\\t\\t\\t\\tcommon_travel_distance = source_destination_data[i][i]\\n\\t\\t\\t\\toccupancy_ratio = (first+second)/2\\n\\n\\texcept Exception as e:\\n\\t\\toccupancy_ratio = 1.0\\n\\t\\tminimum_distance_so_far = 0.0\\n\\t\\tcommon_travel_distance = 0.0\\n\\n\\n\\treturn occupancy_ratio, common_travel_distance, minimum_distance_so_far\",\n \"def route_output(self):\\n self.Z_position = vector(self.width, self.A_position.y)\\n # route nmos drain to Z\\n nmos_contact = (self.nmos_position1 \\n + self.nmos.active_contact_positions[1] \\n + self.nmos.active_contact.second_layer_position\\n + vector(self.nmos.active_contact.second_layer_width,\\n 0).scale(0.5, 0))\\n mid = [nmos_contact.x, self.A_position.y]\\n self.add_path(\\\"metal1\\\", [self.Z_position, mid, nmos_contact])\\n\\n for i in range(len(self.pmos.poly_positions) + 1):\\n if i % 2 == 1:\\n # pmos2 drain to Z\\n pmos_contact = (self.pmos_position2\\n + self.pmos.active_contact_positions[i]\\n + self.pmos.active_contact.second_layer_position.scale(1, 0)\\n + vector(self.pmos.active_contact.second_layer_width,\\n 0).scale(0.5, 0))\\n offset = pmos_contact - vector(0.5 * self.m1m2_via.width, 0)\\n self.add_via(layers=(\\\"metal1\\\", \\\"via1\\\", \\\"metal2\\\"),\\n offset=offset)\\n mid = [pmos_contact.x, self.Z_position.y]\\n self.add_wire((\\\"metal1\\\", \\\"via1\\\", \\\"metal2\\\"),\\n [self.Z_position, mid, pmos_contact])\\n\\n self.add_layout_pin(text=\\\"Z\\\",\\n layer=\\\"metal1\\\",\\n offset=mid - vector(0,0.5*drc[\\\"minwidth_metal1\\\"]),\\n width=self.Z_position.x-mid[0],\\n height=drc[\\\"minwidth_metal1\\\"])\",\n \"def get_routes(duthost1, duthost2, collect, mg_facts):\\n dut1_routes_all = get_dut_routes(duthost1, collect, mg_facts)\\n dut2_routes_all = get_dut_routes(duthost2, collect, mg_facts)\\n dut_1_diff_routes = list(set(dut1_routes_all).difference(set(dut2_routes_all)))\\n dut_2_diff_routes = list(set(dut2_routes_all).difference(set(dut1_routes_all)))\\n res1 = natsorted([route for route in dut_1_diff_routes if\\n ipaddress.ip_network(route).subnet_of(ipaddress.ip_network(SUBNET_CHECK))])\\n res2 = natsorted([route for route in dut_2_diff_routes if\\n ipaddress.ip_network(route).subnet_of(ipaddress.ip_network(SUBNET_CHECK))])\\n return {duthost1.hostname: res1, duthost2.hostname: res2}\",\n \"def pedestrian_route(\\n self,\\n origin: List,\\n destination: List,\\n via: Optional[List[Tuple]] = None,\\n origin_place_options: Optional[PlaceOptions] = None,\\n destination_place_options: Optional[PlaceOptions] = None,\\n via_place_options: Optional[PlaceOptions] = None,\\n destination_waypoint_options: Optional[WayPointOptions] = None,\\n via_waypoint_options: Optional[WayPointOptions] = None,\\n departure_time: Optional[datetime] = None,\\n routing_mode: str = \\\"fast\\\",\\n alternatives: int = 0,\\n units: str = \\\"metric\\\",\\n lang: str = \\\"en-US\\\",\\n return_results: Optional[List] = None,\\n spans: Optional[List] = None,\\n avoid_features: Optional[List[str]] = None,\\n avoid_areas: Optional[List[AvoidBoundingBox]] = None,\\n exclude: Optional[List[str]] = None,\\n ) -> RoutingResponse: # noqa E501\\n resp = self.routing_api.route(\\n transport_mode=\\\"pedestrian\\\",\\n origin=origin,\\n destination=destination,\\n via=via,\\n origin_place_options=origin_place_options,\\n destination_place_options=destination_place_options,\\n via_place_options=via_place_options,\\n destination_waypoint_options=destination_waypoint_options,\\n via_waypoint_options=via_waypoint_options,\\n departure_time=departure_time,\\n routing_mode=routing_mode,\\n alternatives=alternatives,\\n units=units,\\n lang=lang,\\n return_results=return_results,\\n spans=spans,\\n avoid_features=avoid_features,\\n avoid_areas=avoid_areas,\\n exclude=exclude,\\n )\\n return RoutingResponse.new(resp.json())\",\n \"def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches\\r\\n # Select the inputs to process\\r\\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n self._select_inputs_one_to_one(chunk_definition)\\r\\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n self._get_od_pairs_for_chunk(chunk_definition)\\r\\n self._select_inputs_many_to_many()\\r\\n else:\\r\\n raise NotImplementedError(f\\\"Invalid PreassignedODPairType: {self.pair_type}\\\")\\r\\n\\r\\n # Initialize the Route solver object\\r\\n self.initialize_rt_solver()\\r\\n self._add_unique_id_fields()\\r\\n\\r\\n # Insert the origins and destinations\\r\\n self.logger.debug(f\\\"Route solver fields transferred from Origins: {self.origin_transfer_fields}\\\")\\r\\n self.logger.debug(f\\\"Route solver fields transferred from Destinations: {self.destination_transfer_fields}\\\")\\r\\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n self._insert_stops_one_to_one()\\r\\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n self._insert_stops_many_to_many()\\r\\n else:\\r\\n raise NotImplementedError(f\\\"Invalid PreassignedODPairType: {self.pair_type}\\\")\\r\\n\\r\\n if self.rt_solver.count(arcpy.nax.RouteInputDataType.Stops) == 0:\\r\\n # There were no valid destinations for this set of origins\\r\\n self.logger.debug(\\\"No valid destinations for this set of origins. Skipping Route calculation.\\\")\\r\\n return\\r\\n\\r\\n # Load barriers\\r\\n # Note: This loads ALL barrier features for every analysis, even if they are very far away from any of\\r\\n # the inputs in the current chunk. You may want to select only barriers within a reasonable distance of the\\r\\n # inputs, particularly if you run into the maximumFeaturesAffectedByLineBarriers,\\r\\n # maximumFeaturesAffectedByPointBarriers, and maximumFeaturesAffectedByPolygonBarriers tool limits for portal\\r\\n # solves. However, since barriers is likely an unusual case, deal with this only if it becomes a problem.\\r\\n for barrier_fc in self.barriers:\\r\\n self.logger.debug(f\\\"Loading barriers feature class {barrier_fc}...\\\")\\r\\n shape_type = arcpy.Describe(barrier_fc).shapeType\\r\\n if shape_type == \\\"Polygon\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.PolygonBarriers\\r\\n elif shape_type == \\\"Polyline\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.LineBarriers\\r\\n elif shape_type == \\\"Point\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.PointBarriers\\r\\n else:\\r\\n self.logger.warning(\\r\\n f\\\"Barrier feature class {barrier_fc} has an invalid shape type and will be ignored.\\\"\\r\\n )\\r\\n continue\\r\\n barriers_field_mappings = self.rt_solver.fieldMappings(class_type, True)\\r\\n self.rt_solver.load(class_type, barrier_fc, barriers_field_mappings, True)\\r\\n\\r\\n # Solve the Route analysis\\r\\n self.logger.debug(\\\"Solving Route...\\\")\\r\\n solve_start = time.time()\\r\\n self.solve_result = self.rt_solver.solve()\\r\\n solve_end = time.time()\\r\\n self.logger.debug(f\\\"Solving Route completed in {round(solve_end - solve_start, 3)} seconds.\\\")\\r\\n\\r\\n # Handle solve messages\\r\\n solve_msgs = [msg[-1] for msg in self.solve_result.solverMessages(arcpy.nax.MessageSeverity.All)]\\r\\n for msg in solve_msgs:\\r\\n self.logger.debug(msg)\\r\\n\\r\\n # Update the result dictionary\\r\\n self.job_result[\\\"solveMessages\\\"] = solve_msgs\\r\\n if not self.solve_result.solveSucceeded:\\r\\n self.logger.debug(\\\"Solve failed.\\\")\\r\\n return\\r\\n self.logger.debug(\\\"Solve succeeded.\\\")\\r\\n self.job_result[\\\"solveSucceeded\\\"] = True\\r\\n\\r\\n # Save output\\r\\n self._export_to_feature_class(chunk_definition)\\r\\n\\r\\n self.logger.debug(\\\"Finished calculating Route.\\\")\",\n \"def lookup_routes(self, daddr):\\n outroutes = []\\n for entry in self.routes:\\n # split netmask and daddr by the IP dots\\n netmask_split = entry[NMSK].split('.')\\n daddr_split = daddr.split('.')\\n\\n # bitwise ANd the netmask with the daddr\\n result = []\\n for i in range(0, len(netmask_split)):\\n result.append(str(int(netmask_split[i]) & int(daddr_split[i])))\\n \\n # compare ANDed result to the network\\n is_valid = True\\n network_split = entry[NTWK].split('.')\\n for i in range(0, len(network_split)):\\n if result[i] != network_split[i]:\\n is_valid = False\\n break\\n if is_valid:\\n outroutes.append(entry)\\n\\n if len(outroutes) == 0:\\n return outroutes\\n\\n # reform IP address\\n outroutes.sort(key=lambda r: int(r[NMSK].replace('.', '')), reverse=True)\\n longest_matching_prefix = int(outroutes[0][NMSK].replace('.', ''))\\n outroutes = list(filter(lambda r: int(r[NMSK].replace('.', '')) == longest_matching_prefix, outroutes))\\n return outroutes\",\n \"def FindAllRoutesRec(ConnectionInfo, EndStation, RouteConditions, TimeTableList, TimeTableIndex, StationHourIndex, PathInfo=[]):\\r\\n PathInfo = PathInfo + [ConnectionInfo]\\r\\n\\r\\n if Cond.IfTestRouteSearch:\\r\\n \\tStations = GetAllStationsOfRoute(PathInfo)\\r\\n \\tprint \\\"\\\\nStations of Path (%s): ++++++++\\\" % len(Stations)\\r\\n \\tprint Stations\\r\\n \\tprint \\\"Route Information:\\\"\\r\\n \\tprint PrettyStringRouteInfo(PathInfo)\\r\\n\\r\\n # check successful termination\\r\\n # if len(PathInfo) > 1 and ConnectionInfo[ConnInfoInd['station_to']] == EndStation: \\r\\n if CheckIfPathTerminatesSuccessfully(ConnectionInfo, PathInfo, RouteConditions, EndStation):\\r\\n \\tif Cond.IfTestRouteSearch:\\r\\n \\t\\tprint \\\"End Station is reached!\\\"\\t\\r\\n \\treturn [PathInfo]\\r\\n\\r\\n # current (this iteration's) path length\\r\\n CurPathLen = len(PathInfo)\\r\\n\\r\\n # get next connections\\r\\n start_station = ConnectionInfo[ConnInfoInd['station_to']]\\r\\n departure_hour = ConnectionInfo[ConnInfoInd['arrival_hour']] \\t\\r\\n departure_min = ConnectionInfo[ConnInfoInd['arrival_min']]\\r\\n\\r\\n # TEST BU2019\\r\\n if False:\\r\\n\\t print 'ConnInfoInd: ' + str(ConnectionInfo)\\r\\n\\t print 'start_station,departure_hour,departure_min: %s, %s, %s' % (start_station, departure_hour, departure_min)\\r\\n\\t time.sleep(0.1)\\r\\n \\r\\n # mandatory conditions\\r\\n WaitLimit = RouteConditions[Cond.MaxWaitingTimeAtStation][0]\\r\\n \\r\\n # get next connections from the station\\r\\n ConnectionInfoList = GetListOfNextConnections(TimeTableList, TimeTableIndex, StationHourIndex, start_station, departure_hour, departure_min, WaitLimit)\\r\\n\\r\\n # insert on-foot connections (Zu Fuss, ZF) to nearby stations into ConnectionInfoList\\r\\n # cancel (Tunc 4/3/2019)\\r\\n if False:\\r\\n\\t StationMeasurementTime = ReqStationMeasureTime\\r\\n\\t \\r\\n\\t if Cond.MaxNumberOfSubsequentStationPassagesOnFoot in RouteConditions \\\\\\r\\n\\t \\tand RouteConditions[Cond.MaxNumberOfSubsequentStationPassagesOnFoot][0] > 0:\\r\\n\\r\\n\\t\\t if RouteConditions.has_key(Cond.MeasureStations):\\r\\n\\t\\t \\tStationMeasurementTime = RouteConditions[Cond.MeasureStations][1]\\r\\n\\t\\t Connections = GetOnFootStationChangeConnections(start_station, departure_hour, departure_min, StationMeasurementTime)\\r\\n\\t\\t \\r\\n\\t\\t if Connections:\\t\\t# i.e. if Connections is not None\\r\\n\\t\\t \\t(OnFootConnections1, OnFootConnections2) = Connections \\r\\n\\t\\t \\tConnectionInfoList = AddConnectionsToListAfterDepartureTime(ConnectionInfoList, OnFootConnections1)\\r\\n\\t\\t \\tConnectionInfoList = AddConnectionsToListAfterDepartureTime(ConnectionInfoList, OnFootConnections2)\\r\\n\\r\\n if Cond.IfTestRouteSearch:\\r\\n\\t\\tprint \\\"Next connections:\\\"\\r\\n\\t\\tfor c in ConnectionInfoList:\\r\\n\\t\\t\\tprint c\\r\\n\\t\\ttime.sleep(Cond.TestWaitingTime)\\r\\n\\r\\n if not ConnectionInfoList:\\t\\t# Endstation: Node w/o successor nodes\\r\\n \\treturn []\\r\\n\\r\\n PathInfoList = []\\r\\n\\r\\n for ConnectionInfo in ConnectionInfoList:\\r\\n\\t\\tres = Cond.CheckIfConnectionShouldBeSelected(ConnectionInfo, PathInfo, EndStation, RouteConditions)\\r\\n\\r\\n\\t\\t# test\\r\\n\\t\\tif Cond.IfTestRouteSearch:\\r\\n\\t\\t\\tif res == None or res == False:\\r\\n\\t\\t\\t\\tprint \\\"CheckIfConnectionShouldBeSelected: %s\\\" % res\\r\\n\\r\\n\\t \\tif res == None: return[] \\r\\n\\t \\tif res == False: continue\\r\\n\\r\\n\\t \\t# recursive call\\r\\n\\t\\textended_paths = FindAllRoutesRec(ConnectionInfo, EndStation, RouteConditions, \\\\\\r\\n\\t\\t\\tTimeTableList, TimeTableIndex, StationHourIndex, PathInfo)\\r\\n\\r\\n\\t\\t# report status\\r\\n\\t\\tif Cond.ReportDuringRouteSearch in RouteConditions:\\r\\n\\t\\t\\tTimeIntv = default_timer() - Cond.SearchStartTime\\r\\n\\t\\t\\tRouteSearchReportingIntervalInSeconds = RouteConditions[Cond.ReportDuringRouteSearch][0]\\r\\n\\t\\t\\tif TimeIntv > Cond.RouteSearchReportCounter * RouteSearchReportingIntervalInSeconds:\\r\\n\\t\\t\\t\\tCond.RouteSearchReportCounter += 1 \\r\\n\\t\\t\\t\\tprint \\\"%s seconds passed... \\\" % \\\"{:.2f}\\\".format(TimeIntv)\\r\\n\\t\\t\\t\\tprint \\\"%s routes found so far, that passed all connection selection criteria (before route selection)\\\" \\\\\\r\\n\\t\\t\\t\\t\\t% Cond.RouteCountAfterConnectionSelection\\t\\r\\n\\t\\t\\t\\tprint \\\"%s routes found so far, that passed all route selection criteria (before final route filtering)\\\" \\\\\\r\\n\\t\\t\\t\\t\\t% Cond.RouteCountAfterRouteSelection\\t\\r\\n\\t\\t\\t\\tprint \\\"----------------------\\\"\\t\\r\\n\\r\\n\\t\\t# append to path list\\r\\n\\t\\tfor p in extended_paths:\\r\\n\\t\\t\\t# no need to recheck route unless current connection is the last one \\r\\n\\t\\t\\t# LastConnection = (ConnectionInfo == p[-1])\\r\\n\\t\\t\\tLastConnection = (CurPathLen == len(p) -1 and ConnectionInfo == p[-1])\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif LastConnection:\\r\\n\\r\\n\\t\\t\\t\\tif Cond.CheckIfRouteShouldBeSelected(p, RouteConditions):\\r\\n\\t\\t\\t\\t\\tPathInfoList.append(p)\\r\\n\\t\\t\\t\\t\\tCond.SelectedRoutes.append(ApplyAllRouteInfoCorrections(p))\\r\\n\\r\\n\\t\\t\\t\\t\\t# evaluate route\\r\\n\\t\\t\\t\\t\\t# cancel for BU2019\\r\\n\\r\\n\\t\\t\\t\\t\\tif Cond.IfTestRouteSearch:\\r\\n\\t\\t\\t\\t\\t\\tprint \\\"%s routes found so far, that passed all connection selection criteria (before route selection)\\\" \\\\\\r\\n\\t\\t\\t\\t\\t\\t\\t% Cond.RouteCountAfterConnectionSelection\\r\\n\\t\\t\\t\\t\\t\\tprint \\\"%s routes found so far, that passed all route selection criteria (before final route filtering)\\\\n\\\" \\\\\\r\\n\\t\\t\\t\\t\\t\\t\\t% Cond.RouteCountAfterRouteSelection\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tprint \\\"----------------------\\\"\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t# test\\r\\n\\t\\t\\t\\t\\tIncrementDicValue(Cond.RouteCountPerRouteLength, CurPathLen)\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\t# not last connection, no need to recheck the route\\r\\n\\t\\t\\t\\t# PathInfoList.append(p)\\r\\n\\t\\t\\t\\t# IncrementDicValue(SelectedRoutesPerLevel, CurPathLen)\\r\\n\\t\\t\\t\\tpass\\r\\n \\r\\n return PathInfoList\",\n \"def _sort_routes(self):\\n sorted_routes = OrderedDict()\\n for inp_lab, inp in self.inputs.items():\\n if inp_lab not in self.routes:\\n continue\\n sorted_routes[inp_lab] = OrderedDict()\\n for out_lab, out in self.outputs.items():\\n if out_lab not in self.routes[inp_lab]:\\n continue\\n routes = self.routes[inp_lab][out_lab]\\n # If multiple routes between a certain input and output exist,\\n # order the routes by length\\n if len(routes) > 1:\\n route_lengths = [len(route) for route in routes]\\n sorted_indices = np.argsort(route_lengths)\\n routes = [routes[i] for i in sorted_indices]\\n sorted_routes[inp_lab][out_lab] = routes\\n self.routes = sorted_routes\",\n \"def find_routes(\\r\\n stops,\\r\\n measurement_units = \\\"\\\"\\\"Minutes\\\"\\\"\\\",\\r\\n analysis_region = None,\\r\\n reorder_stops_to_find_optimal_routes = False,\\r\\n preserve_terminal_stops = \\\"\\\"\\\"Preserve First\\\"\\\"\\\",\\r\\n return_to_start = False,\\r\\n use_time_windows = False,\\r\\n time_of_day = None,\\r\\n time_zone_for_time_of_day = \\\"\\\"\\\"Geographically Local\\\"\\\"\\\",\\r\\n uturn_at_junctions = \\\"\\\"\\\"Allowed Only at Intersections and Dead Ends\\\"\\\"\\\",\\r\\n point_barriers = None,\\r\\n line_barriers = None,\\r\\n polygon_barriers = None,\\r\\n use_hierarchy = True,\\r\\n restrictions = None,\\r\\n attribute_parameter_values = None,\\r\\n route_shape = \\\"\\\"\\\"True Shape\\\"\\\"\\\",\\r\\n route_line_simplification_tolerance = None,\\r\\n populate_route_edges = False,\\r\\n populate_directions = True,\\r\\n directions_language = \\\"\\\"\\\"en\\\"\\\"\\\",\\r\\n directions_distance_units = \\\"\\\"\\\"Miles\\\"\\\"\\\",\\r\\n directions_style_name = \\\"\\\"\\\"NA Desktop\\\"\\\"\\\",\\r\\n travel_mode = \\\"\\\"\\\"Custom\\\"\\\"\\\",\\r\\n impedance = \\\"\\\"\\\"Drive Time\\\"\\\"\\\",\\r\\n gis = None):\\r\\n kwargs = locals()\\r\\n\\r\\n if stops is None:\\r\\n stops = default_stops\\r\\n\\r\\n if point_barriers is None:\\r\\n point_barriers = default_point_barriers\\r\\n\\r\\n if line_barriers is None:\\r\\n line_barriers = default_line_barriers\\r\\n\\r\\n if polygon_barriers is None:\\r\\n polygon_barriers = default_polygon_barriers\\r\\n\\r\\n if restrictions is None:\\r\\n restrictions = default_restrictions\\r\\n\\r\\n if attribute_parameter_values is None:\\r\\n attribute_parameter_values = default_attributes\\r\\n\\r\\n if route_line_simplification_tolerance is None:\\r\\n route_line_simplification_tolerance = default_tolerance\\r\\n\\r\\n param_db = {\\r\\n \\\"stops\\\": (FeatureSet, \\\"Stops\\\"),\\r\\n \\\"measurement_units\\\": (str, \\\"Measurement_Units\\\"),\\r\\n \\\"analysis_region\\\": (str, \\\"Analysis_Region\\\"),\\r\\n \\\"reorder_stops_to_find_optimal_routes\\\": (bool, \\\"Reorder_Stops_to_Find_Optimal_Routes\\\"),\\r\\n \\\"preserve_terminal_stops\\\": (str, \\\"Preserve_Terminal_Stops\\\"),\\r\\n \\\"return_to_start\\\": (bool, \\\"Return_to_Start\\\"),\\r\\n \\\"use_time_windows\\\": (bool, \\\"Use_Time_Windows\\\"),\\r\\n \\\"time_of_day\\\": (datetime, \\\"Time_of_Day\\\"),\\r\\n \\\"time_zone_for_time_of_day\\\": (str, \\\"Time_Zone_for_Time_of_Day\\\"),\\r\\n \\\"uturn_at_junctions\\\": (str, \\\"UTurn_at_Junctions\\\"),\\r\\n \\\"point_barriers\\\": (FeatureSet, \\\"Point_Barriers\\\"),\\r\\n \\\"line_barriers\\\": (FeatureSet, \\\"Line_Barriers\\\"),\\r\\n \\\"polygon_barriers\\\": (FeatureSet, \\\"Polygon_Barriers\\\"),\\r\\n \\\"use_hierarchy\\\": (bool, \\\"Use_Hierarchy\\\"),\\r\\n \\\"restrictions\\\": (str, \\\"Restrictions\\\"),\\r\\n \\\"attribute_parameter_values\\\": (FeatureSet, \\\"Attribute_Parameter_Values\\\"),\\r\\n \\\"route_shape\\\": (str, \\\"Route_Shape\\\"),\\r\\n \\\"route_line_simplification_tolerance\\\": (LinearUnit, \\\"Route_Line_Simplification_Tolerance\\\"),\\r\\n \\\"populate_route_edges\\\": (bool, \\\"Populate_Route_Edges\\\"),\\r\\n \\\"populate_directions\\\": (bool, \\\"Populate_Directions\\\"),\\r\\n \\\"directions_language\\\": (str, \\\"Directions_Language\\\"),\\r\\n \\\"directions_distance_units\\\": (str, \\\"Directions_Distance_Units\\\"),\\r\\n \\\"directions_style_name\\\": (str, \\\"Directions_Style_Name\\\"),\\r\\n \\\"travel_mode\\\": (str, \\\"Travel_Mode\\\"),\\r\\n \\\"impedance\\\": (str, \\\"Impedance\\\"),\\r\\n \\\"solve_succeeded\\\": (bool, \\\"Solve Succeeded\\\"),\\r\\n \\\"output_routes\\\": (FeatureSet, \\\"Output Routes\\\"),\\r\\n \\\"output_route_edges\\\": (FeatureSet, \\\"Output Route Edges\\\"),\\r\\n \\\"output_directions\\\": (FeatureSet, \\\"Output Directions\\\"),\\r\\n \\\"output_stops\\\": (FeatureSet, \\\"Output Stops\\\"),\\r\\n }\\r\\n return_values = [\\r\\n {\\\"name\\\": \\\"solve_succeeded\\\", \\\"display_name\\\": \\\"Solve Succeeded\\\", \\\"type\\\": bool},\\r\\n {\\\"name\\\": \\\"output_routes\\\", \\\"display_name\\\": \\\"Output Routes\\\", \\\"type\\\": FeatureSet},\\r\\n {\\\"name\\\": \\\"output_route_edges\\\", \\\"display_name\\\": \\\"Output Route Edges\\\", \\\"type\\\": FeatureSet},\\r\\n {\\\"name\\\": \\\"output_directions\\\", \\\"display_name\\\": \\\"Output Directions\\\", \\\"type\\\": FeatureSet},\\r\\n {\\\"name\\\": \\\"output_stops\\\", \\\"display_name\\\": \\\"Output Stops\\\", \\\"type\\\": FeatureSet},\\r\\n ]\\r\\n\\r\\n if gis is None:\\r\\n gis = arcgis.env.active_gis\\r\\n\\r\\n url = gis.properties.helperServices.asyncRoute.url\\r\\n return _execute_gp_tool(gis, \\\"FindRoutes\\\", kwargs, param_db, return_values, _use_async, url)\",\n \"def get_self_origin(self, routes):\\n # TODO\\n outroutes = {}\\n\\n for ip in routes.keys():\\n if routes[ip][SORG]:\\n outroutes[ip] = routes[ip]\\n\\n return outroutes\",\n \"def gtfs_routes(gtfs, output_f):\\n\\n\\t# Load up the stop times so we can find which are the best routes.\\n\\t#TODO\\n\\tstop_times_file = [x for x in gtfs.namelist() if 'stop_times' in x][0]\\n\\n\\tstoptimes_c = csv.reader((gtfs.open(stop_times_file, 'r')))\\n\\theader = stoptimes_c.next()\\n\\ttrip_id_col = header.index('trip_id')\\n\\tarrtime_col = header.index('arrival_time')\\n\\tdeptime_col = header.index('departure_time')\\n\\tstopseq_col = header.index('stop_sequence')\\n\\ttrip_times = {}\\n\\tfor row in stoptimes_c:\\n\\t\\tif row[trip_id_col] not in trip_times:\\n\\t\\t\\t# earliest seq, latest seq, earliest seq dep time, latest seq dep time\\n\\t\\t\\ttrip_times[row[trip_id_col]] = [None, None, None, None]\\n\\n\\t\\tarrtime = time_as_timedelta(row[arrtime_col])\\n\\t\\tdeptime = time_as_timedelta(row[deptime_col])\\n\\t\\tif arrtime is None or deptime is None:\\n\\t\\t\\t# bad data, skip!\\n\\t\\t\\tcontinue\\n\\t\\tseq = int(row[stopseq_col])\\n\\n\\t\\t# Find if this is an earlier item in the sequence\\n\\t\\tif trip_times[row[trip_id_col]][0] is None or trip_times[row[trip_id_col]][0] > seq:\\n\\t\\t\\ttrip_times[row[trip_id_col]][0] = seq\\n\\t\\t\\ttrip_times[row[trip_id_col]][2] = deptime\\n\\n\\t\\t# Find if this is an later item in the sequence\\n\\t\\tif trip_times[row[trip_id_col]][1] is None or trip_times[row[trip_id_col]][1] < seq:\\n\\t\\t\\ttrip_times[row[trip_id_col]][1] = seq\\n\\t\\t\\ttrip_times[row[trip_id_col]][3] = arrtime\\n\\n\\t# Load the shapes into a map that we can lookup.\\n\\t# We should do all the geometry processing here so that we only have to do\\n\\t# this once-off.\\n\\t#TODO\\n\\tshapes_file = [x for x in gtfs.namelist() if 'shapes' in x][0]\\n\\tshapes_c = csv.reader(swallow_windows_unicode(gtfs.open(shapes_file, 'r')))\\n\\n\\theader = shapes_c.next()\\n\\tshape_id_col = header.index('shape_id')\\n\\tshape_lat_col = header.index('shape_pt_lat')\\n\\tshape_lng_col = header.index('shape_pt_lon')\\n\\tshape_seq_col = header.index('shape_pt_sequence')\\n\\tshape_dist_col = header.index('shape_dist_traveled') if 'shape_dist_traveled' in header else None\\n\\n\\tshapes = {}\\n\\tshape_lengths = {}\\n\\tfor row in shapes_c:\\n\\t\\tif row[shape_id_col] not in shapes:\\n\\t\\t\\tshapes[row[shape_id_col]] = {}\\n\\n\\t\\tshapes[row[shape_id_col]][int(row[shape_seq_col])] = (Decimal(row[shape_lng_col]), Decimal(row[shape_lat_col]))\\n\\n\\t\\t# Calculate length according to GTFS\\n\\t\\t# This could also be calculated by the geometry, but we trust GTFS, right...\\n\\t\\tif shape_dist_col is not None and row[shape_dist_col]:\\n\\t\\t\\tlength = Decimal(row[shape_dist_col])\\n\\t\\t\\tif row[shape_id_col] not in shape_lengths or shape_lengths[row[shape_id_col]] < length:\\n\\t\\t\\t\\tshape_lengths[row[shape_id_col]] = length\\n\\n\\t# translate the shapes into a LineString for use by the GeoJSON module\\n\\tfor shape_id in shapes.iterkeys():\\n\\t\\tshape_keys = shapes[shape_id].keys()\\n\\t\\tshape_keys.sort()\\n\\t\\tshape = []\\n\\t\\tfor ordinal in shape_keys:\\n\\t\\t\\tshape.append(shapes[shape_id][ordinal])\\n\\n\\t\\tshapes[shape_id] = shape\\n\\n\\t# Make a matching dict between routes and shapes\\n\\ttrips = {}\\n\\ttrips_ref = {}\\n\\troute_time = {}\\n\\n\\t#TODO\\n\\ttrips_file = [x for x in gtfs.namelist() if 'trips' in x][0]\\n\\n\\ttrips_c = csv.reader(swallow_windows_unicode(gtfs.open(trips_file, 'r')))\\n\\theader = trips_c.next()\\n\\troute_id_col = header.index('route_id')\\n\\tshape_id_col = header.index('shape_id')\\n\\ttrip_id_col = header.index('trip_id')\\n\\tfor row in trips_c:\\n\\t\\t# reference count the shapes\\n\\t\\tif row[route_id_col] not in trips_ref:\\n\\t\\t\\t# route is unknown, create dict\\n\\t\\t\\ttrips_ref[row[route_id_col]] = {}\\n\\t\\t\\troute_time[row[route_id_col]] = trip_times[row[trip_id_col]]\\n\\n\\t\\tif row[shape_id_col] not in trips_ref[row[route_id_col]]:\\n\\t\\t\\t# shape is unknown, create counter\\n\\t\\t\\ttrips_ref[row[route_id_col]][row[shape_id_col]] = 0\\n\\n\\t\\t# increment counter\\n\\t\\ttrips_ref[row[route_id_col]][row[shape_id_col]] += 1\\n\\n\\t# now we're done, iterate through the reference-counters and find the best\\n\\t# shape\\n\\tfor route_id, candidate_shapes in trips_ref.iteritems():\\n\\t\\tpopular_shape, popular_shape_refs = None, 0\\n\\t\\tfor shape_id, refs in candidate_shapes.iteritems():\\n\\t\\t\\tif refs > popular_shape_refs:\\n\\t\\t\\t\\tpopular_shape, popular_shape_refs = shape_id, refs\\n\\n\\t\\t# now we should have the route's shape\\n\\t\\tassert popular_shape is not None, 'Couldn\\\\'t find a shape for route %r' % route_id\\n\\t\\ttrips[route_id] = popular_shape\\n\\n\\t# Cleanup unused variables\\n\\tdel trip_times\\n\\n\\t# lets setup our output file\\n\\toutput_layer = geojson.FeatureCollection([])\\n\\t# assume WGS84 CRS\\n\\toutput_layer.crs = geojson.crs.Named('urn:ogc:def:crs:OGC:1.3:CRS84')\\n\\n\\t# now we have all the shapes available, translate the routes\\n\\t#TODO\\n\\troutes_file = [x for x in gtfs.namelist() if 'routes' in x][0]\\n\\n\\troutes_c = csv.reader(swallow_windows_unicode(gtfs.open(routes_file, 'r')))\\n\\theader = routes_c.next()\\n\\troute_id_col = header.index('route_id')\\n\\n\\tfor row in routes_c:\\n\\t\\t# make dict of other properties\\n\\t\\tprops = dict()\\n\\t\\tfor i, h in enumerate(header):\\n\\t\\t\\tif row[i] != '':\\n\\t\\t\\t\\tprops[h] = row[i]\\n\\n\\t\\tif row[route_id_col] not in trips:\\n\\t\\t\\t# Route has no trips!\\n\\t\\t\\tprint \\\"Warning: route has no trips, skipping: %r\\\" % (row,)\\n\\t\\t\\tcontinue\\n\\n\\t\\tprops['shape_id'] = trips[row[route_id_col]]\\n\\t\\tprops['shape_refs'] = trips_ref[row[route_id_col]][props['shape_id']]\\n\\t\\tif shape_dist_col is not None and len(shape_lengths) > 0:\\n\\t\\t\\tprops['shape_length'] = shape_lengths[props['shape_id']]\\n\\t\\tprops['duration_sec'] = (route_time[row[route_id_col]][3] - route_time[row[route_id_col]][2]).total_seconds()\\n\\n\\t\\toutput_layer.features.append(geojson.Feature(\\n\\t\\t\\tgeometry=geojson.LineString(\\n\\t\\t\\t\\tcoordinates=shapes[trips[row[route_id_col]]]\\n\\t\\t\\t),\\n\\t\\t\\tproperties=props,\\n\\t\\t\\tid=row[route_id_col]\\n\\t\\t))\\n\\n\\t# now flush the GeoJSON layer to a file.\\n\\tgeojson.dump(output_layer, output_f, cls=DecimalEncoder)\",\n \"def _build_path(self):\\n for point_3d in self.path_coordinates:\\n self.connect_point_with_neighbors(point_3d)\",\n \"def route(self, mn, direction=None, via_tag=None):\\n mn = np.asarray(mn)\\n _mn = list()\\n for i in range(1, mn.shape[0]): \\n # when more than two points are given,\\n # create a multi-point wire compose of sub-routing wires\\n # connecting the points given by mn in sequence.\\n _mn.append([mn[i - 1, :], mn[i, :]])\\n route = list()\\n # via at the starting point\\n if via_tag is not None:\\n if via_tag[0] is True:\\n route.append(self.via(mn=_mn[0][0], params=None))\\n # routing wires\\n for i, __mn in enumerate(_mn):\\n xy0 = self.abs2phy[__mn[0]]\\n xy1 = self.abs2phy[__mn[1]]\\n _xy = np.array([[xy0[0], xy0[1]], [xy1[0], xy1[1]]])\\n if np.all(xy0 == xy1): # if two points are identical, generate a metal stub on the bottom layer.\\n if (direction == 'vertical') or ((direction is None) and (self.primary_grid == 'vertical')):\\n width = self.vwidth[__mn[0][0]]\\n hextension = int(width/2)\\n vextension = self.vextension0[__mn[0][0]]\\n layer = self.vlayer[__mn[0][0]]\\n else:\\n width = self.hwidth[__mn[0][1]]\\n hextension = self.hextension0[__mn[0][1]]\\n vextension = int(width/2)\\n layer = self.hlayer[__mn[0][1]]\\n else:\\n if (xy0[0] == xy1[0]) or (direction == 'vertical'): # vertical routing\\n width = self.vwidth[__mn[0][0]]\\n hextension = int(width/2)\\n vextension = self.vextension[__mn[0][0]]\\n layer = self.vlayer[__mn[0][0]]\\n color = self.xcolor[__mn[0][0]%self.xcolor.shape[0]]\\n\\n else: # horizontal routing\\n width = self.hwidth[__mn[0][1]]\\n hextension = self.hextension[__mn[0][1]]\\n vextension = int(width/2)\\n layer = self.hlayer[__mn[0][1]]\\n color = self.ycolor[__mn[0][1]%self.ycolor.shape[0]] # ycolor is determined by its grid layer.\\n p = laygo2.object.physical.Rect(xy=_xy, layer=layer, hextension=hextension, vextension=vextension, color=color)\\n route.append(p)\\n # via placement\\n if via_tag is None:\\n if (i > 0) and (i < mn.shape[0] - 1):\\n route.append(self.via(mn=__mn[0], params=None))\\n else:\\n if via_tag[i + 1] == True:\\n route.append(self.via(mn=__mn[1], params=None))\\n if len(route) == 1: # not isinstance(mn[0][0], list):\\n return route[0]\\n else:\\n return route\",\n \"def test_parse_routes(self):\\n\\n params = get_params()\\n estimator = LinearEstimator()\\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\\n model_builder = OptimizationModelBuilder(\\n constraints=[CapacityConstraint()]\\n )\\n riders = parse_models(model_dicts=test_riders, cls=Rider)\\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\\n depots = parse_models(model_dicts=test_depots, cls=Depot)\\n problem = problem_builder.build(riders, vehicles, depots)\\n model = model_builder.build(problem)\\n solution = model.solve()\\n routes = Router._parse_routes(problem, solution)\\n self.assertTrue(routes, msg='Routes could not be built.')\\n\\n for route in routes:\\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\\n self.assertTrue(\\n len(route['stops']) > 1,\\n msg='Route with single stop.'\\n )\",\n \"def create_url(_origin_details, travel_start_date, travel_start_time, destination_list):\\n prefix = 'https://timetable.search.ch/api/route.json?one_to_many=1'\\n\\n origin_body = f'&from={_origin_details}&date={travel_start_date}&time={travel_start_time}'\\n\\n # Build iteratively with necessary syntax between destinations\\n destination_body = ''\\n for i, dest in enumerate(destination_list):\\n destination_body = f'{destination_body}&to[{i}]={dest}'\\n\\n return f'{prefix}{origin_body}{destination_body}'\",\n \"def main(edges=[(0, 1, 3), (1, 3, 4), (2, 3, 3), (0, 2, 2) ], num=4):\\n\\n # initialize routers array\\n routers = []\\n for x in range(num):\\n routers.append([1000] * num)\\n routers[x][x] = 0\\n \\n # set distance to all neighbours \\n for edge in edges:\\n routers[edge[0]][edge[1]] = edge[2]\\n routers[edge[1]][edge[0]] = edge[2]\\n\\n start_table = routers.copy()\\n\\n flag = True\\n while flag:\\n upflag = False\\n for nbrs in edges:\\n routers[nbrs[0]], up_flag1 = update_table(routers[nbrs[0]], routers[nbrs[1]], dist=nbrs[2])\\n routers[nbrs[1]], up_flag2 = update_table(routers[nbrs[1]], routers[nbrs[0]], dist=nbrs[2])\\n upflag = upflag or up_flag1 or up_flag2\\n\\n flag = upflag\\n\\n return start_table, routers\",\n \"def evaluateAllRroutes(self):\\n isTrain = 1 # 1 for train, 0 for test\\n\\n performance = 0\\n normalizedPerformance = 0\\n priceTolerance = 5 # price to be tolerated\\n\\n normPerforms = []\\n for i in range(8):\\n print \\\"Route: {}\\\".format(i)\\n [perfor, normaPerfor] = self.evaluateOneRouteForMultipleTimes(self.routes[i], priceTolerance)\\n normPerforms.append(normaPerfor)\\n performance += perfor\\n normalizedPerformance += normaPerfor\\n\\n performance = round(performance/8, 2)\\n normalizedPerformance = round(normalizedPerformance/8, 2)\\n\\n if self.isTrain:\\n print \\\"\\\\nTRAIN:\\\"\\n else:\\n print \\\"\\\\nTEST:\\\"\\n print \\\"Average Performance: {}%\\\".format(performance)\\n print \\\"Average Normalized Performance: {}%\\\".format(normalizedPerformance)\\n print \\\"Normalized Performance Variance: {}\\\".format(np.var(normPerforms))\",\n \"def connection_route_from_hosts(self, ingr, egr):\\n assert(ingr is not None)\\n assert(egr is not None)\\n LOG.info(\\\"Try to connection-route %s -> %s\\\", ingr, egr)\\n\\n call_id = CallID(ingr)\\n try:\\n cep_src = ConnectionEP(ingr)\\n cep_dst = ConnectionEP(egr)\\n lsp = LspParams()\\n\\n (wero, pero) = self.routing.connectionRoute(cep_src.ident,\\n cep_dst.ident,\\n call_id.ident,\\n lsp.ident,\\n [])\\n # in any case flush the call\\n self.routing.callFlush(call_id.ident)\\n\\n return (wero, pero)\\n\\n except PCERA.CannotFetchConnEndPoint, exe:\\n LOG.error(\\\"CannotFetchConnEndPoint exception: %s\\\", str(exe))\\n except PCERA.ConnectionParamsMismatch, exe:\\n LOG.error(\\\"ConnectionParamsMismatch exception: %s\\\", str(exe))\\n except PCERA.ConnectionEroMismatch, exe:\\n LOG.error(\\\"ConnectionEroMismatch exception: %s\\\", str(exe))\\n except PCERA.ConnectionEroMismatch, exe:\\n LOG.error(\\\"ConnectionEroMismatch exception: %s\\\", str(exe))\\n except PCERA.NoRoute, exe:\\n LOG.error(\\\"NoRoute exception: %s\\\", str(exe))\\n except PCERA.CannotFetchCall, exe:\\n LOG.error(\\\"CannotFetchCall exception: %s\\\", str(exe))\\n except PCERA.InternalProblems, exe:\\n LOG.error(\\\"InternalProblems exception: %s\\\", str(exe))\\n except Exception, exe:\\n LOG.error(\\\"Generic exception: %s\\\", str(exe))\\n\\n return (None, None)\",\n \"def get_route(start_id, dest_id, csv):\\n\\n # route is not computed yet\\n if csv[start_id][dest_id] is None:\\n return -1\\n\\n route = [start_id]\\n\\n while route[-1] != dest_id:\\n # append the next node on this route\\n route.append(csv[route[-1]][dest_id])\\n\\n return route\",\n \"def writeRouteSequence(self):\\n print \\\"writing route sequence\\\"\\n f = open(PublicTransit.OUTFILE_NAME, 'wb')\\n if (PublicTransit.LINE_FILE_TYPE == LineFileType.PTLINE):\\n lines = [\\\";;<<PT>><<LINE>>;;\\\" + os.linesep]\\n elif (PublicTransit.LINE_FILE_TYPE == LineFileType.TRNBUILD):\\n lines = [\\\";;<<Trnbuild>>;;\\\" + os.linesep]\\n\\n for t in self.transitRoutes:\\n if t in self.stopsByRoute:\\n i = 0\\n self.transitRoutes[t].nodeSequence = []\\n prevLinkId = -1\\n # Bus routes have a link sequence from BusRouteTraversalEdges. Others just have stops.\\n if (len(self.transitRoutes[t].linkSequence) > 0):\\n for link in self.transitRoutes[t].linkSequence:\\n # make sure this link is within the region (i.e., it is in linksDict)\\n if (link in self.linksDict):\\n nodeToAppend = -1\\n if (i == 0):\\n nodeToAppend = self.stopsByRoute[t][0].tanaNode\\n if (nodeToAppend == -1):\\n if (self.linksDict[link].oneWay == \\\"FT\\\"):\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\\n elif (self.linksDict[link].oneWay == \\\"TF\\\"):\\n nodeToAppend = -self.linksDict[link].toNode.nodeId\\n else: # open in both directions; determine traversal direction\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId \\n elif (i == 1):\\n if (len(self.transitRoutes[t].nodeSequence) > 0):\\n if (self.linksDict[link].oneWay == \\\"FT\\\"):\\n if (self.stopsByRoute[t][0].tanaNode != self.linksDict[link].fromNode.nodeId):\\n self.transitRoutes[t].nodeSequence.append(-self.linksDict[link].fromNode.nodeId)\\n nodeToAppend = -self.linksDict[link].toNode.nodeId\\n elif (self.linksDict[link].oneWay == \\\"TF\\\"):\\n if (self.stopsByRoute[t][0].tanaNode != self.linksDict[link].toNode.nodeId):\\n self.transitRoutes[t].nodeSequence.append(-self.linksDict[link].toNode.nodeId)\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\\n else: # open in both directions\\n if (abs(self.transitRoutes[t].nodeSequence[0]) == self.linksDict[link].fromNode.nodeId):\\n nodeToAppend = -self.linksDict[link].toNode.nodeId\\n elif (abs(self.transitRoutes[t].nodeSequence[0]) == self.linksDict[link].toNode.nodeId):\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\\n elif (self.transitRoutes[t].linkSequence[0] in self.linksDict and \\n self.linksDict[self.transitRoutes[t].linkSequence[0]].toNode.nodeId == self.linksDict[link].fromNode.nodeId):\\n self.transitRoutes[t].nodeSequence.append(-self.linksDict[link].fromNode.nodeId)\\n nodeToAppend = -self.linksDict[link].toNode.nodeId\\n elif (self.transitRoutes[t].linkSequence[0] in self.linksDict and \\n self.linksDict[self.transitRoutes[t].linkSequence[0]].fromNode.nodeId == self.linksDict[link].toNode.nodeId):\\n self.transitRoutes[t].nodeSequence.append(-self.linksDict[link].toNode.nodeId)\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\\n\\n elif (prevLinkId != link and prevLinkId != -1): # ensure there are no repeated links\\n if (self.linksDict[link].oneWay == \\\"FT\\\"):\\n if (len(self.transitRoutes[t].nodeSequence) > 0 and \\n abs(self.transitRoutes[t].nodeSequence[-1]) == self.linksDict[link].fromNode.nodeId):\\n nodeToAppend = -self.linksDict[link].toNode.nodeId\\n elif (len(self.transitRoutes[t].nodeSequence) > 0):\\n self.transitRoutes[t].nodeSequence.pop()\\n if (len(self.transitRoutes[t].nodeSequence) > 0 and\\n abs(self.transitRoutes[t].nodeSequence[-1]) == self.linksDict[link].fromNode.nodeId):\\n nodeToAppend = -self.linksDict[link].toNode.nodeId\\n\\n elif (self.linksDict[link].oneWay == \\\"TF\\\"):\\n if (len(self.transitRoutes[t].nodeSequence) > 0 and\\n abs(self.transitRoutes[t].nodeSequence[-1]) == self.linksDict[link].toNode.nodeId):\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\\n elif (len(self.transitRoutes[t].nodeSequence) > 0):\\n self.transitRoutes[t].nodeSequence.pop()\\n if (len(self.transitRoutes[t].nodeSequence) > 0 and\\n abs(self.transitRoutes[t].nodeSequence[-1]) == self.linksDict[link].toNode.nodeId):\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\\n\\n else: # open in both directions\\n if (len(self.transitRoutes[t].nodeSequence) > 0):\\n # determine direction based on the previous node in the sequence. If the previous\\n # node is the same as this link's from node, append the toNode; otherwise append the fromNode.\\n if (abs(self.transitRoutes[t].nodeSequence[-1]) == \\\\\\n self.linksDict[link].fromNode.nodeId):\\n nodeToAppend = -self.linksDict[link].toNode.nodeId\\n elif (abs(self.transitRoutes[t].nodeSequence[-1]) == \\\\\\n self.linksDict[link].toNode.nodeId):\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\\n # previous link doesn't connect to this because the previous link was a duplicate\\n else:\\n self.transitRoutes[t].nodeSequence.pop()\\n if (len(self.transitRoutes[t].nodeSequence) > 0):\\n # remove the last node in the sequence and check if the one before connects to this one\\n if (abs(self.transitRoutes[t].nodeSequence[-1]) == \\\\\\n self.linksDict[link].fromNode.nodeId):\\n nodeToAppend = -self.linksDict[link].toNode.nodeId\\n elif (abs(self.transitRoutes[t].nodeSequence[-1]) == \\\\\\n self.linksDict[link].toNode.nodeId):\\n nodeToAppend = -self.linksDict[link].fromNode.nodeId\\n\\n # if the node is a stop on this route, set the node ID positive\\n if (nodeToAppend != -1):\\n if (i > 0 and abs(nodeToAppend) in [st.tanaNode for st in self.stopsByRoute[t]]):\\n nodeToAppend = -1 * nodeToAppend\\n self.transitRoutes[t].nodeSequence.append(nodeToAppend)\\n prevLinkId = link\\n \\n i += 1\\n # if the last node is not a stop, remove it\\n if (len(self.transitRoutes[t].nodeSequence) > 0 and self.transitRoutes[t].nodeSequence[-1] < 0):\\n del(self.transitRoutes[t].nodeSequence[-1])\\n \\n # if there are no links for the route, just record the stops as the nodes\\n else:\\n self.transitRoutes[t].nodeSequence = [n.tanaNode for n in self.stopsByRoute[t] if n.tanaNode != -1]\\n \\n # Only write routes with a node sequence.\\n if (len(self.transitRoutes[t].nodeSequence) > 0):\\n lines.append(self.__getPrintString(t, PublicTransit.LINE_FILE_TYPE) + os.linesep)\\n else:\\n print \\\"No node sequence for \\\" + str(t) + \\\" (\\\" + self.transitRoutes[t].new_name + \\\")\\\"\\n f.writelines(lines)\\n f.close()\",\n \"def pairing(self):\\n if len(self._paths) == 0:\\n second_values = self.data\\n get_flight = lambda x: x\\n first = True\\n else:\\n second_values = self._paths\\n get_flight = lambda x: x.get_last_flight()\\n first = False\\n\\n for value in second_values:\\n f1 = get_flight(value)\\n for f2 in self.data:\\n if f1.connects_to(f2):\\n if first:\\n self._paths.append(FlightPath(f1, f2))\\n else:\\n path_copy = copy.copy(value)\\n added = path_copy.try_add(f2)\\n if added:\\n self._paths.append(path_copy)\",\n \"def plan_trip():\\n origins = []\\n destinations = []\\n\\n origin_stop = request.args.get('origin', False)\\n destination_stop = request.args.get('destination', False)\\n origin_is_suburb = request.args.get('origin_suburb', False)\\n dest_is_suburb = request.args.get('dest_suburb', False)\\n origin_is_suburb = bool(origin_is_suburb)\\n dest_is_suburb = bool(dest_is_suburb)\\n if origin_stop and destination_stop:\\n client = api.connection()\\n origins = client.find_stops_by_name('any', origin_stop, True)\\n\\n if client.error == 404:\\n render_template(\\n \\\"trip-planner.jinja2\\\", origins=[], destinations=[], err=404\\n )\\n\\n destinations = client.find_stops_by_name('any', destination_stop, True)\\n if client.error == 404:\\n render_template(\\n \\\"trip-planner.jinja2\\\", origins=[], destinations=[], err=404\\n )\\n\\n origins = stop_information_generator(\\n origins.locations, [], origin_stop, origin_is_suburb\\n )\\n destinations = stop_information_generator(\\n destinations.locations, [], destination_stop, dest_is_suburb\\n )\\n\\n return render_template(\\n \\\"trip-planner.jinja2\\\", origins=origins, destinations=destinations, err=200\\n )\",\n \"def __compute_unit_routes(self):\\n unit_rules_graph = NearCNF.__UnitRulesGraph(self)\\n unit_routes_as_trees = {var: self.__dijkstra_max_prob_tree(unit_rules_graph, var)\\n for var in unit_rules_graph.vertices}\\n\\n def tree_to_lists(root, current_route=[], routes=None):\\n if routes is None:\\n routes = []\\n current_route.append(root.key)\\n if not root.children:\\n routes.append(current_route[:])\\n else:\\n for child in root.children:\\n tree_to_lists(child, current_route, routes)\\n current_route.pop()\\n return routes\\n\\n unit_routes_as_lists = {var: tree_to_lists(tree.root)\\n for var, tree in unit_routes_as_trees.items()}\\n return unit_routes_as_lists\",\n \"def prepare_gates(chip, source_gate, target_gate):\\n crossroad = []\\n travelled_path = []\\n\\n # Source and target always on z-axis 0\\n source_coords = [chip.gates[source_gate][\\\"x\\\"], chip.gates[source_gate][\\\"y\\\"], 0]\\n target_coords = [chip.gates[target_gate][\\\"x\\\"], chip.gates[target_gate][\\\"y\\\"], 0]\\n\\n chip = calculate_distance(target_coords, chip)\\n\\n start = chip.coordinates[0][source_coords[1]][source_coords[0]]\\n start_node = nd.Node(source_coords, None, 1, start.cost + start.distance_to_goal)\\n goal_node = nd.Node(target_coords, None, 1, 0)\\n crossroad.append(start_node)\\n\\n return run_algorithm(target_coords, start_node, goal_node, chip, crossroad, travelled_path)\",\n \"def bus_routes_direction():\\n route_list = []\\n os.chdir(\\\"../Data\\\")\\n for file in glob.glob(\\\"*.csv\\\"):\\n print(file) #useful for monitoring progress of function\\n reader = csv.reader(open(file))\\n for line in reader:\\n route = extract_route_and_direction(line[3]) # Journey ID field\\n if route not in route_list and route != \\\"\\\": # error handling for extract_bus_routes function\\n route_list.append(route)\\n return route_list\",\n \"def connect(data, x1, y1, x2, y2):\\n flag1, points1 = oneRoadConnect(data, x1, y1, x2, y2)\\n if flag1:\\n return flag1, points1\\n flag2, points2 = twoRoadConnect(data, x1, y1, x2, y2)\\n if flag2:\\n return flag2, points2\\n flag3, points3 = threeRoadConnect(data, x1, y1, x2, y2)\\n if flag3:\\n return flag3, points3\\n return False, []\",\n \"def routes(x, y, results_dict):\\n if (x, y) in results_dict: # if the value is already in the results cache then we don't need to calculate again\\n return results_dict[(x, y)]\\n\\n # we only look at the top half of the grid\\n # (as if you swap moves right/down you get equivalent number of paths)\\n elif x > y:\\n r = routes(y, x, results_dict)\\n\\n elif x == 0:\\n return 1 # only one path when x coordinate is 0\\n\\n # from any one point you can either go down or left, then the sum of the positions gives the total for the original\\n else:\\n r = routes(x - 1, y, results_dict) + routes(x, y - 1, results_dict)\\n results_dict[(x, y)] = r\\n return r\",\n \"def lookup_routes(self, daddr):\\n outroutes = []\\n for entry in self.routes:\\n for varat in entry[\\\"varats\\\"]:\\n ip = varat[\\\"network\\\"].split(\\\".\\\")\\n netmask = varat[\\\"netmask\\\"].split(\\\".\\\")\\n\\n mask_bit = \\\"\\\".join([ format(int(quad), \\\"08b\\\") for quad in netmask ])\\n num_ones = mask_bit.count(\\\"1\\\")\\n ip_bin = \\\"\\\".join([ format(int(quad), \\\"08b\\\") for quad in ip ])\\n ip_start = ip_bin[:num_ones]\\n daddr_bin = \\\"\\\".join([ format(int(quad), \\\"08b\\\") for quad in daddr.split(\\\".\\\") ])\\n if daddr_bin.startswith(ip_start):\\n outroutes.append({\\\"peer\\\": entry[\\\"peer\\\"], \\\"us\\\": entry[\\\"us\\\"], \\\"ghoti\\\": num_ones, \\\"msg\\\": varat})\\n\\n #print(\\\"outroutessssssssssssssssssssss\\\", outroutes)\\n return outroutes\",\n \"def run(self):\\n source = str(self.form.source_text.toPlainText())\\n dest = str(self.form.destination_text.toPlainText())\\n \\n self.form.source_text.clear()\\n self.form.destination_text.clear()\\n \\n if not source or not dest:\\n self.show_dialog(\\\"Empty argument.\\\")\\n return \\n\\n \\n if self.G.has_node(source) and self.G.has_node(dest):\\n if source in nx.algorithms.descendants(self.G, dest):\\n graph = nx.to_dict_of_dicts(self.G) # converting to dict based graph.\\n dijkstra = Dijkstra(graph)\\n parents, visited = dijkstra.find_route(source, dest)\\n shortest_path = dijkstra.generate_path(parents, source, dest)\\n shortest_path = \\\" -> \\\".join(shortest_path)\\n result = f\\\"Distance is {visited[dest]} units.\\\\nShortest path from {source} to {dest} is {shortest_path}\\\"\\n self.form.result_text.setText(result)\\n else:\\n self.show_dialog(f\\\"There is no connection between {source} and {dest}.\\\")\\n else:\\n self.show_dialog(f\\\"Please check source and destination.\\\")\",\n \"def solve_tsp(list_of_locations, list_of_homes, starting_car_location, adjacency_matrix, params=[]):\\n drop_off_dict = {}\\n car_path = []\\n home_map = {}\\n home_indexes = convert_locations_to_indices(list_of_homes, list_of_locations)\\n\\n start = list_of_locations.index(starting_car_location)\\n graph, msg = adjacency_matrix_to_graph(adjacency_matrix)\\n all_paths = dict(nx.all_pairs_dijkstra(graph))\\n\\n start_in_home = start in home_indexes\\n if start in home_indexes:\\n home_indexes.remove(start)\\n home_indexes.insert(0, start)\\n home_count = 0;\\n\\n for home in home_indexes:\\n #print(home, end = \\\" \\\")\\n home_map[home_count] = home\\n home_count += 1\\n # Instantiate the data problem.\\n #print(len(home_map))\\n data = create_data_model(home_indexes, 0)\\n\\n # Create the routing index manager.\\n manager = pywrapcp.RoutingIndexManager(len(data['locations']),\\n data['num_vehicles'], data['depot'])\\n\\n #print(manager.NodeToIndex(15))\\n # Create Routing Model.\\n routing = pywrapcp.RoutingModel(manager)\\n\\n def distance_callback(from_index, to_index):\\n \\\"\\\"\\\"Returns the distance between the two nodes.\\\"\\\"\\\"\\n # Convert from routing variable Index to distance matrix NodeIndex.\\n #print(home_map[to_index], end = \\\" \\\")\\n from_index = manager.IndexToNode(from_index)\\n to_index = manager.IndexToNode(to_index)\\n dist_to = all_paths.get(home_map[from_index])[0][home_map[to_index]]\\n #if from_index >= 25 or to_index >= 25:\\n # print(\\\"from\\\" if from_index >= 25 else \\\"to\\\", end = \\\" \\\")\\n #dist_to = all_paths[from_index][0][to_index]\\n return dist_to\\n\\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\\n\\n # Define cost of each arc.\\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\\n\\n # Setting first solution heuristic.\\n \\\"\\\"\\\"\\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\\n search_parameters.first_solution_strategy = (\\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\\n \\\"\\\"\\\"\\n\\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\\n search_parameters.local_search_metaheuristic = (\\n routing_enums_pb2.LocalSearchMetaheuristic.GUIDED_LOCAL_SEARCH)\\n search_parameters.time_limit.seconds = 3\\n #search_parameters.log_search = True\\n\\n # Solve the problem.\\n assignment = routing.SolveWithParameters(search_parameters)\\n\\n # if assignment:\\n # print_solution(manager, routing, assignment)\\n # Print solution on console.\\n\\n if start in home_indexes:\\n drop_off_dict[start] = [start]\\n\\n\\n index = routing.Start(0)\\n car_path.append(start)\\n\\n while not routing.IsEnd(index):\\n previous_index = manager.IndexToNode(index)\\n index = assignment.Value(routing.NextVar(index))\\n\\n car_path.pop();\\n to_index = manager.IndexToNode(index)\\n path_to = all_paths.get(home_map[previous_index])[1][home_map[to_index]]\\n drop_off_dict[home_map[to_index]] = [home_map[to_index]]\\n #print(to_index, end = ' ')\\n car_path.extend(path_to)\\n #route_distance += routing.GetArcCostForVehicle(previous_index, index, 0)\\n # for i in car_path:\\n # print(i)\\n if start in drop_off_dict.keys() and not start_in_home:\\n drop_off_dict.pop(start, None)\\n\\n return car_path, drop_off_dict\",\n \"def get_bundle_corner(\\n ports1: List[Port],\\n ports2: List[Port],\\n route_filter: Callable[..., Route] = get_route_from_waypoints,\\n separation: float = 5.0,\\n path_length_match_loops: int = None,\\n path_length_match_extra_length: float = 0.0,\\n path_length_match_modify_segment_i: int = -2,\\n **kwargs,\\n) -> List[Route]:\\n if \\\"straight\\\" in kwargs.keys():\\n _ = kwargs.pop(\\\"straight\\\")\\n\\n routes = _get_bundle_corner_waypoints(\\n ports1,\\n ports2,\\n routing_func=generate_manhattan_waypoints,\\n separation=separation,\\n **kwargs,\\n )\\n if path_length_match_loops:\\n routes = [np.array(route) for route in routes]\\n routes = path_length_matched_points(\\n routes,\\n extra_length=path_length_match_extra_length,\\n nb_loops=path_length_match_loops,\\n modify_segment_i=path_length_match_modify_segment_i,\\n **kwargs,\\n )\\n\\n return [route_filter(r, **kwargs) for r in routes]\",\n \"def skyroute(startroute, endroute, grid):\\n # Find the start and end point\\n start = startroute[-1]\\n end = endroute[-1]\\n path = astar(grid, start, end)\\n\\n # If a path is found, stitch the routes together\\n if path != None: \\n for location in reversed(startroute[:-1]):\\n path.insert(0, location)\\n\\n for location in reversed(endroute[:-1]):\\n path.insert(len(path), location)\\n\\n return path\",\n \"def __dfs_roads_directions(self, with_prints=False) -> Set[JuncRoadSingleConnection]:\\n\\n roads: Set[JuncRoadSingleConnection] = set()\\n visited_indices: Set[JuncIndices] = set()\\n\\n def dfs_rec(junc: JuncNode):\\n \\\"\\\"\\\"\\n recursively run from the input junction\\n :param junc: the junction to run from\\n \\\"\\\"\\\"\\n # add to visited\\n visited_indices.add(junc.indices)\\n # run on neighbors\\n for neighbor in self.get_connected_juncs(junc):\\n # go over unvisited juncs and add roads to them from current\\n if neighbor.indices not in visited_indices:\\n if with_prints:\\n print(junc.indices, neighbor.indices)\\n directions = self.get_connection_directions(junc, neighbor)\\n roads.add(JuncRoadSingleConnection(junc.indices, neighbor.indices, directions[0], directions[1]))\\n dfs_rec(neighbor)\\n \\\"\\\"\\\"\\n there is a case where we are currently at junc 1, which has neighbors 2,3.\\n from junc 1 wwe move to 2, that moves to 3 from it.\\n 3 will not go to 1 because 1 is visited, so the road 3->1 will not be created.\\n when returning to 1, it will not go to 3, because 3 is visited, so the road 1->3 will not be created.\\n so we result in a conncetion with no road, fix it:\\n \\\"\\\"\\\"\\n if neighbor.indices in visited_indices \\\\\\n and JuncRoadSingleConnection(junc.indices, neighbor.indices) not in roads \\\\\\n and JuncRoadSingleConnection(neighbor.indices, junc.indices) not in roads:\\n if with_prints:\\n print(\\\"special\\\", junc.indices, neighbor.indices)\\n directions = self.get_connection_directions(junc, neighbor)\\n roads.add(JuncRoadSingleConnection(junc.indices, neighbor.indices, directions[0], directions[1]))\\n # do not call dfs recursivly\\n\\n def first_node(junc: JuncNode):\\n \\\"\\\"\\\"\\n run specifically for a group-start junction\\n :param junc: a junction that is the first in a connected group\\n \\\"\\\"\\\"\\n # add to visited\\n visited_indices.add(junc.indices)\\n #\\n \\\"\\\"\\\"\\n first, choose a random road to be in-road. this prevents a first node with only out-roads.\\n a problem: if this is not the first first_node, it is possible that the random road will be \\n an already existing road, in the otehr direction. so we need to make sure that the random road we choose\\n is not already set in the other side.\\n \\\"\\\"\\\"\\n neighbors = self.get_connected_juncs(junc).copy()\\n in_checked_indices: Set[JuncIndices] = set()\\n in_road_junc = choice(neighbors)\\n in_checked_indices.add(in_road_junc.indices)\\n while JuncRoadSingleConnection(junc.indices, in_road_junc.indices) in roads and len(\\n in_checked_indices) != len(neighbors):\\n in_road_junc = choice(neighbors)\\n in_checked_indices.add(in_road_junc.indices)\\n if len(in_checked_indices) != len(neighbors):\\n # regular stop, we have found a road to be in_road.\\n directions = self.get_connection_directions(in_road_junc, junc)\\n roads.add(JuncRoadSingleConnection(in_road_junc.indices, junc.indices, directions[0], directions[1]))\\n if with_prints:\\n print(\\\"first in-road\\\", in_road_junc.indices, junc.indices)\\n # run for the rest of the neighbors\\n neighbors.remove(in_road_junc)\\n # else, this junc has only out-roads and this cannot be fixed.\\n for neighbor in neighbors:\\n if neighbor.indices not in visited_indices: # the other case is handled through the neighbor in dfs_rec\\n if with_prints:\\n print(\\\"first\\\", junc.indices, neighbor.indices)\\n directions = self.get_connection_directions(junc, neighbor)\\n roads.add(JuncRoadSingleConnection(junc.indices, neighbor.indices, directions[0], directions[1]))\\n dfs_rec(neighbor)\\n\\n all_juncs_indices: Set[JuncIndices] = {junc.indices for junc in self.get_all_juncs()}\\n # the graph may not be connected, should run until all connected parts are visited\\n while len(all_juncs_indices) != len(visited_indices):\\n # now choose a junc and run on it.\\n start_junc = self.get_junc(sample(all_juncs_indices.difference(visited_indices), 1)[0])\\n first_node(start_junc)\\n return roads\",\n \"def calculate_routes(outposts, vehicles, graph, starting_point=0, **kwargs):\\n number_of_vehicles = len(vehicles)\\n number_of_nodes = len(outposts) - 1\\n\\n # Source: https://stackoverflow.com/questions/28965734/general-bars-and-stars\\n vehicles_partitions = []\\n total_load = outposts.load.sum()\\n capacities = list(vehicles.capacity)\\n for combination in itertools.combinations(range(number_of_nodes+number_of_vehicles-1), number_of_vehicles-1):\\n current_partition = [b-a-1 for a, b in zip((-1,) + combination, combination+(number_of_nodes+number_of_vehicles-1,))]\\n current_partition = sorted(current_partition)\\n if current_partition not in vehicles_partitions:\\n vehicle_presence_vector = [0 if number==0 else 1 for number in current_partition]\\n total_capacity = np.dot(vehicle_presence_vector, capacities)\\n if total_capacity >= total_load:\\n vehicles_partitions.append(current_partition)\\n\\n dwave_solver = DWaveEngine.default()\\n if 'use_capacity_constraints' in kwargs:\\n use_capacity_constraints = kwargs['use_capacity_constraints']\\n del kwargs['use_capacity_constraints']\\n else:\\n use_capacity_constraints = True\\n print(\\\"All partitions:\\\", vehicles_partitions)\\n best_solution = None\\n for current_partition in vehicles_partitions:\\n print(\\\"Current partition: \\\", current_partition)\\n problem = Problem(vehicles=vehicles,\\n outposts=outposts,\\n vehicles_partition=current_partition,\\n graph=graph,\\n starting_point=starting_point,\\n use_capacity_constraints=use_capacity_constraints)\\n current_solution = dwave_solver.solve(problem)\\n if current_solution is None:\\n print(\\\"No valid solutions found with D-Wave\\\")\\n elif best_solution is None:\\n best_solution = current_solution\\n else:\\n current_cost = sum(sub_solution[2] for sub_solution in current_solution)\\n best_cost = best_solution.total_cost\\n if current_cost < best_cost:\\n best_solution = current_solution\\n\\n if best_solution is None:\\n return None\\n return best_solution.to_dataframe()\",\n \"def launch_parallel_rt_pairs():\\r\\n # Create the parser\\r\\n parser = argparse.ArgumentParser(description=globals().get(\\\"__doc__\\\", \\\"\\\"), fromfile_prefix_chars='@')\\r\\n\\r\\n # Define Arguments supported by the command line utility\\r\\n\\r\\n # --pair-type parameter\\r\\n help_string = \\\"The type of origin-destination pair assignment to use. Either one_to_one or many_to_many.\\\"\\r\\n parser.add_argument(\\\"-pt\\\", \\\"--pair-type\\\", action=\\\"store\\\", dest=\\\"pair_type_str\\\", help=help_string, required=True)\\r\\n\\r\\n # --origins parameter\\r\\n help_string = \\\"The full catalog path to the feature class containing the origins.\\\"\\r\\n parser.add_argument(\\\"-o\\\", \\\"--origins\\\", action=\\\"store\\\", dest=\\\"origins\\\", help=help_string, required=True)\\r\\n\\r\\n # --origins-id-field parameter\\r\\n help_string = \\\"The name of the unique ID field in origins.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-oif\\\", \\\"--origins-id-field\\\", action=\\\"store\\\", dest=\\\"origin_id_field\\\", help=help_string, required=True)\\r\\n\\r\\n # --destinations parameter\\r\\n help_string = \\\"The full catalog path to the feature class containing the destinations.\\\"\\r\\n parser.add_argument(\\\"-d\\\", \\\"--destinations\\\", action=\\\"store\\\", dest=\\\"destinations\\\", help=help_string, required=True)\\r\\n\\r\\n # --destinations-id-field parameter\\r\\n help_string = \\\"The name of the unique ID field in destinations.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-dif\\\", \\\"--destinations-id-field\\\", action=\\\"store\\\", dest=\\\"dest_id_field\\\", help=help_string, required=True)\\r\\n\\r\\n # --network-data-source parameter\\r\\n help_string = \\\"The full catalog path to the network dataset or a portal url that will be used for the analysis.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-n\\\", \\\"--network-data-source\\\", action=\\\"store\\\", dest=\\\"network_data_source\\\", help=help_string, required=True)\\r\\n\\r\\n # --travel-mode parameter\\r\\n help_string = (\\r\\n \\\"The name or JSON string representation of the travel mode from the network data source that will be used for \\\"\\r\\n \\\"the analysis.\\\"\\r\\n )\\r\\n parser.add_argument(\\\"-tm\\\", \\\"--travel-mode\\\", action=\\\"store\\\", dest=\\\"travel_mode\\\", help=help_string, required=True)\\r\\n\\r\\n # --time-units parameter\\r\\n help_string = \\\"String name of the time units for the analysis. These units will be used in the output.\\\"\\r\\n parser.add_argument(\\\"-tu\\\", \\\"--time-units\\\", action=\\\"store\\\", dest=\\\"time_units\\\", help=help_string, required=True)\\r\\n\\r\\n # --distance-units parameter\\r\\n help_string = \\\"String name of the distance units for the analysis. These units will be used in the output.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-du\\\", \\\"--distance-units\\\", action=\\\"store\\\", dest=\\\"distance_units\\\", help=help_string, required=True)\\r\\n\\r\\n # --max-routes parameter\\r\\n help_string = \\\"Maximum number of routes that can be in one chunk for parallel processing of Route solves.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-mr\\\", \\\"--max-routes\\\", action=\\\"store\\\", dest=\\\"max_routes\\\", type=int, help=help_string, required=True)\\r\\n\\r\\n # --max-processes parameter\\r\\n help_string = \\\"Maximum number parallel processes to use for the Route solves.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-mp\\\", \\\"--max-processes\\\", action=\\\"store\\\", dest=\\\"max_processes\\\", type=int, help=help_string, required=True)\\r\\n\\r\\n # --reverse-direction parameter\\r\\n help_string = \\\"Whether to reverse the direction of travel (destination to origin).\\\"\\r\\n parser.add_argument(\\r\\n \\\"-rd\\\", \\\"--reverse-direction\\\", action=\\\"store\\\", type=lambda x: bool(strtobool(x)),\\r\\n dest=\\\"reverse_direction\\\", help=help_string, required=True)\\r\\n\\r\\n # --out-routes parameter\\r\\n help_string = \\\"The full catalog path to the output routes feature class.\\\"\\r\\n parser.add_argument(\\\"-r\\\", \\\"--out-routes\\\", action=\\\"store\\\", dest=\\\"out_routes\\\", help=help_string, required=True)\\r\\n\\r\\n # --scratch-folder parameter\\r\\n help_string = \\\"The full catalog path to the scratch folder where intermediate outputs will be stored.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-sf\\\", \\\"--scratch-folder\\\", action=\\\"store\\\", dest=\\\"scratch_folder\\\", help=help_string, required=True)\\r\\n\\r\\n # --assigned-dest-field parameter\\r\\n help_string = (\\\"The name of the field in origins indicating the assigned destination. \\\"\\r\\n \\\"Required for one_to_one pair-type\\\")\\r\\n parser.add_argument(\\r\\n \\\"-adf\\\", \\\"--assigned-dest-field\\\", action=\\\"store\\\", dest=\\\"assigned_dest_field\\\", help=help_string, required=False)\\r\\n\\r\\n # --od-pair-table parameter\\r\\n help_string = \\\"CSV file holding preassigned OD pairs. Required for many_to_many pair-type.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-odp\\\", \\\"--od-pair-table\\\", action=\\\"store\\\", dest=\\\"od_pair_table\\\", help=help_string, required=False)\\r\\n\\r\\n # --time-of-day parameter\\r\\n help_string = (f\\\"The time of day for the analysis. Must be in {helpers.DATETIME_FORMAT} format. Set to None for \\\"\\r\\n \\\"time neutral.\\\")\\r\\n parser.add_argument(\\\"-tod\\\", \\\"--time-of-day\\\", action=\\\"store\\\", dest=\\\"time_of_day\\\", help=help_string, required=False)\\r\\n\\r\\n # --barriers parameter\\r\\n help_string = \\\"A list of catalog paths to the feature classes containing barriers to use in the Route.\\\"\\r\\n parser.add_argument(\\r\\n \\\"-b\\\", \\\"--barriers\\\", action=\\\"store\\\", dest=\\\"barriers\\\", help=help_string, nargs='*', required=False)\\r\\n\\r\\n try:\\r\\n # Get arguments as dictionary.\\r\\n args = vars(parser.parse_args())\\r\\n\\r\\n # Initialize a parallel Route calculator class\\r\\n rt_calculator = ParallelRoutePairCalculator(**args)\\r\\n # Solve the Route in parallel chunks\\r\\n start_time = time.time()\\r\\n rt_calculator.solve_route_in_parallel()\\r\\n LOGGER.info(f\\\"Parallel Route calculation completed in {round((time.time() - start_time) / 60, 2)} minutes\\\")\\r\\n\\r\\n except Exception: # pylint: disable=broad-except\\r\\n LOGGER.error(\\\"Error in parallelization subprocess.\\\")\\r\\n errs = traceback.format_exc().splitlines()\\r\\n for err in errs:\\r\\n LOGGER.error(err)\\r\\n raise\",\n \"def dist(a, b):\\n base_url=\\\"https://route.api.here.com/routing/7.2/calculateroute.json?\\\"\\n payload = {'app_id':HERE_ID, \\n 'app_code':HERE_CODE,\\n 'waypoint0':'geo!'+','.join([str(i) for i in a]),\\n 'waypoint1':'geo!'+','.join([str(i) for i in b]),\\n 'mode':'fastest;car;traffic:disabled',\\n }\\n resp = requests.get(base_url, params=payload)\\n data = json.loads(resp.content)\\n #import ipdb; ipdb.set_trace()\\n summary = data['response']['route'][0]['summary']\\n return {\\\"distance\\\" : summary['distance'], \\n \\\"trafficTime\\\" : summary[\\\"trafficTime\\\"],\\n \\\"baseTime\\\" : summary[\\\"baseTime\\\"]}\",\n \"def get_self_origin(self, routes):\\n outroutes = []\\n if len(routes) == 0:\\n return routes\\n\\n for route in routes:\\n if route[\\\"msg\\\"][\\\"selfOrigin\\\"]:\\n outroutes.append(route)\\n \\n if len(outroutes) == 0:\\n outroutes = routes\\n \\n return outroutes\",\n \"def Option3_routing(self, S, D, L):\\n if self.has_path(S, D): \\n Shortest_path = nx.dijkstra_path(self.G, S, D, weight='w') \\n Opt_path = Shortest_path\\n path_cost_with_concave_function = self.calculate_path_cost_with_concave_function(Shortest_path, 'c1', 'c2')\\n return path_cost_with_concave_function, Opt_path\\n while len(Shortest_path) != 0:\\n path_cost = self.additive_path_cost(Shortest_path, 'w') \\n #self.logger.info('Path cost - %d', path_cost)\\n if path_cost <= L:\\n \\\"\\\"\\\"go to path cost with weighted sum\\\"\\\"\\\"\\n path_cost_with_concave_function = self.calculate_path_cost_with_concave_function(Shortest_path, 'c1', 'c2')\\n self.G = self.rm_edge_constraint(path_cost_with_concave_function) # remove all links where the concave link is greater than PathConcave_cost \\n Opt_path = Shortest_path\\n if self.has_path(S, D):\\n Shortest_path = nx.dijkstra_path(self.G, S, D, weight='w')\\n else:\\n Shortest_path = [] \\n else:\\n break \\n else:\\n self.logger.info('No path from %s to %s', S, D)\\n Opt_path = []\\n path_cost_with_concave_function = 0\\n return path_cost_with_concave_function, Opt_path\",\n \"def _map(inputs, n_units, connection_type):\\n\\tif len(inputs) == n_units:\\n\\t\\toutput = [[inputs[i-1],inputs[i]] for i in range(n_units)]\\n\\telif len(inputs) < n_units:\\n\\t\\toutput = []\\n\\t\\tinput_dim = len(inputs)\\n\\t\\t#Units that can connect staight forwards\\n\\t\\toutput = [[inputs[i-1],inputs[i]] for i in range(input_dim)]\\n\\t\\tn_units -= input_dim\\n\\t\\tcurrent_input_index = 0\\n\\t\\t#Begin successively connecting units to the least conneceted input\\n\\t\\twhile n_units > 0:\\n\\t\\t\\toutput.append([inputs[current_input_index], inputs[current_input_index]])\\n\\t\\t\\tn_units -= 1\\n\\t\\t\\tcurrent_input_index += 1\\n\\t\\t\\t#Run to end of list --> All units are equally connected. (Got to beginning)\\n\\t\\t\\tif current_input_index == input_dim:\\n\\t\\t\\t\\tcurrent_input_index = 0\\n\\telse: #(len(inputs) > n_units)\\n\\t\\tcollpase_units = len(inputs) - n_units\\n\\t\\tif n_units == 1:\\n\\t\\t\\tpass\\n\\t\\telif collpase_units % 2 == 1:\\n\\t\\t\\traise ValueError('Must be an even difference between previous layer and next layer')\\n\\t\\toutput = [[inputs[2*i],inputs[2*i + 1]] for i in range(collpase_units)]\\n\\t\\tfor i in range(2*collpase_units, n_units):\\n\\t\\t\\tif i == 2*collpase_units:\\n\\t\\t\\t\\toutput.append([inputs[-1],inputs[i]])\\n\\t\\t\\telse:\\n\\t\\t\\t\\toutput.append([inputs[i-1],inputs[i]])\\n\\tif connection_type == 'shuffle':\\n\\t\\treturn _shuffle(output)\\n\\telse:\\n\\t\\treturn output\",\n \"def routing_step(self, layout: dict, circuit: Circuit):\\n\\n _, final_mapping = self.routing_algorithm(circuit, layout)\\n return final_mapping\",\n \"def _route_to_dest(self):\\n # Ask the network\\n self.route = self.network.determine_route(self.start, self.dest)\\n # Set the index to where we are now\\n self.route_index = 0\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6572114","0.64402664","0.59652627","0.5922691","0.5920702","0.5907399","0.59004366","0.58980155","0.5884197","0.58173287","0.57752156","0.57466954","0.57233685","0.5712399","0.57113975","0.57011473","0.56868786","0.56685567","0.5667153","0.5647773","0.5605486","0.5595886","0.5592085","0.5582648","0.5551592","0.5549158","0.5522677","0.54830205","0.54818755","0.5395321","0.53893286","0.53654003","0.533934","0.53393304","0.53325164","0.53195435","0.5306127","0.526093","0.52558076","0.52555287","0.52490765","0.52357984","0.52272403","0.5222721","0.52016884","0.5199761","0.5163005","0.5151626","0.5144685","0.51322764","0.51094437","0.50999993","0.50946987","0.50824183","0.50776005","0.50619453","0.50593674","0.5057641","0.5046974","0.50469273","0.5045797","0.5043329","0.5036945","0.50266194","0.50208783","0.5018812","0.50164","0.5012349","0.4997355","0.49929446","0.49853575","0.49609044","0.4954701","0.49543405","0.49542183","0.49517858","0.4944907","0.4937214","0.4934022","0.49321496","0.49303183","0.4906692","0.4899488","0.48869202","0.4881746","0.48812813","0.4879912","0.48679522","0.48636717","0.48589027","0.48587388","0.48518768","0.48467314","0.4844236","0.48396248","0.48392773","0.48247617","0.48176882","0.48157358","0.4813623"],"string":"[\n \"0.6572114\",\n \"0.64402664\",\n \"0.59652627\",\n \"0.5922691\",\n \"0.5920702\",\n \"0.5907399\",\n \"0.59004366\",\n \"0.58980155\",\n \"0.5884197\",\n \"0.58173287\",\n \"0.57752156\",\n \"0.57466954\",\n \"0.57233685\",\n \"0.5712399\",\n \"0.57113975\",\n \"0.57011473\",\n \"0.56868786\",\n \"0.56685567\",\n \"0.5667153\",\n \"0.5647773\",\n \"0.5605486\",\n \"0.5595886\",\n \"0.5592085\",\n \"0.5582648\",\n \"0.5551592\",\n \"0.5549158\",\n \"0.5522677\",\n \"0.54830205\",\n \"0.54818755\",\n \"0.5395321\",\n \"0.53893286\",\n \"0.53654003\",\n \"0.533934\",\n \"0.53393304\",\n \"0.53325164\",\n \"0.53195435\",\n \"0.5306127\",\n \"0.526093\",\n \"0.52558076\",\n \"0.52555287\",\n \"0.52490765\",\n \"0.52357984\",\n \"0.52272403\",\n \"0.5222721\",\n \"0.52016884\",\n \"0.5199761\",\n \"0.5163005\",\n \"0.5151626\",\n \"0.5144685\",\n \"0.51322764\",\n \"0.51094437\",\n \"0.50999993\",\n \"0.50946987\",\n \"0.50824183\",\n \"0.50776005\",\n \"0.50619453\",\n \"0.50593674\",\n \"0.5057641\",\n \"0.5046974\",\n \"0.50469273\",\n \"0.5045797\",\n \"0.5043329\",\n \"0.5036945\",\n \"0.50266194\",\n \"0.50208783\",\n \"0.5018812\",\n \"0.50164\",\n \"0.5012349\",\n \"0.4997355\",\n \"0.49929446\",\n \"0.49853575\",\n \"0.49609044\",\n \"0.4954701\",\n \"0.49543405\",\n \"0.49542183\",\n \"0.49517858\",\n \"0.4944907\",\n \"0.4937214\",\n \"0.4934022\",\n \"0.49321496\",\n \"0.49303183\",\n \"0.4906692\",\n \"0.4899488\",\n \"0.48869202\",\n \"0.4881746\",\n \"0.48812813\",\n \"0.4879912\",\n \"0.48679522\",\n \"0.48636717\",\n \"0.48589027\",\n \"0.48587388\",\n \"0.48518768\",\n \"0.48467314\",\n \"0.4844236\",\n \"0.48396248\",\n \"0.48392773\",\n \"0.48247617\",\n \"0.48176882\",\n \"0.48157358\",\n \"0.4813623\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.48959836"},"document_rank":{"kind":"string","value":"83"}}},{"rowIdx":94756,"cells":{"query":{"kind":"string","value":"Validate Route settings before spinning up a bunch of parallel processes doomed to failure. Also check which field name in the output OD Lines will store the optimized cost values. This depends on the travel mode being used by the analysis, and we capture it here to use in later steps."},"document":{"kind":"string","value":"def _validate_route_settings(self):\r\n # Create a dummy Route object and set properties. This allows us to\r\n # detect any errors prior to spinning up a bunch of parallel processes and having them all fail.\r\n LOGGER.debug(\"Validating Route settings...\")\r\n rt = None\r\n try:\r\n rt = Route(**self.rt_inputs)\r\n rt.initialize_rt_solver()\r\n LOGGER.debug(\"Route settings successfully validated.\")\r\n except Exception:\r\n LOGGER.error(\"Error initializing Route analysis.\")\r\n errs = traceback.format_exc().splitlines()\r\n for err in errs:\r\n LOGGER.error(err)\r\n raise\r\n finally:\r\n if rt:\r\n LOGGER.debug(\"Deleting temporary test Route job folder...\")\r\n # Close logging\r\n rt.teardown_logger()\r\n # Delete output folder\r\n shutil.rmtree(rt.job_result[\"jobFolder\"], ignore_errors=True)\r\n del rt"},"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 f_check_adr_parameters_correctness(dict):\n\n if int(dict[\"operation_mode_num\"]) not in (0, 1, 2, 3, 4, 5, 6):\n print('\\n Error!!! Operation mode is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"FFT_size_samples\"]) not in (2048, 4096, 8192, 16384, 32768):\n print('\\n Error!!! FFT size is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"spectra_averaging\"]) < 16 or int(dict[\"spectra_averaging\"]) > 32768:\n print('\\n Error!!! Spectra averaging number is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"start_line_freq\"]) not in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16): # 0 … (SFFT-1024)/1024\n print('\\n Error!!! Start frequency line is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"width_line_freq\"]) not in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16):\n print('\\n Error!!! Frequency width line is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"width_line_freq\"]) > ((int(dict[\"FFT_size_samples\"]) - int(dict[\"start_line_freq\"]) * 1024) / 1024): # 1 … (SFFT-SLINE*1024)/1024\n print('\\n Error!!! Frequency width is bigger than FFT size allows!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"clock_source\"]) not in (0, 1):\n print('\\n Error!!! Clock source is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"sum_diff_mode_num\"]) not in (0, 1):\n print('\\n Error!!! Sum-diff mode is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"data_file_size\"]) < -1 or int(dict[\"data_file_size\"]) > 4096:\n print('\\n Error!!! File size value is wrong!\\n')\n sys.exit(' Program stopped!')\n\n '''\n if (int(dict[\"chan_diff_delay\"]) < 0 or int(parameters_dict[\"chan_diff_dalay\"]) > 1024):\n print('\\n Error!!! Channel difference delay is wrong!\\n')\n sys.exit(' Program stopped!')\n '''\n\n # print('\\n ADR parameters from file are correct!\\n')\n\n return dict","def check_violation(route, vehicle_type):\r\n if len(route) == 2: # [0, 0] route\r\n return True, 0, 0, 0\r\n else:\r\n accu_res = [0, 0, 0] # 0-leaving time, 1-accumulated distance, 2-volume\r\n if vehicle_type == 2:\r\n veh_cap = small_veh\r\n elif vehicle_type == 3:\r\n veh_cap = medium_veh\r\n elif vehicle_type == 5:\r\n veh_cap = large_veh\r\n else:\r\n veh_cap = large_veh\r\n print('Input wrong vehicle type!', vehicle_type)\r\n # small_veh = [1, 12, 10, 400000, 0.012, 200]\r\n fixed_cost = veh_cap[5]\r\n trans_cost = 0\r\n # wait_cost = 0\r\n if time_mat[0, route[1]] < num_timez[route[1]][0]:\r\n accu_res[0] = num_timez[route[1]][0] - time_mat[0, route[1]] # vehicle leaving depot time\r\n depart_time = accu_res[0] # departing from depot time\r\n else:\r\n depart_time = 0\r\n for i in range(len(route) - 1):\r\n last_cust = route[i]\r\n curr_cust = route[i+1]\r\n # checking leaving time\r\n arr_time = accu_res[0] + time_mat[last_cust, curr_cust]\r\n if arr_time < num_timez[curr_cust][0]:\r\n accu_res[0] = num_timez[curr_cust][0] + oprt_t\r\n wait_time = num_timez[curr_cust][0] - arr_time\r\n # wait_cost += (wait_time / 60. * wait_cost0)\r\n elif arr_time <= num_timez[curr_cust][1]:\r\n accu_res[0] = arr_time + oprt_t\r\n else:\r\n # print('Infeasible route!(Service Time Error.)')\r\n return False, 1000000, 0, 0\r\n\r\n # checking vehicle max distance\r\n trans_cost += (dist_mat[last_cust, curr_cust] * veh_cap[4])\r\n\r\n accu_res[1] += dist_mat[last_cust, curr_cust]\r\n\r\n if accu_res[0] - oprt_t - depart_time > veh_cap[3]:\r\n # print('Infeasible route!(Max Time Error.)')\r\n return False, 1000000, 0, 0\r\n\r\n # checking vehicle max volume\r\n accu_res[2] += (num_demd[curr_cust][0] * bskt_vol + num_demd[curr_cust][1] * trsf_vol + (num_demd[curr_cust][2]\r\n + num_demd[curr_cust][3]) * milk_vol + num_demd[curr_cust][4] * paper_bskt)\r\n\r\n if accu_res[2] > veh_cap[2]:\r\n # print('Infeasible route!(Max Weight/Volume Error.)', accu_res[2])\r\n return False, 1000000, 0, 0\r\n route_cost = fixed_cost + accu_res[1] * veh_cap[4]\r\n route_dist = accu_res[1]\r\n route_time = accu_res[0] - oprt_t - depart_time\r\n # print fixed_cost, trvl_cost, trvl_dist\r\n return True, route_cost, route_time, depart_time + 600","def validate_params(self) -> None:\n # cap must be given when using logistic growth\n if (self.growth == \"logistic\") and (self.cap is False):\n msg = \"Capacity must be provided for logistic growth\"\n logging.error(msg)\n raise ValueError(msg)\n\n # If custom_seasonalities passed, ensure they contain the required keys.\n reqd_seasonality_keys = [\"name\", \"period\", \"fourier_order\"]\n if not all(\n req_key in seasonality\n for req_key in reqd_seasonality_keys\n for seasonality in self.custom_seasonalities\n ):\n msg = f\"Custom seasonality dicts must contain the following keys:\\n{reqd_seasonality_keys}\"\n logging.error(msg)\n raise ValueError(msg)\n\n # If extra_regressors passed, ensure they contain the required keys.\n all_regressor_keys = {\"name\", \"prior_scale\", \"mode\"}\n for regressor in self.extra_regressors:\n if not isinstance(regressor, dict):\n msg = f\"Elements in `extra_regressor` should be a dictionary but receives {type(regressor)}.\"\n _error_msg(msg)\n if \"name\" not in regressor:\n msg = \"Extra regressor dicts must contain the following keys: 'name'.\"\n _error_msg(msg)\n if not set(regressor.keys()).issubset(all_regressor_keys):\n msg = f\"Elements in `extra_regressor` should only contain keys in {all_regressor_keys} but receives {regressor.keys()}.\"\n _error_msg(msg)\n self._reqd_regressor_names = [\n regressor[\"name\"] for regressor in self.extra_regressors\n ]\n # check floor and cap\n if (self.cap is not False) and (\"cap\" not in self._reqd_cap_floor_names):\n self._reqd_cap_floor_names.append(\"cap\")\n if self.floor is not False and (\"floor\" not in self._reqd_cap_floor_names):\n self._reqd_cap_floor_names.append(\"floor\")","def routeOptions(ORBITS, SET_OF_VEHICLES, CURRENT_WEATHER):\n OPTION = []\n for eachOrbit in ORBITS:\n if eachOrbit.traffic_speed == 0:\n print('Route {} Blocked'.format(eachOrbit.route_name))\n OPTION = None\n break\n else:\n for eachVehicle in SET_OF_VEHICLES:\n if eachVehicle.weather_suitability(CURRENT_WEATHER):\n eff_speed = min(eachVehicle.max_speed, eachOrbit.traffic_speed)\n time_taken = (eachOrbit.distance/eff_speed)+(eachVehicle.cross_crater*eachOrbit.craters*crater_factor(CURRENT_WEATHER)/60)\n time_taken = round(time_taken, 2)\n OPTION.append((eachVehicle.veh_type, eachOrbit.route_name, time_taken))\n else:\n continue\n return OPTION","def _validate(self):\n _models = {'hrrr', 'hrrrak', 'rap'}\n _fields = {'prs', 'sfc', 'nat', 'subh'}\n \n self.date = pd.to_datetime(self.date)\n \n if self.model == 'alaska':\n self.model == 'hrrrak'\n\n assert self.fxx in range(49), \"Forecast lead time `fxx` is too large\"\n assert self.model in _models, f\"`model` must be one of {_models}\"\n if self.model in ['hrrr', 'hrrrak']:\n assert self.field in _fields, f\"`field must be one of {_fields}\"\n else:\n # field is not needed for RAP model.\n self.field = ''\n \n if isinstance(self.priority, str):\n self.priority = [self.priority]\n \n self.priority = [i.lower() for i in self.priority]\n\n # Don't look for data from NOMADS if requested date is earlier\n # than yesterday. NOMADS doesn't keep data that old.\n if 'nomads' in self.priority:\n yesterday = datetime.utcnow() - timedelta(hours=24)\n yesterday = pd.to_datetime(f\"{yesterday:%Y-%m-%d}\")\n if self.date < yesterday:\n self.priority.remove('nomads')","def validate(self):\n variables = ['bottomDepth', 'layerThickness', 'maxLevelCell',\n 'temperature', 'salinity']\n compare_variables(\n test_case=self, variables=variables,\n filename1='initial_state/initial_state.nc')\n\n variables = ['temperature', 'layerThickness']\n compare_variables(\n test_case=self, variables=variables,\n filename1='forward/output/output.0001-01-01_00.00.00.nc')\n\n if self.with_particles:\n # just do particle validation at coarse res\n variables = [\n 'xParticle', 'yParticle', 'zParticle', 'zLevelParticle',\n 'buoyancyParticle', 'indexToParticleID', 'currentCell',\n 'transfered', 'numTimesReset']\n compare_variables(test_case=self, variables=variables,\n filename1='forward/analysis_members/'\n 'lagrPartTrack.0001-01-01_00.00.00.nc')\n\n timers = ['init_lagrPartTrack', 'compute_lagrPartTrack',\n 'write_lagrPartTrack', 'restart_lagrPartTrack',\n 'finalize_lagrPartTrack']\n compare_timers(self, timers, rundir1='forward')","def run_parameters_validations(self):\n if self.risk_rule:\n if 'connectApi' not in self.services:\n return_error(\"You entered a risk rule but the 'connectApi' service is not chosen. \"\n \"Add the 'connectApi' service to the list or remove the risk rule.\")\n else:\n for risk_rule in self.risk_rule:\n if not is_valid_risk_rule(self, risk_rule):\n return_error(f\"The given risk rule: {risk_rule} does not exist,\"\n f\"please make sure you entered it correctly. \\n\"\n f\"To see all available risk rules run the '!rf-get-risk-rules' command.\")\n\n if self.fusion_file_path is not None:\n if 'fusion' not in self.services:\n return_error(\"You entered a fusion file path but the 'fusion' service is not chosen. \"\n \"Add the 'fusion' service to the list or remove the fusion file path.\")","def validate(self):\n self.__log('Validating whether all conditions are met.')\n if not self.config['OUT_FOLDER'] or not self.config['OUTPUT_FOLDER']:\n self.__log('The path to the output folder cannot be found.', 'error')\n raise FileNotFoundError\n\n try:\n if '.' in self.output_filename:\n self.__log('The output filename should not contain an extension.', 'error')\n raise ValueError\n except TypeError:\n pass\n\n if not self.output_filename:\n self.__log('The output filename has not been specified.', 'warning')\n self.output_filename = self.hash_time()\n i = 0\n while self.output_file_exists():\n self.__log('Adding a unique identifier to current filename.', 'warning')\n self.output_filename = self.output_filename + '-' + i\n i += 1\n self.__log(f'Continuing with file: \"{self.output_filename}\"', 'success')\n\n # Iterate over options to check for required parameters, as to not waste requests\n self.__log('Starting to check if all required parameters are set')\n for key, value in self.options.items():\n if key in self.config['REQUIRED_PARAMETERS'] and not value:\n self.__log(f'Missing a required parameter: {key}', 'error')\n raise MissingRequiredParameterError(key)\n\n self.__log('All validation successful.', 'success')","def validateOutputParams(self):\n \n # success\n retval = 1\n if not self.__args.has_key('separationaxis'):\n return retval\n \n else:\n sepaxis = self.__args['separationaxis']\n\n # Task mstransform\n if self.__taskname == \"mstransform\":\n if sepaxis != 'scan' and (self.__args['combinespws'] == True or self.__args['nspw'] > 1):\n casalog.post('Cannot partition MS per spw or auto when combinespws = True or nspw > 1', 'WARN')\n retval = 0\n \n elif sepaxis != 'spw' and self.__args['timespan'] == 'scan':\n casalog.post('Time averaging across scans may lead to wrong results when separation axis is not spw', 'WARN')\n \n return retval","def validateTradeRoute(self, tradeRouteDict):\n try:\n systemFrom = self.systems[tradeRouteDict['fromSystem']]\n systemTo = self.systems[tradeRouteDict['toSystem']]\n # has a trade route already been setup between these planets?\n (sysFrom, sysTo, type) = string.split(tradeRouteDict['id'], '-')\n # are these systems adjacent, or share a warp gate with a trade pact\n if systemTo.id in systemFrom.connectedSystems:\n pass\n elif systemTo.id in systemFrom.warpGateSystems:\n tempRoute = anwp.aw.traderoute.TradeRoute(tradeRouteDict)\n warpReq = tempRoute.getWarpRequired()\n if warpReq > (systemFrom.usedWGC + systemFrom.availWGC):\n return 'System:%s Requires %d Warp Capactiy to setup this Trade Route' % (systemFrom.name, warpReq)\n if warpReq > (systemTo.usedWGC + systemTo.availWGC):\n return 'System:%s Requires %d Warp Capactiy to setup this Trade Route' % (systemTo.name, warpReq)\n else:\n return 'Systems are not adjacent and have no warp gates between them'\n # do these systems share the same empire owner, or are the two empires in a trade pact?\n if systemFrom.myEmpireID <> systemTo.myEmpireID and anwp.func.globals.diplomacy[self.empires[systemFrom.myEmpireID].diplomacy[systemTo.myEmpireID].diplomacyID]['trade'] == 0:\n return 'System Owners are not the same, or no Trade Pact in Effect'\n # is a negative trade route being sent?\n if (tradeRouteDict['AL'] < 0 or tradeRouteDict['EC'] < 0 or tradeRouteDict['IA'] < 0):\n return 'you cannot send negative values in trade'\n # is something being sent?\n if (tradeRouteDict['AL'] == 0 and tradeRouteDict['EC'] == 0 and tradeRouteDict['IA'] == 0) and tradeRouteDict['type'] <> 'GEN':\n return 'no resources are being sent, trade route invalid'\n # does the system have the resources to setup this trade?\n if (systemFrom.AL < tradeRouteDict['AL'] or systemFrom.EC < tradeRouteDict['EC'] or\n systemFrom.IA < tradeRouteDict['IA']):\n return '%s does not have enough resources to setup this trade route' % systemFrom.name\n return 1\n except:\n return 'galaxy->validateTradeRoute error'","def check_params(self):\r\n \r\n # TODO: More cases?\r\n\r\n if self.N <= 0:\r\n print('Bad Parameter: N')\r\n \r\n if self.Ha_tally <= 0 or self.Ha_tally > self.N:\r\n print('Bad Parameter: Reported winner tally')\r\n \r\n if len(self.round_sched) < 1 or not self.check_inc_sched(self.round_sched):\r\n print('Bad Parameter: Round Schedule')\r\n\r\n if self.alpha <= 0 or self.alpha >= .5:\r\n print('Bad Parameter: Alpha')","def check_kpts(self):\n if 'fleurinp' in self.ctx.inputs:\n fleurinp = self.ctx.inputs.fleurinp\n else:\n fleurinp = get_fleurinp_from_remote_data(self.ctx.inputs.parent_folder)\n\n only_even_MPI = self.inputs.add_comp_para['only_even_MPI']\n forbid_single_mpi = self.inputs.add_comp_para['forbid_single_mpi']\n try:\n machines, mpi_tasks, omp_threads, message = optimize_calc_options(self.ctx.num_machines,\n self.ctx.num_mpiprocs_per_machine,\n self.ctx.num_cores_per_mpiproc,\n self.ctx.use_omp,\n self.ctx.suggest_mpi_omp_ratio,\n fleurinp,\n only_even_MPI=only_even_MPI,\n forbid_single_mpi=forbid_single_mpi)\n except ValueError as exc:\n self.report(exc)\n return self.exit_codes.ERROR_NOT_OPTIMAL_RESOURCES\n\n self.report(message)\n\n self.ctx.inputs.metadata.options['resources']['num_machines'] = machines\n self.ctx.inputs.metadata.options['resources']['num_mpiprocs_per_machine'] = mpi_tasks\n if self.ctx.use_omp:\n self.ctx.inputs.metadata.options['resources']['num_cores_per_mpiproc'] = omp_threads\n if 'environment_variables' not in self.ctx.inputs.metadata.options:\n self.ctx.inputs.metadata.options['environment_variables'] = {}\n self.ctx.inputs.metadata.options['environment_variables']['OMP_NUM_THREADS'] = str(omp_threads)","def test_validate(self):\n assert \"skip_validation\" not in self.route.route\n\n route = self.route.validate()\n assert \"skip_validation\" not in route.route\n\n route = self.route.validate(False)\n assert \"skip_validation\" in route.route","def run_travel_optimisation(trip_start_date, is_min_co2_search = False, is_force_compute = False):\n \n waypoint_co2 = {}\n waypoint_durations = {}\n\n # get all prefectures referential\n db_connector = Connector()\n with db_connector:\n results = db_connector.execute_query(sql.SQL_GET_ALL_PREFECTURE)\n all_waypoints = pd.DataFrame(results.fetchall())\n\n # Vérification si les trajets péfecture à préfecture ont été déjà calculés\n db_connector = Connector()\n with db_connector:\n saved_waypoints = db_connector.execute_query(sql.SQL_GET_WAYPOINTS)\n\n # Dans le précalcul des trajets optimaux, utilisation de la date courante\n travel_date = datetime.now().strftime(\"%Y%m%dT%H%M%S\")\n bad_waypoints = []\n\n if saved_waypoints.rowcount > 0 and not is_force_compute:\n print(\"le référentiel des voyage existe déjà\")\n else:\n try:\n bdd_management.truncate_journey()\n\n for (from_city, to_city) in combinations(all_waypoints[0].values, 2):\n try:\n if int(from_city) in bad_waypoints or int(to_city) in bad_waypoints:\n continue\n\n route = requests.get(API_NAVITIA.format(\n int(from_city), int(to_city), travel_date, API_KEY))\n response = json.loads(route.text)\n\n mid_duration = 0\n mid_co2 = 0\n for journey in response[\"journeys\"]:\n mid_duration += journey[\"duration\"]\n mid_co2 += journey[\"co2_emission\"][\"value\"]\n\n waypoint_co2[frozenset([from_city, to_city])\n ] = mid_co2/len(response[\"journeys\"])\n waypoint_durations[frozenset(\n [from_city, to_city])] = mid_duration/len(response[\"journeys\"])\n\n except Exception as e:\n print(\"Error with finding the route between %s and %s : %s\" %\n (from_city, to_city, response[\"error\"][\"message\"]))\n if 'no destination point' == response[\"error\"][\"message\"]:\n bad_waypoints.append(int(to_city))\n\n if 'no origin point' == response[\"error\"][\"message\"]:\n bad_waypoints.append(int(from_city))\n\n for bad_insee_code in re.findall('The entry point: admin:fr:([0-9]+) is not valid', response[\"error\"][\"message\"]):\n if not int(bad_insee_code) in bad_waypoints:\n bad_waypoints.append(int(bad_insee_code))\n\n # Enregistrement des trajets point à point (préfecture à préfecture)\n db_connector = Connector()\n with db_connector:\n for (waypoint1, waypoint2) in waypoint_co2.keys():\n waypoint = [waypoint1,\n waypoint2,\n str(waypoint_co2[frozenset([waypoint1, waypoint2])]),\n str(int(waypoint_durations[frozenset([waypoint1, waypoint2])]))]\n \n db_connector.execute_nonquery(sql.SQL_INSERT_WAYPOINT, waypoint)\n # commit trajets unitaires dans la bdd\n db_connector.commit()\n\n # enregistrement des préfectures non trouvée (pas de gare)\n print(bad_waypoints)\n db_connector = Connector()\n with db_connector:\n for bad_city in bad_waypoints:\n db_connector.execute_nonquery(\n sql.SQL_INSERT_CITY_WITHOUT_STATION, str(bad_city))\n #db_connector.commit()\n except Exception as e:\n print('Erreur durant la génération des trajets de préfecture en préfecture. Rollback effectué')\n\n waypoint_co2 = {}\n waypoint_durations = {}\n processed_waypoints = set()\n\n db_connector = Connector()\n with db_connector:\n waypoints = db_connector.execute_query(sql.SQL_GET_WAYPOINTS)\n\n for row in waypoints:\n waypoint_co2[frozenset([int(row[0]), int(row[1])])] = row[2]\n waypoint_durations[frozenset([int(row[0]), int(row[1])])] = row[3]\n processed_waypoints.update([row[0], row[1]])\n\n travel_results = algorithms.run_genetic_algorithm(waypoints = list(processed_waypoints), is_min_co2_search = is_min_co2_search, generations=300, population_size=100 )\n\n # take most represented trip order\n journey_groups = Counter(chain(*travel_results))\n top_journeys = journey_groups.most_common(1)[0][0]\n\n print('Le voyage le plus représentatif est :')\n print(top_journeys)\n\n # calcul des horaires de voyage réels pour le trajet le plus optimisé\n\n print('Départ du calcul du voyage le %s' %\n (datetime_str_to_datetime_str(trip_start_date)))\n travel_date = trip_start_date\n\n db_connector = Connector()\n with db_connector:\n try:\n #vidage de la table contenant les informations du voyage\n bdd_management.truncate_roadtrip()\n\n for i in range(len(top_journeys)-1):\n try:\n from_city_insee = top_journeys[i]\n to_city_insee = top_journeys[i+1]\n route = requests.get(API_NAVITIA.format(\n int(from_city_insee), int(to_city_insee), travel_date, API_KEY))\n travels = json.loads(route.text)\n\n # Contrôle des voyage reçus pour identifier le plus adapté à recherche\n best_travel = travels[\"journeys\"][0]\n for travel in travels[\"journeys\"]:\n if is_min_co2_search and float(best_travel['co2_emission']['value']) > float(travel['co2_emission']['value']):\n best_travel = travel\n if best_travel['arrival_date_time'] > travel['arrival_date_time']:\n best_travel = travel\n\n # sauvegarde du trajet 'i' en base\n save_trip_section(db_connector, all_waypoints, from_city_insee, to_city_insee, best_travel)\n\n # le prochain trajet devra avoir une date de départ > à la date de ce trajet\n travel_date = best_travel['arrival_date_time']\n\n except Exception as e:\n print(\"!! Erreur durant le calcul du trajet entre '%s' et '%s'\" %\n (from_city_insee, to_city_insee))\n\n #Ecriture du résumé du voyage\n resume = db_connector.execute_query(sql.SQL_GET_C02_CONSUMPTION_RESUME)\n resume = resume.fetchone()\n\n resume_description = \"\"\"Début du voyage le {} . Arrivée le {}. \n Le voyage à durée {} pour un total de {:d} kgeC\"\"\".format(\n datetime_str_to_datetime_str(trip_start_date),\n datetime_str_to_datetime_str(travel_date),\n str(timedelta(seconds=resume[0])) ,\n trunc( resume[1]/1000))\n\n store_section(db_connector, resume_description, None, None, 'INFO', resume[0], resume[1])\n\n db_connector.commit()\n\n except Exception as e:\n db_connector.rollback()\n print('Erreur durant la création du voyage. rollback effectué!!!')\n\n print('print map with road-trip data')\n visualization.generate_visualization()\n\n print('Travel complete. Have nive trip!!!')","def _check_log_params(self):\n steps_per_stats = self.configs['steps_per_stats']\n if not steps_per_stats or steps_per_stats < 0:\n steps_per_stats = 100\n steps_per_eval = self.configs['steps_per_eval']\n if not steps_per_eval:\n steps_per_eval = 10 * steps_per_stats\n steps_per_external_eval = self.configs['steps_per_external_eval']\n if not steps_per_external_eval:\n steps_per_external_eval = 5 * steps_per_eval\n self.configs['steps_per_stats'] = steps_per_stats\n self.configs['steps_per_eval'] = steps_per_eval\n self.configs['steps_per_external_eval'] = steps_per_external_eval","def _data_params_validation(self) -> None:\n extra_regressor_names = set(self.params._reqd_regressor_names)\n # univariate case\n if self.data.is_univariate():\n if len(extra_regressor_names) != 0:\n msg = (\n f\"Missing data for extra regressors: {self.params._reqd_regressor_names}! \"\n \"Please include the missing regressors in `data`.\"\n )\n raise ValueError(msg)\n # multivariate case\n else:\n value_cols = set(self.data.value.columns)\n if \"y\" not in value_cols:\n msg = \"`data` should contain a column called `y` representing the responsive value.\"\n raise ValueError(msg)\n if not extra_regressor_names.issubset(value_cols):\n msg = f\"`data` should contain all columns listed in {extra_regressor_names}.\"\n raise ValueError(msg)\n # validate cap\n if (self.params.cap is True) and (\"cap\" not in self.data.value.columns):\n msg = \"`data` should contain a column called `cap` representing the cap when `cap = True`.\"\n _error_msg(msg)\n # validate floor\n if (self.params.floor is True) and (\"floor\" not in self.data.value.columns):\n msg = \"`data` should contain a column called `floor` representing the floor when `floor = True`.\"\n _error_msg(msg)","def check_params():\n print INITIAL_SCHEDULE\n print SCHEDULE_SA[:10]\n print CONTROL_DECISIONS\n\n print \"T_SLOT= %f\" % T_SLOT\n print \"R=%f\" % R\n print \"A=%f\" % A\n print \"A_IO=%f\" % A_IO\n print \"Q_INT=%d\" % Q_INT","def updateParameters(self):\r\n\r\n\t\tif self.approach.altered:\r\n\t\t\tself.transform.enabled = True\r\n\r\n\t\t\tif self.approach.value == 'Locations in the DEM generated from field observations':\r\n\t\t\t\tself.predefined_pattern.enabled = False\r\n\t\t\t\tself.pattern_workspace.enabled = False\r\n\t\t\t\tself.point_matrix_size.enabled = True\r\n\t\t\t\tself.point_vectors.enabled = True\r\n\t\t\t\tself.mapping_field.enabled = True\r\n\t\t\t\tself.move_to_max.enabled = True\r\n\t\t\t\tself.output_sim_matrix.enabled = True\r\n\t\t\t\tself.mh_dil_val.enabled = False\r\n\r\n\t\t\t\tself.mh_iteration.enabled = False\r\n\t\t\t\tself.mh_iteration.value = False\r\n\t\t\t\tself.output_table.enabled = False\r\n\t\t\t\tself.output_raster_workspace.enabled = False\r\n\t\t\t\tself.output_raster_workspace.value = ''\r\n\r\n\t\t\telif self.approach.value == 'Locations in the DEM versus pre-defined pattern':\r\n\t\t\t\tself.predefined_pattern.enabled = True\r\n\t\t\t\tself.point_matrix_size.enabled = True\r\n\t\t\t\tself.point_vectors.enabled = True\r\n\t\t\t\tself.mapping_field.enabled = True\r\n\t\t\t\tself.move_to_max.enabled = True\r\n\t\t\t\tself.mh_dil_val.enabled = True\r\n\t\t\t\tself.mh_iteration.enabled = True\r\n\t\t\t\tself.output_table.enabled = True\r\n\t\t\t\tself.output_sim_matrix.enabled = False\r\n\t\t\t\tself.output_sim_matrix.value = ''\r\n\t\t\t\tself.output_raster_workspace.enabled = False\r\n\t\t\t\tself.output_raster_workspace.value = ''\r\n\r\n\t\t\telse: # seek pre-defined pattern in DEM\r\n\t\t\t\tself.predefined_pattern.enabled = True\r\n\t\t\t\tself.point_matrix_size.enabled = True\r\n\t\t\t\tself.mh_iteration.enabled = True\r\n\t\t\t\tself.output_raster_workspace.enabled = True\r\n\t\t\t\tself.point_vectors.enabled = False\r\n\t\t\t\tself.point_vectors.value = ''\r\n\t\t\t\tself.mapping_field.enabled = False\r\n\t\t\t\tself.move_to_max.enabled = False\r\n\t\t\t\tself.move_to_max.value = False\r\n\t\t\t\tself.mh_dil_val.enabled = True\r\n\t\t\t\tself.output_sim_matrix.enabled = False\r\n\t\t\t\tself.output_sim_matrix.value = ''\r\n\t\t\t\tself.output_table.enabled = False\r\n\t\t\t\tself.output_table.value = ''\r\n\r\n\t\tif self.mh_iteration.altered:\r\n\r\n\t\t\tif self.mh_iteration.value is True:\r\n\t\t\t\tself.mh_dil_start.enabled = True\r\n\t\t\t\tself.mh_dil_stop.enabled = True\r\n\t\t\t\tself.mh_dil_step.enabled = True\r\n\t\t\t\tself.mh_dil_val.enabled = False\r\n\t\t\t\tself.mh_dil_val.value = 1\r\n\r\n\t\t\telse:\r\n\t\t\t\tif self.approach.value == 'Locations in the DEM generated from field observations':\r\n\t\t\t\t\tself.mh_dil_val.enabled = False\r\n\t\t\t\t\tself.mh_dil_val.value = 1\r\n\t\t\t\telse:\r\n\t\t\t\t\tself.mh_dil_val.enabled = True\r\n\r\n\t\t\t\tself.mh_dil_start.enabled = False\r\n\t\t\t\tself.mh_dil_stop.enabled = False\r\n\t\t\t\tself.mh_dil_step.enabled = False\r\n\t\t\t\tself.mh_dil_start.value = 0.01\r\n\t\t\t\tself.mh_dil_stop.value = 1\r\n\t\t\t\tself.mh_dil_step.value = 0.1\r\n\r\n\t\tif self.move_to_max.altered:\r\n\t\t\tif self.move_to_max.value is True:\r\n\t\t\t\tself.move_to_max_distance.enabled = True\r\n\t\t\telse:\r\n\t\t\t\tself.move_to_max_distance.enabled = False\r\n\t\t\t\tself.move_to_max_distance.value = 3\r\n\r\n\t\tif self.transform.altered:\r\n\t\t\tif self.transform.value == 'Work directly on the elevation matrix':\r\n\t\t\t\tself.size_of_the_cell.enabled = False\r\n\t\t\telif self.transform.value == 'Perform a local translation':\r\n\t\t\t\tself.size_of_the_cell.enabled = False\r\n\t\t\telif self.transform.value == 'Compute slopes' or self.transform.value == \\\r\n\t\t\t\t\t'Compute slopes and perform local translation':\r\n\t\t\t\tself.size_of_the_cell.enabled = True\r\n\r\n\t\tif self.predefined_pattern.altered:\r\n\t\t\tif self.predefined_pattern.value == 'Custom pattern':\r\n\t\t\t\tself.pattern_workspace.enabled = True\r\n\r\n\t\t\t\tself.mh_iteration.value = False\r\n\t\t\t\tself.mh_iteration.enabled = False\r\n\t\t\t\tself.mh_dil_start.enabled = False\r\n\t\t\t\tself.mh_dil_stop.enabled = False\r\n\t\t\t\tself.mh_dil_step.enabled = False\r\n\t\t\t\tself.mh_dil_start.value = 0.01\r\n\t\t\t\tself.mh_dil_stop.value = 1\r\n\t\t\t\tself.mh_dil_step.value = 0.1\r\n\t\t\t\tself.mh_dil_val.enabled = False\r\n\t\t\t\tself.mh_dil_val.value = 1\r\n\t\t\telse:\r\n\t\t\t\tself.pattern_workspace.enabled = False","def rules(self):\n self.rule1 = min(self.location_is_lessDemand, self.area_is_small, self.unfunishing)\n self.rule2 = min(self.location_is_lessDemand, max(self.area_is_small, self.area_is_average), self.access_is_good)\n self.rule3 = min(self.location_is_veryHighDemand, self.area_is_average, self.fac_is_low, self.access_is_average)\n self.rule4 = min(self.location_is_veryLessDemand, self.area_is_verysmall, self.fully_funishing)\n self.rule5 = min(self.location_is_lessDemand, self.fac_is_average, max(self.area_is_small, self.area_is_average))\n self.rule6 = min(max(self.location_is_lessDemand, self.location_is_averageDemand), self.access_is_good)\n self.rule7 = min(self.location_is_lessDemand, self.access_is_good, self.area_is_large, self.partially_funishing)\n self.rule8 = min(self.location_is_highDemand, self.access_is_good, max(self.bed_is_less, self.bath_is_average))\n self.rule9 = min(self.location_is_veryHighDemand, self.area_is_large, self.unfunishing)\n self.rule10 = min(self.access_is_good, self.area_is_average, (1 - self.unfunishing))\n self.rule11 = min(self.access_is_good, self.area_is_large, self.partially_funishing, self.bed_is_more, self.bath_is_more)","def update_route(self, vrpdata):\n self.distance = 0\n self.quantity = 0\n self.tourValid = False\n lastc = 0 # first entry is depot\n for c in self.route:\n self.distance += vrpdata.DistMatrix[lastc][c]\n self.quantity += vrpdata.CustDem[c]\n lastc = c\n self.distance += vrpdata.DistMatrix[lastc][0] # last entry is depot\n self.tourValid = (self.quantity <= vrpdata.MaxVehCap)","def validateInputParams(self): \n # Return dictionary\n retval = {}\n retval['status'] = True\n retval['axis'] = ''\n \n # Get the separationaxis of input MMS. \n sepaxis = ph.axisType(self.__args['vis'])\n if sepaxis.isspace() or sepaxis.__len__() == 0:\n sepaxis = 'unknown'\n elif sepaxis == 'scan,spw':\n sepaxis = 'auto'\n \n #Get list of subMSs in MMS\n subMSList = ParallelTaskHelper.getReferencedMSs(self.__args['vis'])\n \n if self.__taskname == \"mstransform\":\n \n if (self.__args['combinespws'] == True or self.__args['nspw'] > 1) and \\\n (self.__args['timeaverage'] == False):\n spwsel = self.__getSpwIds(self.__args['vis'], self.__args['spw']) \n # Get dictionary with spwids of all subMS in the MMS\n spwdict = ph.getScanSpwSummary(subMSList) \n # For each subMS, check if it has the spw selection\n for subms in subMSList:\n subms_spwids = ph.getSubMSSpwIds(subms, spwdict)\n slist = map(str,subms_spwids)\n # Check if the subms contains all the selected spws\n if not self.__isSpwContained(spwsel, slist):\n casalog.post('Cannot combine or separate spws in parallel because the subMSs do not contain all the selected spws',\\\n 'WARN')\n # Set the new separation axis for the output\n retval['status'] = False\n retval['axis'] = 'scan'\n break\n \n elif (self.__args['timeaverage'] == True and self.__args['timespan'] == 'scan') and \\\n (self.__args['combinespws'] == False and self.__args['nspw'] == 1):\n # Get the value of timebin as a float\n timebin = self.__args['timebin']\n tsec = qa.quantity(timebin,'s')['value']\n scansel = self.__getScanIds(self.__args['vis'], self.__args['scan'])\n # For each subms, check if scans length is <= timebin\n for subms in subMSList:\n if not self.__isScanContained(subms, scansel, tsec):\n casalog.post('Cannot process MMS in parallel when timespan=\\'scan\\' because the subMSs do not contain all the selected scans',\\\n 'WARN')\n # Set the new separation axis for the output\n retval['status'] = False\n retval['axis'] = 'spw'\n break\n \n # Two transformations are requested.\n elif (self.__args['combinespws'] == True or self.__args['nspw'] > 1) and \\\n (self.__args['timeaverage'] == True and self.__args['timespan'] == 'scan'):\n # Check spws and scans in subMSs\n spwsel = self.__getSpwIds(self.__args['vis'], self.__args['spw'])\n spwdict = ph.getScanSpwSummary(subMSList) \n scansel = self.__getScanIds(self.__args['vis'], self.__args['scan'])\n timebin = self.__args['timebin']\n tsec = qa.quantity(timebin,'s')['value']\n for subms in subMSList:\n subms_spwids = ph.getSubMSSpwIds(subms, spwdict)\n slist = map(str,subms_spwids)\n if self.__isSpwContained(spwsel, slist):\n if not self.__isScanContained(subms, scansel, tsec):\n casalog.post('The subMSs of input MMS do not contain the necessary scans','WARN')\n retval['status'] = False\n retval['axis'] = ''\n break \n else:\n casalog.post('The subMSs of input MMS do not contain the necessary spws','WARN')\n retval['status'] = False\n retval['axis'] = ''\n break\n \n \n elif self.__taskname == \"split2\" or self.__taskname == \"split\": \n if (sepaxis != 'spw' and self.__args['combine'] == 'scan'):\n scansel = self.__getScanIds(self.__args['vis'], self.__args['scan'])\n timebin = self.__args['timebin']\n tsec = qa.quantity(timebin,'s')['value']\n for subms in subMSList:\n if not self.__isScanContained(subms, scansel, tsec):\n casalog.post('Cannot process MMS in parallel when combine=\\'scan\\' because the subMSs do not contain all the selected scans',\\\n 'WARN')\n casalog.post(\"Please set keepmms to False or use task mstransform in this case.\",'ERROR')\n retval['status'] = False\n retval['axis'] = ''\n break\n\n elif self.__taskname == \"cvel2\" and sepaxis != 'scan':\n spwsel = self.__getSpwIds(self.__args['vis'], self.__args['spw']) \n spwdict = ph.getScanSpwSummary(subMSList) \n for subms in subMSList:\n subms_spwids = ph.getSubMSSpwIds(subms, spwdict)\n slist = map(str,subms_spwids)\n # Check if the subms contains all the selected spws\n if not self.__isSpwContained(spwsel, slist):\n casalog.post('Cannot combine spws in parallel because the subMSs do not contain all the selected spws',\\\n 'WARN')\n casalog.post(\"Please set keepmms to False or use task mstransform in this case.\",'ERROR')\n # Set the new separation axis for the output\n retval['status'] = False\n retval['axis'] = ''\n break\n \n\n return retval","def validate(self):\n variables = ['bottomDepth', 'ssh', 'layerThickness', 'zMid',\n 'maxLevelCell', 'temperature', 'salinity']\n compare_variables(\n test_case=self, variables=variables,\n filename1='initial_state/initial_state.nc')\n\n variables = ['temperature', 'salinity', 'layerThickness',\n 'normalVelocity']\n compare_variables(test_case=self, variables=variables,\n filename1='full_run/output.nc',\n filename2='restart_run/output.nc')\n\n variables = ['ssh', 'landIcePressure', 'landIceDraft',\n 'landIceFraction',\n 'landIceMask', 'landIceFrictionVelocity', 'topDrag',\n 'topDragMagnitude', 'landIceFreshwaterFlux',\n 'landIceHeatFlux', 'heatFluxToLandIce',\n 'landIceBoundaryLayerTemperature',\n 'landIceBoundaryLayerSalinity',\n 'landIceHeatTransferVelocity',\n 'landIceSaltTransferVelocity',\n 'landIceInterfaceTemperature',\n 'landIceInterfaceSalinity', 'accumulatedLandIceMass',\n 'accumulatedLandIceHeat']\n compare_variables(test_case=self, variables=variables,\n filename1='full_run/land_ice_fluxes.nc',\n filename2='restart_run/land_ice_fluxes.nc')\n\n variables = ['accumulatedFrazilIceMass',\n 'accumulatedFrazilIceSalinity',\n 'seaIceEnergy', 'frazilLayerThicknessTendency',\n 'frazilTemperatureTendency', 'frazilSalinityTendency',\n 'frazilSurfacePressure',\n 'accumulatedLandIceFrazilMass']\n compare_variables(test_case=self, variables=variables,\n filename1='full_run/frazil.nc',\n filename2='restart_run/frazil.nc')","def validate_inputs(self):\n self.ctx.inputs = AttributeDict(self.exposed_inputs(FleurCalculation))\n\n self.ctx.max_queue_nodes = self.inputs.add_comp_para['max_queue_nodes']\n self.ctx.max_queue_wallclock_sec = self.inputs.add_comp_para['max_queue_wallclock_sec']\n\n input_options = self.inputs.options.get_dict()\n self.ctx.optimize_resources = input_options.pop('optimize_resources', True)\n self.ctx.inputs.metadata.options = input_options\n\n if 'description' in self.inputs:\n self.ctx.inputs.metadata.description = self.inputs.description\n else:\n self.ctx.inputs.metadata.description = ''\n if 'label' in self.inputs:\n self.ctx.inputs.metadata.label = self.inputs.label\n else:\n self.ctx.inputs.metadata.label = ''\n\n if not self.ctx.optimize_resources:\n self.ctx.can_be_optimised = False # set this for handlers to not change resources\n return\n\n resources_input = self.ctx.inputs.metadata.options['resources']\n try:\n self.ctx.num_machines = int(resources_input['num_machines'])\n self.ctx.num_mpiprocs_per_machine = int(resources_input['num_mpiprocs_per_machine'])\n except KeyError:\n self.ctx.can_be_optimised = False\n self.report('WARNING: Computation resources were not optimised.')\n else:\n try:\n self.ctx.num_cores_per_mpiproc = int(resources_input['num_cores_per_mpiproc'])\n self.ctx.use_omp = True\n self.ctx.suggest_mpi_omp_ratio = self.ctx.num_mpiprocs_per_machine / self.ctx.num_cores_per_mpiproc\n except KeyError:\n self.ctx.num_cores_per_mpiproc = 1\n self.ctx.use_omp = False\n self.ctx.suggest_mpi_omp_ratio = 1\n\n status = self.check_kpts()\n if status is None:\n self.ctx.can_be_optimised = True\n else:\n self.report('ERROR: Not optimal computational resources.')\n return status","def directions_calc(self):\n \n # create route_dict, {'radio_button_name': {'geometries': list of coords,\n # 'values': list of values}}\n route_dict = self._selectInput()\n \n # generate lists with locations and values\n (start_layer_name,\n end_layer_name) = [x.objectName() for x in self.radio_buttons]\n \n locations_list = list(product(route_dict[start_layer_name]['geometries'],\n route_dict[end_layer_name]['geometries']))\n values_list = list(product(route_dict[start_layer_name]['values'],\n route_dict[end_layer_name]['values']))\n \n # If row-by-row in two-layer mode, then only zip the locations\n if all([button.isChecked() for button in self.radio_buttons]) and self.dlg.routing_twolayer_rowbyrow.isChecked():\n locations_list = list(zip(route_dict[start_layer_name]['geometries'],\n route_dict[end_layer_name]['geometries']))\n\n values_list = list(zip(route_dict[start_layer_name]['values'],\n route_dict[end_layer_name]['values']))\n\n # Add via point if specified\n route_via = None\n if self.dlg.routing_via_label.text() != 'Long,Lat':\n route_via = [float(x) for x in self.dlg.routing_via_label.text().split(\",\")]\n \n message_bar, progress_widget = progressbar.pushProgressBar(self.iface)\n \n responses = []\n delete_values = []\n for i, coords_tuple in enumerate(locations_list):\n if coords_tuple[0] == coords_tuple[-1]:\n # Skip when same location\n delete_values.append(i)\n continue\n if route_via:\n # add via coords\n coords_tuple = list(coords_tuple)\n coords_tuple.insert(1, route_via)\n \n # Update progress bar\n percent = (i/len(locations_list)) * 100\n message_bar.setValue(percent)\n \n # Make the request\n self.params['coordinates'] = convert.build_coords(coords_tuple)\n responses.append(self.client.request(self.url, self.params))\n \n # Delete entries in values_list where coords where the same\n values_list = [value for idx, value in enumerate(values_list) if idx not in delete_values]\n \n # Only proceed when there actual responses\n if responses: \n layer_out = self._addLine(responses, values_list)\n layer_out.updateExtents()\n \n QgsProject.instance().addMapLayer(layer_out)\n \n self.iface.messageBar().popWidget(progress_widget)","def test_parse_routes(self):\n\n params = get_params()\n estimator = LinearEstimator()\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\n model_builder = OptimizationModelBuilder(\n constraints=[CapacityConstraint()]\n )\n riders = parse_models(model_dicts=test_riders, cls=Rider)\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\n depots = parse_models(model_dicts=test_depots, cls=Depot)\n problem = problem_builder.build(riders, vehicles, depots)\n model = model_builder.build(problem)\n solution = model.solve()\n routes = Router._parse_routes(problem, solution)\n self.assertTrue(routes, msg='Routes could not be built.')\n\n for route in routes:\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\n self.assertTrue(\n len(route['stops']) > 1,\n msg='Route with single stop.'\n )","def analyseCoordination(self):\n #create a list of criteria that correspond to maximal path length\n #max_path_length = max(self.pathLengths)\n\n #criterion_max_path_length = []\n #origins_max_path_length = []\n #for c in range(len(self.pathLengths)):\n # if self.pathLengths[c] == max_path_length:\n # criterion_max_path_length.append(self.globalMin[c])\n # origins_max_path_length.append(self.origins[c])\n\n #min_criterion = min(criterion_max_path_length)\n\n #find index\n #for m in range(len(criterion_max_path_length)):\n # if criterion_max_path_length[m] == min_criterion:\n # break\n\n #for s in range(len(self.origins)):\n # if self.origins[s] == origins_max_path_length[m]:\n # break\n\n min_criterion = self.globalMin[0]\n self.overall_min = min_criterion\n self.overall_max_path_length = len(self.min_path[0])\n\n if self.chosenScheduleIndex != self.globalMinSchedIdx[0]:\n self.chosenScheduleIndex = self.globalMinSchedIdx[0]\n self.chosenSchedule = self.schedules[self.chosenScheduleIndex]\n self.EConsumptionChosenSchedule = self.EConsumptionScheduleCurves[self.chosenScheduleIndex]\n # update SOC\n self.setSOC(self.SOCEnd[self.chosenScheduleIndex])\n # update modulation level\n self.setStateModlvl(self.chosenSchedule[-1])\n\n\n # inform all neighbors about origin that has local minimal criterion\n for n in range(len(self.Neighbors)):\n #structure: ['minimalorigin', ID_minimal_origin, minimal_criterion_value]\n #self.sendMessage(self.Neighbors[n], 70, ['minimalorigin', copy.deepcopy(origins_max_path_length[m]), copy.deepcopy(min_criterion), copy.deepcopy(self.min_path[s]), copy.deepcopy(self.min_path_schedules[s])])\n self.sendMessage(self.Neighbors[n], 70, ['minimalorigin', copy.deepcopy(self.CommID), copy.deepcopy(min_criterion), copy.deepcopy(self.min_path[0]), copy.deepcopy(self.min_path_schedules[0])])\n\n if self.OPTcriterion == 'maxmindiff':\n fluct_criterion = max(self.EFluctuationCurve) - min(self.EFluctuationCurve)\n elif self.OPTcriterion == 'absremainder':\n fluct_criterion = 0\n for a in range(len(self.EFluctuationCurve)):\n fluct_criterion += abs(self.EFluctuationCurve[a])\n\n\n #print 'ID {0}: criterion is: {1} , of origin {4}, path length: {2}, schedules: {5}, with improvement of {3} %'.format(self.CommID, min_criterion, len(self.min_path[s]), 100 - 100*(float((float(min_criterion))/float(fluct_max_min_diff))), origins_max_path_length[m], self.min_path_schedules[s] )\n self.log_message('ID {0}: criterion is: {1} , of origin {4}, path length: {2}, schedules: {5}, with improvement of {3} %'.format(self.CommID, min_criterion, len(self.min_path[0]), 100 - 100*(float((float(min_criterion))/float(fluct_criterion))), self.CommID, self.min_path_schedules[0] ))","def validate_parameters(self):\n\n # env and fixed_env\n self._validate_envs()\n # checking optional data and scripts\n self._validate_download_data()\n self.data_path = self.params[\"data\"][\"location\"]\n self._validate_scripts()\n # checking optional data_ref (if not data_ref provided, path is the same as data path)\n if \"data_ref\" in self.params:\n self._validate_download_data(data_nm=\"data_ref\")\n# self.data_ref_path = self.params[\"data_ref\"][\"location\"]\n# else:\n# self.data_ref_path = self.data_path\n # checking analysis\n self._validate_analysis()\n # checking tests\n self._validate_tests()\n\n self.params.setdefault(\"post_build\", None)\n # if copy in post_build part that I'm changing the build_context\n if self.params[\"post_build\"] and \"copy\" in self.params[\"post_build\"]:\n self.build_context = self.workflow_path\n else:\n self.build_context = self.working_dir\n\n self.params.setdefault(\"plots\", [])\n if self.params[\"plots\"]:\n if not isinstance(self.params[\"plots\"], (list, tuple)):\n raise SpecificationError(\n \"Value of key 'plots' must be a list or a tuple\"\n )\n else:\n if any(not isinstance(j, dict) for j in self.params[\"plots\"]):\n raise SpecificationError(\n \"Every item in 'plots' must be a dictionary.\"\n )","def route_validity_checker(): #below route list was rerturned from bus_routes function above, copy and pasted to eliminate need to re-run\n route_list=['15', '46A', '14', '41B', '39A', '65', '40D', '11', '31', '27', '67', '79', '42', '66A', '33B', '140', '44', '83A', '27B', '38', '16C', '747', '41C', '39', '25', '239', '43', '70', '13', '150', '145', '77A', '184', '84', '61', '83', '40', '66', '15A', '123', '17A', '16', '14C', '9', '4', '37', '32', '33', '49', '56A', '151', '25A', '45A', '54A', '47', '18', '7', '17', '102', '120', '65B', '41', '122', '29A', '76', '68', '59', '25B', '69', '27A', '66B', '38B', '7D', '75', '15B', '84A', '63', '84X', '33X', '68A', '1', '76A', '7B', '270', '236', '130', '238', '220', '44B', '40B', '26', '32B', '8', '41A', '53', '67X', '104', '32A', '79A', '114', '185', '66X', '31B', '32X', '51X', '51D', '41X', '142', '111', '69X', '27X', '116', '46E', '161', '118', '25X', '38A', '33A', 'PP07', '53B', '31A', 'OL84']\n count_dict={}\n for route in route_list: #dictionary with key for every route in the list\n count_dict[route]=0 #used to count number of occurrences in files\n os.chdir(\"../Data\")\n for file in glob.glob(\"*.csv\"): #for every file\n print(file)\n reader=csv.reader(open(file))\n for line in reader:\n route=extract_bus_route(line[3])\n if route!=\"\":\n count_dict[extract_bus_route(line[3])]+=1 #incremenent the counter of the route with the associated journey id code\n return count_dict #result is that 3 routes are likely due to strange circumstances or errors in data","def initialize_rt_solver(self):\r\n # For a local network dataset, we need to checkout the Network Analyst extension license.\r\n if not self.is_service:\r\n arcpy.CheckOutExtension(\"network\")\r\n\r\n # Create a new Route object\r\n self.logger.debug(\"Creating Route object...\")\r\n self.rt_solver = arcpy.nax.Route(self.network_data_source)\r\n\r\n # Set the Route analysis properties.\r\n # Read properties from the rt_config.py config file for all properties not set in the UI as parameters.\r\n # Route properties documentation: https://pro.arcgis.com/en/pro-app/latest/arcpy/network-analyst/route.htm\r\n # The properties have been extracted to the config file to make them easier to find and set so users don't have\r\n # to dig through the code to change them.\r\n self.logger.debug(\"Setting Route analysis properties from RT config file...\")\r\n for prop, value in RT_PROPS.items():\r\n if prop in RT_PROPS_SET_BY_TOOL:\r\n self.logger.warning((\r\n f\"Route config file property {prop} is handled explicitly by the tool parameters and will be \"\r\n \"ignored.\"\r\n ))\r\n continue\r\n try:\r\n setattr(self.rt_solver, prop, value)\r\n if hasattr(value, \"name\"):\r\n self.logger.debug(f\"{prop}: {value.name}\")\r\n else:\r\n self.logger.debug(f\"{prop}: {value}\")\r\n except Exception as ex: # pylint: disable=broad-except\r\n # Suppress warnings for older services (pre 11.0) that don't support locate settings and services\r\n # that don't support accumulating attributes because we don't want the tool to always throw a warning.\r\n if not (self.is_service and prop in [\r\n \"searchTolerance\", \"searchToleranceUnits\", \"accumulateAttributeNames\"\r\n ]):\r\n self.logger.warning(\r\n f\"Failed to set property {prop} from RT config file. Default will be used instead.\")\r\n self.logger.warning(str(ex))\r\n # Set properties explicitly specified in the tool UI as arguments\r\n self.logger.debug(\"Setting Route analysis properties specified tool inputs...\")\r\n self.rt_solver.travelMode = self.travel_mode\r\n self.logger.debug(f\"travelMode: {self.travel_mode}\")\r\n self.rt_solver.timeUnits = self.time_units\r\n self.logger.debug(f\"timeUnits: {self.time_units}\")\r\n self.rt_solver.distanceUnits = self.distance_units\r\n self.logger.debug(f\"distanceUnits: {self.distance_units}\")\r\n self.rt_solver.timeOfDay = self.time_of_day\r\n self.logger.debug(f\"timeOfDay: {self.time_of_day}\")","def validateProcess(process):\n \n schedule=process.schedule_()\n paths=process.paths_()\n endpaths=process.endpaths_()\n \n # check output mods are in paths and have appropriate settings\n for outputModName in process.outputModules_().keys():\n outputMod = getattr(process, outputModName)\n if not hasattr(outputMod, 'dataset'):\n msg = \"Process contains output module without dataset PSET: %s \\n\" % outputModName\n msg += \" You need to add this PSET to this module to set dataTier and filterName\\n\"\n raise RuntimeError(msg)\n ds=getattr(outputMod,'dataset')\n if not hasattr(ds, \"dataTier\"):\n msg = \"Process contains output module without dataTier parameter: %s \\n\" % outputModName\n msg += \" You need to add an untracked parameter to the dataset PSET of this module to set dataTier\\n\"\n raise RuntimeError(msg)\n\n # check module in path or whatever (not sure of exact syntax for endpath)\n omRun=False\n\n if schedule==None:\n for path in paths:\n if outputModName in getattr(process,path).moduleNames():\n omRun=True\n for path in endpaths:\n if outputModName in getattr(process,path).moduleNames():\n omRun=True\n else:\n for path in schedule:\n if outputModName in path.moduleNames():\n omRun=True\n if omRun==False:\n msg = \"Output Module %s not in endPath\" % outputModName\n raise RuntimeError(msg)","def __init__(self, runway_type):\n self.primary_surface_length = 200\n self.primary_surface_width = 0\n self.approach_surface_extendedwidth = 0\n self.first_section_length = 0\n self.first_section_slope = 0\n self.second_section_length = 0\n self.second_section_slope = 0\n self.horizontal_surface_height = 150\n self.horizontal_surface_radius = 0\n self.conical_surface_slope = 20\n self.conical_surface_offset = 4000\n self.transitional_surface_slope = 7\n \n # The runway types listed in the documentation for FAA FAR 77 do not \n # match what appears when you actually run the tool in ArcMap.\n # These regular expressions should match either version. \n if re.match(\"Visual\\s*(?:Runway)?\\s*Visual\\sApproach\", runway_type, re.I):\n self.primary_surface_width = 500\n self.approach_surface_extendedwidth = 1500\n self.first_section_length = 5000\n self.first_section_slope = 20\n self.horizontal_surface_radius = 5000\n elif re.match(\"Utility\\s*(?:Runway)?\\s*Visual Approach\", runway_type, re.I):\n self.primary_surface_width = 250\n self.approach_surface_extendedwidth = 1250\n self.first_section_length = 5000\n self.first_section_slope = 20\n self.horizontal_surface_radius = 5000\n elif re.match(\"Utility\\s*(?:Runway)?\\s*Non[\\s\\-]*Precision Instrument Approach\", runway_type, re.I):\n self.primary_surface_width = 500\n self.approach_surface_extendedwidth = 2000\n self.first_section_length = 5000\n self.first_section_slope = 20\n self.horizontal_surface_radius = 5000\n elif re.match(\"Precision Instrument\\s*(?:Runway)?\", runway_type, re.I):\n self.primary_surface_width = 1000\n self.approach_surface_extendedwidth = 16000\n self.first_section_length = 10000\n self.first_section_slope = 50\n self.second_section_length = 40000\n self.second_section_slope = 40\n self.horizontal_surface_radius = 10000\n elif re.match(\"Non Precision Instrument\\s*(?:Runway)?\\s*(?:(?:High)|(?:Greater)) Visibility\", runway_type, re.I):\n self.primary_surface_width = 500\n self.approach_surface_extendedwidth = 3500\n self.first_section_length = 10000\n self.first_section_slope = 34\n self.horizontal_surface_radius = 10000\n elif re.match(\"Non Precision Instrument\\s*(?:Runway)\\s*Approach Low Visibility\", runway_type, re.I):\n self.primary_surface_width = 1000\n self.approach_surface_extendedwidth = 4000\n self.first_section_length = 10000\n self.first_section_slope = 34\n self.horizontal_surface_radius = 10000","def testoptdone(self):\r\n assert self.data.optdone\r\n assert numpy.all(numpy.abs(self.data.geovalues[-1]) <= self.data.geotargets)","def validate(self):\n valid = True\n \n # Check that link information is valid\n for ij in self.link:\n valid = valid and self.link[ij].head in self.node\n valid = valid and self.link[ij].tail in self.node\n if not valid:\n print(\"Error: Link tail/head not found: %s %s\" % (self.link[ij].tail, self.link[ij].head))\n raise utils.BadFileFormatException\n valid = valid and self.link[ij].capacity >= 0\n valid = valid and self.link[ij].length >= 0\n valid = valid and self.link[ij].freeFlowTime >= 0\n valid = valid and self.link[ij].alpha >= 0\n valid = valid and self.link[ij].beta >= 0\n valid = valid and self.link[ij].speedLimit >= 0\n valid = valid and self.link[ij].toll >= 0\n if not valid:\n print(\"Link %s has negative parameters.\" % ij)\n \n # Then check that all OD pairs are in range\n for ODpair in self.ODpair:\n (origin, destination) = (self.ODpair[ODpair].origin, self.ODpair[ODpair].destination)\n valid = valid and origin in self.node\n valid = valid and destination in self.node\n if not valid:\n print(\"Error: Origin/destination %s not found\" % ODpair)\n raise utils.BadFileFormatException\n valid = valid and self.node[origin].isZone == True\n valid = valid and self.node[destination].isZone == True\n if not valid:\n print(\"Error: Origin/destination %s does not connect two zones\" % str(ODpair))\n raise utils.BadFileFormatException\n valid = valid and self.ODpair[ODpair].demand >= 0\n if not valid:\n print(\"Error: OD pair %s has negative demand\" % ODpair)\n raise utils.BadFileFormatException\n \n # Now error-check using metadata\n if self.numNodes != None and len(self.node) != self.numNodes:\n print(\"Warning: Number of nodes implied by network file %d different than metadata value %d\" % (len(self.node), self.numNodes))\n self.numNodes = len(self.node)\n if self.numLinks != None and len(self.link) != self.numLinks:\n print(\"Warning: Number of links given in network file %d different than metadata value %d\" % (len(self.link), self.numLinks))\n self.numLinks = len(self.link)\n if self.numZones != None and len([i for i in self.node if self.node[i].isZone == True]) != self.numZones:\n print(\"Warning: Number of zones given in network file %d different than metadata value %d\" % (len([i for i in self.node if self.node[i].isZone == True]), self.numZones))\n self.numLinks = len(self.link)\n if self.totalDemandCheck != None:\n if self.totalDemand != self.totalDemandCheck:\n print(\"Warning: Total demand is %f compared to metadata value %f\" % ( self.totalDemand, self.totalDemandCheck))","def consolidation_heuristics(to_print = False):\n # Instantiate the data problem.\n data = create_data_model()\n # Create the routing index manager.\n manager = pywrapcp.RoutingIndexManager(len(data['distance_matrix']),\n data['num_vehicles'], data['depot'])\n # Create Routing Model.\n routing = pywrapcp.RoutingModel(manager)\n # Create and register a transit callback.\n def distance_callback(from_index, to_index):\n \"\"\"Returns the distance between the two nodes.\"\"\"\n # Convert from routing variable Index to distance matrix NodeIndex.\n from_node = manager.IndexToNode(from_index)\n to_node = manager.IndexToNode(to_index)\n return data['distance_matrix'][from_node][to_node]\n def pending_callback(from_index, to_index):\n \"\"\"Returns the distance between the two nodes.\"\"\"\n # Convert from routing variable Index to distance matrix NodeIndex.\n from_node = manager.IndexToNode(from_index)\n to_node = manager.IndexToNode(to_index)\n return data['post'][to_node]\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\n pending_callback_index = routing.RegisterTransitCallback(pending_callback)\n # Define cost of each arc.\n for i in range(data['num_vehicles']-1):\n routing.SetArcCostEvaluatorOfVehicle(transit_callback_index, i) #Transit cost\n routing.SetFixedCostOfVehicle(data['fixed_cost'], i) #Fixed cost\n routing.SetArcCostEvaluatorOfVehicle(pending_callback_index, data['num_vehicles']-1) #Postponement and/or NonService cost\n # Add Capacity constraint.\n def demand_callback(from_index): #\n \"\"\"Returns the demand of the node.\"\"\"\n # Convert from routing variable Index to demands NodeIndex.\n from_node = manager.IndexToNode(from_index) \n return data['demands'][from_node]\n demand_callback_index = routing.RegisterUnaryTransitCallback(\n demand_callback)\n routing.AddDimensionWithVehicleCapacity(\n demand_callback_index,\n 0, # null capacity slack\n data['vehicle_capacities'], # vehicle maximum capacities\n True, # start cumul to zero\n 'Capacity')\n # Add time constraint.\n def time_callback(from_index,to_index): #\n \"\"\"Returns the demand of the node.\"\"\"\n # Convert from routing variable Index to NodeIndex in time\n from_node = manager.IndexToNode(from_index)\n to_node = manager.IndexToNode(to_index)\n return time_matrix[from_node][to_node] \n time_callback_index = routing.RegisterTransitCallback(time_callback) \n routing.AddDimensionWithVehicleCapacity(\n time_callback_index,\n 0, # null capacity slack\n data['time_capacities'], # vehicle maximum capacities\n True, # start cumul to zero\n 'Time')\n # Setting solution heuristic-procedure.\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\n search_parameters.local_search_metaheuristic = (\n routing_enums_pb2.LocalSearchMetaheuristic.GUIDED_LOCAL_SEARCH)\n search_parameters.time_limit.seconds = 5 #10 # 60 #20 #3000\n search_parameters.log_search = True\n # Solve the problem.\n assignment = routing.SolveWithParameters(search_parameters)\n # Print solution on console.\n if assignment:\n sent, sol_results, routes_results = print_solution(data, manager, routing, assignment) \n return sent, sol_results, routes_results","def verify_pln(self):\n\n warnings = []\n\n self._populate_uncertainties()\n\n # The transitref and transiturl actually end up stored in the 'transit'\n # ExoParam due to the ref and url splits. Pull these out and set the\n # transit entries to the proper pointers.\n if self.transit.value == 1:\n if is_empty(self.transit.reference):\n self.transit.reference = \"__TRANSITREF\"\n if is_empty(self.transit.url):\n self.transit.url = \"__TRANSITURL\"\n\n # If the transit depth is not provided, but an Rp/R* ratio is,\n # calculate the depth value.\n if is_empty(self.depth.value) and is_valid(self.rr.value):\n self.depth.value = self.rr.value ** 2\n if isinstance(self.rr.uncertainty, Decimal):\n self.depth.uncertainty = self.rr.uncertainty * 2\n if isinstance(self.rr.uncertainty_upper, Decimal):\n self.depth.uncertainty_upper = self.rr.uncertainty_upper * 2\n self.depth.reference = \"Calculated from Rp/R*\"\n self.depth.url = self.rr.reference\n\n # If the orbital eccentricity value is 0 and a TT value is provided,\n # use the same values for T0 as well.\n if self.ecc.value == Decimal(0) and is_empty(self.om.value):\n self.om.value = Decimal(90)\n self.om.reference = \"Set to 90 deg with ecc~0\"\n print(\"set omega to 90\")\n if is_valid(self.tt.value):\n print(\"copying TT to T0\")\n self.t0.copy_values(self.tt)\n # OM may already be set to 90.\n elif self.ecc.value == 0 and self.om.value == 90:\n if str(self.tt.value) != \"NaN\":\n print(\"copying TT to T0\")\n self.t0.copy_values(self.tt)\n\n # Set the FREEZE_ECC flag if ECC=0 and no uncertainty is provided.\n if self.ecc.value == 0 and is_empty(self.ecc.uncertainty):\n self.freeze_ecc.value = 1\n\n # Set the MULT flag if NCOMP is more than 1 planet.\n if self.ncomp.value > 1:\n self.mult.value = 1\n\n # Set the TREND flag if a DVDT value is provided.\n if not is_empty(self.dvdt.value):\n self.trend.value = 1\n\n # Exclude planets with period uncertainty >10%.\n self.per.check_constrained(0.1)\n if not self.per.well_constrained:\n self.exclude()\n warnings.append(\"<uncertain PER>\")\n\n # Warn of planets with K speeds <2 m/s.\n if is_valid(self.k.value):\n if self.k.value < 2:\n # self.exclude()\n warnings.append(\"<low K value>\")\n\n # Make sure RA string uses spaces.\n if not is_empty(self.ra_string.value):\n if \"h\" in self.ra_string.value:\n new_value = self.ra_string.value.replace(\"h\", \" \")\n new_value = new_value.replace(\"m\", \" \")\n new_value = new_value.replace(\"s\", \"\")\n self.ra_string.value = new_value\n\n # Make sure DEC string uses spaces.\n if not is_empty(self.dec_string.value):\n if \"d\" in self.dec_string.value:\n new_value = self.dec_string.value.replace(\"d\", \" \")\n new_value = new_value.replace(\"m\", \" \")\n new_value = new_value.replace(\"s\", \"\")\n self.dec_string.value = new_value\n\n # Display warnings generated by final adjustments.\n if len(warnings) > 0:\n print(\"<<<{0} GOT {1} WARNING(S)>>>\".format(self.name.value,\n len(warnings)\n )\n )\n [print(x) for x in warnings]","def check_required_parameters(required_params_dict=dict()):\r\n print threading.currentThread().getName(), 'Starting'\r\n is_valid = True\r\n required_params_not_set = pythontools.validate_required_parameters(required_params_dict)\r\n if len(required_params_not_set) > 0:\r\n is_valid = False\r\n msg = \"Validate all required input parameters are set failed.\"\r\n for param in required_params_not_set:\r\n steplog.error(\"Required parameter %s is not set.\" % param)\r\n else:\r\n msg = \"Validate all required input parameters are set succeeded.\"\r\n return is_valid, msg","def input_check(self):\n\n if self.species == 'He': assert self.line_model == 'voigt'\n n_upper_range, e_dens_range, temp_range, b_field_range = get_param_ranges(self.line_model)\n\n if np.isnan(n_upper_range).sum() <= 1:\n assert (self.n_upper in range(n_upper_range[0], n_upper_range[1]))\n if np.isnan(e_dens_range).sum() <= 1:\n assert (e_dens_range[0] <= self.e_dens <= e_dens_range[1])\n if np.isnan(temp_range).sum() <= 1:\n assert (temp_range[0] <= self.temp <= temp_range[1])\n if np.isnan(b_field_range).sum() <= 1:\n assert (b_field_range[0] <= self.b_field <= b_field_range[1])","def route_info(g, journey):\n distance = 0\n cost = 0.00\n time = 0\n check = 0\n \n for i in range(0, len(journey) - 1):\n city_name = journey[i]\n city_next = journey[i + 1]\n code_city = g.convert[city_name] \n code_next = g.convert[city_next]\n \n for flight in g.city_dict[code_city].get_flights_out():\n if(flight[0] == code_next):\n distance = distance + flight[1]\n time = time + route_info_helper(g, code_city, code_next, flight[1])\n if(i < 7):\n cost = cost + (distance * (0.35 - (i * 0.05)))\n \n check = check + 1\n if((check + 1) == len(journey)):\n return distance, cost, time\n else:\n print(\"Invalid Route\")\n return 0, 0, 0","def print_and_save_solution(data, manager, routing, assignment):\n total_distance = 0\n total_load = 0\n routes = []\n for vehicle_id in range(data['num_vehicles']):\n route = []\n index = routing.Start(vehicle_id)\n plan_output = 'Route for vehicle {}:\\n'.format(vehicle_id)\n route_distance = 0\n route_load = 0\n while not routing.IsEnd(index):\n node_index = manager.IndexToNode(index)\n route_load += data['demands'][node_index]\n plan_output += ' {0} Load({1}) -> '.format(node_index, route_load)\n previous_index = index\n index = assignment.Value(routing.NextVar(index))\n route_distance += routing.GetArcCostForVehicle(\n previous_index, index, vehicle_id)\n point = data['all_points'][node_index]\n point['load'] = route_load\n route.append(point)\n plan_output += ' {0} Load({1})\\n'.format(manager.IndexToNode(index),\n route_load)\n plan_output += 'Distance of the route: {}m\\n'.format(route_distance)\n plan_output += 'Load of the route: {}\\n'.format(route_load)\n print(plan_output)\n total_distance += route_distance\n total_load += route_load\n if route_load > 0:\n routes.append({\n 'stops': route,\n 'distance': route_distance,\n 'load': route_load,\n 'number_of_stops': len(route)\n })\n print('Total distance of all routes: {}m'.format(total_distance))\n print('Total load of all routes: {}'.format(total_load))\n with open('./results/capacity_{}_{}.json'.format(DRONES_CAPACITY, MAX_POINT_DEMAND), 'w') as f:\n simplejson.dump({\n 'routes': routes,\n 'total_load': total_load,\n 'total_distance': total_distance,\n 'number_of_drones_used': len(routes),\n 'total_numer_of_stops': sum([x['number_of_stops'] for x in routes])\n }, f)","def print_solution(self):\n print(f'Objective: {self.solution.ObjectiveValue()}')\n total_distance = 0\n total_load = 0\n max_route_distance = 0\n for vehicle_id in range(self.data['num_vehicles']):\n index = self.routingManager.Start(vehicle_id)\n plan_output = 'Route for vehicle {}:\\n'.format(vehicle_id)\n route_distance = 0\n route_load = 0\n while not self.routingManager.IsEnd(index):\n node_index = self.manager.IndexToNode(index)\n route_load += self.data['demands'][node_index]\n plan_output += ' {0} Load({1}) -> '.format(self.data['names'][node_index], route_load)\n\n previous_index = index\n index = self.solution.Value(self.routingManager.NextVar(index))\n route_distance += self.routingManager.GetArcCostForVehicle(\n previous_index, index, vehicle_id\n )\n print(route_distance)\n\n plan_output += '{0}, Load({1}) \\n '.format(self.data['names'][self.manager.IndexToNode(index)], route_load)\n\n plan_output += 'Distance of the route: {}\\n'.format(route_distance)\n plan_output += 'Load of the route: {}\\n'.format(route_load)\n\n print(plan_output)\n total_distance += route_distance\n total_load += route_load\n\n print('Total distance of all routes: {}km'.format(total_distance))\n print('Total load of all routes: {}'.format(total_load))","def check_error(self):\n refine_results = {}\n for phase_path, phase in self.phases.items():\n refine_results[phase_path] = {}\n\n # Save the original grid to the refine results\n tx = phase.options['transcription']\n gd = tx.grid_data\n num_nodes = gd.subset_num_nodes['all']\n numseg = gd.num_segments\n\n refine_results[phase_path]['num_segments'] = numseg\n refine_results[phase_path]['order'] = gd.transcription_order\n refine_results[phase_path]['segment_ends'] = gd.segment_ends\n refine_results[phase_path]['need_refinement'] = np.zeros(numseg, dtype=bool)\n refine_results[phase_path]['error'] = np.zeros(numseg, dtype=float)\n\n if isinstance(tx, dm.RungeKutta):\n continue\n\n outputs = phase.list_outputs(units=False, out_stream=None)\n\n out_values_dict = {k: v['value'] for k, v in outputs}\n\n prom_to_abs_map = phase._var_allprocs_prom2abs_list['output']\n\n num_scalar_states = 0\n for state_name, options in phase.state_options.items():\n shape = options['shape']\n size = np.prod(shape)\n num_scalar_states += size\n\n x = np.zeros([num_nodes, num_scalar_states])\n f = np.zeros([num_nodes, num_scalar_states])\n c = 0\n\n # Obtain the solution on the current grid\n for state_name, options in phase.state_options.items():\n prom_name = f'timeseries.states:{state_name}'\n abs_name = prom_to_abs_map[prom_name][0]\n rate_source_prom_name = f\"timeseries.state_rates:{state_name}\"\n rate_abs_name = prom_to_abs_map[rate_source_prom_name][0]\n x[:, c] = out_values_dict[prom_name].ravel()\n f[:, c] = out_values_dict[rate_source_prom_name].ravel()\n c += 1\n\n # Obtain the solution on the new grid\n # interpolate x at t_hat\n new_order = gd.transcription_order + 1\n # Gauss-Lobatto does not allow even orders so increase order by 2 instead\n if gd.transcription == 'gauss-lobatto':\n new_order += 1\n new_grid = GridData(numseg, gd.transcription, new_order, gd.segment_ends, gd.compressed)\n left_end_idxs = new_grid.subset_node_indices['segment_ends'][0::2]\n left_end_idxs = np.append(left_end_idxs, new_grid.subset_num_nodes['all'] - 1)\n\n L = interpolation_lagrange_matrix(gd, new_grid)\n I = integration_matrix(new_grid)\n\n # Call the ODE at all nodes of the new grid\n x_hat, x_prime = self.eval_ode(phase, new_grid, L, I)\n E = {}\n e = {}\n err_over_states = {}\n for state_name, options in phase.state_options.items():\n E[state_name] = np.absolute(x_prime[state_name] - x_hat[state_name])\n for k in range(0, numseg):\n e[state_name] = E[state_name]/(1 + np.max(x_hat[state_name][left_end_idxs[k]:left_end_idxs[k + 1]]))\n err_over_states[state_name] = np.zeros(numseg)\n\n for state_name, options in phase.state_options.items():\n for k in range(0, numseg):\n err_over_states[state_name][k] = np.max(e[state_name][left_end_idxs[k]:left_end_idxs[k + 1]])\n\n self.error[phase_path] = np.zeros(numseg)\n refine_results[phase_path]['error'] = np.zeros(numseg)\n refine_results[phase_path]['need_refinement'] = np.zeros(numseg, dtype=bool)\n\n # Assess the errors in each state\n for state_name, options in phase.state_options.items():\n for k in range(0, numseg):\n if err_over_states[state_name][k] > self.error[phase_path][k]:\n self.error[phase_path][k] = err_over_states[state_name][k]\n refine_results[phase_path]['error'][k] = err_over_states[state_name][k]\n if self.error[phase_path][k] > phase.refine_options['tolerance']:\n refine_results[phase_path]['need_refinement'][k] = True\n\n return refine_results","def evaluateAllRroutes(self):\n isTrain = 1 # 1 for train, 0 for test\n\n performance = 0\n normalizedPerformance = 0\n priceTolerance = 5 # price to be tolerated\n\n normPerforms = []\n for i in range(8):\n print \"Route: {}\".format(i)\n [perfor, normaPerfor] = self.evaluateOneRouteForMultipleTimes(self.routes[i], priceTolerance)\n normPerforms.append(normaPerfor)\n performance += perfor\n normalizedPerformance += normaPerfor\n\n performance = round(performance/8, 2)\n normalizedPerformance = round(normalizedPerformance/8, 2)\n\n if self.isTrain:\n print \"\\nTRAIN:\"\n else:\n print \"\\nTEST:\"\n print \"Average Performance: {}%\".format(performance)\n print \"Average Normalized Performance: {}%\".format(normalizedPerformance)\n print \"Normalized Performance Variance: {}\".format(np.var(normPerforms))","def __init__( # pylint: disable=too-many-locals, too-many-arguments\r\n self, pair_type_str, origins, origin_id_field, destinations, dest_id_field,\r\n network_data_source, travel_mode, time_units, distance_units,\r\n max_routes, max_processes, out_routes, scratch_folder, reverse_direction=False,\r\n assigned_dest_field=None, od_pair_table=None, time_of_day=None, barriers=None\r\n ):\r\n pair_type = helpers.PreassignedODPairType[pair_type_str]\r\n self.origins = origins\r\n self.destinations = destinations\r\n self.out_routes = out_routes\r\n self.scratch_folder = scratch_folder\r\n time_units = helpers.convert_time_units_str_to_enum(time_units)\r\n distance_units = helpers.convert_distance_units_str_to_enum(distance_units)\r\n if not barriers:\r\n barriers = []\r\n self.max_processes = max_processes\r\n if not time_of_day:\r\n time_of_day = None\r\n else:\r\n time_of_day = datetime.datetime.strptime(time_of_day, helpers.DATETIME_FORMAT)\r\n\r\n # Initialize the dictionary of inputs to send to each OD solve\r\n self.rt_inputs = {\r\n \"pair_type\": pair_type,\r\n \"origins\": self.origins,\r\n \"origin_id_field\": origin_id_field,\r\n \"destinations\": self.destinations,\r\n \"dest_id_field\": dest_id_field,\r\n \"network_data_source\": network_data_source,\r\n \"travel_mode\": travel_mode,\r\n \"time_units\": time_units,\r\n \"distance_units\": distance_units,\r\n \"time_of_day\": time_of_day,\r\n \"reverse_direction\": reverse_direction,\r\n \"scratch_folder\": self.scratch_folder,\r\n \"assigned_dest_field\": assigned_dest_field,\r\n \"od_pair_table\": od_pair_table,\r\n \"barriers\": barriers,\r\n \"origin_transfer_fields\": [], # Populate later\r\n \"destination_transfer_fields\": [] # Populate later\r\n }\r\n\r\n # List of intermediate output OD Line files created by each process\r\n self.route_fcs = []\r\n\r\n # Construct OID ranges for chunks of origins and destinations\r\n if pair_type is helpers.PreassignedODPairType.one_to_one:\r\n # Chunks are of the format [first origin ID, second origin ID]\r\n self.chunks = helpers.get_oid_ranges_for_input(origins, max_routes)\r\n elif pair_type is helpers.PreassignedODPairType.many_to_many:\r\n # Chunks are of the format [chunk_num, chunk_size]\r\n num_od_pairs = 0\r\n with open(od_pair_table, \"r\", encoding=\"utf-8\") as f:\r\n for _ in f:\r\n num_od_pairs += 1\r\n num_chunks = ceil(num_od_pairs / max_routes)\r\n self.chunks = [[i, max_routes] for i in range(num_chunks)]\r\n\r\n # Calculate the total number of jobs to use in logging\r\n self.total_jobs = len(self.chunks)\r\n\r\n self.optimized_cost_field = None","def validate(self, request):\n values = {\n 'robot_match_comments':request.POST['robot_match_comments'],\n 'did_foul':'did_foul' in request.POST,\n 'did_technical_foul':'did_technical_foul' in request.POST,\n 'foul_description':request.POST['foul_description'],\n 'did_shoot':'did_shoot' in request.POST,\n 'auto_1':request.POST['auto_1'],\n 'auto_2':request.POST['auto_2'],\n 'auto_3':request.POST['auto_3'],\n 'auto_miss':request.POST['auto_miss'],\n 'teleop_1':request.POST['teleop_1'],\n 'teleop_2':request.POST['teleop_2'],\n 'teleop_3':request.POST['teleop_3'],\n 'teleop_5':request.POST['teleop_5'],\n 'teleop_miss':request.POST['teleop_miss'],\n 'shooting_description':request.POST['shooting_description'],\n 'did_climb':'did_climb' in request.POST,\n 'climb_start':request.POST['climb_start'],\n 'climb_finish':request.POST['climb_finish'],\n 'level_reached':request.POST.get('level_reached'),\n 'frisbees_dumped':request.POST['frisbees_dumped'],\n 'climbing_description':request.POST['climbing_description'],\n 'did_human_load':'did_human_load' in request.POST,\n 'did_ground_load':'did_ground_load' in request.POST,\n 'auto_frisbees_ground_loaded':\\\n request.POST['auto_frisbees_ground_loaded'],\n 'loading_description':request.POST['loading_description'],\n }\n if ((values['did_foul'] or values['did_technical_foul']) and\n not values['foul_description']):\n new_values = self.__dict__.copy()\n new_values.update(values)\n raise ValidationError(\n 'Please enter a description of the foul(s) the robot committed',\n new_values\n )\n if values['did_shoot']:\n try:\n values['auto_1'] = int(values['auto_1'])\n values['auto_2'] = int(values['auto_2'])\n values['auto_3'] = int(values['auto_3'])\n values['auto_miss'] = int(values['auto_miss'])\n values['teleop_1'] = int(values['teleop_1'])\n values['teleop_2'] = int(values['teleop_2'])\n values['teleop_3'] = int(values['teleop_3'])\n values['teleop_5'] = int(values['teleop_5'])\n values['teleop_miss'] = int(values['teleop_miss'])\n except ValueError:\n raise ValidationError(\n 'You must enter a number for all of the shooting numbers',\n self.__dict__.copy().update(values)\n )\n if values['did_climb']:\n try:\n values['climb_start'] = int(values['climb_start'])\n values['climb_finish'] = int(values['climb_finish'])\n try:\n values['level_reached'] = int(values['level_reached'])\n except TypeError:\n new_values = self.__dict__.copy()\n new_values.update(values)\n raise ValidationError(\n 'You must select a level the robot climbed too',\n new_values\n )\n values['frisbees_dumped'] = int(values['frisbees_dumped'])\n except ValueError:\n new_values = self.__dict__.copy()\n new_values.update(values)\n raise ValidationError(\n 'All climbing related numbers must be numbers',\n new_values\n )\n if values['did_ground_load']:\n try:\n values['auto_frisbees_ground_loaded'] = int(\n values['auto_frisbees_ground_loaded'])\n except ValueError:\n new_values = self.__dict__.copy()\n new_values.update(values)\n raise ValidationError(\n 'All numbers of frisbees ground loaded must be numbers',\n new_values\n )\n return values","def readOptimizationResultsFile(self):\n requiredLineNo = 0\n self.createParamters()\n \n self.optimizationResultsFile = open(self.fileName, 'r')\n \n for lineIndex, line in enumerate(self.optimizationResultsFile):\n if lineIndex == 0:\n startingPhase1, startingPhase2 = line.split()\n self.startingPhase1, self.startingPhase2 = int(startingPhase1), int(startingPhase2)\n\n elif lineIndex == 1:\n init1, init2, elapsedGreen1, elapsedGreen2 = line.split()\n self.init1, self.init2 = float(init1), float(init2)\n\n elif lineIndex == 2:\n self.processPhaseDuration(line, self.leftCriticalPointsRing1, self.leftCriticalPointsRing2)\n self.processPhaseSequence()\n\n elif lineIndex == 3:\n self.processPhaseDuration(line, self.leftCriticalPointsRing1, self.leftCriticalPointsRing2)\n self.processPhaseSequence()\n\n elif lineIndex == 4:\n self.processPhaseDuration(line, self.leftCriticalPointsRing1, self.leftCriticalPointsRing2)\n self.processPhaseSequence()\n\n elif lineIndex == 5:\n self.processPhaseDuration(line, self.rightCriticalPointsRing1, self.rightCriticalPointsRing2)\n\n elif lineIndex == 6:\n self.processPhaseDuration(line, self.rightCriticalPointsRing1, self.rightCriticalPointsRing2)\n\n elif lineIndex == 7:\n self.processPhaseDuration(line, self.rightCriticalPointsRing1, self.rightCriticalPointsRing2)\n\n elif lineIndex == 14:\n noOfRequest = int(line)\n requiredLineNo = 15 + noOfRequest\n # break\n \n elif lineIndex >=15 and lineIndex < requiredLineNo:\n self.getPriorityRequests(line)\n \n elif lineIndex >=15 and lineIndex >= requiredLineNo:\n break\n # self.optimizationResultsFile = open(self.fileName, 'r')\n # for i, line in enumerate(self.optimizationResultsFile):\n # if i in range(15, requiredLineNo):\n\n self.optimizationResultsFile.close()\n # self.getPriorityRequests(requiredLineNo)\n \n self.getCummulativeValues()\n self.generateTimePhaseDiagram()","def check_required_props(self,\n df,\n node,\n dd,\n exclude_props = [ # submitters don't provide these properties, so remove them from QC check\n # case props not provided by submitters\n \"datasets.submitter_id\",\n \"token_record_id\",\n \"linked_external_data\",\n #series_file props not provided by submitters\n \"file_name\",\n \"md5sum\",\n \"file_size\",\n \"object_id\",\n \"storage_urls\",\n \"core_metadata_collections.submitter_id\",\n \"core_metadata_collections\",\n \"associated_ids\",\n #imaging_study props not provided by submitters\n \"loinc_code\",\n \"loinc_system\",\n \"loinc_contrast\",\n \"loinc_long_common_name\",\n \"loinc_method\",\n \"days_from_study_to_neg_covid_test\",\n \"days_from_study_to_pos_covid_test\"\n ]\n ):\n errors = []\n links = self.list_links(node, dd)\n any_na = df.columns[df.isna().any()].tolist()\n required_props = list(set(dd[node]['required']).difference(links).difference(exclude_props))\n for prop in required_props:\n if prop not in df:\n error = \"{} TSV does not have required property header '{}'!\".format(node,prop)\n print(error)\n errors.append(error)\n elif prop in any_na:\n error = \"{} TSV does not have complete data for required property '{}'!\".format(node,prop)\n print(error)\n errors.append(error)\n return errors","def check_data_params(self, out_log, err_log):\n self.io_dict[\"in\"][\"input_dataset_path\"] = check_input_path(self.io_dict[\"in\"][\"input_dataset_path\"], \"input_dataset_path\", out_log, self.__class__.__name__)\n self.io_dict[\"out\"][\"output_results_path\"] = check_output_path(self.io_dict[\"out\"][\"output_results_path\"], \"output_results_path\", False, out_log, self.__class__.__name__)\n if self.io_dict[\"out\"][\"output_plot_path\"]:\n self.io_dict[\"out\"][\"output_plot_path\"] = check_output_path(self.io_dict[\"out\"][\"output_plot_path\"], \"output_plot_path\", True, out_log, self.__class__.__name__)","def check_if_repeated_route(route, user_lat, user_lon):\n bus_route = route\n repeated_routes = {'101':'','105':'','106':'','107':'','230':'','111':'','113':'','116':'','119':'','240':'','120':'','271':'','70':'','2':'pt','7':'','8':'','18':'','29':'','1':'pt','3':'pt','4':'pt','402':'pt','425':'pt','202':'pt','212':'pt','214':'pt','102':'pt','10':'pt','11':'pt','13':'','28':'pt','41':'','45':'','55':'pt','57':'pt','63':'pt','47':'','48':'','60':'','64':'','67':'','42':'','12':'','21':''}\n intercity_transit = ['47','48','60','64','67','42','12','13','21','41','45']\n king_county_metro = ['917', 'A Line', '225', '231', '239', '230', '250', '37', '910', '628', '372', '373', '630', '218', '631', '63', '4', '36', '43', '986', '823', '44', '987', '212', '45', '988', 'Trailhead Direct Issaquah Alps', '989', '824', '214', '47', '180', '48', '635', '216', '5', '217', '982', '41', '21', '984', 'F Line', 'E Line', '342', '345', '346', '952', '347', '894', '348', '49', '248', '355', '895', '116', '243', '245', '893', '118', '246', '661', '931', '119', '67', '915', '12', '249', '120', '238', '62', '226', '111', '24', '64', '193', '113', '240', '65', '930', '241', '114', '255', '73', '128', '74', '257', '75', '13', '907', '121', '122', '7', '123', '252', '70', '124', '71', '125', '221', '244', 'Trailhead Direct Cougar Mt.', '55', '994', '50', '995', 'Trailhead Direct Mailbox Peak', '219', '981', 'Trailhead Direct Mt. Si', '22', '224', '157', '204', '101', '232', '102', '105', '57', '106', '234', '156', '107', '235', '236', '60', '980', '237', 'B Line', '11', '775', '56', '1', '10', '166', '167', '903', '158', '908', '159', '3', '906', '301', '913', '914', '303', '164', '304', '916', '901', '178', '169', '308', '17', '309', '31', '311', '312', '177', '168', '629', 'Duvall-Monroe Shuttle', '268', '14', '76', '77', '131', '26', '773', '29', '132', '78', '40', '8', '887', 'C Line', '277', '9', '153', '28', '154', '269', 'D Line', '27', '143', '271', '886', '148', '888', '889', '15', '150', '891', '892', '208', '200', '181', '32', '182', '33', '183', '330', '331', '186', '187', '316', '179', '18', '192', '197', '2', '19', '190']\n pierce_transit = ['1','2','3','4','402','425','202','212','214','102','10','11','13','28','41','45','48','55','57','63']\n north_routes = ['101','105','106','107','230','111','113','116','119','240','120','271','70','2','3','4','7','8','12','18','29']\n \n if bus_route in repeated_routes:\n if user_lon < -122.5 and user_lat > 47.1:\n # going to be pierce county (or kitsap)\n if bus_route in pierce_transit: \n bus_route += 'pt'\n else:\n bus_route += repeated_routes[bus_route]\n elif user_lat > 47.7:\n # going to be community transit or everett transit (N)\n if bus_route in north_routes: \n bus_route += 'N'\n else:\n bus_route += repeated_routes[bus_route] \n elif user_lat > 47.33:\n # going to be king county metro\n if bus_route in king_county_metro:\n bus_route = bus_route\n else:\n bus_route += repeated_routes[bus_route]\n elif user_lat > 47.08:\n # going to be pierce transit\n if bus_route in pierce_transit: \n bus_route += 'pt'\n else:\n bus_route += repeated_routes[bus_route] \n else:\n # going to be intercity transit\n if bus_route in intercity_transit: \n bus_route += 'it'\n else:\n bus_route += repeated_routes[bus_route] \n\n return bus_route","def _check_case_parameters_aero(subcase: Subcase, fem: BDF, sol: int,\n ierror: int=0, nerrors: int=100,\n stop_on_failure: bool=True) -> int:\n log = fem.log\n if 'TRIM' in subcase:\n trim_id = subcase.get_parameter('TRIM')[0]\n if trim_id not in fem.trims:\n msg = (\n f'SOL={sol}\\n'\n f'TRIM = {trim_id}\\n'\n f'trims={fem.trims}\\n'\n f'subcase:\\n{subcase}')\n log_error(sol, [144, 200], msg, log)\n else:\n trim = fem.trims[trim_id]\n suport1 = None\n if 'SUPORT1' in subcase:\n suport_id = subcase.get_parameter('SUPORT1')[0]\n suport1 = fem.suport1[suport_id]\n try:\n trim.verify_trim(\n fem.suport, suport1, fem.aestats, fem.aeparams,\n fem.aelinks, fem.aesurf, xref=True)\n except RuntimeError:\n if stop_on_failure or ierror == nerrors:\n raise\n ierror += 1\n exc_info = sys.exc_info()\n traceback.print_exception(*exc_info)\n #traceback.print_stack()\n #fem.log.error(e.msg)\n #raise\n assert 'DIVERG' not in subcase, subcase\n #allowed_sols = [144, 200]\n\n if 'DIVERG' in subcase:\n value = subcase.get_parameter('DIVERG')[0]\n assert value in fem.divergs, 'value=%s\\n divergs=%s\\n subcase:\\n%s' % (value, str(fem.divergs), str(subcase))\n assert 'TRIM' not in subcase, subcase\n #allowed_sols = [144, 200]\n\n if 'FMETHOD' in subcase:\n # FLUTTER\n fmethod_id = subcase.get_parameter('FMETHOD')[0]\n unused_fmethod = fem.flutters[fmethod_id]\n allowed_sols = [145, 200]\n ierror = check_sol(sol, subcase, allowed_sols, 'FMETHOD', log, ierror, nerrors)\n return ierror","def solve_route_in_parallel(self):\r\n # Validate Route settings. Essentially, create a dummy Route class instance and set up the\r\n # solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes\r\n # that are guaranteed to all fail.\r\n self._validate_route_settings()\r\n\r\n # Check if the input origins and destinations have any fields we should use in the route analysis\r\n self._populate_input_data_transfer_fields()\r\n\r\n # Compute Route in parallel\r\n LOGGER.info(f\"Beginning parallelized Route solves ({self.total_jobs} chunks)\")\r\n completed_jobs = 0 # Track the number of jobs completed so far to use in logging\r\n # Use the concurrent.futures ProcessPoolExecutor to spin up parallel processes that solve the routes\r\n with futures.ProcessPoolExecutor(max_workers=self.max_processes) as executor:\r\n # Each parallel process calls the solve_route() function with the rt_inputs dictionary for the\r\n # given origin ranges and their assigned destinations.\r\n jobs = {executor.submit(solve_route, self.rt_inputs, range): range for range in self.chunks}\r\n # As each job is completed, add some logging information and store the results to post-process later\r\n for future in futures.as_completed(jobs):\r\n try:\r\n # The Route job returns a results dictionary. Retrieve it.\r\n result = future.result()\r\n except Exception: # pylint: disable=broad-except\r\n # If we couldn't retrieve the result, some terrible error happened and the job errored.\r\n # Note: This does not mean solve failed. It means some unexpected error was thrown. The most likely\r\n # causes are:\r\n # a) If you're calling a service, the service was temporarily down.\r\n # b) You had a temporary file read/write or resource issue on your machine.\r\n # c) If you're actively updating the code, you introduced an error.\r\n # To make the tool more robust against temporary glitches, retry submitting the job up to the number\r\n # of times designated in helpers.MAX_RETRIES. If the job is still erroring after that many retries,\r\n # fail the entire tool run.\r\n errs = traceback.format_exc().splitlines()\r\n failed_range = jobs[future]\r\n LOGGER.debug((\r\n f\"Failed to get results for Route chunk {failed_range} from the parallel process. Will retry \"\r\n f\"up to {helpers.MAX_RETRIES} times. Errors: {errs}\"\r\n ))\r\n job_failed = True\r\n num_retries = 0\r\n while job_failed and num_retries < helpers.MAX_RETRIES:\r\n num_retries += 1\r\n try:\r\n future = executor.submit(solve_route, self.rt_inputs, failed_range)\r\n result = future.result()\r\n job_failed = False\r\n LOGGER.debug(f\"Route chunk {failed_range} succeeded after {num_retries} retries.\")\r\n except Exception: # pylint: disable=broad-except\r\n # Update exception info to the latest error\r\n errs = traceback.format_exc().splitlines()\r\n if job_failed:\r\n # The job errored and did not succeed after retries. Fail the tool run because something\r\n # terrible is happening.\r\n LOGGER.debug(f\"Route chunk {failed_range} continued to error after {num_retries} retries.\")\r\n LOGGER.error(\"Failed to get Route result from parallel processing.\")\r\n errs = traceback.format_exc().splitlines()\r\n for err in errs:\r\n LOGGER.error(err)\r\n raise\r\n\r\n # If we got this far, the job completed successfully and we retrieved results.\r\n completed_jobs += 1\r\n LOGGER.info(\r\n f\"Finished Route calculation {completed_jobs} of {self.total_jobs}.\")\r\n\r\n # Parse the results dictionary and store components for post-processing.\r\n if result[\"solveSucceeded\"]:\r\n self.route_fcs.append(result[\"outputRoutes\"])\r\n else:\r\n # Typically, a solve fails because no destinations were found for any of the origins in the chunk,\r\n # and this is a perfectly legitimate failure. It is not an error. However, they may be other, less\r\n # likely, reasons for solve failure. Write solve messages to the main GP message thread in debug\r\n # mode only in case the user is having problems. The user can also check the individual OD log\r\n # files.\r\n LOGGER.debug(f\"Solve failed for job id {result['jobId']}.\")\r\n LOGGER.debug(result[\"solveMessages\"])\r\n\r\n # Post-process outputs\r\n if self.route_fcs:\r\n LOGGER.info(\"Post-processing Route results...\")\r\n self.route_fcs = sorted(self.route_fcs)\r\n self._post_process_route_fcs()\r\n else:\r\n LOGGER.warning(\"All Route solves failed, so no output was produced.\")\r\n\r\n # Clean up\r\n # Delete the job folders if the job succeeded\r\n if DELETE_INTERMEDIATE_OUTPUTS:\r\n LOGGER.info(\"Deleting intermediate outputs...\")\r\n try:\r\n shutil.rmtree(self.scratch_folder, ignore_errors=True)\r\n except Exception: # pylint: disable=broad-except\r\n # If deletion doesn't work, just throw a warning and move on. This does not need to kill the tool.\r\n LOGGER.warning(f\"Unable to delete intermediate Route output folder {self.scratch_folder}.\")\r\n\r\n LOGGER.info(\"Finished calculating Routes.\")","def __init__(self):\n self.parameter = [[(0,1),(1,1),(0,0),(1,0)],\n [(1,0),(1,0),(0,1),(0,1)],\n [(1,0),(0,1),(1,0),(0,1)],\n [(0,0),(0,0),(0,0),(0,0)]]\n \"\"\"Distance is number of whole route from origin to destination\"\"\"\n self.distance = 100\n \"\"\"action sets\"\"\"\n self.action = [0,55,75]\n self.maxSpeed = self.action[-1]\n \"\"\"time period for each stage\"\"\"\n self.time_interval = 0.5\n \"\"\"Number of stages we want to check. Here we can use this to limit the\n travel time, since sometimes we want driver to arrive in a time window.\n For example, if stage is 4, that means we want to driver finish route within \n 2 hours. \"\"\"\n self.stage = 4\n self.time_block = 0.5\n self.distance_block = 25","def _calculate_emissions(self):\n parameters = self._get_pollutants_for_vehicle()\n\n self.routes = RouteSet()\n\n if \"routes\" not in self._json_data:\n log.debug(\"Error in returned JSON data from web service.\")\n log.debug(\"data: {}\".format(self._json_data))\n return\n\n # Create a \"set\" of Routes. The planner web service will\n # return 2-4 routes with different paths.\n for idx, r in enumerate(self._json_data[\"routes\"][\"features\"]):\n attributes = r.get(\"attributes\")\n route = Route(distance=attributes.get(\"Total_Meters\"),\n minutes=attributes.get(\"Total_Minutes\"),\n path=r.get(\"geometry\").get(\"paths\")[0], id = idx)\n self.routes.add(route)\n\n log.debug(\"Nr of routes: {}\".format(len(self.routes)))\n for i, route in enumerate(self.routes):\n # A list of x,y,z points that all together represents the route\n path_coordinates = route.path\n distances = []\n\n # Nifty little trick to loop over 'path_coordinates',\n # but keep a reference to the 'prev' item to calculate the\n # distance between them\n iter_points = iter(path_coordinates)\n prev = next(iter_points)\n for point in path_coordinates:\n if not distances:\n # first point\n distances.append(Planner._get_distance_3d(prev, point) / 1000)\n else:\n distances.append(distances[-1] + Planner._get_distance_3d(prev, point) / 1000)\n\n point_slope = Planner._get_slope(prev, point)\n\n # Calculate emission for each pollutants the user has asked for\n for p in self._pollutants:\n parms = [x for x in parameters if x.pollutant.name.startswith(p)]\n calc_emission = self.get_emission(parms, point_slope)\n route.add_pollutant(p, calc_emission)\n\n prev = point\n\n route.add_distances(distances)","def validate(self, mode: QueryMode = \"batch\") -> Dict[str, Any]:\n self._query_by_task_id = {}\n explore_count = self._count_explores()\n printer.print_header(\n f\"Testing {explore_count} \"\n f\"{'explore' if explore_count == 1 else 'explores'} \"\n f\"[{mode} mode] \"\n f\"[concurrency = {self.query_slots}]\"\n )\n\n self._create_and_run(mode)\n if mode == \"hybrid\" and self.project.errored:\n self._create_and_run(mode)\n\n for model in sorted(self.project.models, key=lambda x: x.name):\n for explore in sorted(model.explores, key=lambda x: x.name):\n message = f\"{model.name}.{explore.name}\"\n printer.print_validation_result(\n passed=not explore.errored, source=message\n )\n\n return self.project.get_results(mode)","def checkParameters(self):\n self.DEBUG(\"EDPluginExecDatGnomv1_0.checkParameters\")\n self.checkMandatoryParameters(self.dataInput, \"Data Input is None\")\n self.checkMandatoryParameters(self.dataInput.inputCurve, \"No input Curve file provided\")","def _check_inputvalues(self):\n # Check x, y and z are int or float dtypes\n # ie do not contain any unusable values like strings\n if not (self.x.dtype in [np.int, np.float]):\n raise TypeError(\"Route input 'x' must be either int or float dtypes\")\n\n if not (self.y.dtype in [np.int, np.float]):\n raise TypeError(\"Route input 'x' must be either int or float dtypes\")\n\n # Performs checks on z if not empty\n if self.z is not None:\n for v in self.z.values():\n if not (v.dtype in [np.int, np.float]):\n raise TypeError(\"Route input 'x' must be either int or float dtypes\")","def check_is_ready(self):\n self.logger.info(\"Checking optimization inputs for automatic design.\")\n if self.optimization_graph is None:\n raise RuntimeError(\"The optimization graph needs to be defined in order to optimize the network.\")\n if self.network_objective is None:\n raise RuntimeError(\"A network objective has to be set (in MW).\")","def _checkSettings(self):\n geomsThatNeedMeshSize = (\"1D slab\", \"1D cylinder\")\n if self.geometry in geomsThatNeedMeshSize:\n if self.meshSubdivisionsPerCm is None:\n raise ValueError(\n \"{} geometry requires `mesh points per cm` to be defined in cross sections.\".format(\n self.geometry\n )\n )\n if self.criticalBuckling != False:\n raise ValueError(\n \"{} geometry cannot model critical buckling. Please disable\".format(\n self.geometry\n )\n )","def validate(self):\n super(ReferenceMapping, self).validate()\n self.check_observatory()\n self.check_instrument()\n self.check_filekind()\n self.check_schema_uri()\n if \"reference_to_dataset\" in self.header:\n parkeys = self.get_required_parkeys()\n for _reference, dataset in self.reference_to_dataset.items():\n assert dataset.upper() in parkeys, \\\n \"reference_to_dataset dataset keyword not in parkey keywords.\"\n with log.augment_exception(\"Invalid mapping:\", self.instrument, self.filekind):\n self.selector.validate_selector(self.tpn_valid_values)","def validate(self):\n errors = []\n app = errors.append\n\n if not self.hint_cores >= self.mpi_procs * self.omp_threads >= self.min_cores:\n app(\"self.hint_cores >= mpi_procs * omp_threads >= self.min_cores not satisfied\")\n\n if self.omp_threads > self.hw.cores_per_node:\n app(\"omp_threads > hw.cores_per_node\")\n\n if self.mem_per_proc > self.hw.mem_per_node:\n app(\"mem_mb >= self.hw.mem_per_node\")\n\n if not self.max_mem_per_proc >= self.mem_per_proc >= self.min_mem_per_proc:\n app(\"self.max_mem_per_proc >= mem_mb >= self.min_mem_per_proc not satisfied\")\n\n if self.priority <= 0:\n app(\"priority must be > 0\")\n\n if not (1 <= self.min_cores <= self.hw.num_cores >= self.hint_cores):\n app(\"1 <= min_cores <= hardware num_cores >= hint_cores not satisfied\")\n\n if errors:\n raise self.Error(str(self) + \"\\n\".join(errors))","def validate(self):\r\n for opt in self.required:\r\n if not getattr(self, opt):\r\n print \"Error: %s is not specified.\" % opt\r\n self.optp.print_help()\r\n sys.exit(1)","def delivery_optimization(trucks_max_loadings,\n drivers_weights,\n items_csv_file,\n trucks_measuring_unit='kg',\n drivers_measuring_unit='kg',\n csv_delimiter=';',\n column_mapping_required=False,\n columns_mapping={}):\n\n if len(trucks_max_loadings) != len(drivers_weights):\n print(\"The count of trucks must be equal to the count of drivers!\")\n exit(1)\n\n\n # Calculate the possible loads for the trucks\n\n # If necessary, converting kg to gram for the trucks max loading and drivers weight.\n if trucks_measuring_unit == 'kg':\n trucks_max_loadings_gram = [max_load*1000 for max_load in trucks_max_loadings]\n else:\n trucks_max_loadings_gram = trucks_max_loadings\n\n if drivers_measuring_unit == 'kg':\n drivers_weights_gram = [weight*1000 for weight in drivers_weights]\n else:\n drivers_weights_gram = drivers_weights\n\n\n # Subtract the drivers weights from trucks max loading weight.\n trucks_possible_loads = [max_load - driver_weight\n for max_load,driver_weight\n in zip(trucks_max_loadings_gram, drivers_weights_gram)]\n\n print(\"\\nTrucks max possible items loadings: \")\n for i, max_load in enumerate(trucks_possible_loads):\n print(\"Truck {}: {} gram\".format(i, max_load))\n\n\n # Read the data from csv file into a dataframe by pandas.\n df_items = pd.read_csv(items_csv_file, delimiter=csv_delimiter, decimal='.')\n\n # Map the column names if required\n if column_mapping_required and columns_mapping is not None:\n df_items.rename(columns = {origin_name : new_name for new_name, origin_name in columns_mapping.items()},\n inplace=True)\n\n\n # Start with pulp action\n\n # Create a new LpProblem from pulp.\n # The LpProblem should maximize a objective function, which will be set later.\n prob = pl.LpProblem(\"Delivery_Problem\",pl.LpMaximize)\n\n\n items_names = df_items['name'].tolist()\n\n # Create LpVariables from pulp for optimizing.\n # The values of this variables will be changed by the solver included in pulp to optimize the objective function.\n # Set variables to optimize as items count, lower bound = 0 and as Integer numbers\n # create optimizeable variables for each item for each truck as a list of dicts\n lp_trucks_items = [pl.LpVariable.dicts(\"Truck {}\".format(truck_number), items_names, lowBound=0, cat='Integer')\n for truck_number in range(len(trucks_possible_loads))]\n\n\n # Adding main objective function\n #\n # Construct a objective function and add it to the LpProblem.\n # The objective function will be calculated repeatedly to adjust the LpVariables to maximize itself.\n #\n # For the objective function we calculate the total sum of utility for the items on the trucks.\n # To do this, we multiply the utility value of the item by its count from the LpVariable.\n # We do that with each item on each truck and get the sum of all.\n prob += pl.lpSum([\n item['utility'] * lp_truck_items[item['name']]\n for _, item in df_items.iterrows()\n for lp_truck_items in lp_trucks_items\n ])\n\n\n # Adding constraints\n\n # Adding max capacity constraints\n #\n # We have a limit of load for each truck, what we can implement as constraints.\n # Instead of taking the total sum as in the objective function, here we create a separate constraint for each truck.\n # To do this, we multiply the weight of the item by its count from the LpVariable.\n # We do that with each item on one truck and get the sum of its weight.\n # Then we add a new constraint where the sum of weight must be lower or equal\n # to the truck max possible load (which we got further up).\n # Repeat for all trucks.\n\n # for each truck get the possible load\n for truck_number, truck_possible_load in enumerate(trucks_possible_loads):\n lp_truck_items = lp_trucks_items[truck_number]\n # multiply the weight of the item with its count on the truck\n lp_sum = pl.lpSum([float(item['weight']) * lp_truck_items[item['name']] for _, item in df_items.iterrows()])\n # set the constraint, that the sum of weights on the truck must be lower or equal to his possible load\n prob += lp_sum <= truck_possible_load\n\n\n # Adding item max count constraints\n #\n # Like the max possible load above it exists also a limit by the max count of each item type.\n # This limit applies one item type over all trucks.\n # So we go through the item list and get the count of it from each truck by the LpVariables in `lp_trucks_items`.\n # We sum the count over all trucks and add a new constraint\n # where it must be lower or equal to the defined max count.\n # Repeat for all items.\n for _, item in df_items.iterrows():\n total_item_count = sum([lp_truck_items[item['name']] for lp_truck_items in lp_trucks_items])\n prob += total_item_count <= item['max_count']\n\n\n # Try to solve the defined problem\n #\n # It can be set a certain solver from the pulp library.\n # We set the msg parameter to False, because it disables the solvers output to stdout\n print(\"\\nStart solving...\", end='')\n prob.solve(pl.getSolver('PULP_CBC_CMD', msg=False))\n print(\"done\\n\")\n\n # Show the status of solving.\n print(\"Result status:\", pl.LpStatus[prob.status])\n\n\n # Convert results to own data structure\n #\n # Because of the subdivide by upper name in the dicts has each LpVariable name a string as prefix like \"Truck_1_\".\n # Furthermore the library has replaced all whitespaces in the variable names by underscores.\n # So we can not use the original item name as key to get the value of a item.\n #\n # To make easy access we make a own result list for each truck.\n # In this list we add a dictionary for all items on the respective truck.\n # Because the division for each truck, we can remove the prefix on all variables.\n # Just the replaced whitespaces are taken and handled later.\n # The result values keep.\n\n # get optimized variables\n result_variables = prob.variables()\n # create a result list for the trucks\n result_trucks_items = []\n # for each truck add his items\n for truck_number in range(len(trucks_possible_loads)):\n prefix_len = len(\"Truck_{}_\".format(truck_number))\n # create a result item dict for this truck\n truck_items = {var.name[prefix_len:] : var.varValue # remove the prefix of truck in the name\n for var in result_variables\n # get only the items from the current truck\n if var.name.startswith(\"Truck_{}_\".format(truck_number))}\n # add count of items for this truck to result list\n result_trucks_items.insert(truck_number, truck_items)\n\n\n # Show each truck with containing driver weight and item count from results\n print(\"\\nResult count for each item:\")\n\n for truck_number, result_truck_items in enumerate(result_trucks_items):\n # increase the number of truck by 1 to skip the index 0 (only for presentation)\n # also divide the weight of driver by 1000 to get kg from gram\n print(\"\\nTruck {} with driver weight {}kg:\".format(truck_number+1, drivers_weights_gram[truck_number]/1000))\n for item_name, item_count in result_truck_items.items():\n # show only the items which counts are greater 0\n if item_count > 0:\n # replace underscores from pulp with whitespaces for better readability\n print(\"{:<25} = {:>10}\".format(item_name.replace('_', ' '), item_count))\n\n print(\"\")\n\n # Show possible loads of trucks\n for truck_number, truck_possible_load in enumerate(trucks_possible_loads):\n print(\"Allowed weight for truck {} (with included driver): {} gram or {} kg\".format(\n truck_number+1,\n truck_possible_load,\n truck_possible_load / 1000))\n\n print(\"\")\n\n # Show total weights of trucks containing items\n #\n # To get the total sum of weight for each truck and the chosen count of items,\n # we go through each truck from our own result list `result_trucks_items`.\n # We multiply the weight of item with the count from truck results.\n #\n # Because the library has replaced all whitespaces in the variable names by underscores,\n # we access the result value by do this with the origin name too and use it as key.\n #\n # Notice: We can not just replace all underscores with whitespaces,\n # because a origin name could contain a underscore too.\n\n # for each truck\n for truck_number, result_truck_items in enumerate(result_trucks_items):\n # calculate the total sum of weight for each item\n total_truck_weight = sum([\n item_count * item['weight']\n for item_name, item_count in result_truck_items.items()\n for _,item in df_items.iterrows()\n # the item names from pulp have replaced whitespaces ' ' with underscore '_'\n # to compare we must do this too\n if item['name'].replace(' ', '_') == item_name\n ])\n print(\"Total weight of truck {}: {} gram or {} kg\".format(truck_number+1,\n total_truck_weight,\n total_truck_weight/1000))\n\n print(\"\")\n\n # Show the total value of utility over all trucks and items\n\n # print the end value of the objective function, in our case the sum of utility from all picked items\n result_utility = pl.value(prob.objective)\n print(\"The total utility value (rounded to 2 decimal places) of picked items in both trucks is: {}\".\n format(round(result_utility, 2)))\n\n print(\"\\nProcess completed.\")","def testoptdone(self):\r\n assert self.data.optdone\r\n convergence = numpy.abs(self.data.geovalues[-1]) <= self.data.geotargets\r\n assert sum(convergence) >= 2","def validate_input(request):\n\n # Validate errors inputs\n request_data = JSONParser().parse(request)\n\n if 'action' not in request_data:\n return_data = {'error': 'No action'}\n logger.error('validate_input method: error:{} request:{}'.format(return_data, request))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n if 'east' not in request_data:\n return_data = {'error': 'No east'}\n logger.error('validate_input method: error:{} request:{}'.format(return_data, request))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n if 'west' not in request_data:\n return_data = {'error': 'No west'}\n logger.error('validate_input method: error:{} request:{}'.format(return_data, request))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n # Debug mode checking condition\n if 'number' in request_data and 'stops' in request_data:\n\n # If current status is break then making debug mode\n if ValidateError.check_current_status() == 'break':\n return CreateDebugMode.validate_input_to_create_debug_mode(request_data)\n\n # If current status is started or pending then return error_robotworking message\n elif ValidateError.check_current_status() in ['started', 'pending']:\n return_data = {'status': 'error', 'error': 'robotworking'}\n logger.error('validation_errors.check_current_status debug mode method: error:robotworking request:{}'\n .format(request_data))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n # Else return error_status message\n else:\n return_data = {'status': 'error', 'error': 'status'}\n logger.error('validation_errors.check_current_status debug mode method: error:status unknown request:{}'\n .format(request_data))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n # Disconnection checking condition\n elif request_data['action'] == 'disconnect':\n\n # If current status is success or revoked or no_uuid then making disconnection\n if ValidateError.check_current_status() in ['success', 'revoked', 'no_uuid', 'failure']:\n return CreateDisconnect.validate_input_to_create_disconnection(request_data)\n\n # If current status is started or pending or break then return error_robotworking message\n elif ValidateError.check_current_status() in ['started', 'pending', 'break']:\n return_data = {'status': 'error', 'error': 'robotworking'}\n logger.error('validation_errors.check_current_status disconnection method: '\n 'error:robotworking request:{}'.format(request_data))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n # Else return error_status message\n else:\n return_data = {'status': 'error', 'error': 'status'}\n logger.error('validation_errors.check_current_status disconnection method:'\n ' error:status unknown request:{}'.format(request_data))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n # Connection checking condition\n elif request_data['action'] == 'connect':\n\n # If current status is success or revoked or no_uuid then making connection\n if ValidateError.check_current_status() in ['success', 'revoked', 'no_uuid', 'failure']:\n return CreateConnection.validate_input_to_create_connection(request_data)\n\n # If current status is started or pending or break then return error_robotworking message\n elif ValidateError.check_current_status() in ['started', 'pending', 'break']:\n return_data = {'status': 'error', 'error': 'robotworking'}\n logger.error('validation_errors.check_current_status connection method: error:robotworking request:{}'\n .format(request_data))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n # Else return error_status message\n else:\n return_data = {'status': 'error', 'error': 'status unknown'}\n logger.error('validation_errors.check_current_status connection method: error:status request:{}'\n .format(request_data))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\n\n # Create connection in connection table\n elif request.data['action'] == 'create_connection':\n return ConnectionUtilities.create_dummy_connection(request_data)\n\n # Else return error_operation message\n else:\n return_data = {'status': 'error', 'error': 'operation'}\n logger.error('validation_errors.check_current_status connection method: error:action unknown request:{}'\n .format(request_data))\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)","def validate_parameters(self):\n\n flag = True\n warnings = \"\"\n # Check radius\n r = self.parameters.get('r', 0)\n if type(r) not in [int, float]:\n flag = False\n warnings += \"Radius r must be a float value\\n\"\n else:\n if r <= 0:\n flag = False\n warnings += \"Radius r must be higher than 0\\n\"\n # Check if is full penetrating\n op = self.parameters.get('full', False)\n\n if not op:\n # Check observation well length\n if 'd' in self.parameters and 'l' in self.parameters:\n d = self.parameters.get('d', -1)\n l = self.parameters.get('l', -1)\n if type(l) not in [int, float]:\n flag = False\n warnings += \"Depth of well bottom must be a float value\\n\"\n else:\n if l < 0:\n flag = False\n warnings += \"Depth l must be higher than 0\\n\"\n if type(d) not in [int, float]:\n flag = False\n warnings += \"Depth of well screen must be a float value\\n\"\n else:\n if d < 0 or d > l:\n flag = False\n warnings += \"Depth d must be in range 0 <= d <= l\\n\"\n # Check piezometer depth\n elif 'z' in self.parameters:\n z = self.parameters.get('z', -1)\n if type(z) not in [int, float]:\n flag = False\n warnings += \"Depth of piezometer must be a float value\\n\"\n else:\n if z < 0:\n flag = False\n warnings += \"Depth z must be higher than 0\\n\"\n else:\n flag = False\n warnings += \"Well don't contain well depth attributes\\n\"\n return(flag, warnings) # End Function","def validate(self):\n self.filter_passing_hits()\n\n checks = {\"number of hits\":self.check_hits(),\n \"base pair count\":self.check_bp(),\n \"contig count\":self.check_contigs(),\n \"characters\": self.check_chars(),\n \"checksum\":not check_checksum(self.seqdata.checksum)}\n\n failed_checks = {(k, v) for k, v in checks.iteritems() if v is False}\n\n if failed_checks:\n \"\"\"\n replace this with logger, break would be replaced by a raised\n Exception where the Exception would be caught by the\n Sequence_Upload code\n \"\"\"\n for k, v in failed_checks:\n with open(generate_path(\"outputs/seq_errors.txt\"), \"a\") as file_:\n file_.write(\n '%s failed validation:'\n 'the %s was not valid\\n' %(self.seqdata.accession, k)\n )\n self.seqdata.valid = False\n else:\n self.seqdata.valid = True","def processTradeRoutes(self):\n try:\n nextRound = self.currentRound+1\n resultslist = []\n for trID in self.tradeRoutes.keys():\n myTradeRoute = self.tradeRoutes[trID]\n (systemFromID, systemToID, tradeRouteType) = string.split(trID, '-')\n systemFrom = self.systems[systemFromID]\n systemTo = self.systems[systemToID]\n cancel = 0\n warpReq = 0\n # choose trade route type\n if tradeRouteType == 'GEN':\n # update what system sends based on what it makes\n myTradeRoute.AL = systemFrom.prodAL\n myTradeRoute.EC = systemFrom.prodEC\n myTradeRoute.IA = systemFrom.prodIA\n \n # check if trade route is adjacent or requires warp gate capacity\n if systemTo.id in systemFrom.warpGateSystems:\n warpReq = myTradeRoute.getWarpRequired()\n if warpReq > (systemFrom.availWGC-systemFrom.usedWGC) or warpReq > (systemTo.availWGC-systemTo.usedWGC):\n cancel = 1\n elif systemTo.id not in systemFrom.connectedSystems:\n cancel = 1\n \n if (systemFrom.AL >= myTradeRoute.AL and\n systemFrom.EC >= myTradeRoute.EC and\n systemFrom.IA >= myTradeRoute.IA and \n cancel == 0):\n # process trade route\n systemFrom.AL -= myTradeRoute.AL\n systemFrom.EC -= myTradeRoute.EC\n systemFrom.IA -= myTradeRoute.IA\n systemTo.AL += myTradeRoute.AL\n systemTo.EC += myTradeRoute.EC\n systemTo.IA += myTradeRoute.IA\n # deduct properly if empires are different\n empireFrom = self.empires[systemFrom.myEmpireID]\n empireTo = self.empires[systemTo.myEmpireID]\n if empireFrom <> empireTo:\n empireFrom.AL -= myTradeRoute.AL\n empireFrom.EC -= myTradeRoute.EC\n empireFrom.IA -= myTradeRoute.IA\n empireTo.AL += myTradeRoute.AL\n empireTo.EC += myTradeRoute.EC\n empireTo.IA += myTradeRoute.IA\n \n if warpReq > 0:\n systemFrom.usedWGC += warpReq\n systemTo.usedWGC += warpReq\n \n # mail trade route completion\n resultslist.append('Trade from System:%s to System:%s complete' % (systemFrom.id, systemTo.id))\n self.mailTradeInfo('completed', myTradeRoute, nextRound)\n else:\n cancel = 1\n \n # check if route should be cancelled\n if cancel == 1:\n resultslist.append('cancel trade route=%s' % myTradeRoute.id)\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\n elif myTradeRoute.oneTime == 1:\n resultslist.append('one time trade route=%s' % myTradeRoute.id)\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\n \n return str(resultslist)\n except:\n return 'galaxy->processTradeRoutes error'","def validate_router_gw_info(self, context, router_id, gw_info):\n # check if this router has a vpn service\n admin_con = context.elevated()\n # get all relevant services, except those waiting to be deleted or in\n # ERROR state\n filters = {'router_id': [router_id],\n 'status': [constants.ACTIVE, constants.PENDING_CREATE,\n constants.INACTIVE, constants.PENDING_UPDATE]}\n services = self.vpn_plugin.get_vpnservices(admin_con, filters=filters)\n if services:\n # do not allow enable-snat\n if (gw_info and\n gw_info.get('enable_snat', cfg.CONF.enable_snat_by_default)):\n raise RouterWithSNAT(router_id=router_id)\n else:\n # if this is a non-vpn router. if snat was disabled, should check\n # there is no overlapping with vpn connections\n if (gw_info and\n not gw_info.get('enable_snat',\n cfg.CONF.enable_snat_by_default)):\n # get router subnets\n subnets = self._core_plugin._find_router_subnets_cidrs(\n context, router_id)\n # find all vpn services with connections\n if not self._check_subnets_overlap_with_all_conns(\n admin_con, subnets):\n raise RouterWithOverlapNoSnat(router_id=router_id)","def _further_validate_and_setup(self) -> None:\n\n # Make sure parameters make sense/are valid\n if len(self.validated['learners']) != len(self.validated['param_grids']):\n raise SchemaError(autos=None,\n errors='The lists of of learners and parameter '\n 'grids must be the same size.')\n if (self.validated['hashed_features'] is not None\n and self.validated['hashed_features'] == 0):\n self.validated['hashed_features'] = self._n_features_feature_hashing\n if self.validated['lognormal'] and self.validated['power_transform']:\n raise SchemaError(autos=None,\n errors='Both \"lognormal\" and \"power_transform\" '\n 'were set simultaneously.')\n if len(self.validated['learners']) != len(self.validated['param_grids']):\n raise SchemaError(autos=None,\n errors='The \"learners\" and \"param_grids\" '\n 'parameters were both set and the '\n 'lengths of the lists are unequal.')","def validate_all_fields(self):\n\n if self.validate_byr() and \\\n self.validate_iyr() and \\\n self.validate_eyr() and \\\n self.validate_hgt() and \\\n self.validate_hcl() and \\\n self.validate_ecl() and \\\n self.validate_pid() and \\\n self.validate_cid():\n return True\n return False","def testoptdone(self):\r\n assert self.data.optdone\r\n target_e, target_g, target_s = self.data.geotargets\r\n value_e, value_g, value_s = self.data.geovalues[-1]\r\n converged = (value_e < target_e and value_g < target_g) or (value_g < target_g and value_s < target_s)\r\n assert converged","def _validate(self):\n self.params['report date'] = None\n if any(self.params.values()):\n s = self.params['start']\n e = self.params['end']\n cond1 = s is None\n cond2 = e is None\n \n if cond1 and not cond2:\n self.params['report date'] = e\n if not cond1 and cond2:\n self.params['report date'] = s\n if not cond1 and not cond2:\n if s == e:\n self.params['report date'] = s\n else:\n if s > e:\n self.params['start'] = e\n self.params['end'] = s\n else:\n self.params['report date'] = MAX_DATE","def __init__(self, **kwargs):\r\n self.pair_type = kwargs[\"pair_type\"]\r\n self.origins = kwargs[\"origins\"]\r\n self.origin_id_field = kwargs[\"origin_id_field\"]\r\n self.destinations = kwargs[\"destinations\"]\r\n self.dest_id_field = kwargs[\"dest_id_field\"]\r\n self.network_data_source = kwargs[\"network_data_source\"]\r\n self.travel_mode = kwargs[\"travel_mode\"]\r\n self.time_units = kwargs[\"time_units\"]\r\n self.distance_units = kwargs[\"distance_units\"]\r\n self.time_of_day = kwargs[\"time_of_day\"]\r\n self.reverse_direction = kwargs[\"reverse_direction\"]\r\n self.scratch_folder = kwargs[\"scratch_folder\"]\r\n self.assigned_dest_field = kwargs[\"assigned_dest_field\"]\r\n self.od_pair_table = kwargs[\"od_pair_table\"]\r\n self.origin_transfer_fields = kwargs[\"origin_transfer_fields\"]\r\n self.destination_transfer_fields = kwargs[\"destination_transfer_fields\"]\r\n self.barriers = []\r\n if \"barriers\" in kwargs:\r\n self.barriers = kwargs[\"barriers\"]\r\n\r\n # Create a job ID and a folder for this job\r\n self._create_job_folder()\r\n\r\n # Setup the class logger. Logs for each parallel process are not written to the console but instead to a\r\n # process-specific log file.\r\n self.setup_logger(\"RoutePairs\")\r\n\r\n # Get field objects for the origin and destination ID fields since we need this in multiple places\r\n self.origin_id_field_obj = arcpy.ListFields(self.origins, wild_card=self.origin_id_field)[0]\r\n self.dest_id_field_obj = arcpy.ListFields(self.destinations, wild_card=self.dest_id_field)[0]\r\n\r\n # Set up other instance attributes\r\n self.is_service = helpers.is_nds_service(self.network_data_source)\r\n self.rt_solver = None\r\n self.solve_result = None\r\n self.input_origins_layer = \"InputOrigins\" + self.job_id\r\n self.input_destinations_layer = \"InputDestinations\" + self.job_id\r\n self.input_origins_layer_obj = None\r\n self.input_dests_layer_obj = None\r\n self.origin_unique_id_field_name = \"OriginUniqueID\"\r\n self.dest_unique_id_field_name = \"DestinationUniqueID\"\r\n self.od_pairs = None\r\n\r\n # Create a network dataset layer if needed\r\n if not self.is_service:\r\n self._make_nds_layer()\r\n\r\n # Prepare a dictionary to store info about the analysis results\r\n self.job_result = {\r\n \"jobId\": self.job_id,\r\n \"jobFolder\": self.job_folder,\r\n \"solveSucceeded\": False,\r\n \"solveMessages\": \"\",\r\n \"outputRoutes\": \"\",\r\n \"logFile\": self.log_file\r\n }","def testoptdone(self):\r\n\r\n assert self.data.optdone\r\n\r\n targets = self.data.geotargets\r\n values = numpy.abs(self.data.geovalues[-1])\r\n\r\n # Since the other criteria are not used and are not printed in this case, they should\r\n # be parsed as numpy.inf, for which we can check.\r\n assert numpy.isinf(targets[2])\r\n assert numpy.isinf(targets[4])\r\n\r\n conv = values[1] < targets[1] and (values[0] < targets[0] or values[3] < targets[3])\r\n assert conv","def print_solution(data, manager, routing, assignment):\n total_distance = 0\n total_load = 0\n for vehicle_id in range(data['num_vehicles']):\n index = routing.Start(vehicle_id)\n plan_output = 'Route for vehicle {}:\\n'.format(vehicle_id)\n route_distance = 0\n route_load = 0\n while not routing.IsEnd(index):\n node_index = manager.IndexToNode(index)\n route_load += data['demands'][node_index]\n plan_output += ' {0} Load({1}) -> '.format(node_index, route_load)\n previous_index = index\n index = assignment.Value(routing.NextVar(index))\n route_distance += routing.GetArcCostForVehicle(\n previous_index, index, vehicle_id)\n plan_output += ' {0} Load({1})\\n'.format(manager.IndexToNode(index),\n route_load)\n plan_output += 'Distance of the route: {}m\\n'.format(route_distance)\n plan_output += 'Load of the route: {}\\n'.format(route_load)\n # print(plan_output)\n total_distance += route_distance\n total_load += route_load\n with open(f\"Survey/vrp-nanostores/vrp-nanostores/food_deserts/outputs/2-e/clust8/route/route_vehicle{vehicle_id}.txt\", \"w\") as file:\n file.write(plan_output)\n file.close()\n print(\"aaa\")\n print('Total cost for all routes: {}m'.format(total_distance))\n print('Total load of all routes: {}'.format(total_load))\n with open(f\"Survey/vrp-nanostores/vrp-nanostores/food_deserts/outputs/2-e/clust8/load_dist_{data['num_vehicles']}vehicles.txt\", \"w\") as file:\n out_file = \"\"\n out_file += str(total_load) + \",\" + str(total_distance)\n file.write(out_file)\n file.close() # OPEN AND ANALYZE LATER WITH PANDAS","def validate(self):\n variables = ['waterThickness', 'waterPressure']\n compare_variables(test_case=self, variables=variables,\n filename1='full_run/output.nc',\n filename2='restart_run/output.nc')","def validate_model_args(self, cgi_map, network):\n model_kwargs = InfoPropModel.validate_model_args(self, cgi_map, network)\n\n dfcrit = model_kwargs.pop('dfcrit')\n if dfcrit == 'df':\n model_kwargs['ap'] = None\n elif dfcrit == 'ap':\n model_kwargs['df'] = None\n\n if ('sink_nodes' not in model_kwargs) or \\\n (len(model_kwargs['sink_nodes']) == 0):\n raise exc.InsufficientSinks()\n if (len(model_kwargs['sink_nodes']) > self.max_sinks):\n raise exc.TooManyBoundaries('sinks', self.max_sinks)\n\n return model_kwargs","def traffic_concentration(rFile, sheets, x, y, pollutant):\r\n p = Point(x, y)\r\n road, dis = nearest_road(p, rFile)\r\n \r\n # step 1. check whether this location is within the calculation range. If so, go on. Otherwise exit.\r\n if dis > 60: # I think we dont have to consider points that are too far from the streets.\r\n return 'e1' # error 1\r\n \r\n if dis < 3.5:\r\n dis = 3.5 # In the NSL calculation tool, calculation distance smaller than 3.5 meters are limited to 3.5 meters.\r\n \r\n # step 2. determine all the parameters required.\r\n \r\n #calibration factor\r\n Fk = 0.62\r\n \r\n # Emission number. for SO2, NO2, NOx, PM10, PM2.5, lead, and CO\r\n N = int(road['properties']['intensity']) #the traffic intensity, being the number of vehicles per day\r\n Fs = float(road['properties']['f_cong']) #fraction of stagnant traffic, a number between 0 and 1\r\n Fm = float(road['properties']['f_medium']) #fraction of medium-weight motor vehicles\r\n Fz = float(road['properties']['f_heavy']) #fraction of heavy motor vehicles\r\n Fb = float(road['properties']['f_bus']) #fraction of buses\r\n st = str(road['properties']['speed_type']) #intotal 5 types: a:100, b:44, c:19, d:13, e:26 (km/h)\r\n El = emission_factor(sheets, 'p', st, pollutant) #emission factor of light motor vehicles\r\n Em = emission_factor(sheets, 'm', st, pollutant) #emission factor of medium-weight motor vehicles\r\n Ez = emission_factor(sheets, 'v', st, pollutant) #emission factor of heavy motor vehicles\r\n Eb = emission_factor(sheets, 'b', st, pollutant) #emission factor of buses\r\n Eld = emission_factor(sheets, 'p', 'd', pollutant) #emission factor of light motor vehicles (speedType: d)\r\n Emd = emission_factor(sheets, 'm', 'd', pollutant) #emission factor of medium-weight motor vehicles (speedType: d)\r\n Ezd = emission_factor(sheets, 'v', 'd', pollutant) #emission factor of heavy motor vehicles (speedType: d)\r\n Ebd = emission_factor(sheets, 'b', 'd', pollutant) #emission factor of buses (speedType: d)\r\n \r\n E_regular = N * (1 - Fs) * ((1 - Fm - Fz - Fb) * El + Fm * Em + Fz * Ez + Fb * Eb) * 1000 / 24 / 3600\r\n E_cong = N * Fs * ((1 - Fm - Fz - Fb) * Eld + Fm * Emd + Fz * Ezd + Fb * Ebd) * 1000 / 24 / 3600\r\n E = E_regular + E_cong\r\n# print(\"{}: {}, {}\".format(pollutant, E_regular, E_cong))\r\n #dilution factor\r\n roadType = str(road['properties']['class'])\r\n if roadType == '1': # Broad street canyon\r\n a = 0.000325\r\n b = -0.0205\r\n c = 0.39\r\n alpha = 0.856\r\n elif roadType == '2': # Small street canyon\r\n a = 0.000488\r\n b = -0.0308\r\n c = 0.59\r\n alpha = None\r\n elif roadType == '3': # One-sided buildings\r\n a = 0.0005\r\n b = -0.0316\r\n c = 0.57\r\n alpha = None\r\n elif roadType == '4': # General urban\r\n a = 0.000310\r\n b = -0.0182\r\n c = 0.33\r\n alpha = 0.799\r\n \r\n if dis > 30 and (roadType == 1 or roadType == 4):\r\n theta = alpha * pow(dis, -0.747)\r\n else:\r\n theta = a * dis**2 + b * dis + c\r\n \r\n #tree factor\r\n Fb = road['properties']['t_factor']\r\n \r\n #wind speed\r\n ws = wind_speed(sheets, x, y) # average speed from CAR VL3.0\r\n \r\n #regional factor related to meteorology\r\n Fregio = 5 / ws\r\n \r\n # step 3. calculate the traffic concentration based on the parameters above.\r\n C_traffic = Fk * E * theta * Fb * Fregio\r\n \r\n # If it is NO2, then NOx has to be considered due to its chemical reaction with O3.\r\n if pollutant == 'NO2':\r\n B = 0.6 # fixed number?\r\n K = 100 # parameter for the conversion from NO to NO2\r\n C_background_O3 = background_concentration(sheets, x, y, 'O3')\r\n C_traffic_NOx = traffic_concentration(rFile, sheets, x, y, 'NOx')\r\n C_traffic = C_traffic + B * C_background_O3 * (C_traffic_NOx - C_traffic) / (C_traffic_NOx - C_traffic + K)\r\n \r\n return C_traffic","def __check_inputs__(self):\n # | - __check_inputs__\n # #####################################################################\n stop_mode = self.stop_mode\n stop_num_generations = self.stop_num_generations\n # #####################################################################\n\n if stop_mode == \"num_generations\":\n mess_i = \"stop_mode='num_generations', \\\n Must pass int to 'stop_num_generations'\"\n assert type(stop_num_generations) == type(1), mess_i\n #__|","def check_parameters(self):\n\n if self.process not in [\"Like\", \"Like-and-follow\"]:\n raiser('process')\n\n if \"type\" not in self.duration or \"value\" not in self.duration:\n raiser('duration(type or value)')\n else:\n typ = self.duration['type']\n val = self.duration['value']\n if self.process == \"Like\":\n if typ not in ['by_time', 'by_likes']:\n raiser('type')\n\n if \"like\" not in self.limits_per_hour:\n raiser('limitsPerHour(like)')\n else:\n try:\n self.limits_per_hour['like'] = float(self.limits_per_hour['like'])\n except ValueError:\n raiser('like')\n elif self.process == \"Like-and-follow\":\n if typ not in ['by_time', 'by_users']:\n raiser('type')\n\n if \"like\" not in self.limits_per_hour or \"follow\" not in self.limits_per_hour \\\n or \"unfollow\" not in self.limits_per_hour:\n raiser('limitsPerHour(like or follow or unfollow)')\n else:\n for i in [\"like\", \"follow\", \"unfollow\"]:\n try:\n self.limits_per_hour[i] = float(self.limits_per_hour[i])\n except ValueError:\n raiser(i)\n try:\n self.duration['value'] = float(val)\n except ValueError:\n raiser('value')\n\n if not isinstance(self.search_hashtags, list):\n raiser('hashtags')\n\n if not isinstance(self.white_list, list):\n raiser('whiteList')","def main():\n\n print('Drones capacity = {}'.format(DRONES_CAPACITY))\n\n # Instantiate the data of the problem\n data = create_data_model(MAX_POINT_DEMAND, USE_CACHE)\n\n # Create the routing index manager\n manager = pywrapcp.RoutingIndexManager(len(data['distance_matrix']),\n data['num_vehicles'], data['depot'])\n\n # Create Routing Model\n routing = pywrapcp.RoutingModel(manager)\n\n # Defining weights of the edges\n def distance_callback(from_index, to_index):\n \"\"\"Returns the distance between the two nodes.\"\"\"\n # Convert from routing variable Index to distance matrix NodeIndex.\n from_node = manager.IndexToNode(from_index)\n to_node = manager.IndexToNode(to_index)\n return data['distance_matrix'][from_node][to_node]\n\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\n\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\n\n # Addding capacity constraints.\n def demand_callback(from_index):\n \"\"\"Returns the demand for tests of the node.\"\"\"\n from_node = manager.IndexToNode(from_index)\n return data['demands'][from_node]\n\n demand_callback_index = routing.RegisterUnaryTransitCallback(\n demand_callback)\n\n def counter_callback(from_index):\n \"\"\"Returns the number of stops done at the node.\"\"\"\n from_node = manager.IndexToNode(from_index)\n return data['counter'][from_node]\n\n counter_callback_index = routing.RegisterUnaryTransitCallback(\n counter_callback)\n\n # Limiting the number of tests each drone can carry\n routing.AddDimensionWithVehicleCapacity(\n demand_callback_index,\n 0, # null capacity slack\n data['vehicle_capacities'], # vehicle maximum capacities\n True, # start cumul to zero\n 'Capacity')\n\n # Limiting the overall number of nodes a drone can serve in one tour\n routing.AddDimensionWithVehicleCapacity(\n counter_callback_index,\n 0, # null capacity slack\n data['vehicle_max_number_of_stops'], # vehicle maximum capacities\n True, # start cumul to zero\n 'Counter')\n\n # Setting parameters of the solver\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\n search_parameters.first_solution_strategy = (\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\n search_parameters.local_search_metaheuristic = (\n routing_enums_pb2.LocalSearchMetaheuristic.GUIDED_LOCAL_SEARCH)\n search_parameters.time_limit.seconds = HEURISTIC_TIME_LIMIT\n search_parameters.log_search = True\n\n\n print('START SOLVING')\n assignment = routing.SolveWithParameters(search_parameters)\n\n if assignment:\n print_and_save_solution(data, manager, routing, assignment)","def _check_inputlengths(self):\n # Check x and y have more than 1 item, and x and y are equal length\n if not len(self.x) > 1:\n raise ValueError(\"Route input 'x' must contain more than 1 item\")\n\n if not (len(self.y) > 1):\n raise ValueError(\"Route input 'y' must contain more than 1 item\")\n\n if not (len(self.x) == len(self.y)):\n raise ValueError(\"Route inputs 'x' and 'y' must be of equal length\")\n\n # Performs checks on z if not empty\n if self.z is not None:\n for v in self.z.values():\n if not (len(v) == len(self.x)):\n raise ValueError(\"Route input 'z' must be of equal length to 'x' and 'y'\")","def test_field_value_exact(self):\n field = 'M30'\n ref_idx = [2]\n self.res=self.run_task(infile=self.rawfile,field=field,calmode=self.calmode,outfile=self.outname,outform='ASAP')\n self.assertEqual(self.res,None,\n msg='Any error occurred during calibration')\n self._compare_with_analytic(self.outname, self.line, self.baseline, ref_idx)","def checkParameters(self):\n self.DEBUG(\"EDPluginExecDatcmpv2_0.checkParameters\")\n self.checkMandatoryParameters(self.getDataInput(), \"Data Input is None\")\n self.checkMandatoryParameters(self.getDataInput().inputCurve, \"No input 1D curves file provided\")","def test_13(self, test):\r\n globalConfig.test = test\r\n\r\n outputList = getOutputList()\r\n inputList = getInputList()\r\n\r\n if len(inputList) == 0 and len(outputList) == 0:\r\n return test.UNCLEAR(\"Not tested. No resources found.\")\r\n\r\n constrainedOutputList = []\r\n for outputInstance in outputList:\r\n outputCaps = outputInstance.getCaps()\r\n try:\r\n routableInputs = outputCaps['routable_inputs']\r\n except KeyError:\r\n return test.FAIL(\"Could not find 'routable_inputs' in /caps \"\r\n \"for Output {}\".format(outputInstance.id))\r\n if routableInputs is not None:\r\n constrainedOutputList.append(\r\n {\r\n \"output\": outputInstance,\r\n \"routableInputs\": routableInputs\r\n }\r\n )\r\n\r\n if len(constrainedOutputList) == 0:\r\n return test.UNCLEAR(\"Could not test - no outputs have routing constraints set.\")\r\n\r\n inputIDList = [None]\r\n for inputInstance in inputList:\r\n inputIDList.append(inputInstance.id)\r\n\r\n for constrainedOutput in constrainedOutputList:\r\n forbiddenRoutes = copy.deepcopy(inputIDList)\r\n\r\n for routableInputID in constrainedOutput['routableInputs']:\r\n forbiddenRoutes.remove(routableInputID)\r\n\r\n if len(forbiddenRoutes) > 0:\r\n\r\n action = Action(forbiddenRoutes[0], constrainedOutput['output'].id)\r\n activation = Activation()\r\n activation.addAction(action)\r\n\r\n try:\r\n activation.checkReject()\r\n return test.PASS()\r\n except NMOSTestException:\r\n msg = (\"Was able to create a forbidden route between Input {} \"\r\n \"and Output {} despite routing constraint.\"\r\n .format(forbiddenRoutes[0], outputInstance.id))\r\n return test.FAIL(msg)\r\n return test.UNCLEAR(\"Could not test - no route is forbidden.\")","def optimize(self):\n self.vbe_step()\n self.compute_responsibilities()\n self.compute_sufficient_stats()\n self.vbmstep()","def route(self, is_check_lanes=True):\n print 'route'\n # TODO: if too mant vtypes, better go through id_modes\n exectime_start = time.clock()\n\n net = self.get_scenario().net\n edges = net.edges\n vtypes = self.parent.vtypes\n\n ids_edges = []\n ids_trip = []\n costs = []\n for id_vtype in self.get_vtypes():\n id_mode = vtypes.ids_mode[id_vtype]\n\n # no routing for pedestrians\n if id_mode != net.modes.get_id_mode('pedestrian'):\n weights = edges.get_times(id_mode=id_mode,\n speed_max=vtypes.speeds_max[id_vtype],\n is_check_lanes=is_check_lanes)\n\n ids_trip_vtype = self.get_trips_for_vtype(id_vtype)\n # print ' id_vtype,id_mode',id_vtype,id_mode#,ids_trip_vtype\n # print ' weights',weights\n ids_edge_depart = self.ids_edge_depart[ids_trip_vtype]\n ids_edge_arrival = self.ids_edge_arrival[ids_trip_vtype]\n\n for id_trip, id_edge_depart, id_edge_arrival in zip(ids_trip_vtype, ids_edge_depart, ids_edge_arrival):\n cost, route = routing.get_mincostroute_edge2edge(id_edge_depart,\n id_edge_arrival,\n edges=edges,\n weights=weights)\n if len(route) > 0:\n ids_edges.append(route)\n ids_trip.append(id_trip)\n costs.append(cost)\n\n ids_route = self.routes.get_value().add_rows(ids_trip=ids_trip,\n ids_edges=ids_edges,\n costs=costs,\n )\n self.add_routes(ids_trip, ids_route)\n print ' exectime', time.clock()-exectime_start\n return ids_trip, ids_route","def _check_params(self):\n pass","def getPriorityRequests(self, line):\n # self.optimizationResultsFile = open(self.fileName, 'r')\n # for i, line in enumerate(self.optimizationResultsFile):\n # if i in range(15, requiredLineNo):\n reqPhase, earliestArrival, latestArrival, delay, vehicleClass = line.split()\n if int(vehicleClass) == EV:\n self.requestedPhase_EV.append(int(reqPhase))\n self.ETA_EV.append(float(latestArrival) - 4.0)\n self.ETA_EV.append(float(latestArrival) - 4.0)\n self.ETA_Duration_EV.append(4.0)\n self.ETA_Duration_EV.append(4.0)\n self.vehicleType_EV.append(int(vehicleClass))\n self.delay_EV.append(float(delay))\n\n elif int(vehicleClass) == TRANSIT:\n self.requestedPhase_Transit.append(int(reqPhase))\n self.ETA_Transit.append(float(latestArrival) - 4.0)\n self.ETA_Transit.append(float(latestArrival) - 4.0)\n self.ETA_Duration_Transit.append(4.0)\n self.ETA_Duration_Transit.append(4.0)\n self.vehicleType_Transit.append(int(vehicleClass))\n if (float(delay) > 0):\n self.delay_Transit.append(\n float(delay) - (float(latestArrival) - float(earliestArrival) - 4.0))\n\n elif int(vehicleClass) == TRUCK:\n self.requestedPhase_Truck.append(int(reqPhase))\n self.ETA_Truck.append(float(latestArrival) - 4.0)\n self.ETA_Truck.append(float(latestArrival) - 4.0)\n self.ETA_Duration_Truck.append(4.0)\n self.ETA_Duration_Truck.append(4.0)\n self.vehicleType_Truck.append(int(vehicleClass))\n if (float(delay) > 0):\n self.delay_Truck.append(\n float(delay) - (float(latestArrival) - float(earliestArrival) - 4.0))\n\n elif int(vehicleClass) == DILEMMAZONE:\n self.requestedPhase_DilemmaZone.append(int(reqPhase))\n self.ETA_DilemmaZone.append(float(latestArrival) - 4.0)\n self.ETA_DilemmaZone.append(float(latestArrival) - 4.0)\n self.ETA_Duration_DilemmaZone.append(4.0)\n self.ETA_Duration_DilemmaZone.append(4.0)\n self.vehicleType_DilemmaZone.append(int(vehicleClass))\n self.delay_DilemmaZone.append(float(delay))\n\n elif int(vehicleClass) == COORDINATION:\n self.requestedPhase_Coordination.append(int(reqPhase))\n self.ETA_Coordination.append(float(earliestArrival))\n self.ETA_Coordination.append(float(earliestArrival))\n self.ETA_Duration_Coordination.append(\n float(latestArrival) - float(earliestArrival))\n self.ETA_Duration_Coordination.append(\n float(latestArrival) - float(earliestArrival))\n self.vehicleType_Coordination.append(int(vehicleClass))\n self.delay_Coordination.append(float(delay))\n\n # self.optimizationResultsFile.close()","def ValidateInputs(lat_min, lat_max, lon_min, lon_max, lonres, latres, basepath, \\\n GFED_path, EDGAR_path, CAMS_path, behaviour_settings):\n # Assert sure extents fall within boundary\n assert -180 <= lon_min < 180 and -180 < lon_max <= 180, 'Longitude should be within range -180 -- 180!'\n assert -90 <= lat_min < 90 and -90 < lat_max <= 90, 'latitude should be within range -90 -- 90!'\n assert lon_min < lon_max, 'maximum longitude cannot be smaller than or equal to minimum!'\n assert lat_min < lat_max, 'maximum latitude cannot be smaller than or equal to minimum!'\n \n # Assert resolution is larger than TROPOMI minimum:\n assert lonres > 7, 'TROPOMI minimum longitude resolution is 7 km!'\n assert latres > 7, 'TROPOMI minimum latitude resolution is 7 km!'\n \n # Assert if given directories exist\n if behaviour_settings[1] == True:\n assert os.path.isdir(CAMS_path), f'Directory {CAMS_path} was not found!'\n if behaviour_settings[2] == True:\n assert os.path.isdir(GFED_path), f'Directory {GFED_path} was not found!'\n assert os.path.isdir(EDGAR_path), f'Directory {EDGAR_path} was not found!'\n\n \n return","def Validate(self):\n \n hklmin = self.hklmin_txtCtrl.GetValue()\n hklmax = self.hklmax_txtCtrl.GetValue()\n hklsteps = self.hkl_steps_ctrl.GetValue()\n \n wmin = self.wmin_txtCtrl.GetValue()\n wmax = self.wmax_txtCtrl.GetValue()\n wsteps = self.w_steps_ctrl.GetValue()\n \n kx = self.kx_txtCtrl.GetValue()\n ky = self.ky_txtCtrl.GetValue()\n kz = self.kz_txtCtrl.GetValue()\n \n zmin = self.zmin_ctrl.GetValue()\n zmax = self.zmax_ctrl.GetValue()\n colorbar_bool = self.color_bar_box.GetValue()\n \n temp = self.temp_ctrl.GetValue()\n sphavg_bool = self.spherical_avg_box.GetValue()\n \n bgColor = \"pink\"\n failed = False\n \n #Validate hkl values\n num_hklmin = None\n num_hklmax = None\n try:\n num_hklmin = float(hklmin)*np.pi\n self.hklmin_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.hklmin_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n try:\n num_hklmax = float(hklmax)*np.pi\n self.hklmax_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.hklmax_txtCtrl.SetBackgroundColour(bgColor)\n failed = True \n \n #Validate w values\n num_wmin = None\n num_wmax = None\n try:\n num_wmin = float(wmin)\n self.wmin_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.wmin_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n try:\n num_wmax = float(wmax)\n self.wmax_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.wmax_txtCtrl.SetBackgroundColour(bgColor)\n failed = True \n \n #Validate kx,ky,kz,temp,zmin,zmax values\n num_kx = None\n num_ky = None\n num_kz = None\n num_temp = None\n num_zmin = None\n num_zmax = None\n try:\n num_kx = float(kx)\n self.kx_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.kx_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n try:\n num_ky = float(ky)\n self.ky_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.ky_txtCtrl.SetBackgroundColour(bgColor)\n failed = True \n try:\n num_kz = float(kz)\n self.kz_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.kz_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n try:\n num_temp = float(temp)\n self.temp_ctrl.SetBackgroundColour(\"white\")\n except:\n self.temp_ctrl.SetBackgroundColour(bgColor)\n failed = True\n try:\n num_zmin = float(zmin)\n self.zmin_ctrl.SetBackgroundColour(\"white\")\n except:\n self.zmin_ctrl.SetBackgroundColour(bgColor)\n failed = True\n try:\n num_zmax = float(zmax)\n self.zmax_ctrl.SetBackgroundColour(\"white\")\n except:\n self.zmax_ctrl.SetBackgroundColour(bgColor)\n failed = True\n \n #Validate File Fields\n int_str = self.int_file_txtCtrl.GetValue()\n spin_str = self.spin_file_txtCtrl.GetValue()\n tau_str = self.tau_file_txtCtrl.GetValue()\n out_str = self.output_file_txtCtrl.GetValue()\n if int_str:\n self.int_file_txtCtrl.SetBackgroundColour(\"white\")\n else: \n self.int_file_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n if spin_str:\n self.spin_file_txtCtrl.SetBackgroundColour(\"white\")\n else: \n self.spin_file_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n if tau_str:\n self.tau_file_txtCtrl.SetBackgroundColour(\"white\")\n else: \n self.tau_file_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n if out_str:\n self.output_file_txtCtrl.SetBackgroundColour(\"white\")\n else: \n self.output_file_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n \n direction = {}\n direction['kx'] = num_kx\n direction['ky'] = num_ky\n direction['kz'] = num_kz\n hkl_interval = [num_hklmin, num_hklmax, int(self.hkl_steps_ctrl.GetValue())]\n w_interval = [num_wmin, num_wmax, int(self.w_steps_ctrl.GetValue())]\n \n tau_text = ''\n try:\n tau_file = open(tau_str,'r')\n tau_text = tau_file.read()\n self.tau_file_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.tau_file_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n\n items = tau_text.split()\n if len(items)%3 and not len(items):\n failed = True\n\n tau_list = []\n i = 0\n while not failed and i < len(items)-3:\n tau1, tau2, tau3 = None, None, None\n try:\n tau1 = float(items[i])\n tau2 = float(items[i+1])\n tau3 = float(items[i+2])\n self.tau_file_txtCtrl.SetBackgroundColour(\"white\")\n except:\n self.tau_file_txtCtrl.SetBackgroundColour(bgColor)\n failed = True\n tau_list.append([tau1,tau2,tau3])\n i+=3\n \n self.Refresh()\n# self.window.Show(True,True)\n \n plotstats = [zmin, zmax, colorbar_bool]\n \n return failed, hkl_interval, w_interval, tau_list, direction, num_temp, sphavg_bool, plotstats","def solve_model(self,max_wait_time = 0,max_per_veh = 99999, save_output=True):\n self.manager = pywrapcp.RoutingIndexManager(len(self.data['time_matrix']),\n self.data['num_vehicles'], self.data['depot'])\n routing = pywrapcp.RoutingModel(self.manager)\n\n transit_callback_index = routing.RegisterTransitCallback(self.time_callback)\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\n time = 'Time'\n routing.AddDimension(\n transit_callback_index,\n max_wait_time, # allow waiting time\n max_per_veh, # maximum time per vehicle\n False, # Don't force start cumul to zero.\n time)\n time_dimension = routing.GetDimensionOrDie(time)\n # Add time window constraints for each location except depot.\n for location_idx, time_window in enumerate(self.data['time_windows']):\n if location_idx == 0:\n continue\n index = self.manager.NodeToIndex(location_idx)\n time_dimension.CumulVar(index).SetRange(time_window[0], time_window[1]-self.VisitTime)\n # Add time window constraints for each vehicle start node.\n for vehicle_id in range(self.data['num_vehicles']):\n index = routing.Start(vehicle_id)\n time_dimension.CumulVar(index).SetRange(self.data['time_windows'][self.data['depot']][0],\n self.data['time_windows'][self.data['depot']][1])\n for i in range(self.data['num_vehicles']):\n routing.AddVariableMinimizedByFinalizer(\n time_dimension.CumulVar(routing.Start(i)))\n routing.AddVariableMinimizedByFinalizer(\n time_dimension.CumulVar(routing.End(i)))\n '''Routing Settings:https://developers.google.com/optimization/routing/routing_options\n '''\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\n search_parameters.first_solution_strategy = (\n routing_enums_pb2.FirstSolutionStrategy.PATH_MOST_CONSTRAINED_ARC)\n search_parameters.time_limit.seconds = 3600\n #search_parameters.log_search = True\n search_parameters.local_search_metaheuristic = (\n routing_enums_pb2.LocalSearchMetaheuristic.AUTOMATIC)\n sol_status={0:'ROUTING_NOT_SOLVED: Problem not solved yet.',\n 1:'ROUTING_SUCCESS: Problem solved successfully.',\n 2:'ROUTING_FAIL: No solution found to the problem.',\n 3:'ROUTING_FAIL_TIMEOUT: Time limit reached before finding a solution.',\n 4:'ROUTING_INVALID: Model, model parameters, or flags are not valid.'}\n print('Start Solving the problem....')\n _start_ = systime.time()\n assignment = routing.SolveWithParameters(search_parameters)\n print(\"Solver status: \", sol_status[routing.status()])\n soltime = systime.time()-_start_\n print('Solving takes: '+ str(round(soltime,2))+' Secs')\n if assignment:\n self.print_save_solution(routing, assignment,save_res=save_output)\n else:\n print('Solving Failed')","def parse_route(self):\n self.error = 0\n for item in self.arg_list:\n if len(item) == 2:\n self.make_log_write(self.fixed_width_parse(item), item)\n elif len(item) == 3:\n self.make_log_write(self.delimited_parse(item), item)\n else:\n raise Exception('Invalid Parameters: %s please correct' % item)","def test_route(self):\n\n params = get_params()\n estimator = LinearEstimator()\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\n model_builder = OptimizationModelBuilder(\n constraints=[CapacityConstraint()]\n )\n router = Router(\n problem_builder=problem_builder,\n optimization_model_builder=model_builder\n )\n riders = parse_models(model_dicts=test_riders, cls=Rider)\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\n depots = parse_models(model_dicts=test_depots, cls=Depot)\n routes = router.route(riders, vehicles, depots)\n self.assertTrue(routes, msg='Routes could not be built.')\n\n for route in routes:\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\n self.assertTrue(\n len(route['stops']) > 1,\n msg='Route with single stop.'\n )","def onCalculateParameters(self, evt):\n \n if not self.config.iActivationMode == \"User-defined\":\n if self.onCheckParameters(evt=None) == False: \n print('Please fill in all necessary fields first!')\n return\n divisibleCheck = abs(self.config.iEndVoltage-self.config.iStartVoltage)/self.config.iStepVoltage\n divisibleCheck2 = divisibleCheck%1\n if divisibleCheck2 != 0:\n msg = \"Are you sure your collision voltage range is divisible by your increment?\"\n dialogs.dlgBox(exceptionTitle='Mistake in the input', \n exceptionMsg= msg,\n type=\"Error\")\n return\n else:\n if self.config.iScanTime == None or self.config.iScanTime == \"\": \n msg = 'Please make sure you to fill in the scan time input box.'\n dialogs.dlgBox(exceptionTitle='Mistake in the input', \n exceptionMsg= msg,\n type=\"Error\")\n return\n \n if self.config.iActivationMode == \"Linear\":\n self.wrensInput, ColEnergyX, scanPerVoltageList, timeList, totalAcqTime = self.onPrepareLinearMethod()\n elif self.config.iActivationMode == \"Exponential\":\n self.wrensInput, ColEnergyX, scanPerVoltageList, timeList, totalAcqTime = self.onPrepareExponentialMethod()\n elif self.config.iActivationMode == \"Boltzmann\":\n self.wrensInput, ColEnergyX, scanPerVoltageList, timeList, totalAcqTime = self.onPrepareBoltzmannMethod()\n elif self.config.iActivationMode == \"User-defined\":\n self.wrensInput, ColEnergyX, scanPerVoltageList, timeList, totalAcqTime = self.onPrepareListMethod() \n \n self.wrensCMD = self.wrensInput.get('command', None)\n # Setup status:\n self.view.SetStatusText(''.join(['Acq. time: ',str(totalAcqTime),' mins']), number=0)\n self.view.SetStatusText(''.join([str(len(scanPerVoltageList)), ' steps']), number=1)\n \n # Add wrensCMD to config file\n self.config.wrensCMD = self.wrensCMD\n \n self.onPlotSPV(ColEnergyX, scanPerVoltageList)\n self.onPlotTime(ColEnergyX, timeList)\n print(''.join([\"Your submission code: \", self.wrensCMD]))","def test_validate_good_order(self):\n for proj in testorders.good_test_projections:\n valid_order = copy.deepcopy(self.base_order)\n valid_order['projection'] = {proj: testorders.good_test_projections[proj]}\n\n try:\n good = api.validation(valid_order, self.staffuser.username)\n except ValidationException as e:\n self.fail('Raised ValidationException: {}'.format(e.message))","def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches\r\n # Select the inputs to process\r\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\r\n self._select_inputs_one_to_one(chunk_definition)\r\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\r\n self._get_od_pairs_for_chunk(chunk_definition)\r\n self._select_inputs_many_to_many()\r\n else:\r\n raise NotImplementedError(f\"Invalid PreassignedODPairType: {self.pair_type}\")\r\n\r\n # Initialize the Route solver object\r\n self.initialize_rt_solver()\r\n self._add_unique_id_fields()\r\n\r\n # Insert the origins and destinations\r\n self.logger.debug(f\"Route solver fields transferred from Origins: {self.origin_transfer_fields}\")\r\n self.logger.debug(f\"Route solver fields transferred from Destinations: {self.destination_transfer_fields}\")\r\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\r\n self._insert_stops_one_to_one()\r\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\r\n self._insert_stops_many_to_many()\r\n else:\r\n raise NotImplementedError(f\"Invalid PreassignedODPairType: {self.pair_type}\")\r\n\r\n if self.rt_solver.count(arcpy.nax.RouteInputDataType.Stops) == 0:\r\n # There were no valid destinations for this set of origins\r\n self.logger.debug(\"No valid destinations for this set of origins. Skipping Route calculation.\")\r\n return\r\n\r\n # Load barriers\r\n # Note: This loads ALL barrier features for every analysis, even if they are very far away from any of\r\n # the inputs in the current chunk. You may want to select only barriers within a reasonable distance of the\r\n # inputs, particularly if you run into the maximumFeaturesAffectedByLineBarriers,\r\n # maximumFeaturesAffectedByPointBarriers, and maximumFeaturesAffectedByPolygonBarriers tool limits for portal\r\n # solves. However, since barriers is likely an unusual case, deal with this only if it becomes a problem.\r\n for barrier_fc in self.barriers:\r\n self.logger.debug(f\"Loading barriers feature class {barrier_fc}...\")\r\n shape_type = arcpy.Describe(barrier_fc).shapeType\r\n if shape_type == \"Polygon\":\r\n class_type = arcpy.nax.RouteInputDataType.PolygonBarriers\r\n elif shape_type == \"Polyline\":\r\n class_type = arcpy.nax.RouteInputDataType.LineBarriers\r\n elif shape_type == \"Point\":\r\n class_type = arcpy.nax.RouteInputDataType.PointBarriers\r\n else:\r\n self.logger.warning(\r\n f\"Barrier feature class {barrier_fc} has an invalid shape type and will be ignored.\"\r\n )\r\n continue\r\n barriers_field_mappings = self.rt_solver.fieldMappings(class_type, True)\r\n self.rt_solver.load(class_type, barrier_fc, barriers_field_mappings, True)\r\n\r\n # Solve the Route analysis\r\n self.logger.debug(\"Solving Route...\")\r\n solve_start = time.time()\r\n self.solve_result = self.rt_solver.solve()\r\n solve_end = time.time()\r\n self.logger.debug(f\"Solving Route completed in {round(solve_end - solve_start, 3)} seconds.\")\r\n\r\n # Handle solve messages\r\n solve_msgs = [msg[-1] for msg in self.solve_result.solverMessages(arcpy.nax.MessageSeverity.All)]\r\n for msg in solve_msgs:\r\n self.logger.debug(msg)\r\n\r\n # Update the result dictionary\r\n self.job_result[\"solveMessages\"] = solve_msgs\r\n if not self.solve_result.solveSucceeded:\r\n self.logger.debug(\"Solve failed.\")\r\n return\r\n self.logger.debug(\"Solve succeeded.\")\r\n self.job_result[\"solveSucceeded\"] = True\r\n\r\n # Save output\r\n self._export_to_feature_class(chunk_definition)\r\n\r\n self.logger.debug(\"Finished calculating Route.\")","def validate_parameters(self):\n\n flag = True\n warnings = \"\"\n # Check radius\n r = self.parameters.get('rw', 0)\n if type(r) not in [int, float]:\n flag = False\n warnings += \"Well radius rw must be a float value\\n\"\n else:\n if r <= 0:\n flag = False\n warnings += \"Well radius rw must be higher than 0\\n\"\n # Check if is full penetrating\n op = self.parameters.get('full', False)\n\n if not op:\n # Check observation well length\n if 'd' in self.parameters and 'l' in self.parameters:\n d = self.parameters.get('d', -1)\n l = self.parameters.get('l', -1)\n if type(l) not in [int, float]:\n flag = False\n warnings += \"Depth of well bottom must be a float value\\n\"\n else:\n if l < 0:\n flag = False\n warnings += \"Depth l must be higher than 0\\n\"\n if type(d) not in [int, float]:\n flag = False\n warnings += \"Depth of well screen must be a float value\\n\"\n else:\n if d < 0 or d > l:\n flag = False\n warnings += \"Depth d must be in range 0 <= d <= l\\n\"\n return(flag, warnings) # End Function","def validate_settings(_cfg, _ctx):\n pass","def state_processing_validate(cfg, app, win, events):","def skip_field_info_validation(config):\n\n reformatters = ['PCPCombine', 'RegridDataPlane']\n process_list = [item[0] for item in get_process_list(config)]\n\n # if running MTD in single mode, you don't need matching FCST/OBS\n if 'MTD' in process_list and config.getbool('config', 'MTD_SINGLE_RUN'):\n return True\n\n # if running any app other than the reformatters, you need matching FCST/OBS, so don't skip\n if [item for item in process_list if item not in reformatters]:\n return False\n\n return True"],"string":"[\n \"def f_check_adr_parameters_correctness(dict):\\n\\n if int(dict[\\\"operation_mode_num\\\"]) not in (0, 1, 2, 3, 4, 5, 6):\\n print('\\\\n Error!!! Operation mode is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"FFT_size_samples\\\"]) not in (2048, 4096, 8192, 16384, 32768):\\n print('\\\\n Error!!! FFT size is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"spectra_averaging\\\"]) < 16 or int(dict[\\\"spectra_averaging\\\"]) > 32768:\\n print('\\\\n Error!!! Spectra averaging number is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"start_line_freq\\\"]) not in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16): # 0 … (SFFT-1024)/1024\\n print('\\\\n Error!!! Start frequency line is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"width_line_freq\\\"]) not in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16):\\n print('\\\\n Error!!! Frequency width line is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"width_line_freq\\\"]) > ((int(dict[\\\"FFT_size_samples\\\"]) - int(dict[\\\"start_line_freq\\\"]) * 1024) / 1024): # 1 … (SFFT-SLINE*1024)/1024\\n print('\\\\n Error!!! Frequency width is bigger than FFT size allows!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"clock_source\\\"]) not in (0, 1):\\n print('\\\\n Error!!! Clock source is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"sum_diff_mode_num\\\"]) not in (0, 1):\\n print('\\\\n Error!!! Sum-diff mode is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"data_file_size\\\"]) < -1 or int(dict[\\\"data_file_size\\\"]) > 4096:\\n print('\\\\n Error!!! File size value is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n '''\\n if (int(dict[\\\"chan_diff_delay\\\"]) < 0 or int(parameters_dict[\\\"chan_diff_dalay\\\"]) > 1024):\\n print('\\\\n Error!!! Channel difference delay is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n '''\\n\\n # print('\\\\n ADR parameters from file are correct!\\\\n')\\n\\n return dict\",\n \"def check_violation(route, vehicle_type):\\r\\n if len(route) == 2: # [0, 0] route\\r\\n return True, 0, 0, 0\\r\\n else:\\r\\n accu_res = [0, 0, 0] # 0-leaving time, 1-accumulated distance, 2-volume\\r\\n if vehicle_type == 2:\\r\\n veh_cap = small_veh\\r\\n elif vehicle_type == 3:\\r\\n veh_cap = medium_veh\\r\\n elif vehicle_type == 5:\\r\\n veh_cap = large_veh\\r\\n else:\\r\\n veh_cap = large_veh\\r\\n print('Input wrong vehicle type!', vehicle_type)\\r\\n # small_veh = [1, 12, 10, 400000, 0.012, 200]\\r\\n fixed_cost = veh_cap[5]\\r\\n trans_cost = 0\\r\\n # wait_cost = 0\\r\\n if time_mat[0, route[1]] < num_timez[route[1]][0]:\\r\\n accu_res[0] = num_timez[route[1]][0] - time_mat[0, route[1]] # vehicle leaving depot time\\r\\n depart_time = accu_res[0] # departing from depot time\\r\\n else:\\r\\n depart_time = 0\\r\\n for i in range(len(route) - 1):\\r\\n last_cust = route[i]\\r\\n curr_cust = route[i+1]\\r\\n # checking leaving time\\r\\n arr_time = accu_res[0] + time_mat[last_cust, curr_cust]\\r\\n if arr_time < num_timez[curr_cust][0]:\\r\\n accu_res[0] = num_timez[curr_cust][0] + oprt_t\\r\\n wait_time = num_timez[curr_cust][0] - arr_time\\r\\n # wait_cost += (wait_time / 60. * wait_cost0)\\r\\n elif arr_time <= num_timez[curr_cust][1]:\\r\\n accu_res[0] = arr_time + oprt_t\\r\\n else:\\r\\n # print('Infeasible route!(Service Time Error.)')\\r\\n return False, 1000000, 0, 0\\r\\n\\r\\n # checking vehicle max distance\\r\\n trans_cost += (dist_mat[last_cust, curr_cust] * veh_cap[4])\\r\\n\\r\\n accu_res[1] += dist_mat[last_cust, curr_cust]\\r\\n\\r\\n if accu_res[0] - oprt_t - depart_time > veh_cap[3]:\\r\\n # print('Infeasible route!(Max Time Error.)')\\r\\n return False, 1000000, 0, 0\\r\\n\\r\\n # checking vehicle max volume\\r\\n accu_res[2] += (num_demd[curr_cust][0] * bskt_vol + num_demd[curr_cust][1] * trsf_vol + (num_demd[curr_cust][2]\\r\\n + num_demd[curr_cust][3]) * milk_vol + num_demd[curr_cust][4] * paper_bskt)\\r\\n\\r\\n if accu_res[2] > veh_cap[2]:\\r\\n # print('Infeasible route!(Max Weight/Volume Error.)', accu_res[2])\\r\\n return False, 1000000, 0, 0\\r\\n route_cost = fixed_cost + accu_res[1] * veh_cap[4]\\r\\n route_dist = accu_res[1]\\r\\n route_time = accu_res[0] - oprt_t - depart_time\\r\\n # print fixed_cost, trvl_cost, trvl_dist\\r\\n return True, route_cost, route_time, depart_time + 600\",\n \"def validate_params(self) -> None:\\n # cap must be given when using logistic growth\\n if (self.growth == \\\"logistic\\\") and (self.cap is False):\\n msg = \\\"Capacity must be provided for logistic growth\\\"\\n logging.error(msg)\\n raise ValueError(msg)\\n\\n # If custom_seasonalities passed, ensure they contain the required keys.\\n reqd_seasonality_keys = [\\\"name\\\", \\\"period\\\", \\\"fourier_order\\\"]\\n if not all(\\n req_key in seasonality\\n for req_key in reqd_seasonality_keys\\n for seasonality in self.custom_seasonalities\\n ):\\n msg = f\\\"Custom seasonality dicts must contain the following keys:\\\\n{reqd_seasonality_keys}\\\"\\n logging.error(msg)\\n raise ValueError(msg)\\n\\n # If extra_regressors passed, ensure they contain the required keys.\\n all_regressor_keys = {\\\"name\\\", \\\"prior_scale\\\", \\\"mode\\\"}\\n for regressor in self.extra_regressors:\\n if not isinstance(regressor, dict):\\n msg = f\\\"Elements in `extra_regressor` should be a dictionary but receives {type(regressor)}.\\\"\\n _error_msg(msg)\\n if \\\"name\\\" not in regressor:\\n msg = \\\"Extra regressor dicts must contain the following keys: 'name'.\\\"\\n _error_msg(msg)\\n if not set(regressor.keys()).issubset(all_regressor_keys):\\n msg = f\\\"Elements in `extra_regressor` should only contain keys in {all_regressor_keys} but receives {regressor.keys()}.\\\"\\n _error_msg(msg)\\n self._reqd_regressor_names = [\\n regressor[\\\"name\\\"] for regressor in self.extra_regressors\\n ]\\n # check floor and cap\\n if (self.cap is not False) and (\\\"cap\\\" not in self._reqd_cap_floor_names):\\n self._reqd_cap_floor_names.append(\\\"cap\\\")\\n if self.floor is not False and (\\\"floor\\\" not in self._reqd_cap_floor_names):\\n self._reqd_cap_floor_names.append(\\\"floor\\\")\",\n \"def routeOptions(ORBITS, SET_OF_VEHICLES, CURRENT_WEATHER):\\n OPTION = []\\n for eachOrbit in ORBITS:\\n if eachOrbit.traffic_speed == 0:\\n print('Route {} Blocked'.format(eachOrbit.route_name))\\n OPTION = None\\n break\\n else:\\n for eachVehicle in SET_OF_VEHICLES:\\n if eachVehicle.weather_suitability(CURRENT_WEATHER):\\n eff_speed = min(eachVehicle.max_speed, eachOrbit.traffic_speed)\\n time_taken = (eachOrbit.distance/eff_speed)+(eachVehicle.cross_crater*eachOrbit.craters*crater_factor(CURRENT_WEATHER)/60)\\n time_taken = round(time_taken, 2)\\n OPTION.append((eachVehicle.veh_type, eachOrbit.route_name, time_taken))\\n else:\\n continue\\n return OPTION\",\n \"def _validate(self):\\n _models = {'hrrr', 'hrrrak', 'rap'}\\n _fields = {'prs', 'sfc', 'nat', 'subh'}\\n \\n self.date = pd.to_datetime(self.date)\\n \\n if self.model == 'alaska':\\n self.model == 'hrrrak'\\n\\n assert self.fxx in range(49), \\\"Forecast lead time `fxx` is too large\\\"\\n assert self.model in _models, f\\\"`model` must be one of {_models}\\\"\\n if self.model in ['hrrr', 'hrrrak']:\\n assert self.field in _fields, f\\\"`field must be one of {_fields}\\\"\\n else:\\n # field is not needed for RAP model.\\n self.field = ''\\n \\n if isinstance(self.priority, str):\\n self.priority = [self.priority]\\n \\n self.priority = [i.lower() for i in self.priority]\\n\\n # Don't look for data from NOMADS if requested date is earlier\\n # than yesterday. NOMADS doesn't keep data that old.\\n if 'nomads' in self.priority:\\n yesterday = datetime.utcnow() - timedelta(hours=24)\\n yesterday = pd.to_datetime(f\\\"{yesterday:%Y-%m-%d}\\\")\\n if self.date < yesterday:\\n self.priority.remove('nomads')\",\n \"def validate(self):\\n variables = ['bottomDepth', 'layerThickness', 'maxLevelCell',\\n 'temperature', 'salinity']\\n compare_variables(\\n test_case=self, variables=variables,\\n filename1='initial_state/initial_state.nc')\\n\\n variables = ['temperature', 'layerThickness']\\n compare_variables(\\n test_case=self, variables=variables,\\n filename1='forward/output/output.0001-01-01_00.00.00.nc')\\n\\n if self.with_particles:\\n # just do particle validation at coarse res\\n variables = [\\n 'xParticle', 'yParticle', 'zParticle', 'zLevelParticle',\\n 'buoyancyParticle', 'indexToParticleID', 'currentCell',\\n 'transfered', 'numTimesReset']\\n compare_variables(test_case=self, variables=variables,\\n filename1='forward/analysis_members/'\\n 'lagrPartTrack.0001-01-01_00.00.00.nc')\\n\\n timers = ['init_lagrPartTrack', 'compute_lagrPartTrack',\\n 'write_lagrPartTrack', 'restart_lagrPartTrack',\\n 'finalize_lagrPartTrack']\\n compare_timers(self, timers, rundir1='forward')\",\n \"def run_parameters_validations(self):\\n if self.risk_rule:\\n if 'connectApi' not in self.services:\\n return_error(\\\"You entered a risk rule but the 'connectApi' service is not chosen. \\\"\\n \\\"Add the 'connectApi' service to the list or remove the risk rule.\\\")\\n else:\\n for risk_rule in self.risk_rule:\\n if not is_valid_risk_rule(self, risk_rule):\\n return_error(f\\\"The given risk rule: {risk_rule} does not exist,\\\"\\n f\\\"please make sure you entered it correctly. \\\\n\\\"\\n f\\\"To see all available risk rules run the '!rf-get-risk-rules' command.\\\")\\n\\n if self.fusion_file_path is not None:\\n if 'fusion' not in self.services:\\n return_error(\\\"You entered a fusion file path but the 'fusion' service is not chosen. \\\"\\n \\\"Add the 'fusion' service to the list or remove the fusion file path.\\\")\",\n \"def validate(self):\\n self.__log('Validating whether all conditions are met.')\\n if not self.config['OUT_FOLDER'] or not self.config['OUTPUT_FOLDER']:\\n self.__log('The path to the output folder cannot be found.', 'error')\\n raise FileNotFoundError\\n\\n try:\\n if '.' in self.output_filename:\\n self.__log('The output filename should not contain an extension.', 'error')\\n raise ValueError\\n except TypeError:\\n pass\\n\\n if not self.output_filename:\\n self.__log('The output filename has not been specified.', 'warning')\\n self.output_filename = self.hash_time()\\n i = 0\\n while self.output_file_exists():\\n self.__log('Adding a unique identifier to current filename.', 'warning')\\n self.output_filename = self.output_filename + '-' + i\\n i += 1\\n self.__log(f'Continuing with file: \\\"{self.output_filename}\\\"', 'success')\\n\\n # Iterate over options to check for required parameters, as to not waste requests\\n self.__log('Starting to check if all required parameters are set')\\n for key, value in self.options.items():\\n if key in self.config['REQUIRED_PARAMETERS'] and not value:\\n self.__log(f'Missing a required parameter: {key}', 'error')\\n raise MissingRequiredParameterError(key)\\n\\n self.__log('All validation successful.', 'success')\",\n \"def validateOutputParams(self):\\n \\n # success\\n retval = 1\\n if not self.__args.has_key('separationaxis'):\\n return retval\\n \\n else:\\n sepaxis = self.__args['separationaxis']\\n\\n # Task mstransform\\n if self.__taskname == \\\"mstransform\\\":\\n if sepaxis != 'scan' and (self.__args['combinespws'] == True or self.__args['nspw'] > 1):\\n casalog.post('Cannot partition MS per spw or auto when combinespws = True or nspw > 1', 'WARN')\\n retval = 0\\n \\n elif sepaxis != 'spw' and self.__args['timespan'] == 'scan':\\n casalog.post('Time averaging across scans may lead to wrong results when separation axis is not spw', 'WARN')\\n \\n return retval\",\n \"def validateTradeRoute(self, tradeRouteDict):\\n try:\\n systemFrom = self.systems[tradeRouteDict['fromSystem']]\\n systemTo = self.systems[tradeRouteDict['toSystem']]\\n # has a trade route already been setup between these planets?\\n (sysFrom, sysTo, type) = string.split(tradeRouteDict['id'], '-')\\n # are these systems adjacent, or share a warp gate with a trade pact\\n if systemTo.id in systemFrom.connectedSystems:\\n pass\\n elif systemTo.id in systemFrom.warpGateSystems:\\n tempRoute = anwp.aw.traderoute.TradeRoute(tradeRouteDict)\\n warpReq = tempRoute.getWarpRequired()\\n if warpReq > (systemFrom.usedWGC + systemFrom.availWGC):\\n return 'System:%s Requires %d Warp Capactiy to setup this Trade Route' % (systemFrom.name, warpReq)\\n if warpReq > (systemTo.usedWGC + systemTo.availWGC):\\n return 'System:%s Requires %d Warp Capactiy to setup this Trade Route' % (systemTo.name, warpReq)\\n else:\\n return 'Systems are not adjacent and have no warp gates between them'\\n # do these systems share the same empire owner, or are the two empires in a trade pact?\\n if systemFrom.myEmpireID <> systemTo.myEmpireID and anwp.func.globals.diplomacy[self.empires[systemFrom.myEmpireID].diplomacy[systemTo.myEmpireID].diplomacyID]['trade'] == 0:\\n return 'System Owners are not the same, or no Trade Pact in Effect'\\n # is a negative trade route being sent?\\n if (tradeRouteDict['AL'] < 0 or tradeRouteDict['EC'] < 0 or tradeRouteDict['IA'] < 0):\\n return 'you cannot send negative values in trade'\\n # is something being sent?\\n if (tradeRouteDict['AL'] == 0 and tradeRouteDict['EC'] == 0 and tradeRouteDict['IA'] == 0) and tradeRouteDict['type'] <> 'GEN':\\n return 'no resources are being sent, trade route invalid'\\n # does the system have the resources to setup this trade?\\n if (systemFrom.AL < tradeRouteDict['AL'] or systemFrom.EC < tradeRouteDict['EC'] or\\n systemFrom.IA < tradeRouteDict['IA']):\\n return '%s does not have enough resources to setup this trade route' % systemFrom.name\\n return 1\\n except:\\n return 'galaxy->validateTradeRoute error'\",\n \"def check_params(self):\\r\\n \\r\\n # TODO: More cases?\\r\\n\\r\\n if self.N <= 0:\\r\\n print('Bad Parameter: N')\\r\\n \\r\\n if self.Ha_tally <= 0 or self.Ha_tally > self.N:\\r\\n print('Bad Parameter: Reported winner tally')\\r\\n \\r\\n if len(self.round_sched) < 1 or not self.check_inc_sched(self.round_sched):\\r\\n print('Bad Parameter: Round Schedule')\\r\\n\\r\\n if self.alpha <= 0 or self.alpha >= .5:\\r\\n print('Bad Parameter: Alpha')\",\n \"def check_kpts(self):\\n if 'fleurinp' in self.ctx.inputs:\\n fleurinp = self.ctx.inputs.fleurinp\\n else:\\n fleurinp = get_fleurinp_from_remote_data(self.ctx.inputs.parent_folder)\\n\\n only_even_MPI = self.inputs.add_comp_para['only_even_MPI']\\n forbid_single_mpi = self.inputs.add_comp_para['forbid_single_mpi']\\n try:\\n machines, mpi_tasks, omp_threads, message = optimize_calc_options(self.ctx.num_machines,\\n self.ctx.num_mpiprocs_per_machine,\\n self.ctx.num_cores_per_mpiproc,\\n self.ctx.use_omp,\\n self.ctx.suggest_mpi_omp_ratio,\\n fleurinp,\\n only_even_MPI=only_even_MPI,\\n forbid_single_mpi=forbid_single_mpi)\\n except ValueError as exc:\\n self.report(exc)\\n return self.exit_codes.ERROR_NOT_OPTIMAL_RESOURCES\\n\\n self.report(message)\\n\\n self.ctx.inputs.metadata.options['resources']['num_machines'] = machines\\n self.ctx.inputs.metadata.options['resources']['num_mpiprocs_per_machine'] = mpi_tasks\\n if self.ctx.use_omp:\\n self.ctx.inputs.metadata.options['resources']['num_cores_per_mpiproc'] = omp_threads\\n if 'environment_variables' not in self.ctx.inputs.metadata.options:\\n self.ctx.inputs.metadata.options['environment_variables'] = {}\\n self.ctx.inputs.metadata.options['environment_variables']['OMP_NUM_THREADS'] = str(omp_threads)\",\n \"def test_validate(self):\\n assert \\\"skip_validation\\\" not in self.route.route\\n\\n route = self.route.validate()\\n assert \\\"skip_validation\\\" not in route.route\\n\\n route = self.route.validate(False)\\n assert \\\"skip_validation\\\" in route.route\",\n \"def run_travel_optimisation(trip_start_date, is_min_co2_search = False, is_force_compute = False):\\n \\n waypoint_co2 = {}\\n waypoint_durations = {}\\n\\n # get all prefectures referential\\n db_connector = Connector()\\n with db_connector:\\n results = db_connector.execute_query(sql.SQL_GET_ALL_PREFECTURE)\\n all_waypoints = pd.DataFrame(results.fetchall())\\n\\n # Vérification si les trajets péfecture à préfecture ont été déjà calculés\\n db_connector = Connector()\\n with db_connector:\\n saved_waypoints = db_connector.execute_query(sql.SQL_GET_WAYPOINTS)\\n\\n # Dans le précalcul des trajets optimaux, utilisation de la date courante\\n travel_date = datetime.now().strftime(\\\"%Y%m%dT%H%M%S\\\")\\n bad_waypoints = []\\n\\n if saved_waypoints.rowcount > 0 and not is_force_compute:\\n print(\\\"le référentiel des voyage existe déjà\\\")\\n else:\\n try:\\n bdd_management.truncate_journey()\\n\\n for (from_city, to_city) in combinations(all_waypoints[0].values, 2):\\n try:\\n if int(from_city) in bad_waypoints or int(to_city) in bad_waypoints:\\n continue\\n\\n route = requests.get(API_NAVITIA.format(\\n int(from_city), int(to_city), travel_date, API_KEY))\\n response = json.loads(route.text)\\n\\n mid_duration = 0\\n mid_co2 = 0\\n for journey in response[\\\"journeys\\\"]:\\n mid_duration += journey[\\\"duration\\\"]\\n mid_co2 += journey[\\\"co2_emission\\\"][\\\"value\\\"]\\n\\n waypoint_co2[frozenset([from_city, to_city])\\n ] = mid_co2/len(response[\\\"journeys\\\"])\\n waypoint_durations[frozenset(\\n [from_city, to_city])] = mid_duration/len(response[\\\"journeys\\\"])\\n\\n except Exception as e:\\n print(\\\"Error with finding the route between %s and %s : %s\\\" %\\n (from_city, to_city, response[\\\"error\\\"][\\\"message\\\"]))\\n if 'no destination point' == response[\\\"error\\\"][\\\"message\\\"]:\\n bad_waypoints.append(int(to_city))\\n\\n if 'no origin point' == response[\\\"error\\\"][\\\"message\\\"]:\\n bad_waypoints.append(int(from_city))\\n\\n for bad_insee_code in re.findall('The entry point: admin:fr:([0-9]+) is not valid', response[\\\"error\\\"][\\\"message\\\"]):\\n if not int(bad_insee_code) in bad_waypoints:\\n bad_waypoints.append(int(bad_insee_code))\\n\\n # Enregistrement des trajets point à point (préfecture à préfecture)\\n db_connector = Connector()\\n with db_connector:\\n for (waypoint1, waypoint2) in waypoint_co2.keys():\\n waypoint = [waypoint1,\\n waypoint2,\\n str(waypoint_co2[frozenset([waypoint1, waypoint2])]),\\n str(int(waypoint_durations[frozenset([waypoint1, waypoint2])]))]\\n \\n db_connector.execute_nonquery(sql.SQL_INSERT_WAYPOINT, waypoint)\\n # commit trajets unitaires dans la bdd\\n db_connector.commit()\\n\\n # enregistrement des préfectures non trouvée (pas de gare)\\n print(bad_waypoints)\\n db_connector = Connector()\\n with db_connector:\\n for bad_city in bad_waypoints:\\n db_connector.execute_nonquery(\\n sql.SQL_INSERT_CITY_WITHOUT_STATION, str(bad_city))\\n #db_connector.commit()\\n except Exception as e:\\n print('Erreur durant la génération des trajets de préfecture en préfecture. Rollback effectué')\\n\\n waypoint_co2 = {}\\n waypoint_durations = {}\\n processed_waypoints = set()\\n\\n db_connector = Connector()\\n with db_connector:\\n waypoints = db_connector.execute_query(sql.SQL_GET_WAYPOINTS)\\n\\n for row in waypoints:\\n waypoint_co2[frozenset([int(row[0]), int(row[1])])] = row[2]\\n waypoint_durations[frozenset([int(row[0]), int(row[1])])] = row[3]\\n processed_waypoints.update([row[0], row[1]])\\n\\n travel_results = algorithms.run_genetic_algorithm(waypoints = list(processed_waypoints), is_min_co2_search = is_min_co2_search, generations=300, population_size=100 )\\n\\n # take most represented trip order\\n journey_groups = Counter(chain(*travel_results))\\n top_journeys = journey_groups.most_common(1)[0][0]\\n\\n print('Le voyage le plus représentatif est :')\\n print(top_journeys)\\n\\n # calcul des horaires de voyage réels pour le trajet le plus optimisé\\n\\n print('Départ du calcul du voyage le %s' %\\n (datetime_str_to_datetime_str(trip_start_date)))\\n travel_date = trip_start_date\\n\\n db_connector = Connector()\\n with db_connector:\\n try:\\n #vidage de la table contenant les informations du voyage\\n bdd_management.truncate_roadtrip()\\n\\n for i in range(len(top_journeys)-1):\\n try:\\n from_city_insee = top_journeys[i]\\n to_city_insee = top_journeys[i+1]\\n route = requests.get(API_NAVITIA.format(\\n int(from_city_insee), int(to_city_insee), travel_date, API_KEY))\\n travels = json.loads(route.text)\\n\\n # Contrôle des voyage reçus pour identifier le plus adapté à recherche\\n best_travel = travels[\\\"journeys\\\"][0]\\n for travel in travels[\\\"journeys\\\"]:\\n if is_min_co2_search and float(best_travel['co2_emission']['value']) > float(travel['co2_emission']['value']):\\n best_travel = travel\\n if best_travel['arrival_date_time'] > travel['arrival_date_time']:\\n best_travel = travel\\n\\n # sauvegarde du trajet 'i' en base\\n save_trip_section(db_connector, all_waypoints, from_city_insee, to_city_insee, best_travel)\\n\\n # le prochain trajet devra avoir une date de départ > à la date de ce trajet\\n travel_date = best_travel['arrival_date_time']\\n\\n except Exception as e:\\n print(\\\"!! Erreur durant le calcul du trajet entre '%s' et '%s'\\\" %\\n (from_city_insee, to_city_insee))\\n\\n #Ecriture du résumé du voyage\\n resume = db_connector.execute_query(sql.SQL_GET_C02_CONSUMPTION_RESUME)\\n resume = resume.fetchone()\\n\\n resume_description = \\\"\\\"\\\"Début du voyage le {} . Arrivée le {}. \\n Le voyage à durée {} pour un total de {:d} kgeC\\\"\\\"\\\".format(\\n datetime_str_to_datetime_str(trip_start_date),\\n datetime_str_to_datetime_str(travel_date),\\n str(timedelta(seconds=resume[0])) ,\\n trunc( resume[1]/1000))\\n\\n store_section(db_connector, resume_description, None, None, 'INFO', resume[0], resume[1])\\n\\n db_connector.commit()\\n\\n except Exception as e:\\n db_connector.rollback()\\n print('Erreur durant la création du voyage. rollback effectué!!!')\\n\\n print('print map with road-trip data')\\n visualization.generate_visualization()\\n\\n print('Travel complete. Have nive trip!!!')\",\n \"def _check_log_params(self):\\n steps_per_stats = self.configs['steps_per_stats']\\n if not steps_per_stats or steps_per_stats < 0:\\n steps_per_stats = 100\\n steps_per_eval = self.configs['steps_per_eval']\\n if not steps_per_eval:\\n steps_per_eval = 10 * steps_per_stats\\n steps_per_external_eval = self.configs['steps_per_external_eval']\\n if not steps_per_external_eval:\\n steps_per_external_eval = 5 * steps_per_eval\\n self.configs['steps_per_stats'] = steps_per_stats\\n self.configs['steps_per_eval'] = steps_per_eval\\n self.configs['steps_per_external_eval'] = steps_per_external_eval\",\n \"def _data_params_validation(self) -> None:\\n extra_regressor_names = set(self.params._reqd_regressor_names)\\n # univariate case\\n if self.data.is_univariate():\\n if len(extra_regressor_names) != 0:\\n msg = (\\n f\\\"Missing data for extra regressors: {self.params._reqd_regressor_names}! \\\"\\n \\\"Please include the missing regressors in `data`.\\\"\\n )\\n raise ValueError(msg)\\n # multivariate case\\n else:\\n value_cols = set(self.data.value.columns)\\n if \\\"y\\\" not in value_cols:\\n msg = \\\"`data` should contain a column called `y` representing the responsive value.\\\"\\n raise ValueError(msg)\\n if not extra_regressor_names.issubset(value_cols):\\n msg = f\\\"`data` should contain all columns listed in {extra_regressor_names}.\\\"\\n raise ValueError(msg)\\n # validate cap\\n if (self.params.cap is True) and (\\\"cap\\\" not in self.data.value.columns):\\n msg = \\\"`data` should contain a column called `cap` representing the cap when `cap = True`.\\\"\\n _error_msg(msg)\\n # validate floor\\n if (self.params.floor is True) and (\\\"floor\\\" not in self.data.value.columns):\\n msg = \\\"`data` should contain a column called `floor` representing the floor when `floor = True`.\\\"\\n _error_msg(msg)\",\n \"def check_params():\\n print INITIAL_SCHEDULE\\n print SCHEDULE_SA[:10]\\n print CONTROL_DECISIONS\\n\\n print \\\"T_SLOT= %f\\\" % T_SLOT\\n print \\\"R=%f\\\" % R\\n print \\\"A=%f\\\" % A\\n print \\\"A_IO=%f\\\" % A_IO\\n print \\\"Q_INT=%d\\\" % Q_INT\",\n \"def updateParameters(self):\\r\\n\\r\\n\\t\\tif self.approach.altered:\\r\\n\\t\\t\\tself.transform.enabled = True\\r\\n\\r\\n\\t\\t\\tif self.approach.value == 'Locations in the DEM generated from field observations':\\r\\n\\t\\t\\t\\tself.predefined_pattern.enabled = False\\r\\n\\t\\t\\t\\tself.pattern_workspace.enabled = False\\r\\n\\t\\t\\t\\tself.point_matrix_size.enabled = True\\r\\n\\t\\t\\t\\tself.point_vectors.enabled = True\\r\\n\\t\\t\\t\\tself.mapping_field.enabled = True\\r\\n\\t\\t\\t\\tself.move_to_max.enabled = True\\r\\n\\t\\t\\t\\tself.output_sim_matrix.enabled = True\\r\\n\\t\\t\\t\\tself.mh_dil_val.enabled = False\\r\\n\\r\\n\\t\\t\\t\\tself.mh_iteration.enabled = False\\r\\n\\t\\t\\t\\tself.mh_iteration.value = False\\r\\n\\t\\t\\t\\tself.output_table.enabled = False\\r\\n\\t\\t\\t\\tself.output_raster_workspace.enabled = False\\r\\n\\t\\t\\t\\tself.output_raster_workspace.value = ''\\r\\n\\r\\n\\t\\t\\telif self.approach.value == 'Locations in the DEM versus pre-defined pattern':\\r\\n\\t\\t\\t\\tself.predefined_pattern.enabled = True\\r\\n\\t\\t\\t\\tself.point_matrix_size.enabled = True\\r\\n\\t\\t\\t\\tself.point_vectors.enabled = True\\r\\n\\t\\t\\t\\tself.mapping_field.enabled = True\\r\\n\\t\\t\\t\\tself.move_to_max.enabled = True\\r\\n\\t\\t\\t\\tself.mh_dil_val.enabled = True\\r\\n\\t\\t\\t\\tself.mh_iteration.enabled = True\\r\\n\\t\\t\\t\\tself.output_table.enabled = True\\r\\n\\t\\t\\t\\tself.output_sim_matrix.enabled = False\\r\\n\\t\\t\\t\\tself.output_sim_matrix.value = ''\\r\\n\\t\\t\\t\\tself.output_raster_workspace.enabled = False\\r\\n\\t\\t\\t\\tself.output_raster_workspace.value = ''\\r\\n\\r\\n\\t\\t\\telse: # seek pre-defined pattern in DEM\\r\\n\\t\\t\\t\\tself.predefined_pattern.enabled = True\\r\\n\\t\\t\\t\\tself.point_matrix_size.enabled = True\\r\\n\\t\\t\\t\\tself.mh_iteration.enabled = True\\r\\n\\t\\t\\t\\tself.output_raster_workspace.enabled = True\\r\\n\\t\\t\\t\\tself.point_vectors.enabled = False\\r\\n\\t\\t\\t\\tself.point_vectors.value = ''\\r\\n\\t\\t\\t\\tself.mapping_field.enabled = False\\r\\n\\t\\t\\t\\tself.move_to_max.enabled = False\\r\\n\\t\\t\\t\\tself.move_to_max.value = False\\r\\n\\t\\t\\t\\tself.mh_dil_val.enabled = True\\r\\n\\t\\t\\t\\tself.output_sim_matrix.enabled = False\\r\\n\\t\\t\\t\\tself.output_sim_matrix.value = ''\\r\\n\\t\\t\\t\\tself.output_table.enabled = False\\r\\n\\t\\t\\t\\tself.output_table.value = ''\\r\\n\\r\\n\\t\\tif self.mh_iteration.altered:\\r\\n\\r\\n\\t\\t\\tif self.mh_iteration.value is True:\\r\\n\\t\\t\\t\\tself.mh_dil_start.enabled = True\\r\\n\\t\\t\\t\\tself.mh_dil_stop.enabled = True\\r\\n\\t\\t\\t\\tself.mh_dil_step.enabled = True\\r\\n\\t\\t\\t\\tself.mh_dil_val.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_val.value = 1\\r\\n\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tif self.approach.value == 'Locations in the DEM generated from field observations':\\r\\n\\t\\t\\t\\t\\tself.mh_dil_val.enabled = False\\r\\n\\t\\t\\t\\t\\tself.mh_dil_val.value = 1\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\tself.mh_dil_val.enabled = True\\r\\n\\r\\n\\t\\t\\t\\tself.mh_dil_start.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_stop.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_step.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_start.value = 0.01\\r\\n\\t\\t\\t\\tself.mh_dil_stop.value = 1\\r\\n\\t\\t\\t\\tself.mh_dil_step.value = 0.1\\r\\n\\r\\n\\t\\tif self.move_to_max.altered:\\r\\n\\t\\t\\tif self.move_to_max.value is True:\\r\\n\\t\\t\\t\\tself.move_to_max_distance.enabled = True\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tself.move_to_max_distance.enabled = False\\r\\n\\t\\t\\t\\tself.move_to_max_distance.value = 3\\r\\n\\r\\n\\t\\tif self.transform.altered:\\r\\n\\t\\t\\tif self.transform.value == 'Work directly on the elevation matrix':\\r\\n\\t\\t\\t\\tself.size_of_the_cell.enabled = False\\r\\n\\t\\t\\telif self.transform.value == 'Perform a local translation':\\r\\n\\t\\t\\t\\tself.size_of_the_cell.enabled = False\\r\\n\\t\\t\\telif self.transform.value == 'Compute slopes' or self.transform.value == \\\\\\r\\n\\t\\t\\t\\t\\t'Compute slopes and perform local translation':\\r\\n\\t\\t\\t\\tself.size_of_the_cell.enabled = True\\r\\n\\r\\n\\t\\tif self.predefined_pattern.altered:\\r\\n\\t\\t\\tif self.predefined_pattern.value == 'Custom pattern':\\r\\n\\t\\t\\t\\tself.pattern_workspace.enabled = True\\r\\n\\r\\n\\t\\t\\t\\tself.mh_iteration.value = False\\r\\n\\t\\t\\t\\tself.mh_iteration.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_start.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_stop.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_step.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_start.value = 0.01\\r\\n\\t\\t\\t\\tself.mh_dil_stop.value = 1\\r\\n\\t\\t\\t\\tself.mh_dil_step.value = 0.1\\r\\n\\t\\t\\t\\tself.mh_dil_val.enabled = False\\r\\n\\t\\t\\t\\tself.mh_dil_val.value = 1\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tself.pattern_workspace.enabled = False\",\n \"def rules(self):\\n self.rule1 = min(self.location_is_lessDemand, self.area_is_small, self.unfunishing)\\n self.rule2 = min(self.location_is_lessDemand, max(self.area_is_small, self.area_is_average), self.access_is_good)\\n self.rule3 = min(self.location_is_veryHighDemand, self.area_is_average, self.fac_is_low, self.access_is_average)\\n self.rule4 = min(self.location_is_veryLessDemand, self.area_is_verysmall, self.fully_funishing)\\n self.rule5 = min(self.location_is_lessDemand, self.fac_is_average, max(self.area_is_small, self.area_is_average))\\n self.rule6 = min(max(self.location_is_lessDemand, self.location_is_averageDemand), self.access_is_good)\\n self.rule7 = min(self.location_is_lessDemand, self.access_is_good, self.area_is_large, self.partially_funishing)\\n self.rule8 = min(self.location_is_highDemand, self.access_is_good, max(self.bed_is_less, self.bath_is_average))\\n self.rule9 = min(self.location_is_veryHighDemand, self.area_is_large, self.unfunishing)\\n self.rule10 = min(self.access_is_good, self.area_is_average, (1 - self.unfunishing))\\n self.rule11 = min(self.access_is_good, self.area_is_large, self.partially_funishing, self.bed_is_more, self.bath_is_more)\",\n \"def update_route(self, vrpdata):\\n self.distance = 0\\n self.quantity = 0\\n self.tourValid = False\\n lastc = 0 # first entry is depot\\n for c in self.route:\\n self.distance += vrpdata.DistMatrix[lastc][c]\\n self.quantity += vrpdata.CustDem[c]\\n lastc = c\\n self.distance += vrpdata.DistMatrix[lastc][0] # last entry is depot\\n self.tourValid = (self.quantity <= vrpdata.MaxVehCap)\",\n \"def validateInputParams(self): \\n # Return dictionary\\n retval = {}\\n retval['status'] = True\\n retval['axis'] = ''\\n \\n # Get the separationaxis of input MMS. \\n sepaxis = ph.axisType(self.__args['vis'])\\n if sepaxis.isspace() or sepaxis.__len__() == 0:\\n sepaxis = 'unknown'\\n elif sepaxis == 'scan,spw':\\n sepaxis = 'auto'\\n \\n #Get list of subMSs in MMS\\n subMSList = ParallelTaskHelper.getReferencedMSs(self.__args['vis'])\\n \\n if self.__taskname == \\\"mstransform\\\":\\n \\n if (self.__args['combinespws'] == True or self.__args['nspw'] > 1) and \\\\\\n (self.__args['timeaverage'] == False):\\n spwsel = self.__getSpwIds(self.__args['vis'], self.__args['spw']) \\n # Get dictionary with spwids of all subMS in the MMS\\n spwdict = ph.getScanSpwSummary(subMSList) \\n # For each subMS, check if it has the spw selection\\n for subms in subMSList:\\n subms_spwids = ph.getSubMSSpwIds(subms, spwdict)\\n slist = map(str,subms_spwids)\\n # Check if the subms contains all the selected spws\\n if not self.__isSpwContained(spwsel, slist):\\n casalog.post('Cannot combine or separate spws in parallel because the subMSs do not contain all the selected spws',\\\\\\n 'WARN')\\n # Set the new separation axis for the output\\n retval['status'] = False\\n retval['axis'] = 'scan'\\n break\\n \\n elif (self.__args['timeaverage'] == True and self.__args['timespan'] == 'scan') and \\\\\\n (self.__args['combinespws'] == False and self.__args['nspw'] == 1):\\n # Get the value of timebin as a float\\n timebin = self.__args['timebin']\\n tsec = qa.quantity(timebin,'s')['value']\\n scansel = self.__getScanIds(self.__args['vis'], self.__args['scan'])\\n # For each subms, check if scans length is <= timebin\\n for subms in subMSList:\\n if not self.__isScanContained(subms, scansel, tsec):\\n casalog.post('Cannot process MMS in parallel when timespan=\\\\'scan\\\\' because the subMSs do not contain all the selected scans',\\\\\\n 'WARN')\\n # Set the new separation axis for the output\\n retval['status'] = False\\n retval['axis'] = 'spw'\\n break\\n \\n # Two transformations are requested.\\n elif (self.__args['combinespws'] == True or self.__args['nspw'] > 1) and \\\\\\n (self.__args['timeaverage'] == True and self.__args['timespan'] == 'scan'):\\n # Check spws and scans in subMSs\\n spwsel = self.__getSpwIds(self.__args['vis'], self.__args['spw'])\\n spwdict = ph.getScanSpwSummary(subMSList) \\n scansel = self.__getScanIds(self.__args['vis'], self.__args['scan'])\\n timebin = self.__args['timebin']\\n tsec = qa.quantity(timebin,'s')['value']\\n for subms in subMSList:\\n subms_spwids = ph.getSubMSSpwIds(subms, spwdict)\\n slist = map(str,subms_spwids)\\n if self.__isSpwContained(spwsel, slist):\\n if not self.__isScanContained(subms, scansel, tsec):\\n casalog.post('The subMSs of input MMS do not contain the necessary scans','WARN')\\n retval['status'] = False\\n retval['axis'] = ''\\n break \\n else:\\n casalog.post('The subMSs of input MMS do not contain the necessary spws','WARN')\\n retval['status'] = False\\n retval['axis'] = ''\\n break\\n \\n \\n elif self.__taskname == \\\"split2\\\" or self.__taskname == \\\"split\\\": \\n if (sepaxis != 'spw' and self.__args['combine'] == 'scan'):\\n scansel = self.__getScanIds(self.__args['vis'], self.__args['scan'])\\n timebin = self.__args['timebin']\\n tsec = qa.quantity(timebin,'s')['value']\\n for subms in subMSList:\\n if not self.__isScanContained(subms, scansel, tsec):\\n casalog.post('Cannot process MMS in parallel when combine=\\\\'scan\\\\' because the subMSs do not contain all the selected scans',\\\\\\n 'WARN')\\n casalog.post(\\\"Please set keepmms to False or use task mstransform in this case.\\\",'ERROR')\\n retval['status'] = False\\n retval['axis'] = ''\\n break\\n\\n elif self.__taskname == \\\"cvel2\\\" and sepaxis != 'scan':\\n spwsel = self.__getSpwIds(self.__args['vis'], self.__args['spw']) \\n spwdict = ph.getScanSpwSummary(subMSList) \\n for subms in subMSList:\\n subms_spwids = ph.getSubMSSpwIds(subms, spwdict)\\n slist = map(str,subms_spwids)\\n # Check if the subms contains all the selected spws\\n if not self.__isSpwContained(spwsel, slist):\\n casalog.post('Cannot combine spws in parallel because the subMSs do not contain all the selected spws',\\\\\\n 'WARN')\\n casalog.post(\\\"Please set keepmms to False or use task mstransform in this case.\\\",'ERROR')\\n # Set the new separation axis for the output\\n retval['status'] = False\\n retval['axis'] = ''\\n break\\n \\n\\n return retval\",\n \"def validate(self):\\n variables = ['bottomDepth', 'ssh', 'layerThickness', 'zMid',\\n 'maxLevelCell', 'temperature', 'salinity']\\n compare_variables(\\n test_case=self, variables=variables,\\n filename1='initial_state/initial_state.nc')\\n\\n variables = ['temperature', 'salinity', 'layerThickness',\\n 'normalVelocity']\\n compare_variables(test_case=self, variables=variables,\\n filename1='full_run/output.nc',\\n filename2='restart_run/output.nc')\\n\\n variables = ['ssh', 'landIcePressure', 'landIceDraft',\\n 'landIceFraction',\\n 'landIceMask', 'landIceFrictionVelocity', 'topDrag',\\n 'topDragMagnitude', 'landIceFreshwaterFlux',\\n 'landIceHeatFlux', 'heatFluxToLandIce',\\n 'landIceBoundaryLayerTemperature',\\n 'landIceBoundaryLayerSalinity',\\n 'landIceHeatTransferVelocity',\\n 'landIceSaltTransferVelocity',\\n 'landIceInterfaceTemperature',\\n 'landIceInterfaceSalinity', 'accumulatedLandIceMass',\\n 'accumulatedLandIceHeat']\\n compare_variables(test_case=self, variables=variables,\\n filename1='full_run/land_ice_fluxes.nc',\\n filename2='restart_run/land_ice_fluxes.nc')\\n\\n variables = ['accumulatedFrazilIceMass',\\n 'accumulatedFrazilIceSalinity',\\n 'seaIceEnergy', 'frazilLayerThicknessTendency',\\n 'frazilTemperatureTendency', 'frazilSalinityTendency',\\n 'frazilSurfacePressure',\\n 'accumulatedLandIceFrazilMass']\\n compare_variables(test_case=self, variables=variables,\\n filename1='full_run/frazil.nc',\\n filename2='restart_run/frazil.nc')\",\n \"def validate_inputs(self):\\n self.ctx.inputs = AttributeDict(self.exposed_inputs(FleurCalculation))\\n\\n self.ctx.max_queue_nodes = self.inputs.add_comp_para['max_queue_nodes']\\n self.ctx.max_queue_wallclock_sec = self.inputs.add_comp_para['max_queue_wallclock_sec']\\n\\n input_options = self.inputs.options.get_dict()\\n self.ctx.optimize_resources = input_options.pop('optimize_resources', True)\\n self.ctx.inputs.metadata.options = input_options\\n\\n if 'description' in self.inputs:\\n self.ctx.inputs.metadata.description = self.inputs.description\\n else:\\n self.ctx.inputs.metadata.description = ''\\n if 'label' in self.inputs:\\n self.ctx.inputs.metadata.label = self.inputs.label\\n else:\\n self.ctx.inputs.metadata.label = ''\\n\\n if not self.ctx.optimize_resources:\\n self.ctx.can_be_optimised = False # set this for handlers to not change resources\\n return\\n\\n resources_input = self.ctx.inputs.metadata.options['resources']\\n try:\\n self.ctx.num_machines = int(resources_input['num_machines'])\\n self.ctx.num_mpiprocs_per_machine = int(resources_input['num_mpiprocs_per_machine'])\\n except KeyError:\\n self.ctx.can_be_optimised = False\\n self.report('WARNING: Computation resources were not optimised.')\\n else:\\n try:\\n self.ctx.num_cores_per_mpiproc = int(resources_input['num_cores_per_mpiproc'])\\n self.ctx.use_omp = True\\n self.ctx.suggest_mpi_omp_ratio = self.ctx.num_mpiprocs_per_machine / self.ctx.num_cores_per_mpiproc\\n except KeyError:\\n self.ctx.num_cores_per_mpiproc = 1\\n self.ctx.use_omp = False\\n self.ctx.suggest_mpi_omp_ratio = 1\\n\\n status = self.check_kpts()\\n if status is None:\\n self.ctx.can_be_optimised = True\\n else:\\n self.report('ERROR: Not optimal computational resources.')\\n return status\",\n \"def directions_calc(self):\\n \\n # create route_dict, {'radio_button_name': {'geometries': list of coords,\\n # 'values': list of values}}\\n route_dict = self._selectInput()\\n \\n # generate lists with locations and values\\n (start_layer_name,\\n end_layer_name) = [x.objectName() for x in self.radio_buttons]\\n \\n locations_list = list(product(route_dict[start_layer_name]['geometries'],\\n route_dict[end_layer_name]['geometries']))\\n values_list = list(product(route_dict[start_layer_name]['values'],\\n route_dict[end_layer_name]['values']))\\n \\n # If row-by-row in two-layer mode, then only zip the locations\\n if all([button.isChecked() for button in self.radio_buttons]) and self.dlg.routing_twolayer_rowbyrow.isChecked():\\n locations_list = list(zip(route_dict[start_layer_name]['geometries'],\\n route_dict[end_layer_name]['geometries']))\\n\\n values_list = list(zip(route_dict[start_layer_name]['values'],\\n route_dict[end_layer_name]['values']))\\n\\n # Add via point if specified\\n route_via = None\\n if self.dlg.routing_via_label.text() != 'Long,Lat':\\n route_via = [float(x) for x in self.dlg.routing_via_label.text().split(\\\",\\\")]\\n \\n message_bar, progress_widget = progressbar.pushProgressBar(self.iface)\\n \\n responses = []\\n delete_values = []\\n for i, coords_tuple in enumerate(locations_list):\\n if coords_tuple[0] == coords_tuple[-1]:\\n # Skip when same location\\n delete_values.append(i)\\n continue\\n if route_via:\\n # add via coords\\n coords_tuple = list(coords_tuple)\\n coords_tuple.insert(1, route_via)\\n \\n # Update progress bar\\n percent = (i/len(locations_list)) * 100\\n message_bar.setValue(percent)\\n \\n # Make the request\\n self.params['coordinates'] = convert.build_coords(coords_tuple)\\n responses.append(self.client.request(self.url, self.params))\\n \\n # Delete entries in values_list where coords where the same\\n values_list = [value for idx, value in enumerate(values_list) if idx not in delete_values]\\n \\n # Only proceed when there actual responses\\n if responses: \\n layer_out = self._addLine(responses, values_list)\\n layer_out.updateExtents()\\n \\n QgsProject.instance().addMapLayer(layer_out)\\n \\n self.iface.messageBar().popWidget(progress_widget)\",\n \"def test_parse_routes(self):\\n\\n params = get_params()\\n estimator = LinearEstimator()\\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\\n model_builder = OptimizationModelBuilder(\\n constraints=[CapacityConstraint()]\\n )\\n riders = parse_models(model_dicts=test_riders, cls=Rider)\\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\\n depots = parse_models(model_dicts=test_depots, cls=Depot)\\n problem = problem_builder.build(riders, vehicles, depots)\\n model = model_builder.build(problem)\\n solution = model.solve()\\n routes = Router._parse_routes(problem, solution)\\n self.assertTrue(routes, msg='Routes could not be built.')\\n\\n for route in routes:\\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\\n self.assertTrue(\\n len(route['stops']) > 1,\\n msg='Route with single stop.'\\n )\",\n \"def analyseCoordination(self):\\n #create a list of criteria that correspond to maximal path length\\n #max_path_length = max(self.pathLengths)\\n\\n #criterion_max_path_length = []\\n #origins_max_path_length = []\\n #for c in range(len(self.pathLengths)):\\n # if self.pathLengths[c] == max_path_length:\\n # criterion_max_path_length.append(self.globalMin[c])\\n # origins_max_path_length.append(self.origins[c])\\n\\n #min_criterion = min(criterion_max_path_length)\\n\\n #find index\\n #for m in range(len(criterion_max_path_length)):\\n # if criterion_max_path_length[m] == min_criterion:\\n # break\\n\\n #for s in range(len(self.origins)):\\n # if self.origins[s] == origins_max_path_length[m]:\\n # break\\n\\n min_criterion = self.globalMin[0]\\n self.overall_min = min_criterion\\n self.overall_max_path_length = len(self.min_path[0])\\n\\n if self.chosenScheduleIndex != self.globalMinSchedIdx[0]:\\n self.chosenScheduleIndex = self.globalMinSchedIdx[0]\\n self.chosenSchedule = self.schedules[self.chosenScheduleIndex]\\n self.EConsumptionChosenSchedule = self.EConsumptionScheduleCurves[self.chosenScheduleIndex]\\n # update SOC\\n self.setSOC(self.SOCEnd[self.chosenScheduleIndex])\\n # update modulation level\\n self.setStateModlvl(self.chosenSchedule[-1])\\n\\n\\n # inform all neighbors about origin that has local minimal criterion\\n for n in range(len(self.Neighbors)):\\n #structure: ['minimalorigin', ID_minimal_origin, minimal_criterion_value]\\n #self.sendMessage(self.Neighbors[n], 70, ['minimalorigin', copy.deepcopy(origins_max_path_length[m]), copy.deepcopy(min_criterion), copy.deepcopy(self.min_path[s]), copy.deepcopy(self.min_path_schedules[s])])\\n self.sendMessage(self.Neighbors[n], 70, ['minimalorigin', copy.deepcopy(self.CommID), copy.deepcopy(min_criterion), copy.deepcopy(self.min_path[0]), copy.deepcopy(self.min_path_schedules[0])])\\n\\n if self.OPTcriterion == 'maxmindiff':\\n fluct_criterion = max(self.EFluctuationCurve) - min(self.EFluctuationCurve)\\n elif self.OPTcriterion == 'absremainder':\\n fluct_criterion = 0\\n for a in range(len(self.EFluctuationCurve)):\\n fluct_criterion += abs(self.EFluctuationCurve[a])\\n\\n\\n #print 'ID {0}: criterion is: {1} , of origin {4}, path length: {2}, schedules: {5}, with improvement of {3} %'.format(self.CommID, min_criterion, len(self.min_path[s]), 100 - 100*(float((float(min_criterion))/float(fluct_max_min_diff))), origins_max_path_length[m], self.min_path_schedules[s] )\\n self.log_message('ID {0}: criterion is: {1} , of origin {4}, path length: {2}, schedules: {5}, with improvement of {3} %'.format(self.CommID, min_criterion, len(self.min_path[0]), 100 - 100*(float((float(min_criterion))/float(fluct_criterion))), self.CommID, self.min_path_schedules[0] ))\",\n \"def validate_parameters(self):\\n\\n # env and fixed_env\\n self._validate_envs()\\n # checking optional data and scripts\\n self._validate_download_data()\\n self.data_path = self.params[\\\"data\\\"][\\\"location\\\"]\\n self._validate_scripts()\\n # checking optional data_ref (if not data_ref provided, path is the same as data path)\\n if \\\"data_ref\\\" in self.params:\\n self._validate_download_data(data_nm=\\\"data_ref\\\")\\n# self.data_ref_path = self.params[\\\"data_ref\\\"][\\\"location\\\"]\\n# else:\\n# self.data_ref_path = self.data_path\\n # checking analysis\\n self._validate_analysis()\\n # checking tests\\n self._validate_tests()\\n\\n self.params.setdefault(\\\"post_build\\\", None)\\n # if copy in post_build part that I'm changing the build_context\\n if self.params[\\\"post_build\\\"] and \\\"copy\\\" in self.params[\\\"post_build\\\"]:\\n self.build_context = self.workflow_path\\n else:\\n self.build_context = self.working_dir\\n\\n self.params.setdefault(\\\"plots\\\", [])\\n if self.params[\\\"plots\\\"]:\\n if not isinstance(self.params[\\\"plots\\\"], (list, tuple)):\\n raise SpecificationError(\\n \\\"Value of key 'plots' must be a list or a tuple\\\"\\n )\\n else:\\n if any(not isinstance(j, dict) for j in self.params[\\\"plots\\\"]):\\n raise SpecificationError(\\n \\\"Every item in 'plots' must be a dictionary.\\\"\\n )\",\n \"def route_validity_checker(): #below route list was rerturned from bus_routes function above, copy and pasted to eliminate need to re-run\\n route_list=['15', '46A', '14', '41B', '39A', '65', '40D', '11', '31', '27', '67', '79', '42', '66A', '33B', '140', '44', '83A', '27B', '38', '16C', '747', '41C', '39', '25', '239', '43', '70', '13', '150', '145', '77A', '184', '84', '61', '83', '40', '66', '15A', '123', '17A', '16', '14C', '9', '4', '37', '32', '33', '49', '56A', '151', '25A', '45A', '54A', '47', '18', '7', '17', '102', '120', '65B', '41', '122', '29A', '76', '68', '59', '25B', '69', '27A', '66B', '38B', '7D', '75', '15B', '84A', '63', '84X', '33X', '68A', '1', '76A', '7B', '270', '236', '130', '238', '220', '44B', '40B', '26', '32B', '8', '41A', '53', '67X', '104', '32A', '79A', '114', '185', '66X', '31B', '32X', '51X', '51D', '41X', '142', '111', '69X', '27X', '116', '46E', '161', '118', '25X', '38A', '33A', 'PP07', '53B', '31A', 'OL84']\\n count_dict={}\\n for route in route_list: #dictionary with key for every route in the list\\n count_dict[route]=0 #used to count number of occurrences in files\\n os.chdir(\\\"../Data\\\")\\n for file in glob.glob(\\\"*.csv\\\"): #for every file\\n print(file)\\n reader=csv.reader(open(file))\\n for line in reader:\\n route=extract_bus_route(line[3])\\n if route!=\\\"\\\":\\n count_dict[extract_bus_route(line[3])]+=1 #incremenent the counter of the route with the associated journey id code\\n return count_dict #result is that 3 routes are likely due to strange circumstances or errors in data\",\n \"def initialize_rt_solver(self):\\r\\n # For a local network dataset, we need to checkout the Network Analyst extension license.\\r\\n if not self.is_service:\\r\\n arcpy.CheckOutExtension(\\\"network\\\")\\r\\n\\r\\n # Create a new Route object\\r\\n self.logger.debug(\\\"Creating Route object...\\\")\\r\\n self.rt_solver = arcpy.nax.Route(self.network_data_source)\\r\\n\\r\\n # Set the Route analysis properties.\\r\\n # Read properties from the rt_config.py config file for all properties not set in the UI as parameters.\\r\\n # Route properties documentation: https://pro.arcgis.com/en/pro-app/latest/arcpy/network-analyst/route.htm\\r\\n # The properties have been extracted to the config file to make them easier to find and set so users don't have\\r\\n # to dig through the code to change them.\\r\\n self.logger.debug(\\\"Setting Route analysis properties from RT config file...\\\")\\r\\n for prop, value in RT_PROPS.items():\\r\\n if prop in RT_PROPS_SET_BY_TOOL:\\r\\n self.logger.warning((\\r\\n f\\\"Route config file property {prop} is handled explicitly by the tool parameters and will be \\\"\\r\\n \\\"ignored.\\\"\\r\\n ))\\r\\n continue\\r\\n try:\\r\\n setattr(self.rt_solver, prop, value)\\r\\n if hasattr(value, \\\"name\\\"):\\r\\n self.logger.debug(f\\\"{prop}: {value.name}\\\")\\r\\n else:\\r\\n self.logger.debug(f\\\"{prop}: {value}\\\")\\r\\n except Exception as ex: # pylint: disable=broad-except\\r\\n # Suppress warnings for older services (pre 11.0) that don't support locate settings and services\\r\\n # that don't support accumulating attributes because we don't want the tool to always throw a warning.\\r\\n if not (self.is_service and prop in [\\r\\n \\\"searchTolerance\\\", \\\"searchToleranceUnits\\\", \\\"accumulateAttributeNames\\\"\\r\\n ]):\\r\\n self.logger.warning(\\r\\n f\\\"Failed to set property {prop} from RT config file. Default will be used instead.\\\")\\r\\n self.logger.warning(str(ex))\\r\\n # Set properties explicitly specified in the tool UI as arguments\\r\\n self.logger.debug(\\\"Setting Route analysis properties specified tool inputs...\\\")\\r\\n self.rt_solver.travelMode = self.travel_mode\\r\\n self.logger.debug(f\\\"travelMode: {self.travel_mode}\\\")\\r\\n self.rt_solver.timeUnits = self.time_units\\r\\n self.logger.debug(f\\\"timeUnits: {self.time_units}\\\")\\r\\n self.rt_solver.distanceUnits = self.distance_units\\r\\n self.logger.debug(f\\\"distanceUnits: {self.distance_units}\\\")\\r\\n self.rt_solver.timeOfDay = self.time_of_day\\r\\n self.logger.debug(f\\\"timeOfDay: {self.time_of_day}\\\")\",\n \"def validateProcess(process):\\n \\n schedule=process.schedule_()\\n paths=process.paths_()\\n endpaths=process.endpaths_()\\n \\n # check output mods are in paths and have appropriate settings\\n for outputModName in process.outputModules_().keys():\\n outputMod = getattr(process, outputModName)\\n if not hasattr(outputMod, 'dataset'):\\n msg = \\\"Process contains output module without dataset PSET: %s \\\\n\\\" % outputModName\\n msg += \\\" You need to add this PSET to this module to set dataTier and filterName\\\\n\\\"\\n raise RuntimeError(msg)\\n ds=getattr(outputMod,'dataset')\\n if not hasattr(ds, \\\"dataTier\\\"):\\n msg = \\\"Process contains output module without dataTier parameter: %s \\\\n\\\" % outputModName\\n msg += \\\" You need to add an untracked parameter to the dataset PSET of this module to set dataTier\\\\n\\\"\\n raise RuntimeError(msg)\\n\\n # check module in path or whatever (not sure of exact syntax for endpath)\\n omRun=False\\n\\n if schedule==None:\\n for path in paths:\\n if outputModName in getattr(process,path).moduleNames():\\n omRun=True\\n for path in endpaths:\\n if outputModName in getattr(process,path).moduleNames():\\n omRun=True\\n else:\\n for path in schedule:\\n if outputModName in path.moduleNames():\\n omRun=True\\n if omRun==False:\\n msg = \\\"Output Module %s not in endPath\\\" % outputModName\\n raise RuntimeError(msg)\",\n \"def __init__(self, runway_type):\\n self.primary_surface_length = 200\\n self.primary_surface_width = 0\\n self.approach_surface_extendedwidth = 0\\n self.first_section_length = 0\\n self.first_section_slope = 0\\n self.second_section_length = 0\\n self.second_section_slope = 0\\n self.horizontal_surface_height = 150\\n self.horizontal_surface_radius = 0\\n self.conical_surface_slope = 20\\n self.conical_surface_offset = 4000\\n self.transitional_surface_slope = 7\\n \\n # The runway types listed in the documentation for FAA FAR 77 do not \\n # match what appears when you actually run the tool in ArcMap.\\n # These regular expressions should match either version. \\n if re.match(\\\"Visual\\\\s*(?:Runway)?\\\\s*Visual\\\\sApproach\\\", runway_type, re.I):\\n self.primary_surface_width = 500\\n self.approach_surface_extendedwidth = 1500\\n self.first_section_length = 5000\\n self.first_section_slope = 20\\n self.horizontal_surface_radius = 5000\\n elif re.match(\\\"Utility\\\\s*(?:Runway)?\\\\s*Visual Approach\\\", runway_type, re.I):\\n self.primary_surface_width = 250\\n self.approach_surface_extendedwidth = 1250\\n self.first_section_length = 5000\\n self.first_section_slope = 20\\n self.horizontal_surface_radius = 5000\\n elif re.match(\\\"Utility\\\\s*(?:Runway)?\\\\s*Non[\\\\s\\\\-]*Precision Instrument Approach\\\", runway_type, re.I):\\n self.primary_surface_width = 500\\n self.approach_surface_extendedwidth = 2000\\n self.first_section_length = 5000\\n self.first_section_slope = 20\\n self.horizontal_surface_radius = 5000\\n elif re.match(\\\"Precision Instrument\\\\s*(?:Runway)?\\\", runway_type, re.I):\\n self.primary_surface_width = 1000\\n self.approach_surface_extendedwidth = 16000\\n self.first_section_length = 10000\\n self.first_section_slope = 50\\n self.second_section_length = 40000\\n self.second_section_slope = 40\\n self.horizontal_surface_radius = 10000\\n elif re.match(\\\"Non Precision Instrument\\\\s*(?:Runway)?\\\\s*(?:(?:High)|(?:Greater)) Visibility\\\", runway_type, re.I):\\n self.primary_surface_width = 500\\n self.approach_surface_extendedwidth = 3500\\n self.first_section_length = 10000\\n self.first_section_slope = 34\\n self.horizontal_surface_radius = 10000\\n elif re.match(\\\"Non Precision Instrument\\\\s*(?:Runway)\\\\s*Approach Low Visibility\\\", runway_type, re.I):\\n self.primary_surface_width = 1000\\n self.approach_surface_extendedwidth = 4000\\n self.first_section_length = 10000\\n self.first_section_slope = 34\\n self.horizontal_surface_radius = 10000\",\n \"def testoptdone(self):\\r\\n assert self.data.optdone\\r\\n assert numpy.all(numpy.abs(self.data.geovalues[-1]) <= self.data.geotargets)\",\n \"def validate(self):\\n valid = True\\n \\n # Check that link information is valid\\n for ij in self.link:\\n valid = valid and self.link[ij].head in self.node\\n valid = valid and self.link[ij].tail in self.node\\n if not valid:\\n print(\\\"Error: Link tail/head not found: %s %s\\\" % (self.link[ij].tail, self.link[ij].head))\\n raise utils.BadFileFormatException\\n valid = valid and self.link[ij].capacity >= 0\\n valid = valid and self.link[ij].length >= 0\\n valid = valid and self.link[ij].freeFlowTime >= 0\\n valid = valid and self.link[ij].alpha >= 0\\n valid = valid and self.link[ij].beta >= 0\\n valid = valid and self.link[ij].speedLimit >= 0\\n valid = valid and self.link[ij].toll >= 0\\n if not valid:\\n print(\\\"Link %s has negative parameters.\\\" % ij)\\n \\n # Then check that all OD pairs are in range\\n for ODpair in self.ODpair:\\n (origin, destination) = (self.ODpair[ODpair].origin, self.ODpair[ODpair].destination)\\n valid = valid and origin in self.node\\n valid = valid and destination in self.node\\n if not valid:\\n print(\\\"Error: Origin/destination %s not found\\\" % ODpair)\\n raise utils.BadFileFormatException\\n valid = valid and self.node[origin].isZone == True\\n valid = valid and self.node[destination].isZone == True\\n if not valid:\\n print(\\\"Error: Origin/destination %s does not connect two zones\\\" % str(ODpair))\\n raise utils.BadFileFormatException\\n valid = valid and self.ODpair[ODpair].demand >= 0\\n if not valid:\\n print(\\\"Error: OD pair %s has negative demand\\\" % ODpair)\\n raise utils.BadFileFormatException\\n \\n # Now error-check using metadata\\n if self.numNodes != None and len(self.node) != self.numNodes:\\n print(\\\"Warning: Number of nodes implied by network file %d different than metadata value %d\\\" % (len(self.node), self.numNodes))\\n self.numNodes = len(self.node)\\n if self.numLinks != None and len(self.link) != self.numLinks:\\n print(\\\"Warning: Number of links given in network file %d different than metadata value %d\\\" % (len(self.link), self.numLinks))\\n self.numLinks = len(self.link)\\n if self.numZones != None and len([i for i in self.node if self.node[i].isZone == True]) != self.numZones:\\n print(\\\"Warning: Number of zones given in network file %d different than metadata value %d\\\" % (len([i for i in self.node if self.node[i].isZone == True]), self.numZones))\\n self.numLinks = len(self.link)\\n if self.totalDemandCheck != None:\\n if self.totalDemand != self.totalDemandCheck:\\n print(\\\"Warning: Total demand is %f compared to metadata value %f\\\" % ( self.totalDemand, self.totalDemandCheck))\",\n \"def consolidation_heuristics(to_print = False):\\n # Instantiate the data problem.\\n data = create_data_model()\\n # Create the routing index manager.\\n manager = pywrapcp.RoutingIndexManager(len(data['distance_matrix']),\\n data['num_vehicles'], data['depot'])\\n # Create Routing Model.\\n routing = pywrapcp.RoutingModel(manager)\\n # Create and register a transit callback.\\n def distance_callback(from_index, to_index):\\n \\\"\\\"\\\"Returns the distance between the two nodes.\\\"\\\"\\\"\\n # Convert from routing variable Index to distance matrix NodeIndex.\\n from_node = manager.IndexToNode(from_index)\\n to_node = manager.IndexToNode(to_index)\\n return data['distance_matrix'][from_node][to_node]\\n def pending_callback(from_index, to_index):\\n \\\"\\\"\\\"Returns the distance between the two nodes.\\\"\\\"\\\"\\n # Convert from routing variable Index to distance matrix NodeIndex.\\n from_node = manager.IndexToNode(from_index)\\n to_node = manager.IndexToNode(to_index)\\n return data['post'][to_node]\\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\\n pending_callback_index = routing.RegisterTransitCallback(pending_callback)\\n # Define cost of each arc.\\n for i in range(data['num_vehicles']-1):\\n routing.SetArcCostEvaluatorOfVehicle(transit_callback_index, i) #Transit cost\\n routing.SetFixedCostOfVehicle(data['fixed_cost'], i) #Fixed cost\\n routing.SetArcCostEvaluatorOfVehicle(pending_callback_index, data['num_vehicles']-1) #Postponement and/or NonService cost\\n # Add Capacity constraint.\\n def demand_callback(from_index): #\\n \\\"\\\"\\\"Returns the demand of the node.\\\"\\\"\\\"\\n # Convert from routing variable Index to demands NodeIndex.\\n from_node = manager.IndexToNode(from_index) \\n return data['demands'][from_node]\\n demand_callback_index = routing.RegisterUnaryTransitCallback(\\n demand_callback)\\n routing.AddDimensionWithVehicleCapacity(\\n demand_callback_index,\\n 0, # null capacity slack\\n data['vehicle_capacities'], # vehicle maximum capacities\\n True, # start cumul to zero\\n 'Capacity')\\n # Add time constraint.\\n def time_callback(from_index,to_index): #\\n \\\"\\\"\\\"Returns the demand of the node.\\\"\\\"\\\"\\n # Convert from routing variable Index to NodeIndex in time\\n from_node = manager.IndexToNode(from_index)\\n to_node = manager.IndexToNode(to_index)\\n return time_matrix[from_node][to_node] \\n time_callback_index = routing.RegisterTransitCallback(time_callback) \\n routing.AddDimensionWithVehicleCapacity(\\n time_callback_index,\\n 0, # null capacity slack\\n data['time_capacities'], # vehicle maximum capacities\\n True, # start cumul to zero\\n 'Time')\\n # Setting solution heuristic-procedure.\\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\\n search_parameters.local_search_metaheuristic = (\\n routing_enums_pb2.LocalSearchMetaheuristic.GUIDED_LOCAL_SEARCH)\\n search_parameters.time_limit.seconds = 5 #10 # 60 #20 #3000\\n search_parameters.log_search = True\\n # Solve the problem.\\n assignment = routing.SolveWithParameters(search_parameters)\\n # Print solution on console.\\n if assignment:\\n sent, sol_results, routes_results = print_solution(data, manager, routing, assignment) \\n return sent, sol_results, routes_results\",\n \"def verify_pln(self):\\n\\n warnings = []\\n\\n self._populate_uncertainties()\\n\\n # The transitref and transiturl actually end up stored in the 'transit'\\n # ExoParam due to the ref and url splits. Pull these out and set the\\n # transit entries to the proper pointers.\\n if self.transit.value == 1:\\n if is_empty(self.transit.reference):\\n self.transit.reference = \\\"__TRANSITREF\\\"\\n if is_empty(self.transit.url):\\n self.transit.url = \\\"__TRANSITURL\\\"\\n\\n # If the transit depth is not provided, but an Rp/R* ratio is,\\n # calculate the depth value.\\n if is_empty(self.depth.value) and is_valid(self.rr.value):\\n self.depth.value = self.rr.value ** 2\\n if isinstance(self.rr.uncertainty, Decimal):\\n self.depth.uncertainty = self.rr.uncertainty * 2\\n if isinstance(self.rr.uncertainty_upper, Decimal):\\n self.depth.uncertainty_upper = self.rr.uncertainty_upper * 2\\n self.depth.reference = \\\"Calculated from Rp/R*\\\"\\n self.depth.url = self.rr.reference\\n\\n # If the orbital eccentricity value is 0 and a TT value is provided,\\n # use the same values for T0 as well.\\n if self.ecc.value == Decimal(0) and is_empty(self.om.value):\\n self.om.value = Decimal(90)\\n self.om.reference = \\\"Set to 90 deg with ecc~0\\\"\\n print(\\\"set omega to 90\\\")\\n if is_valid(self.tt.value):\\n print(\\\"copying TT to T0\\\")\\n self.t0.copy_values(self.tt)\\n # OM may already be set to 90.\\n elif self.ecc.value == 0 and self.om.value == 90:\\n if str(self.tt.value) != \\\"NaN\\\":\\n print(\\\"copying TT to T0\\\")\\n self.t0.copy_values(self.tt)\\n\\n # Set the FREEZE_ECC flag if ECC=0 and no uncertainty is provided.\\n if self.ecc.value == 0 and is_empty(self.ecc.uncertainty):\\n self.freeze_ecc.value = 1\\n\\n # Set the MULT flag if NCOMP is more than 1 planet.\\n if self.ncomp.value > 1:\\n self.mult.value = 1\\n\\n # Set the TREND flag if a DVDT value is provided.\\n if not is_empty(self.dvdt.value):\\n self.trend.value = 1\\n\\n # Exclude planets with period uncertainty >10%.\\n self.per.check_constrained(0.1)\\n if not self.per.well_constrained:\\n self.exclude()\\n warnings.append(\\\"<uncertain PER>\\\")\\n\\n # Warn of planets with K speeds <2 m/s.\\n if is_valid(self.k.value):\\n if self.k.value < 2:\\n # self.exclude()\\n warnings.append(\\\"<low K value>\\\")\\n\\n # Make sure RA string uses spaces.\\n if not is_empty(self.ra_string.value):\\n if \\\"h\\\" in self.ra_string.value:\\n new_value = self.ra_string.value.replace(\\\"h\\\", \\\" \\\")\\n new_value = new_value.replace(\\\"m\\\", \\\" \\\")\\n new_value = new_value.replace(\\\"s\\\", \\\"\\\")\\n self.ra_string.value = new_value\\n\\n # Make sure DEC string uses spaces.\\n if not is_empty(self.dec_string.value):\\n if \\\"d\\\" in self.dec_string.value:\\n new_value = self.dec_string.value.replace(\\\"d\\\", \\\" \\\")\\n new_value = new_value.replace(\\\"m\\\", \\\" \\\")\\n new_value = new_value.replace(\\\"s\\\", \\\"\\\")\\n self.dec_string.value = new_value\\n\\n # Display warnings generated by final adjustments.\\n if len(warnings) > 0:\\n print(\\\"<<<{0} GOT {1} WARNING(S)>>>\\\".format(self.name.value,\\n len(warnings)\\n )\\n )\\n [print(x) for x in warnings]\",\n \"def check_required_parameters(required_params_dict=dict()):\\r\\n print threading.currentThread().getName(), 'Starting'\\r\\n is_valid = True\\r\\n required_params_not_set = pythontools.validate_required_parameters(required_params_dict)\\r\\n if len(required_params_not_set) > 0:\\r\\n is_valid = False\\r\\n msg = \\\"Validate all required input parameters are set failed.\\\"\\r\\n for param in required_params_not_set:\\r\\n steplog.error(\\\"Required parameter %s is not set.\\\" % param)\\r\\n else:\\r\\n msg = \\\"Validate all required input parameters are set succeeded.\\\"\\r\\n return is_valid, msg\",\n \"def input_check(self):\\n\\n if self.species == 'He': assert self.line_model == 'voigt'\\n n_upper_range, e_dens_range, temp_range, b_field_range = get_param_ranges(self.line_model)\\n\\n if np.isnan(n_upper_range).sum() <= 1:\\n assert (self.n_upper in range(n_upper_range[0], n_upper_range[1]))\\n if np.isnan(e_dens_range).sum() <= 1:\\n assert (e_dens_range[0] <= self.e_dens <= e_dens_range[1])\\n if np.isnan(temp_range).sum() <= 1:\\n assert (temp_range[0] <= self.temp <= temp_range[1])\\n if np.isnan(b_field_range).sum() <= 1:\\n assert (b_field_range[0] <= self.b_field <= b_field_range[1])\",\n \"def route_info(g, journey):\\n distance = 0\\n cost = 0.00\\n time = 0\\n check = 0\\n \\n for i in range(0, len(journey) - 1):\\n city_name = journey[i]\\n city_next = journey[i + 1]\\n code_city = g.convert[city_name] \\n code_next = g.convert[city_next]\\n \\n for flight in g.city_dict[code_city].get_flights_out():\\n if(flight[0] == code_next):\\n distance = distance + flight[1]\\n time = time + route_info_helper(g, code_city, code_next, flight[1])\\n if(i < 7):\\n cost = cost + (distance * (0.35 - (i * 0.05)))\\n \\n check = check + 1\\n if((check + 1) == len(journey)):\\n return distance, cost, time\\n else:\\n print(\\\"Invalid Route\\\")\\n return 0, 0, 0\",\n \"def print_and_save_solution(data, manager, routing, assignment):\\n total_distance = 0\\n total_load = 0\\n routes = []\\n for vehicle_id in range(data['num_vehicles']):\\n route = []\\n index = routing.Start(vehicle_id)\\n plan_output = 'Route for vehicle {}:\\\\n'.format(vehicle_id)\\n route_distance = 0\\n route_load = 0\\n while not routing.IsEnd(index):\\n node_index = manager.IndexToNode(index)\\n route_load += data['demands'][node_index]\\n plan_output += ' {0} Load({1}) -> '.format(node_index, route_load)\\n previous_index = index\\n index = assignment.Value(routing.NextVar(index))\\n route_distance += routing.GetArcCostForVehicle(\\n previous_index, index, vehicle_id)\\n point = data['all_points'][node_index]\\n point['load'] = route_load\\n route.append(point)\\n plan_output += ' {0} Load({1})\\\\n'.format(manager.IndexToNode(index),\\n route_load)\\n plan_output += 'Distance of the route: {}m\\\\n'.format(route_distance)\\n plan_output += 'Load of the route: {}\\\\n'.format(route_load)\\n print(plan_output)\\n total_distance += route_distance\\n total_load += route_load\\n if route_load > 0:\\n routes.append({\\n 'stops': route,\\n 'distance': route_distance,\\n 'load': route_load,\\n 'number_of_stops': len(route)\\n })\\n print('Total distance of all routes: {}m'.format(total_distance))\\n print('Total load of all routes: {}'.format(total_load))\\n with open('./results/capacity_{}_{}.json'.format(DRONES_CAPACITY, MAX_POINT_DEMAND), 'w') as f:\\n simplejson.dump({\\n 'routes': routes,\\n 'total_load': total_load,\\n 'total_distance': total_distance,\\n 'number_of_drones_used': len(routes),\\n 'total_numer_of_stops': sum([x['number_of_stops'] for x in routes])\\n }, f)\",\n \"def print_solution(self):\\n print(f'Objective: {self.solution.ObjectiveValue()}')\\n total_distance = 0\\n total_load = 0\\n max_route_distance = 0\\n for vehicle_id in range(self.data['num_vehicles']):\\n index = self.routingManager.Start(vehicle_id)\\n plan_output = 'Route for vehicle {}:\\\\n'.format(vehicle_id)\\n route_distance = 0\\n route_load = 0\\n while not self.routingManager.IsEnd(index):\\n node_index = self.manager.IndexToNode(index)\\n route_load += self.data['demands'][node_index]\\n plan_output += ' {0} Load({1}) -> '.format(self.data['names'][node_index], route_load)\\n\\n previous_index = index\\n index = self.solution.Value(self.routingManager.NextVar(index))\\n route_distance += self.routingManager.GetArcCostForVehicle(\\n previous_index, index, vehicle_id\\n )\\n print(route_distance)\\n\\n plan_output += '{0}, Load({1}) \\\\n '.format(self.data['names'][self.manager.IndexToNode(index)], route_load)\\n\\n plan_output += 'Distance of the route: {}\\\\n'.format(route_distance)\\n plan_output += 'Load of the route: {}\\\\n'.format(route_load)\\n\\n print(plan_output)\\n total_distance += route_distance\\n total_load += route_load\\n\\n print('Total distance of all routes: {}km'.format(total_distance))\\n print('Total load of all routes: {}'.format(total_load))\",\n \"def check_error(self):\\n refine_results = {}\\n for phase_path, phase in self.phases.items():\\n refine_results[phase_path] = {}\\n\\n # Save the original grid to the refine results\\n tx = phase.options['transcription']\\n gd = tx.grid_data\\n num_nodes = gd.subset_num_nodes['all']\\n numseg = gd.num_segments\\n\\n refine_results[phase_path]['num_segments'] = numseg\\n refine_results[phase_path]['order'] = gd.transcription_order\\n refine_results[phase_path]['segment_ends'] = gd.segment_ends\\n refine_results[phase_path]['need_refinement'] = np.zeros(numseg, dtype=bool)\\n refine_results[phase_path]['error'] = np.zeros(numseg, dtype=float)\\n\\n if isinstance(tx, dm.RungeKutta):\\n continue\\n\\n outputs = phase.list_outputs(units=False, out_stream=None)\\n\\n out_values_dict = {k: v['value'] for k, v in outputs}\\n\\n prom_to_abs_map = phase._var_allprocs_prom2abs_list['output']\\n\\n num_scalar_states = 0\\n for state_name, options in phase.state_options.items():\\n shape = options['shape']\\n size = np.prod(shape)\\n num_scalar_states += size\\n\\n x = np.zeros([num_nodes, num_scalar_states])\\n f = np.zeros([num_nodes, num_scalar_states])\\n c = 0\\n\\n # Obtain the solution on the current grid\\n for state_name, options in phase.state_options.items():\\n prom_name = f'timeseries.states:{state_name}'\\n abs_name = prom_to_abs_map[prom_name][0]\\n rate_source_prom_name = f\\\"timeseries.state_rates:{state_name}\\\"\\n rate_abs_name = prom_to_abs_map[rate_source_prom_name][0]\\n x[:, c] = out_values_dict[prom_name].ravel()\\n f[:, c] = out_values_dict[rate_source_prom_name].ravel()\\n c += 1\\n\\n # Obtain the solution on the new grid\\n # interpolate x at t_hat\\n new_order = gd.transcription_order + 1\\n # Gauss-Lobatto does not allow even orders so increase order by 2 instead\\n if gd.transcription == 'gauss-lobatto':\\n new_order += 1\\n new_grid = GridData(numseg, gd.transcription, new_order, gd.segment_ends, gd.compressed)\\n left_end_idxs = new_grid.subset_node_indices['segment_ends'][0::2]\\n left_end_idxs = np.append(left_end_idxs, new_grid.subset_num_nodes['all'] - 1)\\n\\n L = interpolation_lagrange_matrix(gd, new_grid)\\n I = integration_matrix(new_grid)\\n\\n # Call the ODE at all nodes of the new grid\\n x_hat, x_prime = self.eval_ode(phase, new_grid, L, I)\\n E = {}\\n e = {}\\n err_over_states = {}\\n for state_name, options in phase.state_options.items():\\n E[state_name] = np.absolute(x_prime[state_name] - x_hat[state_name])\\n for k in range(0, numseg):\\n e[state_name] = E[state_name]/(1 + np.max(x_hat[state_name][left_end_idxs[k]:left_end_idxs[k + 1]]))\\n err_over_states[state_name] = np.zeros(numseg)\\n\\n for state_name, options in phase.state_options.items():\\n for k in range(0, numseg):\\n err_over_states[state_name][k] = np.max(e[state_name][left_end_idxs[k]:left_end_idxs[k + 1]])\\n\\n self.error[phase_path] = np.zeros(numseg)\\n refine_results[phase_path]['error'] = np.zeros(numseg)\\n refine_results[phase_path]['need_refinement'] = np.zeros(numseg, dtype=bool)\\n\\n # Assess the errors in each state\\n for state_name, options in phase.state_options.items():\\n for k in range(0, numseg):\\n if err_over_states[state_name][k] > self.error[phase_path][k]:\\n self.error[phase_path][k] = err_over_states[state_name][k]\\n refine_results[phase_path]['error'][k] = err_over_states[state_name][k]\\n if self.error[phase_path][k] > phase.refine_options['tolerance']:\\n refine_results[phase_path]['need_refinement'][k] = True\\n\\n return refine_results\",\n \"def evaluateAllRroutes(self):\\n isTrain = 1 # 1 for train, 0 for test\\n\\n performance = 0\\n normalizedPerformance = 0\\n priceTolerance = 5 # price to be tolerated\\n\\n normPerforms = []\\n for i in range(8):\\n print \\\"Route: {}\\\".format(i)\\n [perfor, normaPerfor] = self.evaluateOneRouteForMultipleTimes(self.routes[i], priceTolerance)\\n normPerforms.append(normaPerfor)\\n performance += perfor\\n normalizedPerformance += normaPerfor\\n\\n performance = round(performance/8, 2)\\n normalizedPerformance = round(normalizedPerformance/8, 2)\\n\\n if self.isTrain:\\n print \\\"\\\\nTRAIN:\\\"\\n else:\\n print \\\"\\\\nTEST:\\\"\\n print \\\"Average Performance: {}%\\\".format(performance)\\n print \\\"Average Normalized Performance: {}%\\\".format(normalizedPerformance)\\n print \\\"Normalized Performance Variance: {}\\\".format(np.var(normPerforms))\",\n \"def __init__( # pylint: disable=too-many-locals, too-many-arguments\\r\\n self, pair_type_str, origins, origin_id_field, destinations, dest_id_field,\\r\\n network_data_source, travel_mode, time_units, distance_units,\\r\\n max_routes, max_processes, out_routes, scratch_folder, reverse_direction=False,\\r\\n assigned_dest_field=None, od_pair_table=None, time_of_day=None, barriers=None\\r\\n ):\\r\\n pair_type = helpers.PreassignedODPairType[pair_type_str]\\r\\n self.origins = origins\\r\\n self.destinations = destinations\\r\\n self.out_routes = out_routes\\r\\n self.scratch_folder = scratch_folder\\r\\n time_units = helpers.convert_time_units_str_to_enum(time_units)\\r\\n distance_units = helpers.convert_distance_units_str_to_enum(distance_units)\\r\\n if not barriers:\\r\\n barriers = []\\r\\n self.max_processes = max_processes\\r\\n if not time_of_day:\\r\\n time_of_day = None\\r\\n else:\\r\\n time_of_day = datetime.datetime.strptime(time_of_day, helpers.DATETIME_FORMAT)\\r\\n\\r\\n # Initialize the dictionary of inputs to send to each OD solve\\r\\n self.rt_inputs = {\\r\\n \\\"pair_type\\\": pair_type,\\r\\n \\\"origins\\\": self.origins,\\r\\n \\\"origin_id_field\\\": origin_id_field,\\r\\n \\\"destinations\\\": self.destinations,\\r\\n \\\"dest_id_field\\\": dest_id_field,\\r\\n \\\"network_data_source\\\": network_data_source,\\r\\n \\\"travel_mode\\\": travel_mode,\\r\\n \\\"time_units\\\": time_units,\\r\\n \\\"distance_units\\\": distance_units,\\r\\n \\\"time_of_day\\\": time_of_day,\\r\\n \\\"reverse_direction\\\": reverse_direction,\\r\\n \\\"scratch_folder\\\": self.scratch_folder,\\r\\n \\\"assigned_dest_field\\\": assigned_dest_field,\\r\\n \\\"od_pair_table\\\": od_pair_table,\\r\\n \\\"barriers\\\": barriers,\\r\\n \\\"origin_transfer_fields\\\": [], # Populate later\\r\\n \\\"destination_transfer_fields\\\": [] # Populate later\\r\\n }\\r\\n\\r\\n # List of intermediate output OD Line files created by each process\\r\\n self.route_fcs = []\\r\\n\\r\\n # Construct OID ranges for chunks of origins and destinations\\r\\n if pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n # Chunks are of the format [first origin ID, second origin ID]\\r\\n self.chunks = helpers.get_oid_ranges_for_input(origins, max_routes)\\r\\n elif pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n # Chunks are of the format [chunk_num, chunk_size]\\r\\n num_od_pairs = 0\\r\\n with open(od_pair_table, \\\"r\\\", encoding=\\\"utf-8\\\") as f:\\r\\n for _ in f:\\r\\n num_od_pairs += 1\\r\\n num_chunks = ceil(num_od_pairs / max_routes)\\r\\n self.chunks = [[i, max_routes] for i in range(num_chunks)]\\r\\n\\r\\n # Calculate the total number of jobs to use in logging\\r\\n self.total_jobs = len(self.chunks)\\r\\n\\r\\n self.optimized_cost_field = None\",\n \"def validate(self, request):\\n values = {\\n 'robot_match_comments':request.POST['robot_match_comments'],\\n 'did_foul':'did_foul' in request.POST,\\n 'did_technical_foul':'did_technical_foul' in request.POST,\\n 'foul_description':request.POST['foul_description'],\\n 'did_shoot':'did_shoot' in request.POST,\\n 'auto_1':request.POST['auto_1'],\\n 'auto_2':request.POST['auto_2'],\\n 'auto_3':request.POST['auto_3'],\\n 'auto_miss':request.POST['auto_miss'],\\n 'teleop_1':request.POST['teleop_1'],\\n 'teleop_2':request.POST['teleop_2'],\\n 'teleop_3':request.POST['teleop_3'],\\n 'teleop_5':request.POST['teleop_5'],\\n 'teleop_miss':request.POST['teleop_miss'],\\n 'shooting_description':request.POST['shooting_description'],\\n 'did_climb':'did_climb' in request.POST,\\n 'climb_start':request.POST['climb_start'],\\n 'climb_finish':request.POST['climb_finish'],\\n 'level_reached':request.POST.get('level_reached'),\\n 'frisbees_dumped':request.POST['frisbees_dumped'],\\n 'climbing_description':request.POST['climbing_description'],\\n 'did_human_load':'did_human_load' in request.POST,\\n 'did_ground_load':'did_ground_load' in request.POST,\\n 'auto_frisbees_ground_loaded':\\\\\\n request.POST['auto_frisbees_ground_loaded'],\\n 'loading_description':request.POST['loading_description'],\\n }\\n if ((values['did_foul'] or values['did_technical_foul']) and\\n not values['foul_description']):\\n new_values = self.__dict__.copy()\\n new_values.update(values)\\n raise ValidationError(\\n 'Please enter a description of the foul(s) the robot committed',\\n new_values\\n )\\n if values['did_shoot']:\\n try:\\n values['auto_1'] = int(values['auto_1'])\\n values['auto_2'] = int(values['auto_2'])\\n values['auto_3'] = int(values['auto_3'])\\n values['auto_miss'] = int(values['auto_miss'])\\n values['teleop_1'] = int(values['teleop_1'])\\n values['teleop_2'] = int(values['teleop_2'])\\n values['teleop_3'] = int(values['teleop_3'])\\n values['teleop_5'] = int(values['teleop_5'])\\n values['teleop_miss'] = int(values['teleop_miss'])\\n except ValueError:\\n raise ValidationError(\\n 'You must enter a number for all of the shooting numbers',\\n self.__dict__.copy().update(values)\\n )\\n if values['did_climb']:\\n try:\\n values['climb_start'] = int(values['climb_start'])\\n values['climb_finish'] = int(values['climb_finish'])\\n try:\\n values['level_reached'] = int(values['level_reached'])\\n except TypeError:\\n new_values = self.__dict__.copy()\\n new_values.update(values)\\n raise ValidationError(\\n 'You must select a level the robot climbed too',\\n new_values\\n )\\n values['frisbees_dumped'] = int(values['frisbees_dumped'])\\n except ValueError:\\n new_values = self.__dict__.copy()\\n new_values.update(values)\\n raise ValidationError(\\n 'All climbing related numbers must be numbers',\\n new_values\\n )\\n if values['did_ground_load']:\\n try:\\n values['auto_frisbees_ground_loaded'] = int(\\n values['auto_frisbees_ground_loaded'])\\n except ValueError:\\n new_values = self.__dict__.copy()\\n new_values.update(values)\\n raise ValidationError(\\n 'All numbers of frisbees ground loaded must be numbers',\\n new_values\\n )\\n return values\",\n \"def readOptimizationResultsFile(self):\\n requiredLineNo = 0\\n self.createParamters()\\n \\n self.optimizationResultsFile = open(self.fileName, 'r')\\n \\n for lineIndex, line in enumerate(self.optimizationResultsFile):\\n if lineIndex == 0:\\n startingPhase1, startingPhase2 = line.split()\\n self.startingPhase1, self.startingPhase2 = int(startingPhase1), int(startingPhase2)\\n\\n elif lineIndex == 1:\\n init1, init2, elapsedGreen1, elapsedGreen2 = line.split()\\n self.init1, self.init2 = float(init1), float(init2)\\n\\n elif lineIndex == 2:\\n self.processPhaseDuration(line, self.leftCriticalPointsRing1, self.leftCriticalPointsRing2)\\n self.processPhaseSequence()\\n\\n elif lineIndex == 3:\\n self.processPhaseDuration(line, self.leftCriticalPointsRing1, self.leftCriticalPointsRing2)\\n self.processPhaseSequence()\\n\\n elif lineIndex == 4:\\n self.processPhaseDuration(line, self.leftCriticalPointsRing1, self.leftCriticalPointsRing2)\\n self.processPhaseSequence()\\n\\n elif lineIndex == 5:\\n self.processPhaseDuration(line, self.rightCriticalPointsRing1, self.rightCriticalPointsRing2)\\n\\n elif lineIndex == 6:\\n self.processPhaseDuration(line, self.rightCriticalPointsRing1, self.rightCriticalPointsRing2)\\n\\n elif lineIndex == 7:\\n self.processPhaseDuration(line, self.rightCriticalPointsRing1, self.rightCriticalPointsRing2)\\n\\n elif lineIndex == 14:\\n noOfRequest = int(line)\\n requiredLineNo = 15 + noOfRequest\\n # break\\n \\n elif lineIndex >=15 and lineIndex < requiredLineNo:\\n self.getPriorityRequests(line)\\n \\n elif lineIndex >=15 and lineIndex >= requiredLineNo:\\n break\\n # self.optimizationResultsFile = open(self.fileName, 'r')\\n # for i, line in enumerate(self.optimizationResultsFile):\\n # if i in range(15, requiredLineNo):\\n\\n self.optimizationResultsFile.close()\\n # self.getPriorityRequests(requiredLineNo)\\n \\n self.getCummulativeValues()\\n self.generateTimePhaseDiagram()\",\n \"def check_required_props(self,\\n df,\\n node,\\n dd,\\n exclude_props = [ # submitters don't provide these properties, so remove them from QC check\\n # case props not provided by submitters\\n \\\"datasets.submitter_id\\\",\\n \\\"token_record_id\\\",\\n \\\"linked_external_data\\\",\\n #series_file props not provided by submitters\\n \\\"file_name\\\",\\n \\\"md5sum\\\",\\n \\\"file_size\\\",\\n \\\"object_id\\\",\\n \\\"storage_urls\\\",\\n \\\"core_metadata_collections.submitter_id\\\",\\n \\\"core_metadata_collections\\\",\\n \\\"associated_ids\\\",\\n #imaging_study props not provided by submitters\\n \\\"loinc_code\\\",\\n \\\"loinc_system\\\",\\n \\\"loinc_contrast\\\",\\n \\\"loinc_long_common_name\\\",\\n \\\"loinc_method\\\",\\n \\\"days_from_study_to_neg_covid_test\\\",\\n \\\"days_from_study_to_pos_covid_test\\\"\\n ]\\n ):\\n errors = []\\n links = self.list_links(node, dd)\\n any_na = df.columns[df.isna().any()].tolist()\\n required_props = list(set(dd[node]['required']).difference(links).difference(exclude_props))\\n for prop in required_props:\\n if prop not in df:\\n error = \\\"{} TSV does not have required property header '{}'!\\\".format(node,prop)\\n print(error)\\n errors.append(error)\\n elif prop in any_na:\\n error = \\\"{} TSV does not have complete data for required property '{}'!\\\".format(node,prop)\\n print(error)\\n errors.append(error)\\n return errors\",\n \"def check_data_params(self, out_log, err_log):\\n self.io_dict[\\\"in\\\"][\\\"input_dataset_path\\\"] = check_input_path(self.io_dict[\\\"in\\\"][\\\"input_dataset_path\\\"], \\\"input_dataset_path\\\", out_log, self.__class__.__name__)\\n self.io_dict[\\\"out\\\"][\\\"output_results_path\\\"] = check_output_path(self.io_dict[\\\"out\\\"][\\\"output_results_path\\\"], \\\"output_results_path\\\", False, out_log, self.__class__.__name__)\\n if self.io_dict[\\\"out\\\"][\\\"output_plot_path\\\"]:\\n self.io_dict[\\\"out\\\"][\\\"output_plot_path\\\"] = check_output_path(self.io_dict[\\\"out\\\"][\\\"output_plot_path\\\"], \\\"output_plot_path\\\", True, out_log, self.__class__.__name__)\",\n \"def check_if_repeated_route(route, user_lat, user_lon):\\n bus_route = route\\n repeated_routes = {'101':'','105':'','106':'','107':'','230':'','111':'','113':'','116':'','119':'','240':'','120':'','271':'','70':'','2':'pt','7':'','8':'','18':'','29':'','1':'pt','3':'pt','4':'pt','402':'pt','425':'pt','202':'pt','212':'pt','214':'pt','102':'pt','10':'pt','11':'pt','13':'','28':'pt','41':'','45':'','55':'pt','57':'pt','63':'pt','47':'','48':'','60':'','64':'','67':'','42':'','12':'','21':''}\\n intercity_transit = ['47','48','60','64','67','42','12','13','21','41','45']\\n king_county_metro = ['917', 'A Line', '225', '231', '239', '230', '250', '37', '910', '628', '372', '373', '630', '218', '631', '63', '4', '36', '43', '986', '823', '44', '987', '212', '45', '988', 'Trailhead Direct Issaquah Alps', '989', '824', '214', '47', '180', '48', '635', '216', '5', '217', '982', '41', '21', '984', 'F Line', 'E Line', '342', '345', '346', '952', '347', '894', '348', '49', '248', '355', '895', '116', '243', '245', '893', '118', '246', '661', '931', '119', '67', '915', '12', '249', '120', '238', '62', '226', '111', '24', '64', '193', '113', '240', '65', '930', '241', '114', '255', '73', '128', '74', '257', '75', '13', '907', '121', '122', '7', '123', '252', '70', '124', '71', '125', '221', '244', 'Trailhead Direct Cougar Mt.', '55', '994', '50', '995', 'Trailhead Direct Mailbox Peak', '219', '981', 'Trailhead Direct Mt. Si', '22', '224', '157', '204', '101', '232', '102', '105', '57', '106', '234', '156', '107', '235', '236', '60', '980', '237', 'B Line', '11', '775', '56', '1', '10', '166', '167', '903', '158', '908', '159', '3', '906', '301', '913', '914', '303', '164', '304', '916', '901', '178', '169', '308', '17', '309', '31', '311', '312', '177', '168', '629', 'Duvall-Monroe Shuttle', '268', '14', '76', '77', '131', '26', '773', '29', '132', '78', '40', '8', '887', 'C Line', '277', '9', '153', '28', '154', '269', 'D Line', '27', '143', '271', '886', '148', '888', '889', '15', '150', '891', '892', '208', '200', '181', '32', '182', '33', '183', '330', '331', '186', '187', '316', '179', '18', '192', '197', '2', '19', '190']\\n pierce_transit = ['1','2','3','4','402','425','202','212','214','102','10','11','13','28','41','45','48','55','57','63']\\n north_routes = ['101','105','106','107','230','111','113','116','119','240','120','271','70','2','3','4','7','8','12','18','29']\\n \\n if bus_route in repeated_routes:\\n if user_lon < -122.5 and user_lat > 47.1:\\n # going to be pierce county (or kitsap)\\n if bus_route in pierce_transit: \\n bus_route += 'pt'\\n else:\\n bus_route += repeated_routes[bus_route]\\n elif user_lat > 47.7:\\n # going to be community transit or everett transit (N)\\n if bus_route in north_routes: \\n bus_route += 'N'\\n else:\\n bus_route += repeated_routes[bus_route] \\n elif user_lat > 47.33:\\n # going to be king county metro\\n if bus_route in king_county_metro:\\n bus_route = bus_route\\n else:\\n bus_route += repeated_routes[bus_route]\\n elif user_lat > 47.08:\\n # going to be pierce transit\\n if bus_route in pierce_transit: \\n bus_route += 'pt'\\n else:\\n bus_route += repeated_routes[bus_route] \\n else:\\n # going to be intercity transit\\n if bus_route in intercity_transit: \\n bus_route += 'it'\\n else:\\n bus_route += repeated_routes[bus_route] \\n\\n return bus_route\",\n \"def _check_case_parameters_aero(subcase: Subcase, fem: BDF, sol: int,\\n ierror: int=0, nerrors: int=100,\\n stop_on_failure: bool=True) -> int:\\n log = fem.log\\n if 'TRIM' in subcase:\\n trim_id = subcase.get_parameter('TRIM')[0]\\n if trim_id not in fem.trims:\\n msg = (\\n f'SOL={sol}\\\\n'\\n f'TRIM = {trim_id}\\\\n'\\n f'trims={fem.trims}\\\\n'\\n f'subcase:\\\\n{subcase}')\\n log_error(sol, [144, 200], msg, log)\\n else:\\n trim = fem.trims[trim_id]\\n suport1 = None\\n if 'SUPORT1' in subcase:\\n suport_id = subcase.get_parameter('SUPORT1')[0]\\n suport1 = fem.suport1[suport_id]\\n try:\\n trim.verify_trim(\\n fem.suport, suport1, fem.aestats, fem.aeparams,\\n fem.aelinks, fem.aesurf, xref=True)\\n except RuntimeError:\\n if stop_on_failure or ierror == nerrors:\\n raise\\n ierror += 1\\n exc_info = sys.exc_info()\\n traceback.print_exception(*exc_info)\\n #traceback.print_stack()\\n #fem.log.error(e.msg)\\n #raise\\n assert 'DIVERG' not in subcase, subcase\\n #allowed_sols = [144, 200]\\n\\n if 'DIVERG' in subcase:\\n value = subcase.get_parameter('DIVERG')[0]\\n assert value in fem.divergs, 'value=%s\\\\n divergs=%s\\\\n subcase:\\\\n%s' % (value, str(fem.divergs), str(subcase))\\n assert 'TRIM' not in subcase, subcase\\n #allowed_sols = [144, 200]\\n\\n if 'FMETHOD' in subcase:\\n # FLUTTER\\n fmethod_id = subcase.get_parameter('FMETHOD')[0]\\n unused_fmethod = fem.flutters[fmethod_id]\\n allowed_sols = [145, 200]\\n ierror = check_sol(sol, subcase, allowed_sols, 'FMETHOD', log, ierror, nerrors)\\n return ierror\",\n \"def solve_route_in_parallel(self):\\r\\n # Validate Route settings. Essentially, create a dummy Route class instance and set up the\\r\\n # solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes\\r\\n # that are guaranteed to all fail.\\r\\n self._validate_route_settings()\\r\\n\\r\\n # Check if the input origins and destinations have any fields we should use in the route analysis\\r\\n self._populate_input_data_transfer_fields()\\r\\n\\r\\n # Compute Route in parallel\\r\\n LOGGER.info(f\\\"Beginning parallelized Route solves ({self.total_jobs} chunks)\\\")\\r\\n completed_jobs = 0 # Track the number of jobs completed so far to use in logging\\r\\n # Use the concurrent.futures ProcessPoolExecutor to spin up parallel processes that solve the routes\\r\\n with futures.ProcessPoolExecutor(max_workers=self.max_processes) as executor:\\r\\n # Each parallel process calls the solve_route() function with the rt_inputs dictionary for the\\r\\n # given origin ranges and their assigned destinations.\\r\\n jobs = {executor.submit(solve_route, self.rt_inputs, range): range for range in self.chunks}\\r\\n # As each job is completed, add some logging information and store the results to post-process later\\r\\n for future in futures.as_completed(jobs):\\r\\n try:\\r\\n # The Route job returns a results dictionary. Retrieve it.\\r\\n result = future.result()\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # If we couldn't retrieve the result, some terrible error happened and the job errored.\\r\\n # Note: This does not mean solve failed. It means some unexpected error was thrown. The most likely\\r\\n # causes are:\\r\\n # a) If you're calling a service, the service was temporarily down.\\r\\n # b) You had a temporary file read/write or resource issue on your machine.\\r\\n # c) If you're actively updating the code, you introduced an error.\\r\\n # To make the tool more robust against temporary glitches, retry submitting the job up to the number\\r\\n # of times designated in helpers.MAX_RETRIES. If the job is still erroring after that many retries,\\r\\n # fail the entire tool run.\\r\\n errs = traceback.format_exc().splitlines()\\r\\n failed_range = jobs[future]\\r\\n LOGGER.debug((\\r\\n f\\\"Failed to get results for Route chunk {failed_range} from the parallel process. Will retry \\\"\\r\\n f\\\"up to {helpers.MAX_RETRIES} times. Errors: {errs}\\\"\\r\\n ))\\r\\n job_failed = True\\r\\n num_retries = 0\\r\\n while job_failed and num_retries < helpers.MAX_RETRIES:\\r\\n num_retries += 1\\r\\n try:\\r\\n future = executor.submit(solve_route, self.rt_inputs, failed_range)\\r\\n result = future.result()\\r\\n job_failed = False\\r\\n LOGGER.debug(f\\\"Route chunk {failed_range} succeeded after {num_retries} retries.\\\")\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # Update exception info to the latest error\\r\\n errs = traceback.format_exc().splitlines()\\r\\n if job_failed:\\r\\n # The job errored and did not succeed after retries. Fail the tool run because something\\r\\n # terrible is happening.\\r\\n LOGGER.debug(f\\\"Route chunk {failed_range} continued to error after {num_retries} retries.\\\")\\r\\n LOGGER.error(\\\"Failed to get Route result from parallel processing.\\\")\\r\\n errs = traceback.format_exc().splitlines()\\r\\n for err in errs:\\r\\n LOGGER.error(err)\\r\\n raise\\r\\n\\r\\n # If we got this far, the job completed successfully and we retrieved results.\\r\\n completed_jobs += 1\\r\\n LOGGER.info(\\r\\n f\\\"Finished Route calculation {completed_jobs} of {self.total_jobs}.\\\")\\r\\n\\r\\n # Parse the results dictionary and store components for post-processing.\\r\\n if result[\\\"solveSucceeded\\\"]:\\r\\n self.route_fcs.append(result[\\\"outputRoutes\\\"])\\r\\n else:\\r\\n # Typically, a solve fails because no destinations were found for any of the origins in the chunk,\\r\\n # and this is a perfectly legitimate failure. It is not an error. However, they may be other, less\\r\\n # likely, reasons for solve failure. Write solve messages to the main GP message thread in debug\\r\\n # mode only in case the user is having problems. The user can also check the individual OD log\\r\\n # files.\\r\\n LOGGER.debug(f\\\"Solve failed for job id {result['jobId']}.\\\")\\r\\n LOGGER.debug(result[\\\"solveMessages\\\"])\\r\\n\\r\\n # Post-process outputs\\r\\n if self.route_fcs:\\r\\n LOGGER.info(\\\"Post-processing Route results...\\\")\\r\\n self.route_fcs = sorted(self.route_fcs)\\r\\n self._post_process_route_fcs()\\r\\n else:\\r\\n LOGGER.warning(\\\"All Route solves failed, so no output was produced.\\\")\\r\\n\\r\\n # Clean up\\r\\n # Delete the job folders if the job succeeded\\r\\n if DELETE_INTERMEDIATE_OUTPUTS:\\r\\n LOGGER.info(\\\"Deleting intermediate outputs...\\\")\\r\\n try:\\r\\n shutil.rmtree(self.scratch_folder, ignore_errors=True)\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # If deletion doesn't work, just throw a warning and move on. This does not need to kill the tool.\\r\\n LOGGER.warning(f\\\"Unable to delete intermediate Route output folder {self.scratch_folder}.\\\")\\r\\n\\r\\n LOGGER.info(\\\"Finished calculating Routes.\\\")\",\n \"def __init__(self):\\n self.parameter = [[(0,1),(1,1),(0,0),(1,0)],\\n [(1,0),(1,0),(0,1),(0,1)],\\n [(1,0),(0,1),(1,0),(0,1)],\\n [(0,0),(0,0),(0,0),(0,0)]]\\n \\\"\\\"\\\"Distance is number of whole route from origin to destination\\\"\\\"\\\"\\n self.distance = 100\\n \\\"\\\"\\\"action sets\\\"\\\"\\\"\\n self.action = [0,55,75]\\n self.maxSpeed = self.action[-1]\\n \\\"\\\"\\\"time period for each stage\\\"\\\"\\\"\\n self.time_interval = 0.5\\n \\\"\\\"\\\"Number of stages we want to check. Here we can use this to limit the\\n travel time, since sometimes we want driver to arrive in a time window.\\n For example, if stage is 4, that means we want to driver finish route within \\n 2 hours. \\\"\\\"\\\"\\n self.stage = 4\\n self.time_block = 0.5\\n self.distance_block = 25\",\n \"def _calculate_emissions(self):\\n parameters = self._get_pollutants_for_vehicle()\\n\\n self.routes = RouteSet()\\n\\n if \\\"routes\\\" not in self._json_data:\\n log.debug(\\\"Error in returned JSON data from web service.\\\")\\n log.debug(\\\"data: {}\\\".format(self._json_data))\\n return\\n\\n # Create a \\\"set\\\" of Routes. The planner web service will\\n # return 2-4 routes with different paths.\\n for idx, r in enumerate(self._json_data[\\\"routes\\\"][\\\"features\\\"]):\\n attributes = r.get(\\\"attributes\\\")\\n route = Route(distance=attributes.get(\\\"Total_Meters\\\"),\\n minutes=attributes.get(\\\"Total_Minutes\\\"),\\n path=r.get(\\\"geometry\\\").get(\\\"paths\\\")[0], id = idx)\\n self.routes.add(route)\\n\\n log.debug(\\\"Nr of routes: {}\\\".format(len(self.routes)))\\n for i, route in enumerate(self.routes):\\n # A list of x,y,z points that all together represents the route\\n path_coordinates = route.path\\n distances = []\\n\\n # Nifty little trick to loop over 'path_coordinates',\\n # but keep a reference to the 'prev' item to calculate the\\n # distance between them\\n iter_points = iter(path_coordinates)\\n prev = next(iter_points)\\n for point in path_coordinates:\\n if not distances:\\n # first point\\n distances.append(Planner._get_distance_3d(prev, point) / 1000)\\n else:\\n distances.append(distances[-1] + Planner._get_distance_3d(prev, point) / 1000)\\n\\n point_slope = Planner._get_slope(prev, point)\\n\\n # Calculate emission for each pollutants the user has asked for\\n for p in self._pollutants:\\n parms = [x for x in parameters if x.pollutant.name.startswith(p)]\\n calc_emission = self.get_emission(parms, point_slope)\\n route.add_pollutant(p, calc_emission)\\n\\n prev = point\\n\\n route.add_distances(distances)\",\n \"def validate(self, mode: QueryMode = \\\"batch\\\") -> Dict[str, Any]:\\n self._query_by_task_id = {}\\n explore_count = self._count_explores()\\n printer.print_header(\\n f\\\"Testing {explore_count} \\\"\\n f\\\"{'explore' if explore_count == 1 else 'explores'} \\\"\\n f\\\"[{mode} mode] \\\"\\n f\\\"[concurrency = {self.query_slots}]\\\"\\n )\\n\\n self._create_and_run(mode)\\n if mode == \\\"hybrid\\\" and self.project.errored:\\n self._create_and_run(mode)\\n\\n for model in sorted(self.project.models, key=lambda x: x.name):\\n for explore in sorted(model.explores, key=lambda x: x.name):\\n message = f\\\"{model.name}.{explore.name}\\\"\\n printer.print_validation_result(\\n passed=not explore.errored, source=message\\n )\\n\\n return self.project.get_results(mode)\",\n \"def checkParameters(self):\\n self.DEBUG(\\\"EDPluginExecDatGnomv1_0.checkParameters\\\")\\n self.checkMandatoryParameters(self.dataInput, \\\"Data Input is None\\\")\\n self.checkMandatoryParameters(self.dataInput.inputCurve, \\\"No input Curve file provided\\\")\",\n \"def _check_inputvalues(self):\\n # Check x, y and z are int or float dtypes\\n # ie do not contain any unusable values like strings\\n if not (self.x.dtype in [np.int, np.float]):\\n raise TypeError(\\\"Route input 'x' must be either int or float dtypes\\\")\\n\\n if not (self.y.dtype in [np.int, np.float]):\\n raise TypeError(\\\"Route input 'x' must be either int or float dtypes\\\")\\n\\n # Performs checks on z if not empty\\n if self.z is not None:\\n for v in self.z.values():\\n if not (v.dtype in [np.int, np.float]):\\n raise TypeError(\\\"Route input 'x' must be either int or float dtypes\\\")\",\n \"def check_is_ready(self):\\n self.logger.info(\\\"Checking optimization inputs for automatic design.\\\")\\n if self.optimization_graph is None:\\n raise RuntimeError(\\\"The optimization graph needs to be defined in order to optimize the network.\\\")\\n if self.network_objective is None:\\n raise RuntimeError(\\\"A network objective has to be set (in MW).\\\")\",\n \"def _checkSettings(self):\\n geomsThatNeedMeshSize = (\\\"1D slab\\\", \\\"1D cylinder\\\")\\n if self.geometry in geomsThatNeedMeshSize:\\n if self.meshSubdivisionsPerCm is None:\\n raise ValueError(\\n \\\"{} geometry requires `mesh points per cm` to be defined in cross sections.\\\".format(\\n self.geometry\\n )\\n )\\n if self.criticalBuckling != False:\\n raise ValueError(\\n \\\"{} geometry cannot model critical buckling. Please disable\\\".format(\\n self.geometry\\n )\\n )\",\n \"def validate(self):\\n super(ReferenceMapping, self).validate()\\n self.check_observatory()\\n self.check_instrument()\\n self.check_filekind()\\n self.check_schema_uri()\\n if \\\"reference_to_dataset\\\" in self.header:\\n parkeys = self.get_required_parkeys()\\n for _reference, dataset in self.reference_to_dataset.items():\\n assert dataset.upper() in parkeys, \\\\\\n \\\"reference_to_dataset dataset keyword not in parkey keywords.\\\"\\n with log.augment_exception(\\\"Invalid mapping:\\\", self.instrument, self.filekind):\\n self.selector.validate_selector(self.tpn_valid_values)\",\n \"def validate(self):\\n errors = []\\n app = errors.append\\n\\n if not self.hint_cores >= self.mpi_procs * self.omp_threads >= self.min_cores:\\n app(\\\"self.hint_cores >= mpi_procs * omp_threads >= self.min_cores not satisfied\\\")\\n\\n if self.omp_threads > self.hw.cores_per_node:\\n app(\\\"omp_threads > hw.cores_per_node\\\")\\n\\n if self.mem_per_proc > self.hw.mem_per_node:\\n app(\\\"mem_mb >= self.hw.mem_per_node\\\")\\n\\n if not self.max_mem_per_proc >= self.mem_per_proc >= self.min_mem_per_proc:\\n app(\\\"self.max_mem_per_proc >= mem_mb >= self.min_mem_per_proc not satisfied\\\")\\n\\n if self.priority <= 0:\\n app(\\\"priority must be > 0\\\")\\n\\n if not (1 <= self.min_cores <= self.hw.num_cores >= self.hint_cores):\\n app(\\\"1 <= min_cores <= hardware num_cores >= hint_cores not satisfied\\\")\\n\\n if errors:\\n raise self.Error(str(self) + \\\"\\\\n\\\".join(errors))\",\n \"def validate(self):\\r\\n for opt in self.required:\\r\\n if not getattr(self, opt):\\r\\n print \\\"Error: %s is not specified.\\\" % opt\\r\\n self.optp.print_help()\\r\\n sys.exit(1)\",\n \"def delivery_optimization(trucks_max_loadings,\\n drivers_weights,\\n items_csv_file,\\n trucks_measuring_unit='kg',\\n drivers_measuring_unit='kg',\\n csv_delimiter=';',\\n column_mapping_required=False,\\n columns_mapping={}):\\n\\n if len(trucks_max_loadings) != len(drivers_weights):\\n print(\\\"The count of trucks must be equal to the count of drivers!\\\")\\n exit(1)\\n\\n\\n # Calculate the possible loads for the trucks\\n\\n # If necessary, converting kg to gram for the trucks max loading and drivers weight.\\n if trucks_measuring_unit == 'kg':\\n trucks_max_loadings_gram = [max_load*1000 for max_load in trucks_max_loadings]\\n else:\\n trucks_max_loadings_gram = trucks_max_loadings\\n\\n if drivers_measuring_unit == 'kg':\\n drivers_weights_gram = [weight*1000 for weight in drivers_weights]\\n else:\\n drivers_weights_gram = drivers_weights\\n\\n\\n # Subtract the drivers weights from trucks max loading weight.\\n trucks_possible_loads = [max_load - driver_weight\\n for max_load,driver_weight\\n in zip(trucks_max_loadings_gram, drivers_weights_gram)]\\n\\n print(\\\"\\\\nTrucks max possible items loadings: \\\")\\n for i, max_load in enumerate(trucks_possible_loads):\\n print(\\\"Truck {}: {} gram\\\".format(i, max_load))\\n\\n\\n # Read the data from csv file into a dataframe by pandas.\\n df_items = pd.read_csv(items_csv_file, delimiter=csv_delimiter, decimal='.')\\n\\n # Map the column names if required\\n if column_mapping_required and columns_mapping is not None:\\n df_items.rename(columns = {origin_name : new_name for new_name, origin_name in columns_mapping.items()},\\n inplace=True)\\n\\n\\n # Start with pulp action\\n\\n # Create a new LpProblem from pulp.\\n # The LpProblem should maximize a objective function, which will be set later.\\n prob = pl.LpProblem(\\\"Delivery_Problem\\\",pl.LpMaximize)\\n\\n\\n items_names = df_items['name'].tolist()\\n\\n # Create LpVariables from pulp for optimizing.\\n # The values of this variables will be changed by the solver included in pulp to optimize the objective function.\\n # Set variables to optimize as items count, lower bound = 0 and as Integer numbers\\n # create optimizeable variables for each item for each truck as a list of dicts\\n lp_trucks_items = [pl.LpVariable.dicts(\\\"Truck {}\\\".format(truck_number), items_names, lowBound=0, cat='Integer')\\n for truck_number in range(len(trucks_possible_loads))]\\n\\n\\n # Adding main objective function\\n #\\n # Construct a objective function and add it to the LpProblem.\\n # The objective function will be calculated repeatedly to adjust the LpVariables to maximize itself.\\n #\\n # For the objective function we calculate the total sum of utility for the items on the trucks.\\n # To do this, we multiply the utility value of the item by its count from the LpVariable.\\n # We do that with each item on each truck and get the sum of all.\\n prob += pl.lpSum([\\n item['utility'] * lp_truck_items[item['name']]\\n for _, item in df_items.iterrows()\\n for lp_truck_items in lp_trucks_items\\n ])\\n\\n\\n # Adding constraints\\n\\n # Adding max capacity constraints\\n #\\n # We have a limit of load for each truck, what we can implement as constraints.\\n # Instead of taking the total sum as in the objective function, here we create a separate constraint for each truck.\\n # To do this, we multiply the weight of the item by its count from the LpVariable.\\n # We do that with each item on one truck and get the sum of its weight.\\n # Then we add a new constraint where the sum of weight must be lower or equal\\n # to the truck max possible load (which we got further up).\\n # Repeat for all trucks.\\n\\n # for each truck get the possible load\\n for truck_number, truck_possible_load in enumerate(trucks_possible_loads):\\n lp_truck_items = lp_trucks_items[truck_number]\\n # multiply the weight of the item with its count on the truck\\n lp_sum = pl.lpSum([float(item['weight']) * lp_truck_items[item['name']] for _, item in df_items.iterrows()])\\n # set the constraint, that the sum of weights on the truck must be lower or equal to his possible load\\n prob += lp_sum <= truck_possible_load\\n\\n\\n # Adding item max count constraints\\n #\\n # Like the max possible load above it exists also a limit by the max count of each item type.\\n # This limit applies one item type over all trucks.\\n # So we go through the item list and get the count of it from each truck by the LpVariables in `lp_trucks_items`.\\n # We sum the count over all trucks and add a new constraint\\n # where it must be lower or equal to the defined max count.\\n # Repeat for all items.\\n for _, item in df_items.iterrows():\\n total_item_count = sum([lp_truck_items[item['name']] for lp_truck_items in lp_trucks_items])\\n prob += total_item_count <= item['max_count']\\n\\n\\n # Try to solve the defined problem\\n #\\n # It can be set a certain solver from the pulp library.\\n # We set the msg parameter to False, because it disables the solvers output to stdout\\n print(\\\"\\\\nStart solving...\\\", end='')\\n prob.solve(pl.getSolver('PULP_CBC_CMD', msg=False))\\n print(\\\"done\\\\n\\\")\\n\\n # Show the status of solving.\\n print(\\\"Result status:\\\", pl.LpStatus[prob.status])\\n\\n\\n # Convert results to own data structure\\n #\\n # Because of the subdivide by upper name in the dicts has each LpVariable name a string as prefix like \\\"Truck_1_\\\".\\n # Furthermore the library has replaced all whitespaces in the variable names by underscores.\\n # So we can not use the original item name as key to get the value of a item.\\n #\\n # To make easy access we make a own result list for each truck.\\n # In this list we add a dictionary for all items on the respective truck.\\n # Because the division for each truck, we can remove the prefix on all variables.\\n # Just the replaced whitespaces are taken and handled later.\\n # The result values keep.\\n\\n # get optimized variables\\n result_variables = prob.variables()\\n # create a result list for the trucks\\n result_trucks_items = []\\n # for each truck add his items\\n for truck_number in range(len(trucks_possible_loads)):\\n prefix_len = len(\\\"Truck_{}_\\\".format(truck_number))\\n # create a result item dict for this truck\\n truck_items = {var.name[prefix_len:] : var.varValue # remove the prefix of truck in the name\\n for var in result_variables\\n # get only the items from the current truck\\n if var.name.startswith(\\\"Truck_{}_\\\".format(truck_number))}\\n # add count of items for this truck to result list\\n result_trucks_items.insert(truck_number, truck_items)\\n\\n\\n # Show each truck with containing driver weight and item count from results\\n print(\\\"\\\\nResult count for each item:\\\")\\n\\n for truck_number, result_truck_items in enumerate(result_trucks_items):\\n # increase the number of truck by 1 to skip the index 0 (only for presentation)\\n # also divide the weight of driver by 1000 to get kg from gram\\n print(\\\"\\\\nTruck {} with driver weight {}kg:\\\".format(truck_number+1, drivers_weights_gram[truck_number]/1000))\\n for item_name, item_count in result_truck_items.items():\\n # show only the items which counts are greater 0\\n if item_count > 0:\\n # replace underscores from pulp with whitespaces for better readability\\n print(\\\"{:<25} = {:>10}\\\".format(item_name.replace('_', ' '), item_count))\\n\\n print(\\\"\\\")\\n\\n # Show possible loads of trucks\\n for truck_number, truck_possible_load in enumerate(trucks_possible_loads):\\n print(\\\"Allowed weight for truck {} (with included driver): {} gram or {} kg\\\".format(\\n truck_number+1,\\n truck_possible_load,\\n truck_possible_load / 1000))\\n\\n print(\\\"\\\")\\n\\n # Show total weights of trucks containing items\\n #\\n # To get the total sum of weight for each truck and the chosen count of items,\\n # we go through each truck from our own result list `result_trucks_items`.\\n # We multiply the weight of item with the count from truck results.\\n #\\n # Because the library has replaced all whitespaces in the variable names by underscores,\\n # we access the result value by do this with the origin name too and use it as key.\\n #\\n # Notice: We can not just replace all underscores with whitespaces,\\n # because a origin name could contain a underscore too.\\n\\n # for each truck\\n for truck_number, result_truck_items in enumerate(result_trucks_items):\\n # calculate the total sum of weight for each item\\n total_truck_weight = sum([\\n item_count * item['weight']\\n for item_name, item_count in result_truck_items.items()\\n for _,item in df_items.iterrows()\\n # the item names from pulp have replaced whitespaces ' ' with underscore '_'\\n # to compare we must do this too\\n if item['name'].replace(' ', '_') == item_name\\n ])\\n print(\\\"Total weight of truck {}: {} gram or {} kg\\\".format(truck_number+1,\\n total_truck_weight,\\n total_truck_weight/1000))\\n\\n print(\\\"\\\")\\n\\n # Show the total value of utility over all trucks and items\\n\\n # print the end value of the objective function, in our case the sum of utility from all picked items\\n result_utility = pl.value(prob.objective)\\n print(\\\"The total utility value (rounded to 2 decimal places) of picked items in both trucks is: {}\\\".\\n format(round(result_utility, 2)))\\n\\n print(\\\"\\\\nProcess completed.\\\")\",\n \"def testoptdone(self):\\r\\n assert self.data.optdone\\r\\n convergence = numpy.abs(self.data.geovalues[-1]) <= self.data.geotargets\\r\\n assert sum(convergence) >= 2\",\n \"def validate_input(request):\\n\\n # Validate errors inputs\\n request_data = JSONParser().parse(request)\\n\\n if 'action' not in request_data:\\n return_data = {'error': 'No action'}\\n logger.error('validate_input method: error:{} request:{}'.format(return_data, request))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n if 'east' not in request_data:\\n return_data = {'error': 'No east'}\\n logger.error('validate_input method: error:{} request:{}'.format(return_data, request))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n if 'west' not in request_data:\\n return_data = {'error': 'No west'}\\n logger.error('validate_input method: error:{} request:{}'.format(return_data, request))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n # Debug mode checking condition\\n if 'number' in request_data and 'stops' in request_data:\\n\\n # If current status is break then making debug mode\\n if ValidateError.check_current_status() == 'break':\\n return CreateDebugMode.validate_input_to_create_debug_mode(request_data)\\n\\n # If current status is started or pending then return error_robotworking message\\n elif ValidateError.check_current_status() in ['started', 'pending']:\\n return_data = {'status': 'error', 'error': 'robotworking'}\\n logger.error('validation_errors.check_current_status debug mode method: error:robotworking request:{}'\\n .format(request_data))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n # Else return error_status message\\n else:\\n return_data = {'status': 'error', 'error': 'status'}\\n logger.error('validation_errors.check_current_status debug mode method: error:status unknown request:{}'\\n .format(request_data))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n # Disconnection checking condition\\n elif request_data['action'] == 'disconnect':\\n\\n # If current status is success or revoked or no_uuid then making disconnection\\n if ValidateError.check_current_status() in ['success', 'revoked', 'no_uuid', 'failure']:\\n return CreateDisconnect.validate_input_to_create_disconnection(request_data)\\n\\n # If current status is started or pending or break then return error_robotworking message\\n elif ValidateError.check_current_status() in ['started', 'pending', 'break']:\\n return_data = {'status': 'error', 'error': 'robotworking'}\\n logger.error('validation_errors.check_current_status disconnection method: '\\n 'error:robotworking request:{}'.format(request_data))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n # Else return error_status message\\n else:\\n return_data = {'status': 'error', 'error': 'status'}\\n logger.error('validation_errors.check_current_status disconnection method:'\\n ' error:status unknown request:{}'.format(request_data))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n # Connection checking condition\\n elif request_data['action'] == 'connect':\\n\\n # If current status is success or revoked or no_uuid then making connection\\n if ValidateError.check_current_status() in ['success', 'revoked', 'no_uuid', 'failure']:\\n return CreateConnection.validate_input_to_create_connection(request_data)\\n\\n # If current status is started or pending or break then return error_robotworking message\\n elif ValidateError.check_current_status() in ['started', 'pending', 'break']:\\n return_data = {'status': 'error', 'error': 'robotworking'}\\n logger.error('validation_errors.check_current_status connection method: error:robotworking request:{}'\\n .format(request_data))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n # Else return error_status message\\n else:\\n return_data = {'status': 'error', 'error': 'status unknown'}\\n logger.error('validation_errors.check_current_status connection method: error:status request:{}'\\n .format(request_data))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\\n\\n # Create connection in connection table\\n elif request.data['action'] == 'create_connection':\\n return ConnectionUtilities.create_dummy_connection(request_data)\\n\\n # Else return error_operation message\\n else:\\n return_data = {'status': 'error', 'error': 'operation'}\\n logger.error('validation_errors.check_current_status connection method: error:action unknown request:{}'\\n .format(request_data))\\n return Response(return_data, status=status.HTTP_400_BAD_REQUEST)\",\n \"def validate_parameters(self):\\n\\n flag = True\\n warnings = \\\"\\\"\\n # Check radius\\n r = self.parameters.get('r', 0)\\n if type(r) not in [int, float]:\\n flag = False\\n warnings += \\\"Radius r must be a float value\\\\n\\\"\\n else:\\n if r <= 0:\\n flag = False\\n warnings += \\\"Radius r must be higher than 0\\\\n\\\"\\n # Check if is full penetrating\\n op = self.parameters.get('full', False)\\n\\n if not op:\\n # Check observation well length\\n if 'd' in self.parameters and 'l' in self.parameters:\\n d = self.parameters.get('d', -1)\\n l = self.parameters.get('l', -1)\\n if type(l) not in [int, float]:\\n flag = False\\n warnings += \\\"Depth of well bottom must be a float value\\\\n\\\"\\n else:\\n if l < 0:\\n flag = False\\n warnings += \\\"Depth l must be higher than 0\\\\n\\\"\\n if type(d) not in [int, float]:\\n flag = False\\n warnings += \\\"Depth of well screen must be a float value\\\\n\\\"\\n else:\\n if d < 0 or d > l:\\n flag = False\\n warnings += \\\"Depth d must be in range 0 <= d <= l\\\\n\\\"\\n # Check piezometer depth\\n elif 'z' in self.parameters:\\n z = self.parameters.get('z', -1)\\n if type(z) not in [int, float]:\\n flag = False\\n warnings += \\\"Depth of piezometer must be a float value\\\\n\\\"\\n else:\\n if z < 0:\\n flag = False\\n warnings += \\\"Depth z must be higher than 0\\\\n\\\"\\n else:\\n flag = False\\n warnings += \\\"Well don't contain well depth attributes\\\\n\\\"\\n return(flag, warnings) # End Function\",\n \"def validate(self):\\n self.filter_passing_hits()\\n\\n checks = {\\\"number of hits\\\":self.check_hits(),\\n \\\"base pair count\\\":self.check_bp(),\\n \\\"contig count\\\":self.check_contigs(),\\n \\\"characters\\\": self.check_chars(),\\n \\\"checksum\\\":not check_checksum(self.seqdata.checksum)}\\n\\n failed_checks = {(k, v) for k, v in checks.iteritems() if v is False}\\n\\n if failed_checks:\\n \\\"\\\"\\\"\\n replace this with logger, break would be replaced by a raised\\n Exception where the Exception would be caught by the\\n Sequence_Upload code\\n \\\"\\\"\\\"\\n for k, v in failed_checks:\\n with open(generate_path(\\\"outputs/seq_errors.txt\\\"), \\\"a\\\") as file_:\\n file_.write(\\n '%s failed validation:'\\n 'the %s was not valid\\\\n' %(self.seqdata.accession, k)\\n )\\n self.seqdata.valid = False\\n else:\\n self.seqdata.valid = True\",\n \"def processTradeRoutes(self):\\n try:\\n nextRound = self.currentRound+1\\n resultslist = []\\n for trID in self.tradeRoutes.keys():\\n myTradeRoute = self.tradeRoutes[trID]\\n (systemFromID, systemToID, tradeRouteType) = string.split(trID, '-')\\n systemFrom = self.systems[systemFromID]\\n systemTo = self.systems[systemToID]\\n cancel = 0\\n warpReq = 0\\n # choose trade route type\\n if tradeRouteType == 'GEN':\\n # update what system sends based on what it makes\\n myTradeRoute.AL = systemFrom.prodAL\\n myTradeRoute.EC = systemFrom.prodEC\\n myTradeRoute.IA = systemFrom.prodIA\\n \\n # check if trade route is adjacent or requires warp gate capacity\\n if systemTo.id in systemFrom.warpGateSystems:\\n warpReq = myTradeRoute.getWarpRequired()\\n if warpReq > (systemFrom.availWGC-systemFrom.usedWGC) or warpReq > (systemTo.availWGC-systemTo.usedWGC):\\n cancel = 1\\n elif systemTo.id not in systemFrom.connectedSystems:\\n cancel = 1\\n \\n if (systemFrom.AL >= myTradeRoute.AL and\\n systemFrom.EC >= myTradeRoute.EC and\\n systemFrom.IA >= myTradeRoute.IA and \\n cancel == 0):\\n # process trade route\\n systemFrom.AL -= myTradeRoute.AL\\n systemFrom.EC -= myTradeRoute.EC\\n systemFrom.IA -= myTradeRoute.IA\\n systemTo.AL += myTradeRoute.AL\\n systemTo.EC += myTradeRoute.EC\\n systemTo.IA += myTradeRoute.IA\\n # deduct properly if empires are different\\n empireFrom = self.empires[systemFrom.myEmpireID]\\n empireTo = self.empires[systemTo.myEmpireID]\\n if empireFrom <> empireTo:\\n empireFrom.AL -= myTradeRoute.AL\\n empireFrom.EC -= myTradeRoute.EC\\n empireFrom.IA -= myTradeRoute.IA\\n empireTo.AL += myTradeRoute.AL\\n empireTo.EC += myTradeRoute.EC\\n empireTo.IA += myTradeRoute.IA\\n \\n if warpReq > 0:\\n systemFrom.usedWGC += warpReq\\n systemTo.usedWGC += warpReq\\n \\n # mail trade route completion\\n resultslist.append('Trade from System:%s to System:%s complete' % (systemFrom.id, systemTo.id))\\n self.mailTradeInfo('completed', myTradeRoute, nextRound)\\n else:\\n cancel = 1\\n \\n # check if route should be cancelled\\n if cancel == 1:\\n resultslist.append('cancel trade route=%s' % myTradeRoute.id)\\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\\n elif myTradeRoute.oneTime == 1:\\n resultslist.append('one time trade route=%s' % myTradeRoute.id)\\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\\n \\n return str(resultslist)\\n except:\\n return 'galaxy->processTradeRoutes error'\",\n \"def validate_router_gw_info(self, context, router_id, gw_info):\\n # check if this router has a vpn service\\n admin_con = context.elevated()\\n # get all relevant services, except those waiting to be deleted or in\\n # ERROR state\\n filters = {'router_id': [router_id],\\n 'status': [constants.ACTIVE, constants.PENDING_CREATE,\\n constants.INACTIVE, constants.PENDING_UPDATE]}\\n services = self.vpn_plugin.get_vpnservices(admin_con, filters=filters)\\n if services:\\n # do not allow enable-snat\\n if (gw_info and\\n gw_info.get('enable_snat', cfg.CONF.enable_snat_by_default)):\\n raise RouterWithSNAT(router_id=router_id)\\n else:\\n # if this is a non-vpn router. if snat was disabled, should check\\n # there is no overlapping with vpn connections\\n if (gw_info and\\n not gw_info.get('enable_snat',\\n cfg.CONF.enable_snat_by_default)):\\n # get router subnets\\n subnets = self._core_plugin._find_router_subnets_cidrs(\\n context, router_id)\\n # find all vpn services with connections\\n if not self._check_subnets_overlap_with_all_conns(\\n admin_con, subnets):\\n raise RouterWithOverlapNoSnat(router_id=router_id)\",\n \"def _further_validate_and_setup(self) -> None:\\n\\n # Make sure parameters make sense/are valid\\n if len(self.validated['learners']) != len(self.validated['param_grids']):\\n raise SchemaError(autos=None,\\n errors='The lists of of learners and parameter '\\n 'grids must be the same size.')\\n if (self.validated['hashed_features'] is not None\\n and self.validated['hashed_features'] == 0):\\n self.validated['hashed_features'] = self._n_features_feature_hashing\\n if self.validated['lognormal'] and self.validated['power_transform']:\\n raise SchemaError(autos=None,\\n errors='Both \\\"lognormal\\\" and \\\"power_transform\\\" '\\n 'were set simultaneously.')\\n if len(self.validated['learners']) != len(self.validated['param_grids']):\\n raise SchemaError(autos=None,\\n errors='The \\\"learners\\\" and \\\"param_grids\\\" '\\n 'parameters were both set and the '\\n 'lengths of the lists are unequal.')\",\n \"def validate_all_fields(self):\\n\\n if self.validate_byr() and \\\\\\n self.validate_iyr() and \\\\\\n self.validate_eyr() and \\\\\\n self.validate_hgt() and \\\\\\n self.validate_hcl() and \\\\\\n self.validate_ecl() and \\\\\\n self.validate_pid() and \\\\\\n self.validate_cid():\\n return True\\n return False\",\n \"def testoptdone(self):\\r\\n assert self.data.optdone\\r\\n target_e, target_g, target_s = self.data.geotargets\\r\\n value_e, value_g, value_s = self.data.geovalues[-1]\\r\\n converged = (value_e < target_e and value_g < target_g) or (value_g < target_g and value_s < target_s)\\r\\n assert converged\",\n \"def _validate(self):\\n self.params['report date'] = None\\n if any(self.params.values()):\\n s = self.params['start']\\n e = self.params['end']\\n cond1 = s is None\\n cond2 = e is None\\n \\n if cond1 and not cond2:\\n self.params['report date'] = e\\n if not cond1 and cond2:\\n self.params['report date'] = s\\n if not cond1 and not cond2:\\n if s == e:\\n self.params['report date'] = s\\n else:\\n if s > e:\\n self.params['start'] = e\\n self.params['end'] = s\\n else:\\n self.params['report date'] = MAX_DATE\",\n \"def __init__(self, **kwargs):\\r\\n self.pair_type = kwargs[\\\"pair_type\\\"]\\r\\n self.origins = kwargs[\\\"origins\\\"]\\r\\n self.origin_id_field = kwargs[\\\"origin_id_field\\\"]\\r\\n self.destinations = kwargs[\\\"destinations\\\"]\\r\\n self.dest_id_field = kwargs[\\\"dest_id_field\\\"]\\r\\n self.network_data_source = kwargs[\\\"network_data_source\\\"]\\r\\n self.travel_mode = kwargs[\\\"travel_mode\\\"]\\r\\n self.time_units = kwargs[\\\"time_units\\\"]\\r\\n self.distance_units = kwargs[\\\"distance_units\\\"]\\r\\n self.time_of_day = kwargs[\\\"time_of_day\\\"]\\r\\n self.reverse_direction = kwargs[\\\"reverse_direction\\\"]\\r\\n self.scratch_folder = kwargs[\\\"scratch_folder\\\"]\\r\\n self.assigned_dest_field = kwargs[\\\"assigned_dest_field\\\"]\\r\\n self.od_pair_table = kwargs[\\\"od_pair_table\\\"]\\r\\n self.origin_transfer_fields = kwargs[\\\"origin_transfer_fields\\\"]\\r\\n self.destination_transfer_fields = kwargs[\\\"destination_transfer_fields\\\"]\\r\\n self.barriers = []\\r\\n if \\\"barriers\\\" in kwargs:\\r\\n self.barriers = kwargs[\\\"barriers\\\"]\\r\\n\\r\\n # Create a job ID and a folder for this job\\r\\n self._create_job_folder()\\r\\n\\r\\n # Setup the class logger. Logs for each parallel process are not written to the console but instead to a\\r\\n # process-specific log file.\\r\\n self.setup_logger(\\\"RoutePairs\\\")\\r\\n\\r\\n # Get field objects for the origin and destination ID fields since we need this in multiple places\\r\\n self.origin_id_field_obj = arcpy.ListFields(self.origins, wild_card=self.origin_id_field)[0]\\r\\n self.dest_id_field_obj = arcpy.ListFields(self.destinations, wild_card=self.dest_id_field)[0]\\r\\n\\r\\n # Set up other instance attributes\\r\\n self.is_service = helpers.is_nds_service(self.network_data_source)\\r\\n self.rt_solver = None\\r\\n self.solve_result = None\\r\\n self.input_origins_layer = \\\"InputOrigins\\\" + self.job_id\\r\\n self.input_destinations_layer = \\\"InputDestinations\\\" + self.job_id\\r\\n self.input_origins_layer_obj = None\\r\\n self.input_dests_layer_obj = None\\r\\n self.origin_unique_id_field_name = \\\"OriginUniqueID\\\"\\r\\n self.dest_unique_id_field_name = \\\"DestinationUniqueID\\\"\\r\\n self.od_pairs = None\\r\\n\\r\\n # Create a network dataset layer if needed\\r\\n if not self.is_service:\\r\\n self._make_nds_layer()\\r\\n\\r\\n # Prepare a dictionary to store info about the analysis results\\r\\n self.job_result = {\\r\\n \\\"jobId\\\": self.job_id,\\r\\n \\\"jobFolder\\\": self.job_folder,\\r\\n \\\"solveSucceeded\\\": False,\\r\\n \\\"solveMessages\\\": \\\"\\\",\\r\\n \\\"outputRoutes\\\": \\\"\\\",\\r\\n \\\"logFile\\\": self.log_file\\r\\n }\",\n \"def testoptdone(self):\\r\\n\\r\\n assert self.data.optdone\\r\\n\\r\\n targets = self.data.geotargets\\r\\n values = numpy.abs(self.data.geovalues[-1])\\r\\n\\r\\n # Since the other criteria are not used and are not printed in this case, they should\\r\\n # be parsed as numpy.inf, for which we can check.\\r\\n assert numpy.isinf(targets[2])\\r\\n assert numpy.isinf(targets[4])\\r\\n\\r\\n conv = values[1] < targets[1] and (values[0] < targets[0] or values[3] < targets[3])\\r\\n assert conv\",\n \"def print_solution(data, manager, routing, assignment):\\n total_distance = 0\\n total_load = 0\\n for vehicle_id in range(data['num_vehicles']):\\n index = routing.Start(vehicle_id)\\n plan_output = 'Route for vehicle {}:\\\\n'.format(vehicle_id)\\n route_distance = 0\\n route_load = 0\\n while not routing.IsEnd(index):\\n node_index = manager.IndexToNode(index)\\n route_load += data['demands'][node_index]\\n plan_output += ' {0} Load({1}) -> '.format(node_index, route_load)\\n previous_index = index\\n index = assignment.Value(routing.NextVar(index))\\n route_distance += routing.GetArcCostForVehicle(\\n previous_index, index, vehicle_id)\\n plan_output += ' {0} Load({1})\\\\n'.format(manager.IndexToNode(index),\\n route_load)\\n plan_output += 'Distance of the route: {}m\\\\n'.format(route_distance)\\n plan_output += 'Load of the route: {}\\\\n'.format(route_load)\\n # print(plan_output)\\n total_distance += route_distance\\n total_load += route_load\\n with open(f\\\"Survey/vrp-nanostores/vrp-nanostores/food_deserts/outputs/2-e/clust8/route/route_vehicle{vehicle_id}.txt\\\", \\\"w\\\") as file:\\n file.write(plan_output)\\n file.close()\\n print(\\\"aaa\\\")\\n print('Total cost for all routes: {}m'.format(total_distance))\\n print('Total load of all routes: {}'.format(total_load))\\n with open(f\\\"Survey/vrp-nanostores/vrp-nanostores/food_deserts/outputs/2-e/clust8/load_dist_{data['num_vehicles']}vehicles.txt\\\", \\\"w\\\") as file:\\n out_file = \\\"\\\"\\n out_file += str(total_load) + \\\",\\\" + str(total_distance)\\n file.write(out_file)\\n file.close() # OPEN AND ANALYZE LATER WITH PANDAS\",\n \"def validate(self):\\n variables = ['waterThickness', 'waterPressure']\\n compare_variables(test_case=self, variables=variables,\\n filename1='full_run/output.nc',\\n filename2='restart_run/output.nc')\",\n \"def validate_model_args(self, cgi_map, network):\\n model_kwargs = InfoPropModel.validate_model_args(self, cgi_map, network)\\n\\n dfcrit = model_kwargs.pop('dfcrit')\\n if dfcrit == 'df':\\n model_kwargs['ap'] = None\\n elif dfcrit == 'ap':\\n model_kwargs['df'] = None\\n\\n if ('sink_nodes' not in model_kwargs) or \\\\\\n (len(model_kwargs['sink_nodes']) == 0):\\n raise exc.InsufficientSinks()\\n if (len(model_kwargs['sink_nodes']) > self.max_sinks):\\n raise exc.TooManyBoundaries('sinks', self.max_sinks)\\n\\n return model_kwargs\",\n \"def traffic_concentration(rFile, sheets, x, y, pollutant):\\r\\n p = Point(x, y)\\r\\n road, dis = nearest_road(p, rFile)\\r\\n \\r\\n # step 1. check whether this location is within the calculation range. If so, go on. Otherwise exit.\\r\\n if dis > 60: # I think we dont have to consider points that are too far from the streets.\\r\\n return 'e1' # error 1\\r\\n \\r\\n if dis < 3.5:\\r\\n dis = 3.5 # In the NSL calculation tool, calculation distance smaller than 3.5 meters are limited to 3.5 meters.\\r\\n \\r\\n # step 2. determine all the parameters required.\\r\\n \\r\\n #calibration factor\\r\\n Fk = 0.62\\r\\n \\r\\n # Emission number. for SO2, NO2, NOx, PM10, PM2.5, lead, and CO\\r\\n N = int(road['properties']['intensity']) #the traffic intensity, being the number of vehicles per day\\r\\n Fs = float(road['properties']['f_cong']) #fraction of stagnant traffic, a number between 0 and 1\\r\\n Fm = float(road['properties']['f_medium']) #fraction of medium-weight motor vehicles\\r\\n Fz = float(road['properties']['f_heavy']) #fraction of heavy motor vehicles\\r\\n Fb = float(road['properties']['f_bus']) #fraction of buses\\r\\n st = str(road['properties']['speed_type']) #intotal 5 types: a:100, b:44, c:19, d:13, e:26 (km/h)\\r\\n El = emission_factor(sheets, 'p', st, pollutant) #emission factor of light motor vehicles\\r\\n Em = emission_factor(sheets, 'm', st, pollutant) #emission factor of medium-weight motor vehicles\\r\\n Ez = emission_factor(sheets, 'v', st, pollutant) #emission factor of heavy motor vehicles\\r\\n Eb = emission_factor(sheets, 'b', st, pollutant) #emission factor of buses\\r\\n Eld = emission_factor(sheets, 'p', 'd', pollutant) #emission factor of light motor vehicles (speedType: d)\\r\\n Emd = emission_factor(sheets, 'm', 'd', pollutant) #emission factor of medium-weight motor vehicles (speedType: d)\\r\\n Ezd = emission_factor(sheets, 'v', 'd', pollutant) #emission factor of heavy motor vehicles (speedType: d)\\r\\n Ebd = emission_factor(sheets, 'b', 'd', pollutant) #emission factor of buses (speedType: d)\\r\\n \\r\\n E_regular = N * (1 - Fs) * ((1 - Fm - Fz - Fb) * El + Fm * Em + Fz * Ez + Fb * Eb) * 1000 / 24 / 3600\\r\\n E_cong = N * Fs * ((1 - Fm - Fz - Fb) * Eld + Fm * Emd + Fz * Ezd + Fb * Ebd) * 1000 / 24 / 3600\\r\\n E = E_regular + E_cong\\r\\n# print(\\\"{}: {}, {}\\\".format(pollutant, E_regular, E_cong))\\r\\n #dilution factor\\r\\n roadType = str(road['properties']['class'])\\r\\n if roadType == '1': # Broad street canyon\\r\\n a = 0.000325\\r\\n b = -0.0205\\r\\n c = 0.39\\r\\n alpha = 0.856\\r\\n elif roadType == '2': # Small street canyon\\r\\n a = 0.000488\\r\\n b = -0.0308\\r\\n c = 0.59\\r\\n alpha = None\\r\\n elif roadType == '3': # One-sided buildings\\r\\n a = 0.0005\\r\\n b = -0.0316\\r\\n c = 0.57\\r\\n alpha = None\\r\\n elif roadType == '4': # General urban\\r\\n a = 0.000310\\r\\n b = -0.0182\\r\\n c = 0.33\\r\\n alpha = 0.799\\r\\n \\r\\n if dis > 30 and (roadType == 1 or roadType == 4):\\r\\n theta = alpha * pow(dis, -0.747)\\r\\n else:\\r\\n theta = a * dis**2 + b * dis + c\\r\\n \\r\\n #tree factor\\r\\n Fb = road['properties']['t_factor']\\r\\n \\r\\n #wind speed\\r\\n ws = wind_speed(sheets, x, y) # average speed from CAR VL3.0\\r\\n \\r\\n #regional factor related to meteorology\\r\\n Fregio = 5 / ws\\r\\n \\r\\n # step 3. calculate the traffic concentration based on the parameters above.\\r\\n C_traffic = Fk * E * theta * Fb * Fregio\\r\\n \\r\\n # If it is NO2, then NOx has to be considered due to its chemical reaction with O3.\\r\\n if pollutant == 'NO2':\\r\\n B = 0.6 # fixed number?\\r\\n K = 100 # parameter for the conversion from NO to NO2\\r\\n C_background_O3 = background_concentration(sheets, x, y, 'O3')\\r\\n C_traffic_NOx = traffic_concentration(rFile, sheets, x, y, 'NOx')\\r\\n C_traffic = C_traffic + B * C_background_O3 * (C_traffic_NOx - C_traffic) / (C_traffic_NOx - C_traffic + K)\\r\\n \\r\\n return C_traffic\",\n \"def __check_inputs__(self):\\n # | - __check_inputs__\\n # #####################################################################\\n stop_mode = self.stop_mode\\n stop_num_generations = self.stop_num_generations\\n # #####################################################################\\n\\n if stop_mode == \\\"num_generations\\\":\\n mess_i = \\\"stop_mode='num_generations', \\\\\\n Must pass int to 'stop_num_generations'\\\"\\n assert type(stop_num_generations) == type(1), mess_i\\n #__|\",\n \"def check_parameters(self):\\n\\n if self.process not in [\\\"Like\\\", \\\"Like-and-follow\\\"]:\\n raiser('process')\\n\\n if \\\"type\\\" not in self.duration or \\\"value\\\" not in self.duration:\\n raiser('duration(type or value)')\\n else:\\n typ = self.duration['type']\\n val = self.duration['value']\\n if self.process == \\\"Like\\\":\\n if typ not in ['by_time', 'by_likes']:\\n raiser('type')\\n\\n if \\\"like\\\" not in self.limits_per_hour:\\n raiser('limitsPerHour(like)')\\n else:\\n try:\\n self.limits_per_hour['like'] = float(self.limits_per_hour['like'])\\n except ValueError:\\n raiser('like')\\n elif self.process == \\\"Like-and-follow\\\":\\n if typ not in ['by_time', 'by_users']:\\n raiser('type')\\n\\n if \\\"like\\\" not in self.limits_per_hour or \\\"follow\\\" not in self.limits_per_hour \\\\\\n or \\\"unfollow\\\" not in self.limits_per_hour:\\n raiser('limitsPerHour(like or follow or unfollow)')\\n else:\\n for i in [\\\"like\\\", \\\"follow\\\", \\\"unfollow\\\"]:\\n try:\\n self.limits_per_hour[i] = float(self.limits_per_hour[i])\\n except ValueError:\\n raiser(i)\\n try:\\n self.duration['value'] = float(val)\\n except ValueError:\\n raiser('value')\\n\\n if not isinstance(self.search_hashtags, list):\\n raiser('hashtags')\\n\\n if not isinstance(self.white_list, list):\\n raiser('whiteList')\",\n \"def main():\\n\\n print('Drones capacity = {}'.format(DRONES_CAPACITY))\\n\\n # Instantiate the data of the problem\\n data = create_data_model(MAX_POINT_DEMAND, USE_CACHE)\\n\\n # Create the routing index manager\\n manager = pywrapcp.RoutingIndexManager(len(data['distance_matrix']),\\n data['num_vehicles'], data['depot'])\\n\\n # Create Routing Model\\n routing = pywrapcp.RoutingModel(manager)\\n\\n # Defining weights of the edges\\n def distance_callback(from_index, to_index):\\n \\\"\\\"\\\"Returns the distance between the two nodes.\\\"\\\"\\\"\\n # Convert from routing variable Index to distance matrix NodeIndex.\\n from_node = manager.IndexToNode(from_index)\\n to_node = manager.IndexToNode(to_index)\\n return data['distance_matrix'][from_node][to_node]\\n\\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\\n\\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\\n\\n # Addding capacity constraints.\\n def demand_callback(from_index):\\n \\\"\\\"\\\"Returns the demand for tests of the node.\\\"\\\"\\\"\\n from_node = manager.IndexToNode(from_index)\\n return data['demands'][from_node]\\n\\n demand_callback_index = routing.RegisterUnaryTransitCallback(\\n demand_callback)\\n\\n def counter_callback(from_index):\\n \\\"\\\"\\\"Returns the number of stops done at the node.\\\"\\\"\\\"\\n from_node = manager.IndexToNode(from_index)\\n return data['counter'][from_node]\\n\\n counter_callback_index = routing.RegisterUnaryTransitCallback(\\n counter_callback)\\n\\n # Limiting the number of tests each drone can carry\\n routing.AddDimensionWithVehicleCapacity(\\n demand_callback_index,\\n 0, # null capacity slack\\n data['vehicle_capacities'], # vehicle maximum capacities\\n True, # start cumul to zero\\n 'Capacity')\\n\\n # Limiting the overall number of nodes a drone can serve in one tour\\n routing.AddDimensionWithVehicleCapacity(\\n counter_callback_index,\\n 0, # null capacity slack\\n data['vehicle_max_number_of_stops'], # vehicle maximum capacities\\n True, # start cumul to zero\\n 'Counter')\\n\\n # Setting parameters of the solver\\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\\n search_parameters.first_solution_strategy = (\\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\\n search_parameters.local_search_metaheuristic = (\\n routing_enums_pb2.LocalSearchMetaheuristic.GUIDED_LOCAL_SEARCH)\\n search_parameters.time_limit.seconds = HEURISTIC_TIME_LIMIT\\n search_parameters.log_search = True\\n\\n\\n print('START SOLVING')\\n assignment = routing.SolveWithParameters(search_parameters)\\n\\n if assignment:\\n print_and_save_solution(data, manager, routing, assignment)\",\n \"def _check_inputlengths(self):\\n # Check x and y have more than 1 item, and x and y are equal length\\n if not len(self.x) > 1:\\n raise ValueError(\\\"Route input 'x' must contain more than 1 item\\\")\\n\\n if not (len(self.y) > 1):\\n raise ValueError(\\\"Route input 'y' must contain more than 1 item\\\")\\n\\n if not (len(self.x) == len(self.y)):\\n raise ValueError(\\\"Route inputs 'x' and 'y' must be of equal length\\\")\\n\\n # Performs checks on z if not empty\\n if self.z is not None:\\n for v in self.z.values():\\n if not (len(v) == len(self.x)):\\n raise ValueError(\\\"Route input 'z' must be of equal length to 'x' and 'y'\\\")\",\n \"def test_field_value_exact(self):\\n field = 'M30'\\n ref_idx = [2]\\n self.res=self.run_task(infile=self.rawfile,field=field,calmode=self.calmode,outfile=self.outname,outform='ASAP')\\n self.assertEqual(self.res,None,\\n msg='Any error occurred during calibration')\\n self._compare_with_analytic(self.outname, self.line, self.baseline, ref_idx)\",\n \"def checkParameters(self):\\n self.DEBUG(\\\"EDPluginExecDatcmpv2_0.checkParameters\\\")\\n self.checkMandatoryParameters(self.getDataInput(), \\\"Data Input is None\\\")\\n self.checkMandatoryParameters(self.getDataInput().inputCurve, \\\"No input 1D curves file provided\\\")\",\n \"def test_13(self, test):\\r\\n globalConfig.test = test\\r\\n\\r\\n outputList = getOutputList()\\r\\n inputList = getInputList()\\r\\n\\r\\n if len(inputList) == 0 and len(outputList) == 0:\\r\\n return test.UNCLEAR(\\\"Not tested. No resources found.\\\")\\r\\n\\r\\n constrainedOutputList = []\\r\\n for outputInstance in outputList:\\r\\n outputCaps = outputInstance.getCaps()\\r\\n try:\\r\\n routableInputs = outputCaps['routable_inputs']\\r\\n except KeyError:\\r\\n return test.FAIL(\\\"Could not find 'routable_inputs' in /caps \\\"\\r\\n \\\"for Output {}\\\".format(outputInstance.id))\\r\\n if routableInputs is not None:\\r\\n constrainedOutputList.append(\\r\\n {\\r\\n \\\"output\\\": outputInstance,\\r\\n \\\"routableInputs\\\": routableInputs\\r\\n }\\r\\n )\\r\\n\\r\\n if len(constrainedOutputList) == 0:\\r\\n return test.UNCLEAR(\\\"Could not test - no outputs have routing constraints set.\\\")\\r\\n\\r\\n inputIDList = [None]\\r\\n for inputInstance in inputList:\\r\\n inputIDList.append(inputInstance.id)\\r\\n\\r\\n for constrainedOutput in constrainedOutputList:\\r\\n forbiddenRoutes = copy.deepcopy(inputIDList)\\r\\n\\r\\n for routableInputID in constrainedOutput['routableInputs']:\\r\\n forbiddenRoutes.remove(routableInputID)\\r\\n\\r\\n if len(forbiddenRoutes) > 0:\\r\\n\\r\\n action = Action(forbiddenRoutes[0], constrainedOutput['output'].id)\\r\\n activation = Activation()\\r\\n activation.addAction(action)\\r\\n\\r\\n try:\\r\\n activation.checkReject()\\r\\n return test.PASS()\\r\\n except NMOSTestException:\\r\\n msg = (\\\"Was able to create a forbidden route between Input {} \\\"\\r\\n \\\"and Output {} despite routing constraint.\\\"\\r\\n .format(forbiddenRoutes[0], outputInstance.id))\\r\\n return test.FAIL(msg)\\r\\n return test.UNCLEAR(\\\"Could not test - no route is forbidden.\\\")\",\n \"def optimize(self):\\n self.vbe_step()\\n self.compute_responsibilities()\\n self.compute_sufficient_stats()\\n self.vbmstep()\",\n \"def route(self, is_check_lanes=True):\\n print 'route'\\n # TODO: if too mant vtypes, better go through id_modes\\n exectime_start = time.clock()\\n\\n net = self.get_scenario().net\\n edges = net.edges\\n vtypes = self.parent.vtypes\\n\\n ids_edges = []\\n ids_trip = []\\n costs = []\\n for id_vtype in self.get_vtypes():\\n id_mode = vtypes.ids_mode[id_vtype]\\n\\n # no routing for pedestrians\\n if id_mode != net.modes.get_id_mode('pedestrian'):\\n weights = edges.get_times(id_mode=id_mode,\\n speed_max=vtypes.speeds_max[id_vtype],\\n is_check_lanes=is_check_lanes)\\n\\n ids_trip_vtype = self.get_trips_for_vtype(id_vtype)\\n # print ' id_vtype,id_mode',id_vtype,id_mode#,ids_trip_vtype\\n # print ' weights',weights\\n ids_edge_depart = self.ids_edge_depart[ids_trip_vtype]\\n ids_edge_arrival = self.ids_edge_arrival[ids_trip_vtype]\\n\\n for id_trip, id_edge_depart, id_edge_arrival in zip(ids_trip_vtype, ids_edge_depart, ids_edge_arrival):\\n cost, route = routing.get_mincostroute_edge2edge(id_edge_depart,\\n id_edge_arrival,\\n edges=edges,\\n weights=weights)\\n if len(route) > 0:\\n ids_edges.append(route)\\n ids_trip.append(id_trip)\\n costs.append(cost)\\n\\n ids_route = self.routes.get_value().add_rows(ids_trip=ids_trip,\\n ids_edges=ids_edges,\\n costs=costs,\\n )\\n self.add_routes(ids_trip, ids_route)\\n print ' exectime', time.clock()-exectime_start\\n return ids_trip, ids_route\",\n \"def _check_params(self):\\n pass\",\n \"def getPriorityRequests(self, line):\\n # self.optimizationResultsFile = open(self.fileName, 'r')\\n # for i, line in enumerate(self.optimizationResultsFile):\\n # if i in range(15, requiredLineNo):\\n reqPhase, earliestArrival, latestArrival, delay, vehicleClass = line.split()\\n if int(vehicleClass) == EV:\\n self.requestedPhase_EV.append(int(reqPhase))\\n self.ETA_EV.append(float(latestArrival) - 4.0)\\n self.ETA_EV.append(float(latestArrival) - 4.0)\\n self.ETA_Duration_EV.append(4.0)\\n self.ETA_Duration_EV.append(4.0)\\n self.vehicleType_EV.append(int(vehicleClass))\\n self.delay_EV.append(float(delay))\\n\\n elif int(vehicleClass) == TRANSIT:\\n self.requestedPhase_Transit.append(int(reqPhase))\\n self.ETA_Transit.append(float(latestArrival) - 4.0)\\n self.ETA_Transit.append(float(latestArrival) - 4.0)\\n self.ETA_Duration_Transit.append(4.0)\\n self.ETA_Duration_Transit.append(4.0)\\n self.vehicleType_Transit.append(int(vehicleClass))\\n if (float(delay) > 0):\\n self.delay_Transit.append(\\n float(delay) - (float(latestArrival) - float(earliestArrival) - 4.0))\\n\\n elif int(vehicleClass) == TRUCK:\\n self.requestedPhase_Truck.append(int(reqPhase))\\n self.ETA_Truck.append(float(latestArrival) - 4.0)\\n self.ETA_Truck.append(float(latestArrival) - 4.0)\\n self.ETA_Duration_Truck.append(4.0)\\n self.ETA_Duration_Truck.append(4.0)\\n self.vehicleType_Truck.append(int(vehicleClass))\\n if (float(delay) > 0):\\n self.delay_Truck.append(\\n float(delay) - (float(latestArrival) - float(earliestArrival) - 4.0))\\n\\n elif int(vehicleClass) == DILEMMAZONE:\\n self.requestedPhase_DilemmaZone.append(int(reqPhase))\\n self.ETA_DilemmaZone.append(float(latestArrival) - 4.0)\\n self.ETA_DilemmaZone.append(float(latestArrival) - 4.0)\\n self.ETA_Duration_DilemmaZone.append(4.0)\\n self.ETA_Duration_DilemmaZone.append(4.0)\\n self.vehicleType_DilemmaZone.append(int(vehicleClass))\\n self.delay_DilemmaZone.append(float(delay))\\n\\n elif int(vehicleClass) == COORDINATION:\\n self.requestedPhase_Coordination.append(int(reqPhase))\\n self.ETA_Coordination.append(float(earliestArrival))\\n self.ETA_Coordination.append(float(earliestArrival))\\n self.ETA_Duration_Coordination.append(\\n float(latestArrival) - float(earliestArrival))\\n self.ETA_Duration_Coordination.append(\\n float(latestArrival) - float(earliestArrival))\\n self.vehicleType_Coordination.append(int(vehicleClass))\\n self.delay_Coordination.append(float(delay))\\n\\n # self.optimizationResultsFile.close()\",\n \"def ValidateInputs(lat_min, lat_max, lon_min, lon_max, lonres, latres, basepath, \\\\\\n GFED_path, EDGAR_path, CAMS_path, behaviour_settings):\\n # Assert sure extents fall within boundary\\n assert -180 <= lon_min < 180 and -180 < lon_max <= 180, 'Longitude should be within range -180 -- 180!'\\n assert -90 <= lat_min < 90 and -90 < lat_max <= 90, 'latitude should be within range -90 -- 90!'\\n assert lon_min < lon_max, 'maximum longitude cannot be smaller than or equal to minimum!'\\n assert lat_min < lat_max, 'maximum latitude cannot be smaller than or equal to minimum!'\\n \\n # Assert resolution is larger than TROPOMI minimum:\\n assert lonres > 7, 'TROPOMI minimum longitude resolution is 7 km!'\\n assert latres > 7, 'TROPOMI minimum latitude resolution is 7 km!'\\n \\n # Assert if given directories exist\\n if behaviour_settings[1] == True:\\n assert os.path.isdir(CAMS_path), f'Directory {CAMS_path} was not found!'\\n if behaviour_settings[2] == True:\\n assert os.path.isdir(GFED_path), f'Directory {GFED_path} was not found!'\\n assert os.path.isdir(EDGAR_path), f'Directory {EDGAR_path} was not found!'\\n\\n \\n return\",\n \"def Validate(self):\\n \\n hklmin = self.hklmin_txtCtrl.GetValue()\\n hklmax = self.hklmax_txtCtrl.GetValue()\\n hklsteps = self.hkl_steps_ctrl.GetValue()\\n \\n wmin = self.wmin_txtCtrl.GetValue()\\n wmax = self.wmax_txtCtrl.GetValue()\\n wsteps = self.w_steps_ctrl.GetValue()\\n \\n kx = self.kx_txtCtrl.GetValue()\\n ky = self.ky_txtCtrl.GetValue()\\n kz = self.kz_txtCtrl.GetValue()\\n \\n zmin = self.zmin_ctrl.GetValue()\\n zmax = self.zmax_ctrl.GetValue()\\n colorbar_bool = self.color_bar_box.GetValue()\\n \\n temp = self.temp_ctrl.GetValue()\\n sphavg_bool = self.spherical_avg_box.GetValue()\\n \\n bgColor = \\\"pink\\\"\\n failed = False\\n \\n #Validate hkl values\\n num_hklmin = None\\n num_hklmax = None\\n try:\\n num_hklmin = float(hklmin)*np.pi\\n self.hklmin_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.hklmin_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n try:\\n num_hklmax = float(hklmax)*np.pi\\n self.hklmax_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.hklmax_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True \\n \\n #Validate w values\\n num_wmin = None\\n num_wmax = None\\n try:\\n num_wmin = float(wmin)\\n self.wmin_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.wmin_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n try:\\n num_wmax = float(wmax)\\n self.wmax_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.wmax_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True \\n \\n #Validate kx,ky,kz,temp,zmin,zmax values\\n num_kx = None\\n num_ky = None\\n num_kz = None\\n num_temp = None\\n num_zmin = None\\n num_zmax = None\\n try:\\n num_kx = float(kx)\\n self.kx_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.kx_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n try:\\n num_ky = float(ky)\\n self.ky_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.ky_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True \\n try:\\n num_kz = float(kz)\\n self.kz_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.kz_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n try:\\n num_temp = float(temp)\\n self.temp_ctrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.temp_ctrl.SetBackgroundColour(bgColor)\\n failed = True\\n try:\\n num_zmin = float(zmin)\\n self.zmin_ctrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.zmin_ctrl.SetBackgroundColour(bgColor)\\n failed = True\\n try:\\n num_zmax = float(zmax)\\n self.zmax_ctrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.zmax_ctrl.SetBackgroundColour(bgColor)\\n failed = True\\n \\n #Validate File Fields\\n int_str = self.int_file_txtCtrl.GetValue()\\n spin_str = self.spin_file_txtCtrl.GetValue()\\n tau_str = self.tau_file_txtCtrl.GetValue()\\n out_str = self.output_file_txtCtrl.GetValue()\\n if int_str:\\n self.int_file_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n else: \\n self.int_file_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n if spin_str:\\n self.spin_file_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n else: \\n self.spin_file_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n if tau_str:\\n self.tau_file_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n else: \\n self.tau_file_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n if out_str:\\n self.output_file_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n else: \\n self.output_file_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n \\n direction = {}\\n direction['kx'] = num_kx\\n direction['ky'] = num_ky\\n direction['kz'] = num_kz\\n hkl_interval = [num_hklmin, num_hklmax, int(self.hkl_steps_ctrl.GetValue())]\\n w_interval = [num_wmin, num_wmax, int(self.w_steps_ctrl.GetValue())]\\n \\n tau_text = ''\\n try:\\n tau_file = open(tau_str,'r')\\n tau_text = tau_file.read()\\n self.tau_file_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.tau_file_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n\\n items = tau_text.split()\\n if len(items)%3 and not len(items):\\n failed = True\\n\\n tau_list = []\\n i = 0\\n while not failed and i < len(items)-3:\\n tau1, tau2, tau3 = None, None, None\\n try:\\n tau1 = float(items[i])\\n tau2 = float(items[i+1])\\n tau3 = float(items[i+2])\\n self.tau_file_txtCtrl.SetBackgroundColour(\\\"white\\\")\\n except:\\n self.tau_file_txtCtrl.SetBackgroundColour(bgColor)\\n failed = True\\n tau_list.append([tau1,tau2,tau3])\\n i+=3\\n \\n self.Refresh()\\n# self.window.Show(True,True)\\n \\n plotstats = [zmin, zmax, colorbar_bool]\\n \\n return failed, hkl_interval, w_interval, tau_list, direction, num_temp, sphavg_bool, plotstats\",\n \"def solve_model(self,max_wait_time = 0,max_per_veh = 99999, save_output=True):\\n self.manager = pywrapcp.RoutingIndexManager(len(self.data['time_matrix']),\\n self.data['num_vehicles'], self.data['depot'])\\n routing = pywrapcp.RoutingModel(self.manager)\\n\\n transit_callback_index = routing.RegisterTransitCallback(self.time_callback)\\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\\n time = 'Time'\\n routing.AddDimension(\\n transit_callback_index,\\n max_wait_time, # allow waiting time\\n max_per_veh, # maximum time per vehicle\\n False, # Don't force start cumul to zero.\\n time)\\n time_dimension = routing.GetDimensionOrDie(time)\\n # Add time window constraints for each location except depot.\\n for location_idx, time_window in enumerate(self.data['time_windows']):\\n if location_idx == 0:\\n continue\\n index = self.manager.NodeToIndex(location_idx)\\n time_dimension.CumulVar(index).SetRange(time_window[0], time_window[1]-self.VisitTime)\\n # Add time window constraints for each vehicle start node.\\n for vehicle_id in range(self.data['num_vehicles']):\\n index = routing.Start(vehicle_id)\\n time_dimension.CumulVar(index).SetRange(self.data['time_windows'][self.data['depot']][0],\\n self.data['time_windows'][self.data['depot']][1])\\n for i in range(self.data['num_vehicles']):\\n routing.AddVariableMinimizedByFinalizer(\\n time_dimension.CumulVar(routing.Start(i)))\\n routing.AddVariableMinimizedByFinalizer(\\n time_dimension.CumulVar(routing.End(i)))\\n '''Routing Settings:https://developers.google.com/optimization/routing/routing_options\\n '''\\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\\n search_parameters.first_solution_strategy = (\\n routing_enums_pb2.FirstSolutionStrategy.PATH_MOST_CONSTRAINED_ARC)\\n search_parameters.time_limit.seconds = 3600\\n #search_parameters.log_search = True\\n search_parameters.local_search_metaheuristic = (\\n routing_enums_pb2.LocalSearchMetaheuristic.AUTOMATIC)\\n sol_status={0:'ROUTING_NOT_SOLVED: Problem not solved yet.',\\n 1:'ROUTING_SUCCESS: Problem solved successfully.',\\n 2:'ROUTING_FAIL: No solution found to the problem.',\\n 3:'ROUTING_FAIL_TIMEOUT: Time limit reached before finding a solution.',\\n 4:'ROUTING_INVALID: Model, model parameters, or flags are not valid.'}\\n print('Start Solving the problem....')\\n _start_ = systime.time()\\n assignment = routing.SolveWithParameters(search_parameters)\\n print(\\\"Solver status: \\\", sol_status[routing.status()])\\n soltime = systime.time()-_start_\\n print('Solving takes: '+ str(round(soltime,2))+' Secs')\\n if assignment:\\n self.print_save_solution(routing, assignment,save_res=save_output)\\n else:\\n print('Solving Failed')\",\n \"def parse_route(self):\\n self.error = 0\\n for item in self.arg_list:\\n if len(item) == 2:\\n self.make_log_write(self.fixed_width_parse(item), item)\\n elif len(item) == 3:\\n self.make_log_write(self.delimited_parse(item), item)\\n else:\\n raise Exception('Invalid Parameters: %s please correct' % item)\",\n \"def test_route(self):\\n\\n params = get_params()\\n estimator = LinearEstimator()\\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\\n model_builder = OptimizationModelBuilder(\\n constraints=[CapacityConstraint()]\\n )\\n router = Router(\\n problem_builder=problem_builder,\\n optimization_model_builder=model_builder\\n )\\n riders = parse_models(model_dicts=test_riders, cls=Rider)\\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\\n depots = parse_models(model_dicts=test_depots, cls=Depot)\\n routes = router.route(riders, vehicles, depots)\\n self.assertTrue(routes, msg='Routes could not be built.')\\n\\n for route in routes:\\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\\n self.assertTrue(\\n len(route['stops']) > 1,\\n msg='Route with single stop.'\\n )\",\n \"def onCalculateParameters(self, evt):\\n \\n if not self.config.iActivationMode == \\\"User-defined\\\":\\n if self.onCheckParameters(evt=None) == False: \\n print('Please fill in all necessary fields first!')\\n return\\n divisibleCheck = abs(self.config.iEndVoltage-self.config.iStartVoltage)/self.config.iStepVoltage\\n divisibleCheck2 = divisibleCheck%1\\n if divisibleCheck2 != 0:\\n msg = \\\"Are you sure your collision voltage range is divisible by your increment?\\\"\\n dialogs.dlgBox(exceptionTitle='Mistake in the input', \\n exceptionMsg= msg,\\n type=\\\"Error\\\")\\n return\\n else:\\n if self.config.iScanTime == None or self.config.iScanTime == \\\"\\\": \\n msg = 'Please make sure you to fill in the scan time input box.'\\n dialogs.dlgBox(exceptionTitle='Mistake in the input', \\n exceptionMsg= msg,\\n type=\\\"Error\\\")\\n return\\n \\n if self.config.iActivationMode == \\\"Linear\\\":\\n self.wrensInput, ColEnergyX, scanPerVoltageList, timeList, totalAcqTime = self.onPrepareLinearMethod()\\n elif self.config.iActivationMode == \\\"Exponential\\\":\\n self.wrensInput, ColEnergyX, scanPerVoltageList, timeList, totalAcqTime = self.onPrepareExponentialMethod()\\n elif self.config.iActivationMode == \\\"Boltzmann\\\":\\n self.wrensInput, ColEnergyX, scanPerVoltageList, timeList, totalAcqTime = self.onPrepareBoltzmannMethod()\\n elif self.config.iActivationMode == \\\"User-defined\\\":\\n self.wrensInput, ColEnergyX, scanPerVoltageList, timeList, totalAcqTime = self.onPrepareListMethod() \\n \\n self.wrensCMD = self.wrensInput.get('command', None)\\n # Setup status:\\n self.view.SetStatusText(''.join(['Acq. time: ',str(totalAcqTime),' mins']), number=0)\\n self.view.SetStatusText(''.join([str(len(scanPerVoltageList)), ' steps']), number=1)\\n \\n # Add wrensCMD to config file\\n self.config.wrensCMD = self.wrensCMD\\n \\n self.onPlotSPV(ColEnergyX, scanPerVoltageList)\\n self.onPlotTime(ColEnergyX, timeList)\\n print(''.join([\\\"Your submission code: \\\", self.wrensCMD]))\",\n \"def test_validate_good_order(self):\\n for proj in testorders.good_test_projections:\\n valid_order = copy.deepcopy(self.base_order)\\n valid_order['projection'] = {proj: testorders.good_test_projections[proj]}\\n\\n try:\\n good = api.validation(valid_order, self.staffuser.username)\\n except ValidationException as e:\\n self.fail('Raised ValidationException: {}'.format(e.message))\",\n \"def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches\\r\\n # Select the inputs to process\\r\\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n self._select_inputs_one_to_one(chunk_definition)\\r\\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n self._get_od_pairs_for_chunk(chunk_definition)\\r\\n self._select_inputs_many_to_many()\\r\\n else:\\r\\n raise NotImplementedError(f\\\"Invalid PreassignedODPairType: {self.pair_type}\\\")\\r\\n\\r\\n # Initialize the Route solver object\\r\\n self.initialize_rt_solver()\\r\\n self._add_unique_id_fields()\\r\\n\\r\\n # Insert the origins and destinations\\r\\n self.logger.debug(f\\\"Route solver fields transferred from Origins: {self.origin_transfer_fields}\\\")\\r\\n self.logger.debug(f\\\"Route solver fields transferred from Destinations: {self.destination_transfer_fields}\\\")\\r\\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n self._insert_stops_one_to_one()\\r\\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n self._insert_stops_many_to_many()\\r\\n else:\\r\\n raise NotImplementedError(f\\\"Invalid PreassignedODPairType: {self.pair_type}\\\")\\r\\n\\r\\n if self.rt_solver.count(arcpy.nax.RouteInputDataType.Stops) == 0:\\r\\n # There were no valid destinations for this set of origins\\r\\n self.logger.debug(\\\"No valid destinations for this set of origins. Skipping Route calculation.\\\")\\r\\n return\\r\\n\\r\\n # Load barriers\\r\\n # Note: This loads ALL barrier features for every analysis, even if they are very far away from any of\\r\\n # the inputs in the current chunk. You may want to select only barriers within a reasonable distance of the\\r\\n # inputs, particularly if you run into the maximumFeaturesAffectedByLineBarriers,\\r\\n # maximumFeaturesAffectedByPointBarriers, and maximumFeaturesAffectedByPolygonBarriers tool limits for portal\\r\\n # solves. However, since barriers is likely an unusual case, deal with this only if it becomes a problem.\\r\\n for barrier_fc in self.barriers:\\r\\n self.logger.debug(f\\\"Loading barriers feature class {barrier_fc}...\\\")\\r\\n shape_type = arcpy.Describe(barrier_fc).shapeType\\r\\n if shape_type == \\\"Polygon\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.PolygonBarriers\\r\\n elif shape_type == \\\"Polyline\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.LineBarriers\\r\\n elif shape_type == \\\"Point\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.PointBarriers\\r\\n else:\\r\\n self.logger.warning(\\r\\n f\\\"Barrier feature class {barrier_fc} has an invalid shape type and will be ignored.\\\"\\r\\n )\\r\\n continue\\r\\n barriers_field_mappings = self.rt_solver.fieldMappings(class_type, True)\\r\\n self.rt_solver.load(class_type, barrier_fc, barriers_field_mappings, True)\\r\\n\\r\\n # Solve the Route analysis\\r\\n self.logger.debug(\\\"Solving Route...\\\")\\r\\n solve_start = time.time()\\r\\n self.solve_result = self.rt_solver.solve()\\r\\n solve_end = time.time()\\r\\n self.logger.debug(f\\\"Solving Route completed in {round(solve_end - solve_start, 3)} seconds.\\\")\\r\\n\\r\\n # Handle solve messages\\r\\n solve_msgs = [msg[-1] for msg in self.solve_result.solverMessages(arcpy.nax.MessageSeverity.All)]\\r\\n for msg in solve_msgs:\\r\\n self.logger.debug(msg)\\r\\n\\r\\n # Update the result dictionary\\r\\n self.job_result[\\\"solveMessages\\\"] = solve_msgs\\r\\n if not self.solve_result.solveSucceeded:\\r\\n self.logger.debug(\\\"Solve failed.\\\")\\r\\n return\\r\\n self.logger.debug(\\\"Solve succeeded.\\\")\\r\\n self.job_result[\\\"solveSucceeded\\\"] = True\\r\\n\\r\\n # Save output\\r\\n self._export_to_feature_class(chunk_definition)\\r\\n\\r\\n self.logger.debug(\\\"Finished calculating Route.\\\")\",\n \"def validate_parameters(self):\\n\\n flag = True\\n warnings = \\\"\\\"\\n # Check radius\\n r = self.parameters.get('rw', 0)\\n if type(r) not in [int, float]:\\n flag = False\\n warnings += \\\"Well radius rw must be a float value\\\\n\\\"\\n else:\\n if r <= 0:\\n flag = False\\n warnings += \\\"Well radius rw must be higher than 0\\\\n\\\"\\n # Check if is full penetrating\\n op = self.parameters.get('full', False)\\n\\n if not op:\\n # Check observation well length\\n if 'd' in self.parameters and 'l' in self.parameters:\\n d = self.parameters.get('d', -1)\\n l = self.parameters.get('l', -1)\\n if type(l) not in [int, float]:\\n flag = False\\n warnings += \\\"Depth of well bottom must be a float value\\\\n\\\"\\n else:\\n if l < 0:\\n flag = False\\n warnings += \\\"Depth l must be higher than 0\\\\n\\\"\\n if type(d) not in [int, float]:\\n flag = False\\n warnings += \\\"Depth of well screen must be a float value\\\\n\\\"\\n else:\\n if d < 0 or d > l:\\n flag = False\\n warnings += \\\"Depth d must be in range 0 <= d <= l\\\\n\\\"\\n return(flag, warnings) # End Function\",\n \"def validate_settings(_cfg, _ctx):\\n pass\",\n \"def state_processing_validate(cfg, app, win, events):\",\n \"def skip_field_info_validation(config):\\n\\n reformatters = ['PCPCombine', 'RegridDataPlane']\\n process_list = [item[0] for item in get_process_list(config)]\\n\\n # if running MTD in single mode, you don't need matching FCST/OBS\\n if 'MTD' in process_list and config.getbool('config', 'MTD_SINGLE_RUN'):\\n return True\\n\\n # if running any app other than the reformatters, you need matching FCST/OBS, so don't skip\\n if [item for item in process_list if item not in reformatters]:\\n return False\\n\\n return True\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.58897823","0.5755311","0.5660653","0.557182","0.5522201","0.550903","0.54448694","0.53637433","0.5346746","0.5307992","0.52819705","0.52334815","0.52329284","0.52285826","0.5222194","0.52111304","0.51922095","0.5165339","0.51619154","0.51523876","0.5147929","0.5141172","0.5106939","0.51051646","0.51023626","0.5094769","0.50754744","0.5071408","0.50690913","0.5057215","0.50538415","0.50496626","0.504522","0.5038793","0.5009345","0.4992004","0.49895364","0.4989308","0.49881244","0.49808773","0.49793383","0.4976816","0.4975787","0.49677554","0.49487126","0.49386606","0.4937263","0.49306104","0.4926666","0.49221393","0.4917611","0.4913966","0.49123615","0.49107024","0.49076533","0.4906574","0.4905208","0.48952687","0.48880726","0.48879987","0.488566","0.48856527","0.48802283","0.48778808","0.4877464","0.48735306","0.486137","0.4852452","0.4844913","0.48311692","0.48305282","0.48273328","0.48261476","0.48245794","0.4823767","0.48213306","0.48172995","0.48104942","0.48100328","0.47984508","0.47856048","0.47738904","0.47718078","0.47621393","0.4760542","0.47475764","0.4746359","0.4741863","0.4737301","0.47370505","0.47321674","0.4731373","0.47278702","0.47246718","0.47225377","0.47212604","0.47125098","0.4703572","0.47020015","0.4700683"],"string":"[\n \"0.58897823\",\n \"0.5755311\",\n \"0.5660653\",\n \"0.557182\",\n \"0.5522201\",\n \"0.550903\",\n \"0.54448694\",\n \"0.53637433\",\n \"0.5346746\",\n \"0.5307992\",\n \"0.52819705\",\n \"0.52334815\",\n \"0.52329284\",\n \"0.52285826\",\n \"0.5222194\",\n \"0.52111304\",\n \"0.51922095\",\n \"0.5165339\",\n \"0.51619154\",\n \"0.51523876\",\n \"0.5147929\",\n \"0.5141172\",\n \"0.5106939\",\n \"0.51051646\",\n \"0.51023626\",\n \"0.5094769\",\n \"0.50754744\",\n \"0.5071408\",\n \"0.50690913\",\n \"0.5057215\",\n \"0.50538415\",\n \"0.50496626\",\n \"0.504522\",\n \"0.5038793\",\n \"0.5009345\",\n \"0.4992004\",\n \"0.49895364\",\n \"0.4989308\",\n \"0.49881244\",\n \"0.49808773\",\n \"0.49793383\",\n \"0.4976816\",\n \"0.4975787\",\n \"0.49677554\",\n \"0.49487126\",\n \"0.49386606\",\n \"0.4937263\",\n \"0.49306104\",\n \"0.4926666\",\n \"0.49221393\",\n \"0.4917611\",\n \"0.4913966\",\n \"0.49123615\",\n \"0.49107024\",\n \"0.49076533\",\n \"0.4906574\",\n \"0.4905208\",\n \"0.48952687\",\n \"0.48880726\",\n \"0.48879987\",\n \"0.488566\",\n \"0.48856527\",\n \"0.48802283\",\n \"0.48778808\",\n \"0.4877464\",\n \"0.48735306\",\n \"0.486137\",\n \"0.4852452\",\n \"0.4844913\",\n \"0.48311692\",\n \"0.48305282\",\n \"0.48273328\",\n \"0.48261476\",\n \"0.48245794\",\n \"0.4823767\",\n \"0.48213306\",\n \"0.48172995\",\n \"0.48104942\",\n \"0.48100328\",\n \"0.47984508\",\n \"0.47856048\",\n \"0.47738904\",\n \"0.47718078\",\n \"0.47621393\",\n \"0.4760542\",\n \"0.47475764\",\n \"0.4746359\",\n \"0.4741863\",\n \"0.4737301\",\n \"0.47370505\",\n \"0.47321674\",\n \"0.4731373\",\n \"0.47278702\",\n \"0.47246718\",\n \"0.47225377\",\n \"0.47212604\",\n \"0.47125098\",\n \"0.4703572\",\n \"0.47020015\",\n \"0.4700683\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7251164"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94757,"cells":{"query":{"kind":"string","value":"Discover if the origins and destinations include valid fields we can use in the Route analysis. Any fields with the correct names and data types matching valid fields recognized by the Route solver for the Stops input can be used in the analysis. Compare the input origins and destinations fields with the list of supported Route Stops fields and populate the list of fields to transfer in the route inputs dictionary."},"document":{"kind":"string","value":"def _populate_input_data_transfer_fields(self):\r\n # Valid fields for the Route Stops input are described here:\r\n # https://pro.arcgis.com/en/pro-app/latest/arcpy/network-analyst/route-input-data-types.htm\r\n # Do not transfer RouteName or Sequence as these are explicitly controlled by this tool. Do not transfer\r\n # LocationType because we want all inputs to be Stops. Waypoints don't make sense for this analysis.\r\n int_types = [\"Integer\", \"SmallInteger\"]\r\n numerical_types = [\"Double\", \"Single\"] + int_types\r\n rt_stops_input_fields = {\r\n \"Name\": [\"String\"],\r\n \"AdditionalTime\": numerical_types,\r\n \"AdditionalDistance\": numerical_types,\r\n \"AdditionalCost\": numerical_types,\r\n \"TimeWindowStart\": [\"Date\"],\r\n \"TimeWindowEnd\": [\"Date\"],\r\n \"CurbApproach\": int_types,\r\n \"Bearing\": numerical_types,\r\n \"BearingTol\": numerical_types,\r\n \"NavLatency\": numerical_types,\r\n \"SourceID\": int_types,\r\n \"SourceOID\": int_types,\r\n \"PosAlong\": numerical_types,\r\n \"SideOfEdge\": int_types\r\n }\r\n # Preserve origin and destination input fields that match names and types\r\n origin_transfer_fields = [\r\n f.name for f in arcpy.ListFields(self.origins) if f.name in rt_stops_input_fields and\r\n f.type in rt_stops_input_fields[f.name]]\r\n self.rt_inputs[\"origin_transfer_fields\"] = origin_transfer_fields\r\n if origin_transfer_fields:\r\n LOGGER.info((\r\n \"Supported fields in the input Origins table that will be used in the analysis: \"\r\n f\"{origin_transfer_fields}\"\r\n ))\r\n destination_transfer_fields = [\r\n f.name for f in arcpy.ListFields(self.destinations) if f.name in rt_stops_input_fields and\r\n f.type in rt_stops_input_fields[f.name]]\r\n self.rt_inputs[\"destination_transfer_fields\"] = destination_transfer_fields\r\n if destination_transfer_fields:\r\n LOGGER.info((\r\n \"Supported fields in the input Destinations table that will be used in the analysis: \"\r\n f\"{destination_transfer_fields}\"\r\n ))"},"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 _insert_stops_one_to_one(self): # pylint: disable=too-many-locals\r\n # Use an insertCursor to insert Stops into the Route analysis\r\n destinations = {}\r\n destination_rows = []\r\n with self.rt_solver.insertCursor(\r\n arcpy.nax.RouteInputDataType.Stops,\r\n [\"RouteName\", \"Sequence\", self.origin_unique_id_field_name, \"SHAPE@\", self.dest_unique_id_field_name] +\r\n self.origin_transfer_fields\r\n ) as icur:\r\n # Loop through origins and insert them into Stops along with their assigned destinations\r\n for origin in arcpy.da.SearchCursor( # pylint: disable=no-member\r\n self.input_origins_layer,\r\n [\"SHAPE@\", self.origin_id_field, self.assigned_dest_field] + self.origin_transfer_fields\r\n ):\r\n dest_id = origin[2]\r\n if dest_id is None:\r\n continue\r\n if dest_id not in destinations:\r\n dest_val = f\"'{dest_id}'\" if isinstance(dest_id, str) else dest_id\r\n with arcpy.da.SearchCursor( # pylint: disable=no-member\r\n self.input_destinations_layer,\r\n [\"SHAPE@\", self.dest_id_field] + self.destination_transfer_fields,\r\n where_clause=f\"{self.dest_id_field} = {dest_val}\"\r\n ) as cur:\r\n try:\r\n destinations[dest_id] = next(cur)\r\n except StopIteration:\r\n # The origin's destination is not present in the destinations table. Just skip the origin.\r\n continue\r\n # Insert origin and destination\r\n destination = destinations[dest_id]\r\n if self.reverse_direction:\r\n route_name = f\"{dest_id} - {origin[1]}\"\r\n origin_sequence = 2\r\n destination_sequence = 1\r\n else:\r\n route_name = f\"{origin[1]} - {dest_id}\"\r\n origin_sequence = 1\r\n destination_sequence = 2\r\n # Define the final origin and destination rows for the input Stops\r\n origin_row = [route_name, origin_sequence, origin[1], origin[0], None] + list(origin)[3:]\r\n destination_row = [route_name, destination_sequence, None, destination[0], destination[1]] + \\\r\n list(destination)[2:]\r\n icur.insertRow(origin_row)\r\n destination_rows.append(destination_row)\r\n\r\n # Insert destinations\r\n with self.rt_solver.insertCursor(\r\n arcpy.nax.RouteInputDataType.Stops,\r\n [\"RouteName\", \"Sequence\", self.origin_unique_id_field_name, \"SHAPE@\", self.dest_unique_id_field_name] +\r\n self.destination_transfer_fields\r\n ) as dcur:\r\n for row in destination_rows:\r\n dcur.insertRow(row)","def verify_destinations(**kwargs):\n if \"mapd_db\" in kwargs[\"destinations\"]:\n valid_destination_set = True\n if kwargs[\"dest_db_server\"] is None:\n # If dest_server is not set for mapd_db, then exit\n logging.error(\n '\"dest_server\" is required when destination = \"mapd_db\"'\n )\n if \"file_json\" in kwargs[\"destinations\"]:\n valid_destination_set = True\n if kwargs[\"output_file_json\"] is None:\n # If output_file_json is not set for file_json, then exit\n logging.error(\n '\"output_file_json\" is required when destination = \"file_json\"'\n )\n if \"output\" in kwargs[\"destinations\"]:\n valid_destination_set = True\n if \"jenkins_bench\" in kwargs[\"destinations\"]:\n valid_destination_set = True\n if kwargs[\"output_file_jenkins\"] is None:\n # If output_file_jenkins is not set for jenkins_bench, then exit\n logging.error(\n '\"output_file_jenkins\" is required '\n + 'when destination = \"jenkins_bench\"'\n )\n if not valid_destination_set:\n return False\n else:\n return True","def test_route_init() -> None:\n rschema = RouteSchema(SpecificLocation())\n route = Route(schema=rschema)\n\n assert route.schema is rschema # Cannot use __eq__\n assert isinstance(route.stops, list)","def route_matrix(client, origins, destinations, **kwargs):\n\n sep_pattern = re.compile(r'[,;|]')\n CN_pattern = re.compile(u'[\\u4e00-\\u9fa5]+')\n\n is_origins_str = isinstance(origins, str)\n is_origins_list = isinstance(origins, list)\n if not any([is_origins_str, is_origins_list]):\n raise ValueError('\"origins\" must be str or list!')\n elif is_origins_str:\n sep_origins = sep_pattern.split(origins)\n u_origins = origins.decode('utf-8')\n CN_pattern = re.compile(u'[\\u4e00-\\u9fa5]+')\n match = CN_pattern.search(u_origins)\n if match:\n if len(sep_origins) > 5:\n raise ValueError('\"origins\" incorrect! upper limits is 5.')\n else:\n origins = '|'.join(sep_origins)\n else:\n if len(sep_origins) > 10:\n raise ValueError('\"origins\"incorrect! upper limits is 5.')\n else:\n temp = [','.join(sep_origins[(2*x):(2*x+2)][::-1])\n for x in range(0, len(sep_origins)/2)]\n origins = '|'.join(temp)\n\n else:\n # element in list is CN_pattern characters.\n if len(origins[0]) == 1:\n origins = '|'.join(origins)\n # element in list is list/tuple of lng,lat.\n else:\n origins = [map(str, l) for l in origins]\n origins = '|'.join([','.join(l[::-1]) for l in origins])\n\n is_destinations_str = isinstance(destinations, str)\n is_destinations_list = isinstance(destinations, list)\n\n if not any([is_destinations_str, is_destinations_list]):\n raise ValueError('\"destinations\" must be str or list!')\n elif is_destinations_str:\n sep_destinations = sep_pattern.split(destinations)\n u_destinations = destinations.decode('utf-8')\n CN_pattern = re.compile(u'[\\u4e00-\\u9fa5]+')\n match = CN_pattern.search(u_destinations)\n if match:\n if len(sep_destinations) > 5:\n raise ValueError('\"destinations\" incorrect! upper limits is \\\n 5.')\n else:\n destinations = '|'.join(sep_destinations)\n else:\n if len(sep_destinations) > 10:\n raise ValueError('\"destinations\"incorrect! upper limits is 5.')\n else:\n temp = [','.join(sep_destinations[(2*x):(2*x+2)][::-1])\n for x in range(0, len(sep_destinations)/2)]\n destinations = '|'.join(temp)\n\n else:\n if len(destinations[0]) == 1:\n destinations = '|'.join(destinations)\n else:\n # first, map to str.\n destinations = [map(str, l) for l in destinations]\n destinations = '|'.join([','.join(l[::-1]) for l in destinations])\n\n kwargs.update({'server_name': 'direction', 'version': 'v1',\n 'subserver_name': 'routematrix', 'origins': origins,\n 'destinations': destinations})\n\n return client.get(kwargs)","def _insert_stops_many_to_many(self):\r\n # Store data of the relevant origins and destinations in dictionaries for quick lookups and reuse\r\n o_data = {} # {Origin ID: [Shape, transferred fields]}\r\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\r\n self.input_origins_layer,\r\n [self.origin_id_field, \"SHAPE@\"] + self.origin_transfer_fields\r\n ):\r\n o_data[row[0]] = row[1:]\r\n d_data = {} # {Destination ID: [Shape, transferred fields]}\r\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\r\n self.input_destinations_layer,\r\n [self.dest_id_field, \"SHAPE@\"] + self.destination_transfer_fields\r\n ):\r\n d_data[row[0]] = row[1:]\r\n\r\n # Insert origins from each OD pair into the Route analysis\r\n with self.rt_solver.insertCursor(\r\n arcpy.nax.RouteInputDataType.Stops,\r\n [\"RouteName\", \"Sequence\", self.origin_unique_id_field_name, \"SHAPE@\"] + self.origin_transfer_fields\r\n ) as icur:\r\n for od_pair in self.od_pairs:\r\n origin_id, dest_id = od_pair\r\n try:\r\n origin_data = o_data[origin_id]\r\n except KeyError:\r\n # This should never happen because we should have preprocessed this out.\r\n self.logger.debug(\r\n f\"Origin from OD Pairs not found in inputs. Skipped pair {od_pair}.\")\r\n continue\r\n route_name = f\"{origin_id} - {dest_id}\"\r\n icur.insertRow((route_name, 1, origin_id) + origin_data)\r\n\r\n # Insert destinations from each OD pair into the Route analysis\r\n with self.rt_solver.insertCursor(\r\n arcpy.nax.RouteInputDataType.Stops,\r\n [\"RouteName\", \"Sequence\", self.dest_unique_id_field_name, \"SHAPE@\"] + self.destination_transfer_fields\r\n ) as icur:\r\n for od_pair in self.od_pairs:\r\n origin_id, dest_id = od_pair\r\n try:\r\n dest_data = d_data[dest_id]\r\n except KeyError:\r\n # This should never happen because we should have preprocessed this out.\r\n self.logger.debug(\r\n f\"Destination from OD Pairs not found in inputs. Skipped pair {od_pair}.\")\r\n continue\r\n route_name = f\"{origin_id} - {dest_id}\"\r\n icur.insertRow((route_name, 2, dest_id) + dest_data)","def _check_inputlengths(self):\n # Check x and y have more than 1 item, and x and y are equal length\n if not len(self.x) > 1:\n raise ValueError(\"Route input 'x' must contain more than 1 item\")\n\n if not (len(self.y) > 1):\n raise ValueError(\"Route input 'y' must contain more than 1 item\")\n\n if not (len(self.x) == len(self.y)):\n raise ValueError(\"Route inputs 'x' and 'y' must be of equal length\")\n\n # Performs checks on z if not empty\n if self.z is not None:\n for v in self.z.values():\n if not (len(v) == len(self.x)):\n raise ValueError(\"Route input 'z' must be of equal length to 'x' and 'y'\")","def test_parse_routes(self):\n\n params = get_params()\n estimator = LinearEstimator()\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\n model_builder = OptimizationModelBuilder(\n constraints=[CapacityConstraint()]\n )\n riders = parse_models(model_dicts=test_riders, cls=Rider)\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\n depots = parse_models(model_dicts=test_depots, cls=Depot)\n problem = problem_builder.build(riders, vehicles, depots)\n model = model_builder.build(problem)\n solution = model.solve()\n routes = Router._parse_routes(problem, solution)\n self.assertTrue(routes, msg='Routes could not be built.')\n\n for route in routes:\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\n self.assertTrue(\n len(route['stops']) > 1,\n msg='Route with single stop.'\n )","def _check_inputvalues(self):\n # Check x, y and z are int or float dtypes\n # ie do not contain any unusable values like strings\n if not (self.x.dtype in [np.int, np.float]):\n raise TypeError(\"Route input 'x' must be either int or float dtypes\")\n\n if not (self.y.dtype in [np.int, np.float]):\n raise TypeError(\"Route input 'x' must be either int or float dtypes\")\n\n # Performs checks on z if not empty\n if self.z is not None:\n for v in self.z.values():\n if not (v.dtype in [np.int, np.float]):\n raise TypeError(\"Route input 'x' must be either int or float dtypes\")","def read_routes(routes_source: TextIO, airports: AirportDict) -> RouteDict:\n #RouteDict = Dict[str, Set[str]]\n routes_list = routes_source.readlines()\n d = {}\n src_index = ROUTE_DATA_INDEXES['Source airport']\n dst_index = ROUTE_DATA_INDEXES['Destination airport']\n \n for i in range(len(routes_list)):\n source_airport = get_routes_information(routes_list[i], src_index)\n destination_airport = get_routes_information(routes_list[i], dst_index)\n \n if source_airport in airports and destination_airport in airports\\\n and source_airport not in d:\n \n routes = set() # it's a set\n routes.add(destination_airport)\n d[source_airport] = routes\n \n elif source_airport in airports and destination_airport in \\\n airports and source_airport in d:\n d[source_airport].add(destination_airport)\n return d","def route(self, ori, dest, pois):\n #find one route from ori to dest\n departure_time = int(time.time())\n routes = util.query_routes(origin=ori, \n destination=dest,\n departure_time=departure_time)\n if routes is None or routes['status'] != \"OK\":\n print ',=====',routes\n return None\n\n route = routes[\"routes\"][0] #get the first route\n\n #get the points in the route to search the potential poi\n points = util.extract_points(route)\n\n if points is None or len(points) ==0:\n print \"Error in extracting points\"\n return None\n #get the candiates in the route\n candidates = []\n way_points = pois.split(\"|\")\n for point in points:\n information = {}\n information[\"location\"] = point\n for way_p in way_points:\n response = util.get_nearby_points(location=point, keyword=way_p)\n if response is None or response[\"status\"] != \"OK\":\n information[way_p] = []\n continue\n ps = []\n for result in response[\"results\"]:\n poi = {\"geometry\": result[\"geometry\"],\n \"name\": result[\"name\"],\n \"price_level\": result.get(\"price_level\", None),\n \"rating\": result.get(\"rating\", None),\n \"vicinity\": result[\"vicinity\"]}\n ps.append(poi)\n information[way_p] = ps\n candidates.append(information)\n \n cost_matrix = waypoint.find_waypoints([candidates], way_points)\n cost_matrix.sort(key=lambda x:x[1])\n\n top_candidate = cost_matrix[0]\n json.dump(top_candidate, open('./top_candidate.json','w'))\n final_route = self.get_direction(ori, dest, top_candidate)\n json.dump(final_route, open(\"./real_route.json\", \"w\"))\n\n return final_route, top_candidate","def route_gateway_validator(\n args: StackValidationArgs, report_violation: ReportViolation\n):\n routes = filter(lambda r: r.resource_type == \"aws:ec2/route:Route\", args.resources)\n gateways = filter(\n lambda r: r.resource_type == \"aws:ec2/internetGateway:InternetGateway\",\n args.resources)\n gateways_ids = [gateway.props['id'] for gateway in gateways]\n for route in routes:\n if route.props[\"gatewayId\"] not in gateways_ids:\n report_violation(\n \"You tried to set unexpected Internet Gateway id for Route\")","def directions_calc(self):\n \n # create route_dict, {'radio_button_name': {'geometries': list of coords,\n # 'values': list of values}}\n route_dict = self._selectInput()\n \n # generate lists with locations and values\n (start_layer_name,\n end_layer_name) = [x.objectName() for x in self.radio_buttons]\n \n locations_list = list(product(route_dict[start_layer_name]['geometries'],\n route_dict[end_layer_name]['geometries']))\n values_list = list(product(route_dict[start_layer_name]['values'],\n route_dict[end_layer_name]['values']))\n \n # If row-by-row in two-layer mode, then only zip the locations\n if all([button.isChecked() for button in self.radio_buttons]) and self.dlg.routing_twolayer_rowbyrow.isChecked():\n locations_list = list(zip(route_dict[start_layer_name]['geometries'],\n route_dict[end_layer_name]['geometries']))\n\n values_list = list(zip(route_dict[start_layer_name]['values'],\n route_dict[end_layer_name]['values']))\n\n # Add via point if specified\n route_via = None\n if self.dlg.routing_via_label.text() != 'Long,Lat':\n route_via = [float(x) for x in self.dlg.routing_via_label.text().split(\",\")]\n \n message_bar, progress_widget = progressbar.pushProgressBar(self.iface)\n \n responses = []\n delete_values = []\n for i, coords_tuple in enumerate(locations_list):\n if coords_tuple[0] == coords_tuple[-1]:\n # Skip when same location\n delete_values.append(i)\n continue\n if route_via:\n # add via coords\n coords_tuple = list(coords_tuple)\n coords_tuple.insert(1, route_via)\n \n # Update progress bar\n percent = (i/len(locations_list)) * 100\n message_bar.setValue(percent)\n \n # Make the request\n self.params['coordinates'] = convert.build_coords(coords_tuple)\n responses.append(self.client.request(self.url, self.params))\n \n # Delete entries in values_list where coords where the same\n values_list = [value for idx, value in enumerate(values_list) if idx not in delete_values]\n \n # Only proceed when there actual responses\n if responses: \n layer_out = self._addLine(responses, values_list)\n layer_out.updateExtents()\n \n QgsProject.instance().addMapLayer(layer_out)\n \n self.iface.messageBar().popWidget(progress_widget)","def buildStopsDict(self):\n \n if len(self.nodesDict) == 0:\n raise Exception('Nodes dictionary is empty!')\n if len(self.linksDict) == 0:\n raise Exception('Links dictionary is empty!')\n \n self.stopsByRoute = dict()\n self.stopsByNode = dict()\n arcpy.env.workspace = PublicTransit.WORKING_GDB\n \n tempStops = \"temp_stops\"\n tempStopsSp = \"temp_stops_sp\"\n \n # Delete temp_stops and temp_stops_sp feature classes if they exist.\n if arcpy.Exists(tempStops):\n arcpy.Delete_management(tempStops)\n if arcpy.Exists(tempStopsSp):\n arcpy.Delete_management(tempStopsSp)\n arcpy.CopyFeatures_management(PublicTransit.RTD_PATH + PublicTransit.RTD_STOPS,\n tempStops)\n \n # Project temp_stops to CA state plane and add XY.\n install_dir = arcpy.GetInstallInfo()['InstallDir']\n out_coordinate_system = os.path.join(install_dir, PublicTransit.NAD_83_DIRECTORY)\n arcpy.Project_management(tempStops, tempStopsSp, out_coordinate_system,\n \"NAD_1983_To_WGS_1984_1\")\n arcpy.AddXY_management(tempStopsSp)\n \n # Create a search cursor to traverse all stops.\n stops = arcpy.SearchCursor(tempStopsSp, \"\", \"\",\n \"CPT_STOPPOINTID; SCH_STOPPOINTSEQNO; \" +\n \"SCH_ROUTEID; SCH_PATTERNID; ROUTE_PATTERN; \" +\n \"SourceOID; POINT_X; POINT_Y\",\n \"ROUTE_PATTERN A; SCH_STOPPOINTSEQNO A\")\n numStops = int(arcpy.GetCount_management(tempStopsSp).getOutput(0))\n print \"Found %d stops\" % numStops\n \n p = index.Property()\n p.overwrite = True\n self.spIndex = index.Index(PublicTransit.SPATIAL_INDEX_FILE,properties=p)\n \n # For each stop determine the nearest network node.\n scount = 0\n icount = 0\n for s in stops:\n # only create stops for routes which exist in RTD\n if not s.ROUTE_PATTERN in self.transitRoutes:\n continue\n scount += 1\n st = TransitStop(s.CPT_STOPPOINTID, s.SCH_ROUTEID, s.SCH_PATTERNID,\n s.ROUTE_PATTERN, s.SourceOID, s.SCH_STOPPOINTSEQNO)\n # If the stop's linkId is in the links dictionary use the link from\n # and to node (these should all be bus routes since MTC's route\n # traversal FC was created for buses only at this time).\n if s.SourceOID in self.linksDict:\n link = self.linksDict[s.SourceOID]\n # Determine which node is nearest and snap to it.\n if self.__getDistance(s.POINT_X,\n s.POINT_Y,\n link.fromNode.x,\n link.fromNode.y) <= \\\n self.__getDistance(s.POINT_X,\n s.POINT_Y,\n link.toNode.x,\n link.toNode.y):\n st.tanaNode = link.fromNode.nodeId\n else:\n st.tanaNode = link.toNode.nodeId\n st.inRegion = True\n \n # The stop's link is not in linksDict. These are either stops \n # outside the region or non-bus routes for which there are no\n # route traversal edges. Do a link lookup from the Roadways\n # feature class.\n else:\n arcpy.env.workspace = PublicTransit.RTD_PATH\n roadwaysSearch = arcpy.SearchCursor(PublicTransit.ROADWAYS_FC,\n \"LinkId = \" + str(s.SourceOID),\n \"\", \"\", \"F_JNCTID; T_JNCTID\", \"\")\n for r in roadwaysSearch:\n fromNode = self.__getIdHash(r.F_JNCTID)\n toNode = self.__getIdHash(r.T_JNCTID)\n if fromNode in self.nodesDict and toNode in self.nodesDict:\n if self.__getDistance(s.POINT_X,\n s.POINT_Y,\n self.nodesDict[fromNode].x,\n self.nodesDict[fromNode].y) <= \\\n self.__getDistance(s.POINT_X,\n s.POINT_Y,\n self.nodesDict[toNode].x,\n self.nodesDict[toNode].y):\n st.tanaNode = fromNode\n else:\n st.tanaNode = toNode\n st.inRegion = True\n else:\n st.inRegion = False\n \n # Add the stop to stopsByRoute and stopsByNode dictionaries\n if s.ROUTE_PATTERN in self.stopsByRoute:\n self.stopsByRoute[s.ROUTE_PATTERN].append(st)\n else:\n self.stopsByRoute[s.ROUTE_PATTERN] = [st]\n if (st.tanaNode in self.stopsByNode):\n self.stopsByNode[st.tanaNode].append(st)\n else:\n self.stopsByNode[st.tanaNode] = [st]\n # add the stop node to the spatial index\n if st.tanaNode in self.nodesDict:\n icount += 1\n self.spIndex.insert(st.stopPointId,\n (self.nodesDict[st.tanaNode].x,\n self.nodesDict[st.tanaNode].y,\n self.nodesDict[st.tanaNode].x,\n self.nodesDict[st.tanaNode].y))\n del stops","def transit_to_dict(\n cities: List[City], transfers: List[Set[StopArea]]\n) -> dict:\n data = {\n \"stopareas\": {}, # stoparea id => stoparea data\n \"networks\": {}, # city name => city data\n \"transfers\": {}, # set(tuple(stoparea_id1, stoparea_id2)), id1<id2\n }\n\n for city in (c for c in cities if c.is_good):\n network = {\n \"id\": city.id,\n \"name\": city.name,\n \"routes\": [],\n }\n\n for route_master in city:\n route_data = {\n \"id\": route_master.id,\n \"mode\": route_master.mode,\n \"ref\": route_master.ref,\n \"name\": route_master.name,\n \"colour\": route_master.colour,\n \"infill\": route_master.infill,\n \"itineraries\": [],\n }\n\n for route in route_master:\n variant_data = {\n \"id\": route.id,\n \"tracks\": route.get_tracks_geometry(),\n \"start_time\": route.start_time,\n \"end_time\": route.end_time,\n \"interval\": route.interval,\n \"stops\": [\n {\n \"stoparea_id\": route_stop.stoparea.id,\n \"distance\": route_stop.distance,\n }\n for route_stop in route.stops\n ],\n }\n\n # Store stopareas participating in the route\n # and that have not been stored yet\n for route_stop in route.stops:\n stoparea = route_stop.stoparea\n if stoparea.id in data[\"stopareas\"]:\n continue\n stoparea_data = {\n \"id\": stoparea.id,\n \"center\": stoparea.center,\n \"name\": stoparea.station.name,\n \"entrances\": [\n {\n \"id\": egress_id,\n \"name\": egress[\"tags\"].get(\"name\"),\n \"ref\": egress[\"tags\"].get(\"ref\"),\n \"center\": el_center(egress),\n }\n for (egress_id, egress) in (\n (egress_id, city.elements[egress_id])\n for egress_id in stoparea.entrances\n | stoparea.exits\n )\n ],\n }\n data[\"stopareas\"][stoparea.id] = stoparea_data\n\n route_data[\"itineraries\"].append(variant_data)\n\n network[\"routes\"].append(route_data)\n\n data[\"networks\"][city.name] = network\n\n # transfers\n pairwise_transfers = set()\n for stoparea_set in transfers:\n stoparea_list = list(stoparea_set)\n for first_i in range(len(stoparea_list) - 1):\n for second_i in range(first_i + 1, len(stoparea_list)):\n stoparea1_id = stoparea_list[first_i].id\n stoparea2_id = stoparea_list[second_i].id\n if all(\n st_id in data[\"stopareas\"]\n for st_id in (stoparea1_id, stoparea2_id)\n ):\n id1, id2 = sorted([stoparea1_id, stoparea2_id])\n pairwise_transfers.add((id1, id2))\n\n data[\"transfers\"] = pairwise_transfers\n return data","def get_a_routes_closest_stop_and_arrival_time(request, lat, lon, bus_route, audio_string='from_input'):\n# 1. Clean the data.\n clean_data = clean_route_data(lat,lon,bus_route)\n if not clean_data:\n return JsonResponse({'status': 'bad', 'error': 'not clean data. determined invalid route query', 'query': bus_route})\n\n bus_id = clean_data['bus_id']\n bus_route = clean_data['bus_route']\n user_lat = clean_data['user_lat']\n user_lon = clean_data['user_lon']\n \n# 2. Find closest stops.\n closest_stops = find_closest_stops(user_lat,user_lon,bus_id)\n\n if not closest_stops: # zero stops\n return JsonResponse({'status': 'bad', 'error': 'no stops available nearby', 'lat:': user_lat, 'lon:': user_lon, 'query': bus_route})\n\n# 3. Finding arrival times for: the specific_bus at the nearest_stops\n closest_arrival = find_estimated_arrival(closest_stops['closest_stop_id'], bus_id)\n next_closest_arrival = find_estimated_arrival(closest_stops['next_closest_stop_id'], bus_id)\n\n# 4. Check that a valid time was returned from find_estimated_arrival \n if closest_arrival['estimated'] or next_closest_arrival['estimated']:\n\n return JsonResponse({\n 'status': 'good',\n 'route': bus_route,\n 'closest_stop': { \n 'closest_name': closest_stops['name_of_closest'],\n 'closest_direction': closest_stops['closest_direction'],\n 'closest_stop_id': closest_stops['closest_stop_id'],\n 'closest_minutes': closest_arrival['estimated'],\n 'closest_lat': closest_stops['closest_stop_lat'],\n 'closest_lon': closest_stops['closest_stop_lon'],\n 'closest_destination': closest_arrival['destination']\n },\n 'next_closest_stop': {\n 'next_closest_name': closest_stops['name_of_next_closest'],\n 'next_closest_direction': closest_stops['next_closest_direction'],\n 'next_closest_stop_id': closest_stops['next_closest_stop_id'],\n 'next_closest_minutes': next_closest_arrival['estimated'],\n 'next_closest_lat': closest_stops['next_closest_stop_lat'],\n 'next_closest_lon': closest_stops['next_closest_stop_lon'],\n 'next_closest_destination': next_closest_arrival['destination']\n },\n 'testing': audio_string,\n })\n \n return JsonResponse({'status': 'bad', 'error': 'no arrival time', 'closest_stop': {'id': closest_stops['closest_stop_id'], 'estimated_arrival': closest_arrival['estimated']}, 'next_closest_stop':{'id': closest_stops['next_closest_stop_id'], 'estimated_arrival': next_closest_arrival['estimated']}})","def possible_routes(srcLat, srcLon, destLat, destLon, searchPreference, dateTime):\n\n dateTime = dateTime.split(\",\")\n\n routes = Db().get_best_route(srcLat, srcLon, destLat, destLon)\n try:\n best_routes = get_three_best_routes(routes, searchPreference, dateTime)\n except IndexError:\n best_routes = \"No Journey Found\"\n\n # Get the address for map display purposes\n try:\n for i in range(len(best_routes)):\n #address is a dataframe, hency the use of .loc\n address = Db().get_single_address(best_routes[i][2]).loc[0,\"Address\"]\n best_routes[i].append(address)\n except IndexError:\n # In case the source is outside Dublin\n best_routes = \"No Journey Found\"\n\n return json.dumps(best_routes, ensure_ascii=False)","def _build_routes(self, routes, allow_redundant_targets=True):\n routes = routes or ()\n joins = {}\n targets_seen = set()\n\n for route in routes:\n if isinstance(route, dict):\n source_label = route.get('source')\n target_label = route.get('target')\n field_label = route.get('field')\n symmetrical = route.get('symmetrical')\n else:\n warnings.warn('Routes are now defined as dicts',\n DeprecationWarning)\n source_label, target_label, field_label, symmetrical = route\n\n # get models\n source = self.get_model(source_label, local=False)\n target = self.get_model(target_label, local=False)\n\n field = None\n\n # get field\n if field_label:\n model_name, field_name = field_label.split('.', 1)\n model_name = model_name.lower()\n\n # determine which model the join field specified exists on\n if model_name == source.__name__.lower():\n field = self.get_field(field_name, source)\n elif model_name == target.__name__.lower():\n field = self.get_field(field_name, target)\n else:\n raise TypeError('model for join field, \"{0}\", '\n 'does not exist'.format(field_name))\n\n if isinstance(field, RelatedObject):\n field = field.field\n\n if not allow_redundant_targets:\n if target in targets_seen:\n raise ValueError('Model {0} cannot be the target of '\n 'more than one route in this list'\n .format(target_label))\n else:\n targets_seen.add(target)\n\n # The `joins` hash defines pairs which are explicitly joined\n # via the specified field. If no field is defined, then the\n # join field is implied or does not matter; the route is reduced\n # to a straight lookup.\n joins[(source, target)] = field\n\n if symmetrical:\n if not allow_redundant_targets:\n if source in targets_seen:\n raise ValueError('Model {0} cannot be the target of '\n 'more than one route in this list'\n .format(source_label))\n else:\n targets_seen.add(source)\n\n joins[(target, source)] = field\n\n return joins","def find_routes(\r\n stops,\r\n measurement_units = \"\"\"Minutes\"\"\",\r\n analysis_region = None,\r\n reorder_stops_to_find_optimal_routes = False,\r\n preserve_terminal_stops = \"\"\"Preserve First\"\"\",\r\n return_to_start = False,\r\n use_time_windows = False,\r\n time_of_day = None,\r\n time_zone_for_time_of_day = \"\"\"Geographically Local\"\"\",\r\n uturn_at_junctions = \"\"\"Allowed Only at Intersections and Dead Ends\"\"\",\r\n point_barriers = None,\r\n line_barriers = None,\r\n polygon_barriers = None,\r\n use_hierarchy = True,\r\n restrictions = None,\r\n attribute_parameter_values = None,\r\n route_shape = \"\"\"True Shape\"\"\",\r\n route_line_simplification_tolerance = None,\r\n populate_route_edges = False,\r\n populate_directions = True,\r\n directions_language = \"\"\"en\"\"\",\r\n directions_distance_units = \"\"\"Miles\"\"\",\r\n directions_style_name = \"\"\"NA Desktop\"\"\",\r\n travel_mode = \"\"\"Custom\"\"\",\r\n impedance = \"\"\"Drive Time\"\"\",\r\n gis = None):\r\n kwargs = locals()\r\n\r\n if stops is None:\r\n stops = default_stops\r\n\r\n if point_barriers is None:\r\n point_barriers = default_point_barriers\r\n\r\n if line_barriers is None:\r\n line_barriers = default_line_barriers\r\n\r\n if polygon_barriers is None:\r\n polygon_barriers = default_polygon_barriers\r\n\r\n if restrictions is None:\r\n restrictions = default_restrictions\r\n\r\n if attribute_parameter_values is None:\r\n attribute_parameter_values = default_attributes\r\n\r\n if route_line_simplification_tolerance is None:\r\n route_line_simplification_tolerance = default_tolerance\r\n\r\n param_db = {\r\n \"stops\": (FeatureSet, \"Stops\"),\r\n \"measurement_units\": (str, \"Measurement_Units\"),\r\n \"analysis_region\": (str, \"Analysis_Region\"),\r\n \"reorder_stops_to_find_optimal_routes\": (bool, \"Reorder_Stops_to_Find_Optimal_Routes\"),\r\n \"preserve_terminal_stops\": (str, \"Preserve_Terminal_Stops\"),\r\n \"return_to_start\": (bool, \"Return_to_Start\"),\r\n \"use_time_windows\": (bool, \"Use_Time_Windows\"),\r\n \"time_of_day\": (datetime, \"Time_of_Day\"),\r\n \"time_zone_for_time_of_day\": (str, \"Time_Zone_for_Time_of_Day\"),\r\n \"uturn_at_junctions\": (str, \"UTurn_at_Junctions\"),\r\n \"point_barriers\": (FeatureSet, \"Point_Barriers\"),\r\n \"line_barriers\": (FeatureSet, \"Line_Barriers\"),\r\n \"polygon_barriers\": (FeatureSet, \"Polygon_Barriers\"),\r\n \"use_hierarchy\": (bool, \"Use_Hierarchy\"),\r\n \"restrictions\": (str, \"Restrictions\"),\r\n \"attribute_parameter_values\": (FeatureSet, \"Attribute_Parameter_Values\"),\r\n \"route_shape\": (str, \"Route_Shape\"),\r\n \"route_line_simplification_tolerance\": (LinearUnit, \"Route_Line_Simplification_Tolerance\"),\r\n \"populate_route_edges\": (bool, \"Populate_Route_Edges\"),\r\n \"populate_directions\": (bool, \"Populate_Directions\"),\r\n \"directions_language\": (str, \"Directions_Language\"),\r\n \"directions_distance_units\": (str, \"Directions_Distance_Units\"),\r\n \"directions_style_name\": (str, \"Directions_Style_Name\"),\r\n \"travel_mode\": (str, \"Travel_Mode\"),\r\n \"impedance\": (str, \"Impedance\"),\r\n \"solve_succeeded\": (bool, \"Solve Succeeded\"),\r\n \"output_routes\": (FeatureSet, \"Output Routes\"),\r\n \"output_route_edges\": (FeatureSet, \"Output Route Edges\"),\r\n \"output_directions\": (FeatureSet, \"Output Directions\"),\r\n \"output_stops\": (FeatureSet, \"Output Stops\"),\r\n }\r\n return_values = [\r\n {\"name\": \"solve_succeeded\", \"display_name\": \"Solve Succeeded\", \"type\": bool},\r\n {\"name\": \"output_routes\", \"display_name\": \"Output Routes\", \"type\": FeatureSet},\r\n {\"name\": \"output_route_edges\", \"display_name\": \"Output Route Edges\", \"type\": FeatureSet},\r\n {\"name\": \"output_directions\", \"display_name\": \"Output Directions\", \"type\": FeatureSet},\r\n {\"name\": \"output_stops\", \"display_name\": \"Output Stops\", \"type\": FeatureSet},\r\n ]\r\n\r\n if gis is None:\r\n gis = arcgis.env.active_gis\r\n\r\n url = gis.properties.helperServices.asyncRoute.url\r\n return _execute_gp_tool(gis, \"FindRoutes\", kwargs, param_db, return_values, _use_async, url)","def import_data(self):\n\n # Import ordered names of origins\n origins_file = os.path.join(self.data_directory,'origins.txt')\n self.origins = np.loadtxt(origins_file,dtype=str,ndmin=1)\n\n # Import ordered names of destinations\n destinations_file = os.path.join(self.data_directory,'destinations.txt')\n self.destinations = np.loadtxt(destinations_file,dtype=str,ndmin=1)\n\n # Import origin supply\n originsupply_file = os.path.join(self.data_directory,'origin_supply.txt')\n self.origin_supply = np.loadtxt(originsupply_file,ndmin=1).astype('float64')\n\n # In case origin supply is not a list\n if not isinstance(self.origin_supply,(np.ndarray, np.generic)):\n self.origin_supply = np.array([self.origin_supply])\n\n # Import destination demand\n destinationdemand_file = os.path.join(self.data_directory,'destination_demand.txt')\n self.destination_demand = np.loadtxt(destinationdemand_file,ndmin=1).astype('float64')\n\n # In case destination demand is not a list\n if not isinstance(self.destination_demand,(np.ndarray, np.generic)):\n self.destination_demand = np.array([self.destination_demand])\n\n # Import origin locations\n originlocations_file = os.path.join(self.data_directory,'origin_locations.txt')\n self.origin_locations = np.loadtxt(originlocations_file,ndmin=1)\n\n # Import destination locations\n destinationlocations_file = os.path.join(self.data_directory,'destination_locations.txt')\n self.destination_locations = np.loadtxt(destinationlocations_file,ndmin=1)\n\n # Import initial and final destination sizes\n initialdestinationsizes_file = os.path.join(self.data_directory,'initial_destination_sizes.txt')\n self.initial_destination_sizes = np.loadtxt(initialdestinationsizes_file,ndmin=1)\n\n # In case destination sizes are not a list\n if not isinstance(self.initial_destination_sizes,(np.ndarray, np.generic)):\n self.initial_destination_sizes = np.array([self.initial_destination_sizes])\n\n # Import N,M\n self.N = self.origin_supply.shape[0]\n self.M = self.initial_destination_sizes.shape[0]\n\n # Import cost matrix\n costmatrix_file = os.path.join(self.data_directory,'cost_matrix.txt')\n self.cost_matrix = np.loadtxt(costmatrix_file).astype('float64')\n\n # Reshape cost matrix if necessary\n if self.N == 1:\n self.cost_matrix = np.reshape(self.cost_matrix[:,np.newaxis],(self.N,self.M))\n if self.M == 1:\n self.cost_matrix = np.reshape(self.cost_matrix[np.newaxis,:],(self.N,self.M))\n\n # Compute total initial and final destination sizes\n self.total_initial_sizes = np.sum(self.initial_destination_sizes)\n\n # Compute naive total cost\n self.total_cost = 0\n for i in range(self.N):\n for j in range(self.M):\n self.total_cost += self.cost_matrix[i,j]*(self.origin_supply[i]/self.N)","def stops_on_routes_with_direction():\n routes_and_stops = {}\n routes = ['102y', '102z', '104y', '104z', '111y', '111z', '114y', '114z', '116y', '116z', '118y', '11y', '11z', '120y', '120z', '122y', '122z', '123y', '123z', '130y', '130z', '13y', '13z', '140y', '140z', '142y', '142z', '145y', '145z', '14Cy', '14Cz', '14y', '14z', '150y', '150z', '151y', '151z', '15Ay', '15Az', '15By', '15Bz', '15y', '15z', '161y', '161z', '16Cy', '16Cz', '16y', '16z', '17Ay', '17Az', '17y', '17z', '184y', '184z', '185y', '185z', '18y', '18z', '1y', '1z', '220y', '220z', '236y', '236z', '238y', '238z', '239y', '239z', '25Ay', '25Az', '25By', '25Bz', '25Xy', '25Xz', '25y', '25z', '26y', '26z', '270y', '270z', '27Ay', '27Az', '27By', '27Bz', '27Xy', '27Xz', '27y', '27z', '29Ay', '29Az', '31Ay', '31Az', '31By', '31Bz', '31y', '31z', '32Ay', '32Az', '32By', '32Bz', '32Xy', '32Xz', '32y', '32z', '33Ay', '33Az', '33By', '33Bz', '33Xy', '33Xz', '33y', '33z', '37y', '37z', '38Ay', '38Az', '38By', '38Bz', '38y', '38z', '39Ay', '39Az', '39y', '39z', '40By', '40Bz', '40Dy', '40Dz', '40y', '40z', '41Ay', '41By', '41Bz', '41Cy', '41Cz', '41Xy', '41Xz', '41y', '41z', '42y', '42z', '43y', '43z', '44By', '44Bz', '44y', '44z', '45Ay', '45Az', '46Ay', '46Az', '46Ey', '47y', '47z', '49y', '49z', '4y', '4z', '51Dy', '51Dz', '51Xy', '53By', '53Bz', '53y', '53z', '54Ay', '54Az', '56Ay', '56Az', '59y', '59z', '61y', '61z', '63y', '63z', '65By', '65Bz', '65y', '65z', '66Ay', '66Az', '66By', '66Bz', '66Xy', '66Xz', '66y', '66z', '67Xy', '67Xz', '67y', '67z', '68Ay', '68Az', '68y', '68z', '69Xy', '69Xz', '69y', '69z', '70y', '70z', '747y', '747z', '75y', '75z', '76Ay', '76Az', '76y', '76z', '77Ay', '77Az', '79Ay', '79Az', '79y', '79z', '7By', '7Bz', '7Dy', '7Dz', '7y', '7z', '83Ay', '83Az', '83y', '83z', '84Ay', '84Az', '84Xy', '84Xz', '84y', '84z', '8y', '8z', '9y', '9z']\n for route in routes:\n routes_and_stops[route] = [] # new array value for each route key\n reader = csv.reader(open(\"../Data/Sorted Data/stopped_bus_data.csv\"))\n for line in reader:\n try:\n current_route = extract_route_and_direction(line[3])\n if int(line[13]) not in routes_and_stops[current_route]:\n routes_and_stops[current_route].append(int(line[13]))\n except:\n continue\n return routes_and_stops","def _add_unique_id_fields(self):\r\n field_types = {\"String\": \"TEXT\", \"Single\": \"FLOAT\", \"Double\": \"DOUBLE\", \"SmallInteger\": \"SHORT\",\r\n \"Integer\": \"LONG\", \"OID\": \"LONG\"}\r\n origin_field_def = [self.origin_unique_id_field_name, field_types[self.origin_id_field_obj.type]]\r\n if self.origin_id_field_obj.type == \"String\":\r\n origin_field_def += [self.origin_unique_id_field_name, self.origin_id_field_obj.length]\r\n dest_field_def = [self.dest_unique_id_field_name, field_types[self.dest_id_field_obj.type]]\r\n if self.dest_id_field_obj.type == \"String\":\r\n dest_field_def += [self.dest_unique_id_field_name, self.dest_id_field_obj.length]\r\n self.rt_solver.addFields(arcpy.nax.RouteInputDataType.Stops, [origin_field_def, dest_field_def])","def findRoute(self, source:str, target:str, option:str = None, startTime:str = None) -> []:\n \n if (source not in self.stationInterchanges or target not in self.stationInterchanges):\n print(\"Invalid inputs\")\n return []\n\n if not option:\n option = 'shortest'\n\n # You can have multiple sources and destinations because the station can be an \n # interchange where you have multiple lines to chose from. \n sources = self.stationInterchanges[source]\n dests = self.stationInterchanges[target]\n\n route = []\n if option == 'shortest':\n route = self.__findRouteShortestPath(sources, dests)\n elif option == 'fastest':\n if not startTime or len(startTime) == 0:\n startTime = StationMap.dateUtils.getTodaysDate()\n route = self.__scheduleRoute(sources, dests, startTime)\n else:\n print('Invalid option: {0}'.format(option))\n return []\n return route","def __init__( # pylint: disable=too-many-locals, too-many-arguments\r\n self, pair_type_str, origins, origin_id_field, destinations, dest_id_field,\r\n network_data_source, travel_mode, time_units, distance_units,\r\n max_routes, max_processes, out_routes, scratch_folder, reverse_direction=False,\r\n assigned_dest_field=None, od_pair_table=None, time_of_day=None, barriers=None\r\n ):\r\n pair_type = helpers.PreassignedODPairType[pair_type_str]\r\n self.origins = origins\r\n self.destinations = destinations\r\n self.out_routes = out_routes\r\n self.scratch_folder = scratch_folder\r\n time_units = helpers.convert_time_units_str_to_enum(time_units)\r\n distance_units = helpers.convert_distance_units_str_to_enum(distance_units)\r\n if not barriers:\r\n barriers = []\r\n self.max_processes = max_processes\r\n if not time_of_day:\r\n time_of_day = None\r\n else:\r\n time_of_day = datetime.datetime.strptime(time_of_day, helpers.DATETIME_FORMAT)\r\n\r\n # Initialize the dictionary of inputs to send to each OD solve\r\n self.rt_inputs = {\r\n \"pair_type\": pair_type,\r\n \"origins\": self.origins,\r\n \"origin_id_field\": origin_id_field,\r\n \"destinations\": self.destinations,\r\n \"dest_id_field\": dest_id_field,\r\n \"network_data_source\": network_data_source,\r\n \"travel_mode\": travel_mode,\r\n \"time_units\": time_units,\r\n \"distance_units\": distance_units,\r\n \"time_of_day\": time_of_day,\r\n \"reverse_direction\": reverse_direction,\r\n \"scratch_folder\": self.scratch_folder,\r\n \"assigned_dest_field\": assigned_dest_field,\r\n \"od_pair_table\": od_pair_table,\r\n \"barriers\": barriers,\r\n \"origin_transfer_fields\": [], # Populate later\r\n \"destination_transfer_fields\": [] # Populate later\r\n }\r\n\r\n # List of intermediate output OD Line files created by each process\r\n self.route_fcs = []\r\n\r\n # Construct OID ranges for chunks of origins and destinations\r\n if pair_type is helpers.PreassignedODPairType.one_to_one:\r\n # Chunks are of the format [first origin ID, second origin ID]\r\n self.chunks = helpers.get_oid_ranges_for_input(origins, max_routes)\r\n elif pair_type is helpers.PreassignedODPairType.many_to_many:\r\n # Chunks are of the format [chunk_num, chunk_size]\r\n num_od_pairs = 0\r\n with open(od_pair_table, \"r\", encoding=\"utf-8\") as f:\r\n for _ in f:\r\n num_od_pairs += 1\r\n num_chunks = ceil(num_od_pairs / max_routes)\r\n self.chunks = [[i, max_routes] for i in range(num_chunks)]\r\n\r\n # Calculate the total number of jobs to use in logging\r\n self.total_jobs = len(self.chunks)\r\n\r\n self.optimized_cost_field = None","def bus_routes_direction():\n route_list = []\n os.chdir(\"../Data\")\n for file in glob.glob(\"*.csv\"):\n print(file) #useful for monitoring progress of function\n reader = csv.reader(open(file))\n for line in reader:\n route = extract_route_and_direction(line[3]) # Journey ID field\n if route not in route_list and route != \"\": # error handling for extract_bus_routes function\n route_list.append(route)\n return route_list","def validate(self, params, address_input_data):\n processed_address_list = []\n # check avoids redundancy for combined 'forward geocode and validate' \n # option as API does both by default\n if self.__is_address_list_processed:\n processed_address_list = address_input_data\n else:\n request_list = self.__prepare_smarty_request_list(address_input_data)\n processed_address_list = self.__process_smarty_request_list(request_list,\n address_input_data )\n self.__is_address_list_processed = True\n print(f'< {self.num_addresses_processed} addresses processed >')\n return processed_address_list","def check_if_repeated_route(route, user_lat, user_lon):\n bus_route = route\n repeated_routes = {'101':'','105':'','106':'','107':'','230':'','111':'','113':'','116':'','119':'','240':'','120':'','271':'','70':'','2':'pt','7':'','8':'','18':'','29':'','1':'pt','3':'pt','4':'pt','402':'pt','425':'pt','202':'pt','212':'pt','214':'pt','102':'pt','10':'pt','11':'pt','13':'','28':'pt','41':'','45':'','55':'pt','57':'pt','63':'pt','47':'','48':'','60':'','64':'','67':'','42':'','12':'','21':''}\n intercity_transit = ['47','48','60','64','67','42','12','13','21','41','45']\n king_county_metro = ['917', 'A Line', '225', '231', '239', '230', '250', '37', '910', '628', '372', '373', '630', '218', '631', '63', '4', '36', '43', '986', '823', '44', '987', '212', '45', '988', 'Trailhead Direct Issaquah Alps', '989', '824', '214', '47', '180', '48', '635', '216', '5', '217', '982', '41', '21', '984', 'F Line', 'E Line', '342', '345', '346', '952', '347', '894', '348', '49', '248', '355', '895', '116', '243', '245', '893', '118', '246', '661', '931', '119', '67', '915', '12', '249', '120', '238', '62', '226', '111', '24', '64', '193', '113', '240', '65', '930', '241', '114', '255', '73', '128', '74', '257', '75', '13', '907', '121', '122', '7', '123', '252', '70', '124', '71', '125', '221', '244', 'Trailhead Direct Cougar Mt.', '55', '994', '50', '995', 'Trailhead Direct Mailbox Peak', '219', '981', 'Trailhead Direct Mt. Si', '22', '224', '157', '204', '101', '232', '102', '105', '57', '106', '234', '156', '107', '235', '236', '60', '980', '237', 'B Line', '11', '775', '56', '1', '10', '166', '167', '903', '158', '908', '159', '3', '906', '301', '913', '914', '303', '164', '304', '916', '901', '178', '169', '308', '17', '309', '31', '311', '312', '177', '168', '629', 'Duvall-Monroe Shuttle', '268', '14', '76', '77', '131', '26', '773', '29', '132', '78', '40', '8', '887', 'C Line', '277', '9', '153', '28', '154', '269', 'D Line', '27', '143', '271', '886', '148', '888', '889', '15', '150', '891', '892', '208', '200', '181', '32', '182', '33', '183', '330', '331', '186', '187', '316', '179', '18', '192', '197', '2', '19', '190']\n pierce_transit = ['1','2','3','4','402','425','202','212','214','102','10','11','13','28','41','45','48','55','57','63']\n north_routes = ['101','105','106','107','230','111','113','116','119','240','120','271','70','2','3','4','7','8','12','18','29']\n \n if bus_route in repeated_routes:\n if user_lon < -122.5 and user_lat > 47.1:\n # going to be pierce county (or kitsap)\n if bus_route in pierce_transit: \n bus_route += 'pt'\n else:\n bus_route += repeated_routes[bus_route]\n elif user_lat > 47.7:\n # going to be community transit or everett transit (N)\n if bus_route in north_routes: \n bus_route += 'N'\n else:\n bus_route += repeated_routes[bus_route] \n elif user_lat > 47.33:\n # going to be king county metro\n if bus_route in king_county_metro:\n bus_route = bus_route\n else:\n bus_route += repeated_routes[bus_route]\n elif user_lat > 47.08:\n # going to be pierce transit\n if bus_route in pierce_transit: \n bus_route += 'pt'\n else:\n bus_route += repeated_routes[bus_route] \n else:\n # going to be intercity transit\n if bus_route in intercity_transit: \n bus_route += 'it'\n else:\n bus_route += repeated_routes[bus_route] \n\n return bus_route","def __init__(__self__, *,\n destination_region_id: pulumi.Input[str],\n destination_zone_id: pulumi.Input[str],\n source_region_id: pulumi.Input[str],\n source_zone_id: pulumi.Input[str],\n description: Optional[pulumi.Input[str]] = None,\n group_name: Optional[pulumi.Input[str]] = None,\n rpo: Optional[pulumi.Input[int]] = None):\n pulumi.set(__self__, \"destination_region_id\", destination_region_id)\n pulumi.set(__self__, \"destination_zone_id\", destination_zone_id)\n pulumi.set(__self__, \"source_region_id\", source_region_id)\n pulumi.set(__self__, \"source_zone_id\", source_zone_id)\n if description is not None:\n pulumi.set(__self__, \"description\", description)\n if group_name is not None:\n pulumi.set(__self__, \"group_name\", group_name)\n if rpo is not None:\n pulumi.set(__self__, \"rpo\", rpo)","def validateTradeRoute(self, tradeRouteDict):\n try:\n systemFrom = self.systems[tradeRouteDict['fromSystem']]\n systemTo = self.systems[tradeRouteDict['toSystem']]\n # has a trade route already been setup between these planets?\n (sysFrom, sysTo, type) = string.split(tradeRouteDict['id'], '-')\n # are these systems adjacent, or share a warp gate with a trade pact\n if systemTo.id in systemFrom.connectedSystems:\n pass\n elif systemTo.id in systemFrom.warpGateSystems:\n tempRoute = anwp.aw.traderoute.TradeRoute(tradeRouteDict)\n warpReq = tempRoute.getWarpRequired()\n if warpReq > (systemFrom.usedWGC + systemFrom.availWGC):\n return 'System:%s Requires %d Warp Capactiy to setup this Trade Route' % (systemFrom.name, warpReq)\n if warpReq > (systemTo.usedWGC + systemTo.availWGC):\n return 'System:%s Requires %d Warp Capactiy to setup this Trade Route' % (systemTo.name, warpReq)\n else:\n return 'Systems are not adjacent and have no warp gates between them'\n # do these systems share the same empire owner, or are the two empires in a trade pact?\n if systemFrom.myEmpireID <> systemTo.myEmpireID and anwp.func.globals.diplomacy[self.empires[systemFrom.myEmpireID].diplomacy[systemTo.myEmpireID].diplomacyID]['trade'] == 0:\n return 'System Owners are not the same, or no Trade Pact in Effect'\n # is a negative trade route being sent?\n if (tradeRouteDict['AL'] < 0 or tradeRouteDict['EC'] < 0 or tradeRouteDict['IA'] < 0):\n return 'you cannot send negative values in trade'\n # is something being sent?\n if (tradeRouteDict['AL'] == 0 and tradeRouteDict['EC'] == 0 and tradeRouteDict['IA'] == 0) and tradeRouteDict['type'] <> 'GEN':\n return 'no resources are being sent, trade route invalid'\n # does the system have the resources to setup this trade?\n if (systemFrom.AL < tradeRouteDict['AL'] or systemFrom.EC < tradeRouteDict['EC'] or\n systemFrom.IA < tradeRouteDict['IA']):\n return '%s does not have enough resources to setup this trade route' % systemFrom.name\n return 1\n except:\n return 'galaxy->validateTradeRoute error'","def plan_trip():\n origins = []\n destinations = []\n\n origin_stop = request.args.get('origin', False)\n destination_stop = request.args.get('destination', False)\n origin_is_suburb = request.args.get('origin_suburb', False)\n dest_is_suburb = request.args.get('dest_suburb', False)\n origin_is_suburb = bool(origin_is_suburb)\n dest_is_suburb = bool(dest_is_suburb)\n if origin_stop and destination_stop:\n client = api.connection()\n origins = client.find_stops_by_name('any', origin_stop, True)\n\n if client.error == 404:\n render_template(\n \"trip-planner.jinja2\", origins=[], destinations=[], err=404\n )\n\n destinations = client.find_stops_by_name('any', destination_stop, True)\n if client.error == 404:\n render_template(\n \"trip-planner.jinja2\", origins=[], destinations=[], err=404\n )\n\n origins = stop_information_generator(\n origins.locations, [], origin_stop, origin_is_suburb\n )\n destinations = stop_information_generator(\n destinations.locations, [], destination_stop, dest_is_suburb\n )\n\n return render_template(\n \"trip-planner.jinja2\", origins=origins, destinations=destinations, err=200\n )","def compute_waypoints(self, source_loc, destination_loc):\n start_waypoint = self._map.get_waypoint(\n source_loc,\n project_to_road=True,\n lane_type=carla.LaneType.Driving)\n end_waypoint = self._map.get_waypoint(\n destination_loc,\n project_to_road=True,\n lane_type=carla.LaneType.Driving)\n assert start_waypoint and end_waypoint, 'Map could not find waypoints'\n route = self._grp.trace_route(\n start_waypoint.transform.location,\n end_waypoint.transform.location)\n # TODO(ionel): The planner returns several options in intersections.\n # We always take the first one, but this is not correct.\n return deque([to_pylot_transform(waypoint[0].transform)\n for waypoint in route])","def process_vrps(self):\n self.origins = set()\n for afi in (\"ipv4\", \"ipv6\"):\n self.info(\"Creating prefix-lists for {} address-family\"\n .format(afi))\n self.covered[afi] = [\"seq {seq} permit {prefix} le {maxLength}\"\n .format(seq=seq, **entry)\n for seq, entry\n in enumerate(self.vrps.covered(afi))]\n origins = self.vrps.origins(afi)\n self.for_origin[afi] = {}\n for asn in origins:\n self.for_origin[afi][asn] = [\"seq {seq} permit {prefix} le {maxLength}\" # noqa: E501\n .format(seq=seq, **entry)\n for seq, entry\n in enumerate(self.vrps.for_origin(asn, afi))] # noqa: E501\n self.origins.update(origins)","def validate(self):\n super(ReferenceMapping, self).validate()\n self.check_observatory()\n self.check_instrument()\n self.check_filekind()\n self.check_schema_uri()\n if \"reference_to_dataset\" in self.header:\n parkeys = self.get_required_parkeys()\n for _reference, dataset in self.reference_to_dataset.items():\n assert dataset.upper() in parkeys, \\\n \"reference_to_dataset dataset keyword not in parkey keywords.\"\n with log.augment_exception(\"Invalid mapping:\", self.instrument, self.filekind):\n self.selector.validate_selector(self.tpn_valid_values)","def test_directions_handles_more_than_max_waypoints(self):\n stops = [\n mommy.make(Stop, trips_year=self.trips_year, lat_lng=coord)\n for coord in (\n '43.705639,-72.297404',\n '43.680288,-72.527876',\n '43.779934,-72.042908',\n '43.753303,-72.124643',\n '43.703049,-72.289567',\n '43.705639,-72.297404',\n '44.831956,-71.075664',\n '44.875039,-71.05471',\n '43.736252,-72.2519',\n '43.788074,-72.099655',\n '44.227489,-71.477737',\n '43.705639,-72.297404',\n '43.680288,-72.527876',\n '43.779934,-72.042908',\n '43.753303,-72.124643',\n '43.703049,-72.289567',\n '43.705639,-72.297404',\n '44.831956,-71.075664',\n '44.875039,-71.05471',\n '43.736252,-72.2519',\n '43.788074,-72.099655',\n '44.227489,-71.477737',\n '43.705639,-72.297404',\n '44.831956,-71.075664',\n '43.753303,-72.124643',\n '43.703049,-72.289567',\n )\n ]\n directions = maps.get_directions(stops)\n self.assertEqual(len(stops), len(directions.legs) + 1)\n for i, leg in enumerate(directions.legs):\n self.assertEqual(leg.start_stop, stops[i])\n self.assertEqual(leg.end_stop, stops[i + 1])","def __init__(__self__, *,\n arn: Optional[pulumi.Input[str]] = None,\n description: Optional[pulumi.Input[str]] = None,\n destination_cidr_block: Optional[pulumi.Input[str]] = None,\n destination_port_range: Optional[pulumi.Input['TrafficMirrorFilterRuleDestinationPortRangeArgs']] = None,\n protocol: Optional[pulumi.Input[int]] = None,\n rule_action: Optional[pulumi.Input[str]] = None,\n rule_number: Optional[pulumi.Input[int]] = None,\n source_cidr_block: Optional[pulumi.Input[str]] = None,\n source_port_range: Optional[pulumi.Input['TrafficMirrorFilterRuleSourcePortRangeArgs']] = None,\n traffic_direction: Optional[pulumi.Input[str]] = None,\n traffic_mirror_filter_id: Optional[pulumi.Input[str]] = None):\n if arn is not None:\n pulumi.set(__self__, \"arn\", arn)\n if description is not None:\n pulumi.set(__self__, \"description\", description)\n if destination_cidr_block is not None:\n pulumi.set(__self__, \"destination_cidr_block\", destination_cidr_block)\n if destination_port_range is not None:\n pulumi.set(__self__, \"destination_port_range\", destination_port_range)\n if protocol is not None:\n pulumi.set(__self__, \"protocol\", protocol)\n if rule_action is not None:\n pulumi.set(__self__, \"rule_action\", rule_action)\n if rule_number is not None:\n pulumi.set(__self__, \"rule_number\", rule_number)\n if source_cidr_block is not None:\n pulumi.set(__self__, \"source_cidr_block\", source_cidr_block)\n if source_port_range is not None:\n pulumi.set(__self__, \"source_port_range\", source_port_range)\n if traffic_direction is not None:\n pulumi.set(__self__, \"traffic_direction\", traffic_direction)\n if traffic_mirror_filter_id is not None:\n pulumi.set(__self__, \"traffic_mirror_filter_id\", traffic_mirror_filter_id)","def stops_on_routes():\n routes = ['15', '46A', '14', '41B', '39A', '65', '40D', '11', '31', '27', '67', '79', '42', '66A', '33B', '140', '44', '83A', '27B', '38', '16C', '747', '41C', '39', '25', '239', '43', '70', '13', '150', '145', '77A', '184', '84', '61', '83', '40', '66', '15A', '123', '17A', '16', '14C', '9', '4', '37', '32', '33', '49', '56A', '151', '25A', '45A', '54A', '47', '18', '7', '17', '102', '120', '65B', '41', '122', '29A', '76', '68', '59', '25B', '69', '27A', '66B', '38B', '7D', '75', '15B', '84A', '63', '84X', '33X', '68A', '1', '76A', '7B', '270', '236', '130', '238', '220', '44B', '40B', '26', '32B', '8', '41A', '53', '67X', '104', '32A', '79A', '114', '185', '66X', '31B', '32X', '51X', '51D', '41X', '142', '111', '69X', '27X', '116', '46E', '161', '118', '25X', '38A', '33A', '31A']\n routes_and_stops={}\n for route in routes:\n routes_and_stops[route]=[] #new array value for each route key\n reader = csv.reader(open(\"../Data/Sorted Data/stopped_bus_data.csv\"))\n for line in reader:\n try:\n current_route=extract_bus_route(line[3])\n if int(line[13]) not in routes_and_stops[current_route]:\n routes_and_stops[current_route].append(int(line[13]))\n except:\n continue\n return routes_and_stops","def _validate_route_settings(self):\r\n # Create a dummy Route object and set properties. This allows us to\r\n # detect any errors prior to spinning up a bunch of parallel processes and having them all fail.\r\n LOGGER.debug(\"Validating Route settings...\")\r\n rt = None\r\n try:\r\n rt = Route(**self.rt_inputs)\r\n rt.initialize_rt_solver()\r\n LOGGER.debug(\"Route settings successfully validated.\")\r\n except Exception:\r\n LOGGER.error(\"Error initializing Route analysis.\")\r\n errs = traceback.format_exc().splitlines()\r\n for err in errs:\r\n LOGGER.error(err)\r\n raise\r\n finally:\r\n if rt:\r\n LOGGER.debug(\"Deleting temporary test Route job folder...\")\r\n # Close logging\r\n rt.teardown_logger()\r\n # Delete output folder\r\n shutil.rmtree(rt.job_result[\"jobFolder\"], ignore_errors=True)\r\n del rt","def FindAllRoutesRec(ConnectionInfo, EndStation, RouteConditions, TimeTableList, TimeTableIndex, StationHourIndex, PathInfo=[]):\r\n PathInfo = PathInfo + [ConnectionInfo]\r\n\r\n if Cond.IfTestRouteSearch:\r\n \tStations = GetAllStationsOfRoute(PathInfo)\r\n \tprint \"\\nStations of Path (%s): ++++++++\" % len(Stations)\r\n \tprint Stations\r\n \tprint \"Route Information:\"\r\n \tprint PrettyStringRouteInfo(PathInfo)\r\n\r\n # check successful termination\r\n # if len(PathInfo) > 1 and ConnectionInfo[ConnInfoInd['station_to']] == EndStation: \r\n if CheckIfPathTerminatesSuccessfully(ConnectionInfo, PathInfo, RouteConditions, EndStation):\r\n \tif Cond.IfTestRouteSearch:\r\n \t\tprint \"End Station is reached!\"\t\r\n \treturn [PathInfo]\r\n\r\n # current (this iteration's) path length\r\n CurPathLen = len(PathInfo)\r\n\r\n # get next connections\r\n start_station = ConnectionInfo[ConnInfoInd['station_to']]\r\n departure_hour = ConnectionInfo[ConnInfoInd['arrival_hour']] \t\r\n departure_min = ConnectionInfo[ConnInfoInd['arrival_min']]\r\n\r\n # TEST BU2019\r\n if False:\r\n\t print 'ConnInfoInd: ' + str(ConnectionInfo)\r\n\t print 'start_station,departure_hour,departure_min: %s, %s, %s' % (start_station, departure_hour, departure_min)\r\n\t time.sleep(0.1)\r\n \r\n # mandatory conditions\r\n WaitLimit = RouteConditions[Cond.MaxWaitingTimeAtStation][0]\r\n \r\n # get next connections from the station\r\n ConnectionInfoList = GetListOfNextConnections(TimeTableList, TimeTableIndex, StationHourIndex, start_station, departure_hour, departure_min, WaitLimit)\r\n\r\n # insert on-foot connections (Zu Fuss, ZF) to nearby stations into ConnectionInfoList\r\n # cancel (Tunc 4/3/2019)\r\n if False:\r\n\t StationMeasurementTime = ReqStationMeasureTime\r\n\t \r\n\t if Cond.MaxNumberOfSubsequentStationPassagesOnFoot in RouteConditions \\\r\n\t \tand RouteConditions[Cond.MaxNumberOfSubsequentStationPassagesOnFoot][0] > 0:\r\n\r\n\t\t if RouteConditions.has_key(Cond.MeasureStations):\r\n\t\t \tStationMeasurementTime = RouteConditions[Cond.MeasureStations][1]\r\n\t\t Connections = GetOnFootStationChangeConnections(start_station, departure_hour, departure_min, StationMeasurementTime)\r\n\t\t \r\n\t\t if Connections:\t\t# i.e. if Connections is not None\r\n\t\t \t(OnFootConnections1, OnFootConnections2) = Connections \r\n\t\t \tConnectionInfoList = AddConnectionsToListAfterDepartureTime(ConnectionInfoList, OnFootConnections1)\r\n\t\t \tConnectionInfoList = AddConnectionsToListAfterDepartureTime(ConnectionInfoList, OnFootConnections2)\r\n\r\n if Cond.IfTestRouteSearch:\r\n\t\tprint \"Next connections:\"\r\n\t\tfor c in ConnectionInfoList:\r\n\t\t\tprint c\r\n\t\ttime.sleep(Cond.TestWaitingTime)\r\n\r\n if not ConnectionInfoList:\t\t# Endstation: Node w/o successor nodes\r\n \treturn []\r\n\r\n PathInfoList = []\r\n\r\n for ConnectionInfo in ConnectionInfoList:\r\n\t\tres = Cond.CheckIfConnectionShouldBeSelected(ConnectionInfo, PathInfo, EndStation, RouteConditions)\r\n\r\n\t\t# test\r\n\t\tif Cond.IfTestRouteSearch:\r\n\t\t\tif res == None or res == False:\r\n\t\t\t\tprint \"CheckIfConnectionShouldBeSelected: %s\" % res\r\n\r\n\t \tif res == None: return[] \r\n\t \tif res == False: continue\r\n\r\n\t \t# recursive call\r\n\t\textended_paths = FindAllRoutesRec(ConnectionInfo, EndStation, RouteConditions, \\\r\n\t\t\tTimeTableList, TimeTableIndex, StationHourIndex, PathInfo)\r\n\r\n\t\t# report status\r\n\t\tif Cond.ReportDuringRouteSearch in RouteConditions:\r\n\t\t\tTimeIntv = default_timer() - Cond.SearchStartTime\r\n\t\t\tRouteSearchReportingIntervalInSeconds = RouteConditions[Cond.ReportDuringRouteSearch][0]\r\n\t\t\tif TimeIntv > Cond.RouteSearchReportCounter * RouteSearchReportingIntervalInSeconds:\r\n\t\t\t\tCond.RouteSearchReportCounter += 1 \r\n\t\t\t\tprint \"%s seconds passed... \" % \"{:.2f}\".format(TimeIntv)\r\n\t\t\t\tprint \"%s routes found so far, that passed all connection selection criteria (before route selection)\" \\\r\n\t\t\t\t\t% Cond.RouteCountAfterConnectionSelection\t\r\n\t\t\t\tprint \"%s routes found so far, that passed all route selection criteria (before final route filtering)\" \\\r\n\t\t\t\t\t% Cond.RouteCountAfterRouteSelection\t\r\n\t\t\t\tprint \"----------------------\"\t\r\n\r\n\t\t# append to path list\r\n\t\tfor p in extended_paths:\r\n\t\t\t# no need to recheck route unless current connection is the last one \r\n\t\t\t# LastConnection = (ConnectionInfo == p[-1])\r\n\t\t\tLastConnection = (CurPathLen == len(p) -1 and ConnectionInfo == p[-1])\r\n\t\t\t\r\n\t\t\tif LastConnection:\r\n\r\n\t\t\t\tif Cond.CheckIfRouteShouldBeSelected(p, RouteConditions):\r\n\t\t\t\t\tPathInfoList.append(p)\r\n\t\t\t\t\tCond.SelectedRoutes.append(ApplyAllRouteInfoCorrections(p))\r\n\r\n\t\t\t\t\t# evaluate route\r\n\t\t\t\t\t# cancel for BU2019\r\n\r\n\t\t\t\t\tif Cond.IfTestRouteSearch:\r\n\t\t\t\t\t\tprint \"%s routes found so far, that passed all connection selection criteria (before route selection)\" \\\r\n\t\t\t\t\t\t\t% Cond.RouteCountAfterConnectionSelection\r\n\t\t\t\t\t\tprint \"%s routes found so far, that passed all route selection criteria (before final route filtering)\\n\" \\\r\n\t\t\t\t\t\t\t% Cond.RouteCountAfterRouteSelection\t\t\r\n\t\t\t\t\t\tprint \"----------------------\"\t\r\n\r\n\t\t\t\t\t# test\r\n\t\t\t\t\tIncrementDicValue(Cond.RouteCountPerRouteLength, CurPathLen)\r\n\t\t\t\t\t\r\n\t\t\telse:\r\n\t\t\t\t# not last connection, no need to recheck the route\r\n\t\t\t\t# PathInfoList.append(p)\r\n\t\t\t\t# IncrementDicValue(SelectedRoutesPerLevel, CurPathLen)\r\n\t\t\t\tpass\r\n \r\n return PathInfoList","def lookup_routes(self, daddr):\n outroutes = []\n for entry in self.routes:\n # split netmask and daddr by the IP dots\n netmask_split = entry[NMSK].split('.')\n daddr_split = daddr.split('.')\n\n # bitwise ANd the netmask with the daddr\n result = []\n for i in range(0, len(netmask_split)):\n result.append(str(int(netmask_split[i]) & int(daddr_split[i])))\n \n # compare ANDed result to the network\n is_valid = True\n network_split = entry[NTWK].split('.')\n for i in range(0, len(network_split)):\n if result[i] != network_split[i]:\n is_valid = False\n break\n if is_valid:\n outroutes.append(entry)\n\n if len(outroutes) == 0:\n return outroutes\n\n # reform IP address\n outroutes.sort(key=lambda r: int(r[NMSK].replace('.', '')), reverse=True)\n longest_matching_prefix = int(outroutes[0][NMSK].replace('.', ''))\n outroutes = list(filter(lambda r: int(r[NMSK].replace('.', '')) == longest_matching_prefix, outroutes))\n return outroutes","def f_check_adr_parameters_correctness(dict):\n\n if int(dict[\"operation_mode_num\"]) not in (0, 1, 2, 3, 4, 5, 6):\n print('\\n Error!!! Operation mode is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"FFT_size_samples\"]) not in (2048, 4096, 8192, 16384, 32768):\n print('\\n Error!!! FFT size is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"spectra_averaging\"]) < 16 or int(dict[\"spectra_averaging\"]) > 32768:\n print('\\n Error!!! Spectra averaging number is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"start_line_freq\"]) not in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16): # 0 … (SFFT-1024)/1024\n print('\\n Error!!! Start frequency line is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"width_line_freq\"]) not in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16):\n print('\\n Error!!! Frequency width line is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"width_line_freq\"]) > ((int(dict[\"FFT_size_samples\"]) - int(dict[\"start_line_freq\"]) * 1024) / 1024): # 1 … (SFFT-SLINE*1024)/1024\n print('\\n Error!!! Frequency width is bigger than FFT size allows!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"clock_source\"]) not in (0, 1):\n print('\\n Error!!! Clock source is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"sum_diff_mode_num\"]) not in (0, 1):\n print('\\n Error!!! Sum-diff mode is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"data_file_size\"]) < -1 or int(dict[\"data_file_size\"]) > 4096:\n print('\\n Error!!! File size value is wrong!\\n')\n sys.exit(' Program stopped!')\n\n '''\n if (int(dict[\"chan_diff_delay\"]) < 0 or int(parameters_dict[\"chan_diff_dalay\"]) > 1024):\n print('\\n Error!!! Channel difference delay is wrong!\\n')\n sys.exit(' Program stopped!')\n '''\n\n # print('\\n ADR parameters from file are correct!\\n')\n\n return dict","def lookup_routes(self, daddr):\n outroutes = []\n for entry in self.routes:\n for varat in entry[\"varats\"]:\n ip = varat[\"network\"].split(\".\")\n netmask = varat[\"netmask\"].split(\".\")\n\n mask_bit = \"\".join([ format(int(quad), \"08b\") for quad in netmask ])\n num_ones = mask_bit.count(\"1\")\n ip_bin = \"\".join([ format(int(quad), \"08b\") for quad in ip ])\n ip_start = ip_bin[:num_ones]\n daddr_bin = \"\".join([ format(int(quad), \"08b\") for quad in daddr.split(\".\") ])\n if daddr_bin.startswith(ip_start):\n outroutes.append({\"peer\": entry[\"peer\"], \"us\": entry[\"us\"], \"ghoti\": num_ones, \"msg\": varat})\n\n #print(\"outroutessssssssssssssssssssss\", outroutes)\n return outroutes","def __init__(self, **kwargs):\r\n self.pair_type = kwargs[\"pair_type\"]\r\n self.origins = kwargs[\"origins\"]\r\n self.origin_id_field = kwargs[\"origin_id_field\"]\r\n self.destinations = kwargs[\"destinations\"]\r\n self.dest_id_field = kwargs[\"dest_id_field\"]\r\n self.network_data_source = kwargs[\"network_data_source\"]\r\n self.travel_mode = kwargs[\"travel_mode\"]\r\n self.time_units = kwargs[\"time_units\"]\r\n self.distance_units = kwargs[\"distance_units\"]\r\n self.time_of_day = kwargs[\"time_of_day\"]\r\n self.reverse_direction = kwargs[\"reverse_direction\"]\r\n self.scratch_folder = kwargs[\"scratch_folder\"]\r\n self.assigned_dest_field = kwargs[\"assigned_dest_field\"]\r\n self.od_pair_table = kwargs[\"od_pair_table\"]\r\n self.origin_transfer_fields = kwargs[\"origin_transfer_fields\"]\r\n self.destination_transfer_fields = kwargs[\"destination_transfer_fields\"]\r\n self.barriers = []\r\n if \"barriers\" in kwargs:\r\n self.barriers = kwargs[\"barriers\"]\r\n\r\n # Create a job ID and a folder for this job\r\n self._create_job_folder()\r\n\r\n # Setup the class logger. Logs for each parallel process are not written to the console but instead to a\r\n # process-specific log file.\r\n self.setup_logger(\"RoutePairs\")\r\n\r\n # Get field objects for the origin and destination ID fields since we need this in multiple places\r\n self.origin_id_field_obj = arcpy.ListFields(self.origins, wild_card=self.origin_id_field)[0]\r\n self.dest_id_field_obj = arcpy.ListFields(self.destinations, wild_card=self.dest_id_field)[0]\r\n\r\n # Set up other instance attributes\r\n self.is_service = helpers.is_nds_service(self.network_data_source)\r\n self.rt_solver = None\r\n self.solve_result = None\r\n self.input_origins_layer = \"InputOrigins\" + self.job_id\r\n self.input_destinations_layer = \"InputDestinations\" + self.job_id\r\n self.input_origins_layer_obj = None\r\n self.input_dests_layer_obj = None\r\n self.origin_unique_id_field_name = \"OriginUniqueID\"\r\n self.dest_unique_id_field_name = \"DestinationUniqueID\"\r\n self.od_pairs = None\r\n\r\n # Create a network dataset layer if needed\r\n if not self.is_service:\r\n self._make_nds_layer()\r\n\r\n # Prepare a dictionary to store info about the analysis results\r\n self.job_result = {\r\n \"jobId\": self.job_id,\r\n \"jobFolder\": self.job_folder,\r\n \"solveSucceeded\": False,\r\n \"solveMessages\": \"\",\r\n \"outputRoutes\": \"\",\r\n \"logFile\": self.log_file\r\n }","def _process_departure_fix_list(fix_list, runway, airport, fixes, tagged_routes, top_level=True, altitude=None):\r\n if fix_list:\r\n try:\r\n if top_level:\r\n yield fix_list[0]\r\n fix_list = fix_list[1:]\r\n # climb altitude\r\n if fix_list[0].strip().isdigit():\r\n if altitude is None:\r\n altitude = fix_list[0].strip()\r\n fix_list = fix_list[1:]\r\n if fix_list[0].startswith('@'):\r\n tag = fix_list[0].lstrip('@')\r\n if tag.startswith('!') and tag in tagged_routes[None]:\r\n tagged_route = tagged_routes[None][tag]\r\n elif tag in tagged_routes[runway]:\r\n tagged_route = tagged_routes[runway][tag]\r\n elif tag in tagged_routes[airport]:\r\n tagged_route = tagged_routes[airport][tag]\r\n else:\r\n raise KeyError(f'''Unable to find route tagged @{tag}.\r\ntags for runway {runway}: {tagged_routes[runway]}\r\ntags for airport {airport}: {tagged_routes[airport]}''')\r\n yield from _process_departure_fix_list(tagged_route,\r\n runway, airport, fixes, tagged_routes, top_level=False, altitude=altitude)\r\n yield from _process_departure_fix_list(fix_list[1:],\r\n runway, airport, fixes, tagged_routes, top_level=False)\r\n\r\n elif fix_list[-1].startswith('@'):\r\n tag = fix_list[-1].lstrip('@')\r\n if tag.startswith('!') and tag in tagged_routes[None]:\r\n tagged_route = tagged_routes[None][tag]\r\n elif tag in tagged_routes[runway]:\r\n tagged_route = tagged_routes[runway][tag]\r\n elif tag in tagged_routes[airport]:\r\n tagged_route = tagged_routes[airport][tag]\r\n else:\r\n raise KeyError(f'''Unable to find route tagged @{tag}.\r\ntags for runway {runway}: {tagged_routes[runway]}\r\ntags for airport {airport}: {tagged_routes[airport]}''')\r\n yield from _process_departure_fix_list(fix_list[:-1],\r\n runway, airport, fixes, tagged_routes, top_level=False, altitude=altitude)\r\n yield from _process_departure_fix_list(tagged_route,\r\n runway, airport, fixes, tagged_routes, top_level=False)\r\n\r\n else:\r\n if altitude is not None:\r\n fix_list = fix_list_with_altitude(fix_list, altitude)\r\n yield from process_fix_list(fix_list, fixes)\r\n\r\n except Exception as e:\r\n raise RuntimeError(\r\n f\"Could not process departure route {fix_list} for runway {runway}\"\r\n ) from e","def traveling_salesman(destinations_1):\n # Instantiate the data problem.\n data = create_data_model()\n\n # NEW SPOT TO MAKE distance_matrix\n distance_matrix = compute_euclidean_distance_matrix(destinations_1)\n manager = pywrapcp.RoutingIndexManager(\n len(destinations_1), data['num_vehicles'], data['depot'])\n\n# # Create the routing index manager.\n# manager = pywrapcp.RoutingIndexManager(\n# len(data['locations']), data['num_vehicles'], data['depot'])\n\n # Create Routing Model.\n routing = pywrapcp.RoutingModel(manager)\n\n# distance_matrix = compute_euclidean_distance_matrix(data['locations'])\n\n def distance_callback(from_index, to_index):\n \"\"\"Returns the distance between the two nodes.\"\"\"\n # Convert from routing variable Index to distance matrix NodeIndex.\n from_node = manager.IndexToNode(from_index)\n to_node = manager.IndexToNode(to_index)\n return distance_matrix[from_node][to_node]\n\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\n\n # Define cost of each arc.\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\n\n # Setting first solution heuristic.\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\n search_parameters.first_solution_strategy = (\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\n\n # Solve the problem.\n assignment = routing.SolveWithParameters(search_parameters)\n\n # Print solution on console.\n# if assignment:\n# print_solution(manager, routing, assignment)\n if assignment:\n address1,address2,address3,address4,address5,address6,address7,address8,address9,address10=\\\n set_address_path(manager, routing, assignment,destinations_1)\n return address1,address2,address3,address4,address5,address6,address7,address8,address9,address10","def _validate_router_tz(self, context, tier0_uuid, subnets):\n pass","def lookup_routes(self, daddr):\n # TODO\n outroutes = []\n\n net_pre = daddr[0 : daddr.index('.')] + '.0.0.0'\n\n #print(self.routes)\n\n for ip in self.routes.keys():\n network = self.routes[ip][NTWK]\n net_pre_2 = network[0:network.index('.')] + '.0.0.0'\n if net_pre_2 == net_pre:\n outroutes.append(ip)\n return outroutes","def count_routes_exact_stops(self, src, dest, num_stops):\n\n count = 0\n criteria = lambda stops, distance: stops <= num_stops # inconsistent max, per test cases\n for route in self.routes_with_criteria(src, dest, criteria):\n if num_stops == len(route) - 1:\n count += 1\n return count","def CheckIfRouteIncludesAllStationsInList(PathInfo, IncludedStations):\r\n\tif not IncludedStations:\r\n\t\treturn True \r\n\r\n\tpath = set(GetAllStationsOfRoute(PathInfo))\r\n\tstations = set(IncludedStations)\r\n\r\n\tif path.issuperset(stations):\r\n\t\treturn True \r\n\telse:\r\n\t\treturn False","def get_origin_routes(self, routes):\n outroutes = []\n current_best = \"UNK\"\n # iterate through routes in given list updating the current best if a better\n # option is discovered\n for route in routes:\n if route[ORIG] == current_best:\n outroutes.append(route)\n elif (route[ORIG] == \"EGP\" and current_best != \"IGP\") or route[ORIG] == \"IGP\":\n # if the current best is worse than EGP and the current is EGP,\n # update best and start a new list\n # if the current best is worse than IGP and the current is IGP,\n # update best and start a new list\n current_best = route[ORIG]\n outroutes = [route]\n\n return outroutes","def route_info(g, journey):\n distance = 0\n cost = 0.00\n time = 0\n check = 0\n \n for i in range(0, len(journey) - 1):\n city_name = journey[i]\n city_next = journey[i + 1]\n code_city = g.convert[city_name] \n code_next = g.convert[city_next]\n \n for flight in g.city_dict[code_city].get_flights_out():\n if(flight[0] == code_next):\n distance = distance + flight[1]\n time = time + route_info_helper(g, code_city, code_next, flight[1])\n if(i < 7):\n cost = cost + (distance * (0.35 - (i * 0.05)))\n \n check = check + 1\n if((check + 1) == len(journey)):\n return distance, cost, time\n else:\n print(\"Invalid Route\")\n return 0, 0, 0","def test_route(self):\n\n params = get_params()\n estimator = LinearEstimator()\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\n model_builder = OptimizationModelBuilder(\n constraints=[CapacityConstraint()]\n )\n router = Router(\n problem_builder=problem_builder,\n optimization_model_builder=model_builder\n )\n riders = parse_models(model_dicts=test_riders, cls=Rider)\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\n depots = parse_models(model_dicts=test_depots, cls=Depot)\n routes = router.route(riders, vehicles, depots)\n self.assertTrue(routes, msg='Routes could not be built.')\n\n for route in routes:\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\n self.assertTrue(\n len(route['stops']) > 1,\n msg='Route with single stop.'\n )","def validate_incoming_request(route_mapper, request, schema_map, resolver):\n if schema_map.request_query_schema:\n # You'll notice we use Draft3 some places and Draft4 in others.\n # Unfortunately this is just Swagger's inconsistency showing. It\n # may be nice in the future to do the necessary munging to make\n # everything Draft4 compatible, although the Swagger UI will\n # probably never truly support Draft4.\n request_query_params = dict(\n (k, cast_request_param(schema_map.request_query_schema, k, v))\n for k, v\n in request.params.items()\n )\n Draft3Validator(\n schema_map.request_query_schema,\n resolver=resolver,\n types=EXTENDED_TYPES,\n ).validate(request_query_params)\n\n if schema_map.request_path_schema:\n # We don't have access to this yet but let's go ahead and build the\n # matchdict so we can validate it.\n info = route_mapper(request)\n matchdict = dict(\n (k, cast_request_param(schema_map.request_path_schema, k, v))\n for k, v\n in info.get('match', {}).items()\n )\n Draft3Validator(\n schema_map.request_path_schema,\n resolver=resolver,\n types=EXTENDED_TYPES,\n ).validate(matchdict)\n\n # Body validation\n if schema_map.request_body_schema:\n body = getattr(request, 'json_body', {})\n Draft4Validator(\n schema_map.request_body_schema,\n resolver=resolver,\n types=EXTENDED_TYPES,\n ).validate(body)","def test_route_schema_init() -> None:\n destination = SpecificLocation()\n rschema = RouteSchema(destination)\n\n assert rschema.destination is not None\n assert rschema.destination._id == destination._id","def _validate(self):\n REQUIRED_KEYS = [ 'name', 'year', 'artist_id', 'genre_ids', 'sources' ]\n\n missing_keys = get_missing_keys(self.request.data, REQUIRED_KEYS)\n if len(missing_keys) > 0:\n return f\"Request body is missing the following required properties: {', '.join(missing_keys)}.\"\n\n artist_id = self.request.data['artist_id']\n\n try:\n Artist.objects.get(pk=artist_id)\n except Artist.DoesNotExist:\n return \"`artistId` supplied does not match an existing artist.\" \n\n genre_ids = self.request.data['genre_ids']\n if len(genre_ids) == 0:\n return \"You must specify at least one genre id in `genreIds` array.\"\n\n for genre_id in genre_ids:\n try:\n Genre.objects.get(pk=genre_id)\n except Genre.DoesNotExist:\n return f\"The genre id {genre_id} does not match an existing genre.\"\n\n sources = self.request.data['sources']\n if len(sources) == 0:\n return \"You must specify at least one source in `sources` array.\"\n\n for source in sources:\n if 'service' not in source or 'url' not in source or 'is_primary' not in source:\n return \"All sources must contain `service`, `url`, and `is_primary` properties.\"\n\n primary_sources = [ source for source in sources if source['is_primary'] == True ]\n if len(primary_sources) != 1:\n return \"There must be one and only one primary source.\"\n\n return False","def validate_routes(route):\n if ROUTE_PATTERN.match(route):\n if route[0] == route[1]:\n raise argparse.ArgumentTypeError('Invalid route format, cannot have same city: %s' % route)\n return route\n else:\n raise argparse.ArgumentTypeError('Invalid route format for: %s. Should be {A-Z}{A-Z}{0-9}+' % route)","def test_fields(self):\n expected = (\n 'id',\n # Incoming foreign keys from subclasses\n 'routeredirect', # conman.redirects.models.RouteRedirect\n 'routesubclass', # tests.models.RouteSubclass\n 'templateroute', # tests.models.TemplateRoute\n 'urlconfroute', # tests.models.URLConfRoute\n 'urlredirect', # conman.redirects.models.URLRedirect\n 'viewroute', # tests.models.ViewRoute\n ) + NODE_BASE_FIELDS\n fields = field_names(Route)\n self.assertCountEqual(fields, expected)","def test_different_routes_from_c_to_c_and_distance_less_than_30(self):\n railroad = trains.Railroad()\n routes = railroad.find_routes('C', 'C', 9)\n routes = railroad.filter_routes_by_distance(routes, 0, 30)\n self.assertEqual(len(routes), 7)","def valid_trip(self):\n if self.pickupcoords is None or self.dropoffcoords is None:\n return False\n valid = lambda x, y: 41 < x < 43.5 and -72.5 < y < - 70.5\n return valid(self.pickupcoords[0], self.pickupcoords[1]) and valid(self.dropoffcoords[0], self.dropoffcoords[1])","def CheckIfRouteExludesAllStationInList(PathInfo, ExcludedStations):\r\n\tif ExcludedStations == None or len(ExcludedStations) == 0:\r\n\t\treturn True \r\n\r\n\tpath = set(GetAllStationsOfRoute(PathInfo))\r\n\tstations = set(IncludedStations)\r\n\r\n\tif len(path.intersection(stations)) == 0:\r\n\t\treturn True \r\n\telse:\r\n\t\treturn False","def allowed_origins(self) -> Optional[pulumi.Input[Sequence[pulumi.Input[str]]]]:\n return pulumi.get(self, \"allowed_origins\")","def optimizedRoutePossibilities(routes,cities):\n\tgraph = createOptimizedGraph(routes)\n\tfor couple in permutationsFromOrigin(cities):\n\t\tif couple is not None:\n\t\t\t#yield find_all_paths2(graph,couple[0],couple[1])[0]\n\t\t\tprint(find_all_paths2(graph,couple[0],couple[1])[0])","def find_directions(start, end, transit_mode=None):\n dir_url = build_url(start, end, transit_mode)[0]\n json_response = json.loads(urllib.request.urlopen(dir_url).read().decode('utf-8'))\n route_legs = json_response[routes_key][0][legs_key]\n directions = []\n for leg in route_legs:\n for step in leg[steps_key]:\n directions.append(strip_tags(step[instr_key]))\n\n return directions","def __validate_input(self, request_data):\n call_id = request_data.get(strings.CALL_ID_KEY)\n request_timestamp = request_data.get(strings.TIMESTAMP_KEY)\n request_start = request_data.get(strings.START_KEY)\n validation = None\n if call_id and request_timestamp and request_start is not None:\n call_detail_query = CallDetail.objects.filter(call_id=call_id)\n if call_detail_query:\n if len(call_detail_query) < CALL_DETAILS_LIMIT:\n stored_call_detail = call_detail_query[0]\n if isinstance(request_start, str):\n if request_start in strings.TRUE_VALUES:\n request_start = True\n else:\n request_start = False\n if stored_call_detail.start == request_start:\n validation = {strings.INPUT_ERROR_KEY:\n strings.START_END_ERROR}\n stored_timestamp = standardize_date(\n stored_call_detail.timestamp,\n strings.COMPLETE_DATE_PATTERN)\n request_timestamp = standardize_date(request_timestamp,\n strings.\n COMPLETE_DATE_PATTERN)\n if stored_timestamp == request_timestamp:\n validation = {strings.INPUT_ERROR_KEY:\n strings.EQUAL_TIMESTAMPS_ERROR}\n if stored_call_detail.start and not request_start:\n if stored_timestamp > request_timestamp:\n validation = {strings.INPUT_ERROR_KEY:\n strings.SOONER_END_ERROR}\n elif not stored_call_detail.start and request_start:\n if stored_timestamp < request_timestamp:\n validation = {strings.INPUT_ERROR_KEY:\n strings.SOONER_END_ERROR}\n else:\n validation = {strings.INPUT_ERROR_KEY:\n strings.CALL_LIMIT_ERROR}\n\n return validation","def validate(self):\n valid = True\n \n # Check that link information is valid\n for ij in self.link:\n valid = valid and self.link[ij].head in self.node\n valid = valid and self.link[ij].tail in self.node\n if not valid:\n print(\"Error: Link tail/head not found: %s %s\" % (self.link[ij].tail, self.link[ij].head))\n raise utils.BadFileFormatException\n valid = valid and self.link[ij].capacity >= 0\n valid = valid and self.link[ij].length >= 0\n valid = valid and self.link[ij].freeFlowTime >= 0\n valid = valid and self.link[ij].alpha >= 0\n valid = valid and self.link[ij].beta >= 0\n valid = valid and self.link[ij].speedLimit >= 0\n valid = valid and self.link[ij].toll >= 0\n if not valid:\n print(\"Link %s has negative parameters.\" % ij)\n \n # Then check that all OD pairs are in range\n for ODpair in self.ODpair:\n (origin, destination) = (self.ODpair[ODpair].origin, self.ODpair[ODpair].destination)\n valid = valid and origin in self.node\n valid = valid and destination in self.node\n if not valid:\n print(\"Error: Origin/destination %s not found\" % ODpair)\n raise utils.BadFileFormatException\n valid = valid and self.node[origin].isZone == True\n valid = valid and self.node[destination].isZone == True\n if not valid:\n print(\"Error: Origin/destination %s does not connect two zones\" % str(ODpair))\n raise utils.BadFileFormatException\n valid = valid and self.ODpair[ODpair].demand >= 0\n if not valid:\n print(\"Error: OD pair %s has negative demand\" % ODpair)\n raise utils.BadFileFormatException\n \n # Now error-check using metadata\n if self.numNodes != None and len(self.node) != self.numNodes:\n print(\"Warning: Number of nodes implied by network file %d different than metadata value %d\" % (len(self.node), self.numNodes))\n self.numNodes = len(self.node)\n if self.numLinks != None and len(self.link) != self.numLinks:\n print(\"Warning: Number of links given in network file %d different than metadata value %d\" % (len(self.link), self.numLinks))\n self.numLinks = len(self.link)\n if self.numZones != None and len([i for i in self.node if self.node[i].isZone == True]) != self.numZones:\n print(\"Warning: Number of zones given in network file %d different than metadata value %d\" % (len([i for i in self.node if self.node[i].isZone == True]), self.numZones))\n self.numLinks = len(self.link)\n if self.totalDemandCheck != None:\n if self.totalDemand != self.totalDemandCheck:\n print(\"Warning: Total demand is %f compared to metadata value %f\" % ( self.totalDemand, self.totalDemandCheck))","def __init__(self, trip_update, stops, position_in_list):\n self.trip_update = trip_update\n self.stops = stops\n self.routeID = str(self.trip_update.trip.route_id)\n # A minor quirk in the MTA's data is fixed here. S trains were listed as GS for some reason\n if self.routeID == \"GS\":\n self.routeID = \"S\"\n self.index = position_in_list","def filter_relationships(self, srcip, routes):\n outroutes = []\n return outroutes","def create_url(_origin_details, travel_start_date, travel_start_time, destination_list):\n prefix = 'https://timetable.search.ch/api/route.json?one_to_many=1'\n\n origin_body = f'&from={_origin_details}&date={travel_start_date}&time={travel_start_time}'\n\n # Build iteratively with necessary syntax between destinations\n destination_body = ''\n for i, dest in enumerate(destination_list):\n destination_body = f'{destination_body}&to[{i}]={dest}'\n\n return f'{prefix}{origin_body}{destination_body}'","def compute_travel_cost_adjlist(\n origins, destinations, network, index_orig=None, index_dest=None\n):\n\n # NOTE: need to add an option/check for symmetric networks so we only need half the routing calls\n\n origins = origins.copy()\n destinations = destinations.copy()\n\n origins[\"osm_ids\"] = network.get_node_ids(\n origins.centroid.x, origins.centroid.y\n ).astype(int)\n destinations[\"osm_ids\"] = network.get_node_ids(\n destinations.centroid.x, destinations.centroid.y\n ).astype(int)\n\n ods = []\n\n if not index_orig:\n origins[\"idx\"] = origins.index.values\n index_orig = \"idx\"\n if not index_dest:\n destinations[\"idx\"] = destinations.index.values\n index_dest = \"idx\"\n\n # I dont think there's a way to do this in parallel, so we can at least show a progress bar\n with tqdm(total=len(origins[\"osm_ids\"])) as pbar:\n for origin in origins[\"osm_ids\"]:\n df = pd.DataFrame()\n df[\"cost\"] = network.shortest_path_lengths(\n [origin for d in destinations[\"osm_ids\"]],\n [d for d in destinations[\"osm_ids\"]],\n )\n df[\"destination\"] = destinations[index_dest].values\n df[\"origin\"] = origins[origins.osm_ids == origin][index_orig].values[0]\n\n ods.append(df)\n pbar.update(1)\n\n combined = pd.concat(ods)\n # reorder the columns\n return combined[['origin', 'destination', 'cost']]","def allowed_origin_patterns(self) -> Optional[pulumi.Input[Sequence[pulumi.Input[str]]]]:\n return pulumi.get(self, \"allowed_origin_patterns\")","def route_validity_checker(): #below route list was rerturned from bus_routes function above, copy and pasted to eliminate need to re-run\n route_list=['15', '46A', '14', '41B', '39A', '65', '40D', '11', '31', '27', '67', '79', '42', '66A', '33B', '140', '44', '83A', '27B', '38', '16C', '747', '41C', '39', '25', '239', '43', '70', '13', '150', '145', '77A', '184', '84', '61', '83', '40', '66', '15A', '123', '17A', '16', '14C', '9', '4', '37', '32', '33', '49', '56A', '151', '25A', '45A', '54A', '47', '18', '7', '17', '102', '120', '65B', '41', '122', '29A', '76', '68', '59', '25B', '69', '27A', '66B', '38B', '7D', '75', '15B', '84A', '63', '84X', '33X', '68A', '1', '76A', '7B', '270', '236', '130', '238', '220', '44B', '40B', '26', '32B', '8', '41A', '53', '67X', '104', '32A', '79A', '114', '185', '66X', '31B', '32X', '51X', '51D', '41X', '142', '111', '69X', '27X', '116', '46E', '161', '118', '25X', '38A', '33A', 'PP07', '53B', '31A', 'OL84']\n count_dict={}\n for route in route_list: #dictionary with key for every route in the list\n count_dict[route]=0 #used to count number of occurrences in files\n os.chdir(\"../Data\")\n for file in glob.glob(\"*.csv\"): #for every file\n print(file)\n reader=csv.reader(open(file))\n for line in reader:\n route=extract_bus_route(line[3])\n if route!=\"\":\n count_dict[extract_bus_route(line[3])]+=1 #incremenent the counter of the route with the associated journey id code\n return count_dict #result is that 3 routes are likely due to strange circumstances or errors in data","def test_addr_city_good_values(self):\n for input_val, output_val in self.known_values:\n self.line._parse_addr_city(input_val)\n self.assertEqual(output_val, self.line.addr_city)","def combineGPSandPhoneStops(arg):\r\n\r\n # unpack parameters\r\n user_gps, user_cell, dur_constr, spat_constr_gps, spat_cell_split = arg\r\n\r\n # combine cellular stay if it is close to a gps stay\r\n cell_stays = list(set([(trace[6],trace[7]) for d in user_cell for trace in user_cell[d] if int(trace[9]) >= dur_constr]))\r\n gps_stays = list(set([(trace[6],trace[7]) for d in user_gps for trace in user_gps[d] if int(trace[9]) >= dur_constr]))\r\n pairs_close = set()\r\n for cell_stay in cell_stays:\r\n for gps_stay in gps_stays:\r\n if distance(cell_stay[0],cell_stay[1],gps_stay[0],gps_stay[1]) <= spat_constr_gps:\r\n pairs_close.add((gps_stay[0],gps_stay[1],cell_stay[0],cell_stay[1]))\r\n break\r\n # find all pair[1]s in list, and replace it with pair[0]\r\n for pair in list(pairs_close):\r\n for d in user_cell.keys():\r\n for trace in user_cell[d]:\r\n if trace[6] == pair[2] and trace[7] == pair[3]:\r\n trace[5], trace[6], trace[7] = 99, pair[0], pair[1] #pretend as gps\r\n\r\n user = user_gps\r\n for d in user.keys():\r\n if len(user_cell[d]):\r\n user[d].extend(user_cell[d])\r\n user[d] = sorted(user[d], key=itemgetter(0))\r\n\r\n # address oscillation\r\n user = oscillation_h1_oscill(user, dur_constr) #OscillationPairList = oscillation_h1_oscill(user, dur_constr)\r\n # ## when replaced, can only replaced with a gps stay; so let modify exchange ping-pong pair in the pairList\r\n # gpslist_temp = {(trace[6], trace[7]):int(trace[5]) for d in user.keys() for trace in user[d]}\r\n # for pair_i in range(len(OscillationPairList)):\r\n # if gpslist_temp[(OscillationPairList[pair_i][0],OscillationPairList[pair_i][1])] <= spat_constr_gps:# wrong(2,3)\r\n # OscillationPairList[pair_i] = [OscillationPairList[pair_i][2],OscillationPairList[pair_i][3],\r\n # OscillationPairList[pair_i][0],OscillationPairList[pair_i][1]]\r\n ## find pong in trajactory, and replace it with ping\r\n ## this part is now integreted into the function itself\r\n ## OscillationPairList is in format: {, (ping[0], ping[1]): (pong[0], pong[1])}\r\n # for d in user.keys():\r\n # for trace in user[d]:\r\n # if (trace[6], trace[7]) in OscillationPairList:\r\n # trace[6], trace[7] = OscillationPairList[(trace[6], trace[7])]\r\n\r\n # update duration\r\n user = update_duration(user, dur_constr)\r\n\r\n for d in user:\r\n phone_index = [k for k in range(len(user[d])) if int(user[d][k][5]) > spat_cell_split]\r\n if len(phone_index) == 0: # if no phone trace\r\n continue\r\n for i in range(len(user[d])):\r\n if int(user[d][i][5]) > spat_cell_split and int(user[d][i][9]) < dur_constr: # passing phone observ\r\n user[d][i].append('checked')\r\n # combine consecutive obsv on a phone stay into two observ\r\n i = min(phone_index) # i has to be a phone index\r\n j = i + 1\r\n while i < len(user[d]) - 1:\r\n if j >= len(user[d]): # a day ending with a stay, j goes beyond the last observation\r\n for k in range(i + 1, j - 1, 1):\r\n user[d][k] = []\r\n break\r\n if int(user[d][j][5]) > spat_cell_split and user[d][j][6] == user[d][i][6] \\\r\n and user[d][j][7] == user[d][i][7] and j < len(user[d]):\r\n j += 1\r\n else:\r\n for k in range(i + 1, j - 1, 1):\r\n user[d][k] = []\r\n phone_index = [k for k in range(j, len(user[d])) if int(user[d][k][5]) > spat_cell_split]\r\n if len(phone_index) < 3: # if no phone trace\r\n break\r\n i = min(phone_index) ##i has to be a phone index\r\n j = i + 1\r\n i = 0 # remove []\r\n while i < len(user[d]):\r\n if len(user[d][i]) == 0:\r\n del user[d][i]\r\n else:\r\n i += 1\r\n # adress phone stay one by one\r\n flag_changed = True\r\n phone_list_check = []\r\n while (flag_changed):\r\n # print('while........')\r\n flag_changed = False\r\n gps_list = []\r\n phone_list = []\r\n for i in range(len(user[d])):\r\n if int(user[d][i][5]) <= spat_cell_split:#or user[d][i][2] == 'addedphonestay': #changed on 0428\r\n gps_list.append(user[d][i])\r\n else:\r\n phone_list.append(user[d][i])\r\n\r\n phone_list.extend(phone_list_check)\r\n # when updating duration for phone stay, we have to put back passing obs\r\n phone_list = sorted(phone_list, key=itemgetter(0))\r\n # update phone stay\r\n i = 0\r\n j = i\r\n while i < len(phone_list):\r\n if j >= len(phone_list): # a day ending with a stay, j goes beyond the last observation\r\n dur = str(int(phone_list[j - 1][0]) - int(phone_list[i][0]))\r\n for k in range(i, j, 1):\r\n if int(phone_list[k][9]) >= dur_constr:\r\n # we don't want to change a pssing into a stay; as we have not process the combine this stay\r\n # this is possible when a stay that prevents two passing is mergeed into gps as gps points\r\n phone_list[k][9] = dur\r\n break\r\n if phone_list[j][6] == phone_list[i][6] and phone_list[j][7] == phone_list[i][7] and j < len(\r\n phone_list):\r\n j += 1\r\n else:\r\n dur = str(int(phone_list[j - 1][0]) - int(phone_list[i][0]))\r\n for k in range(i, j, 1):\r\n if int(phone_list[k][9]) >= dur_constr:\r\n phone_list[k][9] = dur\r\n i = j\r\n for trace in phone_list: # those trace with gps as -1,-1 (not clustered) should not assign a duration\r\n if float(trace[6]) == -1: trace[9] = -1\r\n if len(phone_list) == 1: phone_list[0][9] = -1\r\n\r\n # update check lable\r\n for i in range(len(phone_list)):\r\n if int(phone_list[i][5]) > spat_cell_split and int(phone_list[i][9]) < dur_constr \\\r\n and phone_list[i][-1] != 'checked':\r\n # passing phone observ\r\n phone_list[i].append('checked')\r\n\r\n # put those not checked together with gps\r\n user[d] = gps_list\r\n phone_list_check = []\r\n for i in range(len(phone_list)):\r\n if phone_list[i][-1] == 'checked':\r\n phone_list_check.append(phone_list[i])\r\n else:\r\n user[d].append(phone_list[i])\r\n user[d] = sorted(user[d], key=itemgetter(0))\r\n\r\n # find a stay which is not checked\r\n flag_phonestay_notchecked = False\r\n phonestay_left, phonestay_right = -1, -1\r\n for i in range(max(0, phonestay_right+1), len(user[d])):\r\n phonestay_left, phonestay_right = -1, -1\r\n if int(user[d][i][5]) > spat_cell_split \\\r\n and int(user[d][i][9]) >= dur_constr and user[d][i][-1] != 'checked':\r\n phonestay_left = phonestay_right\r\n phonestay_right = i\r\n if phonestay_left != -1 and phonestay_right != -1 \\\r\n and user[d][phonestay_left][9] == user[d][phonestay_right][9]:\r\n flag_phonestay_notchecked = True\r\n\r\n ## modified on 04152019\r\n if flag_phonestay_notchecked == False or len(phone_list) == 0: # if all phone observation are checked, end\r\n break\r\n # if they are not two consecutive observation\r\n if phonestay_right != phonestay_left + 1: # attention: only phonestay_left is addressed\r\n # not consecutive two observations\r\n if any([int(user[d][j][9]) >= dur_constr for j in range(phonestay_left + 1, phonestay_right, 1)]):\r\n # found a gps stay in betw\r\n # print('23: found a gps stay in betw, just use one gps stay trade one phone stay')\r\n temp = user[d][phonestay_left][6:]\r\n user[d][phonestay_left][6:] = [-1, -1, -1, -1, -1, -1] # phone disappear\r\n # user[d][phonestay_left].extend(temp)\r\n user[d][phonestay_left].append('checked')\r\n # del user[d][phonestay_left] # phone disappear\r\n flag_changed = True\r\n else: # find close gps\r\n # print('24: do not found a gps stay in betw')\r\n phone_uncernt = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\r\n int(user[d][phonestay_right][5])])\r\n if all([(phone_uncernt + int(user[d][j][5])) > 1000 * distance(user[d][j][3], user[d][j][4],\r\n user[d][phonestay_left][6],\r\n user[d][phonestay_left][7])\r\n for j in range(phonestay_left + 1, phonestay_right, 1)]):\r\n # total uncerty larger than distance\r\n # this case should be rare, as those close gps may be clustered\r\n # print('241: all gps falling betw are close with phone stay')\r\n temp = user[d][phonestay_left][3:] # copy neighbor gps\r\n user[d][phonestay_left][3:] = user[d][phonestay_left + 1][3:]\r\n user[d][phonestay_left][11] = temp[8]\r\n # user[d][phonestay_left].extend(temp)\r\n flag_changed = True\r\n else:\r\n # print('242: find a gps in betw,\r\n # which is far away with phone stay, contradic with a stay (with phone obsv)')\r\n temp = user[d][phonestay_left][6:]\r\n user[d][phonestay_left][6:] = [-1, -1, -1, -1, -1, -1] # phone disappear\r\n # user[d][phonestay_left].extend(temp)\r\n user[d][phonestay_left].append('checked')\r\n # del user[d][phonestay_left] # phone disappear\r\n flag_changed = True\r\n else: # if they are two consecutive traces\r\n # two consecutive observation\r\n # if phonestay_left != 0 and phonestay_right < len(user[d]) - 1:\r\n # ignore if they are at the beginning or the end of traj\r\n prev_gps = next_gps = 0 # find prevous and next gps\r\n found_prev_gps = False\r\n found_next_gps = False\r\n for prev in range(phonestay_left - 1, -1, -1):\r\n # if int(user[d][prev][5]) <= spat_cell_split: ########## changed on 04282018\r\n if int(user[d][prev][5]) <= spat_cell_split and int(user[d][prev][9]) >= dur_constr:\r\n prev_gps = prev\r\n found_prev_gps = True\r\n break\r\n for nxt in range(phonestay_right + 1, len(user[d])):\r\n if int(user[d][nxt][5]) <= spat_cell_split and int(user[d][nxt][9]) >= dur_constr:\r\n next_gps = nxt\r\n found_next_gps = True\r\n break\r\n\r\n if found_prev_gps and found_next_gps and user[d][prev_gps][6] == user[d][next_gps][6]:\r\n # this is a phone stay within a gps stay\r\n phone_uncernt = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\r\n int(user[d][phonestay_right][5])])\r\n gps_uncernt = int(user[d][prev_gps][8])\r\n dist = 1000 * distance(user[d][prev_gps][6],\r\n user[d][prev_gps][7],\r\n user[d][phonestay_left][6],\r\n user[d][phonestay_left][7])\r\n speed_dep = (dist - phone_uncernt - gps_uncernt) / \\\r\n (int(user[d][phonestay_left][0]) - int(user[d][prev_gps][0])) * 3.6\r\n speed_retn = (dist - phone_uncernt - gps_uncernt) / \\\r\n (int(user[d][next_gps][0]) - int(user[d][phonestay_right][0])) * 3.6\r\n if (dist - phone_uncernt - gps_uncernt) > 0 \\\r\n and dist > 1000*spat_constr_gps and speed_dep < 200 and speed_retn < 200:\r\n # print('1111: distance larger than acc, and can travel, add phone stay, shorten gps stay')\r\n # leave phone stay there, we later update duration for the gps stay\r\n user[d][phonestay_left].append('checked')\r\n # those phone stay not removed have to be marked with 'checked'!\r\n user[d][phonestay_right].append('checked')\r\n user[d][phonestay_left][2] = 'addedphonestay'\r\n user[d][phonestay_right][2] = 'addedphonestay'\r\n flag_changed = True\r\n else: # merge into gps stay\r\n # print('1112: distance less than acc, or cannot travel, merge into gps stay')\r\n temp = user[d][phonestay_left][3:]\r\n user[d][phonestay_left][3:] = user[d][prev_gps][3:]\r\n user[d][phonestay_left][11] = temp[8]\r\n # user[d][phonestay_left].extend(temp)\r\n temp = user[d][phonestay_right][3:]\r\n user[d][phonestay_right][3:] = user[d][prev_gps][3:]\r\n user[d][phonestay_right][11] = temp[8]\r\n # user[d][phonestay_right].extend(temp)\r\n flag_changed = True\r\n elif found_prev_gps and found_next_gps and user[d][prev_gps][6] != user[d][next_gps][6]:\r\n phone_uncernt_l = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\r\n int(user[d][phonestay_right][5])])\r\n gps_uncernt_l = int(user[d][prev_gps][8])\r\n dist_l = 1000 * distance(user[d][prev_gps][6],\r\n user[d][prev_gps][7],\r\n user[d][phonestay_left][6],\r\n user[d][phonestay_left][7])\r\n speed_dep = (dist_l - phone_uncernt_l - gps_uncernt_l) / \\\r\n (int(user[d][phonestay_left][0]) - int(user[d][prev_gps][0])) * 3.6\r\n phone_uncernt_r = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\r\n int(user[d][phonestay_right][5])])\r\n gps_uncernt_r = int(user[d][next_gps][8])\r\n dist_r = 1000 * distance(user[d][next_gps][6],\r\n user[d][next_gps][7],\r\n user[d][phonestay_right][6],\r\n user[d][phonestay_right][7])\r\n speed_retn = (dist_r - phone_uncernt_r - gps_uncernt_r) / \\\r\n (int(user[d][next_gps][0]) - int(user[d][phonestay_right][0])) * 3.6\r\n comb_l = 0 #revised on 03202019 to pick up one gps stay to combine with; if spatial conti with multi\r\n comb_r = 0\r\n if (dist_l - phone_uncernt_l - gps_uncernt_l) < 0 \\\r\n or dist_l < 1000*spat_constr_gps or speed_dep > 200:\r\n comb_l = 1\r\n if (dist_r - phone_uncernt_r - gps_uncernt_r) < 0 \\\r\n or dist_r < 1000 * spat_constr_gps or speed_retn > 200:\r\n comb_r = 1\r\n if comb_l*comb_r == 1:\r\n if dist_l < dist_r:\r\n comb_r = 0\r\n else:\r\n comb_l = 0\r\n if comb_l:\r\n temp = user[d][phonestay_left][3:]\r\n user[d][phonestay_left][3:] = user[d][prev_gps][3:]\r\n user[d][phonestay_left][11] = temp[8]\r\n # user[d][phonestay_left].extend(temp)\r\n temp = user[d][phonestay_right][3:]\r\n user[d][phonestay_right][3:] = user[d][prev_gps][3:]\r\n user[d][phonestay_right][11] = temp[8]\r\n # user[d][phonestay_right].extend(temp)\r\n flag_changed = True\r\n elif comb_r:\r\n temp = user[d][phonestay_left][3:]\r\n user[d][phonestay_left][3:] = user[d][next_gps][3:]\r\n user[d][phonestay_left][11] = temp[8]\r\n # user[d][phonestay_left].extend(temp)\r\n temp = user[d][phonestay_right][3:]\r\n user[d][phonestay_right][3:] = user[d][next_gps][3:]\r\n user[d][phonestay_right][11] = temp[8]\r\n # user[d][phonestay_right].extend(temp)\r\n flag_changed = True\r\n else:\r\n user[d][phonestay_left].append('checked')\r\n # those phone stay not removed have to be marked with 'checked'!\r\n user[d][phonestay_right].append('checked')\r\n user[d][phonestay_left][2] = 'addedphonestay'\r\n user[d][phonestay_right][2] = 'addedphonestay'\r\n flag_changed = True\r\n elif found_prev_gps: # a gps stay #right# before\r\n # print('113: before phone stay, we have gps stay')\r\n phone_uncernt = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\r\n int(user[d][phonestay_right][5])])\r\n gps_uncernt = int(user[d][prev_gps][8])\r\n dist = 1000 * distance(user[d][prev_gps][6],\r\n user[d][prev_gps][7],\r\n user[d][phonestay_left][6],\r\n user[d][phonestay_left][7])\r\n speed_dep = (dist - phone_uncernt - gps_uncernt) / \\\r\n (int(user[d][phonestay_left][0]) - int(user[d][prev_gps][0])) * 3.6\r\n if (dist - phone_uncernt - gps_uncernt) > 0 and dist > 1000*spat_constr_gps and speed_dep < 200:\r\n # spatially seperate enough and can travel, add in gps\r\n # print('1132: dist>low_acc, add phone stay')\r\n # leave phone stay there\r\n user[d][phonestay_left].append('checked')\r\n user[d][phonestay_right].append('checked')\r\n user[d][phonestay_left][2] = 'addedphonestay'\r\n user[d][phonestay_right][2] = 'addedphonestay'\r\n flag_changed = True\r\n else:\r\n # print('1131: low_acc > dist, merge with gps stay, meaning extend gps dur')\r\n temp = user[d][phonestay_left][3:]\r\n user[d][phonestay_left][3:] = user[d][prev_gps][3:]\r\n user[d][phonestay_left][11] = temp[8]\r\n # user[d][phonestay_left].extend(temp)\r\n temp = user[d][phonestay_right][3:]\r\n user[d][phonestay_right][3:] = user[d][prev_gps][3:]\r\n user[d][phonestay_right][11] = temp[8]\r\n # user[d][phonestay_right].extend(temp)\r\n flag_changed = True\r\n elif found_next_gps: # a gps stay #right# after\r\n # print('112: after phone stay, we have gps stay')\r\n phone_uncernt = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\r\n int(user[d][phonestay_right][5])])\r\n gps_uncernt = int(user[d][next_gps][8])\r\n dist = 1000 * distance(user[d][next_gps][6],\r\n user[d][next_gps][7],\r\n user[d][phonestay_right][6],\r\n user[d][phonestay_right][7])\r\n speed_retn = (dist - phone_uncernt - gps_uncernt) / \\\r\n (int(user[d][next_gps][0]) - int(user[d][phonestay_right][0])) * 3.6\r\n if (dist - phone_uncernt - gps_uncernt) > 0 and dist > 1000*spat_constr_gps and speed_retn<200:\r\n # spatially seperate enough and can travel, add in gps\r\n # print('1122: dist>low_acc, add phone stay')\r\n # leave phone stay there, we later update duration for the gps stay\r\n user[d][phonestay_left].append('checked')\r\n user[d][phonestay_right].append('checked')\r\n user[d][phonestay_left][2] = 'addedphonestay'\r\n user[d][phonestay_right][2] = 'addedphonestay'\r\n flag_changed = True\r\n else:# remain phone observ, but use gps location\r\n # print('1121: low_acc > dist, merge with gps stay, meaning extend gps dur')\r\n temp = user[d][phonestay_left][3:]\r\n user[d][phonestay_left][3:] = user[d][next_gps][3:]\r\n user[d][phonestay_left][11] = temp[8]\r\n # user[d][phonestay_left].extend(temp)\r\n temp = user[d][phonestay_right][3:]\r\n user[d][phonestay_right][3:] = user[d][next_gps][3:]\r\n user[d][phonestay_right][11] = temp[8]\r\n # user[d][phonestay_right].extend(temp)\r\n flag_changed = True\r\n else: # if don't match any case, just add it\r\n # print('donot match any case, just add it (e.g., consecutive two phone stays)')\r\n # leave phone stay there\r\n user[d][phonestay_left].append('checked')\r\n user[d][phonestay_right].append('checked')\r\n user[d][phonestay_left][2] = 'addedphonestay'\r\n user[d][phonestay_right][2] = 'addedphonestay'\r\n flag_changed = True\r\n\r\n\r\n # user[d].extend(phone_list_check)\r\n for trace in phone_list_check:\r\n if trace[2] == 'addedphonestay':\r\n user[d].append(trace[:])\r\n # remove passingby cellular traces\r\n i = 0\r\n while i<len(user[d]):\r\n if user[d][i][5] == 99 and float(user[d][i][9]) < dur_constr:\r\n del user[d][i]\r\n else:\r\n i+=1\r\n # remove passing traces\r\n ## Flag_changed = True\r\n ## while (Flag_changed):\r\n ## Flag_changed = False\r\n # i = 0\r\n # while i < len(user[d]):\r\n # if int(user[d][i][5]) > spat_cell_split and int(user[d][i][9]) < dur_constr:\r\n # # Flag_changed = True\r\n # del user[d][i]\r\n # else:\r\n # i += 1\r\n user[d] = sorted(user[d], key=itemgetter(0))\r\n # update duration\r\n i = 0\r\n j = i\r\n while i < len(user[d]):\r\n if j >= len(user[d]): # a day ending with a stay, j goes beyond the last observation\r\n dur = str(int(user[d][j - 1][0]) - int(user[d][i][0]))\r\n for k in range(i, j, 1):\r\n user[d][k][9] = dur\r\n break\r\n if user[d][j][6] == user[d][i][6] and user[d][j][7] == user[d][i][7] and j < len(\r\n user[d]):\r\n j += 1\r\n else:\r\n dur = str(int(user[d][j - 1][0]) - int(user[d][i][0]))\r\n for k in range(i, j, 1):\r\n user[d][k][9] = dur\r\n i = j\r\n for trace in user[d]: # those trace with gps as -1,-1 (not clustered) should not assign a duration\r\n if float(trace[6]) == -1: trace[9] = -1\r\n if len(user[d]) == 1: user[d][0][9] = -1\r\n # remove and add back; because phone stays are distroyed as multiple, should be combined as one\r\n i = 0\r\n while i < len(user[d]):\r\n if user[d][i][2] == 'addedphonestay':\r\n del user[d][i]\r\n else:\r\n i += 1\r\n # add back and sort\r\n for trace in phone_list_check:\r\n if trace[2] == 'addedphonestay':\r\n user[d].append(trace)\r\n\r\n user[d] = sorted(user[d], key=itemgetter(0))\r\n\r\n # remove temp marks\r\n user[d]=[trace[:12] for trace in user[d]]\r\n\r\n # oscillation\r\n # modify grid\r\n for day in user.keys():\r\n for trace in user[day]:\r\n if float(trace[6]) == -1:\r\n found_stay = False\r\n if found_stay == False:\r\n trace[6] = trace[3] + '000' # in case do not have enough digits\r\n trace[7] = trace[4] + '000'\r\n digits = (trace[6].split('.'))[1]\r\n digits = digits[:2] + str(int(digits[2]) / 2)\r\n trace[6] = (trace[6].split('.'))[0] + '.' + digits\r\n # trace[6] = trace[6][:5] + str(int(trace[6][5]) / 2) # 49.950 to 49.952 220 meters\r\n digits = (trace[7].split('.'))[1]\r\n digits = digits[:2] + str(int(digits[2:4]) / 25)\r\n trace[7] = (trace[7].split('.'))[0] + '.' + digits\r\n # trace[7] = trace[7][:7] + str(int(trace[7][7:9]) / 25) # -122.3400 to -122.3425 180 meters\r\n\r\n # added to address oscillation\r\n user = oscillation_h1_oscill(user, dur_constr)\r\n ## find pong in trajactory, and replace it with ping\r\n ## this part is now integreted into the function itself\r\n ## OscillationPairList is in format: {, (ping[0], ping[1]): (pong[0], pong[1])}\r\n # for d in user.keys():\r\n # for trace in user[d]:\r\n # if (trace[6], trace[7]) in OscillationPairList:\r\n # trace[6], trace[7] = OscillationPairList[(trace[6], trace[7])]\r\n\r\n # update duration\r\n user = update_duration(user, dur_constr)\r\n\r\n # end addressing oscillation\r\n # those newly added stays should be combined with close stays\r\n user = cluster_incremental(user, spat_constr_gps, dur_constr=dur_constr)\r\n # update duration\r\n user = update_duration(user, dur_constr)\r\n # use only one record for one stay\r\n for d in user:\r\n i = 0\r\n while i < len(user[d]) - 1:\r\n if user[d][i + 1][6] == user[d][i][6] and user[d][i + 1][7] == user[d][i][7] \\\r\n and user[d][i + 1][9] == user[d][i][9] and int(user[d][i][9]) >= dur_constr:\r\n del user[d][i + 1]\r\n else:\r\n i += 1\r\n # mark stay\r\n staylist = set() # get unique staylist\r\n for d in user.keys():\r\n for trace in user[d]:\r\n if float(trace[9]) >= dur_constr:\r\n staylist.add((trace[6], trace[7]))\r\n else: # change back keep full trajectory: do not use center for those are not stays\r\n trace[6], trace[7], trace[8], trace[9] = -1, -1, -1, -1 # for non stay, do not give center\r\n staylist = list(staylist)\r\n for d in user.keys():\r\n for trace in user[d]:\r\n for i in range(len(staylist)):\r\n if trace[6] == staylist[i][0] and trace[7] == staylist[i][1]:\r\n trace[10] = 'stay' + str(i)\r\n break\r\n\r\n return user","def destination_route_table_ids(self) -> Optional[pulumi.Input[Sequence[pulumi.Input[str]]]]:\n return pulumi.get(self, \"destination_route_table_ids\")","def destination_route_table_ids(self) -> Optional[pulumi.Input[Sequence[pulumi.Input[str]]]]:\n return pulumi.get(self, \"destination_route_table_ids\")","def __init__(__self__, *,\n as_path_match_mode: Optional[pulumi.Input[str]] = None,\n cen_id: Optional[pulumi.Input[str]] = None,\n cen_region_id: Optional[pulumi.Input[str]] = None,\n cidr_match_mode: Optional[pulumi.Input[str]] = None,\n community_match_mode: Optional[pulumi.Input[str]] = None,\n community_operate_mode: Optional[pulumi.Input[str]] = None,\n description: Optional[pulumi.Input[str]] = None,\n destination_child_instance_types: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n destination_cidr_blocks: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n destination_instance_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n destination_instance_ids_reverse_match: Optional[pulumi.Input[bool]] = None,\n destination_route_table_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n map_result: Optional[pulumi.Input[str]] = None,\n match_asns: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n match_community_sets: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n next_priority: Optional[pulumi.Input[int]] = None,\n operate_community_sets: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n preference: Optional[pulumi.Input[int]] = None,\n prepend_as_paths: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n priority: Optional[pulumi.Input[int]] = None,\n route_map_id: Optional[pulumi.Input[str]] = None,\n route_types: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n source_child_instance_types: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n source_instance_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n source_instance_ids_reverse_match: Optional[pulumi.Input[bool]] = None,\n source_region_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n source_route_table_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\n status: Optional[pulumi.Input[str]] = None,\n transit_router_route_table_id: Optional[pulumi.Input[str]] = None,\n transmit_direction: Optional[pulumi.Input[str]] = None):\n if as_path_match_mode is not None:\n pulumi.set(__self__, \"as_path_match_mode\", as_path_match_mode)\n if cen_id is not None:\n pulumi.set(__self__, \"cen_id\", cen_id)\n if cen_region_id is not None:\n pulumi.set(__self__, \"cen_region_id\", cen_region_id)\n if cidr_match_mode is not None:\n pulumi.set(__self__, \"cidr_match_mode\", cidr_match_mode)\n if community_match_mode is not None:\n pulumi.set(__self__, \"community_match_mode\", community_match_mode)\n if community_operate_mode is not None:\n pulumi.set(__self__, \"community_operate_mode\", community_operate_mode)\n if description is not None:\n pulumi.set(__self__, \"description\", description)\n if destination_child_instance_types is not None:\n pulumi.set(__self__, \"destination_child_instance_types\", destination_child_instance_types)\n if destination_cidr_blocks is not None:\n pulumi.set(__self__, \"destination_cidr_blocks\", destination_cidr_blocks)\n if destination_instance_ids is not None:\n pulumi.set(__self__, \"destination_instance_ids\", destination_instance_ids)\n if destination_instance_ids_reverse_match is not None:\n pulumi.set(__self__, \"destination_instance_ids_reverse_match\", destination_instance_ids_reverse_match)\n if destination_route_table_ids is not None:\n pulumi.set(__self__, \"destination_route_table_ids\", destination_route_table_ids)\n if map_result is not None:\n pulumi.set(__self__, \"map_result\", map_result)\n if match_asns is not None:\n pulumi.set(__self__, \"match_asns\", match_asns)\n if match_community_sets is not None:\n pulumi.set(__self__, \"match_community_sets\", match_community_sets)\n if next_priority is not None:\n pulumi.set(__self__, \"next_priority\", next_priority)\n if operate_community_sets is not None:\n pulumi.set(__self__, \"operate_community_sets\", operate_community_sets)\n if preference is not None:\n pulumi.set(__self__, \"preference\", preference)\n if prepend_as_paths is not None:\n pulumi.set(__self__, \"prepend_as_paths\", prepend_as_paths)\n if priority is not None:\n pulumi.set(__self__, \"priority\", priority)\n if route_map_id is not None:\n pulumi.set(__self__, \"route_map_id\", route_map_id)\n if route_types is not None:\n pulumi.set(__self__, \"route_types\", route_types)\n if source_child_instance_types is not None:\n pulumi.set(__self__, \"source_child_instance_types\", source_child_instance_types)\n if source_instance_ids is not None:\n pulumi.set(__self__, \"source_instance_ids\", source_instance_ids)\n if source_instance_ids_reverse_match is not None:\n pulumi.set(__self__, \"source_instance_ids_reverse_match\", source_instance_ids_reverse_match)\n if source_region_ids is not None:\n pulumi.set(__self__, \"source_region_ids\", source_region_ids)\n if source_route_table_ids is not None:\n pulumi.set(__self__, \"source_route_table_ids\", source_route_table_ids)\n if status is not None:\n pulumi.set(__self__, \"status\", status)\n if transit_router_route_table_id is not None:\n pulumi.set(__self__, \"transit_router_route_table_id\", transit_router_route_table_id)\n if transmit_direction is not None:\n pulumi.set(__self__, \"transmit_direction\", transmit_direction)","def validate(self, allow_missing=False, allow_extra=False, cls=None, **kwargs):\n # pop any strand name:data pairs out of kwargs and into their own dict\n source_kwargs = tuple(name for name in kwargs.keys() if name in ALL_STRANDS)\n sources = dict((name, kwargs.pop(name)) for name in source_kwargs)\n for strand_name, strand_data in sources.items():\n\n if not allow_extra:\n if (strand_data is not None) and (strand_name not in self.available_strands):\n raise exceptions.StrandNotFound(\n f\"Source data is provided for '{strand_name}' but no such strand is defined in the twine\"\n )\n\n if not allow_missing:\n if (strand_name in self.available_strands) and (strand_data is None):\n raise exceptions.TwineValueException(\n f\"The '{strand_name}' strand is defined in the twine, but no data is provided in sources\"\n )\n\n if strand_data is not None:\n # TODO Consider reintroducing a skip based on whether cls is already instantiated. For now, leave it the\n # responsibility of the caller to determine what has already been validated and what hasn't.\n # # Use the twine to validate and instantiate as the desired class\n # if not isinstance(value, type(cls)):\n # self.logger.debug(\n # \"Instantiating %s as %s and validating against twine\", name, cls.__name__ if cls else \"default_class\"\n # )\n # return self.twine.validate(name, source=value, cls=cls)\n method = getattr(self, f\"validate_{strand_name}\")\n klass = self._get_cls(strand_name, cls)\n sources[strand_name] = method(strand_data, cls=klass, **kwargs)\n else:\n sources[strand_name] = None\n\n return sources","def test_get_routes(self):\n routes = self.stop.routes\n self.assertEqual(type(routes), type([]))\n [self.assertEqual(type(i), BusRoute) for i in routes]\n routes[0].__repr__()\n routes[0].__str__()\n routes[0].__unicode__()","def _make_reverse_relations_valid(self, data):\n for field_name, (field, related_field) in self._get_reverse_fields().items():\n if data.get(field.source) is None:\n continue\n if isinstance(field, serializers.ListSerializer):\n field = field.child\n if isinstance(field, serializers.ModelSerializer):\n # find the serializer field matching the reverse model relation\n for sub_field in field.fields.values():\n if sub_field.source == related_field.name:\n sub_field.required = False\n # found the matching field, move on\n break","def validate_move(self, move_from, move_to, board):\n\n from_coordinates = JanggiGame.translate_to_grid(move_from)\n to_coordinates = JanggiGame.translate_to_grid(move_to)\n from_col = from_coordinates[0]\n from_row = from_coordinates[1]\n to_col = to_coordinates[0]\n to_row = to_coordinates[1]\n\n # if destination within the board\n if to_col in range(9) and to_row in range(10):\n # if destination is 1 up and diagonally to the left\n if to_col - from_col == -2 and to_row - from_row == -3 and board[from_col][from_row - 1] == '' and board[from_col - 1][from_row - 2] == '':\n return True\n # if destination is 1 up and diagonally to the right\n if to_col - from_col == 2 and to_row - from_row == -3 and board[from_col][from_row - 1] == '' and board[from_col + 1][from_row - 2] == '':\n return True\n # if destination is 1 down and diagonally to the left\n if to_col - from_col == -2 and to_row - from_row == 3 and board[from_col][from_row + 1] == '' and board[from_col - 1][from_row + 2] == '':\n return True\n # if destination is 1 down and diagonally to the right\n if to_col - from_col == 2 and to_row - from_row == 3 and board[from_col][from_row + 1] == '' and board[from_col + 1][from_row + 2] == '':\n return True\n # if destination is 1 left and diagonally up\n if to_col - from_col == -3 and to_row - from_row == -2 and board[from_col - 1][from_row] == '' and board[from_col - 2][from_row - 1] == '':\n return True\n # if destination is 1 left and diagonally down\n if to_col - from_col == -3 and to_row - from_row == 2 and board[from_col - 1][from_row] == '' and board[from_col - 2][from_row + 1] == '':\n return True\n # if destination is 1 right and diagonally up\n if to_col - from_col == 3 and to_row - from_row == -2 and board[from_col + 1][from_row] == '' and board[from_col + 2][from_row - 1] == '':\n return True\n # if destination is 1 right and diagonally down\n if to_col - from_col == 3 and to_row - from_row == 2 and board[from_col + 1][from_row] == '' and board[from_col + 2][from_row + 1] == '':\n return True\n return False","def processTradeRoutes(self):\n try:\n nextRound = self.currentRound+1\n resultslist = []\n for trID in self.tradeRoutes.keys():\n myTradeRoute = self.tradeRoutes[trID]\n (systemFromID, systemToID, tradeRouteType) = string.split(trID, '-')\n systemFrom = self.systems[systemFromID]\n systemTo = self.systems[systemToID]\n cancel = 0\n warpReq = 0\n # choose trade route type\n if tradeRouteType == 'GEN':\n # update what system sends based on what it makes\n myTradeRoute.AL = systemFrom.prodAL\n myTradeRoute.EC = systemFrom.prodEC\n myTradeRoute.IA = systemFrom.prodIA\n \n # check if trade route is adjacent or requires warp gate capacity\n if systemTo.id in systemFrom.warpGateSystems:\n warpReq = myTradeRoute.getWarpRequired()\n if warpReq > (systemFrom.availWGC-systemFrom.usedWGC) or warpReq > (systemTo.availWGC-systemTo.usedWGC):\n cancel = 1\n elif systemTo.id not in systemFrom.connectedSystems:\n cancel = 1\n \n if (systemFrom.AL >= myTradeRoute.AL and\n systemFrom.EC >= myTradeRoute.EC and\n systemFrom.IA >= myTradeRoute.IA and \n cancel == 0):\n # process trade route\n systemFrom.AL -= myTradeRoute.AL\n systemFrom.EC -= myTradeRoute.EC\n systemFrom.IA -= myTradeRoute.IA\n systemTo.AL += myTradeRoute.AL\n systemTo.EC += myTradeRoute.EC\n systemTo.IA += myTradeRoute.IA\n # deduct properly if empires are different\n empireFrom = self.empires[systemFrom.myEmpireID]\n empireTo = self.empires[systemTo.myEmpireID]\n if empireFrom <> empireTo:\n empireFrom.AL -= myTradeRoute.AL\n empireFrom.EC -= myTradeRoute.EC\n empireFrom.IA -= myTradeRoute.IA\n empireTo.AL += myTradeRoute.AL\n empireTo.EC += myTradeRoute.EC\n empireTo.IA += myTradeRoute.IA\n \n if warpReq > 0:\n systemFrom.usedWGC += warpReq\n systemTo.usedWGC += warpReq\n \n # mail trade route completion\n resultslist.append('Trade from System:%s to System:%s complete' % (systemFrom.id, systemTo.id))\n self.mailTradeInfo('completed', myTradeRoute, nextRound)\n else:\n cancel = 1\n \n # check if route should be cancelled\n if cancel == 1:\n resultslist.append('cancel trade route=%s' % myTradeRoute.id)\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\n elif myTradeRoute.oneTime == 1:\n resultslist.append('one time trade route=%s' % myTradeRoute.id)\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\n \n return str(resultslist)\n except:\n return 'galaxy->processTradeRoutes error'","def test_trips_starting_at_a_and_ending_at_c_by_4_stops(self):\n railroad = trains.Railroad()\n self.assertEqual(sorted(railroad.find_routes('A', 'C', 4, 4)), sorted(['ABCDC', 'ADCDC', 'ADEBC']))","def __init__(__self__, *,\n description: Optional[pulumi.Input[str]] = None,\n destination_region_id: Optional[pulumi.Input[str]] = None,\n destination_zone_id: Optional[pulumi.Input[str]] = None,\n group_name: Optional[pulumi.Input[str]] = None,\n rpo: Optional[pulumi.Input[int]] = None,\n source_region_id: Optional[pulumi.Input[str]] = None,\n source_zone_id: Optional[pulumi.Input[str]] = None,\n status: Optional[pulumi.Input[str]] = None):\n if description is not None:\n pulumi.set(__self__, \"description\", description)\n if destination_region_id is not None:\n pulumi.set(__self__, \"destination_region_id\", destination_region_id)\n if destination_zone_id is not None:\n pulumi.set(__self__, \"destination_zone_id\", destination_zone_id)\n if group_name is not None:\n pulumi.set(__self__, \"group_name\", group_name)\n if rpo is not None:\n pulumi.set(__self__, \"rpo\", rpo)\n if source_region_id is not None:\n pulumi.set(__self__, \"source_region_id\", source_region_id)\n if source_zone_id is not None:\n pulumi.set(__self__, \"source_zone_id\", source_zone_id)\n if status is not None:\n pulumi.set(__self__, \"status\", status)","def validate(self, *, destination: FieldModel, source: list) -> bool:\n if not isinstance(source, list):\n raise ValueError(f\"Action source script does not conform to required structure. ({source})\")\n for chunk in self.core.chunks(lst=source, n=len(self.structure)):\n # Loops through the phrasing of the structure, and checks that each term is as expected\n # e.g. [ModifierModel, FieldModel] for [modifier1, field1, modifier2, field2]\n # does not check that the actual terms match, though\n for i, term in enumerate(self.structure):\n if isinstance(chunk[i], term):\n continue\n elif isinstance(chunk[i], dict):\n # Nested source\n if not chunk[i].get(\"action\") and not not chunk[i].get(\"source\"):\n raise ValueError(f\"Nested script does not conform to required structure. ({chunk[i]})\")\n chunk[i][\"action\"].validate(source=chunk[i][\"source\"])\n else:\n raise ValueError(\n f\"Source structure ({chunk}) doesn't conform to ACTION structure requirements ({self.structure}).\"\n )\n return True","def check_paths(self):\n for path in self.paths:\n # check that arc starts at s\n arc = path[0]\n arc_start = self.arc_info[arc][\"start\"]\n assert(arc_start == self.source()), \"Path does not start at s\"\n # check that internal arcs are valid\n for (i, arc) in enumerate(path[:-1]):\n next_arc = path[i + 1]\n arc_destin = self.arc_info[arc][\"destin\"]\n next_arc_start = self.arc_info[next_arc][\"start\"]\n assert (arc_destin == next_arc_start), \"Invalid path\"\n arc = path[-1]\n arc_end = self.arc_info[arc][\"destin\"]\n assert(arc_end == self.sink()), \"Path does not end at t\"","def process_departure_fix_list(fix_list, runway, airport, fixes, tagged_routes, base_runway=None):\r\n if fix_list:\r\n if runway not in tagged_routes:\r\n tagged_routes[runway] = {}\r\n if airport not in tagged_routes:\r\n tagged_routes[airport] = {}\r\n if fix_list[0].startswith('@'):\r\n tag = fix_list[0].lstrip('@')\r\n if tag.startswith('!!'):\r\n tag_namespace = None\r\n elif tag.startswith('!'):\r\n tag_namespace = airport\r\n elif runway:\r\n tag_namespace = runway\r\n else:\r\n raise RuntimeError(f\"departure tagged {tag} as a runway-specific route, but no runway was specified\")\r\n tagged_routes[tag_namespace][tag] = fix_list[1:]\r\n return None\r\n else:\r\n if base_runway is not None:\r\n runway = base_runway\r\n return _process_departure_fix_list(fix_list, runway, airport, fixes, tagged_routes)","def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches\r\n # Select the inputs to process\r\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\r\n self._select_inputs_one_to_one(chunk_definition)\r\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\r\n self._get_od_pairs_for_chunk(chunk_definition)\r\n self._select_inputs_many_to_many()\r\n else:\r\n raise NotImplementedError(f\"Invalid PreassignedODPairType: {self.pair_type}\")\r\n\r\n # Initialize the Route solver object\r\n self.initialize_rt_solver()\r\n self._add_unique_id_fields()\r\n\r\n # Insert the origins and destinations\r\n self.logger.debug(f\"Route solver fields transferred from Origins: {self.origin_transfer_fields}\")\r\n self.logger.debug(f\"Route solver fields transferred from Destinations: {self.destination_transfer_fields}\")\r\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\r\n self._insert_stops_one_to_one()\r\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\r\n self._insert_stops_many_to_many()\r\n else:\r\n raise NotImplementedError(f\"Invalid PreassignedODPairType: {self.pair_type}\")\r\n\r\n if self.rt_solver.count(arcpy.nax.RouteInputDataType.Stops) == 0:\r\n # There were no valid destinations for this set of origins\r\n self.logger.debug(\"No valid destinations for this set of origins. Skipping Route calculation.\")\r\n return\r\n\r\n # Load barriers\r\n # Note: This loads ALL barrier features for every analysis, even if they are very far away from any of\r\n # the inputs in the current chunk. You may want to select only barriers within a reasonable distance of the\r\n # inputs, particularly if you run into the maximumFeaturesAffectedByLineBarriers,\r\n # maximumFeaturesAffectedByPointBarriers, and maximumFeaturesAffectedByPolygonBarriers tool limits for portal\r\n # solves. However, since barriers is likely an unusual case, deal with this only if it becomes a problem.\r\n for barrier_fc in self.barriers:\r\n self.logger.debug(f\"Loading barriers feature class {barrier_fc}...\")\r\n shape_type = arcpy.Describe(barrier_fc).shapeType\r\n if shape_type == \"Polygon\":\r\n class_type = arcpy.nax.RouteInputDataType.PolygonBarriers\r\n elif shape_type == \"Polyline\":\r\n class_type = arcpy.nax.RouteInputDataType.LineBarriers\r\n elif shape_type == \"Point\":\r\n class_type = arcpy.nax.RouteInputDataType.PointBarriers\r\n else:\r\n self.logger.warning(\r\n f\"Barrier feature class {barrier_fc} has an invalid shape type and will be ignored.\"\r\n )\r\n continue\r\n barriers_field_mappings = self.rt_solver.fieldMappings(class_type, True)\r\n self.rt_solver.load(class_type, barrier_fc, barriers_field_mappings, True)\r\n\r\n # Solve the Route analysis\r\n self.logger.debug(\"Solving Route...\")\r\n solve_start = time.time()\r\n self.solve_result = self.rt_solver.solve()\r\n solve_end = time.time()\r\n self.logger.debug(f\"Solving Route completed in {round(solve_end - solve_start, 3)} seconds.\")\r\n\r\n # Handle solve messages\r\n solve_msgs = [msg[-1] for msg in self.solve_result.solverMessages(arcpy.nax.MessageSeverity.All)]\r\n for msg in solve_msgs:\r\n self.logger.debug(msg)\r\n\r\n # Update the result dictionary\r\n self.job_result[\"solveMessages\"] = solve_msgs\r\n if not self.solve_result.solveSucceeded:\r\n self.logger.debug(\"Solve failed.\")\r\n return\r\n self.logger.debug(\"Solve succeeded.\")\r\n self.job_result[\"solveSucceeded\"] = True\r\n\r\n # Save output\r\n self._export_to_feature_class(chunk_definition)\r\n\r\n self.logger.debug(\"Finished calculating Route.\")","def savings2routes(self,r1,r2):\n newRoute = VRP_Route(r1.route+r2.route)\n newRoute.update_route(self.vrpdata) # compute distance, quantity for newRoute, check whether valid\n if newRoute.tourValid:\n return r1.distance + r2.distance - newRoute.distance\n return -1","def get_valid_locations(location_list, grid, shape):","def __init__(self):\n\n self._utils = utils.SearchUtils()\n self._logger = self._utils.logger\n\n self._dms_pattern = (\n r\"\\s*(\\d+)\\s*°\\s*(\\d+)\\s*(?:ʹ|′|')\\s*(\\d+\\.?\\d*)\\s*(?:ʺ|\\\"|″)\"\n r\"\\s*([EWNS])\\s*\")\n self._ddm_pattern = (\n r\"\\s*(\\d+)\\s*°\\s*(\\d+\\.?\\d*)\\s*(?:ʹ|′|')\\s*([EWNS])\\s*\")\n self._dd_pattern = r\"\\s*(-?\\d+\\.?\\d*)\\s*(?:°)?\\s*[EWNS]?\"\n self._mgrs_pattern = r\"\\s*\\d?\\d[A-Z]([A-Z][A-Z])?(\\d\\d){0,5}\\s*\"\n self._utm_pattern = (\n r\"(\\d?\\d)\\s*([A-Z])\\s*(\\d+\\.?\\d*)\\s*M\\s*E\\s*\"\n r\"\\s*(\\d+\\.?\\d*)\\s*M\\s*N\\s*\")\n\n # List of lists for storing the input pattern and types\n self._input_pattern_types = [\n [self._dms_pattern, \"DMS\"],\n [self._ddm_pattern, \"DDM\"],\n [self._utm_pattern, \"UTM\"],\n [self._mgrs_pattern, \"MGRS\"],\n [self._dd_pattern, \"DD\"]]\n\n self._valid_latitude_directions = [\"S\", \"N\"]\n self._valid_longitude_directions = [\"E\", \"W\"]\n self._dms_negative_directions = [\"S\", \"W\"]\n\n self._e1 = ((1 - math.sqrt(1- CoordinateTransform.ECC_SQUARED))/\n (1 + math.sqrt(1- CoordinateTransform.ECC_SQUARED)))\n self._e1_prime = (\n CoordinateTransform.ECC_SQUARED/(1 - CoordinateTransform.ECC_SQUARED))","def info_for_model(stop_list, stops, route):\n\n # Need to know where the bus number 1 and 2 are\n # This if and elif were put in due to an error where the bus list for bus 1 would come up empty, but not sure if necessary\n if len(stops[0]) == 0:\n bus_1 = stops[1][len(stops[1]) - 1]\n elif len(stops[0]) != 0:\n bus_1 = stops[0][0]\n bus_2 = stops[1][0]\n\n # Create empty lists to hold the information for each bus\n stops_bus_1 = []\n stops_bus_2 = []\n stops_bus_3 = []\n\n # Ste bus_number to 3, we will start filling the buses from the end, the last bus first\n bus_number = 3\n\n # Populate our lists\n for i in stops[len(stops) - 1]:\n # Get the times for the buses at the given stop\n first_3_buses = get_due_time(str(i), route)\n\n if len(first_3_buses) == 0:\n # print('Something went wrong!')\n continue\n # Add in the delay\n get_delay(first_3_buses)\n\n # Have to check if the bus it at the first stop, in which case, we just say 'Starting stop' for previous_stop\n if i == stop_list[0]:\n previous_stop = 'Starting stop'\n # Else, we get the previous stop\n else:\n previous_stop = stop_list[stop_list.index(i) - 1]\n\n # If the bus is the last one, we will only append to bus_number_3\n if bus_number == 3:\n # If we reach the stop where bus number 2 is, we must append this stop to both bus_number_3 and bus_number2 and\n # decrease the bus_number counter\n if i == bus_2:\n bus_number -= 1\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[1]['delay'], 'arrival_hour':first_3_buses[1]['arrivaldatetime'][11:13], 'datetime':first_3_buses[1]['arrivaldatetime'], 'previous_stop':previous_stop})\n stops_bus_2.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\n else:\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\n\n # Now, we keep adding bus 2 and bus 3\n elif bus_number == 2:\n # If we reach the stop where bus number 1 is, we must append this stop to both bus_number_3 and bus_number2 and\n # bus_number1 and decrease the bus_number counter\n if i == bus_1:\n bus_number -= 1\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[2]['delay'], 'arrival_hour':first_3_buses[2]['arrivaldatetime'][11:13], 'datetime':first_3_buses[2]['arrivaldatetime'], 'previous_stop':previous_stop})\n stops_bus_2.append({'stopid':i, 'delay':first_3_buses[1]['delay'], 'arrival_hour':first_3_buses[1]['arrivaldatetime'][11:13], 'datetime':first_3_buses[1]['arrivaldatetime'], 'previous_stop':previous_stop})\n stops_bus_1.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\n else:\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[1]['delay'], 'arrival_hour':first_3_buses[1]['arrivaldatetime'][11:13], 'datetime':first_3_buses[1]['arrivaldatetime'], 'previous_stop':previous_stop})\n stops_bus_2.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\n\n # Here, we are now appending all the buses, until we finally reach the source stop\n elif bus_number == 1:\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[2]['delay'], 'arrival_hour':first_3_buses[2]['arrivaldatetime'][11:13], 'datetime':first_3_buses[2]['arrivaldatetime'], 'previous_stop':previous_stop})\n stops_bus_2.append({'stopid':i, 'delay':first_3_buses[1]['delay'], 'arrival_hour':first_3_buses[1]['arrivaldatetime'][11:13], 'datetime':first_3_buses[1]['arrivaldatetime'], 'previous_stop':previous_stop})\n stops_bus_1.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\n joined = [stops_bus_1, stops_bus_2, stops_bus_3]\n return joined","def _validate_columns(data, ip_column, lat_column, long_column, other_columns):\n if not ip_column and not (lat_column and long_column):\n raise ValueError(\n \"Data must have either an IpAddress ('ip_column')\",\n \"or latitude ('lat_column') and longitude ('long_column')\",\n )\n param_cols: List[str] = []\n for param in other_columns:\n if not param:\n continue\n if isinstance(param, list):\n param_cols.extend(param)\n else:\n param_cols.append(param)\n missing_columns = {col for col in param_cols if col not in data.columns}\n if missing_columns:\n raise LookupError(\n \"The following columns are not in the supplied DataFrame\",\n \",\".join(f\"'{col}'\" for col in missing_columns),\n )","def _validate_trajectory_transition(subgaits, from_subgait_names, to_subgait_names):\n for from_subgait_name, to_subgait_name in zip(from_subgait_names, to_subgait_names):\n\n if not all(name not in ('start', 'end', None) for name in (from_subgait_name, to_subgait_name)):\n continue # a start or end point can not be compared to a subgait\n\n from_subgait = next((subgait for subgait in subgaits if subgait.subgait_name == from_subgait_name), None)\n to_subgait = next((subgait for subgait in subgaits if subgait.subgait_name == to_subgait_name), None)\n\n if not from_subgait.validate_subgait_transition(to_subgait):\n raise NonValidGaitContent(msg='End setpoint of subgait {sn} to subgait {ns} does not match'\n .format(sn=from_subgait.subgait_name, ns=to_subgait.subgait_name))","def validate(self) -> bool:\n required = self.crud.validate(required=True)\n if required:\n raise ValueError(\n f\"Validation error. Required destination fields are not present in the crosswalk: {required}\"\n )","def testPossibleSitesLocationFlags(self):\n ele = WorkQueueElement(SiteWhitelist=[\"T1_IT_CNAF\", \"T2_DE_DESY\"])\n\n # test element with InputDataset and no location, but input flag on\n ele['Inputs'] = {\"/MY/BLOCK/NAME#73e99a52\": []}\n ele['NoInputUpdate'] = True\n self.assertItemsEqual(possibleSites(ele), [\"T1_IT_CNAF\", \"T2_DE_DESY\"])\n # test element with InputDataset and one match, but input flag on\n ele['Inputs'] = {\"/MY/BLOCK/NAME#73e99a52\": [\"T1_IT_CNAF\", \"T2_CH_CERN\"]}\n self.assertItemsEqual(possibleSites(ele), [\"T1_IT_CNAF\", \"T2_DE_DESY\"])\n # test element with InputDataset and one match, but pu flag on\n ele['NoInputUpdate'] = False\n ele['NoPileupUpdate'] = True\n self.assertEqual(possibleSites(ele), [\"T1_IT_CNAF\"])\n # test element with InputDataset and one match, but both flags on\n ele['NoInputUpdate'] = True\n self.assertItemsEqual(possibleSites(ele), [\"T1_IT_CNAF\", \"T2_DE_DESY\"])\n\n # test element with InputDataset and ParentData and no location, but both flags on\n ele['ParentFlag'] = True\n ele['ParentData'] = {\"/MY/BLOCK2/NAME#002590494c06\": []}\n self.assertItemsEqual(possibleSites(ele), [\"T1_IT_CNAF\", \"T2_DE_DESY\"])\n # test element with InputDataset and ParentData and no location, but input flag on\n ele['NoPileupUpdate'] = False\n self.assertItemsEqual(possibleSites(ele), [\"T1_IT_CNAF\", \"T2_DE_DESY\"])\n # test element with InputDataset and ParentData and no location, but pileup flag on\n ele['NoInputUpdate'] = False\n ele['NoPileupUpdate'] = True\n self.assertEqual(possibleSites(ele), [])\n\n # test element with InputDataset, PileupData and ParentData with no location, but pileup flag on\n ele['Inputs'] = {\"/MY/BLOCK/NAME#73e99a52\": [\"T1_US_FNAL\", \"T2_CH_CERN\", \"T2_DE_DESY\"]}\n ele['ParentData'] = {\"/MY/BLOCK2/NAME#002590494c06\": [\"T2_DE_DESY\"]}\n ele['PileupData'] = {\"/MY/DATASET/NAME\": []}\n self.assertEqual(possibleSites(ele), [\"T2_DE_DESY\"])\n # test element with InputDataset, PileupData and ParentData with no location, but both flags on\n ele['NoInputUpdate'] = True\n self.assertItemsEqual(possibleSites(ele), [\"T1_IT_CNAF\", \"T2_DE_DESY\"])\n # test element with InputDataset, PileupData and ParentData with no location, but input flag on\n ele['NoPileupUpdate'] = False\n self.assertEqual(possibleSites(ele), [])","def roadSegments(locations, API_key=\"Avah46_M-gfFeQ3P1w09Qq1ElAV9ZEHFDm9b8JRCRa8qPP5uVn21hDqAPVJgV4i_\"): \n \n # Base URL\n uri = 'http://dev.virtualearth.net/' # Resource URL \n path = 'REST/v1/Routes?'\n \n \n # URL Parameters\n params = { 'wayPoint.0' : locations[0]+',Singapore',\n 'wayPoint.1' : locations[1]+',Singapore',\n 'routeAttributes':'routePath',\n 'key' : API_Key} # by default 'optimize' : 'time'} # this is by default\n \n url = uri+path\n\n results = requests.get(\n url,\n params = params\n ).json()# ['resourceSets']\n\n # Retrieving values\n statusCode = results['statusCode']\n if statusCode == 200:\n # print(statusCode)\n\n # TODO review the exceptions and modify these basic exception handlings\n try:\n travelDistance = results['resourceSets'][0]['resources'][0]['travelDistance']\n except:\n travelDistance = 0\n try:\n travelDuration = results['resourceSets'][0]['resources'][0]['travelDuration']\n except:\n travelDuration = 0\n try:\n travelDurationTraffic = results['resourceSets'][0]['resources'][0]['travelDurationTraffic']\n except:\n travelDurationTraffic = 0\n\n try:\n numberSegments = len(results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\n ['itineraryItems'])\n except:\n numberSegments = 0\n try:\n itineraryItems = results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\n ['itineraryItems']\n except:\n itineraryItems = 'No items'\n\n pathCoord = results['resourceSets'][0]['resources'][0]['routePath']['line']['coordinates']\n\n roadName = []\n travelDistances = []\n travelDurations = []\n maneuverType = []\n\n for seg in itineraryItems:\n for i in range(len(seg['details'])):\n # print(i)\n try:\n roadName.append(seg['details'][i]['names'])\n except:\n roadName.append(0)\n try:\n travelDistances.append(seg['travelDistance'])\n except:\n travelDistances.append(0)\n\n try:\n travelDurations.append(seg['travelDuration'])\n except:\n travelDurations.append(0)\n try:\n maneuverType.append(seg['details'][i]['maneuverType'])\n except:\n maneuverType.append(0)\n\n\n return statusCode,travelDistance,travelDuration,travelDurationTraffic,numberSegments,roadName, \\\n travelDistances, travelDurations, maneuverType, pathCoord\n\n else:\n print(\"Unsuccessful route calculation.\")","def __init__(self, route_idx=None, arr_date=None, dep_time=None, lon=None, dep_date=None, track=None, rt_track=None, id=None, rt_dep_time=None, rt_arr_time=None, name=None, arr_time=None, lat=None, rt_dep_date=None, rt_arr_date=None):\n\n self._route_idx = None\n self._arr_date = None\n self._dep_time = None\n self._lon = None\n self._dep_date = None\n self._track = None\n self._rt_track = None\n self._id = None\n self._rt_dep_time = None\n self._rt_arr_time = None\n self._name = None\n self._arr_time = None\n self._lat = None\n self._rt_dep_date = None\n self._rt_arr_date = None\n\n self.route_idx = route_idx\n if arr_date is not None:\n self.arr_date = arr_date\n if dep_time is not None:\n self.dep_time = dep_time\n self.lon = lon\n if dep_date is not None:\n self.dep_date = dep_date\n self.track = track\n if rt_track is not None:\n self.rt_track = rt_track\n self.id = id\n if rt_dep_time is not None:\n self.rt_dep_time = rt_dep_time\n if rt_arr_time is not None:\n self.rt_arr_time = rt_arr_time\n self.name = name\n if arr_time is not None:\n self.arr_time = arr_time\n self.lat = lat\n if rt_dep_date is not None:\n self.rt_dep_date = rt_dep_date\n if rt_arr_date is not None:\n self.rt_arr_date = rt_arr_date","def _check_polyline(x_coords_metres, y_coords_metres):\n\n error_checking.assert_is_numpy_array_without_nan(x_coords_metres)\n error_checking.assert_is_numpy_array(x_coords_metres, num_dimensions=1)\n num_vertices = len(x_coords_metres)\n\n error_checking.assert_is_numpy_array_without_nan(y_coords_metres)\n error_checking.assert_is_numpy_array(\n y_coords_metres, exact_dimensions=numpy.array([num_vertices]))","def coalesce_helper(self, netmask, routes):\n # decrement netmask by 1\n netmask = netmask - 1\n routes_checked = []\n # iterate through every route combination\n for r1 in routes:\n for r2 in routes:\n # skip if routes are same, already checked, or source IPs arent matching\n if r1 == r2 or r2 in routes_checked or r1[SRC_IF] != r2[SRC_IF]:\n continue\n # calculate route 1's network prefix and pad until 32 bits\n r1_network = self.ip_to_binary(r1[MESG][NTWK])\n r1_netmask = self.ip_to_binary(r1[MESG][NMSK]).count('1')\n r1_prefix = self.pad_end(r1_network[:r1_netmask], '0', IP4_BIT_MAX)\n # calculate route 2's network prefix and pad until 32 bits\n r2_network = self.ip_to_binary(r2[MESG][NTWK])\n r2_netmask = self.ip_to_binary(r2[MESG][NMSK]).count('1')\n r2_prefix = self.pad_end(r2_network[:r2_netmask], '0', IP4_BIT_MAX)\n # check if same next-hop router\n if r1_prefix[:netmask] == r2_prefix[:netmask]:\n # check if other attributes are matching\n if (r1[MESG][LPRF] == r2[MESG][LPRF] and r1[MESG][ORIG] == r2[MESG][ORIG]\n and r1[MESG][APTH] == r2[MESG][APTH] and r1[MESG][SORG] == r2[MESG][SORG]\n and r1[MESG][SORG] == r2[MESG][SORG]):\n # remove unnecessary route\n self.routes.remove(r2)\n # update netmask for keeper route\n base_bits = self.pad_end('', '1', netmask)\n final_bits = self.pad_end(base_bits, '0', IP4_BIT_MAX)\n r1[MESG][NMSK] = self.binary_to_ip(final_bits)\n #Check if the new netmask is able to aggregate with another\n recheck_routes = []\n r1_nmsk = final_bits.count('1')\n for r in self.routes:\n r_nmsk = self.ip_to_binary(r[MESG][NMSK]).count('1')\n if r1_nmsk == r_nmsk:\n recheck_routes.append(r)\n recheck_routes.append(r1)\n self.coalesce_helper(r_nmsk, recheck_routes)\n # done checking, add to routes checked list\n routes_checked.append(r1)","def run_travel_optimisation(trip_start_date, is_min_co2_search = False, is_force_compute = False):\n \n waypoint_co2 = {}\n waypoint_durations = {}\n\n # get all prefectures referential\n db_connector = Connector()\n with db_connector:\n results = db_connector.execute_query(sql.SQL_GET_ALL_PREFECTURE)\n all_waypoints = pd.DataFrame(results.fetchall())\n\n # Vérification si les trajets péfecture à préfecture ont été déjà calculés\n db_connector = Connector()\n with db_connector:\n saved_waypoints = db_connector.execute_query(sql.SQL_GET_WAYPOINTS)\n\n # Dans le précalcul des trajets optimaux, utilisation de la date courante\n travel_date = datetime.now().strftime(\"%Y%m%dT%H%M%S\")\n bad_waypoints = []\n\n if saved_waypoints.rowcount > 0 and not is_force_compute:\n print(\"le référentiel des voyage existe déjà\")\n else:\n try:\n bdd_management.truncate_journey()\n\n for (from_city, to_city) in combinations(all_waypoints[0].values, 2):\n try:\n if int(from_city) in bad_waypoints or int(to_city) in bad_waypoints:\n continue\n\n route = requests.get(API_NAVITIA.format(\n int(from_city), int(to_city), travel_date, API_KEY))\n response = json.loads(route.text)\n\n mid_duration = 0\n mid_co2 = 0\n for journey in response[\"journeys\"]:\n mid_duration += journey[\"duration\"]\n mid_co2 += journey[\"co2_emission\"][\"value\"]\n\n waypoint_co2[frozenset([from_city, to_city])\n ] = mid_co2/len(response[\"journeys\"])\n waypoint_durations[frozenset(\n [from_city, to_city])] = mid_duration/len(response[\"journeys\"])\n\n except Exception as e:\n print(\"Error with finding the route between %s and %s : %s\" %\n (from_city, to_city, response[\"error\"][\"message\"]))\n if 'no destination point' == response[\"error\"][\"message\"]:\n bad_waypoints.append(int(to_city))\n\n if 'no origin point' == response[\"error\"][\"message\"]:\n bad_waypoints.append(int(from_city))\n\n for bad_insee_code in re.findall('The entry point: admin:fr:([0-9]+) is not valid', response[\"error\"][\"message\"]):\n if not int(bad_insee_code) in bad_waypoints:\n bad_waypoints.append(int(bad_insee_code))\n\n # Enregistrement des trajets point à point (préfecture à préfecture)\n db_connector = Connector()\n with db_connector:\n for (waypoint1, waypoint2) in waypoint_co2.keys():\n waypoint = [waypoint1,\n waypoint2,\n str(waypoint_co2[frozenset([waypoint1, waypoint2])]),\n str(int(waypoint_durations[frozenset([waypoint1, waypoint2])]))]\n \n db_connector.execute_nonquery(sql.SQL_INSERT_WAYPOINT, waypoint)\n # commit trajets unitaires dans la bdd\n db_connector.commit()\n\n # enregistrement des préfectures non trouvée (pas de gare)\n print(bad_waypoints)\n db_connector = Connector()\n with db_connector:\n for bad_city in bad_waypoints:\n db_connector.execute_nonquery(\n sql.SQL_INSERT_CITY_WITHOUT_STATION, str(bad_city))\n #db_connector.commit()\n except Exception as e:\n print('Erreur durant la génération des trajets de préfecture en préfecture. Rollback effectué')\n\n waypoint_co2 = {}\n waypoint_durations = {}\n processed_waypoints = set()\n\n db_connector = Connector()\n with db_connector:\n waypoints = db_connector.execute_query(sql.SQL_GET_WAYPOINTS)\n\n for row in waypoints:\n waypoint_co2[frozenset([int(row[0]), int(row[1])])] = row[2]\n waypoint_durations[frozenset([int(row[0]), int(row[1])])] = row[3]\n processed_waypoints.update([row[0], row[1]])\n\n travel_results = algorithms.run_genetic_algorithm(waypoints = list(processed_waypoints), is_min_co2_search = is_min_co2_search, generations=300, population_size=100 )\n\n # take most represented trip order\n journey_groups = Counter(chain(*travel_results))\n top_journeys = journey_groups.most_common(1)[0][0]\n\n print('Le voyage le plus représentatif est :')\n print(top_journeys)\n\n # calcul des horaires de voyage réels pour le trajet le plus optimisé\n\n print('Départ du calcul du voyage le %s' %\n (datetime_str_to_datetime_str(trip_start_date)))\n travel_date = trip_start_date\n\n db_connector = Connector()\n with db_connector:\n try:\n #vidage de la table contenant les informations du voyage\n bdd_management.truncate_roadtrip()\n\n for i in range(len(top_journeys)-1):\n try:\n from_city_insee = top_journeys[i]\n to_city_insee = top_journeys[i+1]\n route = requests.get(API_NAVITIA.format(\n int(from_city_insee), int(to_city_insee), travel_date, API_KEY))\n travels = json.loads(route.text)\n\n # Contrôle des voyage reçus pour identifier le plus adapté à recherche\n best_travel = travels[\"journeys\"][0]\n for travel in travels[\"journeys\"]:\n if is_min_co2_search and float(best_travel['co2_emission']['value']) > float(travel['co2_emission']['value']):\n best_travel = travel\n if best_travel['arrival_date_time'] > travel['arrival_date_time']:\n best_travel = travel\n\n # sauvegarde du trajet 'i' en base\n save_trip_section(db_connector, all_waypoints, from_city_insee, to_city_insee, best_travel)\n\n # le prochain trajet devra avoir une date de départ > à la date de ce trajet\n travel_date = best_travel['arrival_date_time']\n\n except Exception as e:\n print(\"!! Erreur durant le calcul du trajet entre '%s' et '%s'\" %\n (from_city_insee, to_city_insee))\n\n #Ecriture du résumé du voyage\n resume = db_connector.execute_query(sql.SQL_GET_C02_CONSUMPTION_RESUME)\n resume = resume.fetchone()\n\n resume_description = \"\"\"Début du voyage le {} . Arrivée le {}. \n Le voyage à durée {} pour un total de {:d} kgeC\"\"\".format(\n datetime_str_to_datetime_str(trip_start_date),\n datetime_str_to_datetime_str(travel_date),\n str(timedelta(seconds=resume[0])) ,\n trunc( resume[1]/1000))\n\n store_section(db_connector, resume_description, None, None, 'INFO', resume[0], resume[1])\n\n db_connector.commit()\n\n except Exception as e:\n db_connector.rollback()\n print('Erreur durant la création du voyage. rollback effectué!!!')\n\n print('print map with road-trip data')\n visualization.generate_visualization()\n\n print('Travel complete. Have nive trip!!!')","def analyseCoordination(self):\n #create a list of criteria that correspond to maximal path length\n #max_path_length = max(self.pathLengths)\n\n #criterion_max_path_length = []\n #origins_max_path_length = []\n #for c in range(len(self.pathLengths)):\n # if self.pathLengths[c] == max_path_length:\n # criterion_max_path_length.append(self.globalMin[c])\n # origins_max_path_length.append(self.origins[c])\n\n #min_criterion = min(criterion_max_path_length)\n\n #find index\n #for m in range(len(criterion_max_path_length)):\n # if criterion_max_path_length[m] == min_criterion:\n # break\n\n #for s in range(len(self.origins)):\n # if self.origins[s] == origins_max_path_length[m]:\n # break\n\n min_criterion = self.globalMin[0]\n self.overall_min = min_criterion\n self.overall_max_path_length = len(self.min_path[0])\n\n if self.chosenScheduleIndex != self.globalMinSchedIdx[0]:\n self.chosenScheduleIndex = self.globalMinSchedIdx[0]\n self.chosenSchedule = self.schedules[self.chosenScheduleIndex]\n self.EConsumptionChosenSchedule = self.EConsumptionScheduleCurves[self.chosenScheduleIndex]\n # update SOC\n self.setSOC(self.SOCEnd[self.chosenScheduleIndex])\n # update modulation level\n self.setStateModlvl(self.chosenSchedule[-1])\n\n\n # inform all neighbors about origin that has local minimal criterion\n for n in range(len(self.Neighbors)):\n #structure: ['minimalorigin', ID_minimal_origin, minimal_criterion_value]\n #self.sendMessage(self.Neighbors[n], 70, ['minimalorigin', copy.deepcopy(origins_max_path_length[m]), copy.deepcopy(min_criterion), copy.deepcopy(self.min_path[s]), copy.deepcopy(self.min_path_schedules[s])])\n self.sendMessage(self.Neighbors[n], 70, ['minimalorigin', copy.deepcopy(self.CommID), copy.deepcopy(min_criterion), copy.deepcopy(self.min_path[0]), copy.deepcopy(self.min_path_schedules[0])])\n\n if self.OPTcriterion == 'maxmindiff':\n fluct_criterion = max(self.EFluctuationCurve) - min(self.EFluctuationCurve)\n elif self.OPTcriterion == 'absremainder':\n fluct_criterion = 0\n for a in range(len(self.EFluctuationCurve)):\n fluct_criterion += abs(self.EFluctuationCurve[a])\n\n\n #print 'ID {0}: criterion is: {1} , of origin {4}, path length: {2}, schedules: {5}, with improvement of {3} %'.format(self.CommID, min_criterion, len(self.min_path[s]), 100 - 100*(float((float(min_criterion))/float(fluct_max_min_diff))), origins_max_path_length[m], self.min_path_schedules[s] )\n self.log_message('ID {0}: criterion is: {1} , of origin {4}, path length: {2}, schedules: {5}, with improvement of {3} %'.format(self.CommID, min_criterion, len(self.min_path[0]), 100 - 100*(float((float(min_criterion))/float(fluct_criterion))), self.CommID, self.min_path_schedules[0] ))","def _parse_departures(self, data, stop, servernow):\n servernow.replace(second=0, microsecond=0)\n results = []\n departures = data.findall('./itdDeparture')\n for departure in departures:\n # Get Line Information\n origin, destination, line, ridenum, ridedir, canceled = self._parse_mot(departure.find('./itdServingLine'))\n\n if departure.find('./genAttrList/genAttrElem[value=\"HIGHSPEEDTRAIN\"]') is not None:\n line.linetype = LineType('train.longdistance.highspeed')\n elif departure.find('./genAttrList/genAttrElem[value=\"LONG_DISTANCE_TRAINS\"]') is not None:\n line.linetype = LineType('train.longdistance')\n\n # if ridenum is None:\n # ridedata = departure.find('./itdServingTrip')\n # if ridedata is not None:\n # ridenum = ridedata.attrib.get('tripCode', None)\n # if ridenum is not None:\n # ridenum = ridenum.strip()\n\n # Build Ride Objekt with known stops\n ride = Ride(line, ridenum)\n ride.direction = ridedir\n ride.canceled = canceled\n\n train_line = line.linetype in self.train_station_lines\n\n # todo: take delay and add it to next stops\n mypoint = self._parse_trip_point(departure, train_line=train_line)\n\n before_delay = None\n if mypoint.arrival:\n before_delay = mypoint.arrival.delay\n after_delay = None\n if mypoint.departure:\n after_delay = mypoint.departure.delay\n\n delay = None\n if departure.find('./itdServingLine/itdNoTrain'):\n delay = departure.find('./itdServingLine/itdNoTrain').attrib.get('delay', None)\n if delay is not None:\n delay = timedelta(minutes=delay)\n\n if delay is not None:\n if (mypoint.arrival and servernow < mypoint.arrival.livetime) or (mypoint.departure and servernow < mypoint.departure.livetime):\n before_delay = delay\n else:\n after_delay = delay\n\n prevs = False\n for pointdata in departure.findall('./itdPrevStopSeq/itdPoint'):\n point = self._parse_trip_point(pointdata, train_line=train_line)\n if point is not None:\n if before_delay is not None:\n if point.arrival is not None and point.arrival.delay is None and point.arrival.time + before_delay >= servernow:\n point.arrival.delay = before_delay\n if point.departure is not None and point.departure.delay is None and point.departure.time + before_delay >= servernow:\n point.departure.delay = before_delay\n prevs = True\n ride.append(point)\n\n pointer = ride.append(mypoint)\n\n onwards = False\n for pointdata in departure.findall('./itdOnwardStopSeq/itdPoint'):\n point = self._parse_trip_point(pointdata, train_line=train_line)\n if point is not None:\n if after_delay is not None:\n if point.arrival is not None and point.arrival.delay is None and point.arrival.time + after_delay >= servernow:\n point.arrival.delay = after_delay\n if point.departure is not None and point.departure.delay is None and point.departure.time + after_delay >= servernow:\n point.departure.delay = after_delay\n onwards = True\n ride.append(point)\n\n if not prevs and not onwards:\n ride.prepend(None)\n if origin is not None:\n ride.prepend(TimeAndPlace(Platform(origin)))\n\n ride.append(None)\n if destination is not None:\n ride.append(TimeAndPlace(Platform(destination)))\n\n # Return RideSegment from the Station we depart from on\n results.append(ride[pointer:])\n return Ride.Results(results)"],"string":"[\n \"def _insert_stops_one_to_one(self): # pylint: disable=too-many-locals\\r\\n # Use an insertCursor to insert Stops into the Route analysis\\r\\n destinations = {}\\r\\n destination_rows = []\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.origin_unique_id_field_name, \\\"SHAPE@\\\", self.dest_unique_id_field_name] +\\r\\n self.origin_transfer_fields\\r\\n ) as icur:\\r\\n # Loop through origins and insert them into Stops along with their assigned destinations\\r\\n for origin in arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_origins_layer,\\r\\n [\\\"SHAPE@\\\", self.origin_id_field, self.assigned_dest_field] + self.origin_transfer_fields\\r\\n ):\\r\\n dest_id = origin[2]\\r\\n if dest_id is None:\\r\\n continue\\r\\n if dest_id not in destinations:\\r\\n dest_val = f\\\"'{dest_id}'\\\" if isinstance(dest_id, str) else dest_id\\r\\n with arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_destinations_layer,\\r\\n [\\\"SHAPE@\\\", self.dest_id_field] + self.destination_transfer_fields,\\r\\n where_clause=f\\\"{self.dest_id_field} = {dest_val}\\\"\\r\\n ) as cur:\\r\\n try:\\r\\n destinations[dest_id] = next(cur)\\r\\n except StopIteration:\\r\\n # The origin's destination is not present in the destinations table. Just skip the origin.\\r\\n continue\\r\\n # Insert origin and destination\\r\\n destination = destinations[dest_id]\\r\\n if self.reverse_direction:\\r\\n route_name = f\\\"{dest_id} - {origin[1]}\\\"\\r\\n origin_sequence = 2\\r\\n destination_sequence = 1\\r\\n else:\\r\\n route_name = f\\\"{origin[1]} - {dest_id}\\\"\\r\\n origin_sequence = 1\\r\\n destination_sequence = 2\\r\\n # Define the final origin and destination rows for the input Stops\\r\\n origin_row = [route_name, origin_sequence, origin[1], origin[0], None] + list(origin)[3:]\\r\\n destination_row = [route_name, destination_sequence, None, destination[0], destination[1]] + \\\\\\r\\n list(destination)[2:]\\r\\n icur.insertRow(origin_row)\\r\\n destination_rows.append(destination_row)\\r\\n\\r\\n # Insert destinations\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.origin_unique_id_field_name, \\\"SHAPE@\\\", self.dest_unique_id_field_name] +\\r\\n self.destination_transfer_fields\\r\\n ) as dcur:\\r\\n for row in destination_rows:\\r\\n dcur.insertRow(row)\",\n \"def verify_destinations(**kwargs):\\n if \\\"mapd_db\\\" in kwargs[\\\"destinations\\\"]:\\n valid_destination_set = True\\n if kwargs[\\\"dest_db_server\\\"] is None:\\n # If dest_server is not set for mapd_db, then exit\\n logging.error(\\n '\\\"dest_server\\\" is required when destination = \\\"mapd_db\\\"'\\n )\\n if \\\"file_json\\\" in kwargs[\\\"destinations\\\"]:\\n valid_destination_set = True\\n if kwargs[\\\"output_file_json\\\"] is None:\\n # If output_file_json is not set for file_json, then exit\\n logging.error(\\n '\\\"output_file_json\\\" is required when destination = \\\"file_json\\\"'\\n )\\n if \\\"output\\\" in kwargs[\\\"destinations\\\"]:\\n valid_destination_set = True\\n if \\\"jenkins_bench\\\" in kwargs[\\\"destinations\\\"]:\\n valid_destination_set = True\\n if kwargs[\\\"output_file_jenkins\\\"] is None:\\n # If output_file_jenkins is not set for jenkins_bench, then exit\\n logging.error(\\n '\\\"output_file_jenkins\\\" is required '\\n + 'when destination = \\\"jenkins_bench\\\"'\\n )\\n if not valid_destination_set:\\n return False\\n else:\\n return True\",\n \"def test_route_init() -> None:\\n rschema = RouteSchema(SpecificLocation())\\n route = Route(schema=rschema)\\n\\n assert route.schema is rschema # Cannot use __eq__\\n assert isinstance(route.stops, list)\",\n \"def route_matrix(client, origins, destinations, **kwargs):\\n\\n sep_pattern = re.compile(r'[,;|]')\\n CN_pattern = re.compile(u'[\\\\u4e00-\\\\u9fa5]+')\\n\\n is_origins_str = isinstance(origins, str)\\n is_origins_list = isinstance(origins, list)\\n if not any([is_origins_str, is_origins_list]):\\n raise ValueError('\\\"origins\\\" must be str or list!')\\n elif is_origins_str:\\n sep_origins = sep_pattern.split(origins)\\n u_origins = origins.decode('utf-8')\\n CN_pattern = re.compile(u'[\\\\u4e00-\\\\u9fa5]+')\\n match = CN_pattern.search(u_origins)\\n if match:\\n if len(sep_origins) > 5:\\n raise ValueError('\\\"origins\\\" incorrect! upper limits is 5.')\\n else:\\n origins = '|'.join(sep_origins)\\n else:\\n if len(sep_origins) > 10:\\n raise ValueError('\\\"origins\\\"incorrect! upper limits is 5.')\\n else:\\n temp = [','.join(sep_origins[(2*x):(2*x+2)][::-1])\\n for x in range(0, len(sep_origins)/2)]\\n origins = '|'.join(temp)\\n\\n else:\\n # element in list is CN_pattern characters.\\n if len(origins[0]) == 1:\\n origins = '|'.join(origins)\\n # element in list is list/tuple of lng,lat.\\n else:\\n origins = [map(str, l) for l in origins]\\n origins = '|'.join([','.join(l[::-1]) for l in origins])\\n\\n is_destinations_str = isinstance(destinations, str)\\n is_destinations_list = isinstance(destinations, list)\\n\\n if not any([is_destinations_str, is_destinations_list]):\\n raise ValueError('\\\"destinations\\\" must be str or list!')\\n elif is_destinations_str:\\n sep_destinations = sep_pattern.split(destinations)\\n u_destinations = destinations.decode('utf-8')\\n CN_pattern = re.compile(u'[\\\\u4e00-\\\\u9fa5]+')\\n match = CN_pattern.search(u_destinations)\\n if match:\\n if len(sep_destinations) > 5:\\n raise ValueError('\\\"destinations\\\" incorrect! upper limits is \\\\\\n 5.')\\n else:\\n destinations = '|'.join(sep_destinations)\\n else:\\n if len(sep_destinations) > 10:\\n raise ValueError('\\\"destinations\\\"incorrect! upper limits is 5.')\\n else:\\n temp = [','.join(sep_destinations[(2*x):(2*x+2)][::-1])\\n for x in range(0, len(sep_destinations)/2)]\\n destinations = '|'.join(temp)\\n\\n else:\\n if len(destinations[0]) == 1:\\n destinations = '|'.join(destinations)\\n else:\\n # first, map to str.\\n destinations = [map(str, l) for l in destinations]\\n destinations = '|'.join([','.join(l[::-1]) for l in destinations])\\n\\n kwargs.update({'server_name': 'direction', 'version': 'v1',\\n 'subserver_name': 'routematrix', 'origins': origins,\\n 'destinations': destinations})\\n\\n return client.get(kwargs)\",\n \"def _insert_stops_many_to_many(self):\\r\\n # Store data of the relevant origins and destinations in dictionaries for quick lookups and reuse\\r\\n o_data = {} # {Origin ID: [Shape, transferred fields]}\\r\\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_origins_layer,\\r\\n [self.origin_id_field, \\\"SHAPE@\\\"] + self.origin_transfer_fields\\r\\n ):\\r\\n o_data[row[0]] = row[1:]\\r\\n d_data = {} # {Destination ID: [Shape, transferred fields]}\\r\\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_destinations_layer,\\r\\n [self.dest_id_field, \\\"SHAPE@\\\"] + self.destination_transfer_fields\\r\\n ):\\r\\n d_data[row[0]] = row[1:]\\r\\n\\r\\n # Insert origins from each OD pair into the Route analysis\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.origin_unique_id_field_name, \\\"SHAPE@\\\"] + self.origin_transfer_fields\\r\\n ) as icur:\\r\\n for od_pair in self.od_pairs:\\r\\n origin_id, dest_id = od_pair\\r\\n try:\\r\\n origin_data = o_data[origin_id]\\r\\n except KeyError:\\r\\n # This should never happen because we should have preprocessed this out.\\r\\n self.logger.debug(\\r\\n f\\\"Origin from OD Pairs not found in inputs. Skipped pair {od_pair}.\\\")\\r\\n continue\\r\\n route_name = f\\\"{origin_id} - {dest_id}\\\"\\r\\n icur.insertRow((route_name, 1, origin_id) + origin_data)\\r\\n\\r\\n # Insert destinations from each OD pair into the Route analysis\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.dest_unique_id_field_name, \\\"SHAPE@\\\"] + self.destination_transfer_fields\\r\\n ) as icur:\\r\\n for od_pair in self.od_pairs:\\r\\n origin_id, dest_id = od_pair\\r\\n try:\\r\\n dest_data = d_data[dest_id]\\r\\n except KeyError:\\r\\n # This should never happen because we should have preprocessed this out.\\r\\n self.logger.debug(\\r\\n f\\\"Destination from OD Pairs not found in inputs. Skipped pair {od_pair}.\\\")\\r\\n continue\\r\\n route_name = f\\\"{origin_id} - {dest_id}\\\"\\r\\n icur.insertRow((route_name, 2, dest_id) + dest_data)\",\n \"def _check_inputlengths(self):\\n # Check x and y have more than 1 item, and x and y are equal length\\n if not len(self.x) > 1:\\n raise ValueError(\\\"Route input 'x' must contain more than 1 item\\\")\\n\\n if not (len(self.y) > 1):\\n raise ValueError(\\\"Route input 'y' must contain more than 1 item\\\")\\n\\n if not (len(self.x) == len(self.y)):\\n raise ValueError(\\\"Route inputs 'x' and 'y' must be of equal length\\\")\\n\\n # Performs checks on z if not empty\\n if self.z is not None:\\n for v in self.z.values():\\n if not (len(v) == len(self.x)):\\n raise ValueError(\\\"Route input 'z' must be of equal length to 'x' and 'y'\\\")\",\n \"def test_parse_routes(self):\\n\\n params = get_params()\\n estimator = LinearEstimator()\\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\\n model_builder = OptimizationModelBuilder(\\n constraints=[CapacityConstraint()]\\n )\\n riders = parse_models(model_dicts=test_riders, cls=Rider)\\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\\n depots = parse_models(model_dicts=test_depots, cls=Depot)\\n problem = problem_builder.build(riders, vehicles, depots)\\n model = model_builder.build(problem)\\n solution = model.solve()\\n routes = Router._parse_routes(problem, solution)\\n self.assertTrue(routes, msg='Routes could not be built.')\\n\\n for route in routes:\\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\\n self.assertTrue(\\n len(route['stops']) > 1,\\n msg='Route with single stop.'\\n )\",\n \"def _check_inputvalues(self):\\n # Check x, y and z are int or float dtypes\\n # ie do not contain any unusable values like strings\\n if not (self.x.dtype in [np.int, np.float]):\\n raise TypeError(\\\"Route input 'x' must be either int or float dtypes\\\")\\n\\n if not (self.y.dtype in [np.int, np.float]):\\n raise TypeError(\\\"Route input 'x' must be either int or float dtypes\\\")\\n\\n # Performs checks on z if not empty\\n if self.z is not None:\\n for v in self.z.values():\\n if not (v.dtype in [np.int, np.float]):\\n raise TypeError(\\\"Route input 'x' must be either int or float dtypes\\\")\",\n \"def read_routes(routes_source: TextIO, airports: AirportDict) -> RouteDict:\\n #RouteDict = Dict[str, Set[str]]\\n routes_list = routes_source.readlines()\\n d = {}\\n src_index = ROUTE_DATA_INDEXES['Source airport']\\n dst_index = ROUTE_DATA_INDEXES['Destination airport']\\n \\n for i in range(len(routes_list)):\\n source_airport = get_routes_information(routes_list[i], src_index)\\n destination_airport = get_routes_information(routes_list[i], dst_index)\\n \\n if source_airport in airports and destination_airport in airports\\\\\\n and source_airport not in d:\\n \\n routes = set() # it's a set\\n routes.add(destination_airport)\\n d[source_airport] = routes\\n \\n elif source_airport in airports and destination_airport in \\\\\\n airports and source_airport in d:\\n d[source_airport].add(destination_airport)\\n return d\",\n \"def route(self, ori, dest, pois):\\n #find one route from ori to dest\\n departure_time = int(time.time())\\n routes = util.query_routes(origin=ori, \\n destination=dest,\\n departure_time=departure_time)\\n if routes is None or routes['status'] != \\\"OK\\\":\\n print ',=====',routes\\n return None\\n\\n route = routes[\\\"routes\\\"][0] #get the first route\\n\\n #get the points in the route to search the potential poi\\n points = util.extract_points(route)\\n\\n if points is None or len(points) ==0:\\n print \\\"Error in extracting points\\\"\\n return None\\n #get the candiates in the route\\n candidates = []\\n way_points = pois.split(\\\"|\\\")\\n for point in points:\\n information = {}\\n information[\\\"location\\\"] = point\\n for way_p in way_points:\\n response = util.get_nearby_points(location=point, keyword=way_p)\\n if response is None or response[\\\"status\\\"] != \\\"OK\\\":\\n information[way_p] = []\\n continue\\n ps = []\\n for result in response[\\\"results\\\"]:\\n poi = {\\\"geometry\\\": result[\\\"geometry\\\"],\\n \\\"name\\\": result[\\\"name\\\"],\\n \\\"price_level\\\": result.get(\\\"price_level\\\", None),\\n \\\"rating\\\": result.get(\\\"rating\\\", None),\\n \\\"vicinity\\\": result[\\\"vicinity\\\"]}\\n ps.append(poi)\\n information[way_p] = ps\\n candidates.append(information)\\n \\n cost_matrix = waypoint.find_waypoints([candidates], way_points)\\n cost_matrix.sort(key=lambda x:x[1])\\n\\n top_candidate = cost_matrix[0]\\n json.dump(top_candidate, open('./top_candidate.json','w'))\\n final_route = self.get_direction(ori, dest, top_candidate)\\n json.dump(final_route, open(\\\"./real_route.json\\\", \\\"w\\\"))\\n\\n return final_route, top_candidate\",\n \"def route_gateway_validator(\\n args: StackValidationArgs, report_violation: ReportViolation\\n):\\n routes = filter(lambda r: r.resource_type == \\\"aws:ec2/route:Route\\\", args.resources)\\n gateways = filter(\\n lambda r: r.resource_type == \\\"aws:ec2/internetGateway:InternetGateway\\\",\\n args.resources)\\n gateways_ids = [gateway.props['id'] for gateway in gateways]\\n for route in routes:\\n if route.props[\\\"gatewayId\\\"] not in gateways_ids:\\n report_violation(\\n \\\"You tried to set unexpected Internet Gateway id for Route\\\")\",\n \"def directions_calc(self):\\n \\n # create route_dict, {'radio_button_name': {'geometries': list of coords,\\n # 'values': list of values}}\\n route_dict = self._selectInput()\\n \\n # generate lists with locations and values\\n (start_layer_name,\\n end_layer_name) = [x.objectName() for x in self.radio_buttons]\\n \\n locations_list = list(product(route_dict[start_layer_name]['geometries'],\\n route_dict[end_layer_name]['geometries']))\\n values_list = list(product(route_dict[start_layer_name]['values'],\\n route_dict[end_layer_name]['values']))\\n \\n # If row-by-row in two-layer mode, then only zip the locations\\n if all([button.isChecked() for button in self.radio_buttons]) and self.dlg.routing_twolayer_rowbyrow.isChecked():\\n locations_list = list(zip(route_dict[start_layer_name]['geometries'],\\n route_dict[end_layer_name]['geometries']))\\n\\n values_list = list(zip(route_dict[start_layer_name]['values'],\\n route_dict[end_layer_name]['values']))\\n\\n # Add via point if specified\\n route_via = None\\n if self.dlg.routing_via_label.text() != 'Long,Lat':\\n route_via = [float(x) for x in self.dlg.routing_via_label.text().split(\\\",\\\")]\\n \\n message_bar, progress_widget = progressbar.pushProgressBar(self.iface)\\n \\n responses = []\\n delete_values = []\\n for i, coords_tuple in enumerate(locations_list):\\n if coords_tuple[0] == coords_tuple[-1]:\\n # Skip when same location\\n delete_values.append(i)\\n continue\\n if route_via:\\n # add via coords\\n coords_tuple = list(coords_tuple)\\n coords_tuple.insert(1, route_via)\\n \\n # Update progress bar\\n percent = (i/len(locations_list)) * 100\\n message_bar.setValue(percent)\\n \\n # Make the request\\n self.params['coordinates'] = convert.build_coords(coords_tuple)\\n responses.append(self.client.request(self.url, self.params))\\n \\n # Delete entries in values_list where coords where the same\\n values_list = [value for idx, value in enumerate(values_list) if idx not in delete_values]\\n \\n # Only proceed when there actual responses\\n if responses: \\n layer_out = self._addLine(responses, values_list)\\n layer_out.updateExtents()\\n \\n QgsProject.instance().addMapLayer(layer_out)\\n \\n self.iface.messageBar().popWidget(progress_widget)\",\n \"def buildStopsDict(self):\\n \\n if len(self.nodesDict) == 0:\\n raise Exception('Nodes dictionary is empty!')\\n if len(self.linksDict) == 0:\\n raise Exception('Links dictionary is empty!')\\n \\n self.stopsByRoute = dict()\\n self.stopsByNode = dict()\\n arcpy.env.workspace = PublicTransit.WORKING_GDB\\n \\n tempStops = \\\"temp_stops\\\"\\n tempStopsSp = \\\"temp_stops_sp\\\"\\n \\n # Delete temp_stops and temp_stops_sp feature classes if they exist.\\n if arcpy.Exists(tempStops):\\n arcpy.Delete_management(tempStops)\\n if arcpy.Exists(tempStopsSp):\\n arcpy.Delete_management(tempStopsSp)\\n arcpy.CopyFeatures_management(PublicTransit.RTD_PATH + PublicTransit.RTD_STOPS,\\n tempStops)\\n \\n # Project temp_stops to CA state plane and add XY.\\n install_dir = arcpy.GetInstallInfo()['InstallDir']\\n out_coordinate_system = os.path.join(install_dir, PublicTransit.NAD_83_DIRECTORY)\\n arcpy.Project_management(tempStops, tempStopsSp, out_coordinate_system,\\n \\\"NAD_1983_To_WGS_1984_1\\\")\\n arcpy.AddXY_management(tempStopsSp)\\n \\n # Create a search cursor to traverse all stops.\\n stops = arcpy.SearchCursor(tempStopsSp, \\\"\\\", \\\"\\\",\\n \\\"CPT_STOPPOINTID; SCH_STOPPOINTSEQNO; \\\" +\\n \\\"SCH_ROUTEID; SCH_PATTERNID; ROUTE_PATTERN; \\\" +\\n \\\"SourceOID; POINT_X; POINT_Y\\\",\\n \\\"ROUTE_PATTERN A; SCH_STOPPOINTSEQNO A\\\")\\n numStops = int(arcpy.GetCount_management(tempStopsSp).getOutput(0))\\n print \\\"Found %d stops\\\" % numStops\\n \\n p = index.Property()\\n p.overwrite = True\\n self.spIndex = index.Index(PublicTransit.SPATIAL_INDEX_FILE,properties=p)\\n \\n # For each stop determine the nearest network node.\\n scount = 0\\n icount = 0\\n for s in stops:\\n # only create stops for routes which exist in RTD\\n if not s.ROUTE_PATTERN in self.transitRoutes:\\n continue\\n scount += 1\\n st = TransitStop(s.CPT_STOPPOINTID, s.SCH_ROUTEID, s.SCH_PATTERNID,\\n s.ROUTE_PATTERN, s.SourceOID, s.SCH_STOPPOINTSEQNO)\\n # If the stop's linkId is in the links dictionary use the link from\\n # and to node (these should all be bus routes since MTC's route\\n # traversal FC was created for buses only at this time).\\n if s.SourceOID in self.linksDict:\\n link = self.linksDict[s.SourceOID]\\n # Determine which node is nearest and snap to it.\\n if self.__getDistance(s.POINT_X,\\n s.POINT_Y,\\n link.fromNode.x,\\n link.fromNode.y) <= \\\\\\n self.__getDistance(s.POINT_X,\\n s.POINT_Y,\\n link.toNode.x,\\n link.toNode.y):\\n st.tanaNode = link.fromNode.nodeId\\n else:\\n st.tanaNode = link.toNode.nodeId\\n st.inRegion = True\\n \\n # The stop's link is not in linksDict. These are either stops \\n # outside the region or non-bus routes for which there are no\\n # route traversal edges. Do a link lookup from the Roadways\\n # feature class.\\n else:\\n arcpy.env.workspace = PublicTransit.RTD_PATH\\n roadwaysSearch = arcpy.SearchCursor(PublicTransit.ROADWAYS_FC,\\n \\\"LinkId = \\\" + str(s.SourceOID),\\n \\\"\\\", \\\"\\\", \\\"F_JNCTID; T_JNCTID\\\", \\\"\\\")\\n for r in roadwaysSearch:\\n fromNode = self.__getIdHash(r.F_JNCTID)\\n toNode = self.__getIdHash(r.T_JNCTID)\\n if fromNode in self.nodesDict and toNode in self.nodesDict:\\n if self.__getDistance(s.POINT_X,\\n s.POINT_Y,\\n self.nodesDict[fromNode].x,\\n self.nodesDict[fromNode].y) <= \\\\\\n self.__getDistance(s.POINT_X,\\n s.POINT_Y,\\n self.nodesDict[toNode].x,\\n self.nodesDict[toNode].y):\\n st.tanaNode = fromNode\\n else:\\n st.tanaNode = toNode\\n st.inRegion = True\\n else:\\n st.inRegion = False\\n \\n # Add the stop to stopsByRoute and stopsByNode dictionaries\\n if s.ROUTE_PATTERN in self.stopsByRoute:\\n self.stopsByRoute[s.ROUTE_PATTERN].append(st)\\n else:\\n self.stopsByRoute[s.ROUTE_PATTERN] = [st]\\n if (st.tanaNode in self.stopsByNode):\\n self.stopsByNode[st.tanaNode].append(st)\\n else:\\n self.stopsByNode[st.tanaNode] = [st]\\n # add the stop node to the spatial index\\n if st.tanaNode in self.nodesDict:\\n icount += 1\\n self.spIndex.insert(st.stopPointId,\\n (self.nodesDict[st.tanaNode].x,\\n self.nodesDict[st.tanaNode].y,\\n self.nodesDict[st.tanaNode].x,\\n self.nodesDict[st.tanaNode].y))\\n del stops\",\n \"def transit_to_dict(\\n cities: List[City], transfers: List[Set[StopArea]]\\n) -> dict:\\n data = {\\n \\\"stopareas\\\": {}, # stoparea id => stoparea data\\n \\\"networks\\\": {}, # city name => city data\\n \\\"transfers\\\": {}, # set(tuple(stoparea_id1, stoparea_id2)), id1<id2\\n }\\n\\n for city in (c for c in cities if c.is_good):\\n network = {\\n \\\"id\\\": city.id,\\n \\\"name\\\": city.name,\\n \\\"routes\\\": [],\\n }\\n\\n for route_master in city:\\n route_data = {\\n \\\"id\\\": route_master.id,\\n \\\"mode\\\": route_master.mode,\\n \\\"ref\\\": route_master.ref,\\n \\\"name\\\": route_master.name,\\n \\\"colour\\\": route_master.colour,\\n \\\"infill\\\": route_master.infill,\\n \\\"itineraries\\\": [],\\n }\\n\\n for route in route_master:\\n variant_data = {\\n \\\"id\\\": route.id,\\n \\\"tracks\\\": route.get_tracks_geometry(),\\n \\\"start_time\\\": route.start_time,\\n \\\"end_time\\\": route.end_time,\\n \\\"interval\\\": route.interval,\\n \\\"stops\\\": [\\n {\\n \\\"stoparea_id\\\": route_stop.stoparea.id,\\n \\\"distance\\\": route_stop.distance,\\n }\\n for route_stop in route.stops\\n ],\\n }\\n\\n # Store stopareas participating in the route\\n # and that have not been stored yet\\n for route_stop in route.stops:\\n stoparea = route_stop.stoparea\\n if stoparea.id in data[\\\"stopareas\\\"]:\\n continue\\n stoparea_data = {\\n \\\"id\\\": stoparea.id,\\n \\\"center\\\": stoparea.center,\\n \\\"name\\\": stoparea.station.name,\\n \\\"entrances\\\": [\\n {\\n \\\"id\\\": egress_id,\\n \\\"name\\\": egress[\\\"tags\\\"].get(\\\"name\\\"),\\n \\\"ref\\\": egress[\\\"tags\\\"].get(\\\"ref\\\"),\\n \\\"center\\\": el_center(egress),\\n }\\n for (egress_id, egress) in (\\n (egress_id, city.elements[egress_id])\\n for egress_id in stoparea.entrances\\n | stoparea.exits\\n )\\n ],\\n }\\n data[\\\"stopareas\\\"][stoparea.id] = stoparea_data\\n\\n route_data[\\\"itineraries\\\"].append(variant_data)\\n\\n network[\\\"routes\\\"].append(route_data)\\n\\n data[\\\"networks\\\"][city.name] = network\\n\\n # transfers\\n pairwise_transfers = set()\\n for stoparea_set in transfers:\\n stoparea_list = list(stoparea_set)\\n for first_i in range(len(stoparea_list) - 1):\\n for second_i in range(first_i + 1, len(stoparea_list)):\\n stoparea1_id = stoparea_list[first_i].id\\n stoparea2_id = stoparea_list[second_i].id\\n if all(\\n st_id in data[\\\"stopareas\\\"]\\n for st_id in (stoparea1_id, stoparea2_id)\\n ):\\n id1, id2 = sorted([stoparea1_id, stoparea2_id])\\n pairwise_transfers.add((id1, id2))\\n\\n data[\\\"transfers\\\"] = pairwise_transfers\\n return data\",\n \"def get_a_routes_closest_stop_and_arrival_time(request, lat, lon, bus_route, audio_string='from_input'):\\n# 1. Clean the data.\\n clean_data = clean_route_data(lat,lon,bus_route)\\n if not clean_data:\\n return JsonResponse({'status': 'bad', 'error': 'not clean data. determined invalid route query', 'query': bus_route})\\n\\n bus_id = clean_data['bus_id']\\n bus_route = clean_data['bus_route']\\n user_lat = clean_data['user_lat']\\n user_lon = clean_data['user_lon']\\n \\n# 2. Find closest stops.\\n closest_stops = find_closest_stops(user_lat,user_lon,bus_id)\\n\\n if not closest_stops: # zero stops\\n return JsonResponse({'status': 'bad', 'error': 'no stops available nearby', 'lat:': user_lat, 'lon:': user_lon, 'query': bus_route})\\n\\n# 3. Finding arrival times for: the specific_bus at the nearest_stops\\n closest_arrival = find_estimated_arrival(closest_stops['closest_stop_id'], bus_id)\\n next_closest_arrival = find_estimated_arrival(closest_stops['next_closest_stop_id'], bus_id)\\n\\n# 4. Check that a valid time was returned from find_estimated_arrival \\n if closest_arrival['estimated'] or next_closest_arrival['estimated']:\\n\\n return JsonResponse({\\n 'status': 'good',\\n 'route': bus_route,\\n 'closest_stop': { \\n 'closest_name': closest_stops['name_of_closest'],\\n 'closest_direction': closest_stops['closest_direction'],\\n 'closest_stop_id': closest_stops['closest_stop_id'],\\n 'closest_minutes': closest_arrival['estimated'],\\n 'closest_lat': closest_stops['closest_stop_lat'],\\n 'closest_lon': closest_stops['closest_stop_lon'],\\n 'closest_destination': closest_arrival['destination']\\n },\\n 'next_closest_stop': {\\n 'next_closest_name': closest_stops['name_of_next_closest'],\\n 'next_closest_direction': closest_stops['next_closest_direction'],\\n 'next_closest_stop_id': closest_stops['next_closest_stop_id'],\\n 'next_closest_minutes': next_closest_arrival['estimated'],\\n 'next_closest_lat': closest_stops['next_closest_stop_lat'],\\n 'next_closest_lon': closest_stops['next_closest_stop_lon'],\\n 'next_closest_destination': next_closest_arrival['destination']\\n },\\n 'testing': audio_string,\\n })\\n \\n return JsonResponse({'status': 'bad', 'error': 'no arrival time', 'closest_stop': {'id': closest_stops['closest_stop_id'], 'estimated_arrival': closest_arrival['estimated']}, 'next_closest_stop':{'id': closest_stops['next_closest_stop_id'], 'estimated_arrival': next_closest_arrival['estimated']}})\",\n \"def possible_routes(srcLat, srcLon, destLat, destLon, searchPreference, dateTime):\\n\\n dateTime = dateTime.split(\\\",\\\")\\n\\n routes = Db().get_best_route(srcLat, srcLon, destLat, destLon)\\n try:\\n best_routes = get_three_best_routes(routes, searchPreference, dateTime)\\n except IndexError:\\n best_routes = \\\"No Journey Found\\\"\\n\\n # Get the address for map display purposes\\n try:\\n for i in range(len(best_routes)):\\n #address is a dataframe, hency the use of .loc\\n address = Db().get_single_address(best_routes[i][2]).loc[0,\\\"Address\\\"]\\n best_routes[i].append(address)\\n except IndexError:\\n # In case the source is outside Dublin\\n best_routes = \\\"No Journey Found\\\"\\n\\n return json.dumps(best_routes, ensure_ascii=False)\",\n \"def _build_routes(self, routes, allow_redundant_targets=True):\\n routes = routes or ()\\n joins = {}\\n targets_seen = set()\\n\\n for route in routes:\\n if isinstance(route, dict):\\n source_label = route.get('source')\\n target_label = route.get('target')\\n field_label = route.get('field')\\n symmetrical = route.get('symmetrical')\\n else:\\n warnings.warn('Routes are now defined as dicts',\\n DeprecationWarning)\\n source_label, target_label, field_label, symmetrical = route\\n\\n # get models\\n source = self.get_model(source_label, local=False)\\n target = self.get_model(target_label, local=False)\\n\\n field = None\\n\\n # get field\\n if field_label:\\n model_name, field_name = field_label.split('.', 1)\\n model_name = model_name.lower()\\n\\n # determine which model the join field specified exists on\\n if model_name == source.__name__.lower():\\n field = self.get_field(field_name, source)\\n elif model_name == target.__name__.lower():\\n field = self.get_field(field_name, target)\\n else:\\n raise TypeError('model for join field, \\\"{0}\\\", '\\n 'does not exist'.format(field_name))\\n\\n if isinstance(field, RelatedObject):\\n field = field.field\\n\\n if not allow_redundant_targets:\\n if target in targets_seen:\\n raise ValueError('Model {0} cannot be the target of '\\n 'more than one route in this list'\\n .format(target_label))\\n else:\\n targets_seen.add(target)\\n\\n # The `joins` hash defines pairs which are explicitly joined\\n # via the specified field. If no field is defined, then the\\n # join field is implied or does not matter; the route is reduced\\n # to a straight lookup.\\n joins[(source, target)] = field\\n\\n if symmetrical:\\n if not allow_redundant_targets:\\n if source in targets_seen:\\n raise ValueError('Model {0} cannot be the target of '\\n 'more than one route in this list'\\n .format(source_label))\\n else:\\n targets_seen.add(source)\\n\\n joins[(target, source)] = field\\n\\n return joins\",\n \"def find_routes(\\r\\n stops,\\r\\n measurement_units = \\\"\\\"\\\"Minutes\\\"\\\"\\\",\\r\\n analysis_region = None,\\r\\n reorder_stops_to_find_optimal_routes = False,\\r\\n preserve_terminal_stops = \\\"\\\"\\\"Preserve First\\\"\\\"\\\",\\r\\n return_to_start = False,\\r\\n use_time_windows = False,\\r\\n time_of_day = None,\\r\\n time_zone_for_time_of_day = \\\"\\\"\\\"Geographically Local\\\"\\\"\\\",\\r\\n uturn_at_junctions = \\\"\\\"\\\"Allowed Only at Intersections and Dead Ends\\\"\\\"\\\",\\r\\n point_barriers = None,\\r\\n line_barriers = None,\\r\\n polygon_barriers = None,\\r\\n use_hierarchy = True,\\r\\n restrictions = None,\\r\\n attribute_parameter_values = None,\\r\\n route_shape = \\\"\\\"\\\"True Shape\\\"\\\"\\\",\\r\\n route_line_simplification_tolerance = None,\\r\\n populate_route_edges = False,\\r\\n populate_directions = True,\\r\\n directions_language = \\\"\\\"\\\"en\\\"\\\"\\\",\\r\\n directions_distance_units = \\\"\\\"\\\"Miles\\\"\\\"\\\",\\r\\n directions_style_name = \\\"\\\"\\\"NA Desktop\\\"\\\"\\\",\\r\\n travel_mode = \\\"\\\"\\\"Custom\\\"\\\"\\\",\\r\\n impedance = \\\"\\\"\\\"Drive Time\\\"\\\"\\\",\\r\\n gis = None):\\r\\n kwargs = locals()\\r\\n\\r\\n if stops is None:\\r\\n stops = default_stops\\r\\n\\r\\n if point_barriers is None:\\r\\n point_barriers = default_point_barriers\\r\\n\\r\\n if line_barriers is None:\\r\\n line_barriers = default_line_barriers\\r\\n\\r\\n if polygon_barriers is None:\\r\\n polygon_barriers = default_polygon_barriers\\r\\n\\r\\n if restrictions is None:\\r\\n restrictions = default_restrictions\\r\\n\\r\\n if attribute_parameter_values is None:\\r\\n attribute_parameter_values = default_attributes\\r\\n\\r\\n if route_line_simplification_tolerance is None:\\r\\n route_line_simplification_tolerance = default_tolerance\\r\\n\\r\\n param_db = {\\r\\n \\\"stops\\\": (FeatureSet, \\\"Stops\\\"),\\r\\n \\\"measurement_units\\\": (str, \\\"Measurement_Units\\\"),\\r\\n \\\"analysis_region\\\": (str, \\\"Analysis_Region\\\"),\\r\\n \\\"reorder_stops_to_find_optimal_routes\\\": (bool, \\\"Reorder_Stops_to_Find_Optimal_Routes\\\"),\\r\\n \\\"preserve_terminal_stops\\\": (str, \\\"Preserve_Terminal_Stops\\\"),\\r\\n \\\"return_to_start\\\": (bool, \\\"Return_to_Start\\\"),\\r\\n \\\"use_time_windows\\\": (bool, \\\"Use_Time_Windows\\\"),\\r\\n \\\"time_of_day\\\": (datetime, \\\"Time_of_Day\\\"),\\r\\n \\\"time_zone_for_time_of_day\\\": (str, \\\"Time_Zone_for_Time_of_Day\\\"),\\r\\n \\\"uturn_at_junctions\\\": (str, \\\"UTurn_at_Junctions\\\"),\\r\\n \\\"point_barriers\\\": (FeatureSet, \\\"Point_Barriers\\\"),\\r\\n \\\"line_barriers\\\": (FeatureSet, \\\"Line_Barriers\\\"),\\r\\n \\\"polygon_barriers\\\": (FeatureSet, \\\"Polygon_Barriers\\\"),\\r\\n \\\"use_hierarchy\\\": (bool, \\\"Use_Hierarchy\\\"),\\r\\n \\\"restrictions\\\": (str, \\\"Restrictions\\\"),\\r\\n \\\"attribute_parameter_values\\\": (FeatureSet, \\\"Attribute_Parameter_Values\\\"),\\r\\n \\\"route_shape\\\": (str, \\\"Route_Shape\\\"),\\r\\n \\\"route_line_simplification_tolerance\\\": (LinearUnit, \\\"Route_Line_Simplification_Tolerance\\\"),\\r\\n \\\"populate_route_edges\\\": (bool, \\\"Populate_Route_Edges\\\"),\\r\\n \\\"populate_directions\\\": (bool, \\\"Populate_Directions\\\"),\\r\\n \\\"directions_language\\\": (str, \\\"Directions_Language\\\"),\\r\\n \\\"directions_distance_units\\\": (str, \\\"Directions_Distance_Units\\\"),\\r\\n \\\"directions_style_name\\\": (str, \\\"Directions_Style_Name\\\"),\\r\\n \\\"travel_mode\\\": (str, \\\"Travel_Mode\\\"),\\r\\n \\\"impedance\\\": (str, \\\"Impedance\\\"),\\r\\n \\\"solve_succeeded\\\": (bool, \\\"Solve Succeeded\\\"),\\r\\n \\\"output_routes\\\": (FeatureSet, \\\"Output Routes\\\"),\\r\\n \\\"output_route_edges\\\": (FeatureSet, \\\"Output Route Edges\\\"),\\r\\n \\\"output_directions\\\": (FeatureSet, \\\"Output Directions\\\"),\\r\\n \\\"output_stops\\\": (FeatureSet, \\\"Output Stops\\\"),\\r\\n }\\r\\n return_values = [\\r\\n {\\\"name\\\": \\\"solve_succeeded\\\", \\\"display_name\\\": \\\"Solve Succeeded\\\", \\\"type\\\": bool},\\r\\n {\\\"name\\\": \\\"output_routes\\\", \\\"display_name\\\": \\\"Output Routes\\\", \\\"type\\\": FeatureSet},\\r\\n {\\\"name\\\": \\\"output_route_edges\\\", \\\"display_name\\\": \\\"Output Route Edges\\\", \\\"type\\\": FeatureSet},\\r\\n {\\\"name\\\": \\\"output_directions\\\", \\\"display_name\\\": \\\"Output Directions\\\", \\\"type\\\": FeatureSet},\\r\\n {\\\"name\\\": \\\"output_stops\\\", \\\"display_name\\\": \\\"Output Stops\\\", \\\"type\\\": FeatureSet},\\r\\n ]\\r\\n\\r\\n if gis is None:\\r\\n gis = arcgis.env.active_gis\\r\\n\\r\\n url = gis.properties.helperServices.asyncRoute.url\\r\\n return _execute_gp_tool(gis, \\\"FindRoutes\\\", kwargs, param_db, return_values, _use_async, url)\",\n \"def import_data(self):\\n\\n # Import ordered names of origins\\n origins_file = os.path.join(self.data_directory,'origins.txt')\\n self.origins = np.loadtxt(origins_file,dtype=str,ndmin=1)\\n\\n # Import ordered names of destinations\\n destinations_file = os.path.join(self.data_directory,'destinations.txt')\\n self.destinations = np.loadtxt(destinations_file,dtype=str,ndmin=1)\\n\\n # Import origin supply\\n originsupply_file = os.path.join(self.data_directory,'origin_supply.txt')\\n self.origin_supply = np.loadtxt(originsupply_file,ndmin=1).astype('float64')\\n\\n # In case origin supply is not a list\\n if not isinstance(self.origin_supply,(np.ndarray, np.generic)):\\n self.origin_supply = np.array([self.origin_supply])\\n\\n # Import destination demand\\n destinationdemand_file = os.path.join(self.data_directory,'destination_demand.txt')\\n self.destination_demand = np.loadtxt(destinationdemand_file,ndmin=1).astype('float64')\\n\\n # In case destination demand is not a list\\n if not isinstance(self.destination_demand,(np.ndarray, np.generic)):\\n self.destination_demand = np.array([self.destination_demand])\\n\\n # Import origin locations\\n originlocations_file = os.path.join(self.data_directory,'origin_locations.txt')\\n self.origin_locations = np.loadtxt(originlocations_file,ndmin=1)\\n\\n # Import destination locations\\n destinationlocations_file = os.path.join(self.data_directory,'destination_locations.txt')\\n self.destination_locations = np.loadtxt(destinationlocations_file,ndmin=1)\\n\\n # Import initial and final destination sizes\\n initialdestinationsizes_file = os.path.join(self.data_directory,'initial_destination_sizes.txt')\\n self.initial_destination_sizes = np.loadtxt(initialdestinationsizes_file,ndmin=1)\\n\\n # In case destination sizes are not a list\\n if not isinstance(self.initial_destination_sizes,(np.ndarray, np.generic)):\\n self.initial_destination_sizes = np.array([self.initial_destination_sizes])\\n\\n # Import N,M\\n self.N = self.origin_supply.shape[0]\\n self.M = self.initial_destination_sizes.shape[0]\\n\\n # Import cost matrix\\n costmatrix_file = os.path.join(self.data_directory,'cost_matrix.txt')\\n self.cost_matrix = np.loadtxt(costmatrix_file).astype('float64')\\n\\n # Reshape cost matrix if necessary\\n if self.N == 1:\\n self.cost_matrix = np.reshape(self.cost_matrix[:,np.newaxis],(self.N,self.M))\\n if self.M == 1:\\n self.cost_matrix = np.reshape(self.cost_matrix[np.newaxis,:],(self.N,self.M))\\n\\n # Compute total initial and final destination sizes\\n self.total_initial_sizes = np.sum(self.initial_destination_sizes)\\n\\n # Compute naive total cost\\n self.total_cost = 0\\n for i in range(self.N):\\n for j in range(self.M):\\n self.total_cost += self.cost_matrix[i,j]*(self.origin_supply[i]/self.N)\",\n \"def stops_on_routes_with_direction():\\n routes_and_stops = {}\\n routes = ['102y', '102z', '104y', '104z', '111y', '111z', '114y', '114z', '116y', '116z', '118y', '11y', '11z', '120y', '120z', '122y', '122z', '123y', '123z', '130y', '130z', '13y', '13z', '140y', '140z', '142y', '142z', '145y', '145z', '14Cy', '14Cz', '14y', '14z', '150y', '150z', '151y', '151z', '15Ay', '15Az', '15By', '15Bz', '15y', '15z', '161y', '161z', '16Cy', '16Cz', '16y', '16z', '17Ay', '17Az', '17y', '17z', '184y', '184z', '185y', '185z', '18y', '18z', '1y', '1z', '220y', '220z', '236y', '236z', '238y', '238z', '239y', '239z', '25Ay', '25Az', '25By', '25Bz', '25Xy', '25Xz', '25y', '25z', '26y', '26z', '270y', '270z', '27Ay', '27Az', '27By', '27Bz', '27Xy', '27Xz', '27y', '27z', '29Ay', '29Az', '31Ay', '31Az', '31By', '31Bz', '31y', '31z', '32Ay', '32Az', '32By', '32Bz', '32Xy', '32Xz', '32y', '32z', '33Ay', '33Az', '33By', '33Bz', '33Xy', '33Xz', '33y', '33z', '37y', '37z', '38Ay', '38Az', '38By', '38Bz', '38y', '38z', '39Ay', '39Az', '39y', '39z', '40By', '40Bz', '40Dy', '40Dz', '40y', '40z', '41Ay', '41By', '41Bz', '41Cy', '41Cz', '41Xy', '41Xz', '41y', '41z', '42y', '42z', '43y', '43z', '44By', '44Bz', '44y', '44z', '45Ay', '45Az', '46Ay', '46Az', '46Ey', '47y', '47z', '49y', '49z', '4y', '4z', '51Dy', '51Dz', '51Xy', '53By', '53Bz', '53y', '53z', '54Ay', '54Az', '56Ay', '56Az', '59y', '59z', '61y', '61z', '63y', '63z', '65By', '65Bz', '65y', '65z', '66Ay', '66Az', '66By', '66Bz', '66Xy', '66Xz', '66y', '66z', '67Xy', '67Xz', '67y', '67z', '68Ay', '68Az', '68y', '68z', '69Xy', '69Xz', '69y', '69z', '70y', '70z', '747y', '747z', '75y', '75z', '76Ay', '76Az', '76y', '76z', '77Ay', '77Az', '79Ay', '79Az', '79y', '79z', '7By', '7Bz', '7Dy', '7Dz', '7y', '7z', '83Ay', '83Az', '83y', '83z', '84Ay', '84Az', '84Xy', '84Xz', '84y', '84z', '8y', '8z', '9y', '9z']\\n for route in routes:\\n routes_and_stops[route] = [] # new array value for each route key\\n reader = csv.reader(open(\\\"../Data/Sorted Data/stopped_bus_data.csv\\\"))\\n for line in reader:\\n try:\\n current_route = extract_route_and_direction(line[3])\\n if int(line[13]) not in routes_and_stops[current_route]:\\n routes_and_stops[current_route].append(int(line[13]))\\n except:\\n continue\\n return routes_and_stops\",\n \"def _add_unique_id_fields(self):\\r\\n field_types = {\\\"String\\\": \\\"TEXT\\\", \\\"Single\\\": \\\"FLOAT\\\", \\\"Double\\\": \\\"DOUBLE\\\", \\\"SmallInteger\\\": \\\"SHORT\\\",\\r\\n \\\"Integer\\\": \\\"LONG\\\", \\\"OID\\\": \\\"LONG\\\"}\\r\\n origin_field_def = [self.origin_unique_id_field_name, field_types[self.origin_id_field_obj.type]]\\r\\n if self.origin_id_field_obj.type == \\\"String\\\":\\r\\n origin_field_def += [self.origin_unique_id_field_name, self.origin_id_field_obj.length]\\r\\n dest_field_def = [self.dest_unique_id_field_name, field_types[self.dest_id_field_obj.type]]\\r\\n if self.dest_id_field_obj.type == \\\"String\\\":\\r\\n dest_field_def += [self.dest_unique_id_field_name, self.dest_id_field_obj.length]\\r\\n self.rt_solver.addFields(arcpy.nax.RouteInputDataType.Stops, [origin_field_def, dest_field_def])\",\n \"def findRoute(self, source:str, target:str, option:str = None, startTime:str = None) -> []:\\n \\n if (source not in self.stationInterchanges or target not in self.stationInterchanges):\\n print(\\\"Invalid inputs\\\")\\n return []\\n\\n if not option:\\n option = 'shortest'\\n\\n # You can have multiple sources and destinations because the station can be an \\n # interchange where you have multiple lines to chose from. \\n sources = self.stationInterchanges[source]\\n dests = self.stationInterchanges[target]\\n\\n route = []\\n if option == 'shortest':\\n route = self.__findRouteShortestPath(sources, dests)\\n elif option == 'fastest':\\n if not startTime or len(startTime) == 0:\\n startTime = StationMap.dateUtils.getTodaysDate()\\n route = self.__scheduleRoute(sources, dests, startTime)\\n else:\\n print('Invalid option: {0}'.format(option))\\n return []\\n return route\",\n \"def __init__( # pylint: disable=too-many-locals, too-many-arguments\\r\\n self, pair_type_str, origins, origin_id_field, destinations, dest_id_field,\\r\\n network_data_source, travel_mode, time_units, distance_units,\\r\\n max_routes, max_processes, out_routes, scratch_folder, reverse_direction=False,\\r\\n assigned_dest_field=None, od_pair_table=None, time_of_day=None, barriers=None\\r\\n ):\\r\\n pair_type = helpers.PreassignedODPairType[pair_type_str]\\r\\n self.origins = origins\\r\\n self.destinations = destinations\\r\\n self.out_routes = out_routes\\r\\n self.scratch_folder = scratch_folder\\r\\n time_units = helpers.convert_time_units_str_to_enum(time_units)\\r\\n distance_units = helpers.convert_distance_units_str_to_enum(distance_units)\\r\\n if not barriers:\\r\\n barriers = []\\r\\n self.max_processes = max_processes\\r\\n if not time_of_day:\\r\\n time_of_day = None\\r\\n else:\\r\\n time_of_day = datetime.datetime.strptime(time_of_day, helpers.DATETIME_FORMAT)\\r\\n\\r\\n # Initialize the dictionary of inputs to send to each OD solve\\r\\n self.rt_inputs = {\\r\\n \\\"pair_type\\\": pair_type,\\r\\n \\\"origins\\\": self.origins,\\r\\n \\\"origin_id_field\\\": origin_id_field,\\r\\n \\\"destinations\\\": self.destinations,\\r\\n \\\"dest_id_field\\\": dest_id_field,\\r\\n \\\"network_data_source\\\": network_data_source,\\r\\n \\\"travel_mode\\\": travel_mode,\\r\\n \\\"time_units\\\": time_units,\\r\\n \\\"distance_units\\\": distance_units,\\r\\n \\\"time_of_day\\\": time_of_day,\\r\\n \\\"reverse_direction\\\": reverse_direction,\\r\\n \\\"scratch_folder\\\": self.scratch_folder,\\r\\n \\\"assigned_dest_field\\\": assigned_dest_field,\\r\\n \\\"od_pair_table\\\": od_pair_table,\\r\\n \\\"barriers\\\": barriers,\\r\\n \\\"origin_transfer_fields\\\": [], # Populate later\\r\\n \\\"destination_transfer_fields\\\": [] # Populate later\\r\\n }\\r\\n\\r\\n # List of intermediate output OD Line files created by each process\\r\\n self.route_fcs = []\\r\\n\\r\\n # Construct OID ranges for chunks of origins and destinations\\r\\n if pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n # Chunks are of the format [first origin ID, second origin ID]\\r\\n self.chunks = helpers.get_oid_ranges_for_input(origins, max_routes)\\r\\n elif pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n # Chunks are of the format [chunk_num, chunk_size]\\r\\n num_od_pairs = 0\\r\\n with open(od_pair_table, \\\"r\\\", encoding=\\\"utf-8\\\") as f:\\r\\n for _ in f:\\r\\n num_od_pairs += 1\\r\\n num_chunks = ceil(num_od_pairs / max_routes)\\r\\n self.chunks = [[i, max_routes] for i in range(num_chunks)]\\r\\n\\r\\n # Calculate the total number of jobs to use in logging\\r\\n self.total_jobs = len(self.chunks)\\r\\n\\r\\n self.optimized_cost_field = None\",\n \"def bus_routes_direction():\\n route_list = []\\n os.chdir(\\\"../Data\\\")\\n for file in glob.glob(\\\"*.csv\\\"):\\n print(file) #useful for monitoring progress of function\\n reader = csv.reader(open(file))\\n for line in reader:\\n route = extract_route_and_direction(line[3]) # Journey ID field\\n if route not in route_list and route != \\\"\\\": # error handling for extract_bus_routes function\\n route_list.append(route)\\n return route_list\",\n \"def validate(self, params, address_input_data):\\n processed_address_list = []\\n # check avoids redundancy for combined 'forward geocode and validate' \\n # option as API does both by default\\n if self.__is_address_list_processed:\\n processed_address_list = address_input_data\\n else:\\n request_list = self.__prepare_smarty_request_list(address_input_data)\\n processed_address_list = self.__process_smarty_request_list(request_list,\\n address_input_data )\\n self.__is_address_list_processed = True\\n print(f'< {self.num_addresses_processed} addresses processed >')\\n return processed_address_list\",\n \"def check_if_repeated_route(route, user_lat, user_lon):\\n bus_route = route\\n repeated_routes = {'101':'','105':'','106':'','107':'','230':'','111':'','113':'','116':'','119':'','240':'','120':'','271':'','70':'','2':'pt','7':'','8':'','18':'','29':'','1':'pt','3':'pt','4':'pt','402':'pt','425':'pt','202':'pt','212':'pt','214':'pt','102':'pt','10':'pt','11':'pt','13':'','28':'pt','41':'','45':'','55':'pt','57':'pt','63':'pt','47':'','48':'','60':'','64':'','67':'','42':'','12':'','21':''}\\n intercity_transit = ['47','48','60','64','67','42','12','13','21','41','45']\\n king_county_metro = ['917', 'A Line', '225', '231', '239', '230', '250', '37', '910', '628', '372', '373', '630', '218', '631', '63', '4', '36', '43', '986', '823', '44', '987', '212', '45', '988', 'Trailhead Direct Issaquah Alps', '989', '824', '214', '47', '180', '48', '635', '216', '5', '217', '982', '41', '21', '984', 'F Line', 'E Line', '342', '345', '346', '952', '347', '894', '348', '49', '248', '355', '895', '116', '243', '245', '893', '118', '246', '661', '931', '119', '67', '915', '12', '249', '120', '238', '62', '226', '111', '24', '64', '193', '113', '240', '65', '930', '241', '114', '255', '73', '128', '74', '257', '75', '13', '907', '121', '122', '7', '123', '252', '70', '124', '71', '125', '221', '244', 'Trailhead Direct Cougar Mt.', '55', '994', '50', '995', 'Trailhead Direct Mailbox Peak', '219', '981', 'Trailhead Direct Mt. Si', '22', '224', '157', '204', '101', '232', '102', '105', '57', '106', '234', '156', '107', '235', '236', '60', '980', '237', 'B Line', '11', '775', '56', '1', '10', '166', '167', '903', '158', '908', '159', '3', '906', '301', '913', '914', '303', '164', '304', '916', '901', '178', '169', '308', '17', '309', '31', '311', '312', '177', '168', '629', 'Duvall-Monroe Shuttle', '268', '14', '76', '77', '131', '26', '773', '29', '132', '78', '40', '8', '887', 'C Line', '277', '9', '153', '28', '154', '269', 'D Line', '27', '143', '271', '886', '148', '888', '889', '15', '150', '891', '892', '208', '200', '181', '32', '182', '33', '183', '330', '331', '186', '187', '316', '179', '18', '192', '197', '2', '19', '190']\\n pierce_transit = ['1','2','3','4','402','425','202','212','214','102','10','11','13','28','41','45','48','55','57','63']\\n north_routes = ['101','105','106','107','230','111','113','116','119','240','120','271','70','2','3','4','7','8','12','18','29']\\n \\n if bus_route in repeated_routes:\\n if user_lon < -122.5 and user_lat > 47.1:\\n # going to be pierce county (or kitsap)\\n if bus_route in pierce_transit: \\n bus_route += 'pt'\\n else:\\n bus_route += repeated_routes[bus_route]\\n elif user_lat > 47.7:\\n # going to be community transit or everett transit (N)\\n if bus_route in north_routes: \\n bus_route += 'N'\\n else:\\n bus_route += repeated_routes[bus_route] \\n elif user_lat > 47.33:\\n # going to be king county metro\\n if bus_route in king_county_metro:\\n bus_route = bus_route\\n else:\\n bus_route += repeated_routes[bus_route]\\n elif user_lat > 47.08:\\n # going to be pierce transit\\n if bus_route in pierce_transit: \\n bus_route += 'pt'\\n else:\\n bus_route += repeated_routes[bus_route] \\n else:\\n # going to be intercity transit\\n if bus_route in intercity_transit: \\n bus_route += 'it'\\n else:\\n bus_route += repeated_routes[bus_route] \\n\\n return bus_route\",\n \"def __init__(__self__, *,\\n destination_region_id: pulumi.Input[str],\\n destination_zone_id: pulumi.Input[str],\\n source_region_id: pulumi.Input[str],\\n source_zone_id: pulumi.Input[str],\\n description: Optional[pulumi.Input[str]] = None,\\n group_name: Optional[pulumi.Input[str]] = None,\\n rpo: Optional[pulumi.Input[int]] = None):\\n pulumi.set(__self__, \\\"destination_region_id\\\", destination_region_id)\\n pulumi.set(__self__, \\\"destination_zone_id\\\", destination_zone_id)\\n pulumi.set(__self__, \\\"source_region_id\\\", source_region_id)\\n pulumi.set(__self__, \\\"source_zone_id\\\", source_zone_id)\\n if description is not None:\\n pulumi.set(__self__, \\\"description\\\", description)\\n if group_name is not None:\\n pulumi.set(__self__, \\\"group_name\\\", group_name)\\n if rpo is not None:\\n pulumi.set(__self__, \\\"rpo\\\", rpo)\",\n \"def validateTradeRoute(self, tradeRouteDict):\\n try:\\n systemFrom = self.systems[tradeRouteDict['fromSystem']]\\n systemTo = self.systems[tradeRouteDict['toSystem']]\\n # has a trade route already been setup between these planets?\\n (sysFrom, sysTo, type) = string.split(tradeRouteDict['id'], '-')\\n # are these systems adjacent, or share a warp gate with a trade pact\\n if systemTo.id in systemFrom.connectedSystems:\\n pass\\n elif systemTo.id in systemFrom.warpGateSystems:\\n tempRoute = anwp.aw.traderoute.TradeRoute(tradeRouteDict)\\n warpReq = tempRoute.getWarpRequired()\\n if warpReq > (systemFrom.usedWGC + systemFrom.availWGC):\\n return 'System:%s Requires %d Warp Capactiy to setup this Trade Route' % (systemFrom.name, warpReq)\\n if warpReq > (systemTo.usedWGC + systemTo.availWGC):\\n return 'System:%s Requires %d Warp Capactiy to setup this Trade Route' % (systemTo.name, warpReq)\\n else:\\n return 'Systems are not adjacent and have no warp gates between them'\\n # do these systems share the same empire owner, or are the two empires in a trade pact?\\n if systemFrom.myEmpireID <> systemTo.myEmpireID and anwp.func.globals.diplomacy[self.empires[systemFrom.myEmpireID].diplomacy[systemTo.myEmpireID].diplomacyID]['trade'] == 0:\\n return 'System Owners are not the same, or no Trade Pact in Effect'\\n # is a negative trade route being sent?\\n if (tradeRouteDict['AL'] < 0 or tradeRouteDict['EC'] < 0 or tradeRouteDict['IA'] < 0):\\n return 'you cannot send negative values in trade'\\n # is something being sent?\\n if (tradeRouteDict['AL'] == 0 and tradeRouteDict['EC'] == 0 and tradeRouteDict['IA'] == 0) and tradeRouteDict['type'] <> 'GEN':\\n return 'no resources are being sent, trade route invalid'\\n # does the system have the resources to setup this trade?\\n if (systemFrom.AL < tradeRouteDict['AL'] or systemFrom.EC < tradeRouteDict['EC'] or\\n systemFrom.IA < tradeRouteDict['IA']):\\n return '%s does not have enough resources to setup this trade route' % systemFrom.name\\n return 1\\n except:\\n return 'galaxy->validateTradeRoute error'\",\n \"def plan_trip():\\n origins = []\\n destinations = []\\n\\n origin_stop = request.args.get('origin', False)\\n destination_stop = request.args.get('destination', False)\\n origin_is_suburb = request.args.get('origin_suburb', False)\\n dest_is_suburb = request.args.get('dest_suburb', False)\\n origin_is_suburb = bool(origin_is_suburb)\\n dest_is_suburb = bool(dest_is_suburb)\\n if origin_stop and destination_stop:\\n client = api.connection()\\n origins = client.find_stops_by_name('any', origin_stop, True)\\n\\n if client.error == 404:\\n render_template(\\n \\\"trip-planner.jinja2\\\", origins=[], destinations=[], err=404\\n )\\n\\n destinations = client.find_stops_by_name('any', destination_stop, True)\\n if client.error == 404:\\n render_template(\\n \\\"trip-planner.jinja2\\\", origins=[], destinations=[], err=404\\n )\\n\\n origins = stop_information_generator(\\n origins.locations, [], origin_stop, origin_is_suburb\\n )\\n destinations = stop_information_generator(\\n destinations.locations, [], destination_stop, dest_is_suburb\\n )\\n\\n return render_template(\\n \\\"trip-planner.jinja2\\\", origins=origins, destinations=destinations, err=200\\n )\",\n \"def compute_waypoints(self, source_loc, destination_loc):\\n start_waypoint = self._map.get_waypoint(\\n source_loc,\\n project_to_road=True,\\n lane_type=carla.LaneType.Driving)\\n end_waypoint = self._map.get_waypoint(\\n destination_loc,\\n project_to_road=True,\\n lane_type=carla.LaneType.Driving)\\n assert start_waypoint and end_waypoint, 'Map could not find waypoints'\\n route = self._grp.trace_route(\\n start_waypoint.transform.location,\\n end_waypoint.transform.location)\\n # TODO(ionel): The planner returns several options in intersections.\\n # We always take the first one, but this is not correct.\\n return deque([to_pylot_transform(waypoint[0].transform)\\n for waypoint in route])\",\n \"def process_vrps(self):\\n self.origins = set()\\n for afi in (\\\"ipv4\\\", \\\"ipv6\\\"):\\n self.info(\\\"Creating prefix-lists for {} address-family\\\"\\n .format(afi))\\n self.covered[afi] = [\\\"seq {seq} permit {prefix} le {maxLength}\\\"\\n .format(seq=seq, **entry)\\n for seq, entry\\n in enumerate(self.vrps.covered(afi))]\\n origins = self.vrps.origins(afi)\\n self.for_origin[afi] = {}\\n for asn in origins:\\n self.for_origin[afi][asn] = [\\\"seq {seq} permit {prefix} le {maxLength}\\\" # noqa: E501\\n .format(seq=seq, **entry)\\n for seq, entry\\n in enumerate(self.vrps.for_origin(asn, afi))] # noqa: E501\\n self.origins.update(origins)\",\n \"def validate(self):\\n super(ReferenceMapping, self).validate()\\n self.check_observatory()\\n self.check_instrument()\\n self.check_filekind()\\n self.check_schema_uri()\\n if \\\"reference_to_dataset\\\" in self.header:\\n parkeys = self.get_required_parkeys()\\n for _reference, dataset in self.reference_to_dataset.items():\\n assert dataset.upper() in parkeys, \\\\\\n \\\"reference_to_dataset dataset keyword not in parkey keywords.\\\"\\n with log.augment_exception(\\\"Invalid mapping:\\\", self.instrument, self.filekind):\\n self.selector.validate_selector(self.tpn_valid_values)\",\n \"def test_directions_handles_more_than_max_waypoints(self):\\n stops = [\\n mommy.make(Stop, trips_year=self.trips_year, lat_lng=coord)\\n for coord in (\\n '43.705639,-72.297404',\\n '43.680288,-72.527876',\\n '43.779934,-72.042908',\\n '43.753303,-72.124643',\\n '43.703049,-72.289567',\\n '43.705639,-72.297404',\\n '44.831956,-71.075664',\\n '44.875039,-71.05471',\\n '43.736252,-72.2519',\\n '43.788074,-72.099655',\\n '44.227489,-71.477737',\\n '43.705639,-72.297404',\\n '43.680288,-72.527876',\\n '43.779934,-72.042908',\\n '43.753303,-72.124643',\\n '43.703049,-72.289567',\\n '43.705639,-72.297404',\\n '44.831956,-71.075664',\\n '44.875039,-71.05471',\\n '43.736252,-72.2519',\\n '43.788074,-72.099655',\\n '44.227489,-71.477737',\\n '43.705639,-72.297404',\\n '44.831956,-71.075664',\\n '43.753303,-72.124643',\\n '43.703049,-72.289567',\\n )\\n ]\\n directions = maps.get_directions(stops)\\n self.assertEqual(len(stops), len(directions.legs) + 1)\\n for i, leg in enumerate(directions.legs):\\n self.assertEqual(leg.start_stop, stops[i])\\n self.assertEqual(leg.end_stop, stops[i + 1])\",\n \"def __init__(__self__, *,\\n arn: Optional[pulumi.Input[str]] = None,\\n description: Optional[pulumi.Input[str]] = None,\\n destination_cidr_block: Optional[pulumi.Input[str]] = None,\\n destination_port_range: Optional[pulumi.Input['TrafficMirrorFilterRuleDestinationPortRangeArgs']] = None,\\n protocol: Optional[pulumi.Input[int]] = None,\\n rule_action: Optional[pulumi.Input[str]] = None,\\n rule_number: Optional[pulumi.Input[int]] = None,\\n source_cidr_block: Optional[pulumi.Input[str]] = None,\\n source_port_range: Optional[pulumi.Input['TrafficMirrorFilterRuleSourcePortRangeArgs']] = None,\\n traffic_direction: Optional[pulumi.Input[str]] = None,\\n traffic_mirror_filter_id: Optional[pulumi.Input[str]] = None):\\n if arn is not None:\\n pulumi.set(__self__, \\\"arn\\\", arn)\\n if description is not None:\\n pulumi.set(__self__, \\\"description\\\", description)\\n if destination_cidr_block is not None:\\n pulumi.set(__self__, \\\"destination_cidr_block\\\", destination_cidr_block)\\n if destination_port_range is not None:\\n pulumi.set(__self__, \\\"destination_port_range\\\", destination_port_range)\\n if protocol is not None:\\n pulumi.set(__self__, \\\"protocol\\\", protocol)\\n if rule_action is not None:\\n pulumi.set(__self__, \\\"rule_action\\\", rule_action)\\n if rule_number is not None:\\n pulumi.set(__self__, \\\"rule_number\\\", rule_number)\\n if source_cidr_block is not None:\\n pulumi.set(__self__, \\\"source_cidr_block\\\", source_cidr_block)\\n if source_port_range is not None:\\n pulumi.set(__self__, \\\"source_port_range\\\", source_port_range)\\n if traffic_direction is not None:\\n pulumi.set(__self__, \\\"traffic_direction\\\", traffic_direction)\\n if traffic_mirror_filter_id is not None:\\n pulumi.set(__self__, \\\"traffic_mirror_filter_id\\\", traffic_mirror_filter_id)\",\n \"def stops_on_routes():\\n routes = ['15', '46A', '14', '41B', '39A', '65', '40D', '11', '31', '27', '67', '79', '42', '66A', '33B', '140', '44', '83A', '27B', '38', '16C', '747', '41C', '39', '25', '239', '43', '70', '13', '150', '145', '77A', '184', '84', '61', '83', '40', '66', '15A', '123', '17A', '16', '14C', '9', '4', '37', '32', '33', '49', '56A', '151', '25A', '45A', '54A', '47', '18', '7', '17', '102', '120', '65B', '41', '122', '29A', '76', '68', '59', '25B', '69', '27A', '66B', '38B', '7D', '75', '15B', '84A', '63', '84X', '33X', '68A', '1', '76A', '7B', '270', '236', '130', '238', '220', '44B', '40B', '26', '32B', '8', '41A', '53', '67X', '104', '32A', '79A', '114', '185', '66X', '31B', '32X', '51X', '51D', '41X', '142', '111', '69X', '27X', '116', '46E', '161', '118', '25X', '38A', '33A', '31A']\\n routes_and_stops={}\\n for route in routes:\\n routes_and_stops[route]=[] #new array value for each route key\\n reader = csv.reader(open(\\\"../Data/Sorted Data/stopped_bus_data.csv\\\"))\\n for line in reader:\\n try:\\n current_route=extract_bus_route(line[3])\\n if int(line[13]) not in routes_and_stops[current_route]:\\n routes_and_stops[current_route].append(int(line[13]))\\n except:\\n continue\\n return routes_and_stops\",\n \"def _validate_route_settings(self):\\r\\n # Create a dummy Route object and set properties. This allows us to\\r\\n # detect any errors prior to spinning up a bunch of parallel processes and having them all fail.\\r\\n LOGGER.debug(\\\"Validating Route settings...\\\")\\r\\n rt = None\\r\\n try:\\r\\n rt = Route(**self.rt_inputs)\\r\\n rt.initialize_rt_solver()\\r\\n LOGGER.debug(\\\"Route settings successfully validated.\\\")\\r\\n except Exception:\\r\\n LOGGER.error(\\\"Error initializing Route analysis.\\\")\\r\\n errs = traceback.format_exc().splitlines()\\r\\n for err in errs:\\r\\n LOGGER.error(err)\\r\\n raise\\r\\n finally:\\r\\n if rt:\\r\\n LOGGER.debug(\\\"Deleting temporary test Route job folder...\\\")\\r\\n # Close logging\\r\\n rt.teardown_logger()\\r\\n # Delete output folder\\r\\n shutil.rmtree(rt.job_result[\\\"jobFolder\\\"], ignore_errors=True)\\r\\n del rt\",\n \"def FindAllRoutesRec(ConnectionInfo, EndStation, RouteConditions, TimeTableList, TimeTableIndex, StationHourIndex, PathInfo=[]):\\r\\n PathInfo = PathInfo + [ConnectionInfo]\\r\\n\\r\\n if Cond.IfTestRouteSearch:\\r\\n \\tStations = GetAllStationsOfRoute(PathInfo)\\r\\n \\tprint \\\"\\\\nStations of Path (%s): ++++++++\\\" % len(Stations)\\r\\n \\tprint Stations\\r\\n \\tprint \\\"Route Information:\\\"\\r\\n \\tprint PrettyStringRouteInfo(PathInfo)\\r\\n\\r\\n # check successful termination\\r\\n # if len(PathInfo) > 1 and ConnectionInfo[ConnInfoInd['station_to']] == EndStation: \\r\\n if CheckIfPathTerminatesSuccessfully(ConnectionInfo, PathInfo, RouteConditions, EndStation):\\r\\n \\tif Cond.IfTestRouteSearch:\\r\\n \\t\\tprint \\\"End Station is reached!\\\"\\t\\r\\n \\treturn [PathInfo]\\r\\n\\r\\n # current (this iteration's) path length\\r\\n CurPathLen = len(PathInfo)\\r\\n\\r\\n # get next connections\\r\\n start_station = ConnectionInfo[ConnInfoInd['station_to']]\\r\\n departure_hour = ConnectionInfo[ConnInfoInd['arrival_hour']] \\t\\r\\n departure_min = ConnectionInfo[ConnInfoInd['arrival_min']]\\r\\n\\r\\n # TEST BU2019\\r\\n if False:\\r\\n\\t print 'ConnInfoInd: ' + str(ConnectionInfo)\\r\\n\\t print 'start_station,departure_hour,departure_min: %s, %s, %s' % (start_station, departure_hour, departure_min)\\r\\n\\t time.sleep(0.1)\\r\\n \\r\\n # mandatory conditions\\r\\n WaitLimit = RouteConditions[Cond.MaxWaitingTimeAtStation][0]\\r\\n \\r\\n # get next connections from the station\\r\\n ConnectionInfoList = GetListOfNextConnections(TimeTableList, TimeTableIndex, StationHourIndex, start_station, departure_hour, departure_min, WaitLimit)\\r\\n\\r\\n # insert on-foot connections (Zu Fuss, ZF) to nearby stations into ConnectionInfoList\\r\\n # cancel (Tunc 4/3/2019)\\r\\n if False:\\r\\n\\t StationMeasurementTime = ReqStationMeasureTime\\r\\n\\t \\r\\n\\t if Cond.MaxNumberOfSubsequentStationPassagesOnFoot in RouteConditions \\\\\\r\\n\\t \\tand RouteConditions[Cond.MaxNumberOfSubsequentStationPassagesOnFoot][0] > 0:\\r\\n\\r\\n\\t\\t if RouteConditions.has_key(Cond.MeasureStations):\\r\\n\\t\\t \\tStationMeasurementTime = RouteConditions[Cond.MeasureStations][1]\\r\\n\\t\\t Connections = GetOnFootStationChangeConnections(start_station, departure_hour, departure_min, StationMeasurementTime)\\r\\n\\t\\t \\r\\n\\t\\t if Connections:\\t\\t# i.e. if Connections is not None\\r\\n\\t\\t \\t(OnFootConnections1, OnFootConnections2) = Connections \\r\\n\\t\\t \\tConnectionInfoList = AddConnectionsToListAfterDepartureTime(ConnectionInfoList, OnFootConnections1)\\r\\n\\t\\t \\tConnectionInfoList = AddConnectionsToListAfterDepartureTime(ConnectionInfoList, OnFootConnections2)\\r\\n\\r\\n if Cond.IfTestRouteSearch:\\r\\n\\t\\tprint \\\"Next connections:\\\"\\r\\n\\t\\tfor c in ConnectionInfoList:\\r\\n\\t\\t\\tprint c\\r\\n\\t\\ttime.sleep(Cond.TestWaitingTime)\\r\\n\\r\\n if not ConnectionInfoList:\\t\\t# Endstation: Node w/o successor nodes\\r\\n \\treturn []\\r\\n\\r\\n PathInfoList = []\\r\\n\\r\\n for ConnectionInfo in ConnectionInfoList:\\r\\n\\t\\tres = Cond.CheckIfConnectionShouldBeSelected(ConnectionInfo, PathInfo, EndStation, RouteConditions)\\r\\n\\r\\n\\t\\t# test\\r\\n\\t\\tif Cond.IfTestRouteSearch:\\r\\n\\t\\t\\tif res == None or res == False:\\r\\n\\t\\t\\t\\tprint \\\"CheckIfConnectionShouldBeSelected: %s\\\" % res\\r\\n\\r\\n\\t \\tif res == None: return[] \\r\\n\\t \\tif res == False: continue\\r\\n\\r\\n\\t \\t# recursive call\\r\\n\\t\\textended_paths = FindAllRoutesRec(ConnectionInfo, EndStation, RouteConditions, \\\\\\r\\n\\t\\t\\tTimeTableList, TimeTableIndex, StationHourIndex, PathInfo)\\r\\n\\r\\n\\t\\t# report status\\r\\n\\t\\tif Cond.ReportDuringRouteSearch in RouteConditions:\\r\\n\\t\\t\\tTimeIntv = default_timer() - Cond.SearchStartTime\\r\\n\\t\\t\\tRouteSearchReportingIntervalInSeconds = RouteConditions[Cond.ReportDuringRouteSearch][0]\\r\\n\\t\\t\\tif TimeIntv > Cond.RouteSearchReportCounter * RouteSearchReportingIntervalInSeconds:\\r\\n\\t\\t\\t\\tCond.RouteSearchReportCounter += 1 \\r\\n\\t\\t\\t\\tprint \\\"%s seconds passed... \\\" % \\\"{:.2f}\\\".format(TimeIntv)\\r\\n\\t\\t\\t\\tprint \\\"%s routes found so far, that passed all connection selection criteria (before route selection)\\\" \\\\\\r\\n\\t\\t\\t\\t\\t% Cond.RouteCountAfterConnectionSelection\\t\\r\\n\\t\\t\\t\\tprint \\\"%s routes found so far, that passed all route selection criteria (before final route filtering)\\\" \\\\\\r\\n\\t\\t\\t\\t\\t% Cond.RouteCountAfterRouteSelection\\t\\r\\n\\t\\t\\t\\tprint \\\"----------------------\\\"\\t\\r\\n\\r\\n\\t\\t# append to path list\\r\\n\\t\\tfor p in extended_paths:\\r\\n\\t\\t\\t# no need to recheck route unless current connection is the last one \\r\\n\\t\\t\\t# LastConnection = (ConnectionInfo == p[-1])\\r\\n\\t\\t\\tLastConnection = (CurPathLen == len(p) -1 and ConnectionInfo == p[-1])\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif LastConnection:\\r\\n\\r\\n\\t\\t\\t\\tif Cond.CheckIfRouteShouldBeSelected(p, RouteConditions):\\r\\n\\t\\t\\t\\t\\tPathInfoList.append(p)\\r\\n\\t\\t\\t\\t\\tCond.SelectedRoutes.append(ApplyAllRouteInfoCorrections(p))\\r\\n\\r\\n\\t\\t\\t\\t\\t# evaluate route\\r\\n\\t\\t\\t\\t\\t# cancel for BU2019\\r\\n\\r\\n\\t\\t\\t\\t\\tif Cond.IfTestRouteSearch:\\r\\n\\t\\t\\t\\t\\t\\tprint \\\"%s routes found so far, that passed all connection selection criteria (before route selection)\\\" \\\\\\r\\n\\t\\t\\t\\t\\t\\t\\t% Cond.RouteCountAfterConnectionSelection\\r\\n\\t\\t\\t\\t\\t\\tprint \\\"%s routes found so far, that passed all route selection criteria (before final route filtering)\\\\n\\\" \\\\\\r\\n\\t\\t\\t\\t\\t\\t\\t% Cond.RouteCountAfterRouteSelection\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tprint \\\"----------------------\\\"\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t# test\\r\\n\\t\\t\\t\\t\\tIncrementDicValue(Cond.RouteCountPerRouteLength, CurPathLen)\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\t# not last connection, no need to recheck the route\\r\\n\\t\\t\\t\\t# PathInfoList.append(p)\\r\\n\\t\\t\\t\\t# IncrementDicValue(SelectedRoutesPerLevel, CurPathLen)\\r\\n\\t\\t\\t\\tpass\\r\\n \\r\\n return PathInfoList\",\n \"def lookup_routes(self, daddr):\\n outroutes = []\\n for entry in self.routes:\\n # split netmask and daddr by the IP dots\\n netmask_split = entry[NMSK].split('.')\\n daddr_split = daddr.split('.')\\n\\n # bitwise ANd the netmask with the daddr\\n result = []\\n for i in range(0, len(netmask_split)):\\n result.append(str(int(netmask_split[i]) & int(daddr_split[i])))\\n \\n # compare ANDed result to the network\\n is_valid = True\\n network_split = entry[NTWK].split('.')\\n for i in range(0, len(network_split)):\\n if result[i] != network_split[i]:\\n is_valid = False\\n break\\n if is_valid:\\n outroutes.append(entry)\\n\\n if len(outroutes) == 0:\\n return outroutes\\n\\n # reform IP address\\n outroutes.sort(key=lambda r: int(r[NMSK].replace('.', '')), reverse=True)\\n longest_matching_prefix = int(outroutes[0][NMSK].replace('.', ''))\\n outroutes = list(filter(lambda r: int(r[NMSK].replace('.', '')) == longest_matching_prefix, outroutes))\\n return outroutes\",\n \"def f_check_adr_parameters_correctness(dict):\\n\\n if int(dict[\\\"operation_mode_num\\\"]) not in (0, 1, 2, 3, 4, 5, 6):\\n print('\\\\n Error!!! Operation mode is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"FFT_size_samples\\\"]) not in (2048, 4096, 8192, 16384, 32768):\\n print('\\\\n Error!!! FFT size is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"spectra_averaging\\\"]) < 16 or int(dict[\\\"spectra_averaging\\\"]) > 32768:\\n print('\\\\n Error!!! Spectra averaging number is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"start_line_freq\\\"]) not in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16): # 0 … (SFFT-1024)/1024\\n print('\\\\n Error!!! Start frequency line is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"width_line_freq\\\"]) not in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16):\\n print('\\\\n Error!!! Frequency width line is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"width_line_freq\\\"]) > ((int(dict[\\\"FFT_size_samples\\\"]) - int(dict[\\\"start_line_freq\\\"]) * 1024) / 1024): # 1 … (SFFT-SLINE*1024)/1024\\n print('\\\\n Error!!! Frequency width is bigger than FFT size allows!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"clock_source\\\"]) not in (0, 1):\\n print('\\\\n Error!!! Clock source is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"sum_diff_mode_num\\\"]) not in (0, 1):\\n print('\\\\n Error!!! Sum-diff mode is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n if int(dict[\\\"data_file_size\\\"]) < -1 or int(dict[\\\"data_file_size\\\"]) > 4096:\\n print('\\\\n Error!!! File size value is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n\\n '''\\n if (int(dict[\\\"chan_diff_delay\\\"]) < 0 or int(parameters_dict[\\\"chan_diff_dalay\\\"]) > 1024):\\n print('\\\\n Error!!! Channel difference delay is wrong!\\\\n')\\n sys.exit(' Program stopped!')\\n '''\\n\\n # print('\\\\n ADR parameters from file are correct!\\\\n')\\n\\n return dict\",\n \"def lookup_routes(self, daddr):\\n outroutes = []\\n for entry in self.routes:\\n for varat in entry[\\\"varats\\\"]:\\n ip = varat[\\\"network\\\"].split(\\\".\\\")\\n netmask = varat[\\\"netmask\\\"].split(\\\".\\\")\\n\\n mask_bit = \\\"\\\".join([ format(int(quad), \\\"08b\\\") for quad in netmask ])\\n num_ones = mask_bit.count(\\\"1\\\")\\n ip_bin = \\\"\\\".join([ format(int(quad), \\\"08b\\\") for quad in ip ])\\n ip_start = ip_bin[:num_ones]\\n daddr_bin = \\\"\\\".join([ format(int(quad), \\\"08b\\\") for quad in daddr.split(\\\".\\\") ])\\n if daddr_bin.startswith(ip_start):\\n outroutes.append({\\\"peer\\\": entry[\\\"peer\\\"], \\\"us\\\": entry[\\\"us\\\"], \\\"ghoti\\\": num_ones, \\\"msg\\\": varat})\\n\\n #print(\\\"outroutessssssssssssssssssssss\\\", outroutes)\\n return outroutes\",\n \"def __init__(self, **kwargs):\\r\\n self.pair_type = kwargs[\\\"pair_type\\\"]\\r\\n self.origins = kwargs[\\\"origins\\\"]\\r\\n self.origin_id_field = kwargs[\\\"origin_id_field\\\"]\\r\\n self.destinations = kwargs[\\\"destinations\\\"]\\r\\n self.dest_id_field = kwargs[\\\"dest_id_field\\\"]\\r\\n self.network_data_source = kwargs[\\\"network_data_source\\\"]\\r\\n self.travel_mode = kwargs[\\\"travel_mode\\\"]\\r\\n self.time_units = kwargs[\\\"time_units\\\"]\\r\\n self.distance_units = kwargs[\\\"distance_units\\\"]\\r\\n self.time_of_day = kwargs[\\\"time_of_day\\\"]\\r\\n self.reverse_direction = kwargs[\\\"reverse_direction\\\"]\\r\\n self.scratch_folder = kwargs[\\\"scratch_folder\\\"]\\r\\n self.assigned_dest_field = kwargs[\\\"assigned_dest_field\\\"]\\r\\n self.od_pair_table = kwargs[\\\"od_pair_table\\\"]\\r\\n self.origin_transfer_fields = kwargs[\\\"origin_transfer_fields\\\"]\\r\\n self.destination_transfer_fields = kwargs[\\\"destination_transfer_fields\\\"]\\r\\n self.barriers = []\\r\\n if \\\"barriers\\\" in kwargs:\\r\\n self.barriers = kwargs[\\\"barriers\\\"]\\r\\n\\r\\n # Create a job ID and a folder for this job\\r\\n self._create_job_folder()\\r\\n\\r\\n # Setup the class logger. Logs for each parallel process are not written to the console but instead to a\\r\\n # process-specific log file.\\r\\n self.setup_logger(\\\"RoutePairs\\\")\\r\\n\\r\\n # Get field objects for the origin and destination ID fields since we need this in multiple places\\r\\n self.origin_id_field_obj = arcpy.ListFields(self.origins, wild_card=self.origin_id_field)[0]\\r\\n self.dest_id_field_obj = arcpy.ListFields(self.destinations, wild_card=self.dest_id_field)[0]\\r\\n\\r\\n # Set up other instance attributes\\r\\n self.is_service = helpers.is_nds_service(self.network_data_source)\\r\\n self.rt_solver = None\\r\\n self.solve_result = None\\r\\n self.input_origins_layer = \\\"InputOrigins\\\" + self.job_id\\r\\n self.input_destinations_layer = \\\"InputDestinations\\\" + self.job_id\\r\\n self.input_origins_layer_obj = None\\r\\n self.input_dests_layer_obj = None\\r\\n self.origin_unique_id_field_name = \\\"OriginUniqueID\\\"\\r\\n self.dest_unique_id_field_name = \\\"DestinationUniqueID\\\"\\r\\n self.od_pairs = None\\r\\n\\r\\n # Create a network dataset layer if needed\\r\\n if not self.is_service:\\r\\n self._make_nds_layer()\\r\\n\\r\\n # Prepare a dictionary to store info about the analysis results\\r\\n self.job_result = {\\r\\n \\\"jobId\\\": self.job_id,\\r\\n \\\"jobFolder\\\": self.job_folder,\\r\\n \\\"solveSucceeded\\\": False,\\r\\n \\\"solveMessages\\\": \\\"\\\",\\r\\n \\\"outputRoutes\\\": \\\"\\\",\\r\\n \\\"logFile\\\": self.log_file\\r\\n }\",\n \"def _process_departure_fix_list(fix_list, runway, airport, fixes, tagged_routes, top_level=True, altitude=None):\\r\\n if fix_list:\\r\\n try:\\r\\n if top_level:\\r\\n yield fix_list[0]\\r\\n fix_list = fix_list[1:]\\r\\n # climb altitude\\r\\n if fix_list[0].strip().isdigit():\\r\\n if altitude is None:\\r\\n altitude = fix_list[0].strip()\\r\\n fix_list = fix_list[1:]\\r\\n if fix_list[0].startswith('@'):\\r\\n tag = fix_list[0].lstrip('@')\\r\\n if tag.startswith('!') and tag in tagged_routes[None]:\\r\\n tagged_route = tagged_routes[None][tag]\\r\\n elif tag in tagged_routes[runway]:\\r\\n tagged_route = tagged_routes[runway][tag]\\r\\n elif tag in tagged_routes[airport]:\\r\\n tagged_route = tagged_routes[airport][tag]\\r\\n else:\\r\\n raise KeyError(f'''Unable to find route tagged @{tag}.\\r\\ntags for runway {runway}: {tagged_routes[runway]}\\r\\ntags for airport {airport}: {tagged_routes[airport]}''')\\r\\n yield from _process_departure_fix_list(tagged_route,\\r\\n runway, airport, fixes, tagged_routes, top_level=False, altitude=altitude)\\r\\n yield from _process_departure_fix_list(fix_list[1:],\\r\\n runway, airport, fixes, tagged_routes, top_level=False)\\r\\n\\r\\n elif fix_list[-1].startswith('@'):\\r\\n tag = fix_list[-1].lstrip('@')\\r\\n if tag.startswith('!') and tag in tagged_routes[None]:\\r\\n tagged_route = tagged_routes[None][tag]\\r\\n elif tag in tagged_routes[runway]:\\r\\n tagged_route = tagged_routes[runway][tag]\\r\\n elif tag in tagged_routes[airport]:\\r\\n tagged_route = tagged_routes[airport][tag]\\r\\n else:\\r\\n raise KeyError(f'''Unable to find route tagged @{tag}.\\r\\ntags for runway {runway}: {tagged_routes[runway]}\\r\\ntags for airport {airport}: {tagged_routes[airport]}''')\\r\\n yield from _process_departure_fix_list(fix_list[:-1],\\r\\n runway, airport, fixes, tagged_routes, top_level=False, altitude=altitude)\\r\\n yield from _process_departure_fix_list(tagged_route,\\r\\n runway, airport, fixes, tagged_routes, top_level=False)\\r\\n\\r\\n else:\\r\\n if altitude is not None:\\r\\n fix_list = fix_list_with_altitude(fix_list, altitude)\\r\\n yield from process_fix_list(fix_list, fixes)\\r\\n\\r\\n except Exception as e:\\r\\n raise RuntimeError(\\r\\n f\\\"Could not process departure route {fix_list} for runway {runway}\\\"\\r\\n ) from e\",\n \"def traveling_salesman(destinations_1):\\n # Instantiate the data problem.\\n data = create_data_model()\\n\\n # NEW SPOT TO MAKE distance_matrix\\n distance_matrix = compute_euclidean_distance_matrix(destinations_1)\\n manager = pywrapcp.RoutingIndexManager(\\n len(destinations_1), data['num_vehicles'], data['depot'])\\n\\n# # Create the routing index manager.\\n# manager = pywrapcp.RoutingIndexManager(\\n# len(data['locations']), data['num_vehicles'], data['depot'])\\n\\n # Create Routing Model.\\n routing = pywrapcp.RoutingModel(manager)\\n\\n# distance_matrix = compute_euclidean_distance_matrix(data['locations'])\\n\\n def distance_callback(from_index, to_index):\\n \\\"\\\"\\\"Returns the distance between the two nodes.\\\"\\\"\\\"\\n # Convert from routing variable Index to distance matrix NodeIndex.\\n from_node = manager.IndexToNode(from_index)\\n to_node = manager.IndexToNode(to_index)\\n return distance_matrix[from_node][to_node]\\n\\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\\n\\n # Define cost of each arc.\\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\\n\\n # Setting first solution heuristic.\\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\\n search_parameters.first_solution_strategy = (\\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\\n\\n # Solve the problem.\\n assignment = routing.SolveWithParameters(search_parameters)\\n\\n # Print solution on console.\\n# if assignment:\\n# print_solution(manager, routing, assignment)\\n if assignment:\\n address1,address2,address3,address4,address5,address6,address7,address8,address9,address10=\\\\\\n set_address_path(manager, routing, assignment,destinations_1)\\n return address1,address2,address3,address4,address5,address6,address7,address8,address9,address10\",\n \"def _validate_router_tz(self, context, tier0_uuid, subnets):\\n pass\",\n \"def lookup_routes(self, daddr):\\n # TODO\\n outroutes = []\\n\\n net_pre = daddr[0 : daddr.index('.')] + '.0.0.0'\\n\\n #print(self.routes)\\n\\n for ip in self.routes.keys():\\n network = self.routes[ip][NTWK]\\n net_pre_2 = network[0:network.index('.')] + '.0.0.0'\\n if net_pre_2 == net_pre:\\n outroutes.append(ip)\\n return outroutes\",\n \"def count_routes_exact_stops(self, src, dest, num_stops):\\n\\n count = 0\\n criteria = lambda stops, distance: stops <= num_stops # inconsistent max, per test cases\\n for route in self.routes_with_criteria(src, dest, criteria):\\n if num_stops == len(route) - 1:\\n count += 1\\n return count\",\n \"def CheckIfRouteIncludesAllStationsInList(PathInfo, IncludedStations):\\r\\n\\tif not IncludedStations:\\r\\n\\t\\treturn True \\r\\n\\r\\n\\tpath = set(GetAllStationsOfRoute(PathInfo))\\r\\n\\tstations = set(IncludedStations)\\r\\n\\r\\n\\tif path.issuperset(stations):\\r\\n\\t\\treturn True \\r\\n\\telse:\\r\\n\\t\\treturn False\",\n \"def get_origin_routes(self, routes):\\n outroutes = []\\n current_best = \\\"UNK\\\"\\n # iterate through routes in given list updating the current best if a better\\n # option is discovered\\n for route in routes:\\n if route[ORIG] == current_best:\\n outroutes.append(route)\\n elif (route[ORIG] == \\\"EGP\\\" and current_best != \\\"IGP\\\") or route[ORIG] == \\\"IGP\\\":\\n # if the current best is worse than EGP and the current is EGP,\\n # update best and start a new list\\n # if the current best is worse than IGP and the current is IGP,\\n # update best and start a new list\\n current_best = route[ORIG]\\n outroutes = [route]\\n\\n return outroutes\",\n \"def route_info(g, journey):\\n distance = 0\\n cost = 0.00\\n time = 0\\n check = 0\\n \\n for i in range(0, len(journey) - 1):\\n city_name = journey[i]\\n city_next = journey[i + 1]\\n code_city = g.convert[city_name] \\n code_next = g.convert[city_next]\\n \\n for flight in g.city_dict[code_city].get_flights_out():\\n if(flight[0] == code_next):\\n distance = distance + flight[1]\\n time = time + route_info_helper(g, code_city, code_next, flight[1])\\n if(i < 7):\\n cost = cost + (distance * (0.35 - (i * 0.05)))\\n \\n check = check + 1\\n if((check + 1) == len(journey)):\\n return distance, cost, time\\n else:\\n print(\\\"Invalid Route\\\")\\n return 0, 0, 0\",\n \"def test_route(self):\\n\\n params = get_params()\\n estimator = LinearEstimator()\\n problem_builder = ProblemBuilder(params=params, estimator=estimator)\\n model_builder = OptimizationModelBuilder(\\n constraints=[CapacityConstraint()]\\n )\\n router = Router(\\n problem_builder=problem_builder,\\n optimization_model_builder=model_builder\\n )\\n riders = parse_models(model_dicts=test_riders, cls=Rider)\\n vehicles = parse_models(model_dicts=test_vehicles, cls=Vehicle)\\n depots = parse_models(model_dicts=test_depots, cls=Depot)\\n routes = router.route(riders, vehicles, depots)\\n self.assertTrue(routes, msg='Routes could not be built.')\\n\\n for route in routes:\\n self.assertTrue(route['vehicle_id'], msg='Route without vehicle.')\\n self.assertTrue(\\n len(route['stops']) > 1,\\n msg='Route with single stop.'\\n )\",\n \"def validate_incoming_request(route_mapper, request, schema_map, resolver):\\n if schema_map.request_query_schema:\\n # You'll notice we use Draft3 some places and Draft4 in others.\\n # Unfortunately this is just Swagger's inconsistency showing. It\\n # may be nice in the future to do the necessary munging to make\\n # everything Draft4 compatible, although the Swagger UI will\\n # probably never truly support Draft4.\\n request_query_params = dict(\\n (k, cast_request_param(schema_map.request_query_schema, k, v))\\n for k, v\\n in request.params.items()\\n )\\n Draft3Validator(\\n schema_map.request_query_schema,\\n resolver=resolver,\\n types=EXTENDED_TYPES,\\n ).validate(request_query_params)\\n\\n if schema_map.request_path_schema:\\n # We don't have access to this yet but let's go ahead and build the\\n # matchdict so we can validate it.\\n info = route_mapper(request)\\n matchdict = dict(\\n (k, cast_request_param(schema_map.request_path_schema, k, v))\\n for k, v\\n in info.get('match', {}).items()\\n )\\n Draft3Validator(\\n schema_map.request_path_schema,\\n resolver=resolver,\\n types=EXTENDED_TYPES,\\n ).validate(matchdict)\\n\\n # Body validation\\n if schema_map.request_body_schema:\\n body = getattr(request, 'json_body', {})\\n Draft4Validator(\\n schema_map.request_body_schema,\\n resolver=resolver,\\n types=EXTENDED_TYPES,\\n ).validate(body)\",\n \"def test_route_schema_init() -> None:\\n destination = SpecificLocation()\\n rschema = RouteSchema(destination)\\n\\n assert rschema.destination is not None\\n assert rschema.destination._id == destination._id\",\n \"def _validate(self):\\n REQUIRED_KEYS = [ 'name', 'year', 'artist_id', 'genre_ids', 'sources' ]\\n\\n missing_keys = get_missing_keys(self.request.data, REQUIRED_KEYS)\\n if len(missing_keys) > 0:\\n return f\\\"Request body is missing the following required properties: {', '.join(missing_keys)}.\\\"\\n\\n artist_id = self.request.data['artist_id']\\n\\n try:\\n Artist.objects.get(pk=artist_id)\\n except Artist.DoesNotExist:\\n return \\\"`artistId` supplied does not match an existing artist.\\\" \\n\\n genre_ids = self.request.data['genre_ids']\\n if len(genre_ids) == 0:\\n return \\\"You must specify at least one genre id in `genreIds` array.\\\"\\n\\n for genre_id in genre_ids:\\n try:\\n Genre.objects.get(pk=genre_id)\\n except Genre.DoesNotExist:\\n return f\\\"The genre id {genre_id} does not match an existing genre.\\\"\\n\\n sources = self.request.data['sources']\\n if len(sources) == 0:\\n return \\\"You must specify at least one source in `sources` array.\\\"\\n\\n for source in sources:\\n if 'service' not in source or 'url' not in source or 'is_primary' not in source:\\n return \\\"All sources must contain `service`, `url`, and `is_primary` properties.\\\"\\n\\n primary_sources = [ source for source in sources if source['is_primary'] == True ]\\n if len(primary_sources) != 1:\\n return \\\"There must be one and only one primary source.\\\"\\n\\n return False\",\n \"def validate_routes(route):\\n if ROUTE_PATTERN.match(route):\\n if route[0] == route[1]:\\n raise argparse.ArgumentTypeError('Invalid route format, cannot have same city: %s' % route)\\n return route\\n else:\\n raise argparse.ArgumentTypeError('Invalid route format for: %s. Should be {A-Z}{A-Z}{0-9}+' % route)\",\n \"def test_fields(self):\\n expected = (\\n 'id',\\n # Incoming foreign keys from subclasses\\n 'routeredirect', # conman.redirects.models.RouteRedirect\\n 'routesubclass', # tests.models.RouteSubclass\\n 'templateroute', # tests.models.TemplateRoute\\n 'urlconfroute', # tests.models.URLConfRoute\\n 'urlredirect', # conman.redirects.models.URLRedirect\\n 'viewroute', # tests.models.ViewRoute\\n ) + NODE_BASE_FIELDS\\n fields = field_names(Route)\\n self.assertCountEqual(fields, expected)\",\n \"def test_different_routes_from_c_to_c_and_distance_less_than_30(self):\\n railroad = trains.Railroad()\\n routes = railroad.find_routes('C', 'C', 9)\\n routes = railroad.filter_routes_by_distance(routes, 0, 30)\\n self.assertEqual(len(routes), 7)\",\n \"def valid_trip(self):\\n if self.pickupcoords is None or self.dropoffcoords is None:\\n return False\\n valid = lambda x, y: 41 < x < 43.5 and -72.5 < y < - 70.5\\n return valid(self.pickupcoords[0], self.pickupcoords[1]) and valid(self.dropoffcoords[0], self.dropoffcoords[1])\",\n \"def CheckIfRouteExludesAllStationInList(PathInfo, ExcludedStations):\\r\\n\\tif ExcludedStations == None or len(ExcludedStations) == 0:\\r\\n\\t\\treturn True \\r\\n\\r\\n\\tpath = set(GetAllStationsOfRoute(PathInfo))\\r\\n\\tstations = set(IncludedStations)\\r\\n\\r\\n\\tif len(path.intersection(stations)) == 0:\\r\\n\\t\\treturn True \\r\\n\\telse:\\r\\n\\t\\treturn False\",\n \"def allowed_origins(self) -> Optional[pulumi.Input[Sequence[pulumi.Input[str]]]]:\\n return pulumi.get(self, \\\"allowed_origins\\\")\",\n \"def optimizedRoutePossibilities(routes,cities):\\n\\tgraph = createOptimizedGraph(routes)\\n\\tfor couple in permutationsFromOrigin(cities):\\n\\t\\tif couple is not None:\\n\\t\\t\\t#yield find_all_paths2(graph,couple[0],couple[1])[0]\\n\\t\\t\\tprint(find_all_paths2(graph,couple[0],couple[1])[0])\",\n \"def find_directions(start, end, transit_mode=None):\\n dir_url = build_url(start, end, transit_mode)[0]\\n json_response = json.loads(urllib.request.urlopen(dir_url).read().decode('utf-8'))\\n route_legs = json_response[routes_key][0][legs_key]\\n directions = []\\n for leg in route_legs:\\n for step in leg[steps_key]:\\n directions.append(strip_tags(step[instr_key]))\\n\\n return directions\",\n \"def __validate_input(self, request_data):\\n call_id = request_data.get(strings.CALL_ID_KEY)\\n request_timestamp = request_data.get(strings.TIMESTAMP_KEY)\\n request_start = request_data.get(strings.START_KEY)\\n validation = None\\n if call_id and request_timestamp and request_start is not None:\\n call_detail_query = CallDetail.objects.filter(call_id=call_id)\\n if call_detail_query:\\n if len(call_detail_query) < CALL_DETAILS_LIMIT:\\n stored_call_detail = call_detail_query[0]\\n if isinstance(request_start, str):\\n if request_start in strings.TRUE_VALUES:\\n request_start = True\\n else:\\n request_start = False\\n if stored_call_detail.start == request_start:\\n validation = {strings.INPUT_ERROR_KEY:\\n strings.START_END_ERROR}\\n stored_timestamp = standardize_date(\\n stored_call_detail.timestamp,\\n strings.COMPLETE_DATE_PATTERN)\\n request_timestamp = standardize_date(request_timestamp,\\n strings.\\n COMPLETE_DATE_PATTERN)\\n if stored_timestamp == request_timestamp:\\n validation = {strings.INPUT_ERROR_KEY:\\n strings.EQUAL_TIMESTAMPS_ERROR}\\n if stored_call_detail.start and not request_start:\\n if stored_timestamp > request_timestamp:\\n validation = {strings.INPUT_ERROR_KEY:\\n strings.SOONER_END_ERROR}\\n elif not stored_call_detail.start and request_start:\\n if stored_timestamp < request_timestamp:\\n validation = {strings.INPUT_ERROR_KEY:\\n strings.SOONER_END_ERROR}\\n else:\\n validation = {strings.INPUT_ERROR_KEY:\\n strings.CALL_LIMIT_ERROR}\\n\\n return validation\",\n \"def validate(self):\\n valid = True\\n \\n # Check that link information is valid\\n for ij in self.link:\\n valid = valid and self.link[ij].head in self.node\\n valid = valid and self.link[ij].tail in self.node\\n if not valid:\\n print(\\\"Error: Link tail/head not found: %s %s\\\" % (self.link[ij].tail, self.link[ij].head))\\n raise utils.BadFileFormatException\\n valid = valid and self.link[ij].capacity >= 0\\n valid = valid and self.link[ij].length >= 0\\n valid = valid and self.link[ij].freeFlowTime >= 0\\n valid = valid and self.link[ij].alpha >= 0\\n valid = valid and self.link[ij].beta >= 0\\n valid = valid and self.link[ij].speedLimit >= 0\\n valid = valid and self.link[ij].toll >= 0\\n if not valid:\\n print(\\\"Link %s has negative parameters.\\\" % ij)\\n \\n # Then check that all OD pairs are in range\\n for ODpair in self.ODpair:\\n (origin, destination) = (self.ODpair[ODpair].origin, self.ODpair[ODpair].destination)\\n valid = valid and origin in self.node\\n valid = valid and destination in self.node\\n if not valid:\\n print(\\\"Error: Origin/destination %s not found\\\" % ODpair)\\n raise utils.BadFileFormatException\\n valid = valid and self.node[origin].isZone == True\\n valid = valid and self.node[destination].isZone == True\\n if not valid:\\n print(\\\"Error: Origin/destination %s does not connect two zones\\\" % str(ODpair))\\n raise utils.BadFileFormatException\\n valid = valid and self.ODpair[ODpair].demand >= 0\\n if not valid:\\n print(\\\"Error: OD pair %s has negative demand\\\" % ODpair)\\n raise utils.BadFileFormatException\\n \\n # Now error-check using metadata\\n if self.numNodes != None and len(self.node) != self.numNodes:\\n print(\\\"Warning: Number of nodes implied by network file %d different than metadata value %d\\\" % (len(self.node), self.numNodes))\\n self.numNodes = len(self.node)\\n if self.numLinks != None and len(self.link) != self.numLinks:\\n print(\\\"Warning: Number of links given in network file %d different than metadata value %d\\\" % (len(self.link), self.numLinks))\\n self.numLinks = len(self.link)\\n if self.numZones != None and len([i for i in self.node if self.node[i].isZone == True]) != self.numZones:\\n print(\\\"Warning: Number of zones given in network file %d different than metadata value %d\\\" % (len([i for i in self.node if self.node[i].isZone == True]), self.numZones))\\n self.numLinks = len(self.link)\\n if self.totalDemandCheck != None:\\n if self.totalDemand != self.totalDemandCheck:\\n print(\\\"Warning: Total demand is %f compared to metadata value %f\\\" % ( self.totalDemand, self.totalDemandCheck))\",\n \"def __init__(self, trip_update, stops, position_in_list):\\n self.trip_update = trip_update\\n self.stops = stops\\n self.routeID = str(self.trip_update.trip.route_id)\\n # A minor quirk in the MTA's data is fixed here. S trains were listed as GS for some reason\\n if self.routeID == \\\"GS\\\":\\n self.routeID = \\\"S\\\"\\n self.index = position_in_list\",\n \"def filter_relationships(self, srcip, routes):\\n outroutes = []\\n return outroutes\",\n \"def create_url(_origin_details, travel_start_date, travel_start_time, destination_list):\\n prefix = 'https://timetable.search.ch/api/route.json?one_to_many=1'\\n\\n origin_body = f'&from={_origin_details}&date={travel_start_date}&time={travel_start_time}'\\n\\n # Build iteratively with necessary syntax between destinations\\n destination_body = ''\\n for i, dest in enumerate(destination_list):\\n destination_body = f'{destination_body}&to[{i}]={dest}'\\n\\n return f'{prefix}{origin_body}{destination_body}'\",\n \"def compute_travel_cost_adjlist(\\n origins, destinations, network, index_orig=None, index_dest=None\\n):\\n\\n # NOTE: need to add an option/check for symmetric networks so we only need half the routing calls\\n\\n origins = origins.copy()\\n destinations = destinations.copy()\\n\\n origins[\\\"osm_ids\\\"] = network.get_node_ids(\\n origins.centroid.x, origins.centroid.y\\n ).astype(int)\\n destinations[\\\"osm_ids\\\"] = network.get_node_ids(\\n destinations.centroid.x, destinations.centroid.y\\n ).astype(int)\\n\\n ods = []\\n\\n if not index_orig:\\n origins[\\\"idx\\\"] = origins.index.values\\n index_orig = \\\"idx\\\"\\n if not index_dest:\\n destinations[\\\"idx\\\"] = destinations.index.values\\n index_dest = \\\"idx\\\"\\n\\n # I dont think there's a way to do this in parallel, so we can at least show a progress bar\\n with tqdm(total=len(origins[\\\"osm_ids\\\"])) as pbar:\\n for origin in origins[\\\"osm_ids\\\"]:\\n df = pd.DataFrame()\\n df[\\\"cost\\\"] = network.shortest_path_lengths(\\n [origin for d in destinations[\\\"osm_ids\\\"]],\\n [d for d in destinations[\\\"osm_ids\\\"]],\\n )\\n df[\\\"destination\\\"] = destinations[index_dest].values\\n df[\\\"origin\\\"] = origins[origins.osm_ids == origin][index_orig].values[0]\\n\\n ods.append(df)\\n pbar.update(1)\\n\\n combined = pd.concat(ods)\\n # reorder the columns\\n return combined[['origin', 'destination', 'cost']]\",\n \"def allowed_origin_patterns(self) -> Optional[pulumi.Input[Sequence[pulumi.Input[str]]]]:\\n return pulumi.get(self, \\\"allowed_origin_patterns\\\")\",\n \"def route_validity_checker(): #below route list was rerturned from bus_routes function above, copy and pasted to eliminate need to re-run\\n route_list=['15', '46A', '14', '41B', '39A', '65', '40D', '11', '31', '27', '67', '79', '42', '66A', '33B', '140', '44', '83A', '27B', '38', '16C', '747', '41C', '39', '25', '239', '43', '70', '13', '150', '145', '77A', '184', '84', '61', '83', '40', '66', '15A', '123', '17A', '16', '14C', '9', '4', '37', '32', '33', '49', '56A', '151', '25A', '45A', '54A', '47', '18', '7', '17', '102', '120', '65B', '41', '122', '29A', '76', '68', '59', '25B', '69', '27A', '66B', '38B', '7D', '75', '15B', '84A', '63', '84X', '33X', '68A', '1', '76A', '7B', '270', '236', '130', '238', '220', '44B', '40B', '26', '32B', '8', '41A', '53', '67X', '104', '32A', '79A', '114', '185', '66X', '31B', '32X', '51X', '51D', '41X', '142', '111', '69X', '27X', '116', '46E', '161', '118', '25X', '38A', '33A', 'PP07', '53B', '31A', 'OL84']\\n count_dict={}\\n for route in route_list: #dictionary with key for every route in the list\\n count_dict[route]=0 #used to count number of occurrences in files\\n os.chdir(\\\"../Data\\\")\\n for file in glob.glob(\\\"*.csv\\\"): #for every file\\n print(file)\\n reader=csv.reader(open(file))\\n for line in reader:\\n route=extract_bus_route(line[3])\\n if route!=\\\"\\\":\\n count_dict[extract_bus_route(line[3])]+=1 #incremenent the counter of the route with the associated journey id code\\n return count_dict #result is that 3 routes are likely due to strange circumstances or errors in data\",\n \"def test_addr_city_good_values(self):\\n for input_val, output_val in self.known_values:\\n self.line._parse_addr_city(input_val)\\n self.assertEqual(output_val, self.line.addr_city)\",\n \"def combineGPSandPhoneStops(arg):\\r\\n\\r\\n # unpack parameters\\r\\n user_gps, user_cell, dur_constr, spat_constr_gps, spat_cell_split = arg\\r\\n\\r\\n # combine cellular stay if it is close to a gps stay\\r\\n cell_stays = list(set([(trace[6],trace[7]) for d in user_cell for trace in user_cell[d] if int(trace[9]) >= dur_constr]))\\r\\n gps_stays = list(set([(trace[6],trace[7]) for d in user_gps for trace in user_gps[d] if int(trace[9]) >= dur_constr]))\\r\\n pairs_close = set()\\r\\n for cell_stay in cell_stays:\\r\\n for gps_stay in gps_stays:\\r\\n if distance(cell_stay[0],cell_stay[1],gps_stay[0],gps_stay[1]) <= spat_constr_gps:\\r\\n pairs_close.add((gps_stay[0],gps_stay[1],cell_stay[0],cell_stay[1]))\\r\\n break\\r\\n # find all pair[1]s in list, and replace it with pair[0]\\r\\n for pair in list(pairs_close):\\r\\n for d in user_cell.keys():\\r\\n for trace in user_cell[d]:\\r\\n if trace[6] == pair[2] and trace[7] == pair[3]:\\r\\n trace[5], trace[6], trace[7] = 99, pair[0], pair[1] #pretend as gps\\r\\n\\r\\n user = user_gps\\r\\n for d in user.keys():\\r\\n if len(user_cell[d]):\\r\\n user[d].extend(user_cell[d])\\r\\n user[d] = sorted(user[d], key=itemgetter(0))\\r\\n\\r\\n # address oscillation\\r\\n user = oscillation_h1_oscill(user, dur_constr) #OscillationPairList = oscillation_h1_oscill(user, dur_constr)\\r\\n # ## when replaced, can only replaced with a gps stay; so let modify exchange ping-pong pair in the pairList\\r\\n # gpslist_temp = {(trace[6], trace[7]):int(trace[5]) for d in user.keys() for trace in user[d]}\\r\\n # for pair_i in range(len(OscillationPairList)):\\r\\n # if gpslist_temp[(OscillationPairList[pair_i][0],OscillationPairList[pair_i][1])] <= spat_constr_gps:# wrong(2,3)\\r\\n # OscillationPairList[pair_i] = [OscillationPairList[pair_i][2],OscillationPairList[pair_i][3],\\r\\n # OscillationPairList[pair_i][0],OscillationPairList[pair_i][1]]\\r\\n ## find pong in trajactory, and replace it with ping\\r\\n ## this part is now integreted into the function itself\\r\\n ## OscillationPairList is in format: {, (ping[0], ping[1]): (pong[0], pong[1])}\\r\\n # for d in user.keys():\\r\\n # for trace in user[d]:\\r\\n # if (trace[6], trace[7]) in OscillationPairList:\\r\\n # trace[6], trace[7] = OscillationPairList[(trace[6], trace[7])]\\r\\n\\r\\n # update duration\\r\\n user = update_duration(user, dur_constr)\\r\\n\\r\\n for d in user:\\r\\n phone_index = [k for k in range(len(user[d])) if int(user[d][k][5]) > spat_cell_split]\\r\\n if len(phone_index) == 0: # if no phone trace\\r\\n continue\\r\\n for i in range(len(user[d])):\\r\\n if int(user[d][i][5]) > spat_cell_split and int(user[d][i][9]) < dur_constr: # passing phone observ\\r\\n user[d][i].append('checked')\\r\\n # combine consecutive obsv on a phone stay into two observ\\r\\n i = min(phone_index) # i has to be a phone index\\r\\n j = i + 1\\r\\n while i < len(user[d]) - 1:\\r\\n if j >= len(user[d]): # a day ending with a stay, j goes beyond the last observation\\r\\n for k in range(i + 1, j - 1, 1):\\r\\n user[d][k] = []\\r\\n break\\r\\n if int(user[d][j][5]) > spat_cell_split and user[d][j][6] == user[d][i][6] \\\\\\r\\n and user[d][j][7] == user[d][i][7] and j < len(user[d]):\\r\\n j += 1\\r\\n else:\\r\\n for k in range(i + 1, j - 1, 1):\\r\\n user[d][k] = []\\r\\n phone_index = [k for k in range(j, len(user[d])) if int(user[d][k][5]) > spat_cell_split]\\r\\n if len(phone_index) < 3: # if no phone trace\\r\\n break\\r\\n i = min(phone_index) ##i has to be a phone index\\r\\n j = i + 1\\r\\n i = 0 # remove []\\r\\n while i < len(user[d]):\\r\\n if len(user[d][i]) == 0:\\r\\n del user[d][i]\\r\\n else:\\r\\n i += 1\\r\\n # adress phone stay one by one\\r\\n flag_changed = True\\r\\n phone_list_check = []\\r\\n while (flag_changed):\\r\\n # print('while........')\\r\\n flag_changed = False\\r\\n gps_list = []\\r\\n phone_list = []\\r\\n for i in range(len(user[d])):\\r\\n if int(user[d][i][5]) <= spat_cell_split:#or user[d][i][2] == 'addedphonestay': #changed on 0428\\r\\n gps_list.append(user[d][i])\\r\\n else:\\r\\n phone_list.append(user[d][i])\\r\\n\\r\\n phone_list.extend(phone_list_check)\\r\\n # when updating duration for phone stay, we have to put back passing obs\\r\\n phone_list = sorted(phone_list, key=itemgetter(0))\\r\\n # update phone stay\\r\\n i = 0\\r\\n j = i\\r\\n while i < len(phone_list):\\r\\n if j >= len(phone_list): # a day ending with a stay, j goes beyond the last observation\\r\\n dur = str(int(phone_list[j - 1][0]) - int(phone_list[i][0]))\\r\\n for k in range(i, j, 1):\\r\\n if int(phone_list[k][9]) >= dur_constr:\\r\\n # we don't want to change a pssing into a stay; as we have not process the combine this stay\\r\\n # this is possible when a stay that prevents two passing is mergeed into gps as gps points\\r\\n phone_list[k][9] = dur\\r\\n break\\r\\n if phone_list[j][6] == phone_list[i][6] and phone_list[j][7] == phone_list[i][7] and j < len(\\r\\n phone_list):\\r\\n j += 1\\r\\n else:\\r\\n dur = str(int(phone_list[j - 1][0]) - int(phone_list[i][0]))\\r\\n for k in range(i, j, 1):\\r\\n if int(phone_list[k][9]) >= dur_constr:\\r\\n phone_list[k][9] = dur\\r\\n i = j\\r\\n for trace in phone_list: # those trace with gps as -1,-1 (not clustered) should not assign a duration\\r\\n if float(trace[6]) == -1: trace[9] = -1\\r\\n if len(phone_list) == 1: phone_list[0][9] = -1\\r\\n\\r\\n # update check lable\\r\\n for i in range(len(phone_list)):\\r\\n if int(phone_list[i][5]) > spat_cell_split and int(phone_list[i][9]) < dur_constr \\\\\\r\\n and phone_list[i][-1] != 'checked':\\r\\n # passing phone observ\\r\\n phone_list[i].append('checked')\\r\\n\\r\\n # put those not checked together with gps\\r\\n user[d] = gps_list\\r\\n phone_list_check = []\\r\\n for i in range(len(phone_list)):\\r\\n if phone_list[i][-1] == 'checked':\\r\\n phone_list_check.append(phone_list[i])\\r\\n else:\\r\\n user[d].append(phone_list[i])\\r\\n user[d] = sorted(user[d], key=itemgetter(0))\\r\\n\\r\\n # find a stay which is not checked\\r\\n flag_phonestay_notchecked = False\\r\\n phonestay_left, phonestay_right = -1, -1\\r\\n for i in range(max(0, phonestay_right+1), len(user[d])):\\r\\n phonestay_left, phonestay_right = -1, -1\\r\\n if int(user[d][i][5]) > spat_cell_split \\\\\\r\\n and int(user[d][i][9]) >= dur_constr and user[d][i][-1] != 'checked':\\r\\n phonestay_left = phonestay_right\\r\\n phonestay_right = i\\r\\n if phonestay_left != -1 and phonestay_right != -1 \\\\\\r\\n and user[d][phonestay_left][9] == user[d][phonestay_right][9]:\\r\\n flag_phonestay_notchecked = True\\r\\n\\r\\n ## modified on 04152019\\r\\n if flag_phonestay_notchecked == False or len(phone_list) == 0: # if all phone observation are checked, end\\r\\n break\\r\\n # if they are not two consecutive observation\\r\\n if phonestay_right != phonestay_left + 1: # attention: only phonestay_left is addressed\\r\\n # not consecutive two observations\\r\\n if any([int(user[d][j][9]) >= dur_constr for j in range(phonestay_left + 1, phonestay_right, 1)]):\\r\\n # found a gps stay in betw\\r\\n # print('23: found a gps stay in betw, just use one gps stay trade one phone stay')\\r\\n temp = user[d][phonestay_left][6:]\\r\\n user[d][phonestay_left][6:] = [-1, -1, -1, -1, -1, -1] # phone disappear\\r\\n # user[d][phonestay_left].extend(temp)\\r\\n user[d][phonestay_left].append('checked')\\r\\n # del user[d][phonestay_left] # phone disappear\\r\\n flag_changed = True\\r\\n else: # find close gps\\r\\n # print('24: do not found a gps stay in betw')\\r\\n phone_uncernt = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\\r\\n int(user[d][phonestay_right][5])])\\r\\n if all([(phone_uncernt + int(user[d][j][5])) > 1000 * distance(user[d][j][3], user[d][j][4],\\r\\n user[d][phonestay_left][6],\\r\\n user[d][phonestay_left][7])\\r\\n for j in range(phonestay_left + 1, phonestay_right, 1)]):\\r\\n # total uncerty larger than distance\\r\\n # this case should be rare, as those close gps may be clustered\\r\\n # print('241: all gps falling betw are close with phone stay')\\r\\n temp = user[d][phonestay_left][3:] # copy neighbor gps\\r\\n user[d][phonestay_left][3:] = user[d][phonestay_left + 1][3:]\\r\\n user[d][phonestay_left][11] = temp[8]\\r\\n # user[d][phonestay_left].extend(temp)\\r\\n flag_changed = True\\r\\n else:\\r\\n # print('242: find a gps in betw,\\r\\n # which is far away with phone stay, contradic with a stay (with phone obsv)')\\r\\n temp = user[d][phonestay_left][6:]\\r\\n user[d][phonestay_left][6:] = [-1, -1, -1, -1, -1, -1] # phone disappear\\r\\n # user[d][phonestay_left].extend(temp)\\r\\n user[d][phonestay_left].append('checked')\\r\\n # del user[d][phonestay_left] # phone disappear\\r\\n flag_changed = True\\r\\n else: # if they are two consecutive traces\\r\\n # two consecutive observation\\r\\n # if phonestay_left != 0 and phonestay_right < len(user[d]) - 1:\\r\\n # ignore if they are at the beginning or the end of traj\\r\\n prev_gps = next_gps = 0 # find prevous and next gps\\r\\n found_prev_gps = False\\r\\n found_next_gps = False\\r\\n for prev in range(phonestay_left - 1, -1, -1):\\r\\n # if int(user[d][prev][5]) <= spat_cell_split: ########## changed on 04282018\\r\\n if int(user[d][prev][5]) <= spat_cell_split and int(user[d][prev][9]) >= dur_constr:\\r\\n prev_gps = prev\\r\\n found_prev_gps = True\\r\\n break\\r\\n for nxt in range(phonestay_right + 1, len(user[d])):\\r\\n if int(user[d][nxt][5]) <= spat_cell_split and int(user[d][nxt][9]) >= dur_constr:\\r\\n next_gps = nxt\\r\\n found_next_gps = True\\r\\n break\\r\\n\\r\\n if found_prev_gps and found_next_gps and user[d][prev_gps][6] == user[d][next_gps][6]:\\r\\n # this is a phone stay within a gps stay\\r\\n phone_uncernt = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\\r\\n int(user[d][phonestay_right][5])])\\r\\n gps_uncernt = int(user[d][prev_gps][8])\\r\\n dist = 1000 * distance(user[d][prev_gps][6],\\r\\n user[d][prev_gps][7],\\r\\n user[d][phonestay_left][6],\\r\\n user[d][phonestay_left][7])\\r\\n speed_dep = (dist - phone_uncernt - gps_uncernt) / \\\\\\r\\n (int(user[d][phonestay_left][0]) - int(user[d][prev_gps][0])) * 3.6\\r\\n speed_retn = (dist - phone_uncernt - gps_uncernt) / \\\\\\r\\n (int(user[d][next_gps][0]) - int(user[d][phonestay_right][0])) * 3.6\\r\\n if (dist - phone_uncernt - gps_uncernt) > 0 \\\\\\r\\n and dist > 1000*spat_constr_gps and speed_dep < 200 and speed_retn < 200:\\r\\n # print('1111: distance larger than acc, and can travel, add phone stay, shorten gps stay')\\r\\n # leave phone stay there, we later update duration for the gps stay\\r\\n user[d][phonestay_left].append('checked')\\r\\n # those phone stay not removed have to be marked with 'checked'!\\r\\n user[d][phonestay_right].append('checked')\\r\\n user[d][phonestay_left][2] = 'addedphonestay'\\r\\n user[d][phonestay_right][2] = 'addedphonestay'\\r\\n flag_changed = True\\r\\n else: # merge into gps stay\\r\\n # print('1112: distance less than acc, or cannot travel, merge into gps stay')\\r\\n temp = user[d][phonestay_left][3:]\\r\\n user[d][phonestay_left][3:] = user[d][prev_gps][3:]\\r\\n user[d][phonestay_left][11] = temp[8]\\r\\n # user[d][phonestay_left].extend(temp)\\r\\n temp = user[d][phonestay_right][3:]\\r\\n user[d][phonestay_right][3:] = user[d][prev_gps][3:]\\r\\n user[d][phonestay_right][11] = temp[8]\\r\\n # user[d][phonestay_right].extend(temp)\\r\\n flag_changed = True\\r\\n elif found_prev_gps and found_next_gps and user[d][prev_gps][6] != user[d][next_gps][6]:\\r\\n phone_uncernt_l = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\\r\\n int(user[d][phonestay_right][5])])\\r\\n gps_uncernt_l = int(user[d][prev_gps][8])\\r\\n dist_l = 1000 * distance(user[d][prev_gps][6],\\r\\n user[d][prev_gps][7],\\r\\n user[d][phonestay_left][6],\\r\\n user[d][phonestay_left][7])\\r\\n speed_dep = (dist_l - phone_uncernt_l - gps_uncernt_l) / \\\\\\r\\n (int(user[d][phonestay_left][0]) - int(user[d][prev_gps][0])) * 3.6\\r\\n phone_uncernt_r = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\\r\\n int(user[d][phonestay_right][5])])\\r\\n gps_uncernt_r = int(user[d][next_gps][8])\\r\\n dist_r = 1000 * distance(user[d][next_gps][6],\\r\\n user[d][next_gps][7],\\r\\n user[d][phonestay_right][6],\\r\\n user[d][phonestay_right][7])\\r\\n speed_retn = (dist_r - phone_uncernt_r - gps_uncernt_r) / \\\\\\r\\n (int(user[d][next_gps][0]) - int(user[d][phonestay_right][0])) * 3.6\\r\\n comb_l = 0 #revised on 03202019 to pick up one gps stay to combine with; if spatial conti with multi\\r\\n comb_r = 0\\r\\n if (dist_l - phone_uncernt_l - gps_uncernt_l) < 0 \\\\\\r\\n or dist_l < 1000*spat_constr_gps or speed_dep > 200:\\r\\n comb_l = 1\\r\\n if (dist_r - phone_uncernt_r - gps_uncernt_r) < 0 \\\\\\r\\n or dist_r < 1000 * spat_constr_gps or speed_retn > 200:\\r\\n comb_r = 1\\r\\n if comb_l*comb_r == 1:\\r\\n if dist_l < dist_r:\\r\\n comb_r = 0\\r\\n else:\\r\\n comb_l = 0\\r\\n if comb_l:\\r\\n temp = user[d][phonestay_left][3:]\\r\\n user[d][phonestay_left][3:] = user[d][prev_gps][3:]\\r\\n user[d][phonestay_left][11] = temp[8]\\r\\n # user[d][phonestay_left].extend(temp)\\r\\n temp = user[d][phonestay_right][3:]\\r\\n user[d][phonestay_right][3:] = user[d][prev_gps][3:]\\r\\n user[d][phonestay_right][11] = temp[8]\\r\\n # user[d][phonestay_right].extend(temp)\\r\\n flag_changed = True\\r\\n elif comb_r:\\r\\n temp = user[d][phonestay_left][3:]\\r\\n user[d][phonestay_left][3:] = user[d][next_gps][3:]\\r\\n user[d][phonestay_left][11] = temp[8]\\r\\n # user[d][phonestay_left].extend(temp)\\r\\n temp = user[d][phonestay_right][3:]\\r\\n user[d][phonestay_right][3:] = user[d][next_gps][3:]\\r\\n user[d][phonestay_right][11] = temp[8]\\r\\n # user[d][phonestay_right].extend(temp)\\r\\n flag_changed = True\\r\\n else:\\r\\n user[d][phonestay_left].append('checked')\\r\\n # those phone stay not removed have to be marked with 'checked'!\\r\\n user[d][phonestay_right].append('checked')\\r\\n user[d][phonestay_left][2] = 'addedphonestay'\\r\\n user[d][phonestay_right][2] = 'addedphonestay'\\r\\n flag_changed = True\\r\\n elif found_prev_gps: # a gps stay #right# before\\r\\n # print('113: before phone stay, we have gps stay')\\r\\n phone_uncernt = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\\r\\n int(user[d][phonestay_right][5])])\\r\\n gps_uncernt = int(user[d][prev_gps][8])\\r\\n dist = 1000 * distance(user[d][prev_gps][6],\\r\\n user[d][prev_gps][7],\\r\\n user[d][phonestay_left][6],\\r\\n user[d][phonestay_left][7])\\r\\n speed_dep = (dist - phone_uncernt - gps_uncernt) / \\\\\\r\\n (int(user[d][phonestay_left][0]) - int(user[d][prev_gps][0])) * 3.6\\r\\n if (dist - phone_uncernt - gps_uncernt) > 0 and dist > 1000*spat_constr_gps and speed_dep < 200:\\r\\n # spatially seperate enough and can travel, add in gps\\r\\n # print('1132: dist>low_acc, add phone stay')\\r\\n # leave phone stay there\\r\\n user[d][phonestay_left].append('checked')\\r\\n user[d][phonestay_right].append('checked')\\r\\n user[d][phonestay_left][2] = 'addedphonestay'\\r\\n user[d][phonestay_right][2] = 'addedphonestay'\\r\\n flag_changed = True\\r\\n else:\\r\\n # print('1131: low_acc > dist, merge with gps stay, meaning extend gps dur')\\r\\n temp = user[d][phonestay_left][3:]\\r\\n user[d][phonestay_left][3:] = user[d][prev_gps][3:]\\r\\n user[d][phonestay_left][11] = temp[8]\\r\\n # user[d][phonestay_left].extend(temp)\\r\\n temp = user[d][phonestay_right][3:]\\r\\n user[d][phonestay_right][3:] = user[d][prev_gps][3:]\\r\\n user[d][phonestay_right][11] = temp[8]\\r\\n # user[d][phonestay_right].extend(temp)\\r\\n flag_changed = True\\r\\n elif found_next_gps: # a gps stay #right# after\\r\\n # print('112: after phone stay, we have gps stay')\\r\\n phone_uncernt = max([int(user[d][phonestay_left][8]), int(user[d][phonestay_left][5]),\\r\\n int(user[d][phonestay_right][5])])\\r\\n gps_uncernt = int(user[d][next_gps][8])\\r\\n dist = 1000 * distance(user[d][next_gps][6],\\r\\n user[d][next_gps][7],\\r\\n user[d][phonestay_right][6],\\r\\n user[d][phonestay_right][7])\\r\\n speed_retn = (dist - phone_uncernt - gps_uncernt) / \\\\\\r\\n (int(user[d][next_gps][0]) - int(user[d][phonestay_right][0])) * 3.6\\r\\n if (dist - phone_uncernt - gps_uncernt) > 0 and dist > 1000*spat_constr_gps and speed_retn<200:\\r\\n # spatially seperate enough and can travel, add in gps\\r\\n # print('1122: dist>low_acc, add phone stay')\\r\\n # leave phone stay there, we later update duration for the gps stay\\r\\n user[d][phonestay_left].append('checked')\\r\\n user[d][phonestay_right].append('checked')\\r\\n user[d][phonestay_left][2] = 'addedphonestay'\\r\\n user[d][phonestay_right][2] = 'addedphonestay'\\r\\n flag_changed = True\\r\\n else:# remain phone observ, but use gps location\\r\\n # print('1121: low_acc > dist, merge with gps stay, meaning extend gps dur')\\r\\n temp = user[d][phonestay_left][3:]\\r\\n user[d][phonestay_left][3:] = user[d][next_gps][3:]\\r\\n user[d][phonestay_left][11] = temp[8]\\r\\n # user[d][phonestay_left].extend(temp)\\r\\n temp = user[d][phonestay_right][3:]\\r\\n user[d][phonestay_right][3:] = user[d][next_gps][3:]\\r\\n user[d][phonestay_right][11] = temp[8]\\r\\n # user[d][phonestay_right].extend(temp)\\r\\n flag_changed = True\\r\\n else: # if don't match any case, just add it\\r\\n # print('donot match any case, just add it (e.g., consecutive two phone stays)')\\r\\n # leave phone stay there\\r\\n user[d][phonestay_left].append('checked')\\r\\n user[d][phonestay_right].append('checked')\\r\\n user[d][phonestay_left][2] = 'addedphonestay'\\r\\n user[d][phonestay_right][2] = 'addedphonestay'\\r\\n flag_changed = True\\r\\n\\r\\n\\r\\n # user[d].extend(phone_list_check)\\r\\n for trace in phone_list_check:\\r\\n if trace[2] == 'addedphonestay':\\r\\n user[d].append(trace[:])\\r\\n # remove passingby cellular traces\\r\\n i = 0\\r\\n while i<len(user[d]):\\r\\n if user[d][i][5] == 99 and float(user[d][i][9]) < dur_constr:\\r\\n del user[d][i]\\r\\n else:\\r\\n i+=1\\r\\n # remove passing traces\\r\\n ## Flag_changed = True\\r\\n ## while (Flag_changed):\\r\\n ## Flag_changed = False\\r\\n # i = 0\\r\\n # while i < len(user[d]):\\r\\n # if int(user[d][i][5]) > spat_cell_split and int(user[d][i][9]) < dur_constr:\\r\\n # # Flag_changed = True\\r\\n # del user[d][i]\\r\\n # else:\\r\\n # i += 1\\r\\n user[d] = sorted(user[d], key=itemgetter(0))\\r\\n # update duration\\r\\n i = 0\\r\\n j = i\\r\\n while i < len(user[d]):\\r\\n if j >= len(user[d]): # a day ending with a stay, j goes beyond the last observation\\r\\n dur = str(int(user[d][j - 1][0]) - int(user[d][i][0]))\\r\\n for k in range(i, j, 1):\\r\\n user[d][k][9] = dur\\r\\n break\\r\\n if user[d][j][6] == user[d][i][6] and user[d][j][7] == user[d][i][7] and j < len(\\r\\n user[d]):\\r\\n j += 1\\r\\n else:\\r\\n dur = str(int(user[d][j - 1][0]) - int(user[d][i][0]))\\r\\n for k in range(i, j, 1):\\r\\n user[d][k][9] = dur\\r\\n i = j\\r\\n for trace in user[d]: # those trace with gps as -1,-1 (not clustered) should not assign a duration\\r\\n if float(trace[6]) == -1: trace[9] = -1\\r\\n if len(user[d]) == 1: user[d][0][9] = -1\\r\\n # remove and add back; because phone stays are distroyed as multiple, should be combined as one\\r\\n i = 0\\r\\n while i < len(user[d]):\\r\\n if user[d][i][2] == 'addedphonestay':\\r\\n del user[d][i]\\r\\n else:\\r\\n i += 1\\r\\n # add back and sort\\r\\n for trace in phone_list_check:\\r\\n if trace[2] == 'addedphonestay':\\r\\n user[d].append(trace)\\r\\n\\r\\n user[d] = sorted(user[d], key=itemgetter(0))\\r\\n\\r\\n # remove temp marks\\r\\n user[d]=[trace[:12] for trace in user[d]]\\r\\n\\r\\n # oscillation\\r\\n # modify grid\\r\\n for day in user.keys():\\r\\n for trace in user[day]:\\r\\n if float(trace[6]) == -1:\\r\\n found_stay = False\\r\\n if found_stay == False:\\r\\n trace[6] = trace[3] + '000' # in case do not have enough digits\\r\\n trace[7] = trace[4] + '000'\\r\\n digits = (trace[6].split('.'))[1]\\r\\n digits = digits[:2] + str(int(digits[2]) / 2)\\r\\n trace[6] = (trace[6].split('.'))[0] + '.' + digits\\r\\n # trace[6] = trace[6][:5] + str(int(trace[6][5]) / 2) # 49.950 to 49.952 220 meters\\r\\n digits = (trace[7].split('.'))[1]\\r\\n digits = digits[:2] + str(int(digits[2:4]) / 25)\\r\\n trace[7] = (trace[7].split('.'))[0] + '.' + digits\\r\\n # trace[7] = trace[7][:7] + str(int(trace[7][7:9]) / 25) # -122.3400 to -122.3425 180 meters\\r\\n\\r\\n # added to address oscillation\\r\\n user = oscillation_h1_oscill(user, dur_constr)\\r\\n ## find pong in trajactory, and replace it with ping\\r\\n ## this part is now integreted into the function itself\\r\\n ## OscillationPairList is in format: {, (ping[0], ping[1]): (pong[0], pong[1])}\\r\\n # for d in user.keys():\\r\\n # for trace in user[d]:\\r\\n # if (trace[6], trace[7]) in OscillationPairList:\\r\\n # trace[6], trace[7] = OscillationPairList[(trace[6], trace[7])]\\r\\n\\r\\n # update duration\\r\\n user = update_duration(user, dur_constr)\\r\\n\\r\\n # end addressing oscillation\\r\\n # those newly added stays should be combined with close stays\\r\\n user = cluster_incremental(user, spat_constr_gps, dur_constr=dur_constr)\\r\\n # update duration\\r\\n user = update_duration(user, dur_constr)\\r\\n # use only one record for one stay\\r\\n for d in user:\\r\\n i = 0\\r\\n while i < len(user[d]) - 1:\\r\\n if user[d][i + 1][6] == user[d][i][6] and user[d][i + 1][7] == user[d][i][7] \\\\\\r\\n and user[d][i + 1][9] == user[d][i][9] and int(user[d][i][9]) >= dur_constr:\\r\\n del user[d][i + 1]\\r\\n else:\\r\\n i += 1\\r\\n # mark stay\\r\\n staylist = set() # get unique staylist\\r\\n for d in user.keys():\\r\\n for trace in user[d]:\\r\\n if float(trace[9]) >= dur_constr:\\r\\n staylist.add((trace[6], trace[7]))\\r\\n else: # change back keep full trajectory: do not use center for those are not stays\\r\\n trace[6], trace[7], trace[8], trace[9] = -1, -1, -1, -1 # for non stay, do not give center\\r\\n staylist = list(staylist)\\r\\n for d in user.keys():\\r\\n for trace in user[d]:\\r\\n for i in range(len(staylist)):\\r\\n if trace[6] == staylist[i][0] and trace[7] == staylist[i][1]:\\r\\n trace[10] = 'stay' + str(i)\\r\\n break\\r\\n\\r\\n return user\",\n \"def destination_route_table_ids(self) -> Optional[pulumi.Input[Sequence[pulumi.Input[str]]]]:\\n return pulumi.get(self, \\\"destination_route_table_ids\\\")\",\n \"def destination_route_table_ids(self) -> Optional[pulumi.Input[Sequence[pulumi.Input[str]]]]:\\n return pulumi.get(self, \\\"destination_route_table_ids\\\")\",\n \"def __init__(__self__, *,\\n as_path_match_mode: Optional[pulumi.Input[str]] = None,\\n cen_id: Optional[pulumi.Input[str]] = None,\\n cen_region_id: Optional[pulumi.Input[str]] = None,\\n cidr_match_mode: Optional[pulumi.Input[str]] = None,\\n community_match_mode: Optional[pulumi.Input[str]] = None,\\n community_operate_mode: Optional[pulumi.Input[str]] = None,\\n description: Optional[pulumi.Input[str]] = None,\\n destination_child_instance_types: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n destination_cidr_blocks: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n destination_instance_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n destination_instance_ids_reverse_match: Optional[pulumi.Input[bool]] = None,\\n destination_route_table_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n map_result: Optional[pulumi.Input[str]] = None,\\n match_asns: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n match_community_sets: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n next_priority: Optional[pulumi.Input[int]] = None,\\n operate_community_sets: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n preference: Optional[pulumi.Input[int]] = None,\\n prepend_as_paths: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n priority: Optional[pulumi.Input[int]] = None,\\n route_map_id: Optional[pulumi.Input[str]] = None,\\n route_types: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n source_child_instance_types: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n source_instance_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n source_instance_ids_reverse_match: Optional[pulumi.Input[bool]] = None,\\n source_region_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n source_route_table_ids: Optional[pulumi.Input[Sequence[pulumi.Input[str]]]] = None,\\n status: Optional[pulumi.Input[str]] = None,\\n transit_router_route_table_id: Optional[pulumi.Input[str]] = None,\\n transmit_direction: Optional[pulumi.Input[str]] = None):\\n if as_path_match_mode is not None:\\n pulumi.set(__self__, \\\"as_path_match_mode\\\", as_path_match_mode)\\n if cen_id is not None:\\n pulumi.set(__self__, \\\"cen_id\\\", cen_id)\\n if cen_region_id is not None:\\n pulumi.set(__self__, \\\"cen_region_id\\\", cen_region_id)\\n if cidr_match_mode is not None:\\n pulumi.set(__self__, \\\"cidr_match_mode\\\", cidr_match_mode)\\n if community_match_mode is not None:\\n pulumi.set(__self__, \\\"community_match_mode\\\", community_match_mode)\\n if community_operate_mode is not None:\\n pulumi.set(__self__, \\\"community_operate_mode\\\", community_operate_mode)\\n if description is not None:\\n pulumi.set(__self__, \\\"description\\\", description)\\n if destination_child_instance_types is not None:\\n pulumi.set(__self__, \\\"destination_child_instance_types\\\", destination_child_instance_types)\\n if destination_cidr_blocks is not None:\\n pulumi.set(__self__, \\\"destination_cidr_blocks\\\", destination_cidr_blocks)\\n if destination_instance_ids is not None:\\n pulumi.set(__self__, \\\"destination_instance_ids\\\", destination_instance_ids)\\n if destination_instance_ids_reverse_match is not None:\\n pulumi.set(__self__, \\\"destination_instance_ids_reverse_match\\\", destination_instance_ids_reverse_match)\\n if destination_route_table_ids is not None:\\n pulumi.set(__self__, \\\"destination_route_table_ids\\\", destination_route_table_ids)\\n if map_result is not None:\\n pulumi.set(__self__, \\\"map_result\\\", map_result)\\n if match_asns is not None:\\n pulumi.set(__self__, \\\"match_asns\\\", match_asns)\\n if match_community_sets is not None:\\n pulumi.set(__self__, \\\"match_community_sets\\\", match_community_sets)\\n if next_priority is not None:\\n pulumi.set(__self__, \\\"next_priority\\\", next_priority)\\n if operate_community_sets is not None:\\n pulumi.set(__self__, \\\"operate_community_sets\\\", operate_community_sets)\\n if preference is not None:\\n pulumi.set(__self__, \\\"preference\\\", preference)\\n if prepend_as_paths is not None:\\n pulumi.set(__self__, \\\"prepend_as_paths\\\", prepend_as_paths)\\n if priority is not None:\\n pulumi.set(__self__, \\\"priority\\\", priority)\\n if route_map_id is not None:\\n pulumi.set(__self__, \\\"route_map_id\\\", route_map_id)\\n if route_types is not None:\\n pulumi.set(__self__, \\\"route_types\\\", route_types)\\n if source_child_instance_types is not None:\\n pulumi.set(__self__, \\\"source_child_instance_types\\\", source_child_instance_types)\\n if source_instance_ids is not None:\\n pulumi.set(__self__, \\\"source_instance_ids\\\", source_instance_ids)\\n if source_instance_ids_reverse_match is not None:\\n pulumi.set(__self__, \\\"source_instance_ids_reverse_match\\\", source_instance_ids_reverse_match)\\n if source_region_ids is not None:\\n pulumi.set(__self__, \\\"source_region_ids\\\", source_region_ids)\\n if source_route_table_ids is not None:\\n pulumi.set(__self__, \\\"source_route_table_ids\\\", source_route_table_ids)\\n if status is not None:\\n pulumi.set(__self__, \\\"status\\\", status)\\n if transit_router_route_table_id is not None:\\n pulumi.set(__self__, \\\"transit_router_route_table_id\\\", transit_router_route_table_id)\\n if transmit_direction is not None:\\n pulumi.set(__self__, \\\"transmit_direction\\\", transmit_direction)\",\n \"def validate(self, allow_missing=False, allow_extra=False, cls=None, **kwargs):\\n # pop any strand name:data pairs out of kwargs and into their own dict\\n source_kwargs = tuple(name for name in kwargs.keys() if name in ALL_STRANDS)\\n sources = dict((name, kwargs.pop(name)) for name in source_kwargs)\\n for strand_name, strand_data in sources.items():\\n\\n if not allow_extra:\\n if (strand_data is not None) and (strand_name not in self.available_strands):\\n raise exceptions.StrandNotFound(\\n f\\\"Source data is provided for '{strand_name}' but no such strand is defined in the twine\\\"\\n )\\n\\n if not allow_missing:\\n if (strand_name in self.available_strands) and (strand_data is None):\\n raise exceptions.TwineValueException(\\n f\\\"The '{strand_name}' strand is defined in the twine, but no data is provided in sources\\\"\\n )\\n\\n if strand_data is not None:\\n # TODO Consider reintroducing a skip based on whether cls is already instantiated. For now, leave it the\\n # responsibility of the caller to determine what has already been validated and what hasn't.\\n # # Use the twine to validate and instantiate as the desired class\\n # if not isinstance(value, type(cls)):\\n # self.logger.debug(\\n # \\\"Instantiating %s as %s and validating against twine\\\", name, cls.__name__ if cls else \\\"default_class\\\"\\n # )\\n # return self.twine.validate(name, source=value, cls=cls)\\n method = getattr(self, f\\\"validate_{strand_name}\\\")\\n klass = self._get_cls(strand_name, cls)\\n sources[strand_name] = method(strand_data, cls=klass, **kwargs)\\n else:\\n sources[strand_name] = None\\n\\n return sources\",\n \"def test_get_routes(self):\\n routes = self.stop.routes\\n self.assertEqual(type(routes), type([]))\\n [self.assertEqual(type(i), BusRoute) for i in routes]\\n routes[0].__repr__()\\n routes[0].__str__()\\n routes[0].__unicode__()\",\n \"def _make_reverse_relations_valid(self, data):\\n for field_name, (field, related_field) in self._get_reverse_fields().items():\\n if data.get(field.source) is None:\\n continue\\n if isinstance(field, serializers.ListSerializer):\\n field = field.child\\n if isinstance(field, serializers.ModelSerializer):\\n # find the serializer field matching the reverse model relation\\n for sub_field in field.fields.values():\\n if sub_field.source == related_field.name:\\n sub_field.required = False\\n # found the matching field, move on\\n break\",\n \"def validate_move(self, move_from, move_to, board):\\n\\n from_coordinates = JanggiGame.translate_to_grid(move_from)\\n to_coordinates = JanggiGame.translate_to_grid(move_to)\\n from_col = from_coordinates[0]\\n from_row = from_coordinates[1]\\n to_col = to_coordinates[0]\\n to_row = to_coordinates[1]\\n\\n # if destination within the board\\n if to_col in range(9) and to_row in range(10):\\n # if destination is 1 up and diagonally to the left\\n if to_col - from_col == -2 and to_row - from_row == -3 and board[from_col][from_row - 1] == '' and board[from_col - 1][from_row - 2] == '':\\n return True\\n # if destination is 1 up and diagonally to the right\\n if to_col - from_col == 2 and to_row - from_row == -3 and board[from_col][from_row - 1] == '' and board[from_col + 1][from_row - 2] == '':\\n return True\\n # if destination is 1 down and diagonally to the left\\n if to_col - from_col == -2 and to_row - from_row == 3 and board[from_col][from_row + 1] == '' and board[from_col - 1][from_row + 2] == '':\\n return True\\n # if destination is 1 down and diagonally to the right\\n if to_col - from_col == 2 and to_row - from_row == 3 and board[from_col][from_row + 1] == '' and board[from_col + 1][from_row + 2] == '':\\n return True\\n # if destination is 1 left and diagonally up\\n if to_col - from_col == -3 and to_row - from_row == -2 and board[from_col - 1][from_row] == '' and board[from_col - 2][from_row - 1] == '':\\n return True\\n # if destination is 1 left and diagonally down\\n if to_col - from_col == -3 and to_row - from_row == 2 and board[from_col - 1][from_row] == '' and board[from_col - 2][from_row + 1] == '':\\n return True\\n # if destination is 1 right and diagonally up\\n if to_col - from_col == 3 and to_row - from_row == -2 and board[from_col + 1][from_row] == '' and board[from_col + 2][from_row - 1] == '':\\n return True\\n # if destination is 1 right and diagonally down\\n if to_col - from_col == 3 and to_row - from_row == 2 and board[from_col + 1][from_row] == '' and board[from_col + 2][from_row + 1] == '':\\n return True\\n return False\",\n \"def processTradeRoutes(self):\\n try:\\n nextRound = self.currentRound+1\\n resultslist = []\\n for trID in self.tradeRoutes.keys():\\n myTradeRoute = self.tradeRoutes[trID]\\n (systemFromID, systemToID, tradeRouteType) = string.split(trID, '-')\\n systemFrom = self.systems[systemFromID]\\n systemTo = self.systems[systemToID]\\n cancel = 0\\n warpReq = 0\\n # choose trade route type\\n if tradeRouteType == 'GEN':\\n # update what system sends based on what it makes\\n myTradeRoute.AL = systemFrom.prodAL\\n myTradeRoute.EC = systemFrom.prodEC\\n myTradeRoute.IA = systemFrom.prodIA\\n \\n # check if trade route is adjacent or requires warp gate capacity\\n if systemTo.id in systemFrom.warpGateSystems:\\n warpReq = myTradeRoute.getWarpRequired()\\n if warpReq > (systemFrom.availWGC-systemFrom.usedWGC) or warpReq > (systemTo.availWGC-systemTo.usedWGC):\\n cancel = 1\\n elif systemTo.id not in systemFrom.connectedSystems:\\n cancel = 1\\n \\n if (systemFrom.AL >= myTradeRoute.AL and\\n systemFrom.EC >= myTradeRoute.EC and\\n systemFrom.IA >= myTradeRoute.IA and \\n cancel == 0):\\n # process trade route\\n systemFrom.AL -= myTradeRoute.AL\\n systemFrom.EC -= myTradeRoute.EC\\n systemFrom.IA -= myTradeRoute.IA\\n systemTo.AL += myTradeRoute.AL\\n systemTo.EC += myTradeRoute.EC\\n systemTo.IA += myTradeRoute.IA\\n # deduct properly if empires are different\\n empireFrom = self.empires[systemFrom.myEmpireID]\\n empireTo = self.empires[systemTo.myEmpireID]\\n if empireFrom <> empireTo:\\n empireFrom.AL -= myTradeRoute.AL\\n empireFrom.EC -= myTradeRoute.EC\\n empireFrom.IA -= myTradeRoute.IA\\n empireTo.AL += myTradeRoute.AL\\n empireTo.EC += myTradeRoute.EC\\n empireTo.IA += myTradeRoute.IA\\n \\n if warpReq > 0:\\n systemFrom.usedWGC += warpReq\\n systemTo.usedWGC += warpReq\\n \\n # mail trade route completion\\n resultslist.append('Trade from System:%s to System:%s complete' % (systemFrom.id, systemTo.id))\\n self.mailTradeInfo('completed', myTradeRoute, nextRound)\\n else:\\n cancel = 1\\n \\n # check if route should be cancelled\\n if cancel == 1:\\n resultslist.append('cancel trade route=%s' % myTradeRoute.id)\\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\\n elif myTradeRoute.oneTime == 1:\\n resultslist.append('one time trade route=%s' % myTradeRoute.id)\\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\\n \\n return str(resultslist)\\n except:\\n return 'galaxy->processTradeRoutes error'\",\n \"def test_trips_starting_at_a_and_ending_at_c_by_4_stops(self):\\n railroad = trains.Railroad()\\n self.assertEqual(sorted(railroad.find_routes('A', 'C', 4, 4)), sorted(['ABCDC', 'ADCDC', 'ADEBC']))\",\n \"def __init__(__self__, *,\\n description: Optional[pulumi.Input[str]] = None,\\n destination_region_id: Optional[pulumi.Input[str]] = None,\\n destination_zone_id: Optional[pulumi.Input[str]] = None,\\n group_name: Optional[pulumi.Input[str]] = None,\\n rpo: Optional[pulumi.Input[int]] = None,\\n source_region_id: Optional[pulumi.Input[str]] = None,\\n source_zone_id: Optional[pulumi.Input[str]] = None,\\n status: Optional[pulumi.Input[str]] = None):\\n if description is not None:\\n pulumi.set(__self__, \\\"description\\\", description)\\n if destination_region_id is not None:\\n pulumi.set(__self__, \\\"destination_region_id\\\", destination_region_id)\\n if destination_zone_id is not None:\\n pulumi.set(__self__, \\\"destination_zone_id\\\", destination_zone_id)\\n if group_name is not None:\\n pulumi.set(__self__, \\\"group_name\\\", group_name)\\n if rpo is not None:\\n pulumi.set(__self__, \\\"rpo\\\", rpo)\\n if source_region_id is not None:\\n pulumi.set(__self__, \\\"source_region_id\\\", source_region_id)\\n if source_zone_id is not None:\\n pulumi.set(__self__, \\\"source_zone_id\\\", source_zone_id)\\n if status is not None:\\n pulumi.set(__self__, \\\"status\\\", status)\",\n \"def validate(self, *, destination: FieldModel, source: list) -> bool:\\n if not isinstance(source, list):\\n raise ValueError(f\\\"Action source script does not conform to required structure. ({source})\\\")\\n for chunk in self.core.chunks(lst=source, n=len(self.structure)):\\n # Loops through the phrasing of the structure, and checks that each term is as expected\\n # e.g. [ModifierModel, FieldModel] for [modifier1, field1, modifier2, field2]\\n # does not check that the actual terms match, though\\n for i, term in enumerate(self.structure):\\n if isinstance(chunk[i], term):\\n continue\\n elif isinstance(chunk[i], dict):\\n # Nested source\\n if not chunk[i].get(\\\"action\\\") and not not chunk[i].get(\\\"source\\\"):\\n raise ValueError(f\\\"Nested script does not conform to required structure. ({chunk[i]})\\\")\\n chunk[i][\\\"action\\\"].validate(source=chunk[i][\\\"source\\\"])\\n else:\\n raise ValueError(\\n f\\\"Source structure ({chunk}) doesn't conform to ACTION structure requirements ({self.structure}).\\\"\\n )\\n return True\",\n \"def check_paths(self):\\n for path in self.paths:\\n # check that arc starts at s\\n arc = path[0]\\n arc_start = self.arc_info[arc][\\\"start\\\"]\\n assert(arc_start == self.source()), \\\"Path does not start at s\\\"\\n # check that internal arcs are valid\\n for (i, arc) in enumerate(path[:-1]):\\n next_arc = path[i + 1]\\n arc_destin = self.arc_info[arc][\\\"destin\\\"]\\n next_arc_start = self.arc_info[next_arc][\\\"start\\\"]\\n assert (arc_destin == next_arc_start), \\\"Invalid path\\\"\\n arc = path[-1]\\n arc_end = self.arc_info[arc][\\\"destin\\\"]\\n assert(arc_end == self.sink()), \\\"Path does not end at t\\\"\",\n \"def process_departure_fix_list(fix_list, runway, airport, fixes, tagged_routes, base_runway=None):\\r\\n if fix_list:\\r\\n if runway not in tagged_routes:\\r\\n tagged_routes[runway] = {}\\r\\n if airport not in tagged_routes:\\r\\n tagged_routes[airport] = {}\\r\\n if fix_list[0].startswith('@'):\\r\\n tag = fix_list[0].lstrip('@')\\r\\n if tag.startswith('!!'):\\r\\n tag_namespace = None\\r\\n elif tag.startswith('!'):\\r\\n tag_namespace = airport\\r\\n elif runway:\\r\\n tag_namespace = runway\\r\\n else:\\r\\n raise RuntimeError(f\\\"departure tagged {tag} as a runway-specific route, but no runway was specified\\\")\\r\\n tagged_routes[tag_namespace][tag] = fix_list[1:]\\r\\n return None\\r\\n else:\\r\\n if base_runway is not None:\\r\\n runway = base_runway\\r\\n return _process_departure_fix_list(fix_list, runway, airport, fixes, tagged_routes)\",\n \"def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches\\r\\n # Select the inputs to process\\r\\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n self._select_inputs_one_to_one(chunk_definition)\\r\\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n self._get_od_pairs_for_chunk(chunk_definition)\\r\\n self._select_inputs_many_to_many()\\r\\n else:\\r\\n raise NotImplementedError(f\\\"Invalid PreassignedODPairType: {self.pair_type}\\\")\\r\\n\\r\\n # Initialize the Route solver object\\r\\n self.initialize_rt_solver()\\r\\n self._add_unique_id_fields()\\r\\n\\r\\n # Insert the origins and destinations\\r\\n self.logger.debug(f\\\"Route solver fields transferred from Origins: {self.origin_transfer_fields}\\\")\\r\\n self.logger.debug(f\\\"Route solver fields transferred from Destinations: {self.destination_transfer_fields}\\\")\\r\\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n self._insert_stops_one_to_one()\\r\\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n self._insert_stops_many_to_many()\\r\\n else:\\r\\n raise NotImplementedError(f\\\"Invalid PreassignedODPairType: {self.pair_type}\\\")\\r\\n\\r\\n if self.rt_solver.count(arcpy.nax.RouteInputDataType.Stops) == 0:\\r\\n # There were no valid destinations for this set of origins\\r\\n self.logger.debug(\\\"No valid destinations for this set of origins. Skipping Route calculation.\\\")\\r\\n return\\r\\n\\r\\n # Load barriers\\r\\n # Note: This loads ALL barrier features for every analysis, even if they are very far away from any of\\r\\n # the inputs in the current chunk. You may want to select only barriers within a reasonable distance of the\\r\\n # inputs, particularly if you run into the maximumFeaturesAffectedByLineBarriers,\\r\\n # maximumFeaturesAffectedByPointBarriers, and maximumFeaturesAffectedByPolygonBarriers tool limits for portal\\r\\n # solves. However, since barriers is likely an unusual case, deal with this only if it becomes a problem.\\r\\n for barrier_fc in self.barriers:\\r\\n self.logger.debug(f\\\"Loading barriers feature class {barrier_fc}...\\\")\\r\\n shape_type = arcpy.Describe(barrier_fc).shapeType\\r\\n if shape_type == \\\"Polygon\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.PolygonBarriers\\r\\n elif shape_type == \\\"Polyline\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.LineBarriers\\r\\n elif shape_type == \\\"Point\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.PointBarriers\\r\\n else:\\r\\n self.logger.warning(\\r\\n f\\\"Barrier feature class {barrier_fc} has an invalid shape type and will be ignored.\\\"\\r\\n )\\r\\n continue\\r\\n barriers_field_mappings = self.rt_solver.fieldMappings(class_type, True)\\r\\n self.rt_solver.load(class_type, barrier_fc, barriers_field_mappings, True)\\r\\n\\r\\n # Solve the Route analysis\\r\\n self.logger.debug(\\\"Solving Route...\\\")\\r\\n solve_start = time.time()\\r\\n self.solve_result = self.rt_solver.solve()\\r\\n solve_end = time.time()\\r\\n self.logger.debug(f\\\"Solving Route completed in {round(solve_end - solve_start, 3)} seconds.\\\")\\r\\n\\r\\n # Handle solve messages\\r\\n solve_msgs = [msg[-1] for msg in self.solve_result.solverMessages(arcpy.nax.MessageSeverity.All)]\\r\\n for msg in solve_msgs:\\r\\n self.logger.debug(msg)\\r\\n\\r\\n # Update the result dictionary\\r\\n self.job_result[\\\"solveMessages\\\"] = solve_msgs\\r\\n if not self.solve_result.solveSucceeded:\\r\\n self.logger.debug(\\\"Solve failed.\\\")\\r\\n return\\r\\n self.logger.debug(\\\"Solve succeeded.\\\")\\r\\n self.job_result[\\\"solveSucceeded\\\"] = True\\r\\n\\r\\n # Save output\\r\\n self._export_to_feature_class(chunk_definition)\\r\\n\\r\\n self.logger.debug(\\\"Finished calculating Route.\\\")\",\n \"def savings2routes(self,r1,r2):\\n newRoute = VRP_Route(r1.route+r2.route)\\n newRoute.update_route(self.vrpdata) # compute distance, quantity for newRoute, check whether valid\\n if newRoute.tourValid:\\n return r1.distance + r2.distance - newRoute.distance\\n return -1\",\n \"def get_valid_locations(location_list, grid, shape):\",\n \"def __init__(self):\\n\\n self._utils = utils.SearchUtils()\\n self._logger = self._utils.logger\\n\\n self._dms_pattern = (\\n r\\\"\\\\s*(\\\\d+)\\\\s*°\\\\s*(\\\\d+)\\\\s*(?:ʹ|′|')\\\\s*(\\\\d+\\\\.?\\\\d*)\\\\s*(?:ʺ|\\\\\\\"|″)\\\"\\n r\\\"\\\\s*([EWNS])\\\\s*\\\")\\n self._ddm_pattern = (\\n r\\\"\\\\s*(\\\\d+)\\\\s*°\\\\s*(\\\\d+\\\\.?\\\\d*)\\\\s*(?:ʹ|′|')\\\\s*([EWNS])\\\\s*\\\")\\n self._dd_pattern = r\\\"\\\\s*(-?\\\\d+\\\\.?\\\\d*)\\\\s*(?:°)?\\\\s*[EWNS]?\\\"\\n self._mgrs_pattern = r\\\"\\\\s*\\\\d?\\\\d[A-Z]([A-Z][A-Z])?(\\\\d\\\\d){0,5}\\\\s*\\\"\\n self._utm_pattern = (\\n r\\\"(\\\\d?\\\\d)\\\\s*([A-Z])\\\\s*(\\\\d+\\\\.?\\\\d*)\\\\s*M\\\\s*E\\\\s*\\\"\\n r\\\"\\\\s*(\\\\d+\\\\.?\\\\d*)\\\\s*M\\\\s*N\\\\s*\\\")\\n\\n # List of lists for storing the input pattern and types\\n self._input_pattern_types = [\\n [self._dms_pattern, \\\"DMS\\\"],\\n [self._ddm_pattern, \\\"DDM\\\"],\\n [self._utm_pattern, \\\"UTM\\\"],\\n [self._mgrs_pattern, \\\"MGRS\\\"],\\n [self._dd_pattern, \\\"DD\\\"]]\\n\\n self._valid_latitude_directions = [\\\"S\\\", \\\"N\\\"]\\n self._valid_longitude_directions = [\\\"E\\\", \\\"W\\\"]\\n self._dms_negative_directions = [\\\"S\\\", \\\"W\\\"]\\n\\n self._e1 = ((1 - math.sqrt(1- CoordinateTransform.ECC_SQUARED))/\\n (1 + math.sqrt(1- CoordinateTransform.ECC_SQUARED)))\\n self._e1_prime = (\\n CoordinateTransform.ECC_SQUARED/(1 - CoordinateTransform.ECC_SQUARED))\",\n \"def info_for_model(stop_list, stops, route):\\n\\n # Need to know where the bus number 1 and 2 are\\n # This if and elif were put in due to an error where the bus list for bus 1 would come up empty, but not sure if necessary\\n if len(stops[0]) == 0:\\n bus_1 = stops[1][len(stops[1]) - 1]\\n elif len(stops[0]) != 0:\\n bus_1 = stops[0][0]\\n bus_2 = stops[1][0]\\n\\n # Create empty lists to hold the information for each bus\\n stops_bus_1 = []\\n stops_bus_2 = []\\n stops_bus_3 = []\\n\\n # Ste bus_number to 3, we will start filling the buses from the end, the last bus first\\n bus_number = 3\\n\\n # Populate our lists\\n for i in stops[len(stops) - 1]:\\n # Get the times for the buses at the given stop\\n first_3_buses = get_due_time(str(i), route)\\n\\n if len(first_3_buses) == 0:\\n # print('Something went wrong!')\\n continue\\n # Add in the delay\\n get_delay(first_3_buses)\\n\\n # Have to check if the bus it at the first stop, in which case, we just say 'Starting stop' for previous_stop\\n if i == stop_list[0]:\\n previous_stop = 'Starting stop'\\n # Else, we get the previous stop\\n else:\\n previous_stop = stop_list[stop_list.index(i) - 1]\\n\\n # If the bus is the last one, we will only append to bus_number_3\\n if bus_number == 3:\\n # If we reach the stop where bus number 2 is, we must append this stop to both bus_number_3 and bus_number2 and\\n # decrease the bus_number counter\\n if i == bus_2:\\n bus_number -= 1\\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[1]['delay'], 'arrival_hour':first_3_buses[1]['arrivaldatetime'][11:13], 'datetime':first_3_buses[1]['arrivaldatetime'], 'previous_stop':previous_stop})\\n stops_bus_2.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\\n else:\\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\\n\\n # Now, we keep adding bus 2 and bus 3\\n elif bus_number == 2:\\n # If we reach the stop where bus number 1 is, we must append this stop to both bus_number_3 and bus_number2 and\\n # bus_number1 and decrease the bus_number counter\\n if i == bus_1:\\n bus_number -= 1\\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[2]['delay'], 'arrival_hour':first_3_buses[2]['arrivaldatetime'][11:13], 'datetime':first_3_buses[2]['arrivaldatetime'], 'previous_stop':previous_stop})\\n stops_bus_2.append({'stopid':i, 'delay':first_3_buses[1]['delay'], 'arrival_hour':first_3_buses[1]['arrivaldatetime'][11:13], 'datetime':first_3_buses[1]['arrivaldatetime'], 'previous_stop':previous_stop})\\n stops_bus_1.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\\n else:\\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[1]['delay'], 'arrival_hour':first_3_buses[1]['arrivaldatetime'][11:13], 'datetime':first_3_buses[1]['arrivaldatetime'], 'previous_stop':previous_stop})\\n stops_bus_2.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\\n\\n # Here, we are now appending all the buses, until we finally reach the source stop\\n elif bus_number == 1:\\n stops_bus_3.append({'stopid':i, 'delay':first_3_buses[2]['delay'], 'arrival_hour':first_3_buses[2]['arrivaldatetime'][11:13], 'datetime':first_3_buses[2]['arrivaldatetime'], 'previous_stop':previous_stop})\\n stops_bus_2.append({'stopid':i, 'delay':first_3_buses[1]['delay'], 'arrival_hour':first_3_buses[1]['arrivaldatetime'][11:13], 'datetime':first_3_buses[1]['arrivaldatetime'], 'previous_stop':previous_stop})\\n stops_bus_1.append({'stopid':i, 'delay':first_3_buses[0]['delay'], 'arrival_hour':first_3_buses[0]['arrivaldatetime'][11:13], 'datetime':first_3_buses[0]['arrivaldatetime'], 'previous_stop':previous_stop})\\n joined = [stops_bus_1, stops_bus_2, stops_bus_3]\\n return joined\",\n \"def _validate_columns(data, ip_column, lat_column, long_column, other_columns):\\n if not ip_column and not (lat_column and long_column):\\n raise ValueError(\\n \\\"Data must have either an IpAddress ('ip_column')\\\",\\n \\\"or latitude ('lat_column') and longitude ('long_column')\\\",\\n )\\n param_cols: List[str] = []\\n for param in other_columns:\\n if not param:\\n continue\\n if isinstance(param, list):\\n param_cols.extend(param)\\n else:\\n param_cols.append(param)\\n missing_columns = {col for col in param_cols if col not in data.columns}\\n if missing_columns:\\n raise LookupError(\\n \\\"The following columns are not in the supplied DataFrame\\\",\\n \\\",\\\".join(f\\\"'{col}'\\\" for col in missing_columns),\\n )\",\n \"def _validate_trajectory_transition(subgaits, from_subgait_names, to_subgait_names):\\n for from_subgait_name, to_subgait_name in zip(from_subgait_names, to_subgait_names):\\n\\n if not all(name not in ('start', 'end', None) for name in (from_subgait_name, to_subgait_name)):\\n continue # a start or end point can not be compared to a subgait\\n\\n from_subgait = next((subgait for subgait in subgaits if subgait.subgait_name == from_subgait_name), None)\\n to_subgait = next((subgait for subgait in subgaits if subgait.subgait_name == to_subgait_name), None)\\n\\n if not from_subgait.validate_subgait_transition(to_subgait):\\n raise NonValidGaitContent(msg='End setpoint of subgait {sn} to subgait {ns} does not match'\\n .format(sn=from_subgait.subgait_name, ns=to_subgait.subgait_name))\",\n \"def validate(self) -> bool:\\n required = self.crud.validate(required=True)\\n if required:\\n raise ValueError(\\n f\\\"Validation error. Required destination fields are not present in the crosswalk: {required}\\\"\\n )\",\n \"def testPossibleSitesLocationFlags(self):\\n ele = WorkQueueElement(SiteWhitelist=[\\\"T1_IT_CNAF\\\", \\\"T2_DE_DESY\\\"])\\n\\n # test element with InputDataset and no location, but input flag on\\n ele['Inputs'] = {\\\"/MY/BLOCK/NAME#73e99a52\\\": []}\\n ele['NoInputUpdate'] = True\\n self.assertItemsEqual(possibleSites(ele), [\\\"T1_IT_CNAF\\\", \\\"T2_DE_DESY\\\"])\\n # test element with InputDataset and one match, but input flag on\\n ele['Inputs'] = {\\\"/MY/BLOCK/NAME#73e99a52\\\": [\\\"T1_IT_CNAF\\\", \\\"T2_CH_CERN\\\"]}\\n self.assertItemsEqual(possibleSites(ele), [\\\"T1_IT_CNAF\\\", \\\"T2_DE_DESY\\\"])\\n # test element with InputDataset and one match, but pu flag on\\n ele['NoInputUpdate'] = False\\n ele['NoPileupUpdate'] = True\\n self.assertEqual(possibleSites(ele), [\\\"T1_IT_CNAF\\\"])\\n # test element with InputDataset and one match, but both flags on\\n ele['NoInputUpdate'] = True\\n self.assertItemsEqual(possibleSites(ele), [\\\"T1_IT_CNAF\\\", \\\"T2_DE_DESY\\\"])\\n\\n # test element with InputDataset and ParentData and no location, but both flags on\\n ele['ParentFlag'] = True\\n ele['ParentData'] = {\\\"/MY/BLOCK2/NAME#002590494c06\\\": []}\\n self.assertItemsEqual(possibleSites(ele), [\\\"T1_IT_CNAF\\\", \\\"T2_DE_DESY\\\"])\\n # test element with InputDataset and ParentData and no location, but input flag on\\n ele['NoPileupUpdate'] = False\\n self.assertItemsEqual(possibleSites(ele), [\\\"T1_IT_CNAF\\\", \\\"T2_DE_DESY\\\"])\\n # test element with InputDataset and ParentData and no location, but pileup flag on\\n ele['NoInputUpdate'] = False\\n ele['NoPileupUpdate'] = True\\n self.assertEqual(possibleSites(ele), [])\\n\\n # test element with InputDataset, PileupData and ParentData with no location, but pileup flag on\\n ele['Inputs'] = {\\\"/MY/BLOCK/NAME#73e99a52\\\": [\\\"T1_US_FNAL\\\", \\\"T2_CH_CERN\\\", \\\"T2_DE_DESY\\\"]}\\n ele['ParentData'] = {\\\"/MY/BLOCK2/NAME#002590494c06\\\": [\\\"T2_DE_DESY\\\"]}\\n ele['PileupData'] = {\\\"/MY/DATASET/NAME\\\": []}\\n self.assertEqual(possibleSites(ele), [\\\"T2_DE_DESY\\\"])\\n # test element with InputDataset, PileupData and ParentData with no location, but both flags on\\n ele['NoInputUpdate'] = True\\n self.assertItemsEqual(possibleSites(ele), [\\\"T1_IT_CNAF\\\", \\\"T2_DE_DESY\\\"])\\n # test element with InputDataset, PileupData and ParentData with no location, but input flag on\\n ele['NoPileupUpdate'] = False\\n self.assertEqual(possibleSites(ele), [])\",\n \"def roadSegments(locations, API_key=\\\"Avah46_M-gfFeQ3P1w09Qq1ElAV9ZEHFDm9b8JRCRa8qPP5uVn21hDqAPVJgV4i_\\\"): \\n \\n # Base URL\\n uri = 'http://dev.virtualearth.net/' # Resource URL \\n path = 'REST/v1/Routes?'\\n \\n \\n # URL Parameters\\n params = { 'wayPoint.0' : locations[0]+',Singapore',\\n 'wayPoint.1' : locations[1]+',Singapore',\\n 'routeAttributes':'routePath',\\n 'key' : API_Key} # by default 'optimize' : 'time'} # this is by default\\n \\n url = uri+path\\n\\n results = requests.get(\\n url,\\n params = params\\n ).json()# ['resourceSets']\\n\\n # Retrieving values\\n statusCode = results['statusCode']\\n if statusCode == 200:\\n # print(statusCode)\\n\\n # TODO review the exceptions and modify these basic exception handlings\\n try:\\n travelDistance = results['resourceSets'][0]['resources'][0]['travelDistance']\\n except:\\n travelDistance = 0\\n try:\\n travelDuration = results['resourceSets'][0]['resources'][0]['travelDuration']\\n except:\\n travelDuration = 0\\n try:\\n travelDurationTraffic = results['resourceSets'][0]['resources'][0]['travelDurationTraffic']\\n except:\\n travelDurationTraffic = 0\\n\\n try:\\n numberSegments = len(results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\\\\n ['itineraryItems'])\\n except:\\n numberSegments = 0\\n try:\\n itineraryItems = results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\\\\n ['itineraryItems']\\n except:\\n itineraryItems = 'No items'\\n\\n pathCoord = results['resourceSets'][0]['resources'][0]['routePath']['line']['coordinates']\\n\\n roadName = []\\n travelDistances = []\\n travelDurations = []\\n maneuverType = []\\n\\n for seg in itineraryItems:\\n for i in range(len(seg['details'])):\\n # print(i)\\n try:\\n roadName.append(seg['details'][i]['names'])\\n except:\\n roadName.append(0)\\n try:\\n travelDistances.append(seg['travelDistance'])\\n except:\\n travelDistances.append(0)\\n\\n try:\\n travelDurations.append(seg['travelDuration'])\\n except:\\n travelDurations.append(0)\\n try:\\n maneuverType.append(seg['details'][i]['maneuverType'])\\n except:\\n maneuverType.append(0)\\n\\n\\n return statusCode,travelDistance,travelDuration,travelDurationTraffic,numberSegments,roadName, \\\\\\n travelDistances, travelDurations, maneuverType, pathCoord\\n\\n else:\\n print(\\\"Unsuccessful route calculation.\\\")\",\n \"def __init__(self, route_idx=None, arr_date=None, dep_time=None, lon=None, dep_date=None, track=None, rt_track=None, id=None, rt_dep_time=None, rt_arr_time=None, name=None, arr_time=None, lat=None, rt_dep_date=None, rt_arr_date=None):\\n\\n self._route_idx = None\\n self._arr_date = None\\n self._dep_time = None\\n self._lon = None\\n self._dep_date = None\\n self._track = None\\n self._rt_track = None\\n self._id = None\\n self._rt_dep_time = None\\n self._rt_arr_time = None\\n self._name = None\\n self._arr_time = None\\n self._lat = None\\n self._rt_dep_date = None\\n self._rt_arr_date = None\\n\\n self.route_idx = route_idx\\n if arr_date is not None:\\n self.arr_date = arr_date\\n if dep_time is not None:\\n self.dep_time = dep_time\\n self.lon = lon\\n if dep_date is not None:\\n self.dep_date = dep_date\\n self.track = track\\n if rt_track is not None:\\n self.rt_track = rt_track\\n self.id = id\\n if rt_dep_time is not None:\\n self.rt_dep_time = rt_dep_time\\n if rt_arr_time is not None:\\n self.rt_arr_time = rt_arr_time\\n self.name = name\\n if arr_time is not None:\\n self.arr_time = arr_time\\n self.lat = lat\\n if rt_dep_date is not None:\\n self.rt_dep_date = rt_dep_date\\n if rt_arr_date is not None:\\n self.rt_arr_date = rt_arr_date\",\n \"def _check_polyline(x_coords_metres, y_coords_metres):\\n\\n error_checking.assert_is_numpy_array_without_nan(x_coords_metres)\\n error_checking.assert_is_numpy_array(x_coords_metres, num_dimensions=1)\\n num_vertices = len(x_coords_metres)\\n\\n error_checking.assert_is_numpy_array_without_nan(y_coords_metres)\\n error_checking.assert_is_numpy_array(\\n y_coords_metres, exact_dimensions=numpy.array([num_vertices]))\",\n \"def coalesce_helper(self, netmask, routes):\\n # decrement netmask by 1\\n netmask = netmask - 1\\n routes_checked = []\\n # iterate through every route combination\\n for r1 in routes:\\n for r2 in routes:\\n # skip if routes are same, already checked, or source IPs arent matching\\n if r1 == r2 or r2 in routes_checked or r1[SRC_IF] != r2[SRC_IF]:\\n continue\\n # calculate route 1's network prefix and pad until 32 bits\\n r1_network = self.ip_to_binary(r1[MESG][NTWK])\\n r1_netmask = self.ip_to_binary(r1[MESG][NMSK]).count('1')\\n r1_prefix = self.pad_end(r1_network[:r1_netmask], '0', IP4_BIT_MAX)\\n # calculate route 2's network prefix and pad until 32 bits\\n r2_network = self.ip_to_binary(r2[MESG][NTWK])\\n r2_netmask = self.ip_to_binary(r2[MESG][NMSK]).count('1')\\n r2_prefix = self.pad_end(r2_network[:r2_netmask], '0', IP4_BIT_MAX)\\n # check if same next-hop router\\n if r1_prefix[:netmask] == r2_prefix[:netmask]:\\n # check if other attributes are matching\\n if (r1[MESG][LPRF] == r2[MESG][LPRF] and r1[MESG][ORIG] == r2[MESG][ORIG]\\n and r1[MESG][APTH] == r2[MESG][APTH] and r1[MESG][SORG] == r2[MESG][SORG]\\n and r1[MESG][SORG] == r2[MESG][SORG]):\\n # remove unnecessary route\\n self.routes.remove(r2)\\n # update netmask for keeper route\\n base_bits = self.pad_end('', '1', netmask)\\n final_bits = self.pad_end(base_bits, '0', IP4_BIT_MAX)\\n r1[MESG][NMSK] = self.binary_to_ip(final_bits)\\n #Check if the new netmask is able to aggregate with another\\n recheck_routes = []\\n r1_nmsk = final_bits.count('1')\\n for r in self.routes:\\n r_nmsk = self.ip_to_binary(r[MESG][NMSK]).count('1')\\n if r1_nmsk == r_nmsk:\\n recheck_routes.append(r)\\n recheck_routes.append(r1)\\n self.coalesce_helper(r_nmsk, recheck_routes)\\n # done checking, add to routes checked list\\n routes_checked.append(r1)\",\n \"def run_travel_optimisation(trip_start_date, is_min_co2_search = False, is_force_compute = False):\\n \\n waypoint_co2 = {}\\n waypoint_durations = {}\\n\\n # get all prefectures referential\\n db_connector = Connector()\\n with db_connector:\\n results = db_connector.execute_query(sql.SQL_GET_ALL_PREFECTURE)\\n all_waypoints = pd.DataFrame(results.fetchall())\\n\\n # Vérification si les trajets péfecture à préfecture ont été déjà calculés\\n db_connector = Connector()\\n with db_connector:\\n saved_waypoints = db_connector.execute_query(sql.SQL_GET_WAYPOINTS)\\n\\n # Dans le précalcul des trajets optimaux, utilisation de la date courante\\n travel_date = datetime.now().strftime(\\\"%Y%m%dT%H%M%S\\\")\\n bad_waypoints = []\\n\\n if saved_waypoints.rowcount > 0 and not is_force_compute:\\n print(\\\"le référentiel des voyage existe déjà\\\")\\n else:\\n try:\\n bdd_management.truncate_journey()\\n\\n for (from_city, to_city) in combinations(all_waypoints[0].values, 2):\\n try:\\n if int(from_city) in bad_waypoints or int(to_city) in bad_waypoints:\\n continue\\n\\n route = requests.get(API_NAVITIA.format(\\n int(from_city), int(to_city), travel_date, API_KEY))\\n response = json.loads(route.text)\\n\\n mid_duration = 0\\n mid_co2 = 0\\n for journey in response[\\\"journeys\\\"]:\\n mid_duration += journey[\\\"duration\\\"]\\n mid_co2 += journey[\\\"co2_emission\\\"][\\\"value\\\"]\\n\\n waypoint_co2[frozenset([from_city, to_city])\\n ] = mid_co2/len(response[\\\"journeys\\\"])\\n waypoint_durations[frozenset(\\n [from_city, to_city])] = mid_duration/len(response[\\\"journeys\\\"])\\n\\n except Exception as e:\\n print(\\\"Error with finding the route between %s and %s : %s\\\" %\\n (from_city, to_city, response[\\\"error\\\"][\\\"message\\\"]))\\n if 'no destination point' == response[\\\"error\\\"][\\\"message\\\"]:\\n bad_waypoints.append(int(to_city))\\n\\n if 'no origin point' == response[\\\"error\\\"][\\\"message\\\"]:\\n bad_waypoints.append(int(from_city))\\n\\n for bad_insee_code in re.findall('The entry point: admin:fr:([0-9]+) is not valid', response[\\\"error\\\"][\\\"message\\\"]):\\n if not int(bad_insee_code) in bad_waypoints:\\n bad_waypoints.append(int(bad_insee_code))\\n\\n # Enregistrement des trajets point à point (préfecture à préfecture)\\n db_connector = Connector()\\n with db_connector:\\n for (waypoint1, waypoint2) in waypoint_co2.keys():\\n waypoint = [waypoint1,\\n waypoint2,\\n str(waypoint_co2[frozenset([waypoint1, waypoint2])]),\\n str(int(waypoint_durations[frozenset([waypoint1, waypoint2])]))]\\n \\n db_connector.execute_nonquery(sql.SQL_INSERT_WAYPOINT, waypoint)\\n # commit trajets unitaires dans la bdd\\n db_connector.commit()\\n\\n # enregistrement des préfectures non trouvée (pas de gare)\\n print(bad_waypoints)\\n db_connector = Connector()\\n with db_connector:\\n for bad_city in bad_waypoints:\\n db_connector.execute_nonquery(\\n sql.SQL_INSERT_CITY_WITHOUT_STATION, str(bad_city))\\n #db_connector.commit()\\n except Exception as e:\\n print('Erreur durant la génération des trajets de préfecture en préfecture. Rollback effectué')\\n\\n waypoint_co2 = {}\\n waypoint_durations = {}\\n processed_waypoints = set()\\n\\n db_connector = Connector()\\n with db_connector:\\n waypoints = db_connector.execute_query(sql.SQL_GET_WAYPOINTS)\\n\\n for row in waypoints:\\n waypoint_co2[frozenset([int(row[0]), int(row[1])])] = row[2]\\n waypoint_durations[frozenset([int(row[0]), int(row[1])])] = row[3]\\n processed_waypoints.update([row[0], row[1]])\\n\\n travel_results = algorithms.run_genetic_algorithm(waypoints = list(processed_waypoints), is_min_co2_search = is_min_co2_search, generations=300, population_size=100 )\\n\\n # take most represented trip order\\n journey_groups = Counter(chain(*travel_results))\\n top_journeys = journey_groups.most_common(1)[0][0]\\n\\n print('Le voyage le plus représentatif est :')\\n print(top_journeys)\\n\\n # calcul des horaires de voyage réels pour le trajet le plus optimisé\\n\\n print('Départ du calcul du voyage le %s' %\\n (datetime_str_to_datetime_str(trip_start_date)))\\n travel_date = trip_start_date\\n\\n db_connector = Connector()\\n with db_connector:\\n try:\\n #vidage de la table contenant les informations du voyage\\n bdd_management.truncate_roadtrip()\\n\\n for i in range(len(top_journeys)-1):\\n try:\\n from_city_insee = top_journeys[i]\\n to_city_insee = top_journeys[i+1]\\n route = requests.get(API_NAVITIA.format(\\n int(from_city_insee), int(to_city_insee), travel_date, API_KEY))\\n travels = json.loads(route.text)\\n\\n # Contrôle des voyage reçus pour identifier le plus adapté à recherche\\n best_travel = travels[\\\"journeys\\\"][0]\\n for travel in travels[\\\"journeys\\\"]:\\n if is_min_co2_search and float(best_travel['co2_emission']['value']) > float(travel['co2_emission']['value']):\\n best_travel = travel\\n if best_travel['arrival_date_time'] > travel['arrival_date_time']:\\n best_travel = travel\\n\\n # sauvegarde du trajet 'i' en base\\n save_trip_section(db_connector, all_waypoints, from_city_insee, to_city_insee, best_travel)\\n\\n # le prochain trajet devra avoir une date de départ > à la date de ce trajet\\n travel_date = best_travel['arrival_date_time']\\n\\n except Exception as e:\\n print(\\\"!! Erreur durant le calcul du trajet entre '%s' et '%s'\\\" %\\n (from_city_insee, to_city_insee))\\n\\n #Ecriture du résumé du voyage\\n resume = db_connector.execute_query(sql.SQL_GET_C02_CONSUMPTION_RESUME)\\n resume = resume.fetchone()\\n\\n resume_description = \\\"\\\"\\\"Début du voyage le {} . Arrivée le {}. \\n Le voyage à durée {} pour un total de {:d} kgeC\\\"\\\"\\\".format(\\n datetime_str_to_datetime_str(trip_start_date),\\n datetime_str_to_datetime_str(travel_date),\\n str(timedelta(seconds=resume[0])) ,\\n trunc( resume[1]/1000))\\n\\n store_section(db_connector, resume_description, None, None, 'INFO', resume[0], resume[1])\\n\\n db_connector.commit()\\n\\n except Exception as e:\\n db_connector.rollback()\\n print('Erreur durant la création du voyage. rollback effectué!!!')\\n\\n print('print map with road-trip data')\\n visualization.generate_visualization()\\n\\n print('Travel complete. Have nive trip!!!')\",\n \"def analyseCoordination(self):\\n #create a list of criteria that correspond to maximal path length\\n #max_path_length = max(self.pathLengths)\\n\\n #criterion_max_path_length = []\\n #origins_max_path_length = []\\n #for c in range(len(self.pathLengths)):\\n # if self.pathLengths[c] == max_path_length:\\n # criterion_max_path_length.append(self.globalMin[c])\\n # origins_max_path_length.append(self.origins[c])\\n\\n #min_criterion = min(criterion_max_path_length)\\n\\n #find index\\n #for m in range(len(criterion_max_path_length)):\\n # if criterion_max_path_length[m] == min_criterion:\\n # break\\n\\n #for s in range(len(self.origins)):\\n # if self.origins[s] == origins_max_path_length[m]:\\n # break\\n\\n min_criterion = self.globalMin[0]\\n self.overall_min = min_criterion\\n self.overall_max_path_length = len(self.min_path[0])\\n\\n if self.chosenScheduleIndex != self.globalMinSchedIdx[0]:\\n self.chosenScheduleIndex = self.globalMinSchedIdx[0]\\n self.chosenSchedule = self.schedules[self.chosenScheduleIndex]\\n self.EConsumptionChosenSchedule = self.EConsumptionScheduleCurves[self.chosenScheduleIndex]\\n # update SOC\\n self.setSOC(self.SOCEnd[self.chosenScheduleIndex])\\n # update modulation level\\n self.setStateModlvl(self.chosenSchedule[-1])\\n\\n\\n # inform all neighbors about origin that has local minimal criterion\\n for n in range(len(self.Neighbors)):\\n #structure: ['minimalorigin', ID_minimal_origin, minimal_criterion_value]\\n #self.sendMessage(self.Neighbors[n], 70, ['minimalorigin', copy.deepcopy(origins_max_path_length[m]), copy.deepcopy(min_criterion), copy.deepcopy(self.min_path[s]), copy.deepcopy(self.min_path_schedules[s])])\\n self.sendMessage(self.Neighbors[n], 70, ['minimalorigin', copy.deepcopy(self.CommID), copy.deepcopy(min_criterion), copy.deepcopy(self.min_path[0]), copy.deepcopy(self.min_path_schedules[0])])\\n\\n if self.OPTcriterion == 'maxmindiff':\\n fluct_criterion = max(self.EFluctuationCurve) - min(self.EFluctuationCurve)\\n elif self.OPTcriterion == 'absremainder':\\n fluct_criterion = 0\\n for a in range(len(self.EFluctuationCurve)):\\n fluct_criterion += abs(self.EFluctuationCurve[a])\\n\\n\\n #print 'ID {0}: criterion is: {1} , of origin {4}, path length: {2}, schedules: {5}, with improvement of {3} %'.format(self.CommID, min_criterion, len(self.min_path[s]), 100 - 100*(float((float(min_criterion))/float(fluct_max_min_diff))), origins_max_path_length[m], self.min_path_schedules[s] )\\n self.log_message('ID {0}: criterion is: {1} , of origin {4}, path length: {2}, schedules: {5}, with improvement of {3} %'.format(self.CommID, min_criterion, len(self.min_path[0]), 100 - 100*(float((float(min_criterion))/float(fluct_criterion))), self.CommID, self.min_path_schedules[0] ))\",\n \"def _parse_departures(self, data, stop, servernow):\\n servernow.replace(second=0, microsecond=0)\\n results = []\\n departures = data.findall('./itdDeparture')\\n for departure in departures:\\n # Get Line Information\\n origin, destination, line, ridenum, ridedir, canceled = self._parse_mot(departure.find('./itdServingLine'))\\n\\n if departure.find('./genAttrList/genAttrElem[value=\\\"HIGHSPEEDTRAIN\\\"]') is not None:\\n line.linetype = LineType('train.longdistance.highspeed')\\n elif departure.find('./genAttrList/genAttrElem[value=\\\"LONG_DISTANCE_TRAINS\\\"]') is not None:\\n line.linetype = LineType('train.longdistance')\\n\\n # if ridenum is None:\\n # ridedata = departure.find('./itdServingTrip')\\n # if ridedata is not None:\\n # ridenum = ridedata.attrib.get('tripCode', None)\\n # if ridenum is not None:\\n # ridenum = ridenum.strip()\\n\\n # Build Ride Objekt with known stops\\n ride = Ride(line, ridenum)\\n ride.direction = ridedir\\n ride.canceled = canceled\\n\\n train_line = line.linetype in self.train_station_lines\\n\\n # todo: take delay and add it to next stops\\n mypoint = self._parse_trip_point(departure, train_line=train_line)\\n\\n before_delay = None\\n if mypoint.arrival:\\n before_delay = mypoint.arrival.delay\\n after_delay = None\\n if mypoint.departure:\\n after_delay = mypoint.departure.delay\\n\\n delay = None\\n if departure.find('./itdServingLine/itdNoTrain'):\\n delay = departure.find('./itdServingLine/itdNoTrain').attrib.get('delay', None)\\n if delay is not None:\\n delay = timedelta(minutes=delay)\\n\\n if delay is not None:\\n if (mypoint.arrival and servernow < mypoint.arrival.livetime) or (mypoint.departure and servernow < mypoint.departure.livetime):\\n before_delay = delay\\n else:\\n after_delay = delay\\n\\n prevs = False\\n for pointdata in departure.findall('./itdPrevStopSeq/itdPoint'):\\n point = self._parse_trip_point(pointdata, train_line=train_line)\\n if point is not None:\\n if before_delay is not None:\\n if point.arrival is not None and point.arrival.delay is None and point.arrival.time + before_delay >= servernow:\\n point.arrival.delay = before_delay\\n if point.departure is not None and point.departure.delay is None and point.departure.time + before_delay >= servernow:\\n point.departure.delay = before_delay\\n prevs = True\\n ride.append(point)\\n\\n pointer = ride.append(mypoint)\\n\\n onwards = False\\n for pointdata in departure.findall('./itdOnwardStopSeq/itdPoint'):\\n point = self._parse_trip_point(pointdata, train_line=train_line)\\n if point is not None:\\n if after_delay is not None:\\n if point.arrival is not None and point.arrival.delay is None and point.arrival.time + after_delay >= servernow:\\n point.arrival.delay = after_delay\\n if point.departure is not None and point.departure.delay is None and point.departure.time + after_delay >= servernow:\\n point.departure.delay = after_delay\\n onwards = True\\n ride.append(point)\\n\\n if not prevs and not onwards:\\n ride.prepend(None)\\n if origin is not None:\\n ride.prepend(TimeAndPlace(Platform(origin)))\\n\\n ride.append(None)\\n if destination is not None:\\n ride.append(TimeAndPlace(Platform(destination)))\\n\\n # Return RideSegment from the Station we depart from on\\n results.append(ride[pointer:])\\n return Ride.Results(results)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6113399","0.5643113","0.54353887","0.5379565","0.5359705","0.53044266","0.5218753","0.5165528","0.51130545","0.5098658","0.5056272","0.5042018","0.50327575","0.5018349","0.50022423","0.49981675","0.49830243","0.49737117","0.49564588","0.4953842","0.4924345","0.4917949","0.49014866","0.48645994","0.4860535","0.4841463","0.48041278","0.47955987","0.47941554","0.47916156","0.47796628","0.4764645","0.47489432","0.4743729","0.47377113","0.4730246","0.47172463","0.47106752","0.47071373","0.47024453","0.4700851","0.46986845","0.46893647","0.4660571","0.46493804","0.46454594","0.46424076","0.46366444","0.4631169","0.46273604","0.46260473","0.4621468","0.4608468","0.4596233","0.45948556","0.45942777","0.45890737","0.4582906","0.45815352","0.4581336","0.45637","0.4558393","0.455638","0.45503503","0.4546487","0.4541943","0.4533546","0.45312437","0.4530331","0.4529895","0.45248944","0.45241934","0.45241934","0.45241714","0.4521176","0.4518772","0.4517988","0.45164606","0.45139936","0.4509129","0.45084268","0.45070317","0.45033896","0.45005926","0.4498953","0.4497077","0.4496484","0.44942656","0.4486236","0.44772097","0.44752535","0.4473414","0.4470767","0.44618616","0.4460617","0.445731","0.44548145","0.44524792","0.44514057","0.44464836"],"string":"[\n \"0.6113399\",\n \"0.5643113\",\n \"0.54353887\",\n \"0.5379565\",\n \"0.5359705\",\n \"0.53044266\",\n \"0.5218753\",\n \"0.5165528\",\n \"0.51130545\",\n \"0.5098658\",\n \"0.5056272\",\n \"0.5042018\",\n \"0.50327575\",\n \"0.5018349\",\n \"0.50022423\",\n \"0.49981675\",\n \"0.49830243\",\n \"0.49737117\",\n \"0.49564588\",\n \"0.4953842\",\n \"0.4924345\",\n \"0.4917949\",\n \"0.49014866\",\n \"0.48645994\",\n \"0.4860535\",\n \"0.4841463\",\n \"0.48041278\",\n \"0.47955987\",\n \"0.47941554\",\n \"0.47916156\",\n \"0.47796628\",\n \"0.4764645\",\n \"0.47489432\",\n \"0.4743729\",\n \"0.47377113\",\n \"0.4730246\",\n \"0.47172463\",\n \"0.47106752\",\n \"0.47071373\",\n \"0.47024453\",\n \"0.4700851\",\n \"0.46986845\",\n \"0.46893647\",\n \"0.4660571\",\n \"0.46493804\",\n \"0.46454594\",\n \"0.46424076\",\n \"0.46366444\",\n \"0.4631169\",\n \"0.46273604\",\n \"0.46260473\",\n \"0.4621468\",\n \"0.4608468\",\n \"0.4596233\",\n \"0.45948556\",\n \"0.45942777\",\n \"0.45890737\",\n \"0.4582906\",\n \"0.45815352\",\n \"0.4581336\",\n \"0.45637\",\n \"0.4558393\",\n \"0.455638\",\n \"0.45503503\",\n \"0.4546487\",\n \"0.4541943\",\n \"0.4533546\",\n \"0.45312437\",\n \"0.4530331\",\n \"0.4529895\",\n \"0.45248944\",\n \"0.45241934\",\n \"0.45241934\",\n \"0.45241714\",\n \"0.4521176\",\n \"0.4518772\",\n \"0.4517988\",\n \"0.45164606\",\n \"0.45139936\",\n \"0.4509129\",\n \"0.45084268\",\n \"0.45070317\",\n \"0.45033896\",\n \"0.45005926\",\n \"0.4498953\",\n \"0.4497077\",\n \"0.4496484\",\n \"0.44942656\",\n \"0.4486236\",\n \"0.44772097\",\n \"0.44752535\",\n \"0.4473414\",\n \"0.4470767\",\n \"0.44618616\",\n \"0.4460617\",\n \"0.445731\",\n \"0.44548145\",\n \"0.44524792\",\n \"0.44514057\",\n \"0.44464836\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.69479537"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94758,"cells":{"query":{"kind":"string","value":"Solve the Route in chunks and postprocess the results."},"document":{"kind":"string","value":"def solve_route_in_parallel(self):\r\n # Validate Route settings. Essentially, create a dummy Route class instance and set up the\r\n # solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes\r\n # that are guaranteed to all fail.\r\n self._validate_route_settings()\r\n\r\n # Check if the input origins and destinations have any fields we should use in the route analysis\r\n self._populate_input_data_transfer_fields()\r\n\r\n # Compute Route in parallel\r\n LOGGER.info(f\"Beginning parallelized Route solves ({self.total_jobs} chunks)\")\r\n completed_jobs = 0 # Track the number of jobs completed so far to use in logging\r\n # Use the concurrent.futures ProcessPoolExecutor to spin up parallel processes that solve the routes\r\n with futures.ProcessPoolExecutor(max_workers=self.max_processes) as executor:\r\n # Each parallel process calls the solve_route() function with the rt_inputs dictionary for the\r\n # given origin ranges and their assigned destinations.\r\n jobs = {executor.submit(solve_route, self.rt_inputs, range): range for range in self.chunks}\r\n # As each job is completed, add some logging information and store the results to post-process later\r\n for future in futures.as_completed(jobs):\r\n try:\r\n # The Route job returns a results dictionary. Retrieve it.\r\n result = future.result()\r\n except Exception: # pylint: disable=broad-except\r\n # If we couldn't retrieve the result, some terrible error happened and the job errored.\r\n # Note: This does not mean solve failed. It means some unexpected error was thrown. The most likely\r\n # causes are:\r\n # a) If you're calling a service, the service was temporarily down.\r\n # b) You had a temporary file read/write or resource issue on your machine.\r\n # c) If you're actively updating the code, you introduced an error.\r\n # To make the tool more robust against temporary glitches, retry submitting the job up to the number\r\n # of times designated in helpers.MAX_RETRIES. If the job is still erroring after that many retries,\r\n # fail the entire tool run.\r\n errs = traceback.format_exc().splitlines()\r\n failed_range = jobs[future]\r\n LOGGER.debug((\r\n f\"Failed to get results for Route chunk {failed_range} from the parallel process. Will retry \"\r\n f\"up to {helpers.MAX_RETRIES} times. Errors: {errs}\"\r\n ))\r\n job_failed = True\r\n num_retries = 0\r\n while job_failed and num_retries < helpers.MAX_RETRIES:\r\n num_retries += 1\r\n try:\r\n future = executor.submit(solve_route, self.rt_inputs, failed_range)\r\n result = future.result()\r\n job_failed = False\r\n LOGGER.debug(f\"Route chunk {failed_range} succeeded after {num_retries} retries.\")\r\n except Exception: # pylint: disable=broad-except\r\n # Update exception info to the latest error\r\n errs = traceback.format_exc().splitlines()\r\n if job_failed:\r\n # The job errored and did not succeed after retries. Fail the tool run because something\r\n # terrible is happening.\r\n LOGGER.debug(f\"Route chunk {failed_range} continued to error after {num_retries} retries.\")\r\n LOGGER.error(\"Failed to get Route result from parallel processing.\")\r\n errs = traceback.format_exc().splitlines()\r\n for err in errs:\r\n LOGGER.error(err)\r\n raise\r\n\r\n # If we got this far, the job completed successfully and we retrieved results.\r\n completed_jobs += 1\r\n LOGGER.info(\r\n f\"Finished Route calculation {completed_jobs} of {self.total_jobs}.\")\r\n\r\n # Parse the results dictionary and store components for post-processing.\r\n if result[\"solveSucceeded\"]:\r\n self.route_fcs.append(result[\"outputRoutes\"])\r\n else:\r\n # Typically, a solve fails because no destinations were found for any of the origins in the chunk,\r\n # and this is a perfectly legitimate failure. It is not an error. However, they may be other, less\r\n # likely, reasons for solve failure. Write solve messages to the main GP message thread in debug\r\n # mode only in case the user is having problems. The user can also check the individual OD log\r\n # files.\r\n LOGGER.debug(f\"Solve failed for job id {result['jobId']}.\")\r\n LOGGER.debug(result[\"solveMessages\"])\r\n\r\n # Post-process outputs\r\n if self.route_fcs:\r\n LOGGER.info(\"Post-processing Route results...\")\r\n self.route_fcs = sorted(self.route_fcs)\r\n self._post_process_route_fcs()\r\n else:\r\n LOGGER.warning(\"All Route solves failed, so no output was produced.\")\r\n\r\n # Clean up\r\n # Delete the job folders if the job succeeded\r\n if DELETE_INTERMEDIATE_OUTPUTS:\r\n LOGGER.info(\"Deleting intermediate outputs...\")\r\n try:\r\n shutil.rmtree(self.scratch_folder, ignore_errors=True)\r\n except Exception: # pylint: disable=broad-except\r\n # If deletion doesn't work, just throw a warning and move on. This does not need to kill the tool.\r\n LOGGER.warning(f\"Unable to delete intermediate Route output folder {self.scratch_folder}.\")\r\n\r\n LOGGER.info(\"Finished calculating Routes.\")"},"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 solve_route(inputs, chunk):\r\n rt = Route(**inputs)\r\n if inputs[\"pair_type\"] is helpers.PreassignedODPairType.one_to_one:\r\n rt.logger.info(f\"Processing origins OID {chunk[0]} to {chunk[1]} as job id {rt.job_id}\")\r\n elif inputs[\"pair_type\"] is helpers.PreassignedODPairType.many_to_many:\r\n rt.logger.info(f\"Processing chunk {chunk[0]} as job id {rt.job_id}\")\r\n rt.solve(chunk)\r\n rt.teardown_logger()\r\n return rt.job_result","def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches\r\n # Select the inputs to process\r\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\r\n self._select_inputs_one_to_one(chunk_definition)\r\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\r\n self._get_od_pairs_for_chunk(chunk_definition)\r\n self._select_inputs_many_to_many()\r\n else:\r\n raise NotImplementedError(f\"Invalid PreassignedODPairType: {self.pair_type}\")\r\n\r\n # Initialize the Route solver object\r\n self.initialize_rt_solver()\r\n self._add_unique_id_fields()\r\n\r\n # Insert the origins and destinations\r\n self.logger.debug(f\"Route solver fields transferred from Origins: {self.origin_transfer_fields}\")\r\n self.logger.debug(f\"Route solver fields transferred from Destinations: {self.destination_transfer_fields}\")\r\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\r\n self._insert_stops_one_to_one()\r\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\r\n self._insert_stops_many_to_many()\r\n else:\r\n raise NotImplementedError(f\"Invalid PreassignedODPairType: {self.pair_type}\")\r\n\r\n if self.rt_solver.count(arcpy.nax.RouteInputDataType.Stops) == 0:\r\n # There were no valid destinations for this set of origins\r\n self.logger.debug(\"No valid destinations for this set of origins. Skipping Route calculation.\")\r\n return\r\n\r\n # Load barriers\r\n # Note: This loads ALL barrier features for every analysis, even if they are very far away from any of\r\n # the inputs in the current chunk. You may want to select only barriers within a reasonable distance of the\r\n # inputs, particularly if you run into the maximumFeaturesAffectedByLineBarriers,\r\n # maximumFeaturesAffectedByPointBarriers, and maximumFeaturesAffectedByPolygonBarriers tool limits for portal\r\n # solves. However, since barriers is likely an unusual case, deal with this only if it becomes a problem.\r\n for barrier_fc in self.barriers:\r\n self.logger.debug(f\"Loading barriers feature class {barrier_fc}...\")\r\n shape_type = arcpy.Describe(barrier_fc).shapeType\r\n if shape_type == \"Polygon\":\r\n class_type = arcpy.nax.RouteInputDataType.PolygonBarriers\r\n elif shape_type == \"Polyline\":\r\n class_type = arcpy.nax.RouteInputDataType.LineBarriers\r\n elif shape_type == \"Point\":\r\n class_type = arcpy.nax.RouteInputDataType.PointBarriers\r\n else:\r\n self.logger.warning(\r\n f\"Barrier feature class {barrier_fc} has an invalid shape type and will be ignored.\"\r\n )\r\n continue\r\n barriers_field_mappings = self.rt_solver.fieldMappings(class_type, True)\r\n self.rt_solver.load(class_type, barrier_fc, barriers_field_mappings, True)\r\n\r\n # Solve the Route analysis\r\n self.logger.debug(\"Solving Route...\")\r\n solve_start = time.time()\r\n self.solve_result = self.rt_solver.solve()\r\n solve_end = time.time()\r\n self.logger.debug(f\"Solving Route completed in {round(solve_end - solve_start, 3)} seconds.\")\r\n\r\n # Handle solve messages\r\n solve_msgs = [msg[-1] for msg in self.solve_result.solverMessages(arcpy.nax.MessageSeverity.All)]\r\n for msg in solve_msgs:\r\n self.logger.debug(msg)\r\n\r\n # Update the result dictionary\r\n self.job_result[\"solveMessages\"] = solve_msgs\r\n if not self.solve_result.solveSucceeded:\r\n self.logger.debug(\"Solve failed.\")\r\n return\r\n self.logger.debug(\"Solve succeeded.\")\r\n self.job_result[\"solveSucceeded\"] = True\r\n\r\n # Save output\r\n self._export_to_feature_class(chunk_definition)\r\n\r\n self.logger.debug(\"Finished calculating Route.\")","def run(self):\n\n self._get_routes()\n self._calculate_emissions()","def _route_chunk(data, host_url, annotations='duration', retries=10, extra_params=None):\n\t# offsets are used to make correct indice of the result dataframe\n\tsources, destinations, sources_offset, destinations_offset = data\n\tsources_count = len(sources)\n\tdestinations_count = len(destinations)\n\n\t# OSRM takes all points as one list, and then numbers of sources & dests in it\n\tall_points = sources + destinations\n\tencoded = encode_poly([(p.y, p.x) for p in all_points])\n\n\t# numerate sources & dests. sources come first\n\tsource_numbers = ';'.join(map(str, range(sources_count)))\n\tdestination_numbers = ';'.join(map(str,\n\t\trange(sources_count, sources_count + destinations_count)))\n\n\n\textra_params = extra_params or {}\n\tparams = {\n\t\t'sources': source_numbers,\n\t\t'destinations': destination_numbers,\n\t\t'generate_hints': 'false',\n\t\t'annotations': annotations,\n\t\t**extra_params\n\t}\n\n\tencoded_params = urllib.parse.quote_plus(urllib.parse.urlencode(params))\n\t# if we pass url and params separately to requests.get, it will make a malformed URL\n\tencoded_url = f'{host_url}/table/v1/driving/polyline({encoded})?{encoded_params}'\n\tresp = get_retry(encoded_url, {}, retries)\n\n\tif resp.status_code != 200:\n\t\traise RuntimeError(f'OSRM server responded with {resp.status_code} code. Content: {resp.content}')\n\n\tresp_data = resp.json()\n\tif resp_data.get('code', 'Ok') != 'Ok':\n\t\traise RuntimeError(f'OSRM server responded with error message: {resp_data[\"message\"]}')\n\n\t# if 'duration' is requested, then take resp_data['durations'], or resp_data['distances'] if distances.\n\t# also, 'duration,distance' might be requested, then take both and concatenate results (= join columns)\n\tresults = []\n\t\n\tfor key in annotations.split(','):\n\t\tdf = pd.DataFrame(resp_data[f'{key}s']).reset_index().rename(columns={'index': 'source'}).melt(id_vars='source', var_name='destination', value_name=key)\n\t\tdf[key] = df[key].astype(float)\n\t\tif len(results) > 0:\n\t\t\t# only append the data column\n\t\t\tresults.append(df[[key]])\n\t\telse:\n\t\t\tresults.append(df)\n\n\tresult_df = pd.concat(results, axis=1)\n\n\t# snapping distances\n\tresult_df['source_snap'] = result_df.source.map(pd.DataFrame(resp_data['sources'])['distance'])\n\tresult_df['destination_snap'] = result_df.destination.map(pd.DataFrame(resp_data['destinations'])['distance'])\n\n\t# instead of join/merge lookup\n\tresult_df['geometry'] = result_df['source'].map({i: g for i, g in enumerate(sources)})\n\tresult_df['geometry_dest'] = result_df['destination'].map({i: g for i, g in enumerate(destinations)})\n\n\t# shift back by the given offset\n\tresult_df['destination'] = result_df['destination'].astype(int) + destinations_offset\n\tresult_df['source'] = result_df['source'].astype(int) + sources_offset\n\treturn result_df","def completion_processor(self):\n while True:\n _ = (yield)\n self.solve_completed = True","def __routes(self, with_return):\n nonzeo_pois = list(filter(None, self.pois.keys()))\n\n for path in itertools.permutations(nonzeo_pois):\n steps = self.poi_distance(0, path[0])\n for i, j in zip(path, path[1:]):\n steps += self.poi_distance(i, j)\n if with_return:\n steps += self.poi_distance(path[-1], 0)\n yield steps","def process(self):\n try:\n if not self._successor:\n return self.loading_strategy()\n else:\n return self._successor.process_next(self.loading_strategy())\n except Exception as e:\n Oprint.err(e, 'lmdo')","def dochunk( request, chunk=None, trailers=None ):","def execute_waypoint_sequence(detail_of_trip):\n\n # rets (route_line, line_points)\n sliced_route_and_line_points = chunk_user_route(detail_of_trip)\n\n sliced_route = sliced_route_and_line_points[0]\n line_points = sliced_route_and_line_points[1]\n\n # Interpolate/Break into 1/10 segments\n segmented_points = interpolate_points(sliced_route, line_points)\n waypoints = find_crime_areas(segmented_points)\n\n # print \"segmented_points\", json.dumps(segmented_points, indent=2)\n print \"\\n\\n\\n\\n\" # compensating for the giant GET request\n return waypoints","def process(self, results):\n raise NotImplementedError","def request_chunk(self, x, z):\n\n if (x, z) in self.chunk_cache:\n returnValue(self.chunk_cache[x, z])\n elif (x, z) in self.dirty_chunk_cache:\n returnValue(self.dirty_chunk_cache[x, z])\n elif (x, z) in self._pending_chunks:\n # Rig up another Deferred and wrap it up in a to-go box.\n retval = yield self._pending_chunks[x, z].deferred()\n returnValue(retval)\n\n chunk = Chunk(x, z)\n yield maybeDeferred(self.serializer.load_chunk, chunk)\n\n if chunk.populated:\n self.chunk_cache[x, z] = chunk\n self.postprocess_chunk(chunk)\n #self.factory.scan_chunk(chunk)\n returnValue(chunk)\n\n if self.async:\n from ampoule import deferToAMPProcess\n from bravo.remote import MakeChunk\n\n d = deferToAMPProcess(MakeChunk,\n x=x,\n z=z,\n seed=self.seed,\n generators=configuration.getlist(self.config_name, \"generators\")\n )\n\n # Get chunk data into our chunk object.\n def fill_chunk(kwargs):\n chunk.blocks = fromstring(kwargs[\"blocks\"],\n dtype=uint8).reshape(chunk.blocks.shape)\n chunk.heightmap = fromstring(kwargs[\"heightmap\"],\n dtype=uint8).reshape(chunk.heightmap.shape)\n chunk.metadata = fromstring(kwargs[\"metadata\"],\n dtype=uint8).reshape(chunk.metadata.shape)\n chunk.skylight = fromstring(kwargs[\"skylight\"],\n dtype=uint8).reshape(chunk.skylight.shape)\n chunk.blocklight = fromstring(kwargs[\"blocklight\"],\n dtype=uint8).reshape(chunk.blocklight.shape)\n\n return chunk\n d.addCallback(fill_chunk)\n else:\n # Populate the chunk the slow way. :c\n for stage in self.pipeline:\n stage.populate(chunk, self.seed)\n\n chunk.regenerate()\n d = succeed(chunk)\n\n # Set up our event and generate our return-value Deferred. It has to\n # be done early becaues PendingEvents only fire exactly once and it\n # might fire immediately in certain cases.\n pe = PendingEvent()\n # This one is for our return value.\n retval = pe.deferred()\n # This one is for scanning the chunk for automatons.\n #pe.deferred().addCallback(self.factory.scan_chunk)\n self._pending_chunks[x, z] = pe\n\n def pp(chunk):\n chunk.populated = True\n chunk.dirty = True\n\n self.postprocess_chunk(chunk)\n\n self.dirty_chunk_cache[x, z] = chunk\n del self._pending_chunks[x, z]\n\n return chunk\n\n # Set up callbacks.\n d.addCallback(pp)\n d.chainDeferred(pe)\n\n # Because multiple people might be attached to this callback, we're\n # going to do something magical here. We will yield a forked version\n # of our Deferred. This means that we will wait right here, for a\n # long, long time, before actually returning with the chunk, *but*,\n # when we actually finish, we'll be ready to return the chunk\n # immediately. Our caller cannot possibly care because they only see a\n # Deferred either way.\n retval = yield retval\n returnValue(retval)","def run(self):\n for direction in self.directions:\n rotation = direction[0]\n steps = direction[1]\n\n self.make_rotation(rotation)\n hq_found = self.travel(steps)\n\n if hq_found:\n return (abs(self.new_loc[0] + self.new_loc[1]))","def run(self):\n while True:\n path, params = self.path_queue.get()\n errors = check_path(path, **params)\n self.result_queue.put(errors)\n self.path_queue.task_done()","def __call__(self):\n dv = None\n #Push as many queued calls as the self.max_batch_size and the max number of paralel HTTPS sessions allow for.\n while self.active_call_count < self.parallel and self.queue:\n #Get a chunk of entries from the command queue so we can make a batch.\n subqueue = self.queue[:self.max_batch_size]\n self.queue = self.queue[self.max_batch_size:]\n #Send a single batch to the currently selected RPC node.\n dv = self._process_batch(subqueue)\n #If there is nothing left to do, there is nothing left to do\n if not self.queue and self.active_call_count == 0:\n self.log.error(\"Queue is empty and no active HTTPS-POSTs remaining.\")\n if self.stop_when_empty:\n #On request, stop reactor when queue empty while no active queries remain.\n self.reactor.stop() \n return dv","def run(self) -> Any:\n self.prepare()\n for step in self.stream:\n self.output = step\n return self.output","def _calculate_emissions(self):\n parameters = self._get_pollutants_for_vehicle()\n\n self.routes = RouteSet()\n\n if \"routes\" not in self._json_data:\n log.debug(\"Error in returned JSON data from web service.\")\n log.debug(\"data: {}\".format(self._json_data))\n return\n\n # Create a \"set\" of Routes. The planner web service will\n # return 2-4 routes with different paths.\n for idx, r in enumerate(self._json_data[\"routes\"][\"features\"]):\n attributes = r.get(\"attributes\")\n route = Route(distance=attributes.get(\"Total_Meters\"),\n minutes=attributes.get(\"Total_Minutes\"),\n path=r.get(\"geometry\").get(\"paths\")[0], id = idx)\n self.routes.add(route)\n\n log.debug(\"Nr of routes: {}\".format(len(self.routes)))\n for i, route in enumerate(self.routes):\n # A list of x,y,z points that all together represents the route\n path_coordinates = route.path\n distances = []\n\n # Nifty little trick to loop over 'path_coordinates',\n # but keep a reference to the 'prev' item to calculate the\n # distance between them\n iter_points = iter(path_coordinates)\n prev = next(iter_points)\n for point in path_coordinates:\n if not distances:\n # first point\n distances.append(Planner._get_distance_3d(prev, point) / 1000)\n else:\n distances.append(distances[-1] + Planner._get_distance_3d(prev, point) / 1000)\n\n point_slope = Planner._get_slope(prev, point)\n\n # Calculate emission for each pollutants the user has asked for\n for p in self._pollutants:\n parms = [x for x in parameters if x.pollutant.name.startswith(p)]\n calc_emission = self.get_emission(parms, point_slope)\n route.add_pollutant(p, calc_emission)\n\n prev = point\n\n route.add_distances(distances)","def processTradeRoutes(self):\n try:\n nextRound = self.currentRound+1\n resultslist = []\n for trID in self.tradeRoutes.keys():\n myTradeRoute = self.tradeRoutes[trID]\n (systemFromID, systemToID, tradeRouteType) = string.split(trID, '-')\n systemFrom = self.systems[systemFromID]\n systemTo = self.systems[systemToID]\n cancel = 0\n warpReq = 0\n # choose trade route type\n if tradeRouteType == 'GEN':\n # update what system sends based on what it makes\n myTradeRoute.AL = systemFrom.prodAL\n myTradeRoute.EC = systemFrom.prodEC\n myTradeRoute.IA = systemFrom.prodIA\n \n # check if trade route is adjacent or requires warp gate capacity\n if systemTo.id in systemFrom.warpGateSystems:\n warpReq = myTradeRoute.getWarpRequired()\n if warpReq > (systemFrom.availWGC-systemFrom.usedWGC) or warpReq > (systemTo.availWGC-systemTo.usedWGC):\n cancel = 1\n elif systemTo.id not in systemFrom.connectedSystems:\n cancel = 1\n \n if (systemFrom.AL >= myTradeRoute.AL and\n systemFrom.EC >= myTradeRoute.EC and\n systemFrom.IA >= myTradeRoute.IA and \n cancel == 0):\n # process trade route\n systemFrom.AL -= myTradeRoute.AL\n systemFrom.EC -= myTradeRoute.EC\n systemFrom.IA -= myTradeRoute.IA\n systemTo.AL += myTradeRoute.AL\n systemTo.EC += myTradeRoute.EC\n systemTo.IA += myTradeRoute.IA\n # deduct properly if empires are different\n empireFrom = self.empires[systemFrom.myEmpireID]\n empireTo = self.empires[systemTo.myEmpireID]\n if empireFrom <> empireTo:\n empireFrom.AL -= myTradeRoute.AL\n empireFrom.EC -= myTradeRoute.EC\n empireFrom.IA -= myTradeRoute.IA\n empireTo.AL += myTradeRoute.AL\n empireTo.EC += myTradeRoute.EC\n empireTo.IA += myTradeRoute.IA\n \n if warpReq > 0:\n systemFrom.usedWGC += warpReq\n systemTo.usedWGC += warpReq\n \n # mail trade route completion\n resultslist.append('Trade from System:%s to System:%s complete' % (systemFrom.id, systemTo.id))\n self.mailTradeInfo('completed', myTradeRoute, nextRound)\n else:\n cancel = 1\n \n # check if route should be cancelled\n if cancel == 1:\n resultslist.append('cancel trade route=%s' % myTradeRoute.id)\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\n elif myTradeRoute.oneTime == 1:\n resultslist.append('one time trade route=%s' % myTradeRoute.id)\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\n \n return str(resultslist)\n except:\n return 'galaxy->processTradeRoutes error'","def _run(self) -> None:\n while True:\n args: MigrationArgs = self._queue.get(block=True)\n with self._lock:\n if args.collection in self._chunks:\n if args.shard_key not in self._chunks[args.collection]:\n self._split_chunk(args.collection, args.shard_key)\n self._move_chunk(args)","def run(self):\n while True:\n try:\n processor, iprot, oprot, otrans, callback = self.queue.get()\n if processor is None:\n break\n callback.getContext().setProtocols(iprot, oprot)\n processor.process(iprot, oprot, callback.getContext())\n callback.success(reply=otrans.getvalue())\n except Exception:\n logging.exception(\"Exception while processing request\")\n callback.failure()","def handle_chunk( chunk, trailers=None ):","def applyMethod(self, neighbours ):\n \n nid = neighbours.mQueryToken\n\n if self.mContinueAt:\n if nid == self.mContinueAt:\n self.info(\"continuing processing at %s\" % str(self.mContinueAt ) )\n self.mContinueAt = None\n return\n\n length = self.mFasta.getLength( nid )\n \n if length > self.mConfig.get(\"segments\", \"max_sequence_length\"):\n self.warn( \"skipped: nid=%s, length=%i -> too long\" % (nid, length) )\n return False\n \n self.debug( \"starting nid=%s, length=%i\" % (nid, length) )\n\n tree = self.getTree( nid, length, neighbours ) \n\n if self.covering_trees:\n tree = self.convertTreeToCoveringTree( tree )\n \n max_depth = 0\n if tree:\n for node in range(len(tree)):\n (level, parent, left_child, right_child, ranges) = tree[node]\n max_depth = max(max_depth, level)\n for xfrom, xto in ranges:\n self.mOutfile.write(\"\\t\".join( map(str,(nid,node,parent,level,xfrom,xto)))+ \"\\n\")\n self.mOutfile.flush()\n\n self.debug( \"finished: nid=%s, length=%i, size=%i, depth=%i\" % (nid, length,\n len(tree), max_depth ) )\n return True\n else:\n self.warn( \"failed: nid=%s, length=%i, time=%i\" % (job_id, nid, length,\n len(tree), max_depth ) )\n \n return False","def run_map(self):\n # Split input into chunks for processing\n files = self.split_list()\n # Make processing pool\n pool = Pool(processes=self.args.ncore)\n # Map processing to _run function\n self.output = pool.map(_run, files)\n # Close and join pool\n pool.close()\n pool.join()","def handle_result(self) -> Callable[['Request'], 'Request']:\n\n def _handle_result(result: 'Request'):\n \"\"\"\n Function that handles the result when extracted from the request future\n\n :param result: The result returned to the gateway. It extracts the request to be returned to the client\n :return: Returns a request to be returned to the client\n \"\"\"\n for route in result.routes:\n if route.executor == GATEWAY_NAME:\n route.end_time.GetCurrentTime()\n\n self._update_end_request_metrics(result)\n\n return result\n\n return _handle_result","def process():","def run_chunk(self, part_suffix, remote_home_dir, remote_index_dir, remote_work_dir,\n remote_username, input_files, key_path, service, lazy_run):\n assert service in (\"gsnap\", \"rapsearch2\")\n\n chunk_id = input_files[0].split(part_suffix)[-1]\n multihit_basename = f\"multihit-{service}-out{part_suffix}{chunk_id}.m8\"\n multihit_local_outfile = os.path.join(self.chunks_result_dir_local, multihit_basename)\n multihit_remote_outfile = os.path.join(remote_work_dir, multihit_basename)\n multihit_s3_outfile = os.path.join(self.chunks_result_dir_s3, multihit_basename)\n\n base_str = \"aws s3 cp --only-show-errors {s3_path}/{input_fa} {remote_work_dir}/{input_fa} \"\n download_input_from_s3 = \" ; \".join(\n base_str.format(\n s3_path=self.chunks_result_dir_s3,\n input_fa=input_fa,\n remote_work_dir=remote_work_dir) for input_fa in input_files)\n\n base_str = \"mkdir -p {remote_work_dir} ; {download_input_from_s3} ; \"\n environment = self.additional_attributes[\"environment\"]\n if service == \"gsnap\":\n commands = base_str + \"{remote_home_dir}/bin/gsnapl -A m8 --batch=0 --use-shared-memory=0 --gmap-mode=none --npaths=100 --ordered -t 36 --max-mismatches=40 -D {remote_index_dir} -d nt_k16 {remote_input_files} > {multihit_remote_outfile}\"\n else:\n commands = base_str + \"/usr/local/bin/rapsearch -d {remote_index_dir}/nr_rapsearch -e -6 -l 10 -a T -b 0 -v 50 -z 24 -q {remote_input_files} -o {multihit_remote_outfile}\"\n\n commands = commands.format(\n remote_work_dir=remote_work_dir,\n download_input_from_s3=download_input_from_s3,\n remote_home_dir=remote_home_dir,\n remote_index_dir=remote_index_dir,\n remote_input_files=\" \".join(\n remote_work_dir + \"/\" + input_fa for input_fa in input_files),\n multihit_remote_outfile=multihit_remote_outfile\n if service == \"gsnap\" else multihit_remote_outfile[:-3]\n # Strip the .m8 for RAPSearch as it adds that\n )\n\n if not lazy_run or not fetch_from_s3(multihit_s3_outfile,\n multihit_local_outfile):\n correct_number_of_output_columns = 12\n min_column_number = 0\n max_tries = 2\n try_number = 1\n instance_ip = \"\"\n\n\n def interpret_min_column_number_string(min_column_number_string,\n correct_number_of_output_columns,\n try_number):\n if min_column_number_string:\n min_column_number = float(min_column_number_string)\n log.write(\n \"Try no. %d: Smallest number of columns observed in any line was %d\"\n % (try_number, min_column_number))\n else:\n log.write(\"Try no. %d: No hits\" % try_number)\n min_column_number = correct_number_of_output_columns\n return min_column_number\n\n # Check if every row has correct number of columns (12) in the output\n # file on the remote machine\n while min_column_number != correct_number_of_output_columns \\\n and try_number <= max_tries:\n log.write(\"waiting for {} server for chunk {}\".format(\n service, chunk_id))\n max_concurrent = self.additional_attributes[\"max_concurrent\"]\n\n with server.ASGInstance(service, key_path,\n remote_username, environment,\n max_concurrent, chunk_id,\n self.additional_attributes.get(\"max_interval_between_describe_instances\") or 900,\n self.additional_attributes.get(\"job_tag_prefix\") or \"RunningIDseqBatchJob_\",\n self.additional_attributes.get(\"job_tag_refresh_seconds\") or 600,\n self.additional_attributes.get(\"draining_tag\") or \"draining\") as instance_ip:\n command.execute(command.remote(commands, key_path, remote_username, instance_ip))\n\n if service == \"gsnap\":\n verification_command = \"cat %s\" % multihit_remote_outfile\n else:\n # For rapsearch, first remove header lines starting with '#'\n verification_command = \"grep -v '^#' %s\" % multihit_remote_outfile\n verification_command += \" | awk '{print NF}' | sort -nu | head -n 1\"\n min_column_number_string = command.execute_with_output(\n command.remote(verification_command, key_path, remote_username, instance_ip))\n min_column_number = interpret_min_column_number_string(\n min_column_number_string, correct_number_of_output_columns,\n try_number)\n\n try_number += 1\n\n # Move output from remote machine to local machine\n msg = \"Chunk %s output corrupt; not copying to S3. Re-start pipeline \" \\\n \"to try again.\" % chunk_id\n assert min_column_number == correct_number_of_output_columns, msg\n\n with self.iostream_upload: # Limit concurrent uploads so as not to stall the pipeline.\n command.execute(\n command.scp(key_path, remote_username, instance_ip,\n multihit_remote_outfile, multihit_local_outfile))\n command.execute(\"aws s3 cp --only-show-errors %s %s/\" %\n (multihit_local_outfile,\n self.chunks_result_dir_s3))\n log.write(\"finished alignment for chunk %s on %s server %s\" % (chunk_id, service, instance_ip))\n return multihit_local_outfile","def solve(self):\n for step in self.run.values():\n step.solve()","def chunk_user_route(detail_of_trip):\n\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\n # since I can't get javascript to load, here's a hacky way of loading json\n # that details the route based on the user's point A and point B\n # detail_of_trip = api.directions(\n # (40.760350, -73.976209),\n # (40.754009, -73.981097),\n # mode=\"walking\"\n # )[0]\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\n\n # now that I have javascript sending over the json, load json that details\n # the route based on the user's point A and point B\n\n # -------------- This section is for interpolation/splitting using shapely\n first = True # to see if this is the start position for the entire route\n line_points = [] # stores all the points to the route based on dict passed\n\n for leg in detail_of_trip['legs']:\n for step in leg['steps']:\n # Create a list of two element lists that represent points along the\n # route. via google. line_points = [ [lat1, lng1], [lat2, lng2],...]\n # Only add the starting point the first time. Every other iteration\n # we will just tack on the end points to our line.\n if first:\n line_points.append([step['start_location']['lat'], step['start_location']['lng']])\n first = False\n line_points.append([step['end_location']['lat'], step['end_location']['lng']])\n\n # Now load those points into a geometry, here shapely's LineString type.\n route_line = LineString(line_points)\n return (route_line, line_points)","def _process_batch(self, subqueue):\n try:\n timeoutCall = None\n jo = None\n if self.max_batch_size == 1:\n #At time of writing, the regular nodes have broken JSON-RPC batch handling.\n #So when max_batch_size is set to one, we assume we need to work around this fact.\n jo = json.dumps(self.entries[subqueue[0]]._get_rpc_call_object())\n else:\n #The api.steemitstage.com node properly supports JSON-RPC batches, and so, hopefully soon, will the other nodes.\n qarr = list()\n for num in subqueue:\n qarr.append(self.entries[num]._get_rpc_call_object())\n jo = json.dumps(qarr)\n url = \"https://\" + self.nodes[self.node_index] + \"/\"\n url = str.encode(url)\n deferred = self.agent.request('POST',\n url,\n Headers({\"User-Agent\" : ['Async Steem for Python v0.6.1'],\n \"Content-Type\": [\"application/json\"]}),\n _StringProducer(jo))\n def process_one_result(reply):\n \"\"\"Process a single response from an JSON-RPC command.\"\"\"\n try:\n if \"id\" in reply:\n reply_id = reply[\"id\"]\n if reply_id in self.entries:\n match = self.entries[reply_id]\n if \"result\" in reply:\n #Call the proper result handler for the request that this response belongs to.\n match._handle_result(reply[\"result\"])\n else:\n if \"error\" in reply and \"code\" in reply[\"error\"]:\n msg = \"No message included with error\"\n if \"message\" in reply[\"error\"]:\n msg = reply[\"error\"][\"message\"]\n #Call the proper error handler for the request that this response belongs to.\n match._handle_error(reply[\"error\"][\"code\"], msg)\n else:\n self.log.error(\"Error: Invalid JSON-RPC response entry. {node!r}.\",node = self.nodes[self.node_index])\n #del self.entries[reply_id]\n else:\n self.log.error(\"Error: Invalid JSON-RPC id in entry {rid!r}. {node!r}\",rid=reply_id, node = self.nodes[self.node_index])\n else:\n self.log.error(\"Error: Invalid JSON-RPC response without id in entry: {reply!r}: {node!r}\",reply=reply, node = self.nodes[self.node_index])\n except Exception as ex:\n self.log.failure(\"Error in _process_one_result {err!r}, {node!r}\",err=str(ex), node = self.nodes[self.node_index])\n def handle_response(response):\n \"\"\"Handle response for JSON-RPC batch query invocation.\"\"\"\n try:\n #Cancel any active timeout for this HTTPS call.\n if timeoutCall.active():\n timeoutCall.cancel()\n def cbBody(bodystring):\n \"\"\"Process response body for JSON-RPC batch query invocation.\"\"\"\n try:\n results = None\n #The bosy SHOULD be JSON, it not always is.\n try:\n results = json.loads(bodystring)\n except Exception as ex:\n #If the result is NON-JSON, may want to move to the next node in the node list\n self.log.error(\"Non-JSON response from server {node!r}\", node = self.nodes[self.node_index])\n self._next_node()\n #Add the failed sub-queue back to the command queue, we shall try again soon.\n self.queue = subqueue + self.queue\n if results != None:\n ok = False\n if isinstance(results, dict):\n #Running in legacy single JSON-RPC call mode (no batches), process the result of the single call.\n process_one_result(results)\n ok = True\n else:\n if isinstance(results, list):\n #Running in batch mode, process the batch result, one response at a time\n for reply in results:\n process_one_result(reply)\n ok = True\n else:\n #Completely unexpected result type, may want to move to the next node in the node list.\n self.log.error(\"Error: Invalid JSON-RPC response, expecting list as response on batch. {node!r}\",node = self.nodes[self.node_index])\n self._next_node()\n #Add the failed sub-queue back to the command queue, we shall try again soon.\n self.queue = subqueue + self.queue\n if ok == True:\n #Clean up the entries dict by removing all fully processed commands that now are no longer in the queu.\n for request_id in subqueue:\n if request_id in self.entries:\n del self.entries[request_id]\n else:\n self.log.error(\"Error: No response entry for request entry in result: {rid!r}. {node!r}\",rid=request_id, node = self.nodes[self.node_index])\n except Exception as ex:\n self.log.failure(\"Error in cbBody {err!r}. {node!r}\",err=str(ex), node = self.nodes[self.node_index])\n #This HTTPS POST is now fully processed.\n self.active_call_count = self.active_call_count - 1\n #Invoke self, possibly sending new queues RPC calls to the current node\n self()\n deferred2 = readBody(response)\n deferred2.addCallback(cbBody)\n return deferred2\n except Exception as ex:\n self.log.failure(\"Error in handle_response {err!r}. {node!r}\",err=str(ex),node = self.nodes[self.node_index])\n #If something went wrong, the HTTPS POST isn't active anymore.\n self.active_call_count = self.active_call_count - 1\n #Invoke self, possibly sending new queues RPC calls to the current node\n self()\n deferred.addCallback(handle_response)\n def _handle_error(error):\n \"\"\"Handle network level error for JSON-RPC request.\"\"\"\n try:\n #Abandon any active timeout triggers\n if timeoutCall.active():\n timeoutCall.cancel()\n #Unexpected error on HTTPS POST, we may want to move to the next node.\n self.log.error(\"Error on HTTPS POST : {cls!r} : {err!r}. {node!r}\",cls=error.type.__name__,err=error.getErrorMessage(),node = self.nodes[self.node_index])\n self._next_node()\n except Exception as ex:\n self.log.failure(\"Error in _handle_error {err!r}. {node!r}\",err=str(ex),node = self.nodes[self.node_index])\n #Add the failed sub-queue back to the command queue, we shall try again soon.\n self.queue = subqueue + self.queue\n ##If something went wrong, the HTTPS POST isn't active anymore.\n self.active_call_count = self.active_call_count - 1\n #Invoke self, possibly sending new queues RPC calls to the current node\n self()\n deferred.addErrback(_handle_error)\n timeoutCall = self.reactor.callLater(self.rpc_timeout, deferred.cancel)\n #Keep track of the number of active parallel HTTPS posts.\n self.active_call_count = self.active_call_count + 1\n return deferred\n except Exception as ex:\n self.log.failure(\"Error in _process_batch {err!r}. {node!r}\",err=str(ex),node = self.nodes[self.node_index])","def run(self):\r\n while True:\r\n try:\r\n processor, iprot, oprot, otrans, callback = self.queue.get()\r\n if processor is None:\r\n break\r\n processor.process(iprot, oprot)\r\n callback(True, otrans.getvalue())\r\n except Exception:\r\n logging.exception(\"Exception while processing request\")\r\n callback(False, '')","def process(self):\n while not self.halted:\n self.step()\n return self.outputs","def chunk_generator( callback, request, c ):","def handle_rpc(self):\n while True: # loop handling\n self.rbuf.seek(0)\n length_prefix = self.rbuf.read(4)\n if len(length_prefix) < 4: # half-package\n break\n\n try:\n length, = struct.unpack(\"I\", length_prefix.encode(\"utf-8\"))\n except Exception as e:\n print(e.__traceback__)\n body = self.rbuf.read(length)\n if len(body) < length: # half-package\n break\n\n request = json.loads(body)\n input = request[\"in\"]\n params = request[\"params\"]\n handler = self.handlers[input]\n handler(params)\n # cut read buffer\n left = self.rbuf.getvalue()[length + 4:]\n self.rbuf = StringIO()\n self.rbuf.write(left)\n # move position to EOF\n self.rbuf.seek(0, 2)","def inference(self):\n for i in range(len(self.nodes)):\n for j in range(len(self.nodes[i])):\n self.pipes[i][j].send(\"inference\")\n \n ## wait for the finalization to be completed\n for i in range(len(self.nodes)):\n for j in range(len(self.nodes[i])):\n self.pipes[i][j].recv()","def finish(self) -> Iterable[Chunk]:","def evaluate_batch(self, pipelines):","def get_next_inner_computation(self, arg: str):\n print(\"[get_next - inner computation] starts here.\")\n # Start of transformation and component encoding\n name_str = self.transform_inner(arg)\n # print(\"[get_next - inner computation] after transform:\", arg)\n name_after_transform = Name(name_str)\n name = self.encode_name_components(name_after_transform)\n # End of transformation and component encoding\n print(\"[get_next - inner computation] after encoding:\", name)\n self.queue_to_lower.put((self.packetid, Interest(name)))\n inner_result = self.get_content(name)\n print(\"[get_next - inner computation] ends here with result:\", inner_result)\n return inner_result","async def solve(self):\n\n \"\"\"TODO:\n Handle guess and checking:\n 1) Make guess (Make logical guess based on what could be most impactful...i.e. if two spots can have either number in a row)\n 2) Fork based on guess\n 3) Check if one raises from impossible square (delete this fork)\n 4) Check if one completes (will simply return from .gather)\n 5) Each board can recurse through this guess and checking, just in case\n \"\"\"\n tasks = [square.check() for row in self for square in row]\n\n return await asyncio.gather(*tasks, return_exceptions=False)","def run(self, data, rewrap=False, prefetch=0):\n if rewrap:\n data = [data]\n\n for pipe in self._pipes:\n pipe.feed(data)\n data = pipe\n else:\n iterable = self._prefetch_callable(data, prefetch) if prefetch else data\n for out_data in iterable:\n yield out_data","def stream(self, batch):\n response = self.post(batch)\n try:\n for i, result_data in grouped(response):\n result = JobResult.hydrate(assembled(result_data), batch)\n log.info(\"< %s\", result)\n yield result\n finally:\n response.close()","def __call__(self, frame, tlbrs):\n self.extract_async(frame, tlbrs)\n return self.postprocess()","def transform( request, data, finishing=False ):","def transform( request, data, finishing=False ):","def routing_step(self, layout: dict, circuit: Circuit):\n\n _, final_mapping = self.routing_algorithm(circuit, layout)\n return final_mapping","def run(self):\n while self._num_workers > 0:\n self.server.handle_request()\n self._graph = None","def num_step_reach(rr, a, b, k, num_steps = 5):\n\n # Time this function\n start_time = time.time()\n\n # Help us divide and conquer with multiple threads\n pool = ThreadPool(processes = 2)\n\n # Create our BDD variables, matching those exactly in rr (except zz's)\n xx_list = [bddvar(\"xx{}\".format(i)) for i in range(k)]\n yy_list = [bddvar(\"yy{}\".format(i)) for i in range(k)]\n zz_list = [bddvar(\"zz{}\".format(i)) for i in range(k)]\n\n # Compose for each step\n # NOTE: Very slow for many nodes and edges; may want divide and conquer here\n hh = rr\n yyzz_compose_dict = {a:b for a, b in zip(yy_list, zz_list)}\n xxzz_compose_dict = {a:b for a, b in zip(xx_list, zz_list)}\n for i in range(0, num_steps - 1):\n\n # Kickoff threads on async composition\n yyzz_async_result = pool.apply_async(hh.compose, [yyzz_compose_dict])\n xxzz_async_result = pool.apply_async(rr.compose, [xxzz_compose_dict])\n\n # Block: get results from threads\n yyzz_compose = yyzz_async_result.get()\n xxzz_compose = xxzz_async_result.get()\n\n # Conjunct them and do smoothing\n hh = (yyzz_compose & xxzz_compose).smoothing(set(zz_list))\n\n print(\"\\tComposed for step\", i)\n\n print(\"Completed in {} seconds\".format(round(time.time() - start_time)))\n print(\"Number of satisfiable variables\", len(list(hh.satisfy_all())))\n\n # See if a and b can reach eachother in the given number of steps\n restrict_dict = {c:d for c, d in zip(set(xx_list), to_bin(a, k))}\n restrict_dict.update({c:d for c, d in zip(set(yy_list), to_bin(b, k))})\n return hh.restrict(restrict_dict)","def send_and_receive_many(world: CueBeamWorld):\n elements_vectorized1 = []\n for idxElement in range(0, len(world.elements) - 1):\n elements_vectorized1.extend(\n [world.elements[idxElement].x, world.elements[idxElement].y, world.elements[idxElement].z,\n world.elements[idxElement].amplitude, world.elements[idxElement].phase, 0.0])\n time_start = time.clock()\n current_ray_count = world.get_ray_count()\n estimated_worker_performance = 300000.0\n need_workers = math.ceil(current_ray_count / estimated_worker_performance)\n each_worker_does_ylines = math.ceil(world.rxPlane.ny / need_workers )\n # update\n handles = []\n for idx_worker in range(need_workers):\n yline0 = idx_worker*each_worker_does_ylines # starts at zero\n yline_y = world.rxPlane.y0 + world.rxPlane.dy * yline0\n handles.append({\n 'yline_y': yline_y,\n 'async_handle': beamsim_instant.delay(\n k=world.wavenumber,\n x0=world.rxPlane.x0,\n y0=yline_y,\n z0=world.rxPlane.z0,\n nx=world.rxPlane.nx,\n ny=each_worker_does_ylines,\n nz=world.rxPlane.nz,\n dx=world.rxPlane.dx,\n dy=world.rxPlane.dy,\n dz=world.rxPlane.dz,\n elements_vectorized=elements_vectorized1)\n })\n # TODO: FRONTIER HERE ===================\n\n # TODO: Wait for first worker, and load the result,\n #while not (async_handle.ready()):\n # time.sleep(0.02)\n\n world.rxPlane.pressurefield = pickle.loads(async_handle.result)\n time_end = time.clock()\n world.last_performance_rays_per_second = world.get_ray_count() / (time_end - time_start)\n print('performance = {} kRays/sec'.format(world.last_performance_rays_per_second / 1e3))\n return world","def __transform(self):\n try:\n self.tokenized_document, self.stack = None, []\n\n InlineProcessor.initialize()\n LinkHelper.initialize()\n\n POGGER.debug(\"\\n\\n>>>>>>>parse_blocks_pass>>>>>>\")\n first_pass_results = self.__parse_blocks_pass()\n\n POGGER.debug(\"\\n\\n>>>>>>>coalesce_text_blocks>>>>>>\")\n coalesced_results = CoalesceProcessor.coalesce_text_blocks(\n first_pass_results\n )\n\n POGGER.debug(\"\\n\\n>>>>>>>parse_inline>>>>>>\")\n final_pass_results = InlineProcessor.parse_inline(coalesced_results)\n\n POGGER.debug(\"\\n\\n>>>>>>>final_pass_results>>>>>>\")\n return final_pass_results\n except Exception as this_exception:\n raise BadTokenizationError(\n \"An unhandled error occurred processing the document.\"\n ) from this_exception","def async_fetch(self):\n args = (async_get_pipe, self.zargs, self.connections)\n mapped = yield ait.async_map(*args)\n return_value(multiplex(mapped))","def parse_chunks(self):\n logger.info('parse_chunks()')\n\n while (self.replay.pos < len(self.replay)):\n chunk_type = self.replay.read_uint32()\n chunk_size = self.replay.read_int32()\n offset = self.replay.bytepos\n\n if chunk_type == ChunkTypes.CHECKPOINT.value:\n self.parse_checkpoint()\n\n elif chunk_type == ChunkTypes.EVENT.value:\n self.parse_event()\n\n elif chunk_type == ChunkTypes.REPLAYDATA.value:\n self.parse_replaydata()\n\n elif chunk_type == ChunkTypes.HEADER.value:\n self.parse_header(chunk_size)\n\n self.replay.bytepos = offset + chunk_size","def process(self):\n self.extract()\n self.transform()\n self.load()","def run_router(self, detour_scale):\n\n # Double check source and taget are not same node, if so, we are done!\n for k,v in self.rg.map.items():\n if v.source and v.target:\n debug.error(\"Grid cell is source and target! {}\".format(k))\n return False\n \n # returns the path in tracks\n (path,cost) = self.rg.route(detour_scale)\n if path:\n debug.info(1,\"Found path: cost={0} \".format(cost))\n debug.info(1,str(path))\n\n self.paths.append(path)\n self.add_route(path)\n \n path_set = grid_utils.flatten_set(path)\n self.path_blockages.append(path_set)\n else:\n self.write_debug_gds(\"failed_route.gds\")\n # clean up so we can try a reroute\n self.rg.reinit()\n return False\n return True","def _process_requests_in_background(self):\n while True:\n readable, writable, exceptional = self._bg_select_peers()\n\n for peer in readable:\n data = peer.socket.recv(RECV_BYTES)\n if data:\n peer.incoming_buffer.feed(data)\n try:\n response = peer.incoming_buffer.unpack()\n except msgpack.OutOfData:\n continue\n peer.handle_response(response)\n else:\n self._bg_clean_up_peer(peer)\n if peer in writable:\n writable.remove(peer)\n if peer in exceptional:\n exceptional.remove(peer)\n\n for peer in writable:\n # single-reader configuration means we can safely unlock between\n # peeking and committing.\n with peer.lock:\n next_bytes = peer.outgoing_buffer.peek(SEND_BYTES)\n if not next_bytes:\n continue\n\n sent_bytes = peer.socket.send(next_bytes)\n if sent_bytes == 0:\n self._bg_clean_up_peer(peer)\n if peer in exceptional:\n exceptional.remove(peer)\n continue\n\n with peer.lock:\n peer.outgoing_buffer.commit_read(sent_bytes)\n\n for peer in exceptional:\n self._bg_clean_up_peer(peer)","def compute_response(self, items_to_process):\n pass","def _map_to_workers(self, iterable, result_getter):\n if not self.is_started:\n raise RuntimeError(\"Cannot process inputs: must call start() first.\")\n\n tasks = TaskIterator(iterable)\n task = next(tasks)\n\n while True:\n try:\n self._send_task(task)\n task = next(tasks)\n except Queue.Full:\n for result in result_getter(): # I wish I had `yield from` :(\n yield result\n except StopIteration:\n break\n\n while not self.is_completed:\n for result in result_getter():\n yield result","def routes(self, body):\n pass","async def fetch_posts(self) -> None:\n\n async def fetch_posts_for_offset(offset) -> list:\n logger.info(\n \"(offset %i) Start fetching posts from vk.com/%s...\",\n offset,\n self.vk_domain,\n )\n\n # VK Script code for /execute method.\n vks_code = get_wall_post_template.substitute(\n {\n \"domain\": self.vk_domain,\n \"offset\": offset,\n \"posts_per_portion\": self._posts_per_portion,\n \"execution_times\": self._execution_times,\n }\n )\n params = {\n \"v\": settings.VKAPI_VERSION,\n \"access_token\": settings.VKAPI_TOKEN,\n \"code\": vks_code,\n }\n url = self._url_execute\n\n # Posts fetching.\n resp_json = await vk_asynchronous_request(\n url,\n params,\n domain=self.vk_domain,\n offset=offset,\n )\n\n logger.info(\n \"(offset %i) End fetching posts from vk.com/%s...\",\n offset,\n self.vk_domain,\n )\n\n # Gathered posts handling.\n posts_from_vk = resp_json[\"response\"][\"items\"]\n posts = posts_as_schemas(posts_from_vk)\n del posts_from_vk\n return posts\n\n # Checks and preparations.\n await self._set_total_posts_in_domain()\n if not self._total_posts_in_domain:\n return\n\n # Creating tasks for fetching.\n tasks = []\n posts_per_task = self._posts_per_portion * self._execution_times\n offsets = list(range(0, self._total_posts_in_domain, posts_per_task))\n for offset in offsets:\n tasks.append(asyncio.create_task(fetch_posts_for_offset(offset)))\n\n # Running tasks.\n logger.info(\"Start fetching posts from vk.com/%s...\", self.vk_domain)\n results = await asyncio.gather(*tasks)\n logger.info(\"End fetching posts from vk.com/%s...\", self.vk_domain)\n\n # Flatting results from many tasks into one list.\n self._posts = [post for result in results for post in result]\n\n # Final actions.\n if self.sort_by_likes:\n self._posts = list(sorted(self.posts, key=lambda p: p.likes, reverse=True))\n if self.amount_to_fetch:\n self._posts = self._posts[: self.amount_to_fetch]","def run(self):\n self.debug('Starting new thread')\n while True:\n try:\n i, pset = self._readq.get(block=False)\n except Empty:\n break\n\n result = self.solve(pset)\n self._solveq.put((i, result))\n self.debug('Finishing thread')","def run_traverse(fln, fln_chunk):\n paths_chunk = {}\n clicks_chunk = {} #page: clicks\n path_length_chunk = {} #page : path length\n feed_count_chunk = {} #page : feed clicks\n i = 0\n for page in fln_chunk.iterkeys():\n i +=1\n if i % 10000 == 0: \n print i\n gc.collect()\n #traverse path\n page_path = traverse(fln, page)\n #add to dictionary\n paths_chunk[page] = page_path\n #update clicks \n for pt in page_path:\n clicks_chunk[pt] = clicks_chunk.get(pt, 0) + 1\n #update len(path) \n path_length_chunk[page] = len(page_path)\n #update feeder clicks\n feeder = return_feeder_page(fln, page, page_path)\n if feeder:\n feed_count_chunk[feeder] = feed_count_chunk.get(feeder, 0) + 1\n return paths_chunk, clicks_chunk, path_length_chunk, feed_count_chunk","def chunks(sequence, chunk_size):\r\n\r\n # YOUR CODE HERE\r","def run(self):\n _threadpool_limits = _no_threadpool_limits\n if USE_THREADPOOL_LIMITS:\n _threadpool_limits = threadpool_limits\n\n while True:\n next_task = self.task_queue.get()\n if next_task is None:\n # Poison pill means shutdown\n self.task_queue.task_done()\n break\n with _threadpool_limits(limits=1):\n answer = next_task(self.data)\n self.task_queue.task_done()\n self.result_queue.put(answer)","def process_results(self):\n\n while not self.results.empty():\n mvt = self.results.get()\n\n for peer in self.peers_list:\n peer.check_mvt(mvt)\n\n self.results.task_done()","async def _load_next_chunk(self):\n raise NotImplementedError","def run(self):\n\n # keep track of counter\n counter = 0\n\n while self.queue:\n\n # print depth of tree every 10000 steps\n if counter % 10000 == 0:\n print(len(self.queue[0]))\n\n # get first moves set from queue\n moves_set = self.get_moves_set()\n\n # move all moves from set\n self.try_moves(moves_set)\n\n # continue branch (add to queue) if layout is not in archive\n if self.not_in_archive():\n self.add_to_queue(moves_set)\n \n # check for win\n if self.won_game():\n\n # return winning set of moves\n return moves_set\n \n # reverse moves to original layout\n self.reverse_moves(moves_set)\n \n # add to counter\n counter += 1","def computeRrup(self, lon, lat, depth):\n\n mesh_dx = self._mesh_dx\n\n #----------------------------------------------------------------------\n # Sort out sites\n #----------------------------------------------------------------------\n oldshape = lon.shape\n\n if len(oldshape) == 2:\n newshape = (oldshape[0] * oldshape[1], 1)\n else:\n newshape = (oldshape[0], 1)\n\n x, y, z = latlon2ecef(lat, lon, depth)\n x.shape = newshape\n y.shape = newshape\n z.shape = newshape\n sites_ecef = np.hstack((x, y, z))\n\n #----------------------------------------------------------------------\n # Get mesh\n #----------------------------------------------------------------------\n mx = []\n my = []\n mz = []\n u_groups = np.unique(self._group_index)\n n_groups = len(u_groups)\n for j in range(n_groups):\n g_ind = np.where(u_groups[j] == self._group_index)[0]\n nq = len(self._toplats[g_ind]) - 1\n for i in range(nq):\n q = [Point(self._toplons[g_ind[i]],\n self._toplats[g_ind[i]],\n self._topdeps[g_ind[i]]),\n Point(self._toplons[g_ind[i + 1]],\n self._toplats[g_ind[i + 1]],\n self._topdeps[g_ind[i + 1]]),\n Point(self._botlons[g_ind[i + 1]],\n self._botlats[g_ind[i + 1]],\n self._botdeps[g_ind[i + 1]]),\n Point(self._botlons[g_ind[i]],\n self._botlats[g_ind[i]],\n self._botdeps[g_ind[i]])\n ]\n mesh = get_quad_mesh(q, dx=mesh_dx)\n mx.extend(list(np.reshape(mesh['x'], (-1,))))\n my.extend(list(np.reshape(mesh['y'], (-1,))))\n mz.extend(list(np.reshape(mesh['z'], (-1,))))\n mesh_mat = np.array([np.array(mx), np.array(my), np.array(mz)])\n\n #----------------------------------------------------------------------\n # Compute distance\n #----------------------------------------------------------------------\n dist = np.zeros_like(x)\n for i in range(len(x)):\n sitecol = sites_ecef[i, :].reshape([3, 1])\n dif = sitecol - mesh_mat\n distarray = np.sqrt(np.sum(dif * dif, axis=0))\n dist[i] = np.min(distarray) / 1000.0 # convert to km\n\n dist = np.reshape(dist, oldshape)\n\n return dist","def process10(res):","def run(self):\n while True:\n next_task = self.task_queue.get()\n if next_task is None:\n # Poison pill means shutdown\n self.task_queue.task_done()\n break\n answer = next_task(self.data)\n self.task_queue.task_done()\n self.result_queue.put(answer)","def walk_bus_algor(start,end):\n #---CLASSES---#\n class my_dictionary(dict):\n \"\"\"\n Creates a dictionary\n \"\"\"\n def __init__(self):\n self = dict()\n def add(self, key, value):\n self[key] = value\n\n #---FUNCTIONS---#\n def bus_layer(start,end, results, case):\n \"\"\"\n It generates a bus route with the bus numbers via greedy algorithm\n\n Parameters\n ----------\n start : node id\n end : node id\n results : dict (From lta datamall)\n case : int\n Returns\n -------\n final_route_list : list\n \"\"\"\n def overpass_request(data, pause_duration=None, timeout=180, error_pause_duration=None):\n \"\"\"\n Send a request to the Overpass API via HTTP POST and return the JSON\n response.\n Parameters\n ----------\n data : dict or OrderedDict\n key-value pairs of parameters to post to the API\n pause_duration : int\n how long to pause in seconds before requests, if None, will query API\n status endpoint to find when next slot is available\n timeout : int\n the timeout interval for the requests library\n error_pause_duration : int\n how long to pause in seconds before re-trying requests if error\n Returns\n -------\n dict\n \"\"\"\n\n # define the Overpass API URL, then construct a GET-style URL as a string to\n # hash to look up/save to cache\n url = settings.overpass_endpoint.rstrip('/') + '/interpreter'\n prepared_url = requests.Request('GET', url, params=data).prepare().url\n cached_response_json = get_from_cache(prepared_url)\n\n if cached_response_json is not None:\n # found this request in the cache, just return it instead of making a\n # new HTTP call\n return cached_response_json\n\n else:\n # if this URL is not already in the cache, pause, then request it\n if pause_duration is None:\n this_pause_duration = get_pause_duration()\n log('Pausing {:,.2f} seconds before making API POST request'.format(this_pause_duration))\n time.sleep(this_pause_duration)\n start_time = time.time()\n log('Posting to {} with timeout={}, \"{}\"'.format(url, timeout, data))\n response = requests.post(url, data=data, timeout=timeout, headers=get_http_headers())\n\n # get the response size and the domain, log result\n size_kb = len(response.content) / 1000.\n domain = re.findall(r'(?s)//(.*?)/', url)[0]\n log('Downloaded {:,.1f}KB from {} in {:,.2f} seconds'.format(size_kb, domain, time.time() - start_time))\n\n try:\n response_json = response.json()\n if 'remark' in response_json:\n log('Server remark: \"{}\"'.format(response_json['remark'], level=lg.WARNING))\n save_to_cache(prepared_url, response_json)\n except Exception:\n # 429 is 'too many requests' and 504 is 'gateway timeout' from server\n # overload - handle these errors by recursively calling\n # overpass_request until we get a valid response\n if response.status_code in [429, 504]:\n # pause for error_pause_duration seconds before re-trying request\n if error_pause_duration is None:\n error_pause_duration = get_pause_duration()\n log(\n 'Server at {} returned status code {} and no JSON data. Re-trying request in {:.2f} seconds.'.format(\n domain,\n response.status_code,\n error_pause_duration),\n level=lg.WARNING)\n time.sleep(error_pause_duration)\n response_json = overpass_request(data=data, pause_duration=pause_duration, timeout=timeout)\n\n # else, this was an unhandled status_code, throw an exception\n else:\n log('Server at {} returned status code {} and no JSON data'.format(domain, response.status_code),\n level=lg.ERROR)\n raise Exception(\n 'Server returned no JSON data.\\n{} {}\\n{}'.format(response, response.reason, response.text))\n\n return response_json\n def get_node(element):\n \"\"\"\n Convert an OSM node element into the format for a networkx node.\n\n Parameters\n ----------\n element : dict\n an OSM node element\n\n Returns\n -------\n dict\n \"\"\"\n useful_tags_node = ['ref', 'highway', 'route_ref', 'asset_ref']\n\n node = {}\n node['y'] = element['lat']\n node['x'] = element['lon']\n node['osmid'] = element['id']\n\n\n if 'tags' in element:\n for useful_tag in useful_tags_node:\n if useful_tag in element['tags']:\n node[useful_tag] = element['tags'][useful_tag]\n return node\n def get_path(element,element_r):\n \"\"\"\n Convert an OSM way element into the format for a networkx graph path.\n\n Parameters\n ----------\n element : dict\n an OSM way element\n element_r : dict\n an OSM way element\n\n Returns\n -------\n dict\n \"\"\"\n useful_tags_path_e = ['bridge', 'tunnel', 'oneway', 'lanes', 'name',\n 'highway', 'maxspeed', 'service', 'access', 'area',\n 'landuse', 'width', 'est_width', 'junction']\n\n useful_tags_path_r = ['bridge', 'tunnel', 'oneway', 'lanes', 'ref', 'direction', 'from', 'to', 'name',\n 'highway', 'maxspeed', 'service', 'access', 'area',\n 'landuse', 'width', 'est_width', 'junction']\n\n\n\n path = {}\n path['osmid'] = element['id']\n\n # remove any consecutive duplicate elements in the list of nodes\n grouped_list = groupby(element['nodes'])\n path['nodes'] = [group[0] for group in grouped_list]\n\n\n\n if 'tags' in element:\n # for relation in element_r['elements']:\n # if relation['type'] == 'relation':\n # for members in relation['members']:\n # if members['ref'] == element['id']:\n for useful_tag in useful_tags_path_e:\n if useful_tag in element['tags']:\n path[useful_tag] = element['tags'][useful_tag]\n # for useful_tag in useful_tags_path_r:\n # if useful_tag in relation['tags']:\n # try:\n # path[useful_tag] = path[useful_tag] + \";\" + relation['tags'][useful_tag]\n # except KeyError:\n # path[useful_tag] = relation['tags'][useful_tag]\n # pass\n\n return path\n def parse_osm_nodes_paths(osm_data):\n \"\"\"\n Construct dicts of nodes and paths with key=osmid and value=dict of\n attributes.\n\n Parameters\n ----------\n osm_data : dict\n JSON response from from the Overpass API\n\n Returns\n -------\n nodes, paths : tuple\n \"\"\"\n\n nodes = {}\n paths = {}\n relation = {}\n\n # for element in osm_data['elements']:\n # if element['type'] == 'relation':\n\n\n for element in osm_data['elements']:\n if element['type'] == 'node':\n key = element['id']\n nodes[key] = get_node(element)\n\n elif element['type'] == 'way': #osm calls network paths 'ways'\n key = element['id']\n # pp.pprint(element)\n paths[key] = get_path(element,osm_data)\n\n return nodes, paths\n def create_graph(response_jsons, name='unnamed', retain_all=True, bidirectional=False):\n \"\"\"\n Create a networkx graph from Overpass API HTTP response objects.\n\n Parameters\n ----------\n response_jsons : list\n list of dicts of JSON responses from from the Overpass API\n name : string\n the name of the graph\n retain_all : bool\n if True, return the entire graph even if it is not connected\n bidirectional : bool\n if True, create bidirectional edges for one-way streets\n\n Returns\n -------\n networkx multidigraph\n \"\"\"\n\n log('Creating networkx graph from downloaded OSM data...')\n start_time = time.time()\n\n # make sure we got data back from the server requests\n elements = []\n # for response_json in response_jsons:\n elements.extend(response_json['elements'])\n if len(elements) < 1:\n raise EmptyOverpassResponse('There are no data elements in the response JSON objects')\n\n # create the graph as a MultiDiGraph and set the original CRS to default_crs\n G = nx.MultiDiGraph(name=name, crs=settings.default_crs)\n\n # extract nodes and paths from the downloaded osm data\n nodes = {}\n paths = {}\n # for osm_data in response_jsons:\n nodes_temp, paths_temp = parse_osm_nodes_paths(response_jsons)\n for key, value in nodes_temp.items():\n nodes[key] = value\n for key, value in paths_temp.items():\n paths[key] = value\n\n # add each osm node to the graph\n for node, data in nodes.items():\n G.add_node(node, **data)\n\n # add each osm way (aka, path) to the graph\n G = ox.add_paths(G, paths, bidirectional=bidirectional)\n\n # retain only the largest connected component, if caller did not\n # set retain_all=True\n if not retain_all:\n G = get_largest_component(G)\n\n log('Created graph with {:,} nodes and {:,} edges in {:,.2f} seconds'.format(len(list(G.nodes())), len(list(G.edges())), time.time()-start_time))\n\n # add length (great circle distance between nodes) attribute to each edge to\n # use as weight\n if len(G.edges) > 0:\n G = ox.add_edge_lengths(G)\n\n return G\n def calculate_H(s_lat,s_lon,e_lat,e_lon):\n \"\"\"\n Calculate a distance with x,y coordinates with\n\n Parameters\n ----------\n s_lat : float (starting lat)\n s_lon : float (starting lon)\n e_lat : float (ending lat)\n e_lon : float (ending lon)\n\n Returns\n -------\n distance\n \"\"\"\n R = 6371.0\n snlat = radians(s_lat)\n snlon = radians(s_lon)\n elat = radians(e_lat)\n elon = radians(e_lon)\n actual_dist = 6371.01 * acos(sin(snlat) * sin(elat) + cos(snlat) * cos(elat) * cos(snlon - elon))\n actual_dist = actual_dist * 1000\n return actual_dist\n def bus_details_SD(adjacent_list):\n \"\"\"\n store all details from LTA data mall into dictionary\n\n Parameters\n ----------\n adjacent_list : dict\n\n Returns\n -------\n adjacent_list : dict\n \"\"\"\n\n temp = 0\n for x in results:\n if temp != x.get('ServiceNo'):\n temp = x.get('ServiceNo')\n count = 0\n adja_bus_stop = my_dictionary()\n adjacent_list.add(temp, adja_bus_stop)\n adja_bus_stop.add(count, [x.get('BusStopCode'), x.get('Distance')])\n count += 1\n else:\n adja_bus_stop.add(count, [x.get('BusStopCode'), x.get('Distance')])\n count += 1\n return adjacent_list\n def get_nearestedge_node(osm_id, a, G):\n \"\"\"\n Find the nearest node available in Open street map\n\n Parameters\n ----------\n osm_id : node ID\n a : plotting graph\n g : bus graph\n\n Returns\n -------\n temp_nearest_edge[1]/temp_nearest_edge[2] : nearest node to a way ID\n \"\"\"\n temp_y = G.nodes.get(osm_id).get('y')\n temp_x = G.nodes.get(osm_id).get('x')\n temp_nearest_edge = ox.get_nearest_edge(a, (temp_y, temp_x))\n temp_1 = temp_nearest_edge[0].coords[0]\n temp_2 = temp_nearest_edge[0].coords[1]\n temp1_x = temp_1[0]\n temp1_y = temp_1[1]\n temp_1_distance = calculate_H(temp1_y,temp1_x,temp_y,temp_x)\n\n temp2_x = temp_2[0]\n temp2_y = temp_2[1]\n temp_2_distance = calculate_H(temp2_y,temp2_x,temp_y,temp_x)\n if temp_1_distance < temp_2_distance:\n return temp_nearest_edge[1]\n else:\n return temp_nearest_edge[2]\n def delete_duplicate(x):\n \"\"\"\n Delete duplicate within a list\n\n Parameters\n ----------\n x : list\n\n Returns\n -------\n list\n \"\"\"\n return list(dict.fromkeys(x))\n def request_busG():\n \"\"\"\n Find all nodes that is a bus stop\n\n Returns\n -------\n busG : dict\n \"\"\"\n busG = {}\n for x in G.nodes.items():\n if x[1].get('highway') == 'bus_stop':\n xy = []\n xy.append(x[1].get('osmid'))\n xy.append(x[1].get('x'))\n xy.append(x[1].get('y'))\n busG[x[1].get('osmid')] = xy\n\n return busG\n\n # ---MAIN---#\n\n query_str = '[out:json][timeout:180];node[\"type\"=\"route\"](1.385700,103.887300,1.422000,103.925900);way[\"type\"=\"route\"](1.385700,103.887300,1.422000,103.925900);(relation[\"type\"=\"route\"](1.385700,103.887300,1.422000,103.925900);>;);out;'\n response_json = overpass_request(data={'data': query_str}, timeout=180)\n pp = pprint.PrettyPrinter(indent=4)\n # start = 1847853709\n # end = 410472575\n # end = 3737148763\n # bus transit\n # start = 2110621974\n # end = 2085845884\n\n adjacent_list = my_dictionary()\n\n G = ox.load_graphml('Bus_Overpass.graphml')\n\n if case == 1:\n return request_busG()\n n, e = ox.graph_to_gdfs(G)\n # e.to_csv(\"Edge_test_busstop.csv\")\n if len(results) == 0:\n\n results = bus_details_all(results) # Details from LTA Datamall, extracting all details such as service no, bus stop number\n\n adjacent_list = bus_details_SD(adjacent_list) # From results, it extracts bus stop number and distance\n start_busstop = (G.nodes.get(start)).get('asset_ref')\n end_busstop = (G.nodes.get(end)).get('asset_ref')\n\n #Start finding common bus service within the start bus stop and end bus stop\n try:\n if \";\" in (G.nodes.get(start).get('route_ref')):\n start_rr = (G.nodes.get(start).get('route_ref')).split(\";\")\n else:\n start_rr = []\n start_rr.append((G.nodes.get(start).get('route_ref')))\n print(\"TEST - G.nodes.get(end): \", G.nodes.get(end))\n if \";\" in (G.nodes.get(end).get('route_ref')):\n end_rr = (G.nodes.get(end).get('route_ref')).split(\";\")\n else:\n end_rr = []\n end_rr.append((G.nodes.get(end).get('route_ref')))\n common = list(set(start_rr) & set(end_rr))\n except:\n return -1\n\n \"\"\"\n This method strictly emphasis on greedy algorithm. Thus it will prioritze the numbers of transit rather than distance\n Check if any common bus service within start and end bus stop.\n If found, route_list will capture the entire route of the common bus service \n No transit will occuer as it is a straight path, start busstop -> end busstop\n If not found, the program will proceed to find a common bus stop within the start and end bus services. \n Thus a transit will occur, start busstop -> mid busstop -> end busstop\n \"\"\"\n route_list = {}\n mid_route_list = {}\n # print(\"TEST - Start: \", start_busstop)\n # print(\"TEST - End: \", end_busstop)\n # print(\"TEST - start_rr: \", start_rr)\n # print(\"TEST - end_rr: \", end_rr)\n # print(\"TEST - Common: \", common)\n common_mid = []\n if len(common) == 0: #No common bus service found\n while(len(common_mid) == 0): #Start finding a common mid busstop\n rona_one = []\n rona_two = []\n for start_to_mid in start_rr: #Capture all common mid busstop\n print(\"TEST - start_to_mid: \", start_to_mid)\n for bus_sequence in adjacent_list.get(start_to_mid):\n rona_one.append(str(adjacent_list.get(start_to_mid).get(bus_sequence)[0]))\n for mid_to_end in end_rr:\n print(\"TEST - mid_to_end: \", mid_to_end)\n for bus_sequence in adjacent_list.get(mid_to_end):\n rona_two.append(str(adjacent_list.get(mid_to_end).get(bus_sequence)[0]))\n found_br = []\n print(\"TEST rona 1:\", rona_one)\n print (\"TEST rona 2:\", rona_two)\n found_br.append(start_to_mid+\";\"+mid_to_end)\n found_br.extend(list(set(rona_one)&set(rona_two)))\n common_mid.append(found_br)\n\n print(\"TEST - common_mid: \",common_mid)\n\n bus_service = start_to_mid\n temp_bus = []\n mid_busstop = 0\n approved = 0\n for bus_sequence in adjacent_list.get(bus_service): #Finding bus service for start busstop -> mid busstop\n for x in range (0, len(common_mid)):\n for i in common_mid[x]:\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(start_busstop):\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n approved = 1\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(i) and approved == 1:\n mid_busstop = str(i)\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n approved = 0\n break\n if approved == 1:\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n if mid_busstop != 0:\n break\n if str(start_busstop) not in temp_bus or str(mid_busstop) not in temp_bus: #If not found, continue to next loop\n continue\n temp_bus = delete_duplicate(temp_bus)\n mid_route_list[bus_service] = temp_bus\n\n for x in G.nodes: #After finding bus service to mid busstop, start finding path mid busstop to end busstop\n if G.nodes.get(x).get('asset_ref') == mid_busstop:\n if \";\" in (G.nodes.get(x).get('route_ref')):\n start_rr = (G.nodes.get(x).get('route_ref')).split(\";\")\n else:\n start_rr = []\n start_rr.append((G.nodes.get(start).get('route_ref')))\n\n common = list(set(start_rr) & set(end_rr))\n start_busstop = mid_busstop\n if start == 1847853709: #If bus service started from punggol interchange\n for bus_service in common:\n temp_bus = []\n approved = 0\n for bus_sequence in adjacent_list.get(bus_service): #Capture bus route\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(start_busstop) and adjacent_list.get(bus_service).get(bus_sequence)[1] == 0:\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n approved = 1\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(end_busstop) and approved == 1:\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n approved = 0\n break\n if approved == 1:\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n if str(start_busstop) not in temp_bus or str(end_busstop) not in temp_bus:\n continue\n route_list[bus_service] = temp_bus\n else:\n for bus_service in common: #If bus service does not start from punggol interchange\n temp_bus = []\n approved = 0\n for bus_sequence in adjacent_list.get(bus_service): #Capture bus route\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(start_busstop):\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n approved = 1\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(end_busstop) and approved == 1:\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n approved = 0\n break\n if approved == 1:\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\n if str(start_busstop) not in temp_bus or str(end_busstop) not in temp_bus:\n continue\n route_list[bus_service] = temp_bus\n\n \"\"\"\n After capturing all the bus serivce. A comparison is made in favor for the number of bus stops\n It will choose the least amount of bus stops and store in post_compare\n \"\"\"\n compare = [0, 100]\n if len(route_list.keys()) > 1:\n for i in route_list:\n if len(route_list.get(i)) < compare[1]:\n compare[0] = i\n compare[1] = len(route_list.get(i))\n else:\n for i in route_list:\n compare[0] = i\n compare[1] = len(route_list.get(i))\n post_compare = []\n print(\"TEST - Mid route list: \", mid_route_list)\n if len(mid_route_list) != 0:\n for i in mid_route_list:\n post_compare.append(i)\n route_list[i] = mid_route_list.get(i)\n post_compare.append(compare[0])\n else:\n post_compare.append(compare[0])\n\n\n\n \"\"\"\n Upon comparison, it will start capturing the nodes within the bus path and store in plot_list\n \"\"\"\n plot_list = []\n try:\n print(\"TEST - post_Compare: \", post_compare)\n print(\"TEST - Route list: \", route_list)\n for count in range (0, len(post_compare)):\n for x in route_list.get(str(post_compare[count])):\n for i in G.nodes:\n if str(G.nodes.get(i).get('asset_ref')) == str(x):\n plot_list.append(G.nodes.get(i).get('osmid'))\n break\n except:\n return -1\n edge_list = []\n punggol = (1.403948, 103.909048)\n \"\"\"\n It will generate out the list of node ID for the UI to plot\n \"\"\"\n a = ox.load_graphml('Bus_graph.graphml')\n for x in plot_list:\n edge_list.append(get_nearestedge_node(x,a,G))\n\n print(\"TEST - Plot list: \", plot_list)\n print(\"TEST - Edge list: \", edge_list)\n final_route_list = []\n count_stops = len(plot_list)\n for x in range (0, len(edge_list)-1):\n final_route_list.append(nx.shortest_path(a, edge_list[x], edge_list[x+1]))\n print(final_route_list)\n return final_route_list\n\n def bus_details_all():\n headers = {\n 'AccountKey': '84lbH3B/QeOkRK/CHm3c2w==',\n 'UniqueUserID': '8ecabd56-08a2-e843-0a7a-9944dccf124a',\n 'accept': 'application/json'\n }\n global new_results\n if __name__ == \"__main__\":\n results = []\n bus_stop_url = \"http://datamall2.mytransport.sg/ltaodataservice/BusRoutes\"\n\n while True:\n new_results = requests.get(bus_stop_url,headers=headers,params={'$skip': len(results)}).json()['value']\n if new_results == []:\n return results\n else:\n results += new_results\n def calculate_H(s_lat,s_lon,e_lat,e_lon): #y,x y,x\n R = 6371.0\n snlat = radians(s_lat)\n snlon = radians(s_lon)\n elat = radians(e_lat)\n elon = radians(e_lon)\n actual_dist = 6371.01 * acos(sin(snlat) * sin(elat) + cos(snlat) * cos(elat) * cos(snlon - elon))\n actual_dist = actual_dist * 1000\n return actual_dist\n def walk_pathfinder(start_osmid, end_osmid):\n priority_Q = []\n heap_Q = []\n closed_routes = {}\n start_node = (0, None, start_osmid, 0)\n heapq.heappush(heap_Q, (start_node))\n closed_routes[start_osmid] = None\n while(True):\n temp = heapq.heappop(heap_Q)\n if temp[2] == end_osmid:\n temp_end = end_osmid\n path = []\n path.append(end_osmid)\n while (temp_end is not None):\n temp_list = closed_routes.get(temp_end)\n if temp_list is not None:\n temp_end = temp_list[0]\n path.append(temp_end)\n else:\n final_path = path[::-1]\n return final_path\n\n for counter, x in enumerate(list(G.edges())[0:]):\n if x[0] == temp[2]:\n if x[1] in closed_routes:\n continue\n else:\n length = list(G.edges.values())[counter].get(\"length\", None)\n current_length = length + temp[3]\n slat = radians(G.nodes.get(x[1]).get('y'))\n slon = radians(G.nodes.get(x[1]).get('x'))\n dist = 6371.01 * acos(sin(slat) * sin(elat) + cos(slat) * cos(elat) * cos(slon - elon))\n H = dist*1000\n if H < actual_dist + 100:\n F = current_length + H\n heapq.heappush(heap_Q, (F, x[0], x[1], current_length))\n closed_routes[x[1]] = [x[0], length]\n def delete_duplicate(x):\n return list(dict.fromkeys(x))\n def get_nearestedge_node(osm_id, y , x):\n temp_nearest_edge = ox.get_nearest_edge(G, (y, x))\n temp_1 = temp_nearest_edge[0].coords[0]\n temp_2 = temp_nearest_edge[0].coords[1]\n temp1_x = temp_1[0]\n temp1_y = temp_1[1]\n temp_1_distance = calculate_H(temp1_y, temp1_x, y, x)\n temp2_x = temp_2[0]\n temp2_y = temp_2[1]\n temp_2_distance = calculate_H(temp2_y, temp2_x, y, x)\n if temp_1_distance < temp_2_distance:\n return [temp_nearest_edge[1],temp_1_distance,temp1_x,temp1_y]\n else:\n return [temp_nearest_edge[2],temp_2_distance,temp2_x,temp2_y]\n def find_XY(node, graph):\n for x in graph.nodes.items():\n if x[1].get('osmid') == node:\n node_x = x[1].get('x')\n node_y = x[1].get('y')\n node_list = (node_y, node_x)\n return node_list\n\n start_time = time.time()\n\n # start = (103.9028788, 1.4044948)\n # end = (103.8999124, 1.4035004)\n # start = (103.9073345, 1.4060506)\n # end = (103.9172982, 1.3956014)\n #\n # start = (103.9073345, 1.4060506)\n # end = (103.9172982, 1.3956014)\n\n # start = (103.910650, 1.400818)\n # end = (103.910296, 1.399252)\n\n # start =(103.9024 , 1.4052)\n # end = (103.897332 , 1.402272)\n\n # start = (103.91256451606752, 1.402580108598971)\n # end = (103.91270935535432, 1.401523634635178)\n\n start_osmid = 0\n end_osmid = 0\n punggol = (1.403948, 103.909048)\n # G = ox.graph_from_point(punggol, distance=3500, truncate_by_edge=True, network_type=\"walk\")\n G = ox.load_graphml('AStar_walk.graphml')\n nodelist_G = list(G.nodes.values())\n\n \"\"\"\n Start finding start and end Node ID.\n If not found, find nearest node from the given coordinates by the user\n \"\"\"\n for i in range (0, len(nodelist_G)):\n if nodelist_G[i].get('y') == start[1] and nodelist_G[i].get('x') == start[0]:\n start_osmid = nodelist_G[i].get('osmid')\n if nodelist_G[i].get('y') == end[1] and nodelist_G[i].get('x') == end[0]:\n end_osmid = nodelist_G[i].get('osmid')\n\n if start_osmid == 0 or end_osmid == 0:\n start_osmid = ox.get_nearest_node(G, (start[1], start[0]))\n end_osmid = ox.get_nearest_node(G, (end[1], end[0]))\n\n \"\"\"\n To calculate distance from 2 x,y axis\n \"\"\"\n R = 6371.0\n snlat = radians(start[1])\n snlon = radians(start[0])\n elat = radians(end[1])\n elon = radians(end[0])\n actual_dist = 6371.01 * acos(sin(snlat) * sin(elat) + cos(snlat) * cos(elat) * cos(snlon - elon))\n actual_dist = actual_dist*1000\n edgelist_G = list(G.edges.values())\n\n\n \"\"\"\n After having start and end nodes.\n The program will set a radius of 200 meters from start and end nodes\n Every nodes within 200 meters and is a bus stop node will be captured and stored in end1 and end2\n If within 200meters no bus stop is found, it will have a constant increment of 200meters until bus stop if found on both sides\n \"\"\"\n bus_G = bus_layer(start_osmid,end_osmid, None, 1)\n start1 = start\n start2 = end\n\n for i in bus_G:\n temp_dis = calculate_H(bus_G.get(i)[2],bus_G.get(i)[1],start1[1], start1[0])\n bus_G.get(i).append(temp_dis)\n temp_dis = calculate_H(bus_G.get(i)[2], bus_G.get(i)[1], start2[1], start2[0])\n bus_G.get(i).append(temp_dis)\n end1 = []\n end2 = []\n limit = 0\n while (len(end1) == 0):\n limit += 200\n for i in bus_G:\n if bus_G.get(i)[3] < limit:\n temp = []\n temp.append(bus_G.get(i)[3])\n temp.append(bus_G.get(i)[0])\n temp.append(bus_G.get(i)[1])\n temp.append(bus_G.get(i)[2])\n hq.heappush(end1, temp)\n limit = 0\n while (len(end2) == 0):\n limit += 200\n for i in bus_G:\n if bus_G.get(i)[4] < limit:\n temp = []\n temp.append(bus_G.get(i)[4])\n temp.append(bus_G.get(i)[0])\n temp.append(bus_G.get(i)[1])\n temp.append(bus_G.get(i)[2])\n hq.heappush(end2, temp)\n\n \"\"\"\n The following codes will capture all nodes on the road that is closest to the bus stop\n It will be stored in path1 and path2.\n \"\"\"\n path1 = []\n for i in range (0, len(end1)):\n if 1847853709 == end1[i][1]:\n path1 = []\n path1.append([2019165453, 0, 0, 0, 0])\n break\n else:\n path1.append(get_nearestedge_node(end1[i][1], end1[i][3], end1[i][2]))\n\n for x in range (0, len(path1)):\n path1[x].append(calculate_H(path1[x][3],path1[x][2], start1[1], start1[0]))\n\n path2 = []\n for i in range (0, len(end2)):\n path2.append(get_nearestedge_node(end2[i][1], end2[i][3], end2[i][2]))\n for x in range (0, len(path2)):\n path2[x].append(calculate_H(path2[x][3],path2[x][2], start2[1], start2[0]))\n\n \"\"\"\n Bus results will store all data obtained from lta datamall\n It will start calculating all possibilities from all bus stop captured in end1 and end2\n Example, end1 contains [1,2,3], end2 contains [4,5,6]\n The following code will start to find a route from [1,4] , [1,5] , [1,6] then [2,4] , [2,5] , [2,6] then [3,4] , [3,5] , [3,6]\n Once all these route is found, it will proceed to compare the derived routes and capture the least amount of bus stop\n Example, [1,4] is the shortest route found\n Upon capturing the route with the least amount of bus stop, it will start to plot the walking A* algorithm from start point to bus stop\n Example, [Start point, 1] then [End point, 4]\n In this case, it will return [[Start point,1] , [1,4] , [End point,4]]\n \"\"\"\n # bus_results = bus_details_all()\n # with open(\"data\\ltadatamall.txt\",\"w+\") as filehandler:\n # json.dump(bus_results,filehandler)\n with open(\"data\\ltadatamall.txt\", \"r\") as filehandler:\n bus_results=json.load(filehandler)\n approved = 0\n path1_end_count = 0\n path2_end_count = 0\n for i in range (0, len(end1)):\n if 1847853709 == end1[i][1]:\n approved = 1\n final_route_list = []\n if approved == 1:\n count = 99\n for x in range (0, len(end2)):\n final_route_list = bus_layer(1847853709, end2[x][1], bus_results, None)\n try:\n if len(final_route_list) < count:\n path1[path1_end_count][0] = 4598672210\n path2_end_count = x\n temp_route_list = final_route_list.copy()\n count = len(temp_route_list)\n except:\n continue\n else:\n count = 99\n if len(final_route_list) == 0:\n for i in range (0, len(end1)):\n for x in range (0, len(end2)):\n final_route_list = bus_layer(end1[i][1], end2[x][1], bus_results, None)\n if final_route_list == -1:\n continue\n if len(final_route_list) < count:\n path1_end_count = i\n path2_end_count = x\n temp_route_list = final_route_list\n count = len(temp_route_list)\n\n path1 = walk_pathfinder(start_osmid, path1[path1_end_count][0])\n path2 = walk_pathfinder(end_osmid, path2[path2_end_count][0])\n walking_Path1 = []\n walking_Path2 = []\n bus_path = []\n walking_Path2.append((end[1], end[0]))\n for x in path1:\n walking_Path1.append(find_XY(x, G))\n for x in path2:\n walking_Path2.append(find_XY(x, G))\n\n #ox.plot_graph_routes(G, [path1, path2])\n plotting_route = []\n \"\"\"\n Upon capturing all the bus routes and walking routes, it will proceed to return the route for further processing\n \"\"\"\n\n a = ox.load_graphml('WalkBus_end_graph.graphml')\n try:\n for x in temp_route_list:\n plotting_route.extend(x)\n plotting_route = delete_duplicate(plotting_route)\n Tried = True\n except:\n return [[0], [0], [0]]\n try:\n #ox.plot_graph_route(a, plotting_route)\n for x in plotting_route:\n bus_path.append(find_XY(x, a))\n except:\n #ox.plot_graph_routes(a, temp_route_list)\n Tried = False\n for x in plotting_route:\n for i in x:\n bus_path.append(find_XY(i, a))\n\n # print(\"TEST - Start OSMID: \", start_osmid)\n # print(\"TEST - End OSMID: \", end_osmid)\n # print(\"TEST - Path 1: \" ,path1)\n # print(\"TEST - Path 1 (X,Y): \", walking_Path1)\n # print(\"TEST - Path 2: \" ,path2)\n # print(\"TEST - Path 2 (X,Y): \", walking_Path2)\n # print(\"TEST - BusRoute: \", plotting_route)\n # print(\"TEST - Bus Path (X,Y): \", bus_path)\n # ox.plot_graph_route(G, final_path, fig_height=10, fig_width=10)\n if Tried == True:\n return [walking_Path1, bus_path, walking_Path2]\n else:\n return [walking_Path1, bus_path, walking_Path2]\n\n print(\"--- %s seconds ---\" % (time.time() - start_time))","def _run(self):\n self._algorithm(self._list, self)","def parallel_run():\n from IPython.parallel import Client\n\n c = Client() # here is where the client establishes the connection\n lv = c.load_balanced_view() # this object represents the engines (workers)\n\n\n rays = []\n maxs=25\n bounding = AABA(xmin=0, ymin=0, zmin=0, xmax=maxs, ymax=maxs, zmax=maxs,)\n gridd = np.zeros((maxs,maxs,maxs))\n # spectrum for red to nir leaves\n red_nir_leaves = spectrum(np.array([0.5, 0.85]), np.array([0.1, 0.6]), np.array([0.5, 0.1]))\n # spectrum for soil\n red_nir_soil = spectrum(np.array([0.5, 0.85]), np.array([0.3, 0.4]), np.array([0.0, 0.0]))\n\n\n # scattering setup\n scatt = BRDSF(red_nir_leaves, 0.0)\n lf = leaf(55.0, 0.8) # leaf angle distribution and leaf area density\n\n\n tasks = []\n for x in xrange(maxs):\n for y in xrange(maxs):\n tasks.append(lv.apply(prun, x,y, maxs, gridd, scatt, red_nir_soil, bounding, lf))\n\n result = [task.get() for task in tasks] # blocks until all results are back\n\n return results","def route_layout(self):\n self.route_pins()\n self.route_internal()\n self.route_supplies()","def post_process(self, xout, params_out):\n # Should be used by all methods matching \"solve_*\"\n for post_processor in self.post_processors:\n xout, params_out = post_processor(xout, params_out)\n return xout, params_out","def extractor_multiprocess(self):\n pool = multiprocessing.Pool()\n queue = multiprocessing.Queue()\n queue.put(\"safe\")\n end = len(next(os.walk(self.datadir))[2])\n error = 0\n\n extractor_iterator = ((directory)\n for directory in os.listdir(self.datadir))\n with jsonlines.open(self.output, \"w\") as f:\n for x in tqdm.tqdm(\n pool.imap_unordered(self.extract_unpack, extractor_iterator), total=end\n ):\n if not x:\n \"\"\"\n To input error class or function\n \"\"\"\n error += 1\n continue\n msg = queue.get()\n if msg == \"safe\":\n f.write(x)\n queue.put(\"safe\")\n\n pool.close()","def bulk_process(self):\n\n def actions():\n try:\n task = self.queue.get(block=False, timeout=None)\n\n if task['action'] == 'index':\n yield {\n '_op_type': 'index',\n '_index': self.ensure_index(task),\n '_id': task['id'],\n 'doc': task['properties']\n }\n elif task['action'] == 'delete':\n yield {\n '_op_type': 'delete',\n '_index': self.ensure_index(task),\n '_id': task['id'],\n 'doc': task['properties']\n }\n else:\n raise NotImplementedError\n\n except Empty:\n pass\n\n for success, info in streaming_bulk(self.es_client, actions()):\n if success:\n self.queue.task_done()","def apply(self, callback, route):","def partition_processor(partitionlinechunks):\n\n model_pipe_object = joblib.load(SparkFiles.get(\"mmp_phase1_D2.clf\"))\n\n def set_predictions(x):\n segment = model_pipe_object.predict_proba(x)\n return segment\n\n df_with_nan = build_dataframe(partitionlinechunks)\n df_with_newline = df_with_nan.replace(u\"NULL\", pd.np.nan)\n behaviour_df = df_with_newline.replace(u\"\\\\N\", pd.np.nan)\n predictions_ser = set_predictions(behaviour_df)\n\n predictions_list = [value for value in [zip(predictions_ser.index, predictions_ser.loc[:,'A'], predictions_ser.loc[:,'Y'], predictions_ser.loc[:,'segment'], predictions_ser.loc[:,'model_version'])]]\n return iter(predictions_list)","def compute(self):\n try:\n self.set_trackline()\n except:\n app.logger.warning(\"Could not process trackline results. URL may be invalid?\")\n\n if Job.exists(self.task_id, connection=redis_connection):\n job = Job.fetch(self.task_id, connection=redis_connection)\n self.task_result = unicode(job.meta.get(\"outcome\", \"\"))\n\n self.save()","def split(self):\n st = time()\n tokens = self._build_args.tokens\n\n for token_split in IStorage._tokens_partitions(tokens, config.min_number_of_tokens,\n config.number_of_partitions):\n storage_id = uuid.uuid4()\n log.debug('assigning to %s %d tokens', str(storage_id), len(token_split))\n new_args = self._build_args._replace(tokens=token_split, storage_id=storage_id)\n self.__class__._store_meta(new_args)\n\n yield self.__class__.build_remotely(new_args)\n log.debug('completed split of %s in %f', self.__class__.__name__, time() - st)","def _run_parallel(\n self, processes: int = 2, build_results: bool = True\n ) -> bool:\n # At first sight, it might seem simpler to use the multiprocessing Pool\n # Class rather than Processes and Queues. However, this way is faster.\n work_queue = Queue() # type: Queue\n done_queue = Queue() # type: Queue\n workers = self._n_workers(processes=processes)\n\n chunks = self.match_generator.build_match_chunks()\n for chunk in chunks:\n work_queue.put(chunk)\n\n self._start_workers(workers, work_queue, done_queue, build_results)\n self._process_done_queue(workers, done_queue, build_results)\n\n return True","def refine(self, refine_results):\n for phase_path, phase_refinement_results in refine_results.items():\n phase = self.phases[phase_path]\n tx = phase.options['transcription']\n gd = tx.grid_data\n\n need_refine = phase_refinement_results['need_refinement']\n if not phase.refine_options['refine'] or not np.any(need_refine):\n refine_results[phase_path]['new_order'] = gd.transcription_order\n refine_results[phase_path]['new_num_segments'] = gd.num_segments\n refine_results[phase_path]['new_segment_ends'] = gd.segment_ends\n continue\n\n # Refinement is needed\n gd = phase.options['transcription'].grid_data\n numseg = gd.num_segments\n\n refine_seg_idxs = np.where(need_refine)\n P = np.zeros(numseg)\n P[refine_seg_idxs] = np.log(self.error[phase_path][refine_seg_idxs] /\n phase.refine_options['tolerance']) / np.log(\n gd.transcription_order[refine_seg_idxs])\n P = np.ceil(P).astype(int)\n\n if gd.transcription == 'gauss-lobatto':\n odd_idxs = np.where(P % 2 != 0)\n P[odd_idxs] += 1\n\n new_order = gd.transcription_order + P\n B = np.ones(numseg, dtype=int)\n\n raise_order_idxs = np.where(gd.transcription_order + P <= phase.refine_options['max_order'])\n split_seg_idxs = np.where(gd.transcription_order + P > phase.refine_options['max_order'])\n\n new_order[raise_order_idxs] = gd.transcription_order[raise_order_idxs] + P[raise_order_idxs]\n new_order[split_seg_idxs] = phase.refine_options['min_order']\n\n B[split_seg_idxs] = np.around((gd.transcription_order[split_seg_idxs] +\n P[split_seg_idxs]) / phase.refine_options['min_order']).astype(int)\n\n new_order = np.repeat(new_order, repeats=B)\n new_num_segments = int(np.sum(B))\n new_segment_ends = split_segments(gd.segment_ends, B)\n\n refine_results[phase_path]['new_order'] = new_order\n refine_results[phase_path]['new_num_segments'] = new_num_segments\n refine_results[phase_path]['new_segment_ends'] = new_segment_ends\n\n tx.options['order'] = new_order\n tx.options['num_segments'] = new_num_segments\n tx.options['segment_ends'] = new_segment_ends\n tx.init_grid()","def run(self):\n while True:\n next_task = self.task_queue.get()\n if next_task is None:\n # Poison pill means shutdown\n self.task_queue.task_done()\n break\n # Fetch answer from task\n answer = next_task()\n self.task_queue.task_done()\n # Put into result queue\n self.result_queue.put(answer)\n return","def online_server_garbler_phase(env, pipe, storage):\n\n global clienf_inf_times, num_infs_completed, request_times, waiting_times, offline_times\n while True:\n request = yield pipe.get()\n start_time = env.now\n waiting_time = start_time - request['request_time'] \n waiting_times.append(waiting_time)\n \n before_gc = env.now\n yield storage.get(NUM_RELU)\n offline_times.append(env.now - before_gc)\n\n\n for i in range(len(utils.on_client_compute_relu)): # for i in range(nonlinear layers)...\n yield env.timeout(utils.on_client_write_linear[i] / bandwidth) # client sends x-r to server\n yield env.timeout(utils.on_server_compute_linear[i]) # server performs linear eval (conv)\n yield env.timeout(utils.on_server_write_relu[i] / bandwidth) # server sends encoded labels to client\n yield env.timeout(utils.on_client_compute_relu[i]) # client evaluates garbled circuit\n\n \n # send prediction to client\n yield env.timeout(utils.on_server_write_pred / bandwidth) # server sends prediction to client\n\n num_infs_completed +=1\n client_inf_times.append(env.now-start_time)","def build_chunks(results, metadata):\n\n for result in results:\n chunk = connector_pb2.DataChunk()\n for field in metadata.fieldInfo:\n set_value(result, field.name, chunk)\n yield chunk","def run(self):\n # For each microenvironment that the person visits\n while self.routing_node_id != 'end':\n # Get the next node, and this activity class and arguments.\n self.routing_node_id, activity_class, kwargs = self.routing.get_next_activity(self.routing_node_id)\n\n # Add this instance to the arguments list\n kwargs['person'] = self\n\n # Create a parametrised instance of the activity\n this_activity_class = activity_class(self.simulation_params, **kwargs)\n \n # set an event flag to mark end of activity and call the activity class\n finished_activity = self.env.event() \n self.env.process(this_activity_class.start(finished_activity))\n yield finished_activity","def finalize(self):\n routes = self.routes.copy()\n for child in self._children:\n routes.extend(list(child.tree_routes))\n\n # Make a new Map() out of all of the routes.\n rule_map = Map([route.create_rule() for route in routes])\n self._route_map = rule_map\n\n self.finalized = True","def recv_messages(self):\n while True:\n b = unwrap_read(self.sock.recv(4096))\n msgs = self.parser.feed(b)\n if msgs:\n for msg in msgs:\n self.router.incoming(msg)\n return","def __call__(self, ctx: ResolutionContext) -> Coroutine[None, None, RT]:","def run(self):\n import sacc\n import healpy\n import treecorr\n # Load the different pieces of data we need into\n # one large dictionary which we accumulate\n data = {}\n self.load_tomography(data)\n self.load_shear_catalog(data)\n self.load_random_catalog(data)\n # This one is optional - this class does nothing with it\n self.load_lens_catalog(data)\n # Binning information\n self.read_nbin(data)\n\n # Calculate metadata like the area and related\n # quantities\n meta = self.calculate_metadata(data)\n\n # Choose which pairs of bins to calculate\n calcs = self.select_calculations(data)\n\n sys.stdout.flush()\n \n # This splits the calculations among the parallel bins\n # It's not necessarily the most optimal way of doing it\n # as it's not dynamic, just a round-robin assignment,\n # but for this case I would expect it to be mostly fine\n results = []\n for i,j,k in self.split_tasks_by_rank(calcs):\n results += self.call_treecorr(data, i, j, k)\n\n # If we are running in parallel this collects the results together\n results = self.collect_results(results)\n\n # Save the results\n if self.rank==0:\n self.write_output(data, meta, results)","def _worker(pipelines: List[Pipeline], source: Queue, sink: Queue):\n pipelines = list(pipelines)\n for i, p in enumerate(pipelines):\n if isinstance(p, ConvertT2S):\n pipelines[i] = ConvertT2S()\n\n def processor(article):\n for p in pipelines:\n article = p(article)\n return article\n\n while True:\n article = source.get()\n if article == 'EXIT':\n return\n article = list(processor(article))\n sink.put(article)","def process_solution(self, solution: dict) -> (list, float):\n start_time = time() * 1000\n nodes = self.application.nodes()\n start = np.min(nodes)\n # fill route with None values\n route = [None] * len(self.application)\n # get nodes from sample\n # NOTE: Prevent duplicate node entries by enforcing only one occurrence per node along route\n logging.info(str(solution.items()))\n\n for (node, timestep), val in solution.items():\n if val:\n logging.info((node, timestep))\n if val and (node not in route):\n route[timestep] = node\n\n # check whether every timestep has only 1 node flagged\n for i in nodes:\n relevant_nodes = []\n relevant_timesteps = []\n for (node, timestep) in solution.keys():\n if node == i:\n relevant_nodes.append(solution[(node, timestep)])\n if timestep == i:\n relevant_timesteps.append(solution[(node, timestep)])\n if sum(relevant_nodes) != 1 or sum(relevant_timesteps) != 1:\n # timestep or nodes have more than 1 or 0 flags\n return None, round(time() * 1000 - start_time, 3)\n\n # check validity of solution\n if sum(value == 1 for value in solution.values()) > len(route):\n logging.warning(\"Result is longer than route! This might be problematic!\")\n return None, round(time() * 1000 - start_time, 3)\n\n # run heuristic replacing None values\n if None in route:\n # get not assigned nodes\n nodes_unassigned = [node for node in list(nodes) if node not in route]\n nodes_unassigned = list(np.random.permutation(nodes_unassigned))\n for idx, node in enumerate(route):\n if node is None:\n route[idx] = nodes_unassigned[0]\n nodes_unassigned.remove(route[idx])\n\n # cycle solution to start at provided start location\n if start is not None and route[0] != start:\n # rotate to put the start in front\n idx = route.index(start)\n route = route[idx:] + route[:idx]\n\n # print route\n parsed_route = ' ->\\n'.join([f' Node {visit}' for visit in route])\n logging.info(f\"Route found:\\n{parsed_route}\")\n return route, round(time() * 1000 - start_time, 3)","def process_results(self):\n return self._do_action_under_lock(self._process_results)","def mirror_batch(self, representations):\n filehandles = []\n requests = []\n representations_by_response_url = dict()\n \n for representation in representations:\n if not representation.mirror_url:\n representation.mirror_url = representation.url\n # Turn the mirror URL into an s3.amazonaws.com URL.\n bucket, filename = self.bucket_and_filename(\n representation.mirror_url\n )\n response_url = self.url(bucket, filename)\n representations_by_response_url[response_url] = (\n representation)\n bucket, remote_filename = self.bucket_and_filename(\n representation.mirror_url)\n fh = representation.content_fh()\n filehandles.append(fh)\n request = self.pool.upload(remote_filename, fh, bucket=bucket,\n content_type=representation.media_type)\n requests.append(request)\n # Do the upload.\n\n def process_response(response):\n representation = representations_by_response_url[response.url]\n if response.status_code == 200:\n source = representation.local_content_path\n if representation.url != representation.mirror_url:\n source = representation.url\n if source:\n print \"MIRRORED %s => %s\" % (\n source, representation.mirror_url)\n else:\n print \"MIRRORED %s\" % representation.mirror_url\n representation.set_as_mirrored()\n else:\n representation.mirrored_at = None\n representation.mirror_exception = \"Status code %d: %s\" % (\n response.status_code, response.content)\n\n try:\n for response in self.pool.as_completed(requests):\n process_response(response)\n except ConnectionError, e:\n # This is a transient error; we can just try again.\n print e\n pass\n except HTTPError, e:\n # Probably also a transient error. In any case\n # there's nothing we can do about it but try again.\n print e\n pass\n\n # Close the filehandles\n for fh in filehandles:\n fh.close()","def routes(self) -> List[Tuple[int, bytes]]:\n raise NotImplementedError() # pragma: no cover","def process_response(self, response):\n json = response.json()\n for resp in json[\"responses\"]:\n sub_qry = self._current_query.get(int(resp[\"id\"]))\n self.context.pending_request().map_json(resp[\"body\"], sub_qry.return_type)","def chunk(self, count):\n page = 1\n results = self.for_page(page, count).get()\n\n while len(results) > 0:\n yield results\n\n page += 1\n\n results = self.for_page(page, count).get()","def run(self):\n super().run()\n echo = self.echo\n local = self.local\n remote = self.remote\n transport = Transceiver(local)\n transport.set_timeout(0.5)\n self.__result: list[Entry] = []\n\n while True:\n try:\n packet = transport.recv(None)\n params = frame.deserialize(packet)\n seq = params[\"seq\"]\n total = params[\"total\"]\n t_master = params[\"t_master\"]\n infinite = params[\"infinite\"]\n payload = params[\"payload\"]\n\n t_slave = time.time()\n if echo:\n data_send = frame.serialize(infinite, seq, total, t_master, t_slave, payload)\n transport.send(remote, data_send)\n t_ul = (t_slave - t_master) * 1000\n self.add_result(Entry(seq, total, t_ul, 0))\n print(f\"seq = {seq}, ul = {t_ul:.2f} ms, payload: {hex_str(payload)}\")\n if frame.is_end(params):\n print(f\"receive last packet!\")\n break\n except socket.timeout:\n continue\n except KeyboardInterrupt:\n break","def dispatch(self, queue):\n context = zmq.Context()\n socket = noBlockREQ(context)\n \n seedsQ1 = Queue()\n seedsQ2 = Queue()\n for address in self.seeds:\n seedsQ1.put(address)\n\n connectT = Thread(target=connectToSeeds, name=\"Connect to Seeds\", args=(socket, seedsQ1))\n connectT.start()\n\n toDisconnectQ = Queue()\n disconnectT = Thread(target=disconnectToSeeds, name=\"Disconnect to Seeds\", args=(socket, toDisconnectQ))\n disconnectT.start()\n\n pFindSeeds = Process(target=findSeeds, name=\"Find Seeds\", args=(set(self.seeds), [seedsQ1], [toDisconnectQ], log, 2000, 10, seedsQ2))\n pFindSeeds.start()\n\n pInput = Process(target=getSeedFromFile, name=\"Get seed from file\", args=(seedsQ1, seedsQ2))\n pInput.start()\n\n graph = {}\n depth = 1\n data = {}\n url_mapper = {url:f\"url_{i}\" for i, url in enumerate(self.urls)}\n \n src = set()\n while True: \n new_data = {}\n while len(self.urls):\n try:\n url = self.urls[0]\n self.urls.pop(0)\n self.urls.append(url)\n with counterSocketReq:\n socket.send_json((\"URL\", self.uuid, url))\n log.debug(f\"Send {url}\", \"dispatch\")\n response = socket.recv_pyobj()\n assert isinstance(response, tuple), f\"Bad response, expected <tuple> find {type(response)}\"\n assert len(response) == 2, \"bad response size\"\n assert response[0] == 'RESPONSE', \"Unexpected response format\"\n _, package = response\n log.debug(f\"Received a package with size: {len(package)}\", \"dispatch\")\n for recv_url, html in package.items():\n try:\n idx = self.urls.index(recv_url)\n log.info(f\"{recv_url} {GREEN}OK{RESET}\", \"dispatch\")\n new_data[recv_url] = html\n self.urls.pop(idx)\n except ValueError:\n log.debug(f'Unnecesary {recv_url}', 'dispatch')\n except AssertionError as e:\n log.error(e, \"dispatch\")\n except zmq.error.Again as e:\n log.debug(e, \"dispatch\")\n except Exception as e:\n log.error(e, \"dispatch\")\n time.sleep(0.8)\n \n log.info(f'Depth {depth} done', 'dispatch')\n for url, html in new_data.items():\n graph[url] = set()\n try:\n text = html.decode()\n soup = BeautifulSoup(html, 'html.parser')\n tags = soup.find_all(valid_tags)\n new_urls = [['src', 'href'][tag.has_attr('href')] for tag in tags]\n changes = []\n for i, attr in enumerate(new_urls):\n url_dir = urljoin(url, tags[i][attr])\n graph[url].add(url_dir)\n if url_dir not in url_mapper:\n url_mapper[url_dir] = f'url_{len(url_mapper)}'\n changes.append((tags[i][attr], url_mapper[url_dir]))\n if attr == 'src' or tags[i].name == 'link':\n src.add(url_dir)\n continue\n self.urls.append(url_dir)\n html = change_html(text, changes).encode()\n except UnicodeDecodeError:\n log.debug(f'{url} is not decodeable', 'dispatch')\n except: # BeautifulSoup strange exceptions related with his's logger\n pass\n new_data[url] = html\n data.update(new_data)\n self.urls = set(self.urls)\n self.urls.difference_update(self.old)\n self.old.update(self.urls)\n self.urls = list(self.urls)\n \n if depth > self.depth:\n break\n if depth == self.depth:\n src.difference_update(self.old)\n self.old.update(src)\n self.urls = list(src)\n depth += 1\n log.info(f\"Number of URLs to be requested for download: {RED}{len(self.urls)}{RESET}\", \"dispatch\")\n \n log.info(f\"Starting to write data\", \"dispatch\")\n for i, url in enumerate(self.originals):\n try:\n res = HtmlResponse(url=url, body=data[url], encoding='utf8')\n base = res.css('title::text')[0].get()\n except:\n base = f\"web_page_{i}\"\n try:\n os.makedirs(f'downloads/{base}-data')\n except:\n pass\n writer(f'downloads/{base}-data', url, set(), data, url_mapper, graph) \n \n html = data[url]\n if len(graph[url]) > 0:\n text = data[url].decode()\n changes = []\n for dep in graph[url]:\n name = url_mapper[dep]\n changes.append((name, f'{base}-data/{name}'))\n html = change_html(text, changes).encode()\n with open(f'downloads/{base}', 'wb') as fd:\n fd.write(html)\n \n log.info(f\"Dispatcher:{self.uuid} has completed his URLs succefully\", \"dispatch\")\n log.debug(f\"Dispatcher:{self.uuid} disconnecting from system\", \"dispatch\")\n #disconnect\n\n queue.put(True)\n pFindSeeds.terminate()\n pInput.terminate()","def do_process_user_file_chunks(\n page_size: int, error_handler: ErrorHandler, position: int, participant: Participant\n):\n \n # FIXME: this is a gross hack to force some time related safety, which is only ever used deep\n # inside of data processing.\n common_constants.LATEST_POSSIBLE_DATA_TIMESTAMP = \\\n int(time.mktime((timezone.now() + timedelta(days=90)).timetuple()))\n \n # Declare a defaultdict of a tuple of 2 lists\n all_binified_data = defaultdict(lambda: ([], []))\n ftps_to_remove = set()\n # The ThreadPool enables downloading multiple files simultaneously from the network, and continuing\n # to download files as other files are being processed, making the code as a whole run faster.\n # In principle we could make a global pool that is free-memory aware.\n pool = ThreadPool(CONCURRENT_NETWORK_OPS)\n survey_id_dict = {}\n \n # A Django query with a slice (e.g. .all()[x:y]) makes a LIMIT query, so it\n # only gets from the database those FTPs that are in the slice.\n # print(participant.as_dict())\n print(\"Number Files To Process:\", participant.files_to_process.exclude(deleted=True).count())\n print(f\"will process {page_size} files.\")\n print(\"current count processing within this run:\", position)\n \n # TODO: investigate, comment. ordering by path results in files grouped by type and\n # chronological order, which is perfect for download efficiency... right? would it break anthing?\n files_to_process = participant.files_to_process \\\n .exclude(deleted=True) #.order_by(\"s3_file_path\", \"created_on\")\n \n # This pool pulls in data for each FileForProcessing on a background thread and instantiates it.\n # Instantiating a FileForProcessing object queries S3 for the File's data. (network request))\n files_for_processing = pool.map(\n FileForProcessing, files_to_process[position: position + page_size], chunksize=1\n )\n \n for file_for_processing in files_for_processing:\n with error_handler:\n process_one_file(\n file_for_processing, survey_id_dict, all_binified_data, ftps_to_remove\n )\n pool.close()\n pool.terminate()\n \n # there are several failure modes and success modes, information for what to do with different\n # files percolates back to here. Delete various database objects accordingly.\n more_ftps_to_remove, number_bad_files, earliest_time_bin, latest_time_bin = upload_binified_data(\n all_binified_data, error_handler, survey_id_dict, participant\n )\n ftps_to_remove.update(more_ftps_to_remove)\n \n # Update the data quantity stats, if it actually processed any files\n if len(files_to_process) > 0:\n calculate_data_quantity_stats(participant,\n earliest_time_bin_number=earliest_time_bin,\n latest_time_bin_number=latest_time_bin)\n \n # Actually delete the processed FTPs from the database\n FileToProcess.objects.filter(pk__in=ftps_to_remove).delete()\n return number_bad_files","def post(self, location_name):\n # get grass and actinia module lists\n module_list = createModuleList(self)\n pc_list = createProcessChainTemplateList()\n # TODO: find out size before ?\n grass_module_list = []\n actinia_module_list = []\n\n for module in module_list:\n grass_module_list.append(module['id'])\n\n for module in pc_list:\n actinia_module_list.append(module['id'])\n\n rdc = self.preprocess(has_json=True, location_name=location_name)\n\n if rdc:\n rdc.set_storage_model_to_file()\n\n new_pc = []\n for module in rdc.request_data['list']:\n if \"module\" in module:\n name = module[\"module\"]\n if name == \"importer\" or name == \"exporter\":\n new_pc.append(module)\n elif name in grass_module_list:\n new_pc.append(module)\n elif name in actinia_module_list:\n module_pc = fillTemplateFromProcessChain(module)\n new_pc.extend(module_pc)\n else:\n msg = \"Module %s is not of type importer, exporter, grass-module or an actinia-module.\" % name\n return make_response(jsonify(SimpleResponseModel(\n status=\"error\",\n message=msg\n )), 409)\n else:\n new_pc.append(module)\n\n rdc.request_data['list'] = new_pc\n\n enqueue_job(self.job_timeout, start_job, rdc)\n\n html_code, response_model = pickle.loads(self.response_data)\n return make_response(jsonify(response_model), html_code)","def process_deferred_queue(self):\n\n self.process_queue(self.deferred_queue)\n\n if self.depth_counter == 0:\n self.process_queue(self.complex_deferred_queue)","def process(self):"],"string":"[\n \"def solve_route(inputs, chunk):\\r\\n rt = Route(**inputs)\\r\\n if inputs[\\\"pair_type\\\"] is helpers.PreassignedODPairType.one_to_one:\\r\\n rt.logger.info(f\\\"Processing origins OID {chunk[0]} to {chunk[1]} as job id {rt.job_id}\\\")\\r\\n elif inputs[\\\"pair_type\\\"] is helpers.PreassignedODPairType.many_to_many:\\r\\n rt.logger.info(f\\\"Processing chunk {chunk[0]} as job id {rt.job_id}\\\")\\r\\n rt.solve(chunk)\\r\\n rt.teardown_logger()\\r\\n return rt.job_result\",\n \"def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches\\r\\n # Select the inputs to process\\r\\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n self._select_inputs_one_to_one(chunk_definition)\\r\\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n self._get_od_pairs_for_chunk(chunk_definition)\\r\\n self._select_inputs_many_to_many()\\r\\n else:\\r\\n raise NotImplementedError(f\\\"Invalid PreassignedODPairType: {self.pair_type}\\\")\\r\\n\\r\\n # Initialize the Route solver object\\r\\n self.initialize_rt_solver()\\r\\n self._add_unique_id_fields()\\r\\n\\r\\n # Insert the origins and destinations\\r\\n self.logger.debug(f\\\"Route solver fields transferred from Origins: {self.origin_transfer_fields}\\\")\\r\\n self.logger.debug(f\\\"Route solver fields transferred from Destinations: {self.destination_transfer_fields}\\\")\\r\\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\\r\\n self._insert_stops_one_to_one()\\r\\n elif self.pair_type is helpers.PreassignedODPairType.many_to_many:\\r\\n self._insert_stops_many_to_many()\\r\\n else:\\r\\n raise NotImplementedError(f\\\"Invalid PreassignedODPairType: {self.pair_type}\\\")\\r\\n\\r\\n if self.rt_solver.count(arcpy.nax.RouteInputDataType.Stops) == 0:\\r\\n # There were no valid destinations for this set of origins\\r\\n self.logger.debug(\\\"No valid destinations for this set of origins. Skipping Route calculation.\\\")\\r\\n return\\r\\n\\r\\n # Load barriers\\r\\n # Note: This loads ALL barrier features for every analysis, even if they are very far away from any of\\r\\n # the inputs in the current chunk. You may want to select only barriers within a reasonable distance of the\\r\\n # inputs, particularly if you run into the maximumFeaturesAffectedByLineBarriers,\\r\\n # maximumFeaturesAffectedByPointBarriers, and maximumFeaturesAffectedByPolygonBarriers tool limits for portal\\r\\n # solves. However, since barriers is likely an unusual case, deal with this only if it becomes a problem.\\r\\n for barrier_fc in self.barriers:\\r\\n self.logger.debug(f\\\"Loading barriers feature class {barrier_fc}...\\\")\\r\\n shape_type = arcpy.Describe(barrier_fc).shapeType\\r\\n if shape_type == \\\"Polygon\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.PolygonBarriers\\r\\n elif shape_type == \\\"Polyline\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.LineBarriers\\r\\n elif shape_type == \\\"Point\\\":\\r\\n class_type = arcpy.nax.RouteInputDataType.PointBarriers\\r\\n else:\\r\\n self.logger.warning(\\r\\n f\\\"Barrier feature class {barrier_fc} has an invalid shape type and will be ignored.\\\"\\r\\n )\\r\\n continue\\r\\n barriers_field_mappings = self.rt_solver.fieldMappings(class_type, True)\\r\\n self.rt_solver.load(class_type, barrier_fc, barriers_field_mappings, True)\\r\\n\\r\\n # Solve the Route analysis\\r\\n self.logger.debug(\\\"Solving Route...\\\")\\r\\n solve_start = time.time()\\r\\n self.solve_result = self.rt_solver.solve()\\r\\n solve_end = time.time()\\r\\n self.logger.debug(f\\\"Solving Route completed in {round(solve_end - solve_start, 3)} seconds.\\\")\\r\\n\\r\\n # Handle solve messages\\r\\n solve_msgs = [msg[-1] for msg in self.solve_result.solverMessages(arcpy.nax.MessageSeverity.All)]\\r\\n for msg in solve_msgs:\\r\\n self.logger.debug(msg)\\r\\n\\r\\n # Update the result dictionary\\r\\n self.job_result[\\\"solveMessages\\\"] = solve_msgs\\r\\n if not self.solve_result.solveSucceeded:\\r\\n self.logger.debug(\\\"Solve failed.\\\")\\r\\n return\\r\\n self.logger.debug(\\\"Solve succeeded.\\\")\\r\\n self.job_result[\\\"solveSucceeded\\\"] = True\\r\\n\\r\\n # Save output\\r\\n self._export_to_feature_class(chunk_definition)\\r\\n\\r\\n self.logger.debug(\\\"Finished calculating Route.\\\")\",\n \"def run(self):\\n\\n self._get_routes()\\n self._calculate_emissions()\",\n \"def _route_chunk(data, host_url, annotations='duration', retries=10, extra_params=None):\\n\\t# offsets are used to make correct indice of the result dataframe\\n\\tsources, destinations, sources_offset, destinations_offset = data\\n\\tsources_count = len(sources)\\n\\tdestinations_count = len(destinations)\\n\\n\\t# OSRM takes all points as one list, and then numbers of sources & dests in it\\n\\tall_points = sources + destinations\\n\\tencoded = encode_poly([(p.y, p.x) for p in all_points])\\n\\n\\t# numerate sources & dests. sources come first\\n\\tsource_numbers = ';'.join(map(str, range(sources_count)))\\n\\tdestination_numbers = ';'.join(map(str,\\n\\t\\trange(sources_count, sources_count + destinations_count)))\\n\\n\\n\\textra_params = extra_params or {}\\n\\tparams = {\\n\\t\\t'sources': source_numbers,\\n\\t\\t'destinations': destination_numbers,\\n\\t\\t'generate_hints': 'false',\\n\\t\\t'annotations': annotations,\\n\\t\\t**extra_params\\n\\t}\\n\\n\\tencoded_params = urllib.parse.quote_plus(urllib.parse.urlencode(params))\\n\\t# if we pass url and params separately to requests.get, it will make a malformed URL\\n\\tencoded_url = f'{host_url}/table/v1/driving/polyline({encoded})?{encoded_params}'\\n\\tresp = get_retry(encoded_url, {}, retries)\\n\\n\\tif resp.status_code != 200:\\n\\t\\traise RuntimeError(f'OSRM server responded with {resp.status_code} code. Content: {resp.content}')\\n\\n\\tresp_data = resp.json()\\n\\tif resp_data.get('code', 'Ok') != 'Ok':\\n\\t\\traise RuntimeError(f'OSRM server responded with error message: {resp_data[\\\"message\\\"]}')\\n\\n\\t# if 'duration' is requested, then take resp_data['durations'], or resp_data['distances'] if distances.\\n\\t# also, 'duration,distance' might be requested, then take both and concatenate results (= join columns)\\n\\tresults = []\\n\\t\\n\\tfor key in annotations.split(','):\\n\\t\\tdf = pd.DataFrame(resp_data[f'{key}s']).reset_index().rename(columns={'index': 'source'}).melt(id_vars='source', var_name='destination', value_name=key)\\n\\t\\tdf[key] = df[key].astype(float)\\n\\t\\tif len(results) > 0:\\n\\t\\t\\t# only append the data column\\n\\t\\t\\tresults.append(df[[key]])\\n\\t\\telse:\\n\\t\\t\\tresults.append(df)\\n\\n\\tresult_df = pd.concat(results, axis=1)\\n\\n\\t# snapping distances\\n\\tresult_df['source_snap'] = result_df.source.map(pd.DataFrame(resp_data['sources'])['distance'])\\n\\tresult_df['destination_snap'] = result_df.destination.map(pd.DataFrame(resp_data['destinations'])['distance'])\\n\\n\\t# instead of join/merge lookup\\n\\tresult_df['geometry'] = result_df['source'].map({i: g for i, g in enumerate(sources)})\\n\\tresult_df['geometry_dest'] = result_df['destination'].map({i: g for i, g in enumerate(destinations)})\\n\\n\\t# shift back by the given offset\\n\\tresult_df['destination'] = result_df['destination'].astype(int) + destinations_offset\\n\\tresult_df['source'] = result_df['source'].astype(int) + sources_offset\\n\\treturn result_df\",\n \"def completion_processor(self):\\n while True:\\n _ = (yield)\\n self.solve_completed = True\",\n \"def __routes(self, with_return):\\n nonzeo_pois = list(filter(None, self.pois.keys()))\\n\\n for path in itertools.permutations(nonzeo_pois):\\n steps = self.poi_distance(0, path[0])\\n for i, j in zip(path, path[1:]):\\n steps += self.poi_distance(i, j)\\n if with_return:\\n steps += self.poi_distance(path[-1], 0)\\n yield steps\",\n \"def process(self):\\n try:\\n if not self._successor:\\n return self.loading_strategy()\\n else:\\n return self._successor.process_next(self.loading_strategy())\\n except Exception as e:\\n Oprint.err(e, 'lmdo')\",\n \"def dochunk( request, chunk=None, trailers=None ):\",\n \"def execute_waypoint_sequence(detail_of_trip):\\n\\n # rets (route_line, line_points)\\n sliced_route_and_line_points = chunk_user_route(detail_of_trip)\\n\\n sliced_route = sliced_route_and_line_points[0]\\n line_points = sliced_route_and_line_points[1]\\n\\n # Interpolate/Break into 1/10 segments\\n segmented_points = interpolate_points(sliced_route, line_points)\\n waypoints = find_crime_areas(segmented_points)\\n\\n # print \\\"segmented_points\\\", json.dumps(segmented_points, indent=2)\\n print \\\"\\\\n\\\\n\\\\n\\\\n\\\" # compensating for the giant GET request\\n return waypoints\",\n \"def process(self, results):\\n raise NotImplementedError\",\n \"def request_chunk(self, x, z):\\n\\n if (x, z) in self.chunk_cache:\\n returnValue(self.chunk_cache[x, z])\\n elif (x, z) in self.dirty_chunk_cache:\\n returnValue(self.dirty_chunk_cache[x, z])\\n elif (x, z) in self._pending_chunks:\\n # Rig up another Deferred and wrap it up in a to-go box.\\n retval = yield self._pending_chunks[x, z].deferred()\\n returnValue(retval)\\n\\n chunk = Chunk(x, z)\\n yield maybeDeferred(self.serializer.load_chunk, chunk)\\n\\n if chunk.populated:\\n self.chunk_cache[x, z] = chunk\\n self.postprocess_chunk(chunk)\\n #self.factory.scan_chunk(chunk)\\n returnValue(chunk)\\n\\n if self.async:\\n from ampoule import deferToAMPProcess\\n from bravo.remote import MakeChunk\\n\\n d = deferToAMPProcess(MakeChunk,\\n x=x,\\n z=z,\\n seed=self.seed,\\n generators=configuration.getlist(self.config_name, \\\"generators\\\")\\n )\\n\\n # Get chunk data into our chunk object.\\n def fill_chunk(kwargs):\\n chunk.blocks = fromstring(kwargs[\\\"blocks\\\"],\\n dtype=uint8).reshape(chunk.blocks.shape)\\n chunk.heightmap = fromstring(kwargs[\\\"heightmap\\\"],\\n dtype=uint8).reshape(chunk.heightmap.shape)\\n chunk.metadata = fromstring(kwargs[\\\"metadata\\\"],\\n dtype=uint8).reshape(chunk.metadata.shape)\\n chunk.skylight = fromstring(kwargs[\\\"skylight\\\"],\\n dtype=uint8).reshape(chunk.skylight.shape)\\n chunk.blocklight = fromstring(kwargs[\\\"blocklight\\\"],\\n dtype=uint8).reshape(chunk.blocklight.shape)\\n\\n return chunk\\n d.addCallback(fill_chunk)\\n else:\\n # Populate the chunk the slow way. :c\\n for stage in self.pipeline:\\n stage.populate(chunk, self.seed)\\n\\n chunk.regenerate()\\n d = succeed(chunk)\\n\\n # Set up our event and generate our return-value Deferred. It has to\\n # be done early becaues PendingEvents only fire exactly once and it\\n # might fire immediately in certain cases.\\n pe = PendingEvent()\\n # This one is for our return value.\\n retval = pe.deferred()\\n # This one is for scanning the chunk for automatons.\\n #pe.deferred().addCallback(self.factory.scan_chunk)\\n self._pending_chunks[x, z] = pe\\n\\n def pp(chunk):\\n chunk.populated = True\\n chunk.dirty = True\\n\\n self.postprocess_chunk(chunk)\\n\\n self.dirty_chunk_cache[x, z] = chunk\\n del self._pending_chunks[x, z]\\n\\n return chunk\\n\\n # Set up callbacks.\\n d.addCallback(pp)\\n d.chainDeferred(pe)\\n\\n # Because multiple people might be attached to this callback, we're\\n # going to do something magical here. We will yield a forked version\\n # of our Deferred. This means that we will wait right here, for a\\n # long, long time, before actually returning with the chunk, *but*,\\n # when we actually finish, we'll be ready to return the chunk\\n # immediately. Our caller cannot possibly care because they only see a\\n # Deferred either way.\\n retval = yield retval\\n returnValue(retval)\",\n \"def run(self):\\n for direction in self.directions:\\n rotation = direction[0]\\n steps = direction[1]\\n\\n self.make_rotation(rotation)\\n hq_found = self.travel(steps)\\n\\n if hq_found:\\n return (abs(self.new_loc[0] + self.new_loc[1]))\",\n \"def run(self):\\n while True:\\n path, params = self.path_queue.get()\\n errors = check_path(path, **params)\\n self.result_queue.put(errors)\\n self.path_queue.task_done()\",\n \"def __call__(self):\\n dv = None\\n #Push as many queued calls as the self.max_batch_size and the max number of paralel HTTPS sessions allow for.\\n while self.active_call_count < self.parallel and self.queue:\\n #Get a chunk of entries from the command queue so we can make a batch.\\n subqueue = self.queue[:self.max_batch_size]\\n self.queue = self.queue[self.max_batch_size:]\\n #Send a single batch to the currently selected RPC node.\\n dv = self._process_batch(subqueue)\\n #If there is nothing left to do, there is nothing left to do\\n if not self.queue and self.active_call_count == 0:\\n self.log.error(\\\"Queue is empty and no active HTTPS-POSTs remaining.\\\")\\n if self.stop_when_empty:\\n #On request, stop reactor when queue empty while no active queries remain.\\n self.reactor.stop() \\n return dv\",\n \"def run(self) -> Any:\\n self.prepare()\\n for step in self.stream:\\n self.output = step\\n return self.output\",\n \"def _calculate_emissions(self):\\n parameters = self._get_pollutants_for_vehicle()\\n\\n self.routes = RouteSet()\\n\\n if \\\"routes\\\" not in self._json_data:\\n log.debug(\\\"Error in returned JSON data from web service.\\\")\\n log.debug(\\\"data: {}\\\".format(self._json_data))\\n return\\n\\n # Create a \\\"set\\\" of Routes. The planner web service will\\n # return 2-4 routes with different paths.\\n for idx, r in enumerate(self._json_data[\\\"routes\\\"][\\\"features\\\"]):\\n attributes = r.get(\\\"attributes\\\")\\n route = Route(distance=attributes.get(\\\"Total_Meters\\\"),\\n minutes=attributes.get(\\\"Total_Minutes\\\"),\\n path=r.get(\\\"geometry\\\").get(\\\"paths\\\")[0], id = idx)\\n self.routes.add(route)\\n\\n log.debug(\\\"Nr of routes: {}\\\".format(len(self.routes)))\\n for i, route in enumerate(self.routes):\\n # A list of x,y,z points that all together represents the route\\n path_coordinates = route.path\\n distances = []\\n\\n # Nifty little trick to loop over 'path_coordinates',\\n # but keep a reference to the 'prev' item to calculate the\\n # distance between them\\n iter_points = iter(path_coordinates)\\n prev = next(iter_points)\\n for point in path_coordinates:\\n if not distances:\\n # first point\\n distances.append(Planner._get_distance_3d(prev, point) / 1000)\\n else:\\n distances.append(distances[-1] + Planner._get_distance_3d(prev, point) / 1000)\\n\\n point_slope = Planner._get_slope(prev, point)\\n\\n # Calculate emission for each pollutants the user has asked for\\n for p in self._pollutants:\\n parms = [x for x in parameters if x.pollutant.name.startswith(p)]\\n calc_emission = self.get_emission(parms, point_slope)\\n route.add_pollutant(p, calc_emission)\\n\\n prev = point\\n\\n route.add_distances(distances)\",\n \"def processTradeRoutes(self):\\n try:\\n nextRound = self.currentRound+1\\n resultslist = []\\n for trID in self.tradeRoutes.keys():\\n myTradeRoute = self.tradeRoutes[trID]\\n (systemFromID, systemToID, tradeRouteType) = string.split(trID, '-')\\n systemFrom = self.systems[systemFromID]\\n systemTo = self.systems[systemToID]\\n cancel = 0\\n warpReq = 0\\n # choose trade route type\\n if tradeRouteType == 'GEN':\\n # update what system sends based on what it makes\\n myTradeRoute.AL = systemFrom.prodAL\\n myTradeRoute.EC = systemFrom.prodEC\\n myTradeRoute.IA = systemFrom.prodIA\\n \\n # check if trade route is adjacent or requires warp gate capacity\\n if systemTo.id in systemFrom.warpGateSystems:\\n warpReq = myTradeRoute.getWarpRequired()\\n if warpReq > (systemFrom.availWGC-systemFrom.usedWGC) or warpReq > (systemTo.availWGC-systemTo.usedWGC):\\n cancel = 1\\n elif systemTo.id not in systemFrom.connectedSystems:\\n cancel = 1\\n \\n if (systemFrom.AL >= myTradeRoute.AL and\\n systemFrom.EC >= myTradeRoute.EC and\\n systemFrom.IA >= myTradeRoute.IA and \\n cancel == 0):\\n # process trade route\\n systemFrom.AL -= myTradeRoute.AL\\n systemFrom.EC -= myTradeRoute.EC\\n systemFrom.IA -= myTradeRoute.IA\\n systemTo.AL += myTradeRoute.AL\\n systemTo.EC += myTradeRoute.EC\\n systemTo.IA += myTradeRoute.IA\\n # deduct properly if empires are different\\n empireFrom = self.empires[systemFrom.myEmpireID]\\n empireTo = self.empires[systemTo.myEmpireID]\\n if empireFrom <> empireTo:\\n empireFrom.AL -= myTradeRoute.AL\\n empireFrom.EC -= myTradeRoute.EC\\n empireFrom.IA -= myTradeRoute.IA\\n empireTo.AL += myTradeRoute.AL\\n empireTo.EC += myTradeRoute.EC\\n empireTo.IA += myTradeRoute.IA\\n \\n if warpReq > 0:\\n systemFrom.usedWGC += warpReq\\n systemTo.usedWGC += warpReq\\n \\n # mail trade route completion\\n resultslist.append('Trade from System:%s to System:%s complete' % (systemFrom.id, systemTo.id))\\n self.mailTradeInfo('completed', myTradeRoute, nextRound)\\n else:\\n cancel = 1\\n \\n # check if route should be cancelled\\n if cancel == 1:\\n resultslist.append('cancel trade route=%s' % myTradeRoute.id)\\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\\n elif myTradeRoute.oneTime == 1:\\n resultslist.append('one time trade route=%s' % myTradeRoute.id)\\n self.cancelTradeRoute(myTradeRoute.id, nextRound)\\n \\n return str(resultslist)\\n except:\\n return 'galaxy->processTradeRoutes error'\",\n \"def _run(self) -> None:\\n while True:\\n args: MigrationArgs = self._queue.get(block=True)\\n with self._lock:\\n if args.collection in self._chunks:\\n if args.shard_key not in self._chunks[args.collection]:\\n self._split_chunk(args.collection, args.shard_key)\\n self._move_chunk(args)\",\n \"def run(self):\\n while True:\\n try:\\n processor, iprot, oprot, otrans, callback = self.queue.get()\\n if processor is None:\\n break\\n callback.getContext().setProtocols(iprot, oprot)\\n processor.process(iprot, oprot, callback.getContext())\\n callback.success(reply=otrans.getvalue())\\n except Exception:\\n logging.exception(\\\"Exception while processing request\\\")\\n callback.failure()\",\n \"def handle_chunk( chunk, trailers=None ):\",\n \"def applyMethod(self, neighbours ):\\n \\n nid = neighbours.mQueryToken\\n\\n if self.mContinueAt:\\n if nid == self.mContinueAt:\\n self.info(\\\"continuing processing at %s\\\" % str(self.mContinueAt ) )\\n self.mContinueAt = None\\n return\\n\\n length = self.mFasta.getLength( nid )\\n \\n if length > self.mConfig.get(\\\"segments\\\", \\\"max_sequence_length\\\"):\\n self.warn( \\\"skipped: nid=%s, length=%i -> too long\\\" % (nid, length) )\\n return False\\n \\n self.debug( \\\"starting nid=%s, length=%i\\\" % (nid, length) )\\n\\n tree = self.getTree( nid, length, neighbours ) \\n\\n if self.covering_trees:\\n tree = self.convertTreeToCoveringTree( tree )\\n \\n max_depth = 0\\n if tree:\\n for node in range(len(tree)):\\n (level, parent, left_child, right_child, ranges) = tree[node]\\n max_depth = max(max_depth, level)\\n for xfrom, xto in ranges:\\n self.mOutfile.write(\\\"\\\\t\\\".join( map(str,(nid,node,parent,level,xfrom,xto)))+ \\\"\\\\n\\\")\\n self.mOutfile.flush()\\n\\n self.debug( \\\"finished: nid=%s, length=%i, size=%i, depth=%i\\\" % (nid, length,\\n len(tree), max_depth ) )\\n return True\\n else:\\n self.warn( \\\"failed: nid=%s, length=%i, time=%i\\\" % (job_id, nid, length,\\n len(tree), max_depth ) )\\n \\n return False\",\n \"def run_map(self):\\n # Split input into chunks for processing\\n files = self.split_list()\\n # Make processing pool\\n pool = Pool(processes=self.args.ncore)\\n # Map processing to _run function\\n self.output = pool.map(_run, files)\\n # Close and join pool\\n pool.close()\\n pool.join()\",\n \"def handle_result(self) -> Callable[['Request'], 'Request']:\\n\\n def _handle_result(result: 'Request'):\\n \\\"\\\"\\\"\\n Function that handles the result when extracted from the request future\\n\\n :param result: The result returned to the gateway. It extracts the request to be returned to the client\\n :return: Returns a request to be returned to the client\\n \\\"\\\"\\\"\\n for route in result.routes:\\n if route.executor == GATEWAY_NAME:\\n route.end_time.GetCurrentTime()\\n\\n self._update_end_request_metrics(result)\\n\\n return result\\n\\n return _handle_result\",\n \"def process():\",\n \"def run_chunk(self, part_suffix, remote_home_dir, remote_index_dir, remote_work_dir,\\n remote_username, input_files, key_path, service, lazy_run):\\n assert service in (\\\"gsnap\\\", \\\"rapsearch2\\\")\\n\\n chunk_id = input_files[0].split(part_suffix)[-1]\\n multihit_basename = f\\\"multihit-{service}-out{part_suffix}{chunk_id}.m8\\\"\\n multihit_local_outfile = os.path.join(self.chunks_result_dir_local, multihit_basename)\\n multihit_remote_outfile = os.path.join(remote_work_dir, multihit_basename)\\n multihit_s3_outfile = os.path.join(self.chunks_result_dir_s3, multihit_basename)\\n\\n base_str = \\\"aws s3 cp --only-show-errors {s3_path}/{input_fa} {remote_work_dir}/{input_fa} \\\"\\n download_input_from_s3 = \\\" ; \\\".join(\\n base_str.format(\\n s3_path=self.chunks_result_dir_s3,\\n input_fa=input_fa,\\n remote_work_dir=remote_work_dir) for input_fa in input_files)\\n\\n base_str = \\\"mkdir -p {remote_work_dir} ; {download_input_from_s3} ; \\\"\\n environment = self.additional_attributes[\\\"environment\\\"]\\n if service == \\\"gsnap\\\":\\n commands = base_str + \\\"{remote_home_dir}/bin/gsnapl -A m8 --batch=0 --use-shared-memory=0 --gmap-mode=none --npaths=100 --ordered -t 36 --max-mismatches=40 -D {remote_index_dir} -d nt_k16 {remote_input_files} > {multihit_remote_outfile}\\\"\\n else:\\n commands = base_str + \\\"/usr/local/bin/rapsearch -d {remote_index_dir}/nr_rapsearch -e -6 -l 10 -a T -b 0 -v 50 -z 24 -q {remote_input_files} -o {multihit_remote_outfile}\\\"\\n\\n commands = commands.format(\\n remote_work_dir=remote_work_dir,\\n download_input_from_s3=download_input_from_s3,\\n remote_home_dir=remote_home_dir,\\n remote_index_dir=remote_index_dir,\\n remote_input_files=\\\" \\\".join(\\n remote_work_dir + \\\"/\\\" + input_fa for input_fa in input_files),\\n multihit_remote_outfile=multihit_remote_outfile\\n if service == \\\"gsnap\\\" else multihit_remote_outfile[:-3]\\n # Strip the .m8 for RAPSearch as it adds that\\n )\\n\\n if not lazy_run or not fetch_from_s3(multihit_s3_outfile,\\n multihit_local_outfile):\\n correct_number_of_output_columns = 12\\n min_column_number = 0\\n max_tries = 2\\n try_number = 1\\n instance_ip = \\\"\\\"\\n\\n\\n def interpret_min_column_number_string(min_column_number_string,\\n correct_number_of_output_columns,\\n try_number):\\n if min_column_number_string:\\n min_column_number = float(min_column_number_string)\\n log.write(\\n \\\"Try no. %d: Smallest number of columns observed in any line was %d\\\"\\n % (try_number, min_column_number))\\n else:\\n log.write(\\\"Try no. %d: No hits\\\" % try_number)\\n min_column_number = correct_number_of_output_columns\\n return min_column_number\\n\\n # Check if every row has correct number of columns (12) in the output\\n # file on the remote machine\\n while min_column_number != correct_number_of_output_columns \\\\\\n and try_number <= max_tries:\\n log.write(\\\"waiting for {} server for chunk {}\\\".format(\\n service, chunk_id))\\n max_concurrent = self.additional_attributes[\\\"max_concurrent\\\"]\\n\\n with server.ASGInstance(service, key_path,\\n remote_username, environment,\\n max_concurrent, chunk_id,\\n self.additional_attributes.get(\\\"max_interval_between_describe_instances\\\") or 900,\\n self.additional_attributes.get(\\\"job_tag_prefix\\\") or \\\"RunningIDseqBatchJob_\\\",\\n self.additional_attributes.get(\\\"job_tag_refresh_seconds\\\") or 600,\\n self.additional_attributes.get(\\\"draining_tag\\\") or \\\"draining\\\") as instance_ip:\\n command.execute(command.remote(commands, key_path, remote_username, instance_ip))\\n\\n if service == \\\"gsnap\\\":\\n verification_command = \\\"cat %s\\\" % multihit_remote_outfile\\n else:\\n # For rapsearch, first remove header lines starting with '#'\\n verification_command = \\\"grep -v '^#' %s\\\" % multihit_remote_outfile\\n verification_command += \\\" | awk '{print NF}' | sort -nu | head -n 1\\\"\\n min_column_number_string = command.execute_with_output(\\n command.remote(verification_command, key_path, remote_username, instance_ip))\\n min_column_number = interpret_min_column_number_string(\\n min_column_number_string, correct_number_of_output_columns,\\n try_number)\\n\\n try_number += 1\\n\\n # Move output from remote machine to local machine\\n msg = \\\"Chunk %s output corrupt; not copying to S3. Re-start pipeline \\\" \\\\\\n \\\"to try again.\\\" % chunk_id\\n assert min_column_number == correct_number_of_output_columns, msg\\n\\n with self.iostream_upload: # Limit concurrent uploads so as not to stall the pipeline.\\n command.execute(\\n command.scp(key_path, remote_username, instance_ip,\\n multihit_remote_outfile, multihit_local_outfile))\\n command.execute(\\\"aws s3 cp --only-show-errors %s %s/\\\" %\\n (multihit_local_outfile,\\n self.chunks_result_dir_s3))\\n log.write(\\\"finished alignment for chunk %s on %s server %s\\\" % (chunk_id, service, instance_ip))\\n return multihit_local_outfile\",\n \"def solve(self):\\n for step in self.run.values():\\n step.solve()\",\n \"def chunk_user_route(detail_of_trip):\\n\\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\\n # since I can't get javascript to load, here's a hacky way of loading json\\n # that details the route based on the user's point A and point B\\n # detail_of_trip = api.directions(\\n # (40.760350, -73.976209),\\n # (40.754009, -73.981097),\\n # mode=\\\"walking\\\"\\n # )[0]\\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\\n\\n # now that I have javascript sending over the json, load json that details\\n # the route based on the user's point A and point B\\n\\n # -------------- This section is for interpolation/splitting using shapely\\n first = True # to see if this is the start position for the entire route\\n line_points = [] # stores all the points to the route based on dict passed\\n\\n for leg in detail_of_trip['legs']:\\n for step in leg['steps']:\\n # Create a list of two element lists that represent points along the\\n # route. via google. line_points = [ [lat1, lng1], [lat2, lng2],...]\\n # Only add the starting point the first time. Every other iteration\\n # we will just tack on the end points to our line.\\n if first:\\n line_points.append([step['start_location']['lat'], step['start_location']['lng']])\\n first = False\\n line_points.append([step['end_location']['lat'], step['end_location']['lng']])\\n\\n # Now load those points into a geometry, here shapely's LineString type.\\n route_line = LineString(line_points)\\n return (route_line, line_points)\",\n \"def _process_batch(self, subqueue):\\n try:\\n timeoutCall = None\\n jo = None\\n if self.max_batch_size == 1:\\n #At time of writing, the regular nodes have broken JSON-RPC batch handling.\\n #So when max_batch_size is set to one, we assume we need to work around this fact.\\n jo = json.dumps(self.entries[subqueue[0]]._get_rpc_call_object())\\n else:\\n #The api.steemitstage.com node properly supports JSON-RPC batches, and so, hopefully soon, will the other nodes.\\n qarr = list()\\n for num in subqueue:\\n qarr.append(self.entries[num]._get_rpc_call_object())\\n jo = json.dumps(qarr)\\n url = \\\"https://\\\" + self.nodes[self.node_index] + \\\"/\\\"\\n url = str.encode(url)\\n deferred = self.agent.request('POST',\\n url,\\n Headers({\\\"User-Agent\\\" : ['Async Steem for Python v0.6.1'],\\n \\\"Content-Type\\\": [\\\"application/json\\\"]}),\\n _StringProducer(jo))\\n def process_one_result(reply):\\n \\\"\\\"\\\"Process a single response from an JSON-RPC command.\\\"\\\"\\\"\\n try:\\n if \\\"id\\\" in reply:\\n reply_id = reply[\\\"id\\\"]\\n if reply_id in self.entries:\\n match = self.entries[reply_id]\\n if \\\"result\\\" in reply:\\n #Call the proper result handler for the request that this response belongs to.\\n match._handle_result(reply[\\\"result\\\"])\\n else:\\n if \\\"error\\\" in reply and \\\"code\\\" in reply[\\\"error\\\"]:\\n msg = \\\"No message included with error\\\"\\n if \\\"message\\\" in reply[\\\"error\\\"]:\\n msg = reply[\\\"error\\\"][\\\"message\\\"]\\n #Call the proper error handler for the request that this response belongs to.\\n match._handle_error(reply[\\\"error\\\"][\\\"code\\\"], msg)\\n else:\\n self.log.error(\\\"Error: Invalid JSON-RPC response entry. {node!r}.\\\",node = self.nodes[self.node_index])\\n #del self.entries[reply_id]\\n else:\\n self.log.error(\\\"Error: Invalid JSON-RPC id in entry {rid!r}. {node!r}\\\",rid=reply_id, node = self.nodes[self.node_index])\\n else:\\n self.log.error(\\\"Error: Invalid JSON-RPC response without id in entry: {reply!r}: {node!r}\\\",reply=reply, node = self.nodes[self.node_index])\\n except Exception as ex:\\n self.log.failure(\\\"Error in _process_one_result {err!r}, {node!r}\\\",err=str(ex), node = self.nodes[self.node_index])\\n def handle_response(response):\\n \\\"\\\"\\\"Handle response for JSON-RPC batch query invocation.\\\"\\\"\\\"\\n try:\\n #Cancel any active timeout for this HTTPS call.\\n if timeoutCall.active():\\n timeoutCall.cancel()\\n def cbBody(bodystring):\\n \\\"\\\"\\\"Process response body for JSON-RPC batch query invocation.\\\"\\\"\\\"\\n try:\\n results = None\\n #The bosy SHOULD be JSON, it not always is.\\n try:\\n results = json.loads(bodystring)\\n except Exception as ex:\\n #If the result is NON-JSON, may want to move to the next node in the node list\\n self.log.error(\\\"Non-JSON response from server {node!r}\\\", node = self.nodes[self.node_index])\\n self._next_node()\\n #Add the failed sub-queue back to the command queue, we shall try again soon.\\n self.queue = subqueue + self.queue\\n if results != None:\\n ok = False\\n if isinstance(results, dict):\\n #Running in legacy single JSON-RPC call mode (no batches), process the result of the single call.\\n process_one_result(results)\\n ok = True\\n else:\\n if isinstance(results, list):\\n #Running in batch mode, process the batch result, one response at a time\\n for reply in results:\\n process_one_result(reply)\\n ok = True\\n else:\\n #Completely unexpected result type, may want to move to the next node in the node list.\\n self.log.error(\\\"Error: Invalid JSON-RPC response, expecting list as response on batch. {node!r}\\\",node = self.nodes[self.node_index])\\n self._next_node()\\n #Add the failed sub-queue back to the command queue, we shall try again soon.\\n self.queue = subqueue + self.queue\\n if ok == True:\\n #Clean up the entries dict by removing all fully processed commands that now are no longer in the queu.\\n for request_id in subqueue:\\n if request_id in self.entries:\\n del self.entries[request_id]\\n else:\\n self.log.error(\\\"Error: No response entry for request entry in result: {rid!r}. {node!r}\\\",rid=request_id, node = self.nodes[self.node_index])\\n except Exception as ex:\\n self.log.failure(\\\"Error in cbBody {err!r}. {node!r}\\\",err=str(ex), node = self.nodes[self.node_index])\\n #This HTTPS POST is now fully processed.\\n self.active_call_count = self.active_call_count - 1\\n #Invoke self, possibly sending new queues RPC calls to the current node\\n self()\\n deferred2 = readBody(response)\\n deferred2.addCallback(cbBody)\\n return deferred2\\n except Exception as ex:\\n self.log.failure(\\\"Error in handle_response {err!r}. {node!r}\\\",err=str(ex),node = self.nodes[self.node_index])\\n #If something went wrong, the HTTPS POST isn't active anymore.\\n self.active_call_count = self.active_call_count - 1\\n #Invoke self, possibly sending new queues RPC calls to the current node\\n self()\\n deferred.addCallback(handle_response)\\n def _handle_error(error):\\n \\\"\\\"\\\"Handle network level error for JSON-RPC request.\\\"\\\"\\\"\\n try:\\n #Abandon any active timeout triggers\\n if timeoutCall.active():\\n timeoutCall.cancel()\\n #Unexpected error on HTTPS POST, we may want to move to the next node.\\n self.log.error(\\\"Error on HTTPS POST : {cls!r} : {err!r}. {node!r}\\\",cls=error.type.__name__,err=error.getErrorMessage(),node = self.nodes[self.node_index])\\n self._next_node()\\n except Exception as ex:\\n self.log.failure(\\\"Error in _handle_error {err!r}. {node!r}\\\",err=str(ex),node = self.nodes[self.node_index])\\n #Add the failed sub-queue back to the command queue, we shall try again soon.\\n self.queue = subqueue + self.queue\\n ##If something went wrong, the HTTPS POST isn't active anymore.\\n self.active_call_count = self.active_call_count - 1\\n #Invoke self, possibly sending new queues RPC calls to the current node\\n self()\\n deferred.addErrback(_handle_error)\\n timeoutCall = self.reactor.callLater(self.rpc_timeout, deferred.cancel)\\n #Keep track of the number of active parallel HTTPS posts.\\n self.active_call_count = self.active_call_count + 1\\n return deferred\\n except Exception as ex:\\n self.log.failure(\\\"Error in _process_batch {err!r}. {node!r}\\\",err=str(ex),node = self.nodes[self.node_index])\",\n \"def run(self):\\r\\n while True:\\r\\n try:\\r\\n processor, iprot, oprot, otrans, callback = self.queue.get()\\r\\n if processor is None:\\r\\n break\\r\\n processor.process(iprot, oprot)\\r\\n callback(True, otrans.getvalue())\\r\\n except Exception:\\r\\n logging.exception(\\\"Exception while processing request\\\")\\r\\n callback(False, '')\",\n \"def process(self):\\n while not self.halted:\\n self.step()\\n return self.outputs\",\n \"def chunk_generator( callback, request, c ):\",\n \"def handle_rpc(self):\\n while True: # loop handling\\n self.rbuf.seek(0)\\n length_prefix = self.rbuf.read(4)\\n if len(length_prefix) < 4: # half-package\\n break\\n\\n try:\\n length, = struct.unpack(\\\"I\\\", length_prefix.encode(\\\"utf-8\\\"))\\n except Exception as e:\\n print(e.__traceback__)\\n body = self.rbuf.read(length)\\n if len(body) < length: # half-package\\n break\\n\\n request = json.loads(body)\\n input = request[\\\"in\\\"]\\n params = request[\\\"params\\\"]\\n handler = self.handlers[input]\\n handler(params)\\n # cut read buffer\\n left = self.rbuf.getvalue()[length + 4:]\\n self.rbuf = StringIO()\\n self.rbuf.write(left)\\n # move position to EOF\\n self.rbuf.seek(0, 2)\",\n \"def inference(self):\\n for i in range(len(self.nodes)):\\n for j in range(len(self.nodes[i])):\\n self.pipes[i][j].send(\\\"inference\\\")\\n \\n ## wait for the finalization to be completed\\n for i in range(len(self.nodes)):\\n for j in range(len(self.nodes[i])):\\n self.pipes[i][j].recv()\",\n \"def finish(self) -> Iterable[Chunk]:\",\n \"def evaluate_batch(self, pipelines):\",\n \"def get_next_inner_computation(self, arg: str):\\n print(\\\"[get_next - inner computation] starts here.\\\")\\n # Start of transformation and component encoding\\n name_str = self.transform_inner(arg)\\n # print(\\\"[get_next - inner computation] after transform:\\\", arg)\\n name_after_transform = Name(name_str)\\n name = self.encode_name_components(name_after_transform)\\n # End of transformation and component encoding\\n print(\\\"[get_next - inner computation] after encoding:\\\", name)\\n self.queue_to_lower.put((self.packetid, Interest(name)))\\n inner_result = self.get_content(name)\\n print(\\\"[get_next - inner computation] ends here with result:\\\", inner_result)\\n return inner_result\",\n \"async def solve(self):\\n\\n \\\"\\\"\\\"TODO:\\n Handle guess and checking:\\n 1) Make guess (Make logical guess based on what could be most impactful...i.e. if two spots can have either number in a row)\\n 2) Fork based on guess\\n 3) Check if one raises from impossible square (delete this fork)\\n 4) Check if one completes (will simply return from .gather)\\n 5) Each board can recurse through this guess and checking, just in case\\n \\\"\\\"\\\"\\n tasks = [square.check() for row in self for square in row]\\n\\n return await asyncio.gather(*tasks, return_exceptions=False)\",\n \"def run(self, data, rewrap=False, prefetch=0):\\n if rewrap:\\n data = [data]\\n\\n for pipe in self._pipes:\\n pipe.feed(data)\\n data = pipe\\n else:\\n iterable = self._prefetch_callable(data, prefetch) if prefetch else data\\n for out_data in iterable:\\n yield out_data\",\n \"def stream(self, batch):\\n response = self.post(batch)\\n try:\\n for i, result_data in grouped(response):\\n result = JobResult.hydrate(assembled(result_data), batch)\\n log.info(\\\"< %s\\\", result)\\n yield result\\n finally:\\n response.close()\",\n \"def __call__(self, frame, tlbrs):\\n self.extract_async(frame, tlbrs)\\n return self.postprocess()\",\n \"def transform( request, data, finishing=False ):\",\n \"def transform( request, data, finishing=False ):\",\n \"def routing_step(self, layout: dict, circuit: Circuit):\\n\\n _, final_mapping = self.routing_algorithm(circuit, layout)\\n return final_mapping\",\n \"def run(self):\\n while self._num_workers > 0:\\n self.server.handle_request()\\n self._graph = None\",\n \"def num_step_reach(rr, a, b, k, num_steps = 5):\\n\\n # Time this function\\n start_time = time.time()\\n\\n # Help us divide and conquer with multiple threads\\n pool = ThreadPool(processes = 2)\\n\\n # Create our BDD variables, matching those exactly in rr (except zz's)\\n xx_list = [bddvar(\\\"xx{}\\\".format(i)) for i in range(k)]\\n yy_list = [bddvar(\\\"yy{}\\\".format(i)) for i in range(k)]\\n zz_list = [bddvar(\\\"zz{}\\\".format(i)) for i in range(k)]\\n\\n # Compose for each step\\n # NOTE: Very slow for many nodes and edges; may want divide and conquer here\\n hh = rr\\n yyzz_compose_dict = {a:b for a, b in zip(yy_list, zz_list)}\\n xxzz_compose_dict = {a:b for a, b in zip(xx_list, zz_list)}\\n for i in range(0, num_steps - 1):\\n\\n # Kickoff threads on async composition\\n yyzz_async_result = pool.apply_async(hh.compose, [yyzz_compose_dict])\\n xxzz_async_result = pool.apply_async(rr.compose, [xxzz_compose_dict])\\n\\n # Block: get results from threads\\n yyzz_compose = yyzz_async_result.get()\\n xxzz_compose = xxzz_async_result.get()\\n\\n # Conjunct them and do smoothing\\n hh = (yyzz_compose & xxzz_compose).smoothing(set(zz_list))\\n\\n print(\\\"\\\\tComposed for step\\\", i)\\n\\n print(\\\"Completed in {} seconds\\\".format(round(time.time() - start_time)))\\n print(\\\"Number of satisfiable variables\\\", len(list(hh.satisfy_all())))\\n\\n # See if a and b can reach eachother in the given number of steps\\n restrict_dict = {c:d for c, d in zip(set(xx_list), to_bin(a, k))}\\n restrict_dict.update({c:d for c, d in zip(set(yy_list), to_bin(b, k))})\\n return hh.restrict(restrict_dict)\",\n \"def send_and_receive_many(world: CueBeamWorld):\\n elements_vectorized1 = []\\n for idxElement in range(0, len(world.elements) - 1):\\n elements_vectorized1.extend(\\n [world.elements[idxElement].x, world.elements[idxElement].y, world.elements[idxElement].z,\\n world.elements[idxElement].amplitude, world.elements[idxElement].phase, 0.0])\\n time_start = time.clock()\\n current_ray_count = world.get_ray_count()\\n estimated_worker_performance = 300000.0\\n need_workers = math.ceil(current_ray_count / estimated_worker_performance)\\n each_worker_does_ylines = math.ceil(world.rxPlane.ny / need_workers )\\n # update\\n handles = []\\n for idx_worker in range(need_workers):\\n yline0 = idx_worker*each_worker_does_ylines # starts at zero\\n yline_y = world.rxPlane.y0 + world.rxPlane.dy * yline0\\n handles.append({\\n 'yline_y': yline_y,\\n 'async_handle': beamsim_instant.delay(\\n k=world.wavenumber,\\n x0=world.rxPlane.x0,\\n y0=yline_y,\\n z0=world.rxPlane.z0,\\n nx=world.rxPlane.nx,\\n ny=each_worker_does_ylines,\\n nz=world.rxPlane.nz,\\n dx=world.rxPlane.dx,\\n dy=world.rxPlane.dy,\\n dz=world.rxPlane.dz,\\n elements_vectorized=elements_vectorized1)\\n })\\n # TODO: FRONTIER HERE ===================\\n\\n # TODO: Wait for first worker, and load the result,\\n #while not (async_handle.ready()):\\n # time.sleep(0.02)\\n\\n world.rxPlane.pressurefield = pickle.loads(async_handle.result)\\n time_end = time.clock()\\n world.last_performance_rays_per_second = world.get_ray_count() / (time_end - time_start)\\n print('performance = {} kRays/sec'.format(world.last_performance_rays_per_second / 1e3))\\n return world\",\n \"def __transform(self):\\n try:\\n self.tokenized_document, self.stack = None, []\\n\\n InlineProcessor.initialize()\\n LinkHelper.initialize()\\n\\n POGGER.debug(\\\"\\\\n\\\\n>>>>>>>parse_blocks_pass>>>>>>\\\")\\n first_pass_results = self.__parse_blocks_pass()\\n\\n POGGER.debug(\\\"\\\\n\\\\n>>>>>>>coalesce_text_blocks>>>>>>\\\")\\n coalesced_results = CoalesceProcessor.coalesce_text_blocks(\\n first_pass_results\\n )\\n\\n POGGER.debug(\\\"\\\\n\\\\n>>>>>>>parse_inline>>>>>>\\\")\\n final_pass_results = InlineProcessor.parse_inline(coalesced_results)\\n\\n POGGER.debug(\\\"\\\\n\\\\n>>>>>>>final_pass_results>>>>>>\\\")\\n return final_pass_results\\n except Exception as this_exception:\\n raise BadTokenizationError(\\n \\\"An unhandled error occurred processing the document.\\\"\\n ) from this_exception\",\n \"def async_fetch(self):\\n args = (async_get_pipe, self.zargs, self.connections)\\n mapped = yield ait.async_map(*args)\\n return_value(multiplex(mapped))\",\n \"def parse_chunks(self):\\n logger.info('parse_chunks()')\\n\\n while (self.replay.pos < len(self.replay)):\\n chunk_type = self.replay.read_uint32()\\n chunk_size = self.replay.read_int32()\\n offset = self.replay.bytepos\\n\\n if chunk_type == ChunkTypes.CHECKPOINT.value:\\n self.parse_checkpoint()\\n\\n elif chunk_type == ChunkTypes.EVENT.value:\\n self.parse_event()\\n\\n elif chunk_type == ChunkTypes.REPLAYDATA.value:\\n self.parse_replaydata()\\n\\n elif chunk_type == ChunkTypes.HEADER.value:\\n self.parse_header(chunk_size)\\n\\n self.replay.bytepos = offset + chunk_size\",\n \"def process(self):\\n self.extract()\\n self.transform()\\n self.load()\",\n \"def run_router(self, detour_scale):\\n\\n # Double check source and taget are not same node, if so, we are done!\\n for k,v in self.rg.map.items():\\n if v.source and v.target:\\n debug.error(\\\"Grid cell is source and target! {}\\\".format(k))\\n return False\\n \\n # returns the path in tracks\\n (path,cost) = self.rg.route(detour_scale)\\n if path:\\n debug.info(1,\\\"Found path: cost={0} \\\".format(cost))\\n debug.info(1,str(path))\\n\\n self.paths.append(path)\\n self.add_route(path)\\n \\n path_set = grid_utils.flatten_set(path)\\n self.path_blockages.append(path_set)\\n else:\\n self.write_debug_gds(\\\"failed_route.gds\\\")\\n # clean up so we can try a reroute\\n self.rg.reinit()\\n return False\\n return True\",\n \"def _process_requests_in_background(self):\\n while True:\\n readable, writable, exceptional = self._bg_select_peers()\\n\\n for peer in readable:\\n data = peer.socket.recv(RECV_BYTES)\\n if data:\\n peer.incoming_buffer.feed(data)\\n try:\\n response = peer.incoming_buffer.unpack()\\n except msgpack.OutOfData:\\n continue\\n peer.handle_response(response)\\n else:\\n self._bg_clean_up_peer(peer)\\n if peer in writable:\\n writable.remove(peer)\\n if peer in exceptional:\\n exceptional.remove(peer)\\n\\n for peer in writable:\\n # single-reader configuration means we can safely unlock between\\n # peeking and committing.\\n with peer.lock:\\n next_bytes = peer.outgoing_buffer.peek(SEND_BYTES)\\n if not next_bytes:\\n continue\\n\\n sent_bytes = peer.socket.send(next_bytes)\\n if sent_bytes == 0:\\n self._bg_clean_up_peer(peer)\\n if peer in exceptional:\\n exceptional.remove(peer)\\n continue\\n\\n with peer.lock:\\n peer.outgoing_buffer.commit_read(sent_bytes)\\n\\n for peer in exceptional:\\n self._bg_clean_up_peer(peer)\",\n \"def compute_response(self, items_to_process):\\n pass\",\n \"def _map_to_workers(self, iterable, result_getter):\\n if not self.is_started:\\n raise RuntimeError(\\\"Cannot process inputs: must call start() first.\\\")\\n\\n tasks = TaskIterator(iterable)\\n task = next(tasks)\\n\\n while True:\\n try:\\n self._send_task(task)\\n task = next(tasks)\\n except Queue.Full:\\n for result in result_getter(): # I wish I had `yield from` :(\\n yield result\\n except StopIteration:\\n break\\n\\n while not self.is_completed:\\n for result in result_getter():\\n yield result\",\n \"def routes(self, body):\\n pass\",\n \"async def fetch_posts(self) -> None:\\n\\n async def fetch_posts_for_offset(offset) -> list:\\n logger.info(\\n \\\"(offset %i) Start fetching posts from vk.com/%s...\\\",\\n offset,\\n self.vk_domain,\\n )\\n\\n # VK Script code for /execute method.\\n vks_code = get_wall_post_template.substitute(\\n {\\n \\\"domain\\\": self.vk_domain,\\n \\\"offset\\\": offset,\\n \\\"posts_per_portion\\\": self._posts_per_portion,\\n \\\"execution_times\\\": self._execution_times,\\n }\\n )\\n params = {\\n \\\"v\\\": settings.VKAPI_VERSION,\\n \\\"access_token\\\": settings.VKAPI_TOKEN,\\n \\\"code\\\": vks_code,\\n }\\n url = self._url_execute\\n\\n # Posts fetching.\\n resp_json = await vk_asynchronous_request(\\n url,\\n params,\\n domain=self.vk_domain,\\n offset=offset,\\n )\\n\\n logger.info(\\n \\\"(offset %i) End fetching posts from vk.com/%s...\\\",\\n offset,\\n self.vk_domain,\\n )\\n\\n # Gathered posts handling.\\n posts_from_vk = resp_json[\\\"response\\\"][\\\"items\\\"]\\n posts = posts_as_schemas(posts_from_vk)\\n del posts_from_vk\\n return posts\\n\\n # Checks and preparations.\\n await self._set_total_posts_in_domain()\\n if not self._total_posts_in_domain:\\n return\\n\\n # Creating tasks for fetching.\\n tasks = []\\n posts_per_task = self._posts_per_portion * self._execution_times\\n offsets = list(range(0, self._total_posts_in_domain, posts_per_task))\\n for offset in offsets:\\n tasks.append(asyncio.create_task(fetch_posts_for_offset(offset)))\\n\\n # Running tasks.\\n logger.info(\\\"Start fetching posts from vk.com/%s...\\\", self.vk_domain)\\n results = await asyncio.gather(*tasks)\\n logger.info(\\\"End fetching posts from vk.com/%s...\\\", self.vk_domain)\\n\\n # Flatting results from many tasks into one list.\\n self._posts = [post for result in results for post in result]\\n\\n # Final actions.\\n if self.sort_by_likes:\\n self._posts = list(sorted(self.posts, key=lambda p: p.likes, reverse=True))\\n if self.amount_to_fetch:\\n self._posts = self._posts[: self.amount_to_fetch]\",\n \"def run(self):\\n self.debug('Starting new thread')\\n while True:\\n try:\\n i, pset = self._readq.get(block=False)\\n except Empty:\\n break\\n\\n result = self.solve(pset)\\n self._solveq.put((i, result))\\n self.debug('Finishing thread')\",\n \"def run_traverse(fln, fln_chunk):\\n paths_chunk = {}\\n clicks_chunk = {} #page: clicks\\n path_length_chunk = {} #page : path length\\n feed_count_chunk = {} #page : feed clicks\\n i = 0\\n for page in fln_chunk.iterkeys():\\n i +=1\\n if i % 10000 == 0: \\n print i\\n gc.collect()\\n #traverse path\\n page_path = traverse(fln, page)\\n #add to dictionary\\n paths_chunk[page] = page_path\\n #update clicks \\n for pt in page_path:\\n clicks_chunk[pt] = clicks_chunk.get(pt, 0) + 1\\n #update len(path) \\n path_length_chunk[page] = len(page_path)\\n #update feeder clicks\\n feeder = return_feeder_page(fln, page, page_path)\\n if feeder:\\n feed_count_chunk[feeder] = feed_count_chunk.get(feeder, 0) + 1\\n return paths_chunk, clicks_chunk, path_length_chunk, feed_count_chunk\",\n \"def chunks(sequence, chunk_size):\\r\\n\\r\\n # YOUR CODE HERE\\r\",\n \"def run(self):\\n _threadpool_limits = _no_threadpool_limits\\n if USE_THREADPOOL_LIMITS:\\n _threadpool_limits = threadpool_limits\\n\\n while True:\\n next_task = self.task_queue.get()\\n if next_task is None:\\n # Poison pill means shutdown\\n self.task_queue.task_done()\\n break\\n with _threadpool_limits(limits=1):\\n answer = next_task(self.data)\\n self.task_queue.task_done()\\n self.result_queue.put(answer)\",\n \"def process_results(self):\\n\\n while not self.results.empty():\\n mvt = self.results.get()\\n\\n for peer in self.peers_list:\\n peer.check_mvt(mvt)\\n\\n self.results.task_done()\",\n \"async def _load_next_chunk(self):\\n raise NotImplementedError\",\n \"def run(self):\\n\\n # keep track of counter\\n counter = 0\\n\\n while self.queue:\\n\\n # print depth of tree every 10000 steps\\n if counter % 10000 == 0:\\n print(len(self.queue[0]))\\n\\n # get first moves set from queue\\n moves_set = self.get_moves_set()\\n\\n # move all moves from set\\n self.try_moves(moves_set)\\n\\n # continue branch (add to queue) if layout is not in archive\\n if self.not_in_archive():\\n self.add_to_queue(moves_set)\\n \\n # check for win\\n if self.won_game():\\n\\n # return winning set of moves\\n return moves_set\\n \\n # reverse moves to original layout\\n self.reverse_moves(moves_set)\\n \\n # add to counter\\n counter += 1\",\n \"def computeRrup(self, lon, lat, depth):\\n\\n mesh_dx = self._mesh_dx\\n\\n #----------------------------------------------------------------------\\n # Sort out sites\\n #----------------------------------------------------------------------\\n oldshape = lon.shape\\n\\n if len(oldshape) == 2:\\n newshape = (oldshape[0] * oldshape[1], 1)\\n else:\\n newshape = (oldshape[0], 1)\\n\\n x, y, z = latlon2ecef(lat, lon, depth)\\n x.shape = newshape\\n y.shape = newshape\\n z.shape = newshape\\n sites_ecef = np.hstack((x, y, z))\\n\\n #----------------------------------------------------------------------\\n # Get mesh\\n #----------------------------------------------------------------------\\n mx = []\\n my = []\\n mz = []\\n u_groups = np.unique(self._group_index)\\n n_groups = len(u_groups)\\n for j in range(n_groups):\\n g_ind = np.where(u_groups[j] == self._group_index)[0]\\n nq = len(self._toplats[g_ind]) - 1\\n for i in range(nq):\\n q = [Point(self._toplons[g_ind[i]],\\n self._toplats[g_ind[i]],\\n self._topdeps[g_ind[i]]),\\n Point(self._toplons[g_ind[i + 1]],\\n self._toplats[g_ind[i + 1]],\\n self._topdeps[g_ind[i + 1]]),\\n Point(self._botlons[g_ind[i + 1]],\\n self._botlats[g_ind[i + 1]],\\n self._botdeps[g_ind[i + 1]]),\\n Point(self._botlons[g_ind[i]],\\n self._botlats[g_ind[i]],\\n self._botdeps[g_ind[i]])\\n ]\\n mesh = get_quad_mesh(q, dx=mesh_dx)\\n mx.extend(list(np.reshape(mesh['x'], (-1,))))\\n my.extend(list(np.reshape(mesh['y'], (-1,))))\\n mz.extend(list(np.reshape(mesh['z'], (-1,))))\\n mesh_mat = np.array([np.array(mx), np.array(my), np.array(mz)])\\n\\n #----------------------------------------------------------------------\\n # Compute distance\\n #----------------------------------------------------------------------\\n dist = np.zeros_like(x)\\n for i in range(len(x)):\\n sitecol = sites_ecef[i, :].reshape([3, 1])\\n dif = sitecol - mesh_mat\\n distarray = np.sqrt(np.sum(dif * dif, axis=0))\\n dist[i] = np.min(distarray) / 1000.0 # convert to km\\n\\n dist = np.reshape(dist, oldshape)\\n\\n return dist\",\n \"def process10(res):\",\n \"def run(self):\\n while True:\\n next_task = self.task_queue.get()\\n if next_task is None:\\n # Poison pill means shutdown\\n self.task_queue.task_done()\\n break\\n answer = next_task(self.data)\\n self.task_queue.task_done()\\n self.result_queue.put(answer)\",\n \"def walk_bus_algor(start,end):\\n #---CLASSES---#\\n class my_dictionary(dict):\\n \\\"\\\"\\\"\\n Creates a dictionary\\n \\\"\\\"\\\"\\n def __init__(self):\\n self = dict()\\n def add(self, key, value):\\n self[key] = value\\n\\n #---FUNCTIONS---#\\n def bus_layer(start,end, results, case):\\n \\\"\\\"\\\"\\n It generates a bus route with the bus numbers via greedy algorithm\\n\\n Parameters\\n ----------\\n start : node id\\n end : node id\\n results : dict (From lta datamall)\\n case : int\\n Returns\\n -------\\n final_route_list : list\\n \\\"\\\"\\\"\\n def overpass_request(data, pause_duration=None, timeout=180, error_pause_duration=None):\\n \\\"\\\"\\\"\\n Send a request to the Overpass API via HTTP POST and return the JSON\\n response.\\n Parameters\\n ----------\\n data : dict or OrderedDict\\n key-value pairs of parameters to post to the API\\n pause_duration : int\\n how long to pause in seconds before requests, if None, will query API\\n status endpoint to find when next slot is available\\n timeout : int\\n the timeout interval for the requests library\\n error_pause_duration : int\\n how long to pause in seconds before re-trying requests if error\\n Returns\\n -------\\n dict\\n \\\"\\\"\\\"\\n\\n # define the Overpass API URL, then construct a GET-style URL as a string to\\n # hash to look up/save to cache\\n url = settings.overpass_endpoint.rstrip('/') + '/interpreter'\\n prepared_url = requests.Request('GET', url, params=data).prepare().url\\n cached_response_json = get_from_cache(prepared_url)\\n\\n if cached_response_json is not None:\\n # found this request in the cache, just return it instead of making a\\n # new HTTP call\\n return cached_response_json\\n\\n else:\\n # if this URL is not already in the cache, pause, then request it\\n if pause_duration is None:\\n this_pause_duration = get_pause_duration()\\n log('Pausing {:,.2f} seconds before making API POST request'.format(this_pause_duration))\\n time.sleep(this_pause_duration)\\n start_time = time.time()\\n log('Posting to {} with timeout={}, \\\"{}\\\"'.format(url, timeout, data))\\n response = requests.post(url, data=data, timeout=timeout, headers=get_http_headers())\\n\\n # get the response size and the domain, log result\\n size_kb = len(response.content) / 1000.\\n domain = re.findall(r'(?s)//(.*?)/', url)[0]\\n log('Downloaded {:,.1f}KB from {} in {:,.2f} seconds'.format(size_kb, domain, time.time() - start_time))\\n\\n try:\\n response_json = response.json()\\n if 'remark' in response_json:\\n log('Server remark: \\\"{}\\\"'.format(response_json['remark'], level=lg.WARNING))\\n save_to_cache(prepared_url, response_json)\\n except Exception:\\n # 429 is 'too many requests' and 504 is 'gateway timeout' from server\\n # overload - handle these errors by recursively calling\\n # overpass_request until we get a valid response\\n if response.status_code in [429, 504]:\\n # pause for error_pause_duration seconds before re-trying request\\n if error_pause_duration is None:\\n error_pause_duration = get_pause_duration()\\n log(\\n 'Server at {} returned status code {} and no JSON data. Re-trying request in {:.2f} seconds.'.format(\\n domain,\\n response.status_code,\\n error_pause_duration),\\n level=lg.WARNING)\\n time.sleep(error_pause_duration)\\n response_json = overpass_request(data=data, pause_duration=pause_duration, timeout=timeout)\\n\\n # else, this was an unhandled status_code, throw an exception\\n else:\\n log('Server at {} returned status code {} and no JSON data'.format(domain, response.status_code),\\n level=lg.ERROR)\\n raise Exception(\\n 'Server returned no JSON data.\\\\n{} {}\\\\n{}'.format(response, response.reason, response.text))\\n\\n return response_json\\n def get_node(element):\\n \\\"\\\"\\\"\\n Convert an OSM node element into the format for a networkx node.\\n\\n Parameters\\n ----------\\n element : dict\\n an OSM node element\\n\\n Returns\\n -------\\n dict\\n \\\"\\\"\\\"\\n useful_tags_node = ['ref', 'highway', 'route_ref', 'asset_ref']\\n\\n node = {}\\n node['y'] = element['lat']\\n node['x'] = element['lon']\\n node['osmid'] = element['id']\\n\\n\\n if 'tags' in element:\\n for useful_tag in useful_tags_node:\\n if useful_tag in element['tags']:\\n node[useful_tag] = element['tags'][useful_tag]\\n return node\\n def get_path(element,element_r):\\n \\\"\\\"\\\"\\n Convert an OSM way element into the format for a networkx graph path.\\n\\n Parameters\\n ----------\\n element : dict\\n an OSM way element\\n element_r : dict\\n an OSM way element\\n\\n Returns\\n -------\\n dict\\n \\\"\\\"\\\"\\n useful_tags_path_e = ['bridge', 'tunnel', 'oneway', 'lanes', 'name',\\n 'highway', 'maxspeed', 'service', 'access', 'area',\\n 'landuse', 'width', 'est_width', 'junction']\\n\\n useful_tags_path_r = ['bridge', 'tunnel', 'oneway', 'lanes', 'ref', 'direction', 'from', 'to', 'name',\\n 'highway', 'maxspeed', 'service', 'access', 'area',\\n 'landuse', 'width', 'est_width', 'junction']\\n\\n\\n\\n path = {}\\n path['osmid'] = element['id']\\n\\n # remove any consecutive duplicate elements in the list of nodes\\n grouped_list = groupby(element['nodes'])\\n path['nodes'] = [group[0] for group in grouped_list]\\n\\n\\n\\n if 'tags' in element:\\n # for relation in element_r['elements']:\\n # if relation['type'] == 'relation':\\n # for members in relation['members']:\\n # if members['ref'] == element['id']:\\n for useful_tag in useful_tags_path_e:\\n if useful_tag in element['tags']:\\n path[useful_tag] = element['tags'][useful_tag]\\n # for useful_tag in useful_tags_path_r:\\n # if useful_tag in relation['tags']:\\n # try:\\n # path[useful_tag] = path[useful_tag] + \\\";\\\" + relation['tags'][useful_tag]\\n # except KeyError:\\n # path[useful_tag] = relation['tags'][useful_tag]\\n # pass\\n\\n return path\\n def parse_osm_nodes_paths(osm_data):\\n \\\"\\\"\\\"\\n Construct dicts of nodes and paths with key=osmid and value=dict of\\n attributes.\\n\\n Parameters\\n ----------\\n osm_data : dict\\n JSON response from from the Overpass API\\n\\n Returns\\n -------\\n nodes, paths : tuple\\n \\\"\\\"\\\"\\n\\n nodes = {}\\n paths = {}\\n relation = {}\\n\\n # for element in osm_data['elements']:\\n # if element['type'] == 'relation':\\n\\n\\n for element in osm_data['elements']:\\n if element['type'] == 'node':\\n key = element['id']\\n nodes[key] = get_node(element)\\n\\n elif element['type'] == 'way': #osm calls network paths 'ways'\\n key = element['id']\\n # pp.pprint(element)\\n paths[key] = get_path(element,osm_data)\\n\\n return nodes, paths\\n def create_graph(response_jsons, name='unnamed', retain_all=True, bidirectional=False):\\n \\\"\\\"\\\"\\n Create a networkx graph from Overpass API HTTP response objects.\\n\\n Parameters\\n ----------\\n response_jsons : list\\n list of dicts of JSON responses from from the Overpass API\\n name : string\\n the name of the graph\\n retain_all : bool\\n if True, return the entire graph even if it is not connected\\n bidirectional : bool\\n if True, create bidirectional edges for one-way streets\\n\\n Returns\\n -------\\n networkx multidigraph\\n \\\"\\\"\\\"\\n\\n log('Creating networkx graph from downloaded OSM data...')\\n start_time = time.time()\\n\\n # make sure we got data back from the server requests\\n elements = []\\n # for response_json in response_jsons:\\n elements.extend(response_json['elements'])\\n if len(elements) < 1:\\n raise EmptyOverpassResponse('There are no data elements in the response JSON objects')\\n\\n # create the graph as a MultiDiGraph and set the original CRS to default_crs\\n G = nx.MultiDiGraph(name=name, crs=settings.default_crs)\\n\\n # extract nodes and paths from the downloaded osm data\\n nodes = {}\\n paths = {}\\n # for osm_data in response_jsons:\\n nodes_temp, paths_temp = parse_osm_nodes_paths(response_jsons)\\n for key, value in nodes_temp.items():\\n nodes[key] = value\\n for key, value in paths_temp.items():\\n paths[key] = value\\n\\n # add each osm node to the graph\\n for node, data in nodes.items():\\n G.add_node(node, **data)\\n\\n # add each osm way (aka, path) to the graph\\n G = ox.add_paths(G, paths, bidirectional=bidirectional)\\n\\n # retain only the largest connected component, if caller did not\\n # set retain_all=True\\n if not retain_all:\\n G = get_largest_component(G)\\n\\n log('Created graph with {:,} nodes and {:,} edges in {:,.2f} seconds'.format(len(list(G.nodes())), len(list(G.edges())), time.time()-start_time))\\n\\n # add length (great circle distance between nodes) attribute to each edge to\\n # use as weight\\n if len(G.edges) > 0:\\n G = ox.add_edge_lengths(G)\\n\\n return G\\n def calculate_H(s_lat,s_lon,e_lat,e_lon):\\n \\\"\\\"\\\"\\n Calculate a distance with x,y coordinates with\\n\\n Parameters\\n ----------\\n s_lat : float (starting lat)\\n s_lon : float (starting lon)\\n e_lat : float (ending lat)\\n e_lon : float (ending lon)\\n\\n Returns\\n -------\\n distance\\n \\\"\\\"\\\"\\n R = 6371.0\\n snlat = radians(s_lat)\\n snlon = radians(s_lon)\\n elat = radians(e_lat)\\n elon = radians(e_lon)\\n actual_dist = 6371.01 * acos(sin(snlat) * sin(elat) + cos(snlat) * cos(elat) * cos(snlon - elon))\\n actual_dist = actual_dist * 1000\\n return actual_dist\\n def bus_details_SD(adjacent_list):\\n \\\"\\\"\\\"\\n store all details from LTA data mall into dictionary\\n\\n Parameters\\n ----------\\n adjacent_list : dict\\n\\n Returns\\n -------\\n adjacent_list : dict\\n \\\"\\\"\\\"\\n\\n temp = 0\\n for x in results:\\n if temp != x.get('ServiceNo'):\\n temp = x.get('ServiceNo')\\n count = 0\\n adja_bus_stop = my_dictionary()\\n adjacent_list.add(temp, adja_bus_stop)\\n adja_bus_stop.add(count, [x.get('BusStopCode'), x.get('Distance')])\\n count += 1\\n else:\\n adja_bus_stop.add(count, [x.get('BusStopCode'), x.get('Distance')])\\n count += 1\\n return adjacent_list\\n def get_nearestedge_node(osm_id, a, G):\\n \\\"\\\"\\\"\\n Find the nearest node available in Open street map\\n\\n Parameters\\n ----------\\n osm_id : node ID\\n a : plotting graph\\n g : bus graph\\n\\n Returns\\n -------\\n temp_nearest_edge[1]/temp_nearest_edge[2] : nearest node to a way ID\\n \\\"\\\"\\\"\\n temp_y = G.nodes.get(osm_id).get('y')\\n temp_x = G.nodes.get(osm_id).get('x')\\n temp_nearest_edge = ox.get_nearest_edge(a, (temp_y, temp_x))\\n temp_1 = temp_nearest_edge[0].coords[0]\\n temp_2 = temp_nearest_edge[0].coords[1]\\n temp1_x = temp_1[0]\\n temp1_y = temp_1[1]\\n temp_1_distance = calculate_H(temp1_y,temp1_x,temp_y,temp_x)\\n\\n temp2_x = temp_2[0]\\n temp2_y = temp_2[1]\\n temp_2_distance = calculate_H(temp2_y,temp2_x,temp_y,temp_x)\\n if temp_1_distance < temp_2_distance:\\n return temp_nearest_edge[1]\\n else:\\n return temp_nearest_edge[2]\\n def delete_duplicate(x):\\n \\\"\\\"\\\"\\n Delete duplicate within a list\\n\\n Parameters\\n ----------\\n x : list\\n\\n Returns\\n -------\\n list\\n \\\"\\\"\\\"\\n return list(dict.fromkeys(x))\\n def request_busG():\\n \\\"\\\"\\\"\\n Find all nodes that is a bus stop\\n\\n Returns\\n -------\\n busG : dict\\n \\\"\\\"\\\"\\n busG = {}\\n for x in G.nodes.items():\\n if x[1].get('highway') == 'bus_stop':\\n xy = []\\n xy.append(x[1].get('osmid'))\\n xy.append(x[1].get('x'))\\n xy.append(x[1].get('y'))\\n busG[x[1].get('osmid')] = xy\\n\\n return busG\\n\\n # ---MAIN---#\\n\\n query_str = '[out:json][timeout:180];node[\\\"type\\\"=\\\"route\\\"](1.385700,103.887300,1.422000,103.925900);way[\\\"type\\\"=\\\"route\\\"](1.385700,103.887300,1.422000,103.925900);(relation[\\\"type\\\"=\\\"route\\\"](1.385700,103.887300,1.422000,103.925900);>;);out;'\\n response_json = overpass_request(data={'data': query_str}, timeout=180)\\n pp = pprint.PrettyPrinter(indent=4)\\n # start = 1847853709\\n # end = 410472575\\n # end = 3737148763\\n # bus transit\\n # start = 2110621974\\n # end = 2085845884\\n\\n adjacent_list = my_dictionary()\\n\\n G = ox.load_graphml('Bus_Overpass.graphml')\\n\\n if case == 1:\\n return request_busG()\\n n, e = ox.graph_to_gdfs(G)\\n # e.to_csv(\\\"Edge_test_busstop.csv\\\")\\n if len(results) == 0:\\n\\n results = bus_details_all(results) # Details from LTA Datamall, extracting all details such as service no, bus stop number\\n\\n adjacent_list = bus_details_SD(adjacent_list) # From results, it extracts bus stop number and distance\\n start_busstop = (G.nodes.get(start)).get('asset_ref')\\n end_busstop = (G.nodes.get(end)).get('asset_ref')\\n\\n #Start finding common bus service within the start bus stop and end bus stop\\n try:\\n if \\\";\\\" in (G.nodes.get(start).get('route_ref')):\\n start_rr = (G.nodes.get(start).get('route_ref')).split(\\\";\\\")\\n else:\\n start_rr = []\\n start_rr.append((G.nodes.get(start).get('route_ref')))\\n print(\\\"TEST - G.nodes.get(end): \\\", G.nodes.get(end))\\n if \\\";\\\" in (G.nodes.get(end).get('route_ref')):\\n end_rr = (G.nodes.get(end).get('route_ref')).split(\\\";\\\")\\n else:\\n end_rr = []\\n end_rr.append((G.nodes.get(end).get('route_ref')))\\n common = list(set(start_rr) & set(end_rr))\\n except:\\n return -1\\n\\n \\\"\\\"\\\"\\n This method strictly emphasis on greedy algorithm. Thus it will prioritze the numbers of transit rather than distance\\n Check if any common bus service within start and end bus stop.\\n If found, route_list will capture the entire route of the common bus service \\n No transit will occuer as it is a straight path, start busstop -> end busstop\\n If not found, the program will proceed to find a common bus stop within the start and end bus services. \\n Thus a transit will occur, start busstop -> mid busstop -> end busstop\\n \\\"\\\"\\\"\\n route_list = {}\\n mid_route_list = {}\\n # print(\\\"TEST - Start: \\\", start_busstop)\\n # print(\\\"TEST - End: \\\", end_busstop)\\n # print(\\\"TEST - start_rr: \\\", start_rr)\\n # print(\\\"TEST - end_rr: \\\", end_rr)\\n # print(\\\"TEST - Common: \\\", common)\\n common_mid = []\\n if len(common) == 0: #No common bus service found\\n while(len(common_mid) == 0): #Start finding a common mid busstop\\n rona_one = []\\n rona_two = []\\n for start_to_mid in start_rr: #Capture all common mid busstop\\n print(\\\"TEST - start_to_mid: \\\", start_to_mid)\\n for bus_sequence in adjacent_list.get(start_to_mid):\\n rona_one.append(str(adjacent_list.get(start_to_mid).get(bus_sequence)[0]))\\n for mid_to_end in end_rr:\\n print(\\\"TEST - mid_to_end: \\\", mid_to_end)\\n for bus_sequence in adjacent_list.get(mid_to_end):\\n rona_two.append(str(adjacent_list.get(mid_to_end).get(bus_sequence)[0]))\\n found_br = []\\n print(\\\"TEST rona 1:\\\", rona_one)\\n print (\\\"TEST rona 2:\\\", rona_two)\\n found_br.append(start_to_mid+\\\";\\\"+mid_to_end)\\n found_br.extend(list(set(rona_one)&set(rona_two)))\\n common_mid.append(found_br)\\n\\n print(\\\"TEST - common_mid: \\\",common_mid)\\n\\n bus_service = start_to_mid\\n temp_bus = []\\n mid_busstop = 0\\n approved = 0\\n for bus_sequence in adjacent_list.get(bus_service): #Finding bus service for start busstop -> mid busstop\\n for x in range (0, len(common_mid)):\\n for i in common_mid[x]:\\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(start_busstop):\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n approved = 1\\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(i) and approved == 1:\\n mid_busstop = str(i)\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n approved = 0\\n break\\n if approved == 1:\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n if mid_busstop != 0:\\n break\\n if str(start_busstop) not in temp_bus or str(mid_busstop) not in temp_bus: #If not found, continue to next loop\\n continue\\n temp_bus = delete_duplicate(temp_bus)\\n mid_route_list[bus_service] = temp_bus\\n\\n for x in G.nodes: #After finding bus service to mid busstop, start finding path mid busstop to end busstop\\n if G.nodes.get(x).get('asset_ref') == mid_busstop:\\n if \\\";\\\" in (G.nodes.get(x).get('route_ref')):\\n start_rr = (G.nodes.get(x).get('route_ref')).split(\\\";\\\")\\n else:\\n start_rr = []\\n start_rr.append((G.nodes.get(start).get('route_ref')))\\n\\n common = list(set(start_rr) & set(end_rr))\\n start_busstop = mid_busstop\\n if start == 1847853709: #If bus service started from punggol interchange\\n for bus_service in common:\\n temp_bus = []\\n approved = 0\\n for bus_sequence in adjacent_list.get(bus_service): #Capture bus route\\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(start_busstop) and adjacent_list.get(bus_service).get(bus_sequence)[1] == 0:\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n approved = 1\\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(end_busstop) and approved == 1:\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n approved = 0\\n break\\n if approved == 1:\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n if str(start_busstop) not in temp_bus or str(end_busstop) not in temp_bus:\\n continue\\n route_list[bus_service] = temp_bus\\n else:\\n for bus_service in common: #If bus service does not start from punggol interchange\\n temp_bus = []\\n approved = 0\\n for bus_sequence in adjacent_list.get(bus_service): #Capture bus route\\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(start_busstop):\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n approved = 1\\n if str(adjacent_list.get(bus_service).get(bus_sequence)[0]) == str(end_busstop) and approved == 1:\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n approved = 0\\n break\\n if approved == 1:\\n temp_bus.append(adjacent_list.get(bus_service).get(bus_sequence)[0])\\n if str(start_busstop) not in temp_bus or str(end_busstop) not in temp_bus:\\n continue\\n route_list[bus_service] = temp_bus\\n\\n \\\"\\\"\\\"\\n After capturing all the bus serivce. A comparison is made in favor for the number of bus stops\\n It will choose the least amount of bus stops and store in post_compare\\n \\\"\\\"\\\"\\n compare = [0, 100]\\n if len(route_list.keys()) > 1:\\n for i in route_list:\\n if len(route_list.get(i)) < compare[1]:\\n compare[0] = i\\n compare[1] = len(route_list.get(i))\\n else:\\n for i in route_list:\\n compare[0] = i\\n compare[1] = len(route_list.get(i))\\n post_compare = []\\n print(\\\"TEST - Mid route list: \\\", mid_route_list)\\n if len(mid_route_list) != 0:\\n for i in mid_route_list:\\n post_compare.append(i)\\n route_list[i] = mid_route_list.get(i)\\n post_compare.append(compare[0])\\n else:\\n post_compare.append(compare[0])\\n\\n\\n\\n \\\"\\\"\\\"\\n Upon comparison, it will start capturing the nodes within the bus path and store in plot_list\\n \\\"\\\"\\\"\\n plot_list = []\\n try:\\n print(\\\"TEST - post_Compare: \\\", post_compare)\\n print(\\\"TEST - Route list: \\\", route_list)\\n for count in range (0, len(post_compare)):\\n for x in route_list.get(str(post_compare[count])):\\n for i in G.nodes:\\n if str(G.nodes.get(i).get('asset_ref')) == str(x):\\n plot_list.append(G.nodes.get(i).get('osmid'))\\n break\\n except:\\n return -1\\n edge_list = []\\n punggol = (1.403948, 103.909048)\\n \\\"\\\"\\\"\\n It will generate out the list of node ID for the UI to plot\\n \\\"\\\"\\\"\\n a = ox.load_graphml('Bus_graph.graphml')\\n for x in plot_list:\\n edge_list.append(get_nearestedge_node(x,a,G))\\n\\n print(\\\"TEST - Plot list: \\\", plot_list)\\n print(\\\"TEST - Edge list: \\\", edge_list)\\n final_route_list = []\\n count_stops = len(plot_list)\\n for x in range (0, len(edge_list)-1):\\n final_route_list.append(nx.shortest_path(a, edge_list[x], edge_list[x+1]))\\n print(final_route_list)\\n return final_route_list\\n\\n def bus_details_all():\\n headers = {\\n 'AccountKey': '84lbH3B/QeOkRK/CHm3c2w==',\\n 'UniqueUserID': '8ecabd56-08a2-e843-0a7a-9944dccf124a',\\n 'accept': 'application/json'\\n }\\n global new_results\\n if __name__ == \\\"__main__\\\":\\n results = []\\n bus_stop_url = \\\"http://datamall2.mytransport.sg/ltaodataservice/BusRoutes\\\"\\n\\n while True:\\n new_results = requests.get(bus_stop_url,headers=headers,params={'$skip': len(results)}).json()['value']\\n if new_results == []:\\n return results\\n else:\\n results += new_results\\n def calculate_H(s_lat,s_lon,e_lat,e_lon): #y,x y,x\\n R = 6371.0\\n snlat = radians(s_lat)\\n snlon = radians(s_lon)\\n elat = radians(e_lat)\\n elon = radians(e_lon)\\n actual_dist = 6371.01 * acos(sin(snlat) * sin(elat) + cos(snlat) * cos(elat) * cos(snlon - elon))\\n actual_dist = actual_dist * 1000\\n return actual_dist\\n def walk_pathfinder(start_osmid, end_osmid):\\n priority_Q = []\\n heap_Q = []\\n closed_routes = {}\\n start_node = (0, None, start_osmid, 0)\\n heapq.heappush(heap_Q, (start_node))\\n closed_routes[start_osmid] = None\\n while(True):\\n temp = heapq.heappop(heap_Q)\\n if temp[2] == end_osmid:\\n temp_end = end_osmid\\n path = []\\n path.append(end_osmid)\\n while (temp_end is not None):\\n temp_list = closed_routes.get(temp_end)\\n if temp_list is not None:\\n temp_end = temp_list[0]\\n path.append(temp_end)\\n else:\\n final_path = path[::-1]\\n return final_path\\n\\n for counter, x in enumerate(list(G.edges())[0:]):\\n if x[0] == temp[2]:\\n if x[1] in closed_routes:\\n continue\\n else:\\n length = list(G.edges.values())[counter].get(\\\"length\\\", None)\\n current_length = length + temp[3]\\n slat = radians(G.nodes.get(x[1]).get('y'))\\n slon = radians(G.nodes.get(x[1]).get('x'))\\n dist = 6371.01 * acos(sin(slat) * sin(elat) + cos(slat) * cos(elat) * cos(slon - elon))\\n H = dist*1000\\n if H < actual_dist + 100:\\n F = current_length + H\\n heapq.heappush(heap_Q, (F, x[0], x[1], current_length))\\n closed_routes[x[1]] = [x[0], length]\\n def delete_duplicate(x):\\n return list(dict.fromkeys(x))\\n def get_nearestedge_node(osm_id, y , x):\\n temp_nearest_edge = ox.get_nearest_edge(G, (y, x))\\n temp_1 = temp_nearest_edge[0].coords[0]\\n temp_2 = temp_nearest_edge[0].coords[1]\\n temp1_x = temp_1[0]\\n temp1_y = temp_1[1]\\n temp_1_distance = calculate_H(temp1_y, temp1_x, y, x)\\n temp2_x = temp_2[0]\\n temp2_y = temp_2[1]\\n temp_2_distance = calculate_H(temp2_y, temp2_x, y, x)\\n if temp_1_distance < temp_2_distance:\\n return [temp_nearest_edge[1],temp_1_distance,temp1_x,temp1_y]\\n else:\\n return [temp_nearest_edge[2],temp_2_distance,temp2_x,temp2_y]\\n def find_XY(node, graph):\\n for x in graph.nodes.items():\\n if x[1].get('osmid') == node:\\n node_x = x[1].get('x')\\n node_y = x[1].get('y')\\n node_list = (node_y, node_x)\\n return node_list\\n\\n start_time = time.time()\\n\\n # start = (103.9028788, 1.4044948)\\n # end = (103.8999124, 1.4035004)\\n # start = (103.9073345, 1.4060506)\\n # end = (103.9172982, 1.3956014)\\n #\\n # start = (103.9073345, 1.4060506)\\n # end = (103.9172982, 1.3956014)\\n\\n # start = (103.910650, 1.400818)\\n # end = (103.910296, 1.399252)\\n\\n # start =(103.9024 , 1.4052)\\n # end = (103.897332 , 1.402272)\\n\\n # start = (103.91256451606752, 1.402580108598971)\\n # end = (103.91270935535432, 1.401523634635178)\\n\\n start_osmid = 0\\n end_osmid = 0\\n punggol = (1.403948, 103.909048)\\n # G = ox.graph_from_point(punggol, distance=3500, truncate_by_edge=True, network_type=\\\"walk\\\")\\n G = ox.load_graphml('AStar_walk.graphml')\\n nodelist_G = list(G.nodes.values())\\n\\n \\\"\\\"\\\"\\n Start finding start and end Node ID.\\n If not found, find nearest node from the given coordinates by the user\\n \\\"\\\"\\\"\\n for i in range (0, len(nodelist_G)):\\n if nodelist_G[i].get('y') == start[1] and nodelist_G[i].get('x') == start[0]:\\n start_osmid = nodelist_G[i].get('osmid')\\n if nodelist_G[i].get('y') == end[1] and nodelist_G[i].get('x') == end[0]:\\n end_osmid = nodelist_G[i].get('osmid')\\n\\n if start_osmid == 0 or end_osmid == 0:\\n start_osmid = ox.get_nearest_node(G, (start[1], start[0]))\\n end_osmid = ox.get_nearest_node(G, (end[1], end[0]))\\n\\n \\\"\\\"\\\"\\n To calculate distance from 2 x,y axis\\n \\\"\\\"\\\"\\n R = 6371.0\\n snlat = radians(start[1])\\n snlon = radians(start[0])\\n elat = radians(end[1])\\n elon = radians(end[0])\\n actual_dist = 6371.01 * acos(sin(snlat) * sin(elat) + cos(snlat) * cos(elat) * cos(snlon - elon))\\n actual_dist = actual_dist*1000\\n edgelist_G = list(G.edges.values())\\n\\n\\n \\\"\\\"\\\"\\n After having start and end nodes.\\n The program will set a radius of 200 meters from start and end nodes\\n Every nodes within 200 meters and is a bus stop node will be captured and stored in end1 and end2\\n If within 200meters no bus stop is found, it will have a constant increment of 200meters until bus stop if found on both sides\\n \\\"\\\"\\\"\\n bus_G = bus_layer(start_osmid,end_osmid, None, 1)\\n start1 = start\\n start2 = end\\n\\n for i in bus_G:\\n temp_dis = calculate_H(bus_G.get(i)[2],bus_G.get(i)[1],start1[1], start1[0])\\n bus_G.get(i).append(temp_dis)\\n temp_dis = calculate_H(bus_G.get(i)[2], bus_G.get(i)[1], start2[1], start2[0])\\n bus_G.get(i).append(temp_dis)\\n end1 = []\\n end2 = []\\n limit = 0\\n while (len(end1) == 0):\\n limit += 200\\n for i in bus_G:\\n if bus_G.get(i)[3] < limit:\\n temp = []\\n temp.append(bus_G.get(i)[3])\\n temp.append(bus_G.get(i)[0])\\n temp.append(bus_G.get(i)[1])\\n temp.append(bus_G.get(i)[2])\\n hq.heappush(end1, temp)\\n limit = 0\\n while (len(end2) == 0):\\n limit += 200\\n for i in bus_G:\\n if bus_G.get(i)[4] < limit:\\n temp = []\\n temp.append(bus_G.get(i)[4])\\n temp.append(bus_G.get(i)[0])\\n temp.append(bus_G.get(i)[1])\\n temp.append(bus_G.get(i)[2])\\n hq.heappush(end2, temp)\\n\\n \\\"\\\"\\\"\\n The following codes will capture all nodes on the road that is closest to the bus stop\\n It will be stored in path1 and path2.\\n \\\"\\\"\\\"\\n path1 = []\\n for i in range (0, len(end1)):\\n if 1847853709 == end1[i][1]:\\n path1 = []\\n path1.append([2019165453, 0, 0, 0, 0])\\n break\\n else:\\n path1.append(get_nearestedge_node(end1[i][1], end1[i][3], end1[i][2]))\\n\\n for x in range (0, len(path1)):\\n path1[x].append(calculate_H(path1[x][3],path1[x][2], start1[1], start1[0]))\\n\\n path2 = []\\n for i in range (0, len(end2)):\\n path2.append(get_nearestedge_node(end2[i][1], end2[i][3], end2[i][2]))\\n for x in range (0, len(path2)):\\n path2[x].append(calculate_H(path2[x][3],path2[x][2], start2[1], start2[0]))\\n\\n \\\"\\\"\\\"\\n Bus results will store all data obtained from lta datamall\\n It will start calculating all possibilities from all bus stop captured in end1 and end2\\n Example, end1 contains [1,2,3], end2 contains [4,5,6]\\n The following code will start to find a route from [1,4] , [1,5] , [1,6] then [2,4] , [2,5] , [2,6] then [3,4] , [3,5] , [3,6]\\n Once all these route is found, it will proceed to compare the derived routes and capture the least amount of bus stop\\n Example, [1,4] is the shortest route found\\n Upon capturing the route with the least amount of bus stop, it will start to plot the walking A* algorithm from start point to bus stop\\n Example, [Start point, 1] then [End point, 4]\\n In this case, it will return [[Start point,1] , [1,4] , [End point,4]]\\n \\\"\\\"\\\"\\n # bus_results = bus_details_all()\\n # with open(\\\"data\\\\ltadatamall.txt\\\",\\\"w+\\\") as filehandler:\\n # json.dump(bus_results,filehandler)\\n with open(\\\"data\\\\ltadatamall.txt\\\", \\\"r\\\") as filehandler:\\n bus_results=json.load(filehandler)\\n approved = 0\\n path1_end_count = 0\\n path2_end_count = 0\\n for i in range (0, len(end1)):\\n if 1847853709 == end1[i][1]:\\n approved = 1\\n final_route_list = []\\n if approved == 1:\\n count = 99\\n for x in range (0, len(end2)):\\n final_route_list = bus_layer(1847853709, end2[x][1], bus_results, None)\\n try:\\n if len(final_route_list) < count:\\n path1[path1_end_count][0] = 4598672210\\n path2_end_count = x\\n temp_route_list = final_route_list.copy()\\n count = len(temp_route_list)\\n except:\\n continue\\n else:\\n count = 99\\n if len(final_route_list) == 0:\\n for i in range (0, len(end1)):\\n for x in range (0, len(end2)):\\n final_route_list = bus_layer(end1[i][1], end2[x][1], bus_results, None)\\n if final_route_list == -1:\\n continue\\n if len(final_route_list) < count:\\n path1_end_count = i\\n path2_end_count = x\\n temp_route_list = final_route_list\\n count = len(temp_route_list)\\n\\n path1 = walk_pathfinder(start_osmid, path1[path1_end_count][0])\\n path2 = walk_pathfinder(end_osmid, path2[path2_end_count][0])\\n walking_Path1 = []\\n walking_Path2 = []\\n bus_path = []\\n walking_Path2.append((end[1], end[0]))\\n for x in path1:\\n walking_Path1.append(find_XY(x, G))\\n for x in path2:\\n walking_Path2.append(find_XY(x, G))\\n\\n #ox.plot_graph_routes(G, [path1, path2])\\n plotting_route = []\\n \\\"\\\"\\\"\\n Upon capturing all the bus routes and walking routes, it will proceed to return the route for further processing\\n \\\"\\\"\\\"\\n\\n a = ox.load_graphml('WalkBus_end_graph.graphml')\\n try:\\n for x in temp_route_list:\\n plotting_route.extend(x)\\n plotting_route = delete_duplicate(plotting_route)\\n Tried = True\\n except:\\n return [[0], [0], [0]]\\n try:\\n #ox.plot_graph_route(a, plotting_route)\\n for x in plotting_route:\\n bus_path.append(find_XY(x, a))\\n except:\\n #ox.plot_graph_routes(a, temp_route_list)\\n Tried = False\\n for x in plotting_route:\\n for i in x:\\n bus_path.append(find_XY(i, a))\\n\\n # print(\\\"TEST - Start OSMID: \\\", start_osmid)\\n # print(\\\"TEST - End OSMID: \\\", end_osmid)\\n # print(\\\"TEST - Path 1: \\\" ,path1)\\n # print(\\\"TEST - Path 1 (X,Y): \\\", walking_Path1)\\n # print(\\\"TEST - Path 2: \\\" ,path2)\\n # print(\\\"TEST - Path 2 (X,Y): \\\", walking_Path2)\\n # print(\\\"TEST - BusRoute: \\\", plotting_route)\\n # print(\\\"TEST - Bus Path (X,Y): \\\", bus_path)\\n # ox.plot_graph_route(G, final_path, fig_height=10, fig_width=10)\\n if Tried == True:\\n return [walking_Path1, bus_path, walking_Path2]\\n else:\\n return [walking_Path1, bus_path, walking_Path2]\\n\\n print(\\\"--- %s seconds ---\\\" % (time.time() - start_time))\",\n \"def _run(self):\\n self._algorithm(self._list, self)\",\n \"def parallel_run():\\n from IPython.parallel import Client\\n\\n c = Client() # here is where the client establishes the connection\\n lv = c.load_balanced_view() # this object represents the engines (workers)\\n\\n\\n rays = []\\n maxs=25\\n bounding = AABA(xmin=0, ymin=0, zmin=0, xmax=maxs, ymax=maxs, zmax=maxs,)\\n gridd = np.zeros((maxs,maxs,maxs))\\n # spectrum for red to nir leaves\\n red_nir_leaves = spectrum(np.array([0.5, 0.85]), np.array([0.1, 0.6]), np.array([0.5, 0.1]))\\n # spectrum for soil\\n red_nir_soil = spectrum(np.array([0.5, 0.85]), np.array([0.3, 0.4]), np.array([0.0, 0.0]))\\n\\n\\n # scattering setup\\n scatt = BRDSF(red_nir_leaves, 0.0)\\n lf = leaf(55.0, 0.8) # leaf angle distribution and leaf area density\\n\\n\\n tasks = []\\n for x in xrange(maxs):\\n for y in xrange(maxs):\\n tasks.append(lv.apply(prun, x,y, maxs, gridd, scatt, red_nir_soil, bounding, lf))\\n\\n result = [task.get() for task in tasks] # blocks until all results are back\\n\\n return results\",\n \"def route_layout(self):\\n self.route_pins()\\n self.route_internal()\\n self.route_supplies()\",\n \"def post_process(self, xout, params_out):\\n # Should be used by all methods matching \\\"solve_*\\\"\\n for post_processor in self.post_processors:\\n xout, params_out = post_processor(xout, params_out)\\n return xout, params_out\",\n \"def extractor_multiprocess(self):\\n pool = multiprocessing.Pool()\\n queue = multiprocessing.Queue()\\n queue.put(\\\"safe\\\")\\n end = len(next(os.walk(self.datadir))[2])\\n error = 0\\n\\n extractor_iterator = ((directory)\\n for directory in os.listdir(self.datadir))\\n with jsonlines.open(self.output, \\\"w\\\") as f:\\n for x in tqdm.tqdm(\\n pool.imap_unordered(self.extract_unpack, extractor_iterator), total=end\\n ):\\n if not x:\\n \\\"\\\"\\\"\\n To input error class or function\\n \\\"\\\"\\\"\\n error += 1\\n continue\\n msg = queue.get()\\n if msg == \\\"safe\\\":\\n f.write(x)\\n queue.put(\\\"safe\\\")\\n\\n pool.close()\",\n \"def bulk_process(self):\\n\\n def actions():\\n try:\\n task = self.queue.get(block=False, timeout=None)\\n\\n if task['action'] == 'index':\\n yield {\\n '_op_type': 'index',\\n '_index': self.ensure_index(task),\\n '_id': task['id'],\\n 'doc': task['properties']\\n }\\n elif task['action'] == 'delete':\\n yield {\\n '_op_type': 'delete',\\n '_index': self.ensure_index(task),\\n '_id': task['id'],\\n 'doc': task['properties']\\n }\\n else:\\n raise NotImplementedError\\n\\n except Empty:\\n pass\\n\\n for success, info in streaming_bulk(self.es_client, actions()):\\n if success:\\n self.queue.task_done()\",\n \"def apply(self, callback, route):\",\n \"def partition_processor(partitionlinechunks):\\n\\n model_pipe_object = joblib.load(SparkFiles.get(\\\"mmp_phase1_D2.clf\\\"))\\n\\n def set_predictions(x):\\n segment = model_pipe_object.predict_proba(x)\\n return segment\\n\\n df_with_nan = build_dataframe(partitionlinechunks)\\n df_with_newline = df_with_nan.replace(u\\\"NULL\\\", pd.np.nan)\\n behaviour_df = df_with_newline.replace(u\\\"\\\\\\\\N\\\", pd.np.nan)\\n predictions_ser = set_predictions(behaviour_df)\\n\\n predictions_list = [value for value in [zip(predictions_ser.index, predictions_ser.loc[:,'A'], predictions_ser.loc[:,'Y'], predictions_ser.loc[:,'segment'], predictions_ser.loc[:,'model_version'])]]\\n return iter(predictions_list)\",\n \"def compute(self):\\n try:\\n self.set_trackline()\\n except:\\n app.logger.warning(\\\"Could not process trackline results. URL may be invalid?\\\")\\n\\n if Job.exists(self.task_id, connection=redis_connection):\\n job = Job.fetch(self.task_id, connection=redis_connection)\\n self.task_result = unicode(job.meta.get(\\\"outcome\\\", \\\"\\\"))\\n\\n self.save()\",\n \"def split(self):\\n st = time()\\n tokens = self._build_args.tokens\\n\\n for token_split in IStorage._tokens_partitions(tokens, config.min_number_of_tokens,\\n config.number_of_partitions):\\n storage_id = uuid.uuid4()\\n log.debug('assigning to %s %d tokens', str(storage_id), len(token_split))\\n new_args = self._build_args._replace(tokens=token_split, storage_id=storage_id)\\n self.__class__._store_meta(new_args)\\n\\n yield self.__class__.build_remotely(new_args)\\n log.debug('completed split of %s in %f', self.__class__.__name__, time() - st)\",\n \"def _run_parallel(\\n self, processes: int = 2, build_results: bool = True\\n ) -> bool:\\n # At first sight, it might seem simpler to use the multiprocessing Pool\\n # Class rather than Processes and Queues. However, this way is faster.\\n work_queue = Queue() # type: Queue\\n done_queue = Queue() # type: Queue\\n workers = self._n_workers(processes=processes)\\n\\n chunks = self.match_generator.build_match_chunks()\\n for chunk in chunks:\\n work_queue.put(chunk)\\n\\n self._start_workers(workers, work_queue, done_queue, build_results)\\n self._process_done_queue(workers, done_queue, build_results)\\n\\n return True\",\n \"def refine(self, refine_results):\\n for phase_path, phase_refinement_results in refine_results.items():\\n phase = self.phases[phase_path]\\n tx = phase.options['transcription']\\n gd = tx.grid_data\\n\\n need_refine = phase_refinement_results['need_refinement']\\n if not phase.refine_options['refine'] or not np.any(need_refine):\\n refine_results[phase_path]['new_order'] = gd.transcription_order\\n refine_results[phase_path]['new_num_segments'] = gd.num_segments\\n refine_results[phase_path]['new_segment_ends'] = gd.segment_ends\\n continue\\n\\n # Refinement is needed\\n gd = phase.options['transcription'].grid_data\\n numseg = gd.num_segments\\n\\n refine_seg_idxs = np.where(need_refine)\\n P = np.zeros(numseg)\\n P[refine_seg_idxs] = np.log(self.error[phase_path][refine_seg_idxs] /\\n phase.refine_options['tolerance']) / np.log(\\n gd.transcription_order[refine_seg_idxs])\\n P = np.ceil(P).astype(int)\\n\\n if gd.transcription == 'gauss-lobatto':\\n odd_idxs = np.where(P % 2 != 0)\\n P[odd_idxs] += 1\\n\\n new_order = gd.transcription_order + P\\n B = np.ones(numseg, dtype=int)\\n\\n raise_order_idxs = np.where(gd.transcription_order + P <= phase.refine_options['max_order'])\\n split_seg_idxs = np.where(gd.transcription_order + P > phase.refine_options['max_order'])\\n\\n new_order[raise_order_idxs] = gd.transcription_order[raise_order_idxs] + P[raise_order_idxs]\\n new_order[split_seg_idxs] = phase.refine_options['min_order']\\n\\n B[split_seg_idxs] = np.around((gd.transcription_order[split_seg_idxs] +\\n P[split_seg_idxs]) / phase.refine_options['min_order']).astype(int)\\n\\n new_order = np.repeat(new_order, repeats=B)\\n new_num_segments = int(np.sum(B))\\n new_segment_ends = split_segments(gd.segment_ends, B)\\n\\n refine_results[phase_path]['new_order'] = new_order\\n refine_results[phase_path]['new_num_segments'] = new_num_segments\\n refine_results[phase_path]['new_segment_ends'] = new_segment_ends\\n\\n tx.options['order'] = new_order\\n tx.options['num_segments'] = new_num_segments\\n tx.options['segment_ends'] = new_segment_ends\\n tx.init_grid()\",\n \"def run(self):\\n while True:\\n next_task = self.task_queue.get()\\n if next_task is None:\\n # Poison pill means shutdown\\n self.task_queue.task_done()\\n break\\n # Fetch answer from task\\n answer = next_task()\\n self.task_queue.task_done()\\n # Put into result queue\\n self.result_queue.put(answer)\\n return\",\n \"def online_server_garbler_phase(env, pipe, storage):\\n\\n global clienf_inf_times, num_infs_completed, request_times, waiting_times, offline_times\\n while True:\\n request = yield pipe.get()\\n start_time = env.now\\n waiting_time = start_time - request['request_time'] \\n waiting_times.append(waiting_time)\\n \\n before_gc = env.now\\n yield storage.get(NUM_RELU)\\n offline_times.append(env.now - before_gc)\\n\\n\\n for i in range(len(utils.on_client_compute_relu)): # for i in range(nonlinear layers)...\\n yield env.timeout(utils.on_client_write_linear[i] / bandwidth) # client sends x-r to server\\n yield env.timeout(utils.on_server_compute_linear[i]) # server performs linear eval (conv)\\n yield env.timeout(utils.on_server_write_relu[i] / bandwidth) # server sends encoded labels to client\\n yield env.timeout(utils.on_client_compute_relu[i]) # client evaluates garbled circuit\\n\\n \\n # send prediction to client\\n yield env.timeout(utils.on_server_write_pred / bandwidth) # server sends prediction to client\\n\\n num_infs_completed +=1\\n client_inf_times.append(env.now-start_time)\",\n \"def build_chunks(results, metadata):\\n\\n for result in results:\\n chunk = connector_pb2.DataChunk()\\n for field in metadata.fieldInfo:\\n set_value(result, field.name, chunk)\\n yield chunk\",\n \"def run(self):\\n # For each microenvironment that the person visits\\n while self.routing_node_id != 'end':\\n # Get the next node, and this activity class and arguments.\\n self.routing_node_id, activity_class, kwargs = self.routing.get_next_activity(self.routing_node_id)\\n\\n # Add this instance to the arguments list\\n kwargs['person'] = self\\n\\n # Create a parametrised instance of the activity\\n this_activity_class = activity_class(self.simulation_params, **kwargs)\\n \\n # set an event flag to mark end of activity and call the activity class\\n finished_activity = self.env.event() \\n self.env.process(this_activity_class.start(finished_activity))\\n yield finished_activity\",\n \"def finalize(self):\\n routes = self.routes.copy()\\n for child in self._children:\\n routes.extend(list(child.tree_routes))\\n\\n # Make a new Map() out of all of the routes.\\n rule_map = Map([route.create_rule() for route in routes])\\n self._route_map = rule_map\\n\\n self.finalized = True\",\n \"def recv_messages(self):\\n while True:\\n b = unwrap_read(self.sock.recv(4096))\\n msgs = self.parser.feed(b)\\n if msgs:\\n for msg in msgs:\\n self.router.incoming(msg)\\n return\",\n \"def __call__(self, ctx: ResolutionContext) -> Coroutine[None, None, RT]:\",\n \"def run(self):\\n import sacc\\n import healpy\\n import treecorr\\n # Load the different pieces of data we need into\\n # one large dictionary which we accumulate\\n data = {}\\n self.load_tomography(data)\\n self.load_shear_catalog(data)\\n self.load_random_catalog(data)\\n # This one is optional - this class does nothing with it\\n self.load_lens_catalog(data)\\n # Binning information\\n self.read_nbin(data)\\n\\n # Calculate metadata like the area and related\\n # quantities\\n meta = self.calculate_metadata(data)\\n\\n # Choose which pairs of bins to calculate\\n calcs = self.select_calculations(data)\\n\\n sys.stdout.flush()\\n \\n # This splits the calculations among the parallel bins\\n # It's not necessarily the most optimal way of doing it\\n # as it's not dynamic, just a round-robin assignment,\\n # but for this case I would expect it to be mostly fine\\n results = []\\n for i,j,k in self.split_tasks_by_rank(calcs):\\n results += self.call_treecorr(data, i, j, k)\\n\\n # If we are running in parallel this collects the results together\\n results = self.collect_results(results)\\n\\n # Save the results\\n if self.rank==0:\\n self.write_output(data, meta, results)\",\n \"def _worker(pipelines: List[Pipeline], source: Queue, sink: Queue):\\n pipelines = list(pipelines)\\n for i, p in enumerate(pipelines):\\n if isinstance(p, ConvertT2S):\\n pipelines[i] = ConvertT2S()\\n\\n def processor(article):\\n for p in pipelines:\\n article = p(article)\\n return article\\n\\n while True:\\n article = source.get()\\n if article == 'EXIT':\\n return\\n article = list(processor(article))\\n sink.put(article)\",\n \"def process_solution(self, solution: dict) -> (list, float):\\n start_time = time() * 1000\\n nodes = self.application.nodes()\\n start = np.min(nodes)\\n # fill route with None values\\n route = [None] * len(self.application)\\n # get nodes from sample\\n # NOTE: Prevent duplicate node entries by enforcing only one occurrence per node along route\\n logging.info(str(solution.items()))\\n\\n for (node, timestep), val in solution.items():\\n if val:\\n logging.info((node, timestep))\\n if val and (node not in route):\\n route[timestep] = node\\n\\n # check whether every timestep has only 1 node flagged\\n for i in nodes:\\n relevant_nodes = []\\n relevant_timesteps = []\\n for (node, timestep) in solution.keys():\\n if node == i:\\n relevant_nodes.append(solution[(node, timestep)])\\n if timestep == i:\\n relevant_timesteps.append(solution[(node, timestep)])\\n if sum(relevant_nodes) != 1 or sum(relevant_timesteps) != 1:\\n # timestep or nodes have more than 1 or 0 flags\\n return None, round(time() * 1000 - start_time, 3)\\n\\n # check validity of solution\\n if sum(value == 1 for value in solution.values()) > len(route):\\n logging.warning(\\\"Result is longer than route! This might be problematic!\\\")\\n return None, round(time() * 1000 - start_time, 3)\\n\\n # run heuristic replacing None values\\n if None in route:\\n # get not assigned nodes\\n nodes_unassigned = [node for node in list(nodes) if node not in route]\\n nodes_unassigned = list(np.random.permutation(nodes_unassigned))\\n for idx, node in enumerate(route):\\n if node is None:\\n route[idx] = nodes_unassigned[0]\\n nodes_unassigned.remove(route[idx])\\n\\n # cycle solution to start at provided start location\\n if start is not None and route[0] != start:\\n # rotate to put the start in front\\n idx = route.index(start)\\n route = route[idx:] + route[:idx]\\n\\n # print route\\n parsed_route = ' ->\\\\n'.join([f' Node {visit}' for visit in route])\\n logging.info(f\\\"Route found:\\\\n{parsed_route}\\\")\\n return route, round(time() * 1000 - start_time, 3)\",\n \"def process_results(self):\\n return self._do_action_under_lock(self._process_results)\",\n \"def mirror_batch(self, representations):\\n filehandles = []\\n requests = []\\n representations_by_response_url = dict()\\n \\n for representation in representations:\\n if not representation.mirror_url:\\n representation.mirror_url = representation.url\\n # Turn the mirror URL into an s3.amazonaws.com URL.\\n bucket, filename = self.bucket_and_filename(\\n representation.mirror_url\\n )\\n response_url = self.url(bucket, filename)\\n representations_by_response_url[response_url] = (\\n representation)\\n bucket, remote_filename = self.bucket_and_filename(\\n representation.mirror_url)\\n fh = representation.content_fh()\\n filehandles.append(fh)\\n request = self.pool.upload(remote_filename, fh, bucket=bucket,\\n content_type=representation.media_type)\\n requests.append(request)\\n # Do the upload.\\n\\n def process_response(response):\\n representation = representations_by_response_url[response.url]\\n if response.status_code == 200:\\n source = representation.local_content_path\\n if representation.url != representation.mirror_url:\\n source = representation.url\\n if source:\\n print \\\"MIRRORED %s => %s\\\" % (\\n source, representation.mirror_url)\\n else:\\n print \\\"MIRRORED %s\\\" % representation.mirror_url\\n representation.set_as_mirrored()\\n else:\\n representation.mirrored_at = None\\n representation.mirror_exception = \\\"Status code %d: %s\\\" % (\\n response.status_code, response.content)\\n\\n try:\\n for response in self.pool.as_completed(requests):\\n process_response(response)\\n except ConnectionError, e:\\n # This is a transient error; we can just try again.\\n print e\\n pass\\n except HTTPError, e:\\n # Probably also a transient error. In any case\\n # there's nothing we can do about it but try again.\\n print e\\n pass\\n\\n # Close the filehandles\\n for fh in filehandles:\\n fh.close()\",\n \"def routes(self) -> List[Tuple[int, bytes]]:\\n raise NotImplementedError() # pragma: no cover\",\n \"def process_response(self, response):\\n json = response.json()\\n for resp in json[\\\"responses\\\"]:\\n sub_qry = self._current_query.get(int(resp[\\\"id\\\"]))\\n self.context.pending_request().map_json(resp[\\\"body\\\"], sub_qry.return_type)\",\n \"def chunk(self, count):\\n page = 1\\n results = self.for_page(page, count).get()\\n\\n while len(results) > 0:\\n yield results\\n\\n page += 1\\n\\n results = self.for_page(page, count).get()\",\n \"def run(self):\\n super().run()\\n echo = self.echo\\n local = self.local\\n remote = self.remote\\n transport = Transceiver(local)\\n transport.set_timeout(0.5)\\n self.__result: list[Entry] = []\\n\\n while True:\\n try:\\n packet = transport.recv(None)\\n params = frame.deserialize(packet)\\n seq = params[\\\"seq\\\"]\\n total = params[\\\"total\\\"]\\n t_master = params[\\\"t_master\\\"]\\n infinite = params[\\\"infinite\\\"]\\n payload = params[\\\"payload\\\"]\\n\\n t_slave = time.time()\\n if echo:\\n data_send = frame.serialize(infinite, seq, total, t_master, t_slave, payload)\\n transport.send(remote, data_send)\\n t_ul = (t_slave - t_master) * 1000\\n self.add_result(Entry(seq, total, t_ul, 0))\\n print(f\\\"seq = {seq}, ul = {t_ul:.2f} ms, payload: {hex_str(payload)}\\\")\\n if frame.is_end(params):\\n print(f\\\"receive last packet!\\\")\\n break\\n except socket.timeout:\\n continue\\n except KeyboardInterrupt:\\n break\",\n \"def dispatch(self, queue):\\n context = zmq.Context()\\n socket = noBlockREQ(context)\\n \\n seedsQ1 = Queue()\\n seedsQ2 = Queue()\\n for address in self.seeds:\\n seedsQ1.put(address)\\n\\n connectT = Thread(target=connectToSeeds, name=\\\"Connect to Seeds\\\", args=(socket, seedsQ1))\\n connectT.start()\\n\\n toDisconnectQ = Queue()\\n disconnectT = Thread(target=disconnectToSeeds, name=\\\"Disconnect to Seeds\\\", args=(socket, toDisconnectQ))\\n disconnectT.start()\\n\\n pFindSeeds = Process(target=findSeeds, name=\\\"Find Seeds\\\", args=(set(self.seeds), [seedsQ1], [toDisconnectQ], log, 2000, 10, seedsQ2))\\n pFindSeeds.start()\\n\\n pInput = Process(target=getSeedFromFile, name=\\\"Get seed from file\\\", args=(seedsQ1, seedsQ2))\\n pInput.start()\\n\\n graph = {}\\n depth = 1\\n data = {}\\n url_mapper = {url:f\\\"url_{i}\\\" for i, url in enumerate(self.urls)}\\n \\n src = set()\\n while True: \\n new_data = {}\\n while len(self.urls):\\n try:\\n url = self.urls[0]\\n self.urls.pop(0)\\n self.urls.append(url)\\n with counterSocketReq:\\n socket.send_json((\\\"URL\\\", self.uuid, url))\\n log.debug(f\\\"Send {url}\\\", \\\"dispatch\\\")\\n response = socket.recv_pyobj()\\n assert isinstance(response, tuple), f\\\"Bad response, expected <tuple> find {type(response)}\\\"\\n assert len(response) == 2, \\\"bad response size\\\"\\n assert response[0] == 'RESPONSE', \\\"Unexpected response format\\\"\\n _, package = response\\n log.debug(f\\\"Received a package with size: {len(package)}\\\", \\\"dispatch\\\")\\n for recv_url, html in package.items():\\n try:\\n idx = self.urls.index(recv_url)\\n log.info(f\\\"{recv_url} {GREEN}OK{RESET}\\\", \\\"dispatch\\\")\\n new_data[recv_url] = html\\n self.urls.pop(idx)\\n except ValueError:\\n log.debug(f'Unnecesary {recv_url}', 'dispatch')\\n except AssertionError as e:\\n log.error(e, \\\"dispatch\\\")\\n except zmq.error.Again as e:\\n log.debug(e, \\\"dispatch\\\")\\n except Exception as e:\\n log.error(e, \\\"dispatch\\\")\\n time.sleep(0.8)\\n \\n log.info(f'Depth {depth} done', 'dispatch')\\n for url, html in new_data.items():\\n graph[url] = set()\\n try:\\n text = html.decode()\\n soup = BeautifulSoup(html, 'html.parser')\\n tags = soup.find_all(valid_tags)\\n new_urls = [['src', 'href'][tag.has_attr('href')] for tag in tags]\\n changes = []\\n for i, attr in enumerate(new_urls):\\n url_dir = urljoin(url, tags[i][attr])\\n graph[url].add(url_dir)\\n if url_dir not in url_mapper:\\n url_mapper[url_dir] = f'url_{len(url_mapper)}'\\n changes.append((tags[i][attr], url_mapper[url_dir]))\\n if attr == 'src' or tags[i].name == 'link':\\n src.add(url_dir)\\n continue\\n self.urls.append(url_dir)\\n html = change_html(text, changes).encode()\\n except UnicodeDecodeError:\\n log.debug(f'{url} is not decodeable', 'dispatch')\\n except: # BeautifulSoup strange exceptions related with his's logger\\n pass\\n new_data[url] = html\\n data.update(new_data)\\n self.urls = set(self.urls)\\n self.urls.difference_update(self.old)\\n self.old.update(self.urls)\\n self.urls = list(self.urls)\\n \\n if depth > self.depth:\\n break\\n if depth == self.depth:\\n src.difference_update(self.old)\\n self.old.update(src)\\n self.urls = list(src)\\n depth += 1\\n log.info(f\\\"Number of URLs to be requested for download: {RED}{len(self.urls)}{RESET}\\\", \\\"dispatch\\\")\\n \\n log.info(f\\\"Starting to write data\\\", \\\"dispatch\\\")\\n for i, url in enumerate(self.originals):\\n try:\\n res = HtmlResponse(url=url, body=data[url], encoding='utf8')\\n base = res.css('title::text')[0].get()\\n except:\\n base = f\\\"web_page_{i}\\\"\\n try:\\n os.makedirs(f'downloads/{base}-data')\\n except:\\n pass\\n writer(f'downloads/{base}-data', url, set(), data, url_mapper, graph) \\n \\n html = data[url]\\n if len(graph[url]) > 0:\\n text = data[url].decode()\\n changes = []\\n for dep in graph[url]:\\n name = url_mapper[dep]\\n changes.append((name, f'{base}-data/{name}'))\\n html = change_html(text, changes).encode()\\n with open(f'downloads/{base}', 'wb') as fd:\\n fd.write(html)\\n \\n log.info(f\\\"Dispatcher:{self.uuid} has completed his URLs succefully\\\", \\\"dispatch\\\")\\n log.debug(f\\\"Dispatcher:{self.uuid} disconnecting from system\\\", \\\"dispatch\\\")\\n #disconnect\\n\\n queue.put(True)\\n pFindSeeds.terminate()\\n pInput.terminate()\",\n \"def do_process_user_file_chunks(\\n page_size: int, error_handler: ErrorHandler, position: int, participant: Participant\\n):\\n \\n # FIXME: this is a gross hack to force some time related safety, which is only ever used deep\\n # inside of data processing.\\n common_constants.LATEST_POSSIBLE_DATA_TIMESTAMP = \\\\\\n int(time.mktime((timezone.now() + timedelta(days=90)).timetuple()))\\n \\n # Declare a defaultdict of a tuple of 2 lists\\n all_binified_data = defaultdict(lambda: ([], []))\\n ftps_to_remove = set()\\n # The ThreadPool enables downloading multiple files simultaneously from the network, and continuing\\n # to download files as other files are being processed, making the code as a whole run faster.\\n # In principle we could make a global pool that is free-memory aware.\\n pool = ThreadPool(CONCURRENT_NETWORK_OPS)\\n survey_id_dict = {}\\n \\n # A Django query with a slice (e.g. .all()[x:y]) makes a LIMIT query, so it\\n # only gets from the database those FTPs that are in the slice.\\n # print(participant.as_dict())\\n print(\\\"Number Files To Process:\\\", participant.files_to_process.exclude(deleted=True).count())\\n print(f\\\"will process {page_size} files.\\\")\\n print(\\\"current count processing within this run:\\\", position)\\n \\n # TODO: investigate, comment. ordering by path results in files grouped by type and\\n # chronological order, which is perfect for download efficiency... right? would it break anthing?\\n files_to_process = participant.files_to_process \\\\\\n .exclude(deleted=True) #.order_by(\\\"s3_file_path\\\", \\\"created_on\\\")\\n \\n # This pool pulls in data for each FileForProcessing on a background thread and instantiates it.\\n # Instantiating a FileForProcessing object queries S3 for the File's data. (network request))\\n files_for_processing = pool.map(\\n FileForProcessing, files_to_process[position: position + page_size], chunksize=1\\n )\\n \\n for file_for_processing in files_for_processing:\\n with error_handler:\\n process_one_file(\\n file_for_processing, survey_id_dict, all_binified_data, ftps_to_remove\\n )\\n pool.close()\\n pool.terminate()\\n \\n # there are several failure modes and success modes, information for what to do with different\\n # files percolates back to here. Delete various database objects accordingly.\\n more_ftps_to_remove, number_bad_files, earliest_time_bin, latest_time_bin = upload_binified_data(\\n all_binified_data, error_handler, survey_id_dict, participant\\n )\\n ftps_to_remove.update(more_ftps_to_remove)\\n \\n # Update the data quantity stats, if it actually processed any files\\n if len(files_to_process) > 0:\\n calculate_data_quantity_stats(participant,\\n earliest_time_bin_number=earliest_time_bin,\\n latest_time_bin_number=latest_time_bin)\\n \\n # Actually delete the processed FTPs from the database\\n FileToProcess.objects.filter(pk__in=ftps_to_remove).delete()\\n return number_bad_files\",\n \"def post(self, location_name):\\n # get grass and actinia module lists\\n module_list = createModuleList(self)\\n pc_list = createProcessChainTemplateList()\\n # TODO: find out size before ?\\n grass_module_list = []\\n actinia_module_list = []\\n\\n for module in module_list:\\n grass_module_list.append(module['id'])\\n\\n for module in pc_list:\\n actinia_module_list.append(module['id'])\\n\\n rdc = self.preprocess(has_json=True, location_name=location_name)\\n\\n if rdc:\\n rdc.set_storage_model_to_file()\\n\\n new_pc = []\\n for module in rdc.request_data['list']:\\n if \\\"module\\\" in module:\\n name = module[\\\"module\\\"]\\n if name == \\\"importer\\\" or name == \\\"exporter\\\":\\n new_pc.append(module)\\n elif name in grass_module_list:\\n new_pc.append(module)\\n elif name in actinia_module_list:\\n module_pc = fillTemplateFromProcessChain(module)\\n new_pc.extend(module_pc)\\n else:\\n msg = \\\"Module %s is not of type importer, exporter, grass-module or an actinia-module.\\\" % name\\n return make_response(jsonify(SimpleResponseModel(\\n status=\\\"error\\\",\\n message=msg\\n )), 409)\\n else:\\n new_pc.append(module)\\n\\n rdc.request_data['list'] = new_pc\\n\\n enqueue_job(self.job_timeout, start_job, rdc)\\n\\n html_code, response_model = pickle.loads(self.response_data)\\n return make_response(jsonify(response_model), html_code)\",\n \"def process_deferred_queue(self):\\n\\n self.process_queue(self.deferred_queue)\\n\\n if self.depth_counter == 0:\\n self.process_queue(self.complex_deferred_queue)\",\n \"def process(self):\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6792837","0.5855412","0.5633914","0.548248","0.54527795","0.532048","0.53184384","0.52948433","0.52264017","0.5213624","0.51902413","0.51709","0.51507914","0.5139252","0.51372004","0.5116195","0.5072712","0.507154","0.50373584","0.50307095","0.5008679","0.4995035","0.49627793","0.4961484","0.49454665","0.49254796","0.49208376","0.49043077","0.48994264","0.48747247","0.48695818","0.48561996","0.48322028","0.4831495","0.47910652","0.4788954","0.47760087","0.47542816","0.4743844","0.4735418","0.47332266","0.47332266","0.47313505","0.47216228","0.47176906","0.4701077","0.46839064","0.468193","0.4679314","0.46724427","0.4670058","0.4669401","0.4667635","0.46644023","0.4661991","0.4657582","0.46568626","0.46545163","0.46531245","0.46483","0.46472332","0.46397546","0.46365276","0.46354595","0.46320483","0.4623566","0.46185514","0.46181092","0.46129256","0.46072066","0.45992795","0.45967567","0.459483","0.45931423","0.4591657","0.45873547","0.45872748","0.4579626","0.45761064","0.4575869","0.4569023","0.45686823","0.4567389","0.45665282","0.454292","0.45427376","0.45395207","0.45364398","0.4532831","0.45317727","0.4529151","0.45252255","0.45230108","0.45227224","0.45127425","0.45070723","0.45027938","0.45024824","0.4502193","0.44999668"],"string":"[\n \"0.6792837\",\n \"0.5855412\",\n \"0.5633914\",\n \"0.548248\",\n \"0.54527795\",\n \"0.532048\",\n \"0.53184384\",\n \"0.52948433\",\n \"0.52264017\",\n \"0.5213624\",\n \"0.51902413\",\n \"0.51709\",\n \"0.51507914\",\n \"0.5139252\",\n \"0.51372004\",\n \"0.5116195\",\n \"0.5072712\",\n \"0.507154\",\n \"0.50373584\",\n \"0.50307095\",\n \"0.5008679\",\n \"0.4995035\",\n \"0.49627793\",\n \"0.4961484\",\n \"0.49454665\",\n \"0.49254796\",\n \"0.49208376\",\n \"0.49043077\",\n \"0.48994264\",\n \"0.48747247\",\n \"0.48695818\",\n \"0.48561996\",\n \"0.48322028\",\n \"0.4831495\",\n \"0.47910652\",\n \"0.4788954\",\n \"0.47760087\",\n \"0.47542816\",\n \"0.4743844\",\n \"0.4735418\",\n \"0.47332266\",\n \"0.47332266\",\n \"0.47313505\",\n \"0.47216228\",\n \"0.47176906\",\n \"0.4701077\",\n \"0.46839064\",\n \"0.468193\",\n \"0.4679314\",\n \"0.46724427\",\n \"0.4670058\",\n \"0.4669401\",\n \"0.4667635\",\n \"0.46644023\",\n \"0.4661991\",\n \"0.4657582\",\n \"0.46568626\",\n \"0.46545163\",\n \"0.46531245\",\n \"0.46483\",\n \"0.46472332\",\n \"0.46397546\",\n \"0.46365276\",\n \"0.46354595\",\n \"0.46320483\",\n \"0.4623566\",\n \"0.46185514\",\n \"0.46181092\",\n \"0.46129256\",\n \"0.46072066\",\n \"0.45992795\",\n \"0.45967567\",\n \"0.459483\",\n \"0.45931423\",\n \"0.4591657\",\n \"0.45873547\",\n \"0.45872748\",\n \"0.4579626\",\n \"0.45761064\",\n \"0.4575869\",\n \"0.4569023\",\n \"0.45686823\",\n \"0.4567389\",\n \"0.45665282\",\n \"0.454292\",\n \"0.45427376\",\n \"0.45395207\",\n \"0.45364398\",\n \"0.4532831\",\n \"0.45317727\",\n \"0.4529151\",\n \"0.45252255\",\n \"0.45230108\",\n \"0.45227224\",\n \"0.45127425\",\n \"0.45070723\",\n \"0.45027938\",\n \"0.45024824\",\n \"0.4502193\",\n \"0.44999668\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6839286"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94759,"cells":{"query":{"kind":"string","value":"Merge the routes calculated in each separate process into a single feature class. Create an empty final output feature class and populate it using InsertCursor, as this tends to be faster than using the Merge geoprocessing tool."},"document":{"kind":"string","value":"def _post_process_route_fcs(self):\r\n # Create the final output feature class\r\n desc = arcpy.Describe(self.route_fcs[0])\r\n helpers.run_gp_tool(\r\n LOGGER,\r\n arcpy.management.CreateFeatureclass, [\r\n os.path.dirname(self.out_routes),\r\n os.path.basename(self.out_routes),\r\n \"POLYLINE\",\r\n self.route_fcs[0], # template feature class to transfer full schema\r\n \"SAME_AS_TEMPLATE\",\r\n \"SAME_AS_TEMPLATE\",\r\n desc.spatialReference\r\n ]\r\n )\r\n\r\n # Insert the rows from all the individual output feature classes into the final output\r\n fields = [\"SHAPE@\"] + [f.name for f in desc.fields]\r\n with arcpy.da.InsertCursor(self.out_routes, fields) as cur: # pylint: disable=no-member\r\n for fc in self.route_fcs:\r\n for row in arcpy.da.SearchCursor(fc, fields): # pylint: disable=no-member\r\n cur.insertRow(row)"},"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 _export_to_feature_class(self, chunk_definition):\r\n # Make output gdb\r\n rt_workspace = self._create_output_gdb()\r\n\r\n # Export routes\r\n output_routes = os.path.join(rt_workspace, f\"Routes_{chunk_definition[0]}_{chunk_definition[1]}\")\r\n self.logger.debug(f\"Exporting Route Routes output to {output_routes}...\")\r\n self.solve_result.export(arcpy.nax.RouteOutputDataType.Routes, output_routes)\r\n\r\n # Export stops\r\n output_stops = os.path.join(rt_workspace, f\"Stops_{chunk_definition[0]}_{chunk_definition[1]}\")\r\n self.logger.debug(f\"Exporting Route Stops output to {output_stops}...\")\r\n self.solve_result.export(arcpy.nax.RouteOutputDataType.Stops, output_stops)\r\n\r\n # Join the input ID fields to Routes\r\n # The new FirstStopID and LastStopID fields were added at Pro 3.1 / Enterprise 11.1 to make relationships\r\n # between IDs/OIDs in output classes are more reliable. Use these fields if they exist in the output.\r\n # Otherwise, use FirstStopOID and LastStopOID, which are mostly reliable but not perfect. For best results, use\r\n # the most recent ArcGIS software.\r\n if \"FirstStopID\" in self.solve_result.fieldNames(arcpy.nax.RouteOutputDataType.Routes):\r\n id_field_prefix = \"ID\"\r\n else:\r\n id_field_prefix = \"OID\"\r\n if self.reverse_direction:\r\n first_stop_field = self.dest_unique_id_field_name\r\n second_stop_field = self.origin_unique_id_field_name\r\n else:\r\n first_stop_field = self.origin_unique_id_field_name\r\n second_stop_field = self.dest_unique_id_field_name\r\n with arcpy.EnvManager(overwriteOutput=True):\r\n helpers.run_gp_tool(\r\n self.logger,\r\n arcpy.management.JoinField,\r\n [output_routes, f\"FirstStop{id_field_prefix}\", output_stops, \"ObjectID\", [first_stop_field]]\r\n )\r\n helpers.run_gp_tool(\r\n self.logger,\r\n arcpy.management.JoinField,\r\n [output_routes, f\"LastStop{id_field_prefix}\", output_stops, \"ObjectID\", [second_stop_field]]\r\n )\r\n\r\n self.job_result[\"outputRoutes\"] = output_routes","def process(sources, output, force):\n logging.basicConfig(level=logging.INFO,\n format='%(asctime)s [%(levelname)s] - %(message)s', datefmt=\"%H:%M:%S\")\n\n logging.getLogger('shapely.geos').setLevel(logging.WARNING)\n logging.getLogger('Fiona').setLevel(logging.WARNING)\n logging.getLogger('requests.packages.urllib3.connectionpool').setLevel(logging.WARNING)\n requests.packages.urllib3.disable_warnings()\n # logging.getLogger('processing').setLevel(logging.DEBUG)\n\n catalog_features = []\n failures = []\n path_parts_to_skip = utils.get_path_parts(sources).index(\"sources\") + 1\n success = True\n for path in utils.get_files(sources):\n try:\n logging.info(\"Processing \" + path)\n pathparts = utils.get_path_parts(path)[path_parts_to_skip:]\n pathparts[-1] = pathparts[-1].replace('.json', '.geojson')\n\n outdir = os.path.join(output, *pathparts[:-1], pathparts[-1].replace('.geojson', ''))\n outfile = os.path.join(output, *pathparts)\n\n source = utils.read_json(path)\n urlfile = urlparse(source['url']).path.split('/')[-1]\n \n if not hasattr(adapters, source['filetype']):\n logging.error('Unknown filetype ' + source['filetype'])\n failures.append(path)\n continue\n \n read_existing = False\n if os.path.isfile(outfile):\n logging.info(\"Output file exists\")\n if os.path.getmtime(outfile) > os.path.getmtime(path):\n logging.info(\"Output file is up to date\")\n if not force:\n read_existing = True\n logging.warning('Skipping ' + path + ' since generated file exists. Use --force to regenerate.') \n else:\n logging.info(\"Output is outdated, {} < {}\".format(\n datetime.datetime.fromtimestamp(os.path.getmtime(outfile)),\n datetime.datetime.fromtimestamp(os.path.getmtime(path))))\n\n if read_existing:\n with open(outfile, \"rb\") as f:\n geojson = json.load(f)\n properties = geojson['properties']\n else:\n logging.info('Downloading ' + source['url'])\n \n try:\n fp = utils.download(source['url'])\n except IOError:\n logging.error('Failed to download ' + source['url'])\n failures.append(path)\n continue\n \n logging.info('Reading ' + urlfile)\n \n if 'filter' in source:\n filterer = BasicFilterer(source['filter'], source.get('filterOperator', 'and'))\n else:\n filterer = None\n \n try:\n geojson = getattr(adapters, source['filetype'])\\\n .read(fp, source['properties'],\n filterer=filterer,\n layer_name=source.get(\"layerName\", None),\n source_filename=source.get(\"filenameInZip\", None))\n except IOError as e:\n logging.error('Failed to read ' + urlfile + \" \" + str(e))\n failures.append(path)\n continue\n except zipfile.BadZipfile as e:\n logging.error('Unable to open zip file ' + source['url'])\n failures.append(path)\n continue\n finally:\n os.remove(fp.name)\n if(len(geojson['features'])) == 0:\n logging.error(\"Result contained no features for \" + path)\n continue\n excluded_keys = ['filetype', 'url', 'properties', 'filter', 'filenameInZip']\n properties = {k:v for k,v in list(source.items()) if k not in excluded_keys}\n properties['source_url'] = source['url']\n properties['feature_count'] = len(geojson['features'])\n logging.info(\"Generating demo point\")\n properties['demo'] = geoutils.get_demo_point(geojson)\n \n geojson['properties'] = properties\n \n utils.make_sure_path_exists(os.path.dirname(outfile))\n\n #cleanup existing generated files\n if os.path.exists(outdir):\n rmtree(outdir)\n filename_to_match, ext = os.path.splitext(pathparts[-1])\n output_file_dir = os.sep.join(utils.get_path_parts(outfile)[:-1])\n logging.info(\"looking for generated files to delete in \" + output_file_dir)\n for name in os.listdir(output_file_dir):\n base, ext = os.path.splitext(name)\n if base == filename_to_match:\n to_remove = os.path.join(output_file_dir, name)\n logging.info(\"Removing generated file \" + to_remove)\n os.remove(to_remove)\n\n utils.write_json(outfile, geojson)\n\n logging.info(\"Generating label points\")\n label_geojson = geoutils.get_label_points(geojson)\n label_path = outfile.replace('.geojson', '.labels.geojson')\n utils.write_json(label_path, label_geojson)\n\n logging.info('Done. Processed to ' + outfile)\n \n if not \"demo\" in properties:\n properties['demo'] = geoutils.get_demo_point(geojson)\n\n properties['path'] = \"/\".join(pathparts)\n catalog_entry = {\n 'type': 'Feature',\n 'properties': properties,\n 'geometry': geoutils.get_union(geojson)\n }\n catalog_features.append(catalog_entry)\n\n if not os.path.exists(outdir) or not os.path.exists(os.path.join(outdir, \"units.json\")):\n logging.info(\"Generated exploded GeoJSON to \" + outdir)\n if not os.path.exists(outdir):\n os.makedirs(outdir)\n # .json instead of .geojson, incase there is a unit named \"source\"\n utils.write_json(os.path.join(outdir, \"source.json\"), catalog_entry) \n units = []\n for feature in geojson['features']:\n feature_id = str(feature['properties']['id'])\n feature_id = feature_id.replace('/', '')\n feature_filename = os.path.join(outdir, feature_id + \".geojson\")\n utils.write_json(feature_filename, feature)\n units.append(feature['properties'])\n utils.write_json(os.path.join(outdir, \"units.json\"), units)\n else:\n logging.debug(\"exploded GeoJSON already exists, not generating\")\n\n except Exception as e:\n logging.error(str(e))\n logging.exception(\"Error processing file \" + path)\n failures.append(path)\n success = False\n\n catalog = {\n 'type': 'FeatureCollection',\n 'features': catalog_features\n }\n utils.write_json(os.path.join(output,'catalog.geojson'), catalog)\n\n if not success:\n logging.error(\"Failed sources: \" + \", \".join(failures))\n sys.exit(-1)","def post_process():\n for route in os.listdir(GFR_ROUTES_LOCATION):\n if os.path.isfile(MISSING_LOCATION + route):\n # If the route is missing, output the reference data with correct OSM tags.\n\n copyfile(MISSING_LOCATION + route, OUTPUT_LOCATION + route)\n add_property(OUTPUT_LOCATION + route, 'error_type', 'missing')\n elif os.path.isfile(DIFF_MISSING_LOCATION + route) and os.path.isfile(DIFF_WRONG_LOCATION + route) \\\n and merge_differences(route, DIFF_MISSING_LOCATION + route, DIFF_WRONG_LOCATION + route,\n OUTPUT_LOCATION + route):\n # If there's a geometrical difference, combine the two difference files and output it.\n\n add_property(OUTPUT_LOCATION + route, 'error_type', 'difference')\n elif os.path.isfile(TAGS_LOCATION + route):\n # When there's no geometrical difference, output the OSM data possibly containing missing tags.\n\n copyfile(TAGS_LOCATION + route, OUTPUT_LOCATION + route)\n else:\n raise Exception(\"No output file could be generated for route: \" + route)\n\n copy_to_site()\n\n # Export a last updated timestamp\n with open('last_updated', 'w') as fp:\n fp.write(str(int(time.time() * 1000)))","def _merge_image_features(feature_class_type: Type[Union[kapture.Keypoints,\n kapture.Descriptors,\n kapture.GlobalFeatures]],\n feature_type: str,\n features_list: Union[List[Optional[kapture.Keypoints]],\n List[Optional[kapture.Descriptors]],\n List[Optional[kapture.GlobalFeatures]]],\n features_paths: List[str],\n output_path: str,\n tar_handlers: List[TarCollection]\n ) -> Union[kapture.Keypoints, kapture.Descriptors, kapture.GlobalFeatures]:\n assert len(features_list) > 0\n assert len(features_paths) == len(features_list)\n\n # find no none value\n val = [(i, d) for i, d in enumerate(features_list) if d is not None]\n assert len(val) > 0\n\n merged_features = val[0][1]\n for j, (i, features) in enumerate(val):\n assert isinstance(features, feature_class_type)\n assert features.type_name == merged_features.type_name\n assert features.dtype == merged_features.dtype\n assert features.dsize == merged_features.dsize\n if feature_class_type == kapture.Descriptors or feature_class_type == kapture.GlobalFeatures:\n assert not isinstance(features, kapture.Keypoints) # IDE type check help\n assert not isinstance(merged_features, kapture.Keypoints) # IDE type check help\n assert features.metric_type == merged_features.metric_type\n if feature_class_type == kapture.Descriptors:\n assert isinstance(features, kapture.Descriptors) # IDE type check help\n assert isinstance(merged_features, kapture.Descriptors) # IDE type check help\n assert features.keypoints_type == merged_features.keypoints_type\n for name in features:\n if j > 0 and name in merged_features:\n getLogger().warning(f'{name} was found multiple times.')\n else:\n merged_features.add(name)\n if output_path:\n # TODO: uses kapture.io.features_list.get_image_features_dirpath()\n in_path = kapture.io.features.get_features_fullpath(feature_class_type,\n feature_type,\n features_paths[i],\n name,\n tar_handlers[i])\n out_path = kapture.io.features.get_features_fullpath(feature_class_type,\n feature_type,\n output_path,\n name)\n if in_path != out_path:\n # skip actual copy if file does not actually move.\n os.makedirs(os.path.dirname(out_path), exist_ok=True)\n if isinstance(in_path, str):\n shutil.copy(in_path, out_path)\n else:\n # in_path is a tuple [str, TarHandler]\n # keypoints are not stored in a file, have to read them to be able to copy them\n array = in_path[1].get_array_from_tar(in_path[0], features.dtype, features.dsize)\n array_to_file(out_path, array)\n return merged_features","def gtfs_routes(gtfs, output_f):\n\n\t# Load up the stop times so we can find which are the best routes.\n\t#TODO\n\tstop_times_file = [x for x in gtfs.namelist() if 'stop_times' in x][0]\n\n\tstoptimes_c = csv.reader((gtfs.open(stop_times_file, 'r')))\n\theader = stoptimes_c.next()\n\ttrip_id_col = header.index('trip_id')\n\tarrtime_col = header.index('arrival_time')\n\tdeptime_col = header.index('departure_time')\n\tstopseq_col = header.index('stop_sequence')\n\ttrip_times = {}\n\tfor row in stoptimes_c:\n\t\tif row[trip_id_col] not in trip_times:\n\t\t\t# earliest seq, latest seq, earliest seq dep time, latest seq dep time\n\t\t\ttrip_times[row[trip_id_col]] = [None, None, None, None]\n\n\t\tarrtime = time_as_timedelta(row[arrtime_col])\n\t\tdeptime = time_as_timedelta(row[deptime_col])\n\t\tif arrtime is None or deptime is None:\n\t\t\t# bad data, skip!\n\t\t\tcontinue\n\t\tseq = int(row[stopseq_col])\n\n\t\t# Find if this is an earlier item in the sequence\n\t\tif trip_times[row[trip_id_col]][0] is None or trip_times[row[trip_id_col]][0] > seq:\n\t\t\ttrip_times[row[trip_id_col]][0] = seq\n\t\t\ttrip_times[row[trip_id_col]][2] = deptime\n\n\t\t# Find if this is an later item in the sequence\n\t\tif trip_times[row[trip_id_col]][1] is None or trip_times[row[trip_id_col]][1] < seq:\n\t\t\ttrip_times[row[trip_id_col]][1] = seq\n\t\t\ttrip_times[row[trip_id_col]][3] = arrtime\n\n\t# Load the shapes into a map that we can lookup.\n\t# We should do all the geometry processing here so that we only have to do\n\t# this once-off.\n\t#TODO\n\tshapes_file = [x for x in gtfs.namelist() if 'shapes' in x][0]\n\tshapes_c = csv.reader(swallow_windows_unicode(gtfs.open(shapes_file, 'r')))\n\n\theader = shapes_c.next()\n\tshape_id_col = header.index('shape_id')\n\tshape_lat_col = header.index('shape_pt_lat')\n\tshape_lng_col = header.index('shape_pt_lon')\n\tshape_seq_col = header.index('shape_pt_sequence')\n\tshape_dist_col = header.index('shape_dist_traveled') if 'shape_dist_traveled' in header else None\n\n\tshapes = {}\n\tshape_lengths = {}\n\tfor row in shapes_c:\n\t\tif row[shape_id_col] not in shapes:\n\t\t\tshapes[row[shape_id_col]] = {}\n\n\t\tshapes[row[shape_id_col]][int(row[shape_seq_col])] = (Decimal(row[shape_lng_col]), Decimal(row[shape_lat_col]))\n\n\t\t# Calculate length according to GTFS\n\t\t# This could also be calculated by the geometry, but we trust GTFS, right...\n\t\tif shape_dist_col is not None and row[shape_dist_col]:\n\t\t\tlength = Decimal(row[shape_dist_col])\n\t\t\tif row[shape_id_col] not in shape_lengths or shape_lengths[row[shape_id_col]] < length:\n\t\t\t\tshape_lengths[row[shape_id_col]] = length\n\n\t# translate the shapes into a LineString for use by the GeoJSON module\n\tfor shape_id in shapes.iterkeys():\n\t\tshape_keys = shapes[shape_id].keys()\n\t\tshape_keys.sort()\n\t\tshape = []\n\t\tfor ordinal in shape_keys:\n\t\t\tshape.append(shapes[shape_id][ordinal])\n\n\t\tshapes[shape_id] = shape\n\n\t# Make a matching dict between routes and shapes\n\ttrips = {}\n\ttrips_ref = {}\n\troute_time = {}\n\n\t#TODO\n\ttrips_file = [x for x in gtfs.namelist() if 'trips' in x][0]\n\n\ttrips_c = csv.reader(swallow_windows_unicode(gtfs.open(trips_file, 'r')))\n\theader = trips_c.next()\n\troute_id_col = header.index('route_id')\n\tshape_id_col = header.index('shape_id')\n\ttrip_id_col = header.index('trip_id')\n\tfor row in trips_c:\n\t\t# reference count the shapes\n\t\tif row[route_id_col] not in trips_ref:\n\t\t\t# route is unknown, create dict\n\t\t\ttrips_ref[row[route_id_col]] = {}\n\t\t\troute_time[row[route_id_col]] = trip_times[row[trip_id_col]]\n\n\t\tif row[shape_id_col] not in trips_ref[row[route_id_col]]:\n\t\t\t# shape is unknown, create counter\n\t\t\ttrips_ref[row[route_id_col]][row[shape_id_col]] = 0\n\n\t\t# increment counter\n\t\ttrips_ref[row[route_id_col]][row[shape_id_col]] += 1\n\n\t# now we're done, iterate through the reference-counters and find the best\n\t# shape\n\tfor route_id, candidate_shapes in trips_ref.iteritems():\n\t\tpopular_shape, popular_shape_refs = None, 0\n\t\tfor shape_id, refs in candidate_shapes.iteritems():\n\t\t\tif refs > popular_shape_refs:\n\t\t\t\tpopular_shape, popular_shape_refs = shape_id, refs\n\n\t\t# now we should have the route's shape\n\t\tassert popular_shape is not None, 'Couldn\\'t find a shape for route %r' % route_id\n\t\ttrips[route_id] = popular_shape\n\n\t# Cleanup unused variables\n\tdel trip_times\n\n\t# lets setup our output file\n\toutput_layer = geojson.FeatureCollection([])\n\t# assume WGS84 CRS\n\toutput_layer.crs = geojson.crs.Named('urn:ogc:def:crs:OGC:1.3:CRS84')\n\n\t# now we have all the shapes available, translate the routes\n\t#TODO\n\troutes_file = [x for x in gtfs.namelist() if 'routes' in x][0]\n\n\troutes_c = csv.reader(swallow_windows_unicode(gtfs.open(routes_file, 'r')))\n\theader = routes_c.next()\n\troute_id_col = header.index('route_id')\n\n\tfor row in routes_c:\n\t\t# make dict of other properties\n\t\tprops = dict()\n\t\tfor i, h in enumerate(header):\n\t\t\tif row[i] != '':\n\t\t\t\tprops[h] = row[i]\n\n\t\tif row[route_id_col] not in trips:\n\t\t\t# Route has no trips!\n\t\t\tprint \"Warning: route has no trips, skipping: %r\" % (row,)\n\t\t\tcontinue\n\n\t\tprops['shape_id'] = trips[row[route_id_col]]\n\t\tprops['shape_refs'] = trips_ref[row[route_id_col]][props['shape_id']]\n\t\tif shape_dist_col is not None and len(shape_lengths) > 0:\n\t\t\tprops['shape_length'] = shape_lengths[props['shape_id']]\n\t\tprops['duration_sec'] = (route_time[row[route_id_col]][3] - route_time[row[route_id_col]][2]).total_seconds()\n\n\t\toutput_layer.features.append(geojson.Feature(\n\t\t\tgeometry=geojson.LineString(\n\t\t\t\tcoordinates=shapes[trips[row[route_id_col]]]\n\t\t\t),\n\t\t\tproperties=props,\n\t\t\tid=row[route_id_col]\n\t\t))\n\n\t# now flush the GeoJSON layer to a file.\n\tgeojson.dump(output_layer, output_f, cls=DecimalEncoder)","def mergeGeometries(self):\n self.geometry = reduce(lambda p1,p2 : p1.union(p2) ,map(lambda tax : tax.biomeGeometry,self.taxonomies))\n return self.geometry","def process_detail_pages(self):\r\n n_pools = os.cpu_count() // 2\r\n with Pool(n_pools) as pool:\r\n result = pool.map(scrape_detail_page, self.base_features_list)\r\n pool.close()\r\n pool.join()\r\n\r\n self.all_features_list = result","def add_building_output_locations2(self,areasList,start,end,step): \n print \"Getting buildings locations...\"\n \n dictionaries = []\n dictionary = {}\n \n for a in areasList:\n \n dictionaries.append(self.grid.get_building_output_locations(a[0],a[1]))\n \n for dict in dictionaries:\n for row in dict.iteritems(): \n dictionary[row[0]] = row[1] \n\n print \"Number of buildings = %s\" % (len(dictionary))\n\n if (dictionary != {}):\n self.run_nc.add_building_output_locations(dictionary, start, end,step)","def __feature_set__(self):\r\n import numpy as np\r\n import datetime\r\n import time\r\n cols_norm = [col for col in self.columns]\r\n cols_lower = [col.lower() for col in self.columns]\r\n fields = []\r\n features = []\r\n date_fields = []\r\n _geom_types = {\r\n arcgis.geometry._types.Point : \"esriGeometryPoint\",\r\n arcgis.geometry._types.Polyline : \"esriGeometryPolyline\",\r\n arcgis.geometry._types.MultiPoint : \"esriGeometryMultipoint\",\r\n arcgis.geometry._types.Polygon : \"esriGeometryPolygon\"\r\n }\r\n if self.sr is None:\r\n sr = {'wkid' : 4326}\r\n else:\r\n sr = self.sr\r\n fs = {\r\n \"objectIdFieldName\" : \"\",\r\n \"globalIdFieldName\" : \"\",\r\n \"displayFieldName\" : \"\",\r\n \"geometryType\" : _geom_types[type(self.geometry[self.geometry.first_valid_index()])],\r\n \"spatialReference\" : sr,\r\n \"fields\" : [],\r\n \"features\" : []\r\n }\r\n if 'objectid' in cols_lower:\r\n fs['objectIdFieldName'] = cols_norm[cols_lower.index('objectid')]\r\n fs['displayFieldName'] = cols_norm[cols_lower.index('objectid')]\r\n elif 'fid' in cols_lower:\r\n fs['objectIdFieldName'] = cols_norm[cols_lower.index('fid')]\r\n fs['displayFieldName'] = cols_norm[cols_lower.index('fid')]\r\n elif 'oid' in cols_lower:\r\n fs['objectIdFieldName'] = cols_norm[cols_lower.index('oid')]\r\n fs['displayFieldName'] = cols_norm[cols_lower.index('oid')]\r\n else:\r\n self['OBJECTID'] = list(range(1, self.shape[0] + 1))\r\n res = self.__feature_set__\r\n del self['OBJECTID']\r\n return res\r\n if 'objectIdFieldName' in fs:\r\n fields.append({\r\n \"name\" : fs['objectIdFieldName'],\r\n \"type\" : \"esriFieldTypeOID\",\r\n \"alias\" : fs['objectIdFieldName']\r\n })\r\n cols_norm.pop(cols_norm.index(fs['objectIdFieldName']))\r\n if 'globalIdFieldName' in fs and len(fs['globalIdFieldName']) > 0:\r\n fields.append({\r\n \"name\" : fs['globalIdFieldName'],\r\n \"type\" : \"esriFieldTypeGlobalID\",\r\n \"alias\" : fs['globalIdFieldName']\r\n })\r\n cols_norm.pop(cols_norm.index(fs['globalIdFieldName']))\r\n elif 'globalIdFieldName' in fs and \\\r\n len(fs['globalIdFieldName']) == 0:\r\n del fs['globalIdFieldName']\r\n if self._geometry_column_name in cols_norm:\r\n cols_norm.pop(cols_norm.index(self._geometry_column_name))\r\n for col in cols_norm:\r\n try:\r\n idx = self[col].first_valid_index()\r\n col_val = self[col].loc[idx]\r\n except:\r\n col_val = \"\"\r\n if isinstance(col_val, (str, np.str)):\r\n l = self[col].str.len().max()\r\n if str(l) == 'nan':\r\n l = 255\r\n\r\n fields.append({\r\n \"name\" : col,\r\n \"type\" : \"esriFieldTypeString\",\r\n \"length\" : int(l),\r\n \"alias\" : col\r\n })\r\n if fs['displayFieldName'] == \"\":\r\n fs['displayFieldName'] = col\r\n elif isinstance(col_val, (datetime.datetime,\r\n pd.Timestamp,\r\n np.datetime64,\r\n pd.datetime)):\r\n fields.append({\r\n \"name\" : col,\r\n \"type\" : \"esriFieldTypeDate\",\r\n \"alias\" : col\r\n })\r\n date_fields.append(col)\r\n elif isinstance(col_val, (np.int32, np.int16, np.int8)):\r\n fields.append({\r\n \"name\" : col,\r\n \"type\" : \"esriFieldTypeSmallInteger\",\r\n \"alias\" : col\r\n })\r\n elif isinstance(col_val, (int, np.int, np.int64)):\r\n fields.append({\r\n \"name\" : col,\r\n \"type\" : \"esriFieldTypeInteger\",\r\n \"alias\" : col\r\n })\r\n elif isinstance(col_val, (float, np.float64)):\r\n fields.append({\r\n \"name\" : col,\r\n \"type\" : \"esriFieldTypeDouble\",\r\n \"alias\" : col\r\n })\r\n elif isinstance(col_val, (np.float32)):\r\n fields.append({\r\n \"name\" : col,\r\n \"type\" : \"esriFieldTypeSingle\",\r\n \"alias\" : col\r\n })\r\n fs['fields'] = fields\r\n for row in self.to_dict('records'):\r\n geom = {}\r\n if self._geometry_column_name in row:\r\n geom = row[self._geometry_column_name]\r\n del row[self._geometry_column_name]\r\n for f in date_fields:\r\n try:\r\n row[f] = int(row[f].to_pydatetime().timestamp() * 1000)\r\n except:\r\n row[f] = None\r\n features.append(\r\n {\r\n \"geometry\" : dict(geom),\r\n \"attributes\" : row\r\n }\r\n )\r\n del row\r\n del geom\r\n fs['features'] = features\r\n return fs","def add_route_to_map(gdf_best_route: gpd.GeoDataFrame, basemap):\n #create a list of colors\n colors = ['orange', 'darkred', 'darkblue', 'purple', 'darkgreen', '#364e4a', 'cadetblues']\n \n # make a feature group for every route\n # merge them to a feature group\n for i, row in gdf_best_route.iterrows():\n fg = folium.FeatureGroup(f\"Route {row['order']} from {row['start_city']} to {row['end_city']}\")\n # add the simple route\n fg.add_child(folium.PolyLine(\n locations=row[\"folium_geom\"], \n popup=f\"From {row['start_city']} to {row['end_city']}\",\n tooltip=f\"Route {row['order']}\",\n color=colors[i], \n dash_array='10',\n weight=4))\n basemap.add_child(fg)\n \n return None","def close(self): \n \n# web_pdb.set_trace()\n # Process all the features\n for feature in self.meta_features:\n self.mapping_errors = [] # Reset the list that contains the errors\n # Extract attribute value to process\n att_2_map=feature.getAttribute('att_2_map')\n \n # Extract the status of the published parameters (passed through attributes)\n bool_english_refresh = FME_utils.test_attribute_value(feature, ENGLISH_REFRESH, YES, False)\n bool_french_refresh = FME_utils.test_attribute_value(feature, FRENCH_REFRESH, YES, False)\n bool_code_refresh = FME_utils.test_attribute_value(feature, CODE_REFRESH, YES, False)\n bool_error_not_mapped = FME_utils.test_attribute_value(feature, ERROR_NOT_MAPPED, YES, False)\n \n # Extract the attributes name to process. Can be a list or a single attribute\n index_attributes = FME_utils.extract_attribute_list(feature, att_2_map)\n \n if index_attributes:\n # Loop over the attributes\n for index, att_name in index_attributes:\n # Extract the attribute to process\n att_value = FME_utils.feature_get_attribute(feature, att_name, False)\n att_value = att_value.lower().rstrip(\" \").lstrip(\" \")\n \n # Extract the row from CSV dictionary\n try:\n csv_row = self.csv_features[att_value]\n # Map the value according to the requirements\n if bool_english_refresh:\n feature.setAttribute(att_name, csv_row.value_english)\n if bool_french_refresh:\n feature.setAttribute(att_name+\"_fr\", csv_row.value_french)\n if bool_code_refresh:\n feature.setAttribute(att_name+\"_code\", csv_row.code_value)\n except KeyError:\n # Value not found in the dictionary. Add the error in the list\n str_error = (\"Unable to map value: {0} for attribute: {1}.\".format(att_value,att_name))\n self.mapping_errors.append(str_error)\n else:\n # The requested attribute is not found\n str_error = ('The requested attribute to map (ATT_TO_MAP): {} is not present on the FME feature.'.format(att_2_map))\n self.mapping_errors.append(str_error)\n \n # Append the errors in the FME error attribute\n if bool_error_not_mapped:\n # Mapping errors are registered in FME attribute\n if self.mapping_errors:\n # Extract the number of existing error\n err_count = FME_utils.max_index_attribute_list(feature, \"mapping_errors{}.error\")\n err_count += 1\n for i, mapping_error in enumerate(self.mapping_errors):\n # Append the error to the existing list of error\n feature.setAttribute(\"mapping_errors{%d}.error\"%(i+err_count), mapping_error)\n else:\n # Mapping error list empty ===> Nothing to do\n pass\n else:\n # Mapping error are not registered in FME attribute\n pass\n \n # Output the feature to FME after processing all the attributes\n self.pyoutput(feature)\n \n return","def processAlgorithm(self, parameters, context, feedback):\r\n\r\n # Retrieve the feature source and sink. The 'dest_id' variable is used\r\n # to uniquely identify the feature sink, and must be included in the\r\n # dictionary returned by the processAlgorithm function.\r\n source = self.parameterAsSource(\r\n parameters,\r\n self.INPUT,\r\n context\r\n )\r\n source = self.parameterAsSource(\r\n parameters,\r\n self.INPUTBUFFER,\r\n context\r\n )\r\n source = self.parameterAsSource(\r\n parameters,\r\n self.INPUT2,\r\n context\r\n )\r\n source = self.parameterAsSource(\r\n parameters,\r\n self.INPUT3,\r\n context\r\n )\r\n source = self.parameterAsSource(\r\n parameters,\r\n self.INPUT4,\r\n context\r\n )\r\n source = self.parameterAsSource(\r\n parameters,\r\n self.INPUTSIZE,\r\n context\r\n )\r\n \r\n \r\n \r\n \r\n \r\n ## Obtain filepath from selected address layer, could not extend this functionality to work for actual layer inputs,\r\n ## resulted in instant crash if using the filePathFile, or 'INPUT1-4' as input for processing tools\r\n filePathFile = self.parameterDefinition('INPUT').valueAsPythonString(parameters['INPUT'], context)\r\n in_path = os.path.dirname(filePathFile[1:]) + '/'\r\n out_path = in_path \r\n \r\n \r\n bufferdist = self.parameterAsDouble(parameters, self.INPUTBUFFER,\r\n context)\r\n \r\n sigsize = self.parameterAsDouble(parameters, self.INPUTSIZE,\r\n context)\r\n \r\n\r\n ## Defining filepaths and filenames\r\n #############################################################################\r\n ## NEED TO BE MANUALLY DEFINED BY USER IF USING FILES WITH DIFFERENT NAMES ##\r\n #############################################################################\r\n ##Script set up for test 20 address file\r\n \r\n addressFile = \"AddressesTest.shp\"\r\n\r\n ## Uncomment below line for use with full address file (NOTE: SCRIPT WILL NOT COMPLETE DUE TO DATASET SIZE)\r\n ## addressFile = \"Addresses.shp\"\r\n\r\n ## Uses original parkland file as no geometry issues using zonal method\r\n parklandFile = \"Parkland2.shp\"\r\n \r\n hospitalFile = \"Hospitals.shp\"\r\n groceryFile = \"Grocery.shp\"\r\n \r\n \r\n ##############################################################################\r\n ##############################################################################\r\n #############################################################################\r\n\r\n ## Add address layer to view\r\n addressLayer = iface.addVectorLayer(in_path + addressFile, addressFile[:-4], 'ogr')\r\n\r\n ## Define parameter dictionary, and run buffer tool\r\n ## Output result to /Output/ folder\r\n bufferDict = {\r\n 'INPUT': addressLayer, \r\n 'DISTANCE': bufferdist, \r\n 'SEGMENTS': 10, \r\n 'ENDCAPSTYLE': 0, \r\n 'JOIN_STYLE':0,\r\n 'MITER_LIMIT':2,\r\n 'DISSOLVE_RESULT': False, \r\n 'OUTPUT': (out_path + 'buffer_' + addressFile)\r\n }\r\n processing.run('native:buffer', bufferDict)\r\n \r\n ## Define filename of buffered file\r\n bufferedFile = ('buffer_' + addressFile) \r\n\r\n ## Load buffered layer and hopsital layer to view\r\n bufferedLayer = iface.addVectorLayer(out_path + bufferedFile, bufferedFile[:-4], 'ogr') \r\n hospitalLayer = iface.addVectorLayer(in_path + hospitalFile, hospitalFile[:-4], 'ogr')\r\n\r\n ## Define parameter dictionary, and run count points in polygons tool\r\n ## Output result to /Output/ folder\r\n HcountDict = {\r\n 'CLASSFIELD' : '', \r\n 'FIELD' : 'Hcount', \r\n 'OUTPUT' : out_path + 'bufferHcount.shp', \r\n 'POINTS' : hospitalLayer, \r\n 'POLYGONS' : bufferedLayer, \r\n 'WEIGHT' : ''\r\n } \r\n processing.run('native:countpointsinpolygon', HcountDict)\r\n\r\n\r\n ## Define filename of buffers w/ hospital count, add layer to view\r\n HcountFile = 'bufferHcount.shp'\r\n HcountLayer = iface.addVectorLayer(out_path + HcountFile, HcountFile[:-4], 'ogr')\r\n\r\n ## Add grocery store layer to view\r\n groceryLayer = iface.addVectorLayer(in_path + groceryFile, groceryFile[:-4], 'ogr')\r\n\r\n ## Define parameter dictionary, and run points in polygons tool\r\n ## Output result to /Output/ folder\r\n GcountDict = {\r\n 'CLASSFIELD' : '', \r\n 'FIELD' : 'Gcount', \r\n 'OUTPUT' : out_path + 'bufferHGcount.shp', \r\n 'POINTS' : groceryLayer, \r\n 'POLYGONS' : HcountLayer, \r\n 'WEIGHT' : ''\r\n } \r\n processing.run('native:countpointsinpolygon', GcountDict)\r\n\r\n ## Define filename of buffers with hospital and store counts, and add layer to view \r\n HGcountFile = 'bufferHGcount.shp'\r\n HGcountLayer = iface.addVectorLayer(out_path + HGcountFile, HGcountFile[:-4], 'ogr')\r\n\r\n ## Add parkland layer to view\r\n parklandLayer = iface.addVectorLayer(in_path + parklandFile, parklandFile[:-4], 'ogr')\r\n\r\n ## Define parameter dictionary, and run buffer tool\r\n ## Output result to /Output/ folder\r\n parkbufferDict = {\r\n 'INPUT': parklandLayer, \r\n 'DISTANCE': 20, \r\n 'SEGMENTS': 10, \r\n 'ENDCAPSTYLE': 0, \r\n 'JOIN_STYLE':0,\r\n 'MITER_LIMIT':2,\r\n 'DISSOLVE_RESULT': True, \r\n 'OUTPUT': (out_path + 'buffer_' + parklandFile)\r\n }\r\n processing.run('native:buffer', parkbufferDict)\r\n\r\n ## Define filename of buffered dissolved parkland, add layer to view\r\n parkBufferFile = 'buffer_' + parklandFile\r\n parkBufferLayer = iface.addVectorLayer(out_path + parkBufferFile, parkBufferFile[:-4], 'ogr')\r\n\r\n ## Define parameter dictionary, and run negative buffer tool\r\n ## Output result to /Output/ folder \r\n parkNegbufferDict = {\r\n 'INPUT': parkBufferLayer, \r\n 'DISTANCE': -20, \r\n 'SEGMENTS': 10, \r\n 'ENDCAPSTYLE': 0, \r\n 'JOIN_STYLE':0,\r\n 'MITER_LIMIT':2,\r\n 'DISSOLVE_RESULT': False, \r\n 'OUTPUT': (out_path + 'dissolve_' + parklandFile)\r\n }\r\n processing.run('native:buffer', parkNegbufferDict)\r\n\r\n ## Define filename of de-buffered dissolved parkland, add layer to view\r\n parkDissolveFile = 'dissolve_' + parklandFile\r\n parkDissolveLayer = iface.addVectorLayer(out_path + parkDissolveFile, parkDissolveFile[:-4], 'ogr')\r\n\r\n ## Loop through the features in the de-buffered parkland layer, define parameter dictionary, and run multipart to singlepart tool\r\n ## Output result to /Output/ folder\r\n multiDict = { \r\n 'INPUT' : parkDissolveLayer, \r\n 'OUTPUT' : out_path + 'final_' + parklandFile\r\n }\r\n processing.run('native:multiparttosingleparts', multiDict)\r\n \r\n ## Define filename of de-buffered dissolved parkland, add layer to view\r\n finalParkFile = 'final_' + parklandFile\r\n finalParkLayer = iface.addVectorLayer(out_path + finalParkFile, finalParkFile[:-4], 'ogr')\r\n\r\n ## Define parameter dictionary, and run add geometry columns tool\r\n ## Output result to /Output/ folder\r\n geomDict = { \r\n 'CALC_METHOD' : 0, \r\n 'INPUT' : finalParkLayer, \r\n 'OUTPUT' : out_path + 'geom_'+ parklandFile\r\n }\r\n processing.run('qgis:exportaddgeometrycolumns', geomDict)\r\n\r\n ## Define filename of parkland w/ geometry, add layer to view\r\n parkGeomFile = 'geom_'+ parklandFile\r\n parkGeomLayer = iface.addVectorLayer(out_path + parkGeomFile, parkGeomFile[:-4], 'ogr')\r\n\r\n ## Define parameter dictionary, and run extract by attribute tool\r\n ## Output result to /Output/ folder\r\n extractDict = { \r\n 'FIELD' : 'area', \r\n 'INPUT' : out_path + parkGeomFile, \r\n 'OPERATOR' : 3, \r\n 'OUTPUT' : out_path + 'extract_'+ parklandFile, \r\n 'VALUE' : sigsize \r\n }\r\n processing.run('native:extractbyattribute', extractDict)\r\n \r\n ## Define extracted \"significant\" parkland filename, and add layer to view\r\n parkExtractFile = 'extract_'+ parklandFile\r\n parkExtractLayer = iface.addVectorLayer(out_path + parkExtractFile, parkExtractFile[:-4], 'ogr')\r\n\r\n extentDict = { \r\n 'INPUT' : out_path+parkExtractFile, \r\n 'OUTPUT' : out_path+'extent.shp', \r\n 'ROUND_TO' : 0 \r\n }\r\n processing.run('native:polygonfromlayerextent', extentDict)\r\n\r\n extentFile = out_path+'extent.shp'\r\n extentLayer = iface.addVectorLayer(extentFile, extentFile[:-4], 'ogr')\r\n extent = extentLayer.getFeatures()\r\n for feature in extent:\r\n extentAttributes = feature.attributes()\r\n extentString = str(str(extentAttributes[0])+','+str(extentAttributes[2])+','+str(extentAttributes[1])+','+str(extentAttributes[3])+'['+str(extentLayer.crs().authid())+']') \r\n print(extentString)\r\n\r\n rasterizeDict = {\r\n 'BURN' : 1, \r\n 'DATA_TYPE' : 5, \r\n 'EXTENT' : extentString, \r\n 'EXTRA' : '', \r\n 'FIELD' : '', \r\n 'HEIGHT' : 5000, \r\n 'INIT' : None, \r\n 'INPUT' : parkExtractLayer, \r\n 'INVERT' : False, \r\n 'NODATA' : 0, \r\n 'OPTIONS' : '', \r\n 'OUTPUT' : out_path+'Raster.tif', \r\n 'UNITS' : 0, \r\n 'WIDTH' : 5000\r\n }\r\n processing.run('gdal:rasterize', rasterizeDict)\r\n\r\n rasterFile = out_path+'Raster.tif'\r\n\r\n ## Define parameter dictionary, and run clip tool with extracted parkland layer as overlay on address buffers\r\n ## Output result to /Output/ folder\r\n zonalDict = { \r\n 'COLUMN_PREFIX' : 'Z_',\r\n 'INPUT_VECTOR' : out_path + HGcountFile,\r\n 'INPUT_RASTER' : rasterFile, \r\n 'OUTPUT' : out_path+'zonal_'+addressFile, \r\n 'RASTER_BAND' : 1 \r\n }\r\n processing.run('native:zonalhistogram', zonalDict)\r\n\r\n ## Define filename of clipped buffer layer, add layer to view\r\n zonalFile = 'zonal_'+ addressFile\r\n zonalLayer = iface.addVectorLayer(out_path + zonalFile, zonalFile[:-4], 'ogr')\r\n\r\n\r\n ## Create QgsdataProvider object, used for updating data fields in clipped buffers w/ geometry layer\r\n zonal_provider = zonalLayer.dataProvider()\r\n\r\n ## Use QgsdataProvider.addAttributes method to add empty QgsField objects corresponding to the normalised scores, and liveability score\r\n ## to the geomLayer file, QVariant.Double method used to create fields of data type \"double\"\r\n zonal_provider.addAttributes([QgsField('HospNorm',QVariant.Double)])\r\n zonal_provider.addAttributes([QgsField('GrocNorm',QVariant.Double)])\r\n zonal_provider.addAttributes([QgsField('ParkNorm',QVariant.Double)])\r\n zonal_provider.addAttributes([QgsField('LiveScore',QVariant.Double)])\r\n\r\n ## Update these new data fields and commit changes\r\n zonalLayer.updateFields()\r\n zonalLayer.commitChanges\r\n\r\n ## Define indexes for each count and area value in the geomLayer. This is to be able to easily obtain max value for each field, for normalisation equation\r\n hospIndex = zonalLayer.fields().indexFromName('Hcount')\r\n grocIndex = zonalLayer.fields().indexFromName('Gcount')\r\n parkIndex = zonalLayer.fields().indexFromName('Z_1')\r\n\r\n ## Get features of geomLayer for subsequent loop\r\n zonalAddresses = zonalLayer.getFeatures()\r\n\r\n ## Using a for loop, update the previously created fields with normalised scores, and lockdown liveability score\r\n ## This is done mathematically using each features value and the max value for that field\r\n for address in zonalAddresses:\r\n \r\n zonalLayer.startEditing()\r\n try: \r\n address['HospNorm'] = address['Hcount']/(zonalLayer.maximumValue(hospIndex))\r\n except:\r\n address['HospNorm'] = 0\r\n try:\r\n address['GrocNorm'] = address['Gcount']/(zonalLayer.maximumValue(grocIndex))\r\n except:\r\n address['GrocNorm'] = 0\r\n try:\r\n address['ParkNorm'] = address['Z_1']/(zonalLayer.maximumValue(parkIndex))\r\n except:\r\n address['ParkNorm'] = 0\r\n address['LiveScore'] = (address['HospNorm']+address['GrocNorm']+address['ParkNorm'])/3\r\n \r\n zonalLayer.updateFeature(address)\r\n\r\n ## Commit changes to data fields\r\n zonalLayer.commitChanges\r\n\r\n ## Define parameter dictionary, and run join tool to join final attributes back to original layer\r\n ## Output result to /Output/ folder\r\n joinDict = { \r\n 'INPUT' : in_path + addressFile,\r\n 'FIELD' : 'PFI',\r\n 'INPUT_2' : out_path + zonalFile,\r\n 'FIELD_2' : 'PFI', \r\n 'FIELDS_TO_COPY' : ['Hcount','Gcount','area','HospNorm','GrocNorm','ParkNorm','LiveScore'],\r\n 'METHOD' : 1, \r\n 'DISCARD_NONMATCHING' : False,\r\n 'PREFIX' : '',\r\n 'OUTPUT' : out_path+'final_'+ addressFile, \r\n 'NON_MATCHING': out_path+'nonmatching.shp'\r\n }\r\n processing.run('native:joinattributestable', joinDict)\r\n \r\n ## Define filename of final layer, and add final layer to view \r\n finalFile = 'final_'+ addressFile\r\n finalLayer = iface.addVectorLayer(out_path + finalFile, finalFile[:-4], 'ogr')\r\n\r\n\r\n\r\n return {}","def combine_features(feature1, feature2):\n new_feature = Feature()\n new_feature.coord = feature1.coord.copy()\n for x in feature2.coord:\n new_feature.coord.append(x)\n return new_feature","def execute(self, parameters, messages):\r\n arcpy.AddMessage(\"\\nPerforming overall merge...\")\r\n logging.info(\"Starting mergeAreas.py script...\\n\")\r\n # Define variables from parameters\r\n overlapWorkspace = parameters[0].valueAsText\r\n gdbWorkspace = parameters[1].valueAsText\r\n featWorkspace = parameters[2].valueAsText\r\n\r\n # Determine list of total overlap, no overlap and to merge feature classes in overlap feature dataset workspace to process.\r\n arcpy.env.workspace = overlapWorkspace\r\n mergeList = arcpy.ListFeatureClasses(\"*_toMerge\")\r\n totalOverlapList = arcpy.ListFeatureClasses(\"*_TotalOverlap\")\r\n noOverlapList = arcpy.ListFeatureClasses(\"*_noOverlap\")\r\n if len(mergeList) > 0:\r\n arcpy.AddMessage(\"Workspace contains the following \" + str(len(mergeList)) + \" feature classes to merge: \" + str(mergeList))\r\n\r\n # Organize toMerge feature classes by date\r\n mergeDictbyDate = {}\r\n for fc in mergeList:\r\n fcPath = os.path.join(overlapWorkspace, fc)\r\n fcDate = fc.split(\"_\")[1]\r\n mergeDictbyDate[fcDate] = [fcPath]\r\n\r\n # Append no overlap feature classes toMerge feature classes by date\r\n for noOverlapFc in noOverlapList:\r\n noOverlapPath = os.path.join(overlapWorkspace, noOverlapFc)\r\n noOverlapDate = noOverlapFc.split(\"_\")[1]\r\n mergeDictbyDate[noOverlapDate].append(noOverlapPath)\r\n\r\n # Organize dark targets feature classes by date\r\n arcpy.env.workspace = featWorkspace\r\n fcList = arcpy.ListFeatureClasses()\r\n fcDictByDate = {}\r\n for fc in fcList:\r\n fcPath = os.path.join(featWorkspace, fc)\r\n fcSplit = fc.split(\"_\")\r\n if fcSplit[1] in fcDictByDate:\r\n fcDictByDate[fcSplit[1]].append(fcPath)\r\n else:\r\n fcDictByDate[fcSplit[1]] = [fcPath]\r\n\r\n # Iterate through dark targets acquisition dates and check for acquisition dates with more than a single feature class (for merging)\r\n for key in fcDictByDate:\r\n if len(fcDictByDate[key]) > 1:\r\n\r\n # Iterate through feature classes within acquisition date\r\n for fc in fcDictByDate[key]:\r\n fcSplit = fc.split(\"_\")\r\n\r\n # Check for and add acquisition date toMerge feature classes if not already present\r\n if fcSplit[len(fcSplit)-2] not in mergeDictbyDate:\r\n mergeDictbyDate[fcSplit[len(fcSplit)-2]] = [fc]\r\n\r\n # Check for and add feature class toMerge feature classes if not already present within acquisition date\r\n else:\r\n fcValue = fc.split(\"\\\\\")[len(fc.split(\"\\\\\"))-1] + \"_noOverlap\"\r\n fcValuePath = os.path.join(overlapWorkspace, fcValue)\r\n if fcValuePath not in mergeDictbyDate[key]:\r\n mergeDictbyDate[key].append(fc)\r\n\r\n # Iterate through dark targets acquisition dates to compile lists of feature classes to merge\r\n for key in mergeDictbyDate:\r\n arcpy.AddMessage(\"\\nMerging feature classes in \" + key + \"...\")\r\n logging.info(\"Processing merges for acquisition date '%s'\", key)\r\n mergeList = []\r\n\r\n # Iterate through feature classes within acquisition date and append them to merge list\r\n for item in mergeDictbyDate[key]:\r\n mergeList.append(item)\r\n\r\n # Merge feature classes in merge list into single feature class for the acquisition date\r\n outputDissolveString = \"RS2_\" + key + \"_toDissolve\"\r\n outputDissolve = os.path.join(overlapWorkspace, outputDissolveString)\r\n arcpy.Merge_management(mergeList, outputDissolve)\r\n logging.info(\"Merge: '%s' created from merging the following feature classes: '%s'\", outputDissolve, str(mergeList))\r\n\r\n # Dissolve attribute duplicates and rename fields\r\n arcpy.AddMessage(\"Dissolving...\")\r\n dissolveLyr = \"dissolveLyr\"\r\n outputMergeString = \"RS2_\" + key + \"_merged\"\r\n outputMerge = os.path.join(gdbWorkspace, outputMergeString)\r\n dissolveFields = [\"Pid\", \"RsatID\"]\r\n fieldList = arcpy.ListFields(outputDissolve)\r\n statsFields = []\r\n for field in fieldList:\r\n if \"OBJECTID\" in field.name or \"FID\" in field.name or \"Shape\" in field.name or field.name in dissolveFields or field.name == \"ID\":\r\n continue\r\n statsField = [field.name,\"FIRST\"]\r\n statsFields.append(statsField)\r\n arcpy.MakeFeatureLayer_management(outputDissolve, dissolveLyr)\r\n logging.info(\"Make Feature Layer: '%s' layer created from '%s' feature class\", dissolveLyr, outputDissolve)\r\n arcpy.Dissolve_management(dissolveLyr, outputMerge, dissolveFields, statsFields)\r\n logging.info(\"Dissolve: '%s' feature class created from '%s' layer dissolve\", outputMerge, dissolveLyr)\r\n fieldList = arcpy.ListFields(outputMerge)\r\n for field in fieldList:\r\n if field.name.startswith(\"FIRST_\"):\r\n newName = field.name[6:]\r\n arcpy.AlterField_management(outputMerge, field.name, newName)\r\n\r\n # Update targetID with combined target ID for overlapping features\r\n arcpy.AddMessage(\"Updating targetID...\")\r\n finalOutputString = \"RS2_\" + key\r\n overlapBool = False\r\n\r\n # Iterate through total overlap feature classes\r\n for fc in totalOverlapList:\r\n\r\n # Check for merged acquisition date feature class containing overlapping features (by finding equivalent total overlap feature class)\r\n if finalOutputString == fc.strip(\"_TotalOverlap\"):\r\n overlapBool = True\r\n\r\n # Perform spatial join to access targetID field from total overlap feature class\r\n totalOverlapFc = os.path.join(overlapWorkspace, fc)\r\n finalOutput = os.path.join(gdbWorkspace, finalOutputString)\r\n fieldmappings = arcpy.FieldMappings()\r\n fieldmappings.addTable(outputMerge)\r\n fldmap_TARGETID = arcpy.FieldMap()\r\n fldmap_TARGETID.addInputField(totalOverlapFc, \"targetID\")\r\n fld_TARGETID = fldmap_TARGETID.outputField\r\n fld_TARGETID.name = \"targetID_1\"\r\n fldmap_TARGETID.outputField = fld_TARGETID\r\n fieldmappings.addFieldMap(fldmap_TARGETID)\r\n arcpy.SpatialJoin_analysis(outputMerge, totalOverlapFc, finalOutput, \"#\", \"#\", fieldmappings)\r\n logging.info(\"Spatial Join: '%s' feature class created by joining '%s' with '%s'\", finalOutput, outputMerge, totalOverlapFc)\r\n\r\n # Update targetID with combined targetID determined from total overlap feature class\r\n expression = \"copyTargetID(!targetID!, !targetID_1!)\"\r\n codeblock = \"\"\"def copyTargetID(targetID, comb_targetID):\r\n if comb_targetID is None:\r\n return targetID\r\n else:\r\n return comb_targetID\"\"\"\r\n arcpy.CalculateField_management(finalOutput, \"targetID\", expression, \"PYTHON_9.3\", codeblock)\r\n logging.info(\"Calculate Field: 'targetID' field value calculated for '%s' feature class\", finalOutput)\r\n\r\n # Delete extraneous fields\r\n arcpy.DeleteField_management(finalOutput, \"targetID_1\")\r\n arcpy.DeleteField_management(finalOutput, \"Join_Count\")\r\n arcpy.DeleteField_management(finalOutput, \"TARGET_FID\")\r\n\r\n # Rename merged acquisition date feature class to appropriate name if it does not contain overlapping targets\r\n if overlapBool is False:\r\n arcpy.Rename_management(outputMerge, finalOutputString)\r\n logging.info(\"Rename: '%s' feature class renamed to '%s'\", outputMerge, finalOutputString)\r\n\r\n # Delete unneeded process outputs (dissolve and merge outputs)\r\n arcpy.Delete_management(outputDissolve)\r\n logging.info(\"Delete: '%s' feature class deleted\", outputDissolve)\r\n if arcpy.Exists(outputMerge):\r\n arcpy.Delete_management(outputMerge)\r\n logging.info(\"Delete: '%s' feature class deleted\", outputMerge)\r\n\r\n logging.info(\"Processing for merges for acquisition date '%s' complete\\n\", key)\r\n\r\n # Iterate through dark targets acquisition dates to export single feature classes\r\n arcpy.AddMessage(\"\\nExporting single feature classes...\")\r\n logging.info(\"Processing single feature classes to export\")\r\n for key in fcDictByDate:\r\n if len(fcDictByDate[key]) == 1:\r\n for fc in fcList:\r\n fcSplit = fc.split(\"_\")\r\n if fcSplit[1] in mergeDictbyDate:\r\n continue\r\n else:\r\n outputFeatureName = \"RS2_\" + fcSplit[1]\r\n arcpy.FeatureClassToFeatureClass_conversion(fc, gdbWorkspace, outputFeatureName, \"#\", \"#\", )\r\n logging.info(\"Feature Class to Feature Class: '%s' feature class converted to '%s'\", fc, outputFeatureName)\r\n outputFeatPath = os.path.join(gdbWorkspace, outputFeatureName)\r\n arcpy.DeleteField_management(outputFeatPath, \"FID\")\r\n logging.info(\"Processing of single feature classes to export complete\")\r\n\r\n logging.info(\"mergeAreas.py script finished\\n\\n\")\r\n\r\n return","def fdr_control(self, output_features):\n # Map output feature names\n output_feature_map = {output_feature.name: output_feature for output_feature in output_features}\n # Update saved hierarchy with FDR-controlled results\n queue = deque()\n root = self.features[0].root\n queue.append(root)\n while queue:\n parent = queue.popleft()\n if not parent.children:\n continue\n pvalues = np.ones(len(parent.children))\n for idx, child in enumerate(parent.children):\n child.copy_attributes(output_feature_map[child.name])\n pvalues[idx] = child.overall_pvalue\n adjusted_pvalues, rejected_hypotheses = bh_procedure(pvalues, self.args.importance_significance_level)\n for idx, child in enumerate(parent.children):\n child.overall_pvalue = adjusted_pvalues[idx]\n child.important = rejected_hypotheses[idx]\n if child.important:\n queue.append(child)\n else:\n child.window_important = False\n child.ordering_important = False\n child.window_ordering_important = False","def derive_features(self):\n\n temp = int(self.stop_id)\n\n while temp not in self.stops_latlon.keys():\n if temp < 7692:\n temp += 1\n else:\n while temp not in self.stops_latlon.keys():\n temp -= 1\n\n self.latitude = self.stops_latlon[temp][0]\n self.longitude = self.stops_latlon[temp][1]\n\n self.distance_centre = FormatInput.haversine(self.latitude, self.longitude)\n\n self.cluster = FormatInput.map_stop_to_cluster(self.cluster_map, self.stop_id)\n\n self.holiday = FormatInput.add_holiday(self.date)","def _insert_stops_many_to_many(self):\r\n # Store data of the relevant origins and destinations in dictionaries for quick lookups and reuse\r\n o_data = {} # {Origin ID: [Shape, transferred fields]}\r\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\r\n self.input_origins_layer,\r\n [self.origin_id_field, \"SHAPE@\"] + self.origin_transfer_fields\r\n ):\r\n o_data[row[0]] = row[1:]\r\n d_data = {} # {Destination ID: [Shape, transferred fields]}\r\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\r\n self.input_destinations_layer,\r\n [self.dest_id_field, \"SHAPE@\"] + self.destination_transfer_fields\r\n ):\r\n d_data[row[0]] = row[1:]\r\n\r\n # Insert origins from each OD pair into the Route analysis\r\n with self.rt_solver.insertCursor(\r\n arcpy.nax.RouteInputDataType.Stops,\r\n [\"RouteName\", \"Sequence\", self.origin_unique_id_field_name, \"SHAPE@\"] + self.origin_transfer_fields\r\n ) as icur:\r\n for od_pair in self.od_pairs:\r\n origin_id, dest_id = od_pair\r\n try:\r\n origin_data = o_data[origin_id]\r\n except KeyError:\r\n # This should never happen because we should have preprocessed this out.\r\n self.logger.debug(\r\n f\"Origin from OD Pairs not found in inputs. Skipped pair {od_pair}.\")\r\n continue\r\n route_name = f\"{origin_id} - {dest_id}\"\r\n icur.insertRow((route_name, 1, origin_id) + origin_data)\r\n\r\n # Insert destinations from each OD pair into the Route analysis\r\n with self.rt_solver.insertCursor(\r\n arcpy.nax.RouteInputDataType.Stops,\r\n [\"RouteName\", \"Sequence\", self.dest_unique_id_field_name, \"SHAPE@\"] + self.destination_transfer_fields\r\n ) as icur:\r\n for od_pair in self.od_pairs:\r\n origin_id, dest_id = od_pair\r\n try:\r\n dest_data = d_data[dest_id]\r\n except KeyError:\r\n # This should never happen because we should have preprocessed this out.\r\n self.logger.debug(\r\n f\"Destination from OD Pairs not found in inputs. Skipped pair {od_pair}.\")\r\n continue\r\n route_name = f\"{origin_id} - {dest_id}\"\r\n icur.insertRow((route_name, 2, dest_id) + dest_data)","def main():\n # IMPORTANT: Specify a path to the new shapefile!\n data_dir = os.path.join(\"C:\\\\\",\"Users\",\"janni\",\"OneDrive\",\"Desktop\",\"data\")\n\n #Store route identification codes in to a list\n L_tracks=['\"tag_ident\"=72413','\"tag_ident\"=72417','\"tag_ident\"=73053','\"tag_ident\"=72364',\\\n '\"tag_ident\"=73054','\"tag_ident\"=79694','\"tag_ident\"=79698']\n\n if(os.path.isdir(data_dir)):\n print(\"Very good! You have chosen a valid directory!\")\n # load the point shapefile of the white-fronted goose manually!\n # access the active layer\n point_layer = iface.activeLayer()\n if not point_layer:\n print(\"Shape file failed to load!\")\n else:\n # 1\n addTimeAndDateObs(point_layer)\n print(\"-----------Created Date and Time objects-------------\")\n # 2\n addDistance(point_layer, L_tracks)\n print(\"-----------Distances calculation finished-------------\")\n # 3\n extractPoints(point_layer,Statistics(point_layer),data_dir)\n print(\"-----------Low distance points extracted and save to a new shapefile-------------\")\n print('Done')\n\n raster_fn = os.path.join(data_dir,\"Eurasia_Landcover.tif\")\n landuse_legend_fn = os.path.join(data_dir,'Eurasia_Landcover_Legend.csv')\n in_shape_fn = os.path.join(data_dir,\"lowDistance.shp\")\n out_shape_fn = os.path.join(data_dir,\"lowDistanceLanduseID.shp\")\n\n\n if(QgsProject.instance().mapLayersByName('lowDistanceLanduseID')==[]):\n processing.run(\"qgis:rastersampling\",\n {'COLUMN_PREFIX' : 'LanduseNr_',\n 'INPUT' : in_shape_fn,\n 'OUTPUT' : out_shape_fn,\n 'RASTERCOPY' : raster_fn})\n updated_shapefile = iface.addVectorLayer(out_shape_fn, '', 'ogr')\n else:\n updated_shapefile = QgsProject.instance().mapLayersByName('lowDistanceLanduseID')[0]\n #2\n convertIdFloatToInt(updated_shapefile)\n #3\n legend = preProcessLegend(landuse_legend_fn)\n #4\n convertIdToName(legend,updated_shapefile)\n #5\n plotLandUse(updated_shapefile,\"Pie\")\n print(\"-----------finished!-------------\")\n print(\"DONE! :)\")\n else:\n iface.messageBar().pushMessage(\"Error\", \"The directory does not exist. Please change data_dir in the code\",level = 1)\n print(\"Please specify a valid directory in the main function of Code_Distance.py!\")","def merge_energy_datatypes(osm_path): \n #extract line data\n df_line = powerline_limited(osm_path) #extract required data\n if 'asset' in df_line.columns:\n df_line['asset'] = list(map(lambda x: x.lower(), df_line['asset'])) #make sure that asset column is in lowercase characters\n #reclassify assets \n mapping_dict = {\n \"cable\" : \"cable\", #underground\n \"minor_cable\" : \"cable\", \n #\"generator\" : \"generator\", #device used to convert power from one form to another\n \"line\" : \"line\", #overground\n \"minor_line\" : \"minor_line\", #overground\n #\"plant\" : \"plant\", #place where power is generated\n #\"substation\" : \"substation\"\n }\n df_line['asset'] = df_line.asset.apply(lambda x : mapping_dict[x]) #reclassification \n\n if 'voltage' in df_line.columns:\n df_line = df_line.drop(['voltage'], axis=1) \n \n #extract polygon data\n df_poly = power_polygon(osm_path) #extract required data\n df_poly['geometry'] =pygeos.buffer(df_poly.geometry,0) #avoid intersection\n \n #extract point data\n df_point = power_point(osm_path) #extract required data\n \n return pandas.concat([df_line, df_poly, df_point], ignore_index=True)","def _update(self, features: DataFrameLike) -> None:\n # add features\n self._features = (\n pd.concat([self._features, features], axis=1, sort=True)\n # fill nans resulting from concatenation where features does not\n # contain neighborless nodes (out-degree=0) on its axis\n .fillna(0)\n )\n # prune redundant features\n pruner = FeaturePruner(self._final_features, self._feature_group_thresh)\n features_to_drop = pruner.prune_features(self._features)\n self._features = self._features.drop(features_to_drop, axis=1)\n # save features that remain after pruning and that\n # have not previously been saved as final features\n retained = features.columns.difference(features_to_drop)\n feature_dict = as_frame(self._features[retained]).to_dict()\n self._final_features[self.generation_count] = feature_dict","def r_to_ws(road_fn, ws, paths, ta):\n\n # Open the road data source and find distinct road classes from 'tag' field\n source_ds = ogr.Open(road_fn)\n source_layer = source_ds.GetLayer()\n feature = source_layer.GetNextFeature()\n field_vals = set([feature.GetFieldAsString('tag') for feature in source_layer])\n\n # Read excel file with walking speeds into pandas dataframe and sort\n costs = pd.read_csv(ws)\n costs = costs.sort_values(by=['Walking_Speed'], ascending=False)\n # TODO: Consider whether we should take into account congestion, crossings etc\n if paths is False:\n print()\n # TODO: if False remove paths from pandas dataframe.... \n\n # blank array to use in first back fill\n arr1 = ta.dst_ds.GetRasterBand(1).ReadAsArray()\n\n # Loop through road costs dataframe\n for index, row in costs.iterrows():\n\n # use fuzzy match spreadsheet road classes to polyline road classes\n match = process.extractOne(row[0], field_vals)\n\n # create SQL string to select one polyline road class at a time\n # formatted string of SQL statement where match[0] = road feature class\n sql_str = f\"SELECT * FROM AllRoads WHERE tag='{match[0]}'\" \n\n # rasterize one road class at a time using value from input csv\n # to in-memory array sized based on landcover input\n opt = gdal.RasterizeOptions(burnValues=row[1], # walking speed value to assign to pixel from input csv\n allTouched=True, # value assigned to all pixels touched by line\n SQLStatement=sql_str, # use above SQL string\n SQLDialect='SQLITE')\n gdal.Rasterize(ta.dst_ds, road_fn, options=opt) #(in-memory array, road shapefile, above options)\n\n # FIXME: \n # Warning 1: The input vector layer has a SRS, but the output raster dataset SRS is unknown.\n # Ensure output raster dataset has the same SRS, otherwise results might be incorrect.\n\n # get array from in-memory rasterized layer\n arr = ta.dst_ds.GetRasterBand(1).ReadAsArray()\n\n # create one layer of all roads prioritising based on rasterizing order\n arr1 = backfill(arr, arr1)\n\n return arr1","def to_segmentation_task(\n self, keep_geometries: Optional[List] = [Polygon, Bitmap], target_classes=None\n ) -> Tuple[ProjectMeta, Dict[ObjClass, ObjClass]]:\n mapping = {}\n res_classes = []\n for obj_class in self.obj_classes:\n obj_class: ObjClass\n\n if target_classes is None or obj_class.name in target_classes:\n if obj_class.geometry_type in keep_geometries:\n if obj_class.geometry_type == Bitmap:\n mapping[obj_class] = obj_class\n res_classes.append(obj_class)\n else:\n new_class = obj_class.clone(geometry_type=Bitmap)\n mapping[obj_class] = new_class\n res_classes.append(new_class)\n else:\n mapping[obj_class] = None\n else:\n mapping[obj_class] = None\n\n res_meta = self.clone(obj_classes=ObjClassCollection(res_classes))\n return res_meta, mapping","def process(self, data):\n allocating = (self._output is None)\n ind = 0\n for i, (name, feature) in enumerate(self.features):\n if allocating:\n x = feature.compute(data)\n self.feature_indices[name] = (ind, ind+x.size)\n ind += x.size\n\n if self._output is None:\n self._output = x\n else:\n self._output = np.hstack([self._output, x])\n else:\n self._output[self.feature_indices[name][0]:\n self.feature_indices[name][1]] = \\\n feature.compute(data)\n\n return self._output","def add_building_output_locations(self,area_id,start,end,step,type='BUILDINGS_AS_HOLES'): \n print \"Getting buildings locations...\"\n \n dictionary = self.grid.get_building_output_locations(area_id,type)\n if (dictionary != {}):\n self.run_nc.add_building_output_locations(dictionary, start, end,step)","def execute(self, parameters, messages):\r\n\t\tin_wikiplace_IRI = parameters[0]\r\n\t\tin_location_property = parameters[1]\r\n\t\tin_relation_degree = parameters[2]\r\n\t\tout_location = parameters[3]\r\n\t\tout_points_name = parameters[4]\r\n\r\n\t\t\r\n\t\tif in_wikiplace_IRI.value:\r\n\t\t\tinputFeatureClassName = in_wikiplace_IRI.valueAsText\r\n\t\t\tlocationCommonPropertyNameCount = in_location_property.valueAsText\r\n\t\t\trelationDegree = int(in_relation_degree.valueAsText)\r\n\t\t\toutLocation = out_location.valueAsText\r\n\t\t\toutFeatureClassName = out_points_name.valueAsText\r\n\t\t\t\r\n\t\t\tlastIndexOFGDB = inputFeatureClassName.rfind(\"\\\\\")\r\n\t\t\toriginFeatureClassName = inputFeatureClassName[(lastIndexOFGDB+1):]\r\n\r\n\t\t\tif outLocation.endswith(\".gdb\") == False:\r\n\t\t\t\tmessages.addErrorMessage(\"Please enter a file geodatabase as the file location for output feature class.\")\r\n\t\t\t\traise arcpy.ExecuteError\r\n\t\t\telse:\r\n\t\t\t\tarcpy.env.workspace = outLocation\r\n\r\n\t\t\t\tendFeatureClassName = outLocation + \"\\\\\" + outFeatureClassName\r\n\t\t\t\tif arcpy.Exists(endFeatureClassName):\r\n\t\t\t\t\tmessages.addErrorMessage(\"The output feature class name already exists in current workspace!\")\r\n\t\t\t\t\traise arcpy.ExecuteError\r\n\t\t\t\telse:\r\n\r\n\t\t\t\t\t# get all the IRI from input point feature class of wikidata places\r\n\t\t\t\t\tinplaceIRIList = []\r\n\t\t\t\t\tcursor = arcpy.SearchCursor(inputFeatureClassName)\r\n\t\t\t\t\tfor row in cursor:\r\n\t\t\t\t\t\tinplaceIRIList.append(row.getValue(\"URL\"))\r\n\r\n\t\t\t\t\tif relationDegree > 4:\r\n\t\t\t\t\t\trelationDegree = 4\r\n\t\t\t\t\t\tin_relation_degree.value = 4\r\n\t\t\t\t\t\r\n\t\t\t\t\tlocationCommonPropertyURL = LocationPropertyPath.locationCommonPropertyDict[locationCommonPropertyNameCount]\r\n\t\t\t\t\tlocationLinkageRelationJSONObj = SPARQLQuery.locationLinkageRelationQuery(inplaceIRIList, locationCommonPropertyURL, relationDegree)\r\n\t\t\t\t\tlocationLinkageRelationJSON = locationLinkageRelationJSONObj[\"results\"][\"bindings\"]\r\n\r\n\t\t\t\t\tendPlaceIRISet = Set()\r\n\t\t\t\t\tfor jsonItem in locationLinkageRelationJSON:\r\n\t\t\t\t\t\tendPlaceIRISet.add(jsonItem[\"end\"][\"value\"])\r\n\r\n\t\t\t\t\tendPlaceIRIList = list(endPlaceIRISet)\r\n\r\n\t\t\t\t\t# endPlaceJSONObj = SPARQLQuery.endPlaceInformationQuery(endPlaceIRIList)\r\n\t\t\t\t\t\r\n\t\t\t\t\tendPlaceJSON = SPARQLQuery.endPlaceInformationQuery(endPlaceIRIList)\r\n\r\n\t\t\t\t\tJson2Field.creatPlaceFeatureClassFromJSON(endPlaceJSON, endFeatureClassName, None, \"\")\r\n\r\n\r\n\t\t\t\t\tlastIndex = locationCommonPropertyNameCount.rfind(\"(\")\r\n\t\t\t\t\tlocationCommonPropertyName = locationCommonPropertyNameCount[:lastIndex]\r\n\t\t\t\t\tlocationLinkageTableName = Json2Field.createLocationLinkageMappingTableFromJSON(locationLinkageRelationJSON, \"origin\", \"end\", inputFeatureClassName, endFeatureClassName, locationCommonPropertyURL, locationCommonPropertyName, relationDegree)\r\n\r\n\t\t\t\t\tendFeatureRelationshipClassName = outFeatureClassName + \"_\" + locationLinkageTableName + \"_RelClass\"\r\n\t\t\t\t\tarcpy.CreateRelationshipClass_management(outFeatureClassName, locationLinkageTableName, endFeatureRelationshipClassName, \"SIMPLE\",\r\n\t\t\t\t\t\t\"is \"+ locationCommonPropertyName + \"of\", locationCommonPropertyName,\r\n\t\t\t\t\t\t\t\t\t\t \"FORWARD\", \"ONE_TO_MANY\", \"NONE\", \"URL\", \"end\")\r\n\r\n\t\t\t\t\toriginFeatureRelationshipClassName = originFeatureClassName + \"_\" + locationLinkageTableName + \"_RelClass\"\r\n\t\t\t\t\tarcpy.CreateRelationshipClass_management(originFeatureClassName, locationLinkageTableName, originFeatureRelationshipClassName, \"SIMPLE\",\r\n\t\t\t\t\t\tlocationCommonPropertyName, \"is \"+ locationCommonPropertyName + \"of\",\r\n\t\t\t\t\t\t\t\t\t\t \"FORWARD\", \"ONE_TO_MANY\", \"NONE\", \"URL\", \"origin\")\r\n\t\t\t\t\r\n\t\t\r\n\r\n\t\treturn","def PrepareWorkspace():\n \n # define expected file paths for file gdb folder, fgdb, taxi feature class \n fgdb_folder = constants.fgdb_folder\n fgdb_name = constants.taxi_fgdb_name\n file_gdb = os.path.join(fgdb_folder, fgdb_name)\n taxi_feature_class_name = \"TaxiLocations\"\n taxi_feature_class = os.path.join(file_gdb, taxi_feature_class_name)\n \n out_coordinate_system = arcpy.SpatialReference('WGS 1984') # define output spatial reference\n \n if not os.path.exists(fgdb_folder): # if file gdb folder has not been created\n os.mkdir(fgdb_folder) # create the folder\n if not arcpy.Exists(file_gdb): # if file gdb has not been created\n arcpy.CreateFileGDB_management(fgdb_folder, fgdb_name) # create the file gdb\n \n if not arcpy.Exists(taxi_feature_class): # if the taxi feature class does not exist\n # create the point feature class in WGS84 spatial reference\n arcpy.CreateFeatureclass_management(file_gdb, \n taxi_feature_class_name, \n \"Point\", \n spatial_reference=out_coordinate_system) # create a point feature class with defined coordinate system\n \n arcpy.TruncateTable_management(taxi_feature_class) # delete existing features in the feature class\n \n return file_gdb, taxi_feature_class # return fgdb and feature class path to main\n \n \n # %%","def _link_single_worker(self):\n self.det_link_map = OrderedDict()\n self.id_link_map = OrderedDict()\n\n # Single-process implementation\n # For each UID, cur_anno and cur_decl are relevant\n for uid in np.unique(self.annotations_table.uid.values):\n cur_anno = self.annotations_table[\n self.annotations_table.uid.values == uid\n ]\n cur_decl = self.declarations_table[\n self.declarations_table.uid.values == uid\n ]\n\n anno_frames = cur_anno.frame.values\n decl_frames = cur_decl.frame.values\n\n # For each frame, frame_anno and frame_decl are relevant. We don't\n # have to loop over decl_frames, since any decl with decl_frame not\n # present in anno_frames can't be linked to any annots\n for frame in np.unique(anno_frames):\n frame_anno = cur_anno[anno_frames == frame]\n frame_decl = cur_decl[decl_frames == frame]\n\n # Note that due to PANDAS index magic, the resulting\n # links and id_links map key values are the global indices, and\n # not simply [1 ... len(frame_anno)]\n links, id_links = self._link_frame(frame_anno, frame_decl)\n\n self.det_link_map.update(links)\n self.id_link_map.update(id_links)","def _merge_boundaries(self):\n \n optical_seg = self._amalgamated_optical_segments\n if bool(optical_seg):\n optical_seg[\"catagory\"] = OPTICAL * tf.ones_like(\n optical_seg[\"x_start\"],\n dtype=tf.int64\n )\n self._optical_seg_count = tf.shape(\n optical_seg[\"x_start\"],\n out_type=tf.int64\n )[0]\n else:\n self._optical_seg_count = 0\n \n stop_seg = self._amalgamated_stop_segments\n if bool(stop_seg):\n stop_seg[\"catagory\"] = STOP * tf.ones_like(\n stop_seg[\"x_start\"],\n dtype=tf.int64\n )\n self._stop_seg_count = tf.shape(\n stop_seg[\"x_start\"],\n out_type=tf.int64\n )[0]\n else:\n self._stop_seg_count = 0\n \n target_seg = self._amalgamated_target_segments\n if bool(target_seg):\n target_seg[\"catagory\"] = TARGET * tf.ones_like(\n target_seg[\"x_start\"],\n dtype=tf.int64\n )\n self._target_seg_count = tf.shape(\n target_seg[\"x_start\"],\n out_type=tf.int64\n )[0]\n else:\n self._target_seg_count = 0\n \n self._merged_segments = amalgamate(\n [optical_seg, stop_seg, target_seg], \n SEGMENT_GEO_SIG | {\"catagory\"}\n )\n \n optical_arc = self._amalgamated_optical_arcs\n if bool(optical_arc):\n optical_arc[\"catagory\"] = OPTICAL * tf.ones_like(\n optical_arc[\"x_center\"],\n dtype=tf.int64\n )\n self._optical_arc_count = tf.shape(\n optical_arc[\"x_center\"],\n out_type=tf.int64\n )[0]\n else:\n self._optical_arc_count = 0\n \n stop_arc = self._amalgamated_stop_arcs\n if bool(stop_arc):\n stop_arc[\"catagory\"] = STOP * tf.ones_like(\n stop_arc[\"x_center\"],\n dtype=tf.int64\n )\n self._stop_arc_count = tf.shape(\n stop_arc[\"x_center\"],\n out_type=tf.int64\n )[0]\n else:\n self._stop_arc_count = 0\n \n target_arc = self._amalgamated_target_arcs\n if bool(target_arc):\n target_arc[\"catagory\"] = TARGET * tf.ones_like(\n target_arc[\"x_center\"],\n dtype=tf.int64\n )\n self._target_arc_count = tf.shape(\n target_arc[\"x_center\"],\n out_type=tf.int64\n )[0]\n else:\n self._target_arc_count = 0\n \n self._merged_arcs = amalgamate(\n [optical_arc, stop_arc, target_arc], \n ARC_GEO_SIG | {\"catagory\"}\n )","def _series_merging_map(self, map_list, feature_option=\"sift\"):\n print(\" --- Start ---\")\n # Transform state into 3 specified values\n for i in range(len(map_list)):\n map_list[i] = cv2.cvtColor(map_list[i], cv2.COLOR_RGB2GRAY)\n map_list[i] = MF._transform_state(map_list[i])\n \n\n map_ref = map_list[0]\n for i in range(len(map_list)-1):\n map_align = map_list[i+1]\n\n \n if feature_option == \"orb\":\n orb = cv2.ORB_create()\n key_points_1, descriptor_1 = orb.detectAndCompute(map_ref, None)\n key_points_2, descriptor_2 = orb.detectAndCompute(map_align, None)\n \n elif feature_option == \"surf\":\n surf = cv2.xfeatures2d.SURF_create(400)\n key_points_1, descriptor_1 = surf.detectAndCompute(map_ref, None)\n key_points_2, descriptor_2 = surf.detectAndCompute(map_align, None)\n else:\n siftDetector = cv2.xfeatures2d.SIFT_create()\n key_points_1, descriptor_1 = siftDetector.detectAndCompute(map_ref, None)\n key_points_2, descriptor_2 = siftDetector.detectAndCompute(map_align, None)\n\n bf = cv2.BFMatcher()\n matches = bf.knnMatch(descriptor_1, descriptor_2, k=2)\n\n good = []\n for m, n in matches:\n if m.distance < 0.75*n.distance:\n good.append(m)\n \n pts_1, pts_2 = [], []\n for i in good:\n query_idx = i.queryIdx\n train_idx = i.trainIdx\n\n pts_1.append([\n key_points_1[query_idx].pt[0],\n key_points_1[query_idx].pt[1],\n ])\n pts_2.append([\n key_points_2[train_idx].pt[0],\n key_points_2[train_idx].pt[1],\n ])\n \n pts1 = np.array(pts_1)\n pts2 = np.array(pts_2)\n\n # relation, value, _ = RMM._ransac_find_rotation_translation(pts_set_1=pts2, pts_set_2=pts1, sigma=0.5, max_iter=5000)\n # print(\"- Inlier Percent: %f\"%value)\n # # Because the coordinates between the maps and the SIFT features are different:\n # # SIFT Features: Right: +x, Down: +y\n # # Maps: Down: +x, Right: +y\n # # Hence the dx and dy should be changed.\n # dx = relation[1]\n # dy = relation[0]\n # dyaw = relation[2]\n # print(\"- (x, y, t): (%f, %f, %f)\"%(dx,dy,dyaw))\n\n # # index, agr, dis = RMM._similarity_index(x=[dy, dx, dyaw], map1=map_ref, map2=map_align)\n # # print(\"Similarity Index: %f\\nAgree Number: %f\\nDisargee Number: %f\"%(index, agr, dis))\n # index, agr, dis, _ = RMM._similarity_index_2(x=[dx, dy, dyaw], map1=map_ref, map2=map_align)\n # print(\"- Similarity Index: %f\\n- Agree Number: %f\\n- Disargee Number: %f\"%(index, agr, dis))\n \n # map_merged = MF._merging_map(dx=dx, dy=dy, dtheta=dyaw, map1=map_ref, map2=map_align)\n # map_ref = map_merged.astype(np.uint8)\n # map_ref = MF._modify_map_size(merged_map=map_ref)\n\n relation, value, _ = RANSAC_Map_Merging()._ransac_find_all(pts_set_1=pts2, pts_set_2=pts1, sigma=5, max_iter=2000)\n dx = relation[1]\n dy = relation[0]\n dyaw = relation[2]\n dr = relation[3]\n print(\"- Inlier Percent: %f\"%value)\n print(\"- (dx, dy, dyaw, dr) = %f, %f, %f, %f\"%(dx,dy,dyaw, dr))\n map_merged = MAP_Function()._merging_map_ratio(dx=dx, dy=dy, dtheta=dyaw, dr=dr, map1=map_ref, map2=map_align)\n map_ref = map_merged.astype(np.uint8)\n map_ref = MF._modify_map_size(merged_map=map_ref)\n\n # return map_ref, (dx, dy, dyaw)\n return map_ref, (dx, dy, dyaw, dr)","def process_search_pages(self):\r\n features_list = []\r\n for page in self.url_list:\r\n listings = extract_listings(page)\r\n for listing in listings:\r\n features = extract_listing_features(listing, RULES_SEARCH_PAGE)\r\n features['sp_url'] = page\r\n features_list.append(features)\r\n\r\n self.base_features_list = features_list","def finalizeFeatures(self):\n pass","def split_at_nodes(shp):\n nodes = find_nodes(shp)\n nodeIds = list(nodes)\n nodeIds.sort()\n nodeIds = dict([(node,i) for i,node in enumerate(nodeIds)])\n \n for road in shp:\n vrts = road.vertices\n midVrts = set(road.vertices[1:-1]) #we know end points are nodes\n midNodes = midVrts.intersection(nodes) # find any nodes in the middle of the feature.\n midIdx = [vrts.index(node) for node in midNodes] # Get their indices\n midIdx.sort()\n if midIdx:\n #print vrts\n starts = [0]+midIdx\n stops = [x+1 for x in midIdx]+[None]\n for start,stop in zip(starts,stops):\n feat = pysal.cg.Chain(vrts[start:stop])\n rec = (nodeIds[feat.vertices[0]],nodeIds[feat.vertices[-1]],False)\n yield feat,rec\n else:\n rec = (nodeIds[road.vertices[0]],nodeIds[road.vertices[-1]],False)\n yield road,rec","def add_feature(layer, branchID, segs, lines, lon, lat, Ttime, density, Initial_loc, solubility, flows, concentration, water_level, dist): \r\n ctr=0\r\n for i in range(len(lines)):\r\n ctr+=1\r\n point = osgeo.ogr.Geometry(osgeo.ogr.wkbPoint)\r\n # Add points individually to the line\r\n #xy = lines[i]\r\n \r\n #line.AddPoint_2D(xy[0][0],xy[0][1])\r\n #line.AddPoint_2D(xy[1][0],xy[1][1])\r\n point.AddPoint(lon[i], lat[i])\r\n # Update the feature with the line data\r\n featureIndex = ctr\r\n feature = osgeo.ogr.Feature(layerDefinition)\r\n #feature.SetStyleString(\"PEN(c:r,w:5px)\") \r\n feature.SetGeometry(point)\r\n feature.SetFID(featureIndex)\r\n feature.SetGeometryDirectly(point)\r\n \r\n # Set the attribute table\r\n feature.SetField('BranchID', int(branchID[i])) \r\n feature.SetField('SegID', int(segs[i])) # convert to int() is necessary, osgeo cannot recognize numpy int32 type\r\n feature.SetField('Lon', \"{:.3f}\".format(lon[i]))\r\n feature.SetField('Lat', \"{:.3f}\".format(lat[i]))\r\n #feature.SetField('Lon_east', \"{:.3f}\".format(eastlon[i]))\r\n #feature.SetField('Lat_east', \"{:.3f}\".format(eastlat[i]))\r\n feature.SetField('T (day)', int(Ttime[i]))\r\n feature.SetField('Density', density[i])\r\n feature.SetField('Initial', Initial_loc[i])\r\n feature.SetField('Solubility', solubility[i])\r\n feature.SetField('Flow', flows[i])\r\n feature.SetField('C (mg/L)', concentration[i])\r\n feature.SetField('WSE (ft)', water_level[i])\r\n feature.SetField('D (ft)', dist[i])\r\n \r\n layer.CreateFeature(feature)","def updateParameters(self, parameters):\r\n\t\tin_wikiplace_IRI = parameters[0]\r\n\t\tin_stat_fields = parameters[1]\r\n\t\t# out_location = parameters[2]\r\n\t\t# out_points_name = parameters[3]\r\n\t\t\r\n\t\tif in_wikiplace_IRI.altered and not in_stat_fields.altered:\r\n\t\t\tinputFeatureClassName = in_wikiplace_IRI.valueAsText\r\n\t\t\tlastIndexOFGDB = inputFeatureClassName.rfind(\"\\\\\")\r\n\t\t\tfeatureClassName = inputFeatureClassName[(lastIndexOFGDB+1):]\r\n\t\t\tcurrentWorkspace = inputFeatureClassName[:lastIndexOFGDB]\r\n\r\n\t\t\tif currentWorkspace.endswith(\".gdb\") == False:\r\n\t\t\t\tmessages.addErrorMessage(\"Please enter a feature class in file geodatabase for the input feature class.\")\r\n\t\t\t\traise arcpy.ExecuteError\r\n\t\t\telse:\r\n\t\t\t\t# if in_related_table.value:\r\n\t\t\t\tarcpy.env.workspace = currentWorkspace\r\n\t\t\t\t# out_location.value = currentWorkspace\r\n\t\t\t\t# out_points_name.value = featureClassName + \"_noFunc_merge\"\r\n\t\t\t\t# # check whether the input table are in the same file geodatabase as the input feature class\r\n\t\t\t\t# inputTableName = in_related_table.valueAsText\r\n\t\t\t\t# lastIndexOFTable = inputTableName.rfind(\"\\\\\")\r\n\t\t\t\t# currentWorkspaceTable = inputTableName[:lastIndexOFTable]\r\n\t\t\t\t# if currentWorkspaceTable != currentWorkspace:\r\n\t\t\t\t# \tmessages.addErrorMessage(\"Please enter a table in the same file geodatabase as the input feature class.\")\r\n\t\t\t\t# \traise arcpy.ExecuteError\r\n\t\t\t\t# else:\r\n\t\t\t\t# \tif UTIL.detectRelationship(inputFeatureClassName, inputTableName):\r\n\t\t\t\t# \t\tarcpy.AddMessage(\"The feature class and table are related!\")\r\n\t\t\t\trelatedTableList = UTIL.getRelatedTableFromFeatureClass(inputFeatureClassName)\r\n\t\t\t\t# fieldmappings = arcpy.FieldMappings()\r\n\t\t\t\t# fieldmappings.addTable(inputFeatureClassName)\r\n\t\t\t\t\r\n\t\t\t\tnoFunctionalPropertyTable = []\r\n\r\n\t\t\t\tfor relatedTable in relatedTableList:\r\n\t\t\t\t\tfieldList = arcpy.ListFields(relatedTable)\r\n\t\t\t\t\tif \"origin\" not in fieldList and \"end\" not in fieldList:\r\n\t\t\t\t\t\tnoFunctionalFieldName = fieldList[2].name\r\n\t\t\t\t\t\tarcpy.AddMessage(\"noFunctionalFieldName: {0}\".format(noFunctionalFieldName))\r\n\t\t\t\t\t\tnoFunctionalPropertyTable.append([noFunctionalFieldName, 'COUNT', relatedTable])\r\n\t\t\t\t\t\t# MergeNoFunctionalProperty.relatedTableFieldList.append([noFunctionalFieldName, relatedTable, 'COUNT'])\r\n\t\t\t\t\t# fieldmappings.addTable(relatedTable)\r\n\t\t\t\t\t# fieldList = arcpy.ListFields(relatedTable)\r\n\t\t\t\t\t# noFunctionalFieldName = fieldList[len(fieldList)-1].name\r\n\t\t\t\t\t# arcpy.AddMessage(\"noFunctionalFieldName: {0}\".format(noFunctionalFieldName))\r\n\t\t\t\t\t# fieldmap = fieldmappings.getFieldMap(fieldmappings.findFieldMapIndex(noFunctionalFieldName))\r\n\t\t\t\t\t# fieldmap.addInputField(relatedTable, \"wikiURL\")\r\n\t\t\t\t\t# fieldmap.addInputField(inputFeatureClassName, \"URL\")\r\n\t\t\t\t\t# fieldmappings.replaceFieldMap(fieldmappings.findFieldMapIndex(noFunctionalFieldName), fieldmap)\r\n\r\n\t\t\t\tin_stat_fields.values = noFunctionalPropertyTable\r\n\r\n\r\n\r\n\t\t\t\t# fieldmappings.removeFieldMap(fieldmappings.findFieldMapIndex(\"wikiURL\"))\r\n\r\n\r\n\r\n\t\t\t\t# in_field_mapping.value = fieldmappings.exportToString()\r\n\r\n\t\t\t# if in_stat_fields.altered:\r\n\t\t\t# \tfieldMergeRuleTest = in_stat_fields.valueAsText\r\n\t\t\t# \tif fieldMergeRuleTest:\r\n\t\t\t# \tfieldSplitList = fieldMergeRuleTest.split(\";\")\r\n\t\t\t# \tfor fieldSplitItem in fieldSplitList:\r\n\t\t\t# \t\tfieldMergeList = fieldSplitList.split(\"\\t\")\r\n\t\t\t# \t\tfor item in MergeNoFunctionalProperty.relatedTableFieldList:\r\n\t\t\t# \t\t\tif item[]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t\t\r\n\r\n\t\treturn","def write_features(self):\n num_features_per_file = math.ceil(len(self.features) / self.num_jobs)\n for idx in range(self.num_jobs):\n job_features = self.features[idx * num_features_per_file: (idx + 1) * num_features_per_file]\n features_filename = constants.INPUT_FEATURES_FILENAME.format(self.args.output_dir, idx)\n with open(features_filename, \"wb\") as features_file:\n cloudpickle.dump(job_features, features_file, protocol=pickle.DEFAULT_PROTOCOL)","def updateParameters(self, parameters):\r\n\t\tin_wikiplace_IRI = parameters[0]\r\n\t\tin_no_functional_property_list = parameters[1]\r\n\t\tin_related_table_list = parameters[2]\r\n\t\tin_merge_rule = parameters[3]\r\n\t\tin_cancatenate_delimiter = parameters[4]\r\n\t\t\r\n\t\tif in_wikiplace_IRI.altered:\r\n\t\t\tinputFeatureClassName = in_wikiplace_IRI.valueAsText\r\n\t\t\tlastIndexOFGDB = inputFeatureClassName.rfind(\"\\\\\")\r\n\t\t\tfeatureClassName = inputFeatureClassName[(lastIndexOFGDB+1):]\r\n\t\t\tcurrentWorkspace = inputFeatureClassName[:lastIndexOFGDB]\r\n\r\n\t\t\tif currentWorkspace.endswith(\".gdb\") == False:\r\n\t\t\t\tmessages.addErrorMessage(\"Please enter a feature class in file geodatabase for the input feature class.\")\r\n\t\t\t\traise arcpy.ExecuteError\r\n\t\t\telse:\r\n\t\t\t\t# if in_related_table.value:\r\n\t\t\t\tarcpy.env.workspace = currentWorkspace\r\n\t\t\t\t# out_location.value = currentWorkspace\r\n\t\t\t\t# out_points_name.value = featureClassName + \"_noFunc_merge\"\r\n\t\t\t\t# # check whether the input table are in the same file geodatabase as the input feature class\r\n\t\t\t\t# inputTableName = in_related_table.valueAsText\r\n\t\t\t\t# lastIndexOFTable = inputTableName.rfind(\"\\\\\")\r\n\t\t\t\t# currentWorkspaceTable = inputTableName[:lastIndexOFTable]\r\n\t\t\t\t# if currentWorkspaceTable != currentWorkspace:\r\n\t\t\t\t# \tmessages.addErrorMessage(\"Please enter a table in the same file geodatabase as the input feature class.\")\r\n\t\t\t\t# \traise arcpy.ExecuteError\r\n\t\t\t\t# else:\r\n\t\t\t\t# \tif UTIL.detectRelationship(inputFeatureClassName, inputTableName):\r\n\t\t\t\t# \t\tarcpy.AddMessage(\"The feature class and table are related!\")\r\n\t\t\t\tMergeSingleNoFunctionalProperty.relatedTableFieldList = []\r\n\t\t\t\tMergeSingleNoFunctionalProperty.relatedTableList = []\r\n\t\t\t\tMergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList = []\r\n\r\n\t\t\t\tMergeSingleNoFunctionalProperty.relatedTableList = UTIL.getRelatedTableFromFeatureClass(inputFeatureClassName)\r\n\t\t\t\tin_related_table_list.filter.list = MergeSingleNoFunctionalProperty.relatedTableList\r\n\t\t\t\t\r\n\t\t\t\t# noFunctionalPropertyTable = []\r\n\r\n\t\t\t\tfor relatedTable in MergeSingleNoFunctionalProperty.relatedTableList:\r\n\t\t\t\t\tfieldList = arcpy.ListFields(relatedTable)\r\n\t\t\t\t\tif \"origin\" not in fieldList and \"end\" not in fieldList:\r\n\t\t\t\t\t\tnoFunctionalFieldName = fieldList[2].name\r\n\t\t\t\t\t\tarcpy.AddMessage(\"noFunctionalFieldName: {0}\".format(noFunctionalFieldName))\r\n\t\t\t\t\t\tMergeSingleNoFunctionalProperty.relatedTableFieldList.append(noFunctionalFieldName)\r\n\t\t\t\t\t\t# get the no functioal property URL from the firt row of this table field \"propURL\"\r\n\t\t\t\t\t\t# propURL = arcpy.da.SearchCursor(relatedTable, (\"propURL\")).next()[0]\r\n\r\n\t\t\t\t\t\tTableRelationshipClassList = UTIL.getRelationshipClassFromTable(relatedTable)\r\n\t\t\t\t\t\tpropURL = arcpy.Describe(TableRelationshipClassList[0]).forwardPathLabel\r\n\r\n\t\t\t\t\t\tMergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList.append(propURL)\r\n\r\n\t\t\t\tin_no_functional_property_list.filter.list = MergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList\r\n\t\t\t\t\t\t# noFunctionalPropertyTable.append([noFunctionalFieldName, 'COUNT', relatedTable])\r\n\t\t\t\t\t\t# MergeNoFunctionalProperty.relatedTableFieldList.append([noFunctionalFieldName, relatedTable, 'COUNT'])\r\n\t\t\t\t\t# fieldmappings.addTable(relatedTable)\r\n\t\t\t\t\t# fieldList = arcpy.ListFields(relatedTable)\r\n\t\t\t\t\t# noFunctionalFieldName = fieldList[len(fieldList)-1].name\r\n\t\t\t\t\t# arcpy.AddMessage(\"noFunctionalFieldName: {0}\".format(noFunctionalFieldName))\r\n\r\n\t\t\t\t# in_stat_fields.values = noFunctionalPropertyTable\r\n\r\n\t\tif in_no_functional_property_list.altered:\r\n\t\t\tselectPropURL = in_no_functional_property_list.valueAsText\r\n\t\t\tselectIndex = MergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList.index(selectPropURL)\r\n\t\t\tselectFieldName = MergeSingleNoFunctionalProperty.relatedTableFieldList[selectIndex]\r\n\t\t\tselectTableName = MergeSingleNoFunctionalProperty.relatedTableList[selectIndex]\r\n\r\n\t\t\tin_related_table_list.value = selectTableName\r\n\r\n\t\t\tcurrentDataType = UTIL.getFieldDataTypeInTable(selectFieldName, selectTableName)\r\n\t\t\tif currentDataType in ['Single', 'Double', 'SmallInteger', 'Integer']:\r\n\t\t\t\tin_merge_rule.filter.list = ['SUM', 'MIN', 'MAX', 'STDEV', 'MEAN', 'COUNT', 'FIRST', 'LAST', 'CONCATENATE']\r\n\t\t\t# elif currentDataType in ['SmallInteger', 'Integer']:\r\n\t\t\t# \tin_merge_rule.filter.list = ['SUM', 'MIN', 'MAX', 'COUNT', 'FIRST', 'LAST']\r\n\t\t\telse:\r\n\t\t\t\tin_merge_rule.filter.list = ['COUNT', 'FIRST', 'LAST', 'CONCATENATE']\r\n\r\n\t\tif in_related_table_list.altered:\r\n\t\t\tselectTableName = in_related_table_list.valueAsText\r\n\t\t\tselectIndex = MergeSingleNoFunctionalProperty.relatedTableList.index(selectTableName)\r\n\t\t\tselectFieldName = MergeSingleNoFunctionalProperty.relatedTableFieldList[selectIndex]\r\n\t\t\tselectPropURL = MergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList[selectIndex]\r\n\r\n\t\t\tin_no_functional_property_list.value = selectPropURL\r\n\r\n\t\t\tcurrentDataType = UTIL.getFieldDataTypeInTable(selectFieldName, selectTableName)\r\n\t\t\tif currentDataType in ['Single', 'Double', 'SmallInteger', 'Integer']:\r\n\t\t\t\tin_merge_rule.filter.list = ['SUM', 'MIN', 'MAX', 'STDEV', 'MEAN', 'COUNT', 'FIRST', 'LAST', 'CONCATENATE']\r\n\t\t\t# elif currentDataType in ['SmallInteger', 'Integer']:\r\n\t\t\t# \tin_merge_rule.filter.list = ['SUM', 'MIN', 'MAX', 'COUNT', 'FIRST', 'LAST']\r\n\t\t\telse:\r\n\t\t\t\tin_merge_rule.filter.list = ['COUNT', 'FIRST', 'LAST', 'CONCATENATE']\r\n\t\t\t\r\n\r\n\t\tif in_merge_rule.valueAsText == \"CONCATENATE\":\r\n\t\t\tin_cancatenate_delimiter.enabled = True\r\n\r\n\r\n\r\n\r\n\t\treturn","async def wrap_up_processing_reports(self):\n if hasattr(Config(), 'results'):\n new_row = []\n for item in self.recorded_items:\n item_value = {\n 'global_round':\n self.current_global_round,\n 'round':\n self.current_round,\n 'accuracy':\n self.accuracy * 100,\n 'average_accuracy':\n self.average_accuracy * 100,\n 'edge_agg_num':\n Config().algorithm.local_rounds,\n 'local_epoch_num':\n Config().trainer.epochs,\n 'training_time':\n max([\n report.training_time for (report, __) in self.updates\n ]),\n 'round_time':\n time.perf_counter() - self.round_start_time\n }[item]\n new_row.append(item_value)\n\n if Config().is_edge_server():\n result_csv_file = f'{Config().result_dir}result_{Config().args.id}.csv'\n else:\n result_csv_file = f'{Config().result_dir}result.csv'\n\n csv_processor.write_csv(result_csv_file, new_row)\n\n if Config().is_edge_server():\n # When a certain number of aggregations are completed, an edge client\n # needs to be signaled to send a report to the central server\n if self.current_round == Config().algorithm.local_rounds:\n logging.info(\n '[Server #%d] Completed %s rounds of local aggregation.',\n os.getpid(),\n Config().algorithm.local_rounds)\n self.model_aggregated.set()\n\n self.current_round = 0\n self.new_global_round_begins.clear()\n # Wait until a new global round begins\n # to avoid selecting clients before a new global round begins\n await self.new_global_round_begins.wait()","def finalize(self):\n routes = self.routes.copy()\n for child in self._children:\n routes.extend(list(child.tree_routes))\n\n # Make a new Map() out of all of the routes.\n rule_map = Map([route.create_rule() for route in routes])\n self._route_map = rule_map\n\n self.finalized = True","def _generate_feature_tree(self, features):\n # build a set of all features, including top-level features and\n # dependencies.\n self.top_level_features = defaultdict(list)\n\n # find top-level features and index them by entity id.\n for f in self.all_features:\n _, num_forward = self.entityset.find_path(self.target_eid, f.entity.id,\n include_num_forward=True)\n if num_forward or f.entity.id == self.target_eid:\n self.top_level_features[f.entity.id].append(f)","def postprocess_spatial(self):\n if self.spatial_finalization is not None:\n for func in self.spatial_finalization:\n self.spatial_data = func(self.spatial_data)","def _merge_groups(self):\n fof_rdd = self.fof_rdd\n nPartitions = self.nPartitions\n \n def remap_local_groups(iterator): \n gmap = iterator.next() \n for p_arr in iterator:\n remap_gid_partition_cython(p_arr, gmap)\n yield p_arr\n\n mapping = self._get_level_map()\n\n group_merge_map = (mapping.flatMap(lambda (g,g_p):\n [(gid, (g,g_p)) for gid in [decode_partition(g), decode_partition(g_p)]])\n .partitionBy(nPartitions)\n .map(lambda (k,v): v, preservesPartitioning=True)\n .mapPartitions(create_map_dict, True)).cache() \n\n merged_rdd = (group_merge_map + fof_rdd).mapPartitions(remap_local_groups, preservesPartitioning=True)\n merged_rdd.setName('merged_rdd')\n\n self.group_merge_map = group_merge_map\n\n return merged_rdd","def _concatenate_features(features):\n pass","def create_from_feature_list(self, features): \n for f in features:\n featuretype = f.pop('featuretype', None)\n if featuretype is None:\n raise LoopException\n if featuretype == 'strati':\n self.create_and_add_foliation(f)\n # if featuretype == 'fault':\n # self.create_and_add_fault(f)\n if featuretype == 'folded_strati':\n self.create_and_add_folded_foliation(f)","def collect_best_features(self):\n bincsp = self.binary_csp # just to make code shorter\n n_folds = len(self.binary_csp.folds)\n n_class_pairs = len(self.binary_csp.class_pairs)\n result_shape = (n_folds, n_class_pairs)\n self.train_feature = np.empty(result_shape, dtype=object)\n self.train_feature_full_fold = np.empty(result_shape, dtype=object)\n self.test_feature = np.empty(result_shape, dtype=object)\n self.test_feature_full_fold = np.empty(result_shape, dtype=object)\n self.selected_filters_per_filterband = np.empty(result_shape, dtype=object)\n for fold_i in range(n_folds):\n for class_pair_i in range(n_class_pairs):\n bin_csp_train_features = deepcopy(bincsp.train_feature[\n self.selected_filter_inds, fold_i, class_pair_i])\n bin_csp_train_features_full_fold = deepcopy(\n bincsp.train_feature_full_fold[\n self.selected_filter_inds,\n fold_i, class_pair_i])\n bin_csp_test_features = deepcopy(bincsp.test_feature[\n self.selected_filter_inds, fold_i, class_pair_i])\n bin_csp_test_features_full_fold = deepcopy(\n bincsp.test_feature_full_fold[\n self.selected_filter_inds,fold_i, class_pair_i])\n selected_filters_per_filt = self.select_best_filters_best_filterbands(\n bin_csp_train_features, max_features=self.n_features,\n forward_steps=self.forward_steps, \n backward_steps=self.backward_steps,\n stop_when_no_improvement=self.stop_when_no_improvement)\n self.train_feature[fold_i, class_pair_i] = \\\n self.collect_features_for_filter_selection(\n bin_csp_train_features, selected_filters_per_filt)\n self.train_feature_full_fold[fold_i, class_pair_i] = \\\n self.collect_features_for_filter_selection(\n bin_csp_train_features_full_fold, selected_filters_per_filt)\n \n self.test_feature[fold_i, class_pair_i] = \\\n self.collect_features_for_filter_selection(\n bin_csp_test_features, selected_filters_per_filt)\n self.test_feature_full_fold[fold_i, class_pair_i] = \\\n self.collect_features_for_filter_selection(\n bin_csp_test_features_full_fold, selected_filters_per_filt)\n \n self.selected_filters_per_filterband[fold_i, class_pair_i] = \\\n selected_filters_per_filt","def buildRoutesDict(self):\n \n # create route number and name xref dictionary\n arcpy.env.workspace = PublicTransit.RTD_PATH\n routes = arcpy.SearchCursor(PublicTransit.BUS_ROUTES, \"\", \"\", \"RouteID; Name\", \"\")\n self.routeXref = dict()\n for route in routes:\n self.routeXref[route.RouteID] = route.Name\n self.routeXref[route.Name] = route.RouteID\n del routes\n \n #get mode lookup table\n mode_table = self.getModeLookupTable()\n \n # Query the RTD database for the route name, operator, mode, and headways.\n # We are querying for weekday routes (DAYTYPE_CLASS Weekday field = 'Y')\n conn = pyodbc.connect(PublicTransit.DB_CONN_STRING)\n cursor = conn.cursor()\n self.transitRoutes = dict()\n qry = \"\"\"\n WITH t AS\n (\n SELECT CPT_AGENCYID, AGENCYNAME, SCH_ROUTEID, SCH_PATTERNID, CPT_MODE, SCH_ROUTEDESIGNATOR,\n CASE\n WHEN HOUR_CLASS >= 3 and HOUR_CLASS < 6 THEN 'EA'\n WHEN HOUR_CLASS >= 6 and HOUR_CLASS < 10 THEN 'AM'\n WHEN HOUR_CLASS >= 10 and HOUR_CLASS < 15 THEN 'MD'\n WHEN HOUR_CLASS >= 15 and HOUR_CLASS < 19 THEN 'PM'\n WHEN (HOUR_CLASS BETWEEN 19 AND 24) OR HOUR_CLASS < 3 THEN 'EV'\n END AS tod,\n [HOURLY_FREQUENCY(Daily until HOUR_CLASS update)], HOUR_CLASS\n FROM dbo.[ROUTE HEADWAY AND FREQUENCY]\n WHERE DAYTYPE_CLASS IN\n (SELECT dc.CLASS FROM dbo.DAYTYPE_CLASS dc WHERE WEEKDAY = 'Y')\n )\n SELECT CPT_AGENCYID, AGENCYNAME, SCH_ROUTEID, SCH_PATTERNID, CPT_MODE, SCH_ROUTEDESIGNATOR, tod,\n 60.0 / ROUND(AVG(CAST([HOURLY_FREQUENCY(Daily until HOUR_CLASS update)] AS FLOAT)), 0) as headway\n FROM t\n GROUP BY CPT_AGENCYID, AGENCYNAME, SCH_ROUTEID, SCH_PATTERNID, CPT_MODE, SCH_ROUTEDESIGNATOR, tod\n ORDER BY SCH_ROUTEID, SCH_PATTERNID, tod\"\"\"\n \n used_route_names = []\n # Iterate through result set and apply attributes.\n for row in cursor.execute(qry):\n routePattern = str(row.SCH_ROUTEID) + \"_\" + str(row.SCH_PATTERNID)\n if routePattern not in self.transitRoutes:\n self.transitRoutes[routePattern] = TransitRoute(routePattern,\n routeId = row.SCH_ROUTEID,\n patternId = row.SCH_PATTERNID)\n self.transitRoutes[routePattern].new_name = self.__cleanRouteName(row.CPT_AGENCYID + \"_\" + row.SCH_ROUTEDESIGNATOR[:(11 - 1 - len(row.CPT_AGENCYID))],used_route_names) #12 is the maximum name length\n self.transitRoutes[routePattern].agency = row.AGENCYNAME\n mode = -1\n for mode_row in mode_table:\n if row.CPT_AGENCYID == mode_row[\"CPT_AGENCYID\"] and row.CPT_MODE == mode_row[\"CPT_MODE\"]:\n if mode_row[\"SCH_ROUTEDESIGNATOR\"] != \"NA\":\n if row.SCH_ROUTEDESIGNATOR == mode_row[\"SCH_ROUTEDESIGNATOR\"]:\n mode = mode_row[\"MODECODE\"]\n mode_group = Mode.getModeFromLookupTable(mode_row[\"MODEGROUP\"])\n break #this is as detailed as we can get\n else:\n mode = mode_row[\"MODECODE\"]\n mode_group = Mode.getModeFromLookupTable(mode_row[\"MODEGROUP\"])\n self.transitRoutes[routePattern].mode = mode\n self.transitRoutes[routePattern].mode_group = Mode.getModeName(mode_group)\n # set headways\n if row.tod == 'EA':\n self.transitRoutes[routePattern].eaHeadway = row.headway\n elif row.tod == 'AM':\n self.transitRoutes[routePattern].amHeadway = row.headway\n elif row.tod == 'MD':\n self.transitRoutes[routePattern].mdHeadway = row.headway\n elif row.tod == 'PM':\n self.transitRoutes[routePattern].pmHeadway = row.headway\n elif row.tod == 'EV':\n self.transitRoutes[routePattern].evHeadway = row.headway\n conn.close()","def main(*argv):\n try:\n attr_features = argv[0]\n sql_clause = argv[1]\n polygon_grid = argv[2]\n error_field_count = str(argv[3]) #'NULL_COUNT'#\n error_field_def = str(argv[4]) #'NULL_COLUMNS'#\n output_fc = argv[5]\n out_fc_exists = arcpy.Exists(output_fc)\n\n # Local Variable\n #\n scratchFolder = env.scratchFolder\n scratchGDB = env.scratchGDB\n results = []\n # Logic\n #\n if not out_fc_exists:\n output_gdb = validate_workspace(os.path.dirname(output_fc))\n # Create the grid\n #\n out_grid = arcpy.CopyFeatures_management(polygon_grid, output_fc)[0]\n out_grid = extend_table(out_grid)\n where_clause=None\n else:\n arcpy.MakeFeatureLayer_management(output_fc, \"lyr\")\n arcpy.SelectLayerByLocation_management(\"lyr\", \"HAVE_THEIR_CENTER_IN\", polygon_grid)\n oids = [row[0] for row in arcpy.da.SearchCursor(\"lyr\", \"OID@\")]\n if len(oids) >1:\n oids_string = str(tuple(oids))\n else:\n oids_string = str('('+ str(oids[0]) + ')')\n\n where_clause = 'OBJECTID IN ' + oids_string\n\n error_field = (error_field_def, error_field_count)\n\n # Process the Data\n #\n\n poly_desc = arcpy.Describe(output_fc)\n fc_desc = arcpy.Describe(attr_features)\n if poly_desc.extent.within(fc_desc.extent):\n\n temp_fc = 'in_memory/clip'\n arcpy.AddMessage('Clipping features to polygon')\n arcpy.Clip_analysis(attr_features, output_fc, temp_fc)\n arcpy.AddMessage('Created in_memory fc')\n #data_sdf = geomotion.SpatialDataFrame.from_featureclass(temp_fc,\n # fields=[value_field])\n if sql_clause:\n attr_sdf = SpatialDataFrame.from_featureclass(temp_fc,\n fields=error_field,\n where_clause=sql_clause)\n else:\n attr_sdf = SpatialDataFrame.from_featureclass(temp_fc,\n fields=error_field)\n arcpy.AddMessage('features read into spatial dataframe after clipping')\n else:\n #data_sdf = geomotion.SpatialDataFrame.from_featureclass(, fields=[value_field])\n arcpy.AddMessage('features read into spatial dataframe without clipping')\n if sql_clause:\n attr_sdf = SpatialDataFrame.from_featureclass(attr_features,\n fields=error_field,\n where_clause=sql_clause)\n else:\n attr_sdf = SpatialDataFrame.from_featureclass(attr_features,\n fields=error_field)\n\n grid_sdf = SpatialDataFrame.from_featureclass(filename=output_fc,\n where_clause=where_clause)\n\n index = attr_sdf.sindex\n for idx, row in enumerate(grid_sdf.iterrows()):\n errors = []\n attrs = []\n geom = row[1].SHAPE\n oid = row[1].OBJECTID\n print(str(oid))\n ext = [geom.extent.lowerLeft.X, geom.extent.lowerLeft.Y,\n geom.extent.upperRight.X, geom.extent.upperRight.Y]\n row_oids = list(index.intersect(ext))\n df_current = attr_sdf.loc[row_oids]#.copy()\n sq = df_current.geometry.disjoint(geom) == False\n fcount = len(df_current[sq]) # Total Count\n q2 = df_current[error_field_count] > 0\n #& q2\n df_current = df_current[sq].copy() # Get the # of features with deficiency_cnt > 0\n #print(\"here\")\n if fcount>0: #len(df_current) > 0:\n errors += df_current[error_field_count].tolist()\n arcpy.AddMessage(str(errors))\n def process(x):\n print(x)\n return [va for va in x.replace(' ', '').split('|')[-1].split(',') if len(va) > 1]\n for e in df_current[error_field_def].apply(process).tolist():\n attrs += e\n del e\n row = get_answers(oid=oid,\n err=errors,\n attr=attrs,\n feature_count=fcount)\n results.append(row)\n if len(results) > 250:\n extend_table(table=output_fc, rows=results)\n results = []\n del idx\n del row\n del errors\n del attrs\n del geom\n del oid\n del ext\n del row_oids\n del df_current\n del sq\n del q2\n if len(results) > 0:\n extend_table(table=output_fc, rows=results)\n del index\n del results\n del grid_sdf\n del attr_sdf\n except arcpy.ExecuteError:\n line, filename, synerror = trace()\n arcpy.AddError(\"error on line: %s\" % line)\n arcpy.AddError(\"error in file name: %s\" % filename)\n arcpy.AddError(\"with error message: %s\" % synerror)\n arcpy.AddError(\"ArcPy Error Message: %s\" % arcpy.GetMessages(2))\n except FunctionError as f_e:\n messages = f_e.args[0]\n arcpy.AddError(\"error in function: %s\" % messages[\"function\"])\n arcpy.AddError(\"error on line: %s\" % messages[\"line\"])\n arcpy.AddError(\"error in file name: %s\" % messages[\"filename\"])\n arcpy.AddError(\"with error message: %s\" % messages[\"synerror\"])\n arcpy.AddError(\"ArcPy Error Message: %s\" % messages[\"arc\"])\n except:\n line, filename, synerror = trace()\n arcpy.AddError(\"error on line: %s\" % line)\n arcpy.AddError(\"error in file name: %s\" % filename)\n arcpy.AddError(\"with error message: %s\" % synerror)","def _extract_features(self, times):\n times[1] = time()\n data = {n:self._extract_feature(f) for (n,f) in self.features.items()} \n times[2] = time()\n return (data, times, os.getpid())","def _process_data(self):\r\n # Rename columns to match final feature class\r\n self._rename_columns()\r\n # Add point ID column\r\n self._add_pointid()\r\n # Sort rows by transect id and timestamp\r\n self._sort_rows()\r\n # Fill Null records with a value\r\n self._fill_nulls()\r\n # Set site_code to lower case\r\n self._lower_site_code()\r\n # Create survey_id\r\n self._calc_survey_id()\r\n # Calculate nativesg column if at least one of the veg columns is a Native seagrass type\r\n if set(self.veg_columns).intersection(set(NATIVESG_CODES)) > 0:\r\n self.nativesg_columns = list(set(self.veg_columns).intersection(set(NATIVESG_CODES)))\r\n self._calc_nativesg()\r\n #\r","def __merge_processes_data(self, manager_data, tracker=None):\n\n if manager_data is not None:\n if (\n not self.autosave.authorized\n and PyFunceble.CONFIGURATION.multiprocess_merging_mode != \"live\"\n and not PyFunceble.CONFIGURATION.quiet\n ):\n print(\n Fore.MAGENTA\n + Style.BRIGHT\n + \"\\nMerging cross processes data... This process may take some time.\"\n )\n\n for test_output in manager_data:\n if self.autosave.authorized:\n print(Fore.MAGENTA + Style.BRIGHT + \"Merging process data ...\")\n\n self.post_test_treatment(\n test_output,\n self.file_type,\n complements_test_started=self.complements_test_started,\n auto_continue_db=self.autocontinue,\n inactive_db=self.inactive_db,\n mining=self.mining,\n whois_db=self.whois_db,\n )\n\n if tracker:\n tracker.add_position(len(test_output[\"given\"]))\n\n manager_data[:] = []\n\n self.autocontinue.save()\n self.inactive_db.save()\n self.mining.save()\n\n self.cleanup(self.autocontinue, self.autosave, test_completed=False)","def _merge_boundaries(self):\n optical = self._amalgamated_optical\n if bool(optical):\n optical[\"catagory\"] = OPTICAL * tf.ones_like(\n optical[\"xp\"],\n dtype=tf.int64\n )\n self._optical_count = tf.shape(\n optical[\"xp\"],\n out_type=tf.int64\n )[0]\n else:\n self._optical_count = 0\n \n stop = self._amalgamated_stop\n if bool(stop):\n stop[\"catagory\"] = STOP * tf.ones_like(\n stop[\"xp\"],\n dtype=tf.int64\n )\n self._stop_count = tf.shape(\n stop[\"xp\"],\n out_type=tf.int64\n )[0]\n else:\n self._stop_count = 0\n \n target = self._amalgamated_target\n if bool(target):\n target[\"catagory\"] = TARGET * tf.ones_like(\n target[\"xp\"],\n dtype=tf.int64\n )\n self._target_count = tf.shape(\n target[\"xp\"],\n out_type=tf.int64\n )[0]\n else:\n self._target_count = 0\n \n self._merged = amalgamate(\n [optical, stop, target], \n TRIANGLE_GEO_SIG | {\"catagory\"}\n )","def extract_features(self):\n self.extract_features_static()\n self.extract_features_dynamic()","def _get_features_geo(self, id):\n #creates featues/geo tensors for all atoms in protein\n if self.type_feature == \"hot_simple\":\n features = self.hot_enc(id)\n elif self.type_feature == \"mass_charges\":\n features = self.mass_charges(id)\n elif self.type_feature == \"bio_properties\":\n features = self.bio_prop(id)\n elif self.type_feature == \"bio_all_properties\":\n features_1 = self.mass_charges(id)\n features_2 = self.bio_prop(id)\n features = np.concatenate((features_1, features_2), axis=1)\n geometry = self._get_geometry_protein(id)\n return features, geometry","def execute(self, parameters, messages):\r\n\t\tin_wikiplace_IRI = parameters[0]\r\n\t\tin_stat_fields = parameters[1]\r\n\t\t# out_location = parameters[2]\r\n\t\t# out_points_name = parameters[3]\r\n\r\n\t\t\r\n\t\tif in_wikiplace_IRI.value:\r\n\t\t\tinputFeatureClassName = in_wikiplace_IRI.valueAsText\r\n\t\t\t# outLocation = out_location.valueAsText\r\n\t\t\t# outFeatureClassName = out_points_name.valueAsText\r\n\t\t\tfieldMergeRuleTest = in_stat_fields.valueAsText\r\n\r\n\t\t\t# messages.addErrorMessage(\"in_stat_fields.values: {0}\".format(in_stat_fields.values))\r\n\t\t\t# messages.addErrorMessage(\"MergeNoFunctionalProperty.relatedTableFieldList: {0}\".format(MergeNoFunctionalProperty.relatedTableFieldList))\r\n\r\n\t\t\t\r\n\r\n\t\t\t\r\n\t\t\t# fieldmappings = in_field_mapping.valueAsText\r\n\r\n\t\t\tlastIndexOFGDB = inputFeatureClassName.rfind(\"\\\\\")\r\n\t\t\tcurrentWorkspace = inputFeatureClassName[:lastIndexOFGDB]\r\n\r\n\t\t\tif currentWorkspace.endswith(\".gdb\") == False:\r\n\t\t\t\tmessages.addErrorMessage(\"Please enter a feature class in file geodatabase for the input feature class.\")\r\n\t\t\t\traise arcpy.ExecuteError\r\n\t\t\telse:\r\n\t\t\t\t# if in_related_table.value:\r\n\t\t\t\tarcpy.env.workspace = currentWorkspace\r\n\t\t\t\t# relatedTableList = UTIL.getRelatedTableFromFeatureClass(inputFeatureClassName)\r\n\t\t\t\t# fieldmappings = arcpy.FieldMappings()\r\n\t\t\t\t# fieldmappings.addTable(inputFeatureClassName)\r\n\t\t\t\t# for relatedTable in relatedTableList:\r\n\t\t\t\t# \tfieldmappings.addTable(relatedTable)\r\n\t\t\t\t# \tfieldList = arcpy.ListFields(relatedTable)\r\n\t\t\t\t# \tfieldName = fieldList[len(fieldList)-1].name\r\n\t\t\t\t# \tarcpy.AddMessage(\"fieldName: {0}\".format(fieldName))\r\n\r\n\r\n\t\t\t\t# fieldmappings.removeFieldMap(fieldmappings.findFieldMapIndex(\"wikiURL\"))\r\n\r\n\t\t\t\t# arcpy.AddMessage(\"fieldmappings: {0}\".format(fieldmappings))\r\n\t\t\t\t# if out_location.value and out_points_name.value:\r\n\t\t\t\t# \tarcpy.FeatureClassToFeatureClass_conversion(inputFeatureClassName, outLocation, outFeatureClassName, \"\", fieldmappings)\r\n\r\n\t\t\t\t# get the ValueTable(fieldName, merge rule, related table full path) \r\n\t\t\t\tfieldMergeRuleFileNameList = []\r\n\r\n\t\t\t\tif fieldMergeRuleTest:\r\n\t\t\t\t\tfieldSplitList = fieldMergeRuleTest.split(\";\")\r\n\t\t\t\t\tfor fieldSplitItem in fieldSplitList:\r\n\t\t\t\t\t\tfieldMergeList = fieldSplitItem.split(\" \", 2)\r\n\t\t\t\t\t\tfieldMergeRuleFileNameList.append(fieldMergeList)\r\n\r\n\t\t\t\tarcpy.AddMessage(\"fieldMergeRuleFileNameList: {0}\".format(fieldMergeRuleFileNameList))\r\n\r\n\t\t\t\tfor fieldMergeRuleFileNameItem in fieldMergeRuleFileNameList:\r\n\t\t\t\t\tappendFieldName = fieldMergeRuleFileNameItem[0]\r\n\t\t\t\t\tmergeRule = fieldMergeRuleFileNameItem[1]\r\n\t\t\t\t\trelatedTableName = fieldMergeRuleFileNameItem[2].replace(\"'\", \"\")\r\n\r\n\t\t\t\t\tnoFunctionalPropertyDict = UTIL.buildMultiValueDictFromNoFunctionalProperty(appendFieldName, relatedTableName)\r\n\t\t\t\t\tif noFunctionalPropertyDict != -1:\r\n\t\t\t\t\t\tUTIL.appendFieldInFeatureClassByMergeRule(inputFeatureClassName, noFunctionalPropertyDict, appendFieldName, relatedTableName, mergeRule)\r\n\r\n\t\t\t\t# UTIL.buildMultiValueDictFromNoFunctionalProperty(fieldName, tableName)\r\n\t\t\t\t# UTIL.appendFieldInFeatureClassByMergeRule(inputFeatureClassName, noFunctionalPropertyDict, appendFieldName, relatedTableName, mergeRule)\r\n\r\n\t\treturn","def FeaturesGen(ChopChopresults, outputDir, sgRNA_type):\n \n #make output Directory if it does not already exist\n if not os.path.isdir(outputDir):\n os.makedirs(outputDir)\n \n #list the directory contents \n for i,j,k in os.walk(ChopChopresults): #use walk to go through and find all directories\n \n if j == []: #no subdirectories\n saveDF = pd.DataFrame() #initiate dataframe\n for target in k: #loop through to find the sgRNA sequences\n if target.endswith('.offtargets'):\n with open(os.path.join(i,target), 'r+') as f:\n guide = f.readlines()\n #add them to a dataframe\n temp = pd.Series()\n temp['guideNo'] = target.split('.')[0] + sgRNA_type\n temp['guideSeq'] = guide.pop(0).rstrip()\n \n saveDF = saveDF.append(temp.to_frame().transpose())\n saveDF['type'] = 'sgRNA'\n \n if sgRNA_type == 'General' or sgRNA_type == None:\n saveDF['fwd'] = 'pink'\n saveDF['rev'] = 'green'\n elif sgRNA_type == 'GG':\n saveDF['fwd'] = 'yellow'\n saveDF['rev'] = 'plum'\n elif sgRNA_type == 'GA':\n saveDF['fwd'] = 'cyan'\n saveDF['rev'] = 'cornflower blue'\n \n \n #save to txt file with tab delimiter\n saveDF.to_csv(os.path.join(outputDir, os.path.basename(i) + '_features.txt'),\\\n index = False, header = False, sep = '\\t')\n \n del saveDF","def _build_legs(self):\n if self._primary_mode == 'transit':\n for transit_leg in self._best_trip.get_transit_legs():\n self._legs.append(transit_leg.get_directions())\n else:\n self._legs.append(self._best_trip.get_directions())","def Point_to_FeatureClass(self, fc):\n\n\n feature_class = []\n for index, traectory in enumerate(self.__traectory_list):\n point_row = arcpy.Point(X=traectory[0], Y=traectory[1], Z=traectory[2], ID=index)\n feature_class.append(arcpy.PointGeometry(point_row, arcpy.SpatialReference(2436)))\n arcpy.CopyFeatures_management(feature_class, (self.workspace + '\\\\' + fc))\n print 'Complete Creating a Point Feature Class'\n\n return None","def roadSegments(locations, API_key=\"Avah46_M-gfFeQ3P1w09Qq1ElAV9ZEHFDm9b8JRCRa8qPP5uVn21hDqAPVJgV4i_\"): \n \n # Base URL\n uri = 'http://dev.virtualearth.net/' # Resource URL \n path = 'REST/v1/Routes?'\n \n \n # URL Parameters\n params = { 'wayPoint.0' : locations[0]+',Singapore',\n 'wayPoint.1' : locations[1]+',Singapore',\n 'routeAttributes':'routePath',\n 'key' : API_Key} # by default 'optimize' : 'time'} # this is by default\n \n url = uri+path\n\n results = requests.get(\n url,\n params = params\n ).json()# ['resourceSets']\n\n # Retrieving values\n statusCode = results['statusCode']\n if statusCode == 200:\n # print(statusCode)\n\n # TODO review the exceptions and modify these basic exception handlings\n try:\n travelDistance = results['resourceSets'][0]['resources'][0]['travelDistance']\n except:\n travelDistance = 0\n try:\n travelDuration = results['resourceSets'][0]['resources'][0]['travelDuration']\n except:\n travelDuration = 0\n try:\n travelDurationTraffic = results['resourceSets'][0]['resources'][0]['travelDurationTraffic']\n except:\n travelDurationTraffic = 0\n\n try:\n numberSegments = len(results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\n ['itineraryItems'])\n except:\n numberSegments = 0\n try:\n itineraryItems = results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\n ['itineraryItems']\n except:\n itineraryItems = 'No items'\n\n pathCoord = results['resourceSets'][0]['resources'][0]['routePath']['line']['coordinates']\n\n roadName = []\n travelDistances = []\n travelDurations = []\n maneuverType = []\n\n for seg in itineraryItems:\n for i in range(len(seg['details'])):\n # print(i)\n try:\n roadName.append(seg['details'][i]['names'])\n except:\n roadName.append(0)\n try:\n travelDistances.append(seg['travelDistance'])\n except:\n travelDistances.append(0)\n\n try:\n travelDurations.append(seg['travelDuration'])\n except:\n travelDurations.append(0)\n try:\n maneuverType.append(seg['details'][i]['maneuverType'])\n except:\n maneuverType.append(0)\n\n\n return statusCode,travelDistance,travelDuration,travelDurationTraffic,numberSegments,roadName, \\\n travelDistances, travelDurations, maneuverType, pathCoord\n\n else:\n print(\"Unsuccessful route calculation.\")","def collect_ftmap(cls):\n for obj in pm.get_object_list():\n if obj.endswith(\".pdb\"):\n new_name = obj[:-4].replace(\"crosscluster\", \"consensus\")\n pm.set_name(obj, new_name)\n yield from cls.collect()","def obj_feature_map(self, features, rois):\n feature_pool = RoIAlignFunction(self.pooling_size, self.pooling_size, spatial_scale=1 / 16)(self.compress(features) if self.use_resnet else features, rois)\n return self.roi_fmap(feature_pool.view(rois.size(0), -1))","def main():\n state = sys.argv[1]\n metaPath = root.joinpath(\"outputs\",\"groundwater\",\"csv\",state+\"_metadata.log\")\n outputsPath = root.joinpath(\"outputs\",\"groundwater\")\n \n logging.basicConfig(level=logging.INFO,\n format='%(asctime)s %(message)s',\n datefmt='%m/%d/%Y %I:%M:%S %p',\n handlers=[logging.FileHandler(str(metaPath))],\n )\n \n logging.info(\"preProcessing '%s' dataset\",state)\n path,metacols = gwcfg.get_params(state)\n \n # Initialize Well Data Object (which has self.df and self.gdf (geodataframe))\n gwObj = gwmod.WellDataObj(path,metacols)\n logging.info(\"original df and gdf initialized, shape: %s\",str(gwObj.df.shape))\n \n # Subset gdf to a single state\n gwObj.subset_gdf(state)\n logging.info(\"single state subsetted : %s , no of records: %d\",state,len(gwObj.gdf))\n \n # Remove Duplicates (entire row) ,Remove Null Data Rows, Drop Duplicate geometries\n num_dups,num_nulls,num_geom_dups = gwObj.pre_process()\n logging.info(\"number of duplicates found & dropped: %d \\\n number of nulls found & dropped: %d \\\n number of duplicate geometries found & dropped: %d\",num_dups,num_nulls,num_geom_dups)\n \n # Save processed dataframe to CSV , SHP(without data) and SHP(with data) \n dfPath = outputsPath.joinpath(\"csv\", (state + '_processed' + path.suffix))\n gdfPath = outputsPath.joinpath(\"shapefiles\", (state + '_processed' + \".shp\"))\n gdfPathwData = outputsPath.joinpath(\"shapefiles\", (state + '_processed_wData' + \".shp\"))\n \n gwObj.df.to_csv(dfPath,index=False)\n logging.info(\"saved df to CSV\")\n gwObj.gdf.geometry.to_file(gdfPath,index=False)\n logging.info(\"saved gdf (only geometries) to SHP\")\n gwObj.gdf.to_file(gdfPathwData,index=False)\n logging.info(\"saved gdf (with data) to SHP\")","def obj_feature_map(self, features, rois):\n feature_pool = RoIAlignFunction(self.pooling_size, self.pooling_size, spatial_scale=1 / 16)(features, rois)\n return self.roi_fmap_obj(feature_pool.view(rois.size(0), -1))","def _extract_features(self):\n # print(os.getpid())\n return {n:self._extract_feature(f) for (n,f) in self.features.items()}","def chunk_user_route(detail_of_trip):\n\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\n # since I can't get javascript to load, here's a hacky way of loading json\n # that details the route based on the user's point A and point B\n # detail_of_trip = api.directions(\n # (40.760350, -73.976209),\n # (40.754009, -73.981097),\n # mode=\"walking\"\n # )[0]\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\n\n # now that I have javascript sending over the json, load json that details\n # the route based on the user's point A and point B\n\n # -------------- This section is for interpolation/splitting using shapely\n first = True # to see if this is the start position for the entire route\n line_points = [] # stores all the points to the route based on dict passed\n\n for leg in detail_of_trip['legs']:\n for step in leg['steps']:\n # Create a list of two element lists that represent points along the\n # route. via google. line_points = [ [lat1, lng1], [lat2, lng2],...]\n # Only add the starting point the first time. Every other iteration\n # we will just tack on the end points to our line.\n if first:\n line_points.append([step['start_location']['lat'], step['start_location']['lng']])\n first = False\n line_points.append([step['end_location']['lat'], step['end_location']['lng']])\n\n # Now load those points into a geometry, here shapely's LineString type.\n route_line = LineString(line_points)\n return (route_line, line_points)","def wfs_common(request, response, mode, spatial_mode='wfs'):\n\n outputpath = configuration.get_config_value('server', 'outputpath')\n outputurl = configuration.get_config_value('server', 'outputurl')\n\n list_of_files = []\n for one_resource in request.inputs['resource']:\n # Download if not opendap\n # Adding a maximum file size from a server config file would\n # be possible here...\n try:\n nc_file = opendap_or_download(\n one_resource.data,\n auth_tkt_cookie=request.http_request.cookies,\n output_path='/tmp')\n except:\n raise Exception(traceback.format_exc())\n list_of_files.append(nc_file)\n\n if ('typename' in request.inputs) and ('featureids' in request.inputs):\n typename = request.inputs['typename'][0].data\n features = [f.data for f in request.inputs['featureids']]\n if 'geoserver' in request.inputs:\n geoserver = request.inputs['geoserver'][0].data\n else:\n geoserver = configuration.get_config_value('extra', 'geoserver')\n if 'mosaic' in request.inputs:\n mosaic = request.inputs['mosaic'][0].data\n else:\n mosaic = False\n try:\n conn = WebFeatureService(url=geoserver, version='2.0.0')\n resp = conn.getfeature([typename], featureid=features,\n outputFormat='application/json')\n feature = json.loads(resp.read())\n crs_code = owslib.crs.Crs(\n feature['crs']['properties']['name']).code\n crs = ocgis.CoordinateReferenceSystem(epsg=crs_code)\n geom = [\n {'geom': shape(f['geometry']), 'crs': crs,\n 'properties': f['properties']}\n for f in feature['features']]\n except Exception as e:\n msg = ('Failed to fetch features.\\ngeoserver: {0} \\n'\n 'typename: {1}\\nfeatures {2}\\n{3}').format(\n geoserver, typename, features, e)\n raise Exception(msg)\n if mosaic:\n new_geom = geom[0]\n for merge_geom in geom[1:]:\n new_geom['geom'] = new_geom['geom'].union(merge_geom['geom'])\n new_geom['properties'] = {'bbox': feature['bbox']}\n geom = new_geom\n elif spatial_mode == 'bbox':\n geom = [[request.inputs['lon0'][0].data,\n request.inputs['lat0'][0].data,\n request.inputs['lon1'][0].data,\n request.inputs['lat1'][0].data]]\n else:\n geom = [None]\n\n if ('initial_datetime' in request.inputs) and \\\n ('final_datetime' in request.inputs):\n tr = [request.inputs['initial_datetime'][0].data,\n request.inputs['final_datetime'][0].data]\n else:\n tr = None\n\n try:\n output_files = []\n output_urls = []\n mv_dir = tempfile.mkdtemp(dir=outputpath)\n os.chmod(mv_dir, 0755)\n\n for one_file in list_of_files:\n file_name = os.path.basename(one_file)\n if file_name[-3:] == '.nc':\n file_prefix = file_name[:-3]\n else:\n file_prefix = file_name\n ocgis.env.DIR_OUTPUT = tempfile.mkdtemp(dir=os.getcwd())\n ocgis.env.OVERWRITE = True\n nc = netCDF4.Dataset(one_file, 'r')\n var_names = guess_main_variables(nc)\n nc.close()\n rd = ocgis.RequestDataset(one_file, var_names)\n for i, one_geom in enumerate(geom):\n if one_geom is None:\n ocgis_geom = None\n elif spatial_mode == 'bbox':\n ocgis_geom = one_geom\n else:\n ocgis_geom = one_geom['geom']\n if mode == 'averager':\n # Extent errors are ignored\n try:\n # Here with aggregate=True, can't pass the whole\n # one_geom dictionary, is this a sign that this does\n # not support multipolygon?\n ops = ocgis.OcgOperations(\n dataset=rd, geom=ocgis_geom,\n spatial_operation='clip', aggregate=True,\n time_range=tr, output_format='nc',\n interpolate_spatial_bounds=True,\n prefix=file_prefix).execute()\n except ExtentError:\n continue\n elif mode == 'subsetter':\n # Extent errors are ignored\n try:\n # Still having problem with the geometry, previously\n # was passing geom=[one_geom]\n ops = ocgis.OcgOperations(\n dataset=rd, geom=ocgis_geom, time_range=tr,\n output_format='nc',\n interpolate_spatial_bounds=True,\n prefix=file_prefix).execute()\n except ExtentError:\n continue\n # Here, the global attribute 'subset_typename' and\n # 'subset_featureid' are added to the NetCDF file to keep\n # track of the feature used.\n if (geom != [None]) and (spatial_mode == 'wfs'):\n with netCDF4.Dataset(ops, 'a') as nc:\n nc.subset_typename = typename\n nc.subset_featureid = features[i]\n\n if (spatial_mode == 'wfs') and \\\n ('featureids' in request.inputs):\n mv_name = '{0}_{1}.nc'.format(\n os.path.basename(ops)[:-3], features[i])\n else:\n mv_name = '{0}_{1}.nc'.format(\n os.path.basename(ops)[:-3], 'subset')\n\n mv_file = os.path.join(mv_dir, mv_name)\n shutil.move(ops, mv_file)\n output_files.append(mv_file)\n shutil.rmtree(ocgis.env.DIR_OUTPUT)\n\n # Cover the case of an online wps server and the offline\n # mode for tests.\n if outputurl == 'file:///tmp':\n disk_file = 'file:///' + mv_file.lstrip('/')\n output_urls.append(disk_file)\n else:\n url_file = os.path.join(\n outputurl, os.path.basename(mv_dir), mv_name)\n output_urls.append(url_file)\n except:\n raise Exception(traceback.format_exc())\n\n # If only ExtentError occured, the output_urls will be empty...\n if not output_urls:\n raise ExtentError(message=\"All ocgis calls returned ExtentError.\")\n\n time_str = time.strftime(\"%Y-%m-%dT%H:%M:%SZ\", time.gmtime())\n output_file_name = \"result_%s_.json\" % (time_str,)\n output_file = os.path.join('/tmp', output_file_name)\n f1 = open(output_file, 'w')\n f1.write(json.dumps(output_urls))\n f1.close()\n response.outputs['output'].file = output_file\n response.outputs['output'].output_format = json_format\n response.update_status(\"done\", 100)\n return response","def merge_global_features(global_features_list: List[Optional[kapture.GlobalFeatures]],\n global_features_paths: List[str], output_path: str,\n tar_handlers: List[TarCollection]) -> kapture.GlobalFeatures:\n features = _merge_image_features(kapture.GlobalFeatures, global_features_list, global_features_paths,\n output_path, tar_handlers)\n assert isinstance(features, kapture.GlobalFeatures)\n return features","def bulk_train(self):\n logger.info(\"collecting subfolders - relations\")\n relations = self.collect_subfolders(self.input_dir)\n logger.info(\"relations - {}\".format(relations))\n\n execution_times = []\n\n for rel, rel_path in tqdm(relations.items(), desc=\"relations\"):\n logger.info(\"collecting training files from {}\".format(rel_path))\n tr_files = self.collect_files(rel_path, self.regexp_train)\n hyper_params = self.get_hyperparams()\n hyper_params['graph'] = tr_files\n\n output_folder = os.path.join(self.output_dir, rel)\n if not os.path.exists(output_folder):\n logger.info(\"creating {} (did not exist)\".format(output_folder))\n os.makedirs(output_folder)\n\n for params in tqdm(ParameterGrid(hyper_params), desc=\"training embedding\"):\n logger.info(\"hyperparams: {}\".format(params))\n train_file = params['graph']\n model_name = self.compute_model_name(params, output_folder)\n logger.info('training starspace model \"{}\" from file \"{}\"'.format(\n model_name, train_file))\n external_output, delta = self.call_starspace(params, train_file, model_name)\n logger.info(\"executed in {:0.2f}s\".format(delta))\n\n logger.info(\"external command output logged in {}\".format(self.external_log))\n if not os.path.exists(self.output_dir):\n logger.info(\"creating {} (did not exist)\".format(self.output_dir))\n os.makedirs(self.output_dir)\n\n with open(self.external_log, 'a') as f:\n f.write(external_output)\n\n execution_times.append(dict({ 'time': delta }, **params))\n \n return execution_times","def execute(self, parameters, messages):\r\n\t\tin_buf_query_center = parameters[0]\r\n\t\tin_place_type = parameters[1]\r\n\t\tin_is_directed_instance = parameters[2]\r\n\t\tin_radius = parameters[3]\r\n\t\tout_location = parameters[4]\r\n\t\tout_points_name = parameters[5]\r\n\t\tout_place_type_url = parameters[6]\r\n\r\n\t\tinBufCenter = in_buf_query_center.valueAsText\r\n\t\tinPlaceType = in_place_type.valueAsText\r\n\t\tsearchRadius = in_radius.valueAsText\r\n\t\toutLocation = out_location.valueAsText\r\n\t\toutFeatureClassName = out_points_name.valueAsText\r\n\t\t\r\n\t\tisDirectInstance = False\r\n\t\t\r\n\t\tif in_is_directed_instance.valueAsText == 'true':\r\n\t\t\tisDirectInstance = True\r\n\t\telif in_is_directed_instance.valueAsText == 'false':\r\n\t\t\tisDirectInstance = False\r\n\r\n\t\t# arcpy.AddMessage((\"in_is_directed_instance.valueAsText: {0}\").format(in_is_directed_instance.valueAsText))\r\n\r\n\t\r\n\t\tif \".gdb\" in outLocation:\r\n\t\t\t# if the outputLocation is a file geodatabase, cancatnate the outputlocation with outFeatureClassName to create a feature class in current geodatabase\r\n\t\t\tout_path = os.path.join(outLocation,outFeatureClassName)\r\n\t\telse:\r\n\t\t\t# if the outputLocation is a folder, creats a shapefile in this folder\r\n\t\t\tout_path = os.path.join(outLocation,outFeatureClassName) + \".shp\"\r\n\t\t\t# however, Relationship Class must be created in a geodatabase, so we forbid to create a shapfile\r\n\t\t\t# messages.addErrorMessage(\"Please enter a file geodatabase as output location in order to create a relation class\")\r\n\t\t\t# raise arcpy.ExecuteError\r\n\t\t\t\r\n\r\n\r\n\t\tmessages.addMessage(\"outpath: {0}\".format(out_path))\r\n\r\n\t\tselectedURL = out_place_type_url.valueAsText\r\n\r\n\t\t# messages.addMessage(\"len(self.entityTypeLabel): {0}\".format(len(self.entityTypeLabel)))\r\n\r\n\t\t# for i in range(len(self.entityTypeLabel)):\r\n\t\t# \tmessages.addMessage(\"Label: {0}\".format(self.entityTypeLabel[i]))\r\n\t\t# \tif inPlaceType == self.entityTypeLabel[i]:\r\n\t\t# \t\tselectedURL = self.entityTypeURLList[i]\r\n\r\n\t\tmessages.addMessage(\"selectedURL: {0}\".format(selectedURL))\r\n\r\n\t\t# Create a FeatureSet object and load in_memory feature class\r\n\t\tin_feature_set = arcpy.FeatureSet()\r\n\t\tin_feature_set.load(inBufCenter)\r\n\t\tin_feature_set_json = json.loads(in_feature_set.JSON)\r\n\r\n\t\t# messages.addMessage(\"Points: {0}\".format(json.loads(in_feature_set.JSON)))\r\n\r\n\t\t# messages.addMessage(\"Point: {0}\".format(json.loads(in_feature_set.JSON)['spatialReference']['wkid']))\r\n\r\n\t\tWGS84Reference = arcpy.SpatialReference(4326)\r\n\t\tcurrentSpatialReference = arcpy.SpatialReference(in_feature_set_json['spatialReference']['latestWkid'])\r\n\r\n\t\t# a set of unique Coordinates for each input points\r\n\t\t# searchCoordsSet = Set()\r\n\t\tsearchCoordsSet = []\r\n\t\r\n\t\tfor i in range(len(in_feature_set_json['features'])):\r\n\t\t\tlat = in_feature_set_json['features'][i]['geometry']['y']\r\n\t\t\tlng = in_feature_set_json['features'][i]['geometry']['x']\r\n\t\t\tcoords = [lng, lat]\r\n\t\t\tsearchCoordsSet.append(coords)\r\n\t\t# \tif i == 0:\r\n\t\t# \t\tsearchCoordsSet.append(coords)\r\n\t\t# \telse:\r\n\t\t# \t\tif coords not in searchCoordsSet:\r\n\t\t# \t\t\tsearchCoordsSet.add(coords)\r\n\r\n\r\n\t\t# searchCoordsSet = List(searchCoordsSet)\r\n\r\n\t\t# a set of unique Coordinates for each found places\r\n\t\tplaceIRISet = Set()\r\n\t\tplaceList = []\r\n\r\n\t\tfor coord in searchCoordsSet:\r\n\t\t\tlat = coord[1]\r\n\t\t\tlng = coord[0]\r\n\r\n\t\t# lat = in_feature_set_json['features'][0]['geometry']['y']\r\n\t\t# lng = in_feature_set_json['features'][0]['geometry']['x']\r\n\r\n\t\t\tif in_feature_set_json['spatialReference']['wkid'] != '4326' or in_feature_set_json['spatialReference']['latestWkid'] != '4326':\r\n\t\t\t\tWGS84PtGeometry = arcpy.PointGeometry(arcpy.Point(lng, lat), currentSpatialReference).projectAs(WGS84Reference)\r\n\t\t\t\t# messages.addMessage(\"My Coordinates: {0}\".format(WGS84PtGeometry.WKT))\r\n\t\t\t\tcoordList = re.split(\"[( )]\", WGS84PtGeometry.WKT)\r\n\t\t\t\tlat = coordList[3]\r\n\t\t\t\tlng = coordList[2]\r\n\r\n\t\t\tqueryPrefix = \"\"\"PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>\r\n\t\t\t\t\t\t\t\t\tPREFIX rdfs: <http://www.w3.org/2000/01/rdf-schema#>\r\n\t\t\t\t\t\t\t\t\tPREFIX owl: <http://www.w3.org/2002/07/owl#>\r\n\t\t\t\t\t\t\t\t\tPREFIX geo-pos: <http://www.w3.org/2003/01/geo/wgs84_pos#>\r\n\t\t\t\t\t\t\t\t\tPREFIX omgeo: <http://www.ontotext.com/owlim/geo#>\r\n\t\t\t\t\t\t\t\t\tPREFIX dbpedia: <http://dbpedia.org/resource/>\r\n\t\t\t\t\t\t\t\t\tPREFIX dbp-ont: <http://dbpedia.org/ontology/>\r\n\t\t\t\t\t\t\t\t\tPREFIX ff: <http://factforge.net/>\r\n\t\t\t\t\t\t\t\t\tPREFIX om: <http://www.ontotext.com/owlim/>\r\n\t\t\t\t\t\t\t\t\tPREFIX wikibase: <http://wikiba.se/ontology#>\r\n\t\t\t\t\t\t\t\t\tPREFIX bd: <http://www.bigdata.com/rdf#>\r\n\t\t\t\t\t\t\t\t\tPREFIX wdt: <http://www.wikidata.org/prop/direct/>\r\n\t\t\t\t\t\t\t\t\tPREFIX geo: <http://www.opengis.net/ont/geosparql#>\"\"\"\r\n\r\n\t\t\tif selectedURL != None:\r\n\t\t\t\tquery = queryPrefix + \"\"\"SELECT distinct ?place ?placeLabel ?distance ?location\r\n\t\t\t\t\t\t\t\t\t\tWHERE {\r\n\t\t\t\t\t\t\t\t\t\t# geospatial queries\r\n\t\t\t\t\t\t\t\t\t\tSERVICE wikibase:around {\r\n\t\t\t\t\t\t\t\t\t\t# get the coordinates of a place\r\n\t\t\t\t\t\t\t\t\t\t?place wdt:P625 ?location .\r\n\t\t\t\t\t\t\t\t\t\t# create a buffer around (-122.4784360859997 37.81826788900048)\r\n\t\t\t\t\t\t\t\t\t\tbd:serviceParam wikibase:center \"Point(\"\"\" + str(lng) + \"\"\" \"\"\" + str(lat) + \"\"\")\"^^geo:wktLiteral .\r\n\t\t\t\t\t\t\t\t\t\t# buffer radius 2km\r\n\t\t\t\t\t\t\t\t\t\tbd:serviceParam wikibase:radius '\"\"\"+searchRadius+\"\"\"' .\r\n\t\t\t\t\t\t\t\t\t\tbd:serviceParam wikibase:distance ?distance .\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t# retrieve the English label\r\n\t\t\t\t\t\t\t\t\t\tSERVICE wikibase:label {bd:serviceParam wikibase:language \"en\". ?place rdfs:label ?placeLabel .}\"\"\"\r\n\t\t\t\tif isDirectInstance == False:\r\n\t\t\t\t\tquery +=\t\t\t\"\"\"?place wdt:P31 ?placeFlatType.\r\n\t\t\t\t\t\t\t\t\t\t?placeFlatType wdt:P279* <\"\"\" + selectedURL + \"\"\">.\"\"\"\r\n\t\t\t\telse:\r\n\t\t\t\t\tquery +=\t\t\t\"\"\"?place wdt:P31 <\"\"\" + selectedURL + \"\"\">.\"\"\"\r\n\r\n\r\n\t\t\t\t\t\t\t\t\t\t# show results ordered by distance\r\n\t\t\t\tquery +=\t\t\t\t\"\"\"} ORDER BY ?distance\"\"\"\r\n\t\t\telse:\r\n\t\t\t\tquery = queryPrefix + \"\"\"SELECT distinct ?place ?placeLabel ?distance ?location \r\n\t\t\t\t\t\t\t\t\t\tWHERE {\r\n\t\t\t\t\t\t\t\t\t\t# geospatial queries\r\n\t\t\t\t\t\t\t\t\t\tSERVICE wikibase:around {\r\n\t\t\t\t\t\t\t\t\t\t# get the coordinates of a place\r\n\t\t\t\t\t\t\t\t\t\t?place wdt:P625 ?location .\r\n\t\t\t\t\t\t\t\t\t\t# create a buffer around (-122.4784360859997 37.81826788900048)\r\n\t\t\t\t\t\t\t\t\t\tbd:serviceParam wikibase:center \"Point(\"\"\" + str(lng) + \"\"\" \"\"\" + str(lat) + \"\"\")\"^^geo:wktLiteral .\r\n\t\t\t\t\t\t\t\t\t\t# buffer radius 2km\r\n\t\t\t\t\t\t\t\t\t\tbd:serviceParam wikibase:radius '\"\"\"+searchRadius+\"\"\"' .\r\n\t\t\t\t\t\t\t\t\t\tbd:serviceParam wikibase:distance ?distance .\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t# retrieve the English label\r\n\t\t\t\t\t\t\t\t\t\tSERVICE wikibase:label {bd:serviceParam wikibase:language \"en\". ?place rdfs:label ?placeLabel .}\r\n\t\t\t\t\t\t\t\t\t\t?place wdt:P31 ?placeFlatType.\r\n\t\t\t\t\t\t\t\t\t\t?placeFlatType wdt:P279* wd:Q2221906.\r\n\r\n\t\t\t\t\t\t\t\t\t\t# show results ordered by distance\r\n\t\t\t\t\t\t\t\t\t\t} ORDER BY ?distance\"\"\"\r\n\r\n\t\t\tsparqlParam = {'query': query, 'format': 'json'}\r\n\t\t\t\r\n\t\t\tsparqlRequest = requests.get('https://query.wikidata.org/sparql', params=sparqlParam)\r\n\r\n\t\t\tprint(sparqlRequest.url)\r\n\t\t\tmessages.addMessage(\"SPARQL: {0}\".format(sparqlRequest.url))\r\n\t\t \r\n\t\t\t\r\n\t\t\tbufferQueryResult = sparqlRequest.json()[\"results\"][\"bindings\"]\r\n\r\n\t\t\t# if len(bufferQueryResult) == 0:\r\n\t\t\t# \tmessages.addMessage(\"No {0} nearby the clicked place can be finded!\".format(inPlaceType))\r\n\t\t\t# \t# pythonaddins.MessageBox(\"No \" + inPlaceType + \" nearby the clicked place can be finded!\",\r\n\t\t\t# \t# \"Warning Message\", 0)\r\n\t\t\t# else:\r\n\r\n\t\t\tfor item in bufferQueryResult:\r\n\t\t\t\tprint \"%s\\t%s\\t%s\\t%s\" % (\r\n\t\t\t\t\titem[\"place\"][\"value\"], item[\"placeLabel\"][\"value\"], item[\"distance\"][\"value\"],\r\n\t\t\t\t\titem[\"location\"][\"value\"])\r\n\t\t\t\tif len(placeIRISet) == 0 or item[\"place\"][\"value\"] not in placeIRISet:\r\n\t\t\t\t\tplaceIRISet.add(item[\"place\"][\"value\"])\r\n\t\t\t\t\tcoordItem = item[\"location\"][\"value\"]\r\n\t\t\t\t\tcoordList = re.split(\"[( )]\", coordItem)\r\n\t\t\t\t\titemlat = coordList[2]\r\n\t\t\t\t\titemlng = coordList[1]\r\n\t\t\t\t\tplaceList.append(\r\n\t\t\t\t\t\t[item[\"place\"][\"value\"], item[\"placeLabel\"][\"value\"], item[\"distance\"][\"value\"],\r\n\t\t\t\t\t\t itemlat,itemlng])\r\n\r\n\t\tif len(placeList) == 0:\r\n\t\t\tmessages.addMessage(\"No {0} nearby the input point(s) can be finded!\".format(inPlaceType))\r\n\t\telse:\r\n\t\t\t# Spatial reference set to GCS_WGS_1984\r\n\t\t\tspatial_reference = arcpy.SpatialReference(4326)\r\n\t\t\t# creat a Point feature class in arcpy\r\n\t\t\tpt = arcpy.Point()\r\n\t\t\tptGeoms = []\r\n\t\t\tfor p in placeList:\r\n\t\t\t\tpt.X = float(p[4])\r\n\t\t\t\tpt.Y = float(p[3])\r\n\t\t\t\tpointGeometry = arcpy.PointGeometry(pt, spatial_reference)\r\n\t\t\t\tptGeoms.append(pointGeometry)\r\n\r\n\t\t\t# out_path = pythonaddins.SaveDialog(\"Save Nearby Places\", \"placeNear\",\r\n\t\t\t# os.path.dirname(arcpy.mapping.MapDocument(\"current\").filePath),\r\n\t\t\t# FileGDBSave())\r\n\r\n\t\t\tif out_path == None:\r\n\t\t\t\tmessages.addMessage(\"No data will be added to the map document.\")\r\n\t\t\t\t# pythonaddins.MessageBox(\"No data will be added to the map document.\", \"Warning Message\", 0)\r\n\t\t\telse:\r\n\t\t\t\t# create a geometry Feature class to represent \r\n\t\t\t\tplaceNearFeatureClass = arcpy.CopyFeatures_management(ptGeoms, out_path)\r\n\r\n\t\t\t\tlabelFieldLength = Json2Field.fieldLengthDecide(bufferQueryResult, \"placeLabel\")\r\n\t\t\t\tarcpy.AddMessage(\"labelFieldLength: {0}\".format(labelFieldLength))\r\n\t\t\t\t# add field to this point feature class\r\n\t\t\t\tarcpy.AddField_management(placeNearFeatureClass, \"Label\", \"TEXT\", field_length=labelFieldLength)\r\n\t\t\t\tarcpy.AddField_management(placeNearFeatureClass, \"URL\", \"TEXT\", field_length=100)\r\n\t\t\t\t# arcpy.AddField_management(placeNearFeatureClass, \"TypeURL\", \"TEXT\", field_length=50)\r\n\t\t\t\t# arcpy.AddField_management(placeNearFeatureClass, \"TypeName\", \"TEXT\", field_length=50)\r\n\t\t\t\t# if selectedURL != None:\r\n\t\t\t\t# \tarcpy.AddField_management(placeNearFeatureClass, \"BTypeURL\", \"TEXT\", field_length=50)\r\n\t\t\t\t# \tarcpy.AddField_management(placeNearFeatureClass, \"BTypeName\", \"TEXT\", field_length=50)\r\n\t\t\t\t# arcpy.AddField_management(placeNearFeatureClass, \"Latitude\", \"TEXT\", 10, 10)\r\n\t\t\t\t# arcpy.AddField_management(placeNearFeatureClass, \"Longitude\", \"TEXT\", 10, 10)\r\n\r\n\t\t\t\tarcpy.AddXY_management(placeNearFeatureClass)\r\n\t\t\t\t# add label, latitude, longitude value to this point feature class\r\n\r\n\t\t\t\ti = 0\r\n\t\t\t\tcursor = arcpy.UpdateCursor(out_path)\r\n\t\t\t\trow = cursor.next()\r\n\t\t\t\twhile row:\r\n\t\t\t\t\trow.setValue(\"Label\", placeList[i][1])\r\n\t\t\t\t\trow.setValue(\"URL\", placeList[i][0])\r\n\t\t\t\t\t# row.setValue(\"TypeURL\", placeList[i][5])\r\n\t\t\t\t\t# row.setValue(\"TypeName\", placeList[i][6])\r\n\t\t\t\t\tcursor.updateRow(row)\r\n\t\t\t\t\ti = i + 1\r\n\t\t\t\t\trow = cursor.next()\r\n\r\n\t\t\t\t# if selectedURL != None:\r\n\t\t\t\t# \ti = 0\r\n\t\t\t\t# \tcursor = arcpy.UpdateCursor(out_path)\r\n\t\t\t\t# \trow = cursor.next()\r\n\t\t\t\t# \twhile row:\r\n\t\t\t\t# \t\trow.setValue(\"BTypeURL\", selectedURL)\r\n\t\t\t\t# \t\trow.setValue(\"BTypeName\", inPlaceType)\r\n\t\t\t\t# \t\tcursor.updateRow(row)\r\n\t\t\t\t# \t\ti = i + 1\r\n\t\t\t\t# \t\trow = cursor.next()\r\n\r\n\t\t\t\t# get the map document\r\n\t\t\t\t# mxd = arcpy.mapping.MapDocument(\r\n\t\t\t\t# r\"D:\\UCSB_STKO_Lab\\STKO Research\\research\\DBpedia-Search-plugin\\wiki1.mxd\")\r\n\r\n\r\n\r\n\t\t\t\tmxd = arcpy.mapping.MapDocument(\"CURRENT\")\r\n\r\n\t\t\t\t# get the data frame\r\n\t\t\t\tdf = arcpy.mapping.ListDataFrames(mxd)[0]\r\n\r\n\t\t\t\t# create a new layer\r\n\t\t\t\tplaceNearLayer = arcpy.mapping.Layer(out_path)\r\n\r\n\t\t\t\t# add the layer to the map at the bottom of the TOC in data frame 0\r\n\t\t\t\tarcpy.mapping.AddLayer(df, placeNearLayer, \"BOTTOM\")\r\n\r\n\t\treturn","def merge_global_features_collections(global_features_collections_list: List[Optional[Dict[str,\n kapture.GlobalFeatures]]],\n global_features_paths: List[str],\n output_path: str,\n tar_handlers: List[TarCollection]) -> Dict[str, kapture.GlobalFeatures]:\n return _merge_image_features_collection(kapture.GlobalFeatures, global_features_collections_list,\n global_features_paths, output_path, tar_handlers)","def speed_map_segs_to_geojson(seg_list):\n # Initialize a new GeoJSON object\n new_geojson = {\n 'type': 'FeatureCollection',\n 'features': []\n }\n\n # Dont work on the input list\n seg_list_copy = copy.deepcopy(seg_list)\n\n # Iterativley build the features of the new GeoJSON object\n for i, seg in enumerate(seg_list_copy):\n # Prepare the feature properties\n del seg['fromStop']\n del seg['toStop']\n\n # New attribute, can be used to identify segments\n seg['order'] = i\n\n # Prepare the feature geometry coordinates\n pathLocs = seg.pop('pathLocs')\n coords = [[p['lon'], p['lat']] for p in pathLocs]\n\n # Construct feature\n new_feature = {\n 'type': 'Feature',\n 'geometry': {'type': 'LineString', 'coordinates': coords},\n 'properties': seg\n }\n\n # Append feature to the list of features in GeoJSON object\n new_geojson['features'].append(new_feature)\n\n return new_geojson","def _finalize_features(self) -> DataFrameLike:\n all_features_dict = dict(ChainMap(*self._final_features.values()))\n return pd.DataFrame(all_features_dict)","def run(self):\n lineage_csv_gz = self.input_files_local[0][0]\n output_db = self.output_files_local()[0]\n log.write(f\"input: {lineage_csv_gz} output: {output_db}\")\n\n with IdSeqDictForUpdate(output_db, IdSeqDictValue.VALUE_TYPE_ARRAY) as lineage_dict:\n batch_list = {}\n with gzip.open(lineage_csv_gz, \"rt\") as gzf:\n for line in gzf:\n fields = line.rstrip().split(\",\")\n taxid = fields[0]\n species, genus, family = fields[-1:-4:-1]\n batch_list[taxid] = [species, genus, family]\n if len(batch_list) >= BATCH_INSERT_SIZE:\n lineage_dict.batch_inserts(batch_list.items())\n batch_list = {}\n lineage_dict.batch_inserts(batch_list.items())","def finalize(feature, features, obj, source, aipname, cta_aip, restrict_aip, aip_sup, tia_aip):\n global completed\n global country\n global end_notam\n\n feature['properties']['source_href']=source\n feature['properties']['country']=country\n feature['geometry'] = obj\n aipname = wstrip(str(aipname))\n if aipname == 'EN D476':\n aipname = 'EN D476 R og B 1'\n if aipname == 'EN D477':\n aipname = 'EN D477 R og B 2'\n\n if 'ACC' in aipname and country==\"ES\":\n return {\"properties\":{}}, []\n for ignore in ['ADS','AOR','FAB',' FIR','HTZ']:\n if ignore in aipname:\n logger.debug(\"Ignoring: %s\", aipname)\n return {\"properties\":{}}, []\n feature['properties']['name']=aipname\n if cta_aip or aip_sup or tia_aip or 'ACC' in aipname:\n recount = len([f for f in features if aipname in f['properties']['name']])\n recount = recount or len([f for f in accsectors if aipname in f['properties']['name']])\n if recount>0:\n separator = \" \"\n if re.search('\\d$', aipname):\n separator=\"-\"\n # special handling Farris TMA skipping counters\n if \"Farris\" in aipname:\n if recount > 4:\n recount += 2\n else:\n recount += 1\n logger.debug(\"RECOUNT renamed \" + aipname + \" INTO \" + aipname + separator + str(recount+1))\n feature['properties']['name']=aipname + separator + str(recount+1)\n if 'TIZ' in aipname or 'TIA' in aipname:\n feature['properties']['class']='G'\n elif 'CTR' in aipname:\n feature['properties']['class']='D'\n elif 'TRIDENT' in aipname \\\n or 'EN D' in aipname or 'END' in aipname \\\n or 'ES D' in aipname:\n feature['properties']['class']='D'\n elif 'EN R' in aipname \\\n or 'ES R' in aipname or 'ESTRA' in aipname \\\n or 'EUCBA' in aipname or 'RPAS' in aipname:\n feature['properties']['class']='R'\n elif 'TMA' in aipname or 'CTA' in aipname or 'FIR' in aipname \\\n or 'ACC' in aipname or 'ATZ' in aipname or 'FAB' in aipname \\\n or 'Sector' in aipname:\n feature['properties']['class']='C'\n elif '5.5' in source or \"Hareid\" in aipname:\n if \"Nidaros\" in aipname:\n #skip old Nidaros airspace\n return {\"properties\":{}}, []\n feature['properties']['class']='Luftsport'\n index = len(collection)+len(features)\n\n if names.get(aipname):\n logger.debug(\"DUPLICATE NAME: %s\", aipname)\n\n if len(obj)>100:\n logger.debug(\"COMPLEX POLYGON %s with %i points\", feature['properties'].get('name'), len(obj))\n obj=simplify_poly(obj, 100)\n feature['geometry'] = obj\n\n if len(obj)>3:\n logger.debug(\"Finalizing polygon #%i %s with %i points.\", index, feature['properties'].get('name'), len(obj))\n\n name = feature['properties'].get('name')\n source = feature['properties'].get('source_href')\n from_ = feature['properties'].get('from (ft amsl)')\n to_ = feature['properties'].get('to (ft amsl)')\n class_ = feature['properties'].get('class')\n\n\n if name in completed:\n logger.info(\"ERROR Duplicate feature name: #%i %s\", index, name)\n return {\"properties\":{}}, []\n #sys.exit(1)\n else:\n if 'ACC' in aipname:\n logger.debug(\"Writing ACC sector to separate file: %s\", aipname)\n accsectors.append(feature)\n else:\n features.append(feature)\n\n # SANITY CHECK\n if name is None:\n logger.error(\"Feature without name: #%i\", index)\n sys.exit(1)\n if \"None\" in name:\n logger.error(\"Feature without name: #%i\", index)\n sys.exit(1)\n completed[name]=True\n if source is None:\n logger.error(\"Feature without source: #%i\", index)\n sys.exit(1)\n if feature['properties'].get('name') is None:\n logger.error(\"Feature without name: #%i (%s)\", index, source)\n sys.exit(1)\n if class_ is None:\n logger.error(\"Feature without class (boo): #%i (%s)\", index, source)\n sys.exit(1)\n # SPECIAL CASE NOTAM reserved ENR in Oslo area\n if \"EN R\" in aipname and \"Kongsvinger\" in aipname:\n feature['properties']['notam_only'] = 'true'\n if \"EN R\" in aipname and (\"Romerike\" in aipname or (\"Oslo\" in aipname and not \"102\" in aipname)):\n feature['properties']['notam_only'] = 'true'\n feature['properties']['from (ft amsl)'] = '0'\n feature['properties']['to (ft amsl)'] = '99999' # unspecified\n feature['properties']['from (m amsl)'] = '0'\n feature['properties']['to (m amsl)'] = '99999'\n from_ = '0'\n to_ = '0'\n if (\"EN D\" in aipname or \"END\" in aipname) and end_notam:\n feature['properties']['notam_only'] = 'true'\n if from_ is None:\n if \"en_sup_a_2018_015_en\" in source:\n feature['properties']['from (ft amsl)']='0'\n feature['properties']['from (m amsl)']='0'\n from_ = '0'\n else:\n logger.error(\"Feature without lower limit: #%i (%s)\", index, source)\n sys.exit(1)\n if to_ is None:\n if \"en_sup_a_2018_015_en\" in source:\n feature['properties']['to (ft amsl)']='99999'\n feature['properties']['to (m amsl)']='9999'\n to_ = '99999'\n else:\n logger.error(\"Feature without upper limit: #%i (%s)\", index, source)\n sys.exit(1)\n if int(from_) >= int(to_):\n # SPECIAL CASE NOTAM reserved ENR in Oslo area\n if \"en_sup_a_2018_015_en\" in source or \"Romerike\" in aipname or \"Oslo\" in aipname:\n feature['properties']['from (ft amsl)']=to_\n feature['properties']['to (ft amsl)']=from_\n else:\n logger.error(\"Lower limit %s > upper limit %s: #%i (%s)\", from_, to_, index, source)\n sys.exit(1)\n elif len(obj)>0:\n logger.error(\"ERROR Finalizing incomplete polygon #%i (%i points)\", index, len(obj))\n\n names[aipname]=True\n logger.debug(\"OK polygon #%i %s with %i points (%s-%s).\", index, feature['properties'].get('name'),\n len(obj),\n feature['properties'].get('from (ft amsl)'),\n feature['properties'].get('to (ft amsl)'))\n return {\"properties\":{}}, []","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 extract_features(self):\n\n self.feature_paths = dict()\n for feat_type in self.outlier_feat_types:\n try:\n print('Extracting feature type: {}'.format(feat_type))\n self.feature_paths[feat_type] = self.feature_extractor(self, feat_type)\n except:\n traceback.print_exc()\n print('Unable to extract {} features! skipping..'.format(feat_type))","def generate(self):\n i = self.start_index\n df_array = []\n # load the dataframes from the multiple files(one file per frame_id, agent_id pair)\n for k in range(self.frame_length): # segment length\n frame_id = i + k\n # print(frame_id)\n # breakpoint()\n if frame_id >= len(self.agent_maps):\n print(\n f\"Trying to access frame {frame_id} but only have {len(self.agent_maps)}\"\n )\n # breakpoint()\n break\n df = pd.read_csv(self.agent_maps[frame_id], compression=\"gzip\")\n df = df.query(f\"abs(pos_x)<{self.radius} & abs(pos_y)<{self.radius}\")\n df_array.append(df)\n # merge all dataframes together\n if len(df_array) == 0:\n self.df_merged = pd.DataFrame()\n self.agent_tracks = {}\n self.agent_metadata_dfs = {}\n self.agent_track_len = {}\n self.sorted_agent_ids = []\n return\n self.df_merged = pd.concat(df_array).reset_index()\n # group all dataframes by id, so that we can get agent level metrics across time\n agent_grp = self.df_merged.groupby(\"id\")\n self.agent_tracks = {}\n self.agent_metadata_dfs = {}\n self.agent_track_len = {}\n for agent_id in agent_grp.groups:\n sub_df = self.df_merged.iloc[agent_grp.groups[agent_id]]\n # empty template for the trajectories\n tracks = [\n [self.radius + 1, self.radius + 1] for _ in range(self.frame_length)\n ]\n track_len = 0\n # populate the empty template\n for idx, row in sub_df.iterrows():\n frame_idx = row.frame_id - self.start_index\n # if row.frame_id == 0:\n # # check if the object is within the car position add to the current frame\n # print(\"0 frame id\")\n try:\n tracks[frame_idx] = [row.pos_x, row.pos_y]\n except:\n breakpoint()\n track_len += 1\n self.agent_tracks[agent_id] = np.array(tracks)\n self.agent_metadata_dfs[agent_id] = sub_df\n self.agent_track_len[agent_id] = track_len\n self.sorted_agent_ids = list(self.agent_track_len.keys())\n self.sorted_agent_ids.sort(key=lambda x: self.agent_track_len[x], reverse=True)","def _parse_features(self):\n for root in self.roots:\n for feature in root.iter('feature'):\n api = feature.attrib.get('api', '')\n feature_name = feature.attrib.get('name', '')\n feature_number = int(float(feature.attrib.get('number', '')) * 10.0)\n\n # filter by api\n if api != 'gl':\n continue\n\n for require in feature.iter('require'):\n require_profile = require.attrib.get('profile', '')\n if require_profile and require_profile != 'core':\n # filter by profile\n continue\n\n for enum in require.iter('enum'):\n enum_name = enum.attrib.get('name', '')\n self.enum_list.append(enum_name)\n self.enum_required_by_feature[enum_name].append({\n 'api': api,\n 'name': feature_name,\n 'number': feature_number,\n 'profile': require_profile\n })\n for command in require.iter('command'):\n command_name = command.attrib['name']\n self.command_list.append(command_name)\n self.command_required_by_feature[command_name].append({\n 'api': api,\n 'name': feature_name,\n 'number': feature_number,\n 'profile': require_profile\n })\n\n for remove in feature.iter('remove'):\n remove_profile = remove.attrib.get('profile', '')\n if require_profile and require_profile != 'core':\n # filter by profile\n continue\n\n for enum in remove.iter('enum'):\n enum_name = enum.attrib.get('name', '')\n self.enum_removed_by_feature[enum_name].append({\n 'api': api,\n 'name': feature_name,\n 'number': feature_number,\n 'profile': remove_profile\n })\n for command in remove.iter('command'):\n command_name = command.attrib['name']\n self.command_removed_by_feature[command_name].append({\n 'api': api,\n 'name': feature_name,\n 'number': feature_number,\n 'profile': remove_profile\n })","def _process_data(self):\n assert not hasattr(self, 'changes'), '_process_data called twice.'\n assert hasattr(self, 'errors'), (\n '_process_data not called by is_valid().')\n r_by_t = Collection.resource_by_type\n\n # Create and load collection of new data\n new_collection = Collection()\n for rtype, items in self.data.items():\n resource_cls = r_by_t.get(rtype)\n if resource_cls:\n for seq, json_api_item in enumerate(items):\n item = json_api_item.copy()\n links = item.pop('links', {})\n item.update(links)\n resource = self.load_resource(resource_cls, item)\n resource._seq = seq\n new_collection.add(resource)\n\n # Create native representation of current feature data\n current_collection = Collection(DjangoResourceClient())\n feature_serializer = ViewFeatureSerializer(context=self.context)\n current_feature = feature_serializer.to_representation(self.feature)\n current_extra = current_feature.pop('_view_extra')\n del current_extra['meta']\n\n # Load feature into new and current collection\n current_feature_resource = self.load_resource(\n r_by_t['features'], current_feature)\n current_collection.add(current_feature_resource)\n current_feature.update(self.feature._in_extra)\n current_feature['id'] = str(current_feature['id'])\n resource_feature = self.load_resource(\n r_by_t['features'], current_feature)\n resource_feature._seq = None\n new_collection.add(resource_feature)\n\n # Populate collection of current data\n for rtype, items in current_extra.items():\n resource_cls = r_by_t[rtype]\n for item in items:\n resource = self.load_resource(resource_cls, item)\n current_collection.add(resource)\n\n # Add existing items not explicit in PUT content\n # This avoids 'delete' changes\n new_items = new_collection.get_all_by_data_id()\n for data_id, item in current_collection.get_all_by_data_id().items():\n if data_id not in new_items:\n rtype = item._resource_type\n resource = r_by_t[rtype]()\n json_api_rep = item.to_json_api()\n json_api_rep[rtype]['id'] = item.id.id\n resource.from_json_api(json_api_rep)\n resource._seq = None\n new_collection.add(resource)\n\n # Add existing items used in new collection to current collection\n # This avoids incorrect 'new' changes\n existing_items = current_collection.get_all_by_data_id()\n for data_id, item in new_collection.get_all_by_data_id().items():\n if item.id:\n item_id = item.id.id\n int_id = None\n existing_item = existing_items.get(data_id)\n try:\n int_id = int(item_id)\n except ValueError:\n pass\n if int_id and (existing_item is None):\n rtype = item._resource_type\n resource_cls = r_by_t[rtype]\n model_cls, serializer_cls = view_cls_by_name[rtype]\n obj = model_cls.objects.get(id=int_id)\n serializer = serializer_cls()\n data = serializer.to_representation(obj)\n resource = self.load_resource(resource_cls, data)\n current_collection.add(resource)\n\n # Load the diff\n self.changeset = CollectionChangeset(\n current_collection, new_collection)\n assert not self.changeset.changes.get('deleted'), (\n 'Existing items were not added, so deletions found:\\n%s'\n % self.changes['deleted'])","def _update_from_exons(self, feature):\n # note that start and end here are in direction of translation\n def start(loc):\n return loc[0][1]\n\n def end(loc):\n if loc[-1][2] == \"+\":\n return loc[-1][1] + loc[-1][3] + 1\n else:\n return loc[-1][1] - loc[-1][3] - 1\n\n if 'exon' in feature:\n # update the feature with the exon locations and sequences\n feature['location'] = [x['location'][0] for x in feature['exon']]\n feature['dna_sequence'] = \"\".join(\n x['dna_sequence'] for x in feature['exon'])\n feature['dna_sequence_length'] = len(feature['dna_sequence'])\n\n # construct feature location from utrs and cdss if present\n elif 'cds' in feature:\n cds = [copy.deepcopy(self.feature_dict[feature['cds']])]\n locs = [] # type: list\n seq = \"\"\n for frag in feature.get('five_prime_UTR', []) + cds + \\\n feature.get('three_prime_UTR', []):\n\n # merge into last location if adjacent\n if locs and abs(end(locs) - start(frag['location'])) == 1:\n # extend the location length by the length of the first\n # location in the fragment\n first = frag['location'].pop(0)\n locs[-1][3] += first[3]\n\n locs.extend(frag['location'])\n seq += frag['dna_sequence']\n\n feature['location'] = locs\n feature['dna_sequence'] = seq\n feature['dna_sequence_length'] = len(seq)\n\n # remove these properties as they are no longer needed\n for x in ['five_prime_UTR', 'three_prime_UTR', 'exon']:\n feature.pop(x, None)\n\n else:\n ValueError('Feature {feature[\"id\"]} must contain either exon or cds data to '\n 'construct an accurate location and sequence')","def generate_feature(self):\n for cmd in self.get_filtered_cmd_names():\n self.command_info[cmd] = self.feature_cmd_params[cmd]","def _parse_pbf(self):\n # todo pyrosm bounding_box is inefficient, first extract bbox from pbf using pyosmium\n osm = pyrosm.OSM(filepath=self._pbf, bounding_box=self._bbox)\n osm.keep_node_info = True\n logging.info(\"Parsing OSM ways and nodes from pbf file\")\n ways = osm.get_network(self._profile)\n\n all_nodes = osm._nodes_gdf # todo this has all the attributes but goes out of memory easily\n way_nodes_ids = ways.nodes.explode().unique().tolist()\n nodes = all_nodes.loc[all_nodes.id.isin(way_nodes_ids)]\n\n def clip_way(way):\n clipped_way = way.copy()\n clipped_way.nodes = clipped_way.nodes[:len(way.geometry.coords.xy[0])-1]\n return clipped_way\n\n broken_ways = ways.nodes.apply(lambda x: not all(n in nodes.id.to_list() for n in x))\n for ix, way in ways.loc[broken_ways].iterrows():\n ways.loc[ix] = clip_way(way)\n\n # all_nodes = osm._node_coordinates\n # way_nodes = {id: all_nodes[id] for id in way_nodes_ids if id in all_nodes.keys()}\n # nodes = pd.DataFrame.from_dict(way_nodes, orient='index', columns=['longitude', 'latitude'])\n # nodes['id'] = nodes.index\n\n # ways_nodes_found = ways.nodes.apply(lambda x: all(n in nodes.id.to_list() for n in x))\n # nodes = pd.DataFrame(columns=['id', 'latitude', 'longitude'])\n # for ix, way in ways.iterrows():\n # way_nodes = pd.DataFrame(columns=['id', 'latitude', 'longitude'])\n # try:\n # way_nodes.id = way.nodes\n # way_nodes.latitude = way.geometry.coords.xy[1]\n # way_nodes.longitude = way.geometry.coords.xy[0]\n # except:\n # pass\n # nodes = nodes.append(way_nodes, ignore_index=True)\n\n logging.info(\"Done parsing pbf file\")\n return nodes, ways","def __surface_labelled_segmentation_pipeline(self, features):\n tic = time.perf_counter()\n\n # Collect the data\n ###########################################\n training_data, dev_data, test_data = {}, {}, {}\n dictionaries = (training_data, dev_data, test_data)\n counter = 0\n for file in self.input_files:\n input_file = open(os.path.join(sys.path[0], file), 'r')\n for line in input_file.readlines():\n content = line.rstrip('\\n').split(\" | \")\n labels = '-'.join(get_labels(content[2]))\n segments = removeLabels(content[2])\n\n # dictionaries[counter][content[0]] = [segments, labels] # word:[[segments],[labels]]\n dictionaries[counter][segments] = labels # segments : labels\n input_file.close()\n counter += 1\n\n toc = time.perf_counter()\n print(\"Data Collected in \" + str(tic - toc.__round__(2)))\n\n # Evaluate Model On the Test Set Using Optimised Model\n #######################################################\n\n print(\"Beginning Feature Computation and Model Optimisation\")\n tic = time.perf_counter()\n\n X_training, Y_training, words_training = surface_labelled_data_preparation(training_data)\n X_dev, Y_dev, words_dev = surface_labelled_data_preparation(dev_data)\n X_test, Y_test, words_test = surface_labelled_data_preparation(test_data)\n print(\"Data Processed\")\n\n best_epsilon = 1e-07\n best_max_iteration = 280\n best_algo = 'ap'\n\n # crf = sklearn_crfsuite.CRF(algorithm=best_algo, epsilon=best_epsilon, max_iterations=best_max_iteration)\n '''crf = sklearn_crfsuite.CRF(\n algorithm='lbfgs',\n c1=0.1,\n c2=0.1,\n max_iterations=100,\n all_possible_transitions=True\n )'''\n crf = sklearn_crfsuite.CRF(algorithm='ap', epsilon=best_epsilon, max_iterations=best_max_iteration)\n print(\"CRF Initialized\")\n # crf.fit(X_training, Y_training, X_dev=X_dev, y_dev=Y_dev)\n crf.fit(X_training, Y_training)\n print(\"Data Fitted\")\n Y_predict = crf.predict(features)\n labels = list(crf.classes_)\n sorted_labels = sorted(labels)\n return Y_predict, Y_test","def compute(self, inputs, outputs):\n\n log.info(f\"Start optimisation iteration: {Rt.counter}\")\n\n # Update the geometry dictionary\n for name, infos in Rt.geom_dict.items():\n infos[1].append(inputs[name][0])\n\n if Rt.counter == 0:\n\n # For the first iteration, update the CPACS file from previous module\n cpacs_in = Rt.modules[0].cpacs_in\n cpacs_out = Rt.modules[0].cpacs_out\n update_cpacs_file(cpacs_in, cpacs_out, Rt.geom_dict)\n\n else:\n\n for m, module in enumerate(Rt.modules):\n\n # Increment name of output CPACS file\n Rt.modules[m].cpacs_out = Path(\n Rt.modules[m].cpacs_out.parents[0],\n \"iter_\" + str(Rt.counter).rjust(2, \"0\") + \".xml\",\n )\n\n if m == 0:\n\n # Use output of the last module of the previous iteration as input\n Rt.modules[m].cpacs_in = Rt.modules[-1].cpacs_out\n\n # Update the geometry of the CPACS file\n cpacs_in = Rt.modules[m].cpacs_in\n cpacs_out = Rt.modules[m].cpacs_out\n update_cpacs_file(cpacs_in, cpacs_out, Rt.geom_dict)\n\n # # The first module of the loop must update its output where the input\n # # was saved because it has been updated by \"update_cpacs_file\" function.\n # Rt.modules[m].cpacs_in = Rt.modules[m].cpacs_out\n\n else:\n\n # Increment name of input CPACS file\n Rt.modules[m].cpacs_in = Path(\n Rt.modules[m].cpacs_in.parents[0],\n \"iter_\" + str(Rt.counter).rjust(2, \"0\") + \".xml\",\n )\n\n Rt.counter += 1","def process(self):\n coo_adj = sp.load_npz(os.path.join(self.raw_path, \"adj_full.npz\"))\n g = from_scipy(coo_adj)\n\n features = np.load(os.path.join(self.raw_path, \"feats.npy\"))\n features = F.tensor(features, dtype=F.float32)\n\n y = [-1] * features.shape[0]\n with open(os.path.join(self.raw_path, \"class_map.json\")) as f:\n class_map = json.load(f)\n for key, item in class_map.items():\n y[int(key)] = item\n labels = F.tensor(np.array(y), dtype=F.int64)\n\n with open(os.path.join(self.raw_path, \"role.json\")) as f:\n role = json.load(f)\n\n train_mask = np.zeros(features.shape[0], dtype=bool)\n train_mask[role[\"tr\"]] = True\n\n val_mask = np.zeros(features.shape[0], dtype=bool)\n val_mask[role[\"va\"]] = True\n\n test_mask = np.zeros(features.shape[0], dtype=bool)\n test_mask[role[\"te\"]] = True\n\n g.ndata[\"feat\"] = features\n g.ndata[\"label\"] = labels\n g.ndata[\"train_mask\"] = generate_mask_tensor(train_mask)\n g.ndata[\"val_mask\"] = generate_mask_tensor(val_mask)\n g.ndata[\"test_mask\"] = generate_mask_tensor(test_mask)\n\n if self._reorder:\n self._graph = reorder_graph(\n g,\n node_permute_algo=\"rcmk\",\n edge_permute_algo=\"dst\",\n store_ids=False,\n )\n else:\n self._graph = g","def add_features(self, fbids):\n if not fbids:\n warnings.warn(\"No fbids provided.\")\n return False\n feats = self.name_synonym_lookup(fbids)\n proc_names = [f._asdict() for f in feats.values()]\n for d in proc_names:\n d['synonyms'] = '|'.join(d['synonyms'])\n statement = \"MERGE (n:Feature:Class { short_form : line.fbid } ) \" \\\n \"SET n.label = line.symbol SET n.synonyms = split(line.synonyms, '|') \" \\\n \"SET n.iri = 'http://flybase.org/reports/' + line.fbid\" # Why not using ni? Can kbw have switch to work via csv?\n self.commit_via_csv(statement, proc_names)\n self.addTypes2Neo(fbids)\n return feats","def combine_all(self):\n combined = copy.deepcopy(self.train)\n\n def _combine_data(data):\n for img_path, pid, camid in data:\n\n if pid in self._junk_pids:\n continue\n #pdb.set_trace()\n pid = self.dataset_name + \"_\" + str(pid)\n camid = self.dataset_name + \"_\" + str(camid)\n combined.append((img_path, pid, camid))\n\n _combine_data(self.query)\n _combine_data(self.gallery)\n\n self.train = combined\n self.num_train_pids = self.get_num_pids(self.train)","def add_features_to_output(m: onnx.ModelProto) -> None:\n del m.graph.output[:]\n m.graph.output.extend(m.graph.value_info)","def _extract_features(self, a_rel, a_parses):\n feats = {}\n doc_id = a_rel[DOC_ID]\n toks_pos1 = self._get_toks_pos(a_parses[doc_id][SENTENCES],\n a_rel, ARG1)\n toks_pos2 = self._get_toks_pos(a_parses[doc_id][SENTENCES],\n a_rel, ARG2)\n self._get_product_rules(feats, doc_id, a_rel, a_parses)\n self._get_dep_rules(feats, doc_id, a_rel, a_parses)\n self._get_first_last_toks(feats, toks_pos1, toks_pos2)\n self._get_modality(feats, toks_pos1, toks_pos2)\n self._get_vb_class(feats, toks_pos1, toks_pos2)\n self._get_brown_clusters(feats, toks_pos1, toks_pos2)\n self._get_inquirer(feats, toks_pos1, toks_pos2)\n self._get_MPQA(feats, toks_pos1, toks_pos2)\n return feats","def target_mapping(self):\n\n map_list = []\n self.bin_tracking_array = self.seg_analyzer.bin_tracking_array\n self.log.info(\"Spawning {0} jobs to begin building Target_Bed_Map_Array for permutation analysis.\"\n .format(self.args.Spawn))\n\n p = pathos.multiprocessing.Pool(int(self.args.Spawn))\n for lst in p.starmap(self.sub_target_mapping,\n zip(itertools.repeat(self.bin_tracking_array), itertools.repeat(self.target_bed_array),\n itertools.repeat(self.args), self.seg_analyzer.chrom_list)):\n\n map_list.extend(lst)\n\n map_list.sort(key=lambda x: x[0])\n\n if eval(self.args.Map_File):\n self.log.info(\"Writing Map File\")\n file_data = \"\"\n map_file = open(\"{0}{1}_{2}_mapfile.txt\"\n .format(self.args.Working_Folder, self.args.Job_Name, self.args.Cell_Name), 'w')\n map_file.write(\"Chrom\\tstart\\tstop\\trefBinID\\ttargetBinID\\ttargetCount\\n\")\n\n for row in sorted(map_list, key=itemgetter(0)):\n\n coord_start = int(self.bin_tracking_array[self.bin_tracking_array[:, 0] == row[0]][0, 2])\n coord_stop = int(self.bin_tracking_array[self.bin_tracking_array[:, 0] == row[0]][0, 3])\n chrom = self.bin_tracking_array[self.bin_tracking_array[:, 0] == row[0]][0, 1].decode()\n r_count = len(row[1])\n file_data += (\"{0}\\t{1}\\t{2}\\t{3}\\t{4}\\t{5}\\n\"\n .format(chrom, coord_start, coord_stop, row[0], row[1], r_count))\n\n map_file.write(file_data)\n map_file.close()\n self.log.info(\"Map File Written\")\n\n self.log.info(\"Target_Bed_Map_Array built.\")\n return numpy.array(map_list, dtype='object')","def get_stats(self):\n # pool.map needs an arg for each function that will be run\n dmx_mean = [self.dmx.mean()] * len(self.genome_paths)\n with ProcessingPool() as pool:\n results = pool.map(genome.mp_stats, self.genome_paths, dmx_mean)\n self.stats = pd.concat(results)\n self.stats.to_csv(self.stats_path)","def collect_pipeline_runs(self):\n db = self.mongo_client.metalearning\n collection = db.pipeline_runs\n collection_size = collection.count()\n pipeline_cursor = collection.find()\n list_of_experiments = {\"classification\": [], \"regression\": []}\n for index, pipeline_run in enumerate(pipeline_cursor):\n if index % 1000 == 0:\n print(\"At {} out of {} documents\".format(index, collection_size))\n # if index == 2000:\n # # running into memory errors\n # break\n pipeline_run_info = self.get_pipeline_run_info(pipeline_run)\n metafeatures = self.get_metafeature_info(pipeline_run)\n # TODO: get all metafeatures so we don't need this\n if metafeatures != {}:\n experiment_json = dict(pipeline_run_info, **metafeatures)\n list_of_experiments[experiment_json[\"problem_type\"]].append(experiment_json)\n\n for problem_type in list_of_experiments.keys():\n final_data_file = json.dumps(list_of_experiments[problem_type], sort_keys=True, indent=4, default=json_util.default)\n with open(\"data/complete_pipelines_and_metafeatures_test_{}.json\".format(problem_type), \"w\") as file:\n file.write(final_data_file)\n\n return","def add_mapping(self, protocol: Protocol, features: Set[FeatureName]) -> None:\n instance = cast(interface.Features, self.get(protocol))\n if instance:\n for feature in features:\n # Add feature to map if missing OR replace if this protocol has higher\n # priority than previous mapping\n if feature not in self._feature_map or self._has_higher_priority(\n protocol, self._feature_map[feature][0]\n ):\n self._feature_map[feature] = (protocol, instance)","def create_new_features(self):\n train = self.train\n \n train['is_context'] = train['context_type'].isin(CONTEXT_TYPE_TEST)\n train['is_context_flow'] = train['listen_type'] * train['is_context']\n \n train['is_listened_context'] = train['is_listened'] * train['is_context']\n train['is_listened_flow'] = train['is_listened'] * train['listen_type']\n train['is_listened_context_flow'] = train['is_listened'] * train['is_context_flow']\n \n for feature in self.categorize_features:\n gby_feat = train.groupby(feature)\n new_features(train, gby_feat, feature, feature in self.listen_type_features, self.context_features, self.flow_features, self.fillna)\n \n # Variable combinations\n for feat1 in self.combo_features1:\n for feat2 in self.combo_features2:\n gby_feat = train.groupby([feat1, feat2])\n name = feat1 + '_' + feat2\n new_features(train, gby_feat, name, feat1 in self.listen_type_features, self.context_features, self.flow_features, self.fillna)","def generate(self):\n self.generate_points()\n self.generate_edges()","def run_map(self):\n # Split input into chunks for processing\n files = self.split_list()\n # Make processing pool\n pool = Pool(processes=self.args.ncore)\n # Map processing to _run function\n self.output = pool.map(_run, files)\n # Close and join pool\n pool.close()\n pool.join()","def social_infrastructure_combined(osm_path): \n df_point = social_infrastructure_point(osm_path)\n df_polygon = social_infrastructure_polygon(osm_path)\n \n df_polygon_filtered = compare_polygon_to_point(df_point, df_polygon) #remove duplicates polygon and point data \n df_polygon_filtered['geometry'] = pygeos.centroid(df_polygon_filtered.geometry) #transform to pointdata\n \n return (df_point.append(df_polygon_filtered)).reset_index(drop=True)","def output_grid_information():\n # translate = [-74.26, 40.50]\n # scale = [0.02, 0.02]\n # step = 1\n\n translate = [0, 0]\n scale = [1, 1]\n step = 0.02\n\n lon_limits = [(-74.26 - translate[0]) / scale[0], (-73.76 - translate[0]) / scale[0]]\n lat_limits = [(40.48 - translate[1]) / scale[1], (40.94 - translate[1]) / scale[1]]\n\n lons = np.arange(lon_limits[0], lon_limits[1] - step, step)\n lats = np.arange(lat_limits[0], lat_limits[1] - step, step)\n\n all_json = {\n \"type\": \"FeatureCollection\"\n }\n\n gr_id = 0\n grid_df = pd.DataFrame(columns=['gr_id', 'c_lat', 'c_lon', 's_lon', 'w_lat', 'n_lon', 'e_lat'])\n features = []\n\n for lat in lats:\n for lon in lons:\n w_lon = lon\n e_lon = lon + step\n s_lat = lat\n n_lat = lat + step\n\n c_lon = lon + step / 2\n c_lat = lat + step / 2\n\n grid_df = grid_df.append(pd.DataFrame({\"gr_id\": [gr_id],\n \"c_lon\": [c_lon], \"c_lat\": [c_lat],\n \"w_lon\": [w_lon], \"s_lat\": [s_lat],\n \"e_lon\": [e_lon], \"n_lat\": [n_lat]}))\n\n coor = [[[s_lat, w_lon], [n_lat, w_lon], [n_lat, e_lon],\n [s_lat, e_lon], [s_lat, w_lon]]]\n\n feature = {\n \"type\": \"Feature\",\n \"geometry\": {\n \"type\": \"Polygon\",\n \"coordinates\": coor\n },\n \"properties\": {\n \"id\": str(gr_id)\n }\n }\n\n features.append(feature)\n\n gr_id += 1\n\n all_json['features'] = features\n\n with open(BaseDir + '/grid.geojson', 'w') as f:\n json.dump(all_json, f)\n\n grid_df.to_csv(BaseDir + '/grid_locs.csv', index=False)","def updateFeatureClass(self, featureClass, query=[\"1=1\"], append=False, userFields=[], debug=False):\n if debug:\n debug = Debug()\n debug.log(\"Running %s\" %debug.callingScript)\n #check if user fileds already exist\n if not self.userFields:\n self.userFields = userFields\n #check for errors\n if not validWorkspace(featureClass):\n raise IncorrectWorkspaceType(\"Incorrect workspace - feature class must be created in a local geodatabase\")\n if not self.__matchSchema(featureClass):\n raise SchemaMismatch(\"Schema of input feature class does not match object schema\")\n queries = self.__generateQuery(query)\n cursor = None\n\n #iterate over queries\n for query in queries:\n if debug: debug.log(\"Working on %s\" %query)\n recordsInQuery = self.__getNumRecordsFromQuery(query, debug=debug)\n if recordsInQuery == 0:\n if debug: debug.log(\"Skipping query\")\n continue\n elif self.__numRecordsMoreThanMax(recordsInQuery):\n del cursor\n raise TooManyRecords(\"Query returns more than max allowed. Please refine query: \" + query)\n #else do the rest\n rValues = {\"where\":query,\n \"f\":\"json\",\n \"returnCountOnly\":\"false\",\n \"outFields\": \"*\"}\n featureData = self._getEsriRESTJSON(self.url+\"/query\", rValues, useIjson=True, debug=debug)\n if debug: debug.log(\"Successfully returned data\")\n\n #Append or overwrite mode - prevents deletion if service is unavailable\n if all([not append, not cursor]):\n if debug: debug.log(\"Deleting records\")\n arcpy.DeleteFeatures_management(featureClass)\n\n #instantiate cursor\n if not cursor:\n if debug: debug.log(\"Instantiating cursor\")\n updateFields = [f['name'] for f in self.updateFields]\n cursor = arcpy.da.InsertCursor(featureClass, updateFields)\n\n for feature in featureData:\n #if geometry is bad, skip record\n try:\n geom = self.__getGeometry(feature['geometry'])\n except NullGeometryError as e:\n if debug: debug.log(\"Null geometry error\")\n continue\n except:\n if debug: debug.log(\"Some other geometry error - couldn't get geometry\")\n attributes = []\n attributes.append(geom)\n for field in self.updateFields:\n if field['name'] == \"Shape@\":\n continue\n elif 'date' in field['type'].lower():\n attributes.append(self.__handleDateAttribute(feature['attributes'][field['name']]))\n else:\n \"\"\"getting strange OverflowError Python int too large to convert to C long,\n so casting section getting problem with some services where some fields\n aren't returned in results so added try/catch block\"\"\"\n try:\n newAttribute = feature['attributes'][field['name']]\n if type(newAttribute) is long:\n if type(int(newAttribute)) is long:\n attributes.append(float(newAttribute))\n else:\n attributes.append(newAttribute)\n else:\n attributes.append(newAttribute)\n except KeyError, e:\n attributes.append(None)\n cursor.insertRow(attributes)\n #Delete cursor\n del cursor\n if debug: debug.close()","def __data_generation(self, batch_data):\n X = np.zeros((self.batch_size, self.num_features), dtype=float)\n y = np.zeros((self.batch_size, self.num_outputs), dtype=float)\n\n for i, sample in batch_data.iterrows():\n # Get lat/long of pickup and dropoff locations\n PULocation = self.taxizone_data.loc[sample['PULocationID']].centroids\n PULocationLong, PULocationLat = PULocation.x, PULocation.y\n DOLocation = self.taxizone_data.loc[sample['DOLocationID']].centroids\n DOLocationLong, DOLocationLat = DOLocation.x, DOLocation.y\n\n # Get month date, day of week and hours/mins for pickup\n PUDateTime = datetime.strptime(sample.tpep_pickup_datetime, '%Y-%m-%d %H:%M:%S')\n PUDate = PUDateTime.strftime('%Y-%m-%d')\n PUYear, PUMonth, PUMonthDate = PUDate.split('-')\n # TODO - Add this to pre-processing of trip data! Some random months in the data!!\n if PUYear != '2018' or PUMonth != '06':\n continue\n PUDayOfWeek = PUDateTime.weekday()\n PUTimeHour, PUTimeMinute = datetime.strptime(\n sample.tpep_pickup_datetime, '%Y-%m-%d %H:%M:%S'\n ).strftime('%H:%M').split(':')\n\n # Get precipitation for that day\n Precipitation = self.weather_data[self.weather_data['DATE'] == PUDate]['PRCP'].values[0]\n\n X[i] = np.concatenate((np.array([\n\n PULocationLat,\n PULocationLong,\n DOLocationLat,\n DOLocationLong,\n abs((PULocationLat - DOLocationLat) ** 2 + abs(PULocationLong - DOLocationLong) ** 2) ** 0.5,\n Precipitation\n ]),\n to_categorical(PUDayOfWeek, 7),\n to_categorical(PUMonthDate, 31),\n to_categorical(PUTimeHour, 24)\n ))\n\n y[i] = [sample['duration']] if self.generator_type == 'duration' \\\n else [sample['total_amount'] - sample['tip_amount']]\n\n return X, y","def aggregate_from_base(\n base_dir: str, ref_seq: str, ref_pos: t.Sequence[int],\n pos_parser: t.Callable[[str], t.List[str]] = lambda x: x.split('-'),\n temperature: float = 0.6, count_threshold: int = 100,\n holo: str = 'holo', apo: str = 'apo', mc: str = 'MC',\n bias_name: str = 'ADAPT.inp.dat', seqs_name: str = 'RESULTS.tsv') -> pd.DataFrame:\n\n ref_pos_str = list(map(str, ref_pos))\n ref_pos_mapping = {p: i for i, p in enumerate(ref_pos_str)}\n\n def affinity_df(pair_base):\n pop_apo = pd.read_csv(f'{pair_base}/{apo}/{mc}/{seqs_name}', sep='\\t')\n pop_holo = pd.read_csv(f'{pair_base}/{holo}/{mc}/{seqs_name}', sep='\\t')\n bias_apo = f'{pair_base}/{apo}/{mc}/{bias_name}'\n bias_holo = f'{pair_base}/{holo}/{mc}/{bias_name}'\n stability_apo = stability(pop_apo, bias_apo, ref_seq, temperature, count_threshold, ref_pos_str)\n stability_holo = stability(pop_holo, bias_holo, ref_seq, temperature, count_threshold, ref_pos_str)\n df = pd.merge(stability_apo, stability_holo, on='seq', how='outer', suffixes=['_apo', '_holo'])\n df['affinity'] = df['stability_holo'] - df['stability_apo']\n positions = pos_parser(pair_base)\n df['seq_subset'] = df['seq'].apply(lambda s: ''.join(s[ref_pos_mapping[p]] for p in positions))\n df['pos'] = '-'.join(positions)\n return df\n\n paths = tqdm(glob(f'{base_dir}/*'), desc='Aggregating workers')\n dfs = []\n for p in paths:\n try:\n dfs.append(affinity_df(p))\n except (NoReferenceError, ValueError, KeyError) as e:\n warn(f'Could not aggregate worker {p} due to {e}')\n\n return pd.concat(dfs)","def add_starters_to_map(gdf_best_route: gpd.GeoDataFrame, basemap):\n #create a list of colors\n colors = ['orange', 'darkred', 'darkblue', 'purple', 'darkgreen', '#364e4a', 'cadetblue']\n\n # make one feature group for the markers\n fg_marker = folium.FeatureGroup(\"Destination Cities\")\n for i, row in gdf_best_route.iterrows():\n fg_marker.add_child(folium.Marker(\n location=row[\"folium_geom\"][0],\n tooltip=f\"{row['start_city']}\",\n icon=folium.Icon(color=colors[i], icon='train', prefix='fa')\n ))\n basemap.add_child(fg_marker)\n\n return None"],"string":"[\n \"def _export_to_feature_class(self, chunk_definition):\\r\\n # Make output gdb\\r\\n rt_workspace = self._create_output_gdb()\\r\\n\\r\\n # Export routes\\r\\n output_routes = os.path.join(rt_workspace, f\\\"Routes_{chunk_definition[0]}_{chunk_definition[1]}\\\")\\r\\n self.logger.debug(f\\\"Exporting Route Routes output to {output_routes}...\\\")\\r\\n self.solve_result.export(arcpy.nax.RouteOutputDataType.Routes, output_routes)\\r\\n\\r\\n # Export stops\\r\\n output_stops = os.path.join(rt_workspace, f\\\"Stops_{chunk_definition[0]}_{chunk_definition[1]}\\\")\\r\\n self.logger.debug(f\\\"Exporting Route Stops output to {output_stops}...\\\")\\r\\n self.solve_result.export(arcpy.nax.RouteOutputDataType.Stops, output_stops)\\r\\n\\r\\n # Join the input ID fields to Routes\\r\\n # The new FirstStopID and LastStopID fields were added at Pro 3.1 / Enterprise 11.1 to make relationships\\r\\n # between IDs/OIDs in output classes are more reliable. Use these fields if they exist in the output.\\r\\n # Otherwise, use FirstStopOID and LastStopOID, which are mostly reliable but not perfect. For best results, use\\r\\n # the most recent ArcGIS software.\\r\\n if \\\"FirstStopID\\\" in self.solve_result.fieldNames(arcpy.nax.RouteOutputDataType.Routes):\\r\\n id_field_prefix = \\\"ID\\\"\\r\\n else:\\r\\n id_field_prefix = \\\"OID\\\"\\r\\n if self.reverse_direction:\\r\\n first_stop_field = self.dest_unique_id_field_name\\r\\n second_stop_field = self.origin_unique_id_field_name\\r\\n else:\\r\\n first_stop_field = self.origin_unique_id_field_name\\r\\n second_stop_field = self.dest_unique_id_field_name\\r\\n with arcpy.EnvManager(overwriteOutput=True):\\r\\n helpers.run_gp_tool(\\r\\n self.logger,\\r\\n arcpy.management.JoinField,\\r\\n [output_routes, f\\\"FirstStop{id_field_prefix}\\\", output_stops, \\\"ObjectID\\\", [first_stop_field]]\\r\\n )\\r\\n helpers.run_gp_tool(\\r\\n self.logger,\\r\\n arcpy.management.JoinField,\\r\\n [output_routes, f\\\"LastStop{id_field_prefix}\\\", output_stops, \\\"ObjectID\\\", [second_stop_field]]\\r\\n )\\r\\n\\r\\n self.job_result[\\\"outputRoutes\\\"] = output_routes\",\n \"def process(sources, output, force):\\n logging.basicConfig(level=logging.INFO,\\n format='%(asctime)s [%(levelname)s] - %(message)s', datefmt=\\\"%H:%M:%S\\\")\\n\\n logging.getLogger('shapely.geos').setLevel(logging.WARNING)\\n logging.getLogger('Fiona').setLevel(logging.WARNING)\\n logging.getLogger('requests.packages.urllib3.connectionpool').setLevel(logging.WARNING)\\n requests.packages.urllib3.disable_warnings()\\n # logging.getLogger('processing').setLevel(logging.DEBUG)\\n\\n catalog_features = []\\n failures = []\\n path_parts_to_skip = utils.get_path_parts(sources).index(\\\"sources\\\") + 1\\n success = True\\n for path in utils.get_files(sources):\\n try:\\n logging.info(\\\"Processing \\\" + path)\\n pathparts = utils.get_path_parts(path)[path_parts_to_skip:]\\n pathparts[-1] = pathparts[-1].replace('.json', '.geojson')\\n\\n outdir = os.path.join(output, *pathparts[:-1], pathparts[-1].replace('.geojson', ''))\\n outfile = os.path.join(output, *pathparts)\\n\\n source = utils.read_json(path)\\n urlfile = urlparse(source['url']).path.split('/')[-1]\\n \\n if not hasattr(adapters, source['filetype']):\\n logging.error('Unknown filetype ' + source['filetype'])\\n failures.append(path)\\n continue\\n \\n read_existing = False\\n if os.path.isfile(outfile):\\n logging.info(\\\"Output file exists\\\")\\n if os.path.getmtime(outfile) > os.path.getmtime(path):\\n logging.info(\\\"Output file is up to date\\\")\\n if not force:\\n read_existing = True\\n logging.warning('Skipping ' + path + ' since generated file exists. Use --force to regenerate.') \\n else:\\n logging.info(\\\"Output is outdated, {} < {}\\\".format(\\n datetime.datetime.fromtimestamp(os.path.getmtime(outfile)),\\n datetime.datetime.fromtimestamp(os.path.getmtime(path))))\\n\\n if read_existing:\\n with open(outfile, \\\"rb\\\") as f:\\n geojson = json.load(f)\\n properties = geojson['properties']\\n else:\\n logging.info('Downloading ' + source['url'])\\n \\n try:\\n fp = utils.download(source['url'])\\n except IOError:\\n logging.error('Failed to download ' + source['url'])\\n failures.append(path)\\n continue\\n \\n logging.info('Reading ' + urlfile)\\n \\n if 'filter' in source:\\n filterer = BasicFilterer(source['filter'], source.get('filterOperator', 'and'))\\n else:\\n filterer = None\\n \\n try:\\n geojson = getattr(adapters, source['filetype'])\\\\\\n .read(fp, source['properties'],\\n filterer=filterer,\\n layer_name=source.get(\\\"layerName\\\", None),\\n source_filename=source.get(\\\"filenameInZip\\\", None))\\n except IOError as e:\\n logging.error('Failed to read ' + urlfile + \\\" \\\" + str(e))\\n failures.append(path)\\n continue\\n except zipfile.BadZipfile as e:\\n logging.error('Unable to open zip file ' + source['url'])\\n failures.append(path)\\n continue\\n finally:\\n os.remove(fp.name)\\n if(len(geojson['features'])) == 0:\\n logging.error(\\\"Result contained no features for \\\" + path)\\n continue\\n excluded_keys = ['filetype', 'url', 'properties', 'filter', 'filenameInZip']\\n properties = {k:v for k,v in list(source.items()) if k not in excluded_keys}\\n properties['source_url'] = source['url']\\n properties['feature_count'] = len(geojson['features'])\\n logging.info(\\\"Generating demo point\\\")\\n properties['demo'] = geoutils.get_demo_point(geojson)\\n \\n geojson['properties'] = properties\\n \\n utils.make_sure_path_exists(os.path.dirname(outfile))\\n\\n #cleanup existing generated files\\n if os.path.exists(outdir):\\n rmtree(outdir)\\n filename_to_match, ext = os.path.splitext(pathparts[-1])\\n output_file_dir = os.sep.join(utils.get_path_parts(outfile)[:-1])\\n logging.info(\\\"looking for generated files to delete in \\\" + output_file_dir)\\n for name in os.listdir(output_file_dir):\\n base, ext = os.path.splitext(name)\\n if base == filename_to_match:\\n to_remove = os.path.join(output_file_dir, name)\\n logging.info(\\\"Removing generated file \\\" + to_remove)\\n os.remove(to_remove)\\n\\n utils.write_json(outfile, geojson)\\n\\n logging.info(\\\"Generating label points\\\")\\n label_geojson = geoutils.get_label_points(geojson)\\n label_path = outfile.replace('.geojson', '.labels.geojson')\\n utils.write_json(label_path, label_geojson)\\n\\n logging.info('Done. Processed to ' + outfile)\\n \\n if not \\\"demo\\\" in properties:\\n properties['demo'] = geoutils.get_demo_point(geojson)\\n\\n properties['path'] = \\\"/\\\".join(pathparts)\\n catalog_entry = {\\n 'type': 'Feature',\\n 'properties': properties,\\n 'geometry': geoutils.get_union(geojson)\\n }\\n catalog_features.append(catalog_entry)\\n\\n if not os.path.exists(outdir) or not os.path.exists(os.path.join(outdir, \\\"units.json\\\")):\\n logging.info(\\\"Generated exploded GeoJSON to \\\" + outdir)\\n if not os.path.exists(outdir):\\n os.makedirs(outdir)\\n # .json instead of .geojson, incase there is a unit named \\\"source\\\"\\n utils.write_json(os.path.join(outdir, \\\"source.json\\\"), catalog_entry) \\n units = []\\n for feature in geojson['features']:\\n feature_id = str(feature['properties']['id'])\\n feature_id = feature_id.replace('/', '')\\n feature_filename = os.path.join(outdir, feature_id + \\\".geojson\\\")\\n utils.write_json(feature_filename, feature)\\n units.append(feature['properties'])\\n utils.write_json(os.path.join(outdir, \\\"units.json\\\"), units)\\n else:\\n logging.debug(\\\"exploded GeoJSON already exists, not generating\\\")\\n\\n except Exception as e:\\n logging.error(str(e))\\n logging.exception(\\\"Error processing file \\\" + path)\\n failures.append(path)\\n success = False\\n\\n catalog = {\\n 'type': 'FeatureCollection',\\n 'features': catalog_features\\n }\\n utils.write_json(os.path.join(output,'catalog.geojson'), catalog)\\n\\n if not success:\\n logging.error(\\\"Failed sources: \\\" + \\\", \\\".join(failures))\\n sys.exit(-1)\",\n \"def post_process():\\n for route in os.listdir(GFR_ROUTES_LOCATION):\\n if os.path.isfile(MISSING_LOCATION + route):\\n # If the route is missing, output the reference data with correct OSM tags.\\n\\n copyfile(MISSING_LOCATION + route, OUTPUT_LOCATION + route)\\n add_property(OUTPUT_LOCATION + route, 'error_type', 'missing')\\n elif os.path.isfile(DIFF_MISSING_LOCATION + route) and os.path.isfile(DIFF_WRONG_LOCATION + route) \\\\\\n and merge_differences(route, DIFF_MISSING_LOCATION + route, DIFF_WRONG_LOCATION + route,\\n OUTPUT_LOCATION + route):\\n # If there's a geometrical difference, combine the two difference files and output it.\\n\\n add_property(OUTPUT_LOCATION + route, 'error_type', 'difference')\\n elif os.path.isfile(TAGS_LOCATION + route):\\n # When there's no geometrical difference, output the OSM data possibly containing missing tags.\\n\\n copyfile(TAGS_LOCATION + route, OUTPUT_LOCATION + route)\\n else:\\n raise Exception(\\\"No output file could be generated for route: \\\" + route)\\n\\n copy_to_site()\\n\\n # Export a last updated timestamp\\n with open('last_updated', 'w') as fp:\\n fp.write(str(int(time.time() * 1000)))\",\n \"def _merge_image_features(feature_class_type: Type[Union[kapture.Keypoints,\\n kapture.Descriptors,\\n kapture.GlobalFeatures]],\\n feature_type: str,\\n features_list: Union[List[Optional[kapture.Keypoints]],\\n List[Optional[kapture.Descriptors]],\\n List[Optional[kapture.GlobalFeatures]]],\\n features_paths: List[str],\\n output_path: str,\\n tar_handlers: List[TarCollection]\\n ) -> Union[kapture.Keypoints, kapture.Descriptors, kapture.GlobalFeatures]:\\n assert len(features_list) > 0\\n assert len(features_paths) == len(features_list)\\n\\n # find no none value\\n val = [(i, d) for i, d in enumerate(features_list) if d is not None]\\n assert len(val) > 0\\n\\n merged_features = val[0][1]\\n for j, (i, features) in enumerate(val):\\n assert isinstance(features, feature_class_type)\\n assert features.type_name == merged_features.type_name\\n assert features.dtype == merged_features.dtype\\n assert features.dsize == merged_features.dsize\\n if feature_class_type == kapture.Descriptors or feature_class_type == kapture.GlobalFeatures:\\n assert not isinstance(features, kapture.Keypoints) # IDE type check help\\n assert not isinstance(merged_features, kapture.Keypoints) # IDE type check help\\n assert features.metric_type == merged_features.metric_type\\n if feature_class_type == kapture.Descriptors:\\n assert isinstance(features, kapture.Descriptors) # IDE type check help\\n assert isinstance(merged_features, kapture.Descriptors) # IDE type check help\\n assert features.keypoints_type == merged_features.keypoints_type\\n for name in features:\\n if j > 0 and name in merged_features:\\n getLogger().warning(f'{name} was found multiple times.')\\n else:\\n merged_features.add(name)\\n if output_path:\\n # TODO: uses kapture.io.features_list.get_image_features_dirpath()\\n in_path = kapture.io.features.get_features_fullpath(feature_class_type,\\n feature_type,\\n features_paths[i],\\n name,\\n tar_handlers[i])\\n out_path = kapture.io.features.get_features_fullpath(feature_class_type,\\n feature_type,\\n output_path,\\n name)\\n if in_path != out_path:\\n # skip actual copy if file does not actually move.\\n os.makedirs(os.path.dirname(out_path), exist_ok=True)\\n if isinstance(in_path, str):\\n shutil.copy(in_path, out_path)\\n else:\\n # in_path is a tuple [str, TarHandler]\\n # keypoints are not stored in a file, have to read them to be able to copy them\\n array = in_path[1].get_array_from_tar(in_path[0], features.dtype, features.dsize)\\n array_to_file(out_path, array)\\n return merged_features\",\n \"def gtfs_routes(gtfs, output_f):\\n\\n\\t# Load up the stop times so we can find which are the best routes.\\n\\t#TODO\\n\\tstop_times_file = [x for x in gtfs.namelist() if 'stop_times' in x][0]\\n\\n\\tstoptimes_c = csv.reader((gtfs.open(stop_times_file, 'r')))\\n\\theader = stoptimes_c.next()\\n\\ttrip_id_col = header.index('trip_id')\\n\\tarrtime_col = header.index('arrival_time')\\n\\tdeptime_col = header.index('departure_time')\\n\\tstopseq_col = header.index('stop_sequence')\\n\\ttrip_times = {}\\n\\tfor row in stoptimes_c:\\n\\t\\tif row[trip_id_col] not in trip_times:\\n\\t\\t\\t# earliest seq, latest seq, earliest seq dep time, latest seq dep time\\n\\t\\t\\ttrip_times[row[trip_id_col]] = [None, None, None, None]\\n\\n\\t\\tarrtime = time_as_timedelta(row[arrtime_col])\\n\\t\\tdeptime = time_as_timedelta(row[deptime_col])\\n\\t\\tif arrtime is None or deptime is None:\\n\\t\\t\\t# bad data, skip!\\n\\t\\t\\tcontinue\\n\\t\\tseq = int(row[stopseq_col])\\n\\n\\t\\t# Find if this is an earlier item in the sequence\\n\\t\\tif trip_times[row[trip_id_col]][0] is None or trip_times[row[trip_id_col]][0] > seq:\\n\\t\\t\\ttrip_times[row[trip_id_col]][0] = seq\\n\\t\\t\\ttrip_times[row[trip_id_col]][2] = deptime\\n\\n\\t\\t# Find if this is an later item in the sequence\\n\\t\\tif trip_times[row[trip_id_col]][1] is None or trip_times[row[trip_id_col]][1] < seq:\\n\\t\\t\\ttrip_times[row[trip_id_col]][1] = seq\\n\\t\\t\\ttrip_times[row[trip_id_col]][3] = arrtime\\n\\n\\t# Load the shapes into a map that we can lookup.\\n\\t# We should do all the geometry processing here so that we only have to do\\n\\t# this once-off.\\n\\t#TODO\\n\\tshapes_file = [x for x in gtfs.namelist() if 'shapes' in x][0]\\n\\tshapes_c = csv.reader(swallow_windows_unicode(gtfs.open(shapes_file, 'r')))\\n\\n\\theader = shapes_c.next()\\n\\tshape_id_col = header.index('shape_id')\\n\\tshape_lat_col = header.index('shape_pt_lat')\\n\\tshape_lng_col = header.index('shape_pt_lon')\\n\\tshape_seq_col = header.index('shape_pt_sequence')\\n\\tshape_dist_col = header.index('shape_dist_traveled') if 'shape_dist_traveled' in header else None\\n\\n\\tshapes = {}\\n\\tshape_lengths = {}\\n\\tfor row in shapes_c:\\n\\t\\tif row[shape_id_col] not in shapes:\\n\\t\\t\\tshapes[row[shape_id_col]] = {}\\n\\n\\t\\tshapes[row[shape_id_col]][int(row[shape_seq_col])] = (Decimal(row[shape_lng_col]), Decimal(row[shape_lat_col]))\\n\\n\\t\\t# Calculate length according to GTFS\\n\\t\\t# This could also be calculated by the geometry, but we trust GTFS, right...\\n\\t\\tif shape_dist_col is not None and row[shape_dist_col]:\\n\\t\\t\\tlength = Decimal(row[shape_dist_col])\\n\\t\\t\\tif row[shape_id_col] not in shape_lengths or shape_lengths[row[shape_id_col]] < length:\\n\\t\\t\\t\\tshape_lengths[row[shape_id_col]] = length\\n\\n\\t# translate the shapes into a LineString for use by the GeoJSON module\\n\\tfor shape_id in shapes.iterkeys():\\n\\t\\tshape_keys = shapes[shape_id].keys()\\n\\t\\tshape_keys.sort()\\n\\t\\tshape = []\\n\\t\\tfor ordinal in shape_keys:\\n\\t\\t\\tshape.append(shapes[shape_id][ordinal])\\n\\n\\t\\tshapes[shape_id] = shape\\n\\n\\t# Make a matching dict between routes and shapes\\n\\ttrips = {}\\n\\ttrips_ref = {}\\n\\troute_time = {}\\n\\n\\t#TODO\\n\\ttrips_file = [x for x in gtfs.namelist() if 'trips' in x][0]\\n\\n\\ttrips_c = csv.reader(swallow_windows_unicode(gtfs.open(trips_file, 'r')))\\n\\theader = trips_c.next()\\n\\troute_id_col = header.index('route_id')\\n\\tshape_id_col = header.index('shape_id')\\n\\ttrip_id_col = header.index('trip_id')\\n\\tfor row in trips_c:\\n\\t\\t# reference count the shapes\\n\\t\\tif row[route_id_col] not in trips_ref:\\n\\t\\t\\t# route is unknown, create dict\\n\\t\\t\\ttrips_ref[row[route_id_col]] = {}\\n\\t\\t\\troute_time[row[route_id_col]] = trip_times[row[trip_id_col]]\\n\\n\\t\\tif row[shape_id_col] not in trips_ref[row[route_id_col]]:\\n\\t\\t\\t# shape is unknown, create counter\\n\\t\\t\\ttrips_ref[row[route_id_col]][row[shape_id_col]] = 0\\n\\n\\t\\t# increment counter\\n\\t\\ttrips_ref[row[route_id_col]][row[shape_id_col]] += 1\\n\\n\\t# now we're done, iterate through the reference-counters and find the best\\n\\t# shape\\n\\tfor route_id, candidate_shapes in trips_ref.iteritems():\\n\\t\\tpopular_shape, popular_shape_refs = None, 0\\n\\t\\tfor shape_id, refs in candidate_shapes.iteritems():\\n\\t\\t\\tif refs > popular_shape_refs:\\n\\t\\t\\t\\tpopular_shape, popular_shape_refs = shape_id, refs\\n\\n\\t\\t# now we should have the route's shape\\n\\t\\tassert popular_shape is not None, 'Couldn\\\\'t find a shape for route %r' % route_id\\n\\t\\ttrips[route_id] = popular_shape\\n\\n\\t# Cleanup unused variables\\n\\tdel trip_times\\n\\n\\t# lets setup our output file\\n\\toutput_layer = geojson.FeatureCollection([])\\n\\t# assume WGS84 CRS\\n\\toutput_layer.crs = geojson.crs.Named('urn:ogc:def:crs:OGC:1.3:CRS84')\\n\\n\\t# now we have all the shapes available, translate the routes\\n\\t#TODO\\n\\troutes_file = [x for x in gtfs.namelist() if 'routes' in x][0]\\n\\n\\troutes_c = csv.reader(swallow_windows_unicode(gtfs.open(routes_file, 'r')))\\n\\theader = routes_c.next()\\n\\troute_id_col = header.index('route_id')\\n\\n\\tfor row in routes_c:\\n\\t\\t# make dict of other properties\\n\\t\\tprops = dict()\\n\\t\\tfor i, h in enumerate(header):\\n\\t\\t\\tif row[i] != '':\\n\\t\\t\\t\\tprops[h] = row[i]\\n\\n\\t\\tif row[route_id_col] not in trips:\\n\\t\\t\\t# Route has no trips!\\n\\t\\t\\tprint \\\"Warning: route has no trips, skipping: %r\\\" % (row,)\\n\\t\\t\\tcontinue\\n\\n\\t\\tprops['shape_id'] = trips[row[route_id_col]]\\n\\t\\tprops['shape_refs'] = trips_ref[row[route_id_col]][props['shape_id']]\\n\\t\\tif shape_dist_col is not None and len(shape_lengths) > 0:\\n\\t\\t\\tprops['shape_length'] = shape_lengths[props['shape_id']]\\n\\t\\tprops['duration_sec'] = (route_time[row[route_id_col]][3] - route_time[row[route_id_col]][2]).total_seconds()\\n\\n\\t\\toutput_layer.features.append(geojson.Feature(\\n\\t\\t\\tgeometry=geojson.LineString(\\n\\t\\t\\t\\tcoordinates=shapes[trips[row[route_id_col]]]\\n\\t\\t\\t),\\n\\t\\t\\tproperties=props,\\n\\t\\t\\tid=row[route_id_col]\\n\\t\\t))\\n\\n\\t# now flush the GeoJSON layer to a file.\\n\\tgeojson.dump(output_layer, output_f, cls=DecimalEncoder)\",\n \"def mergeGeometries(self):\\n self.geometry = reduce(lambda p1,p2 : p1.union(p2) ,map(lambda tax : tax.biomeGeometry,self.taxonomies))\\n return self.geometry\",\n \"def process_detail_pages(self):\\r\\n n_pools = os.cpu_count() // 2\\r\\n with Pool(n_pools) as pool:\\r\\n result = pool.map(scrape_detail_page, self.base_features_list)\\r\\n pool.close()\\r\\n pool.join()\\r\\n\\r\\n self.all_features_list = result\",\n \"def add_building_output_locations2(self,areasList,start,end,step): \\n print \\\"Getting buildings locations...\\\"\\n \\n dictionaries = []\\n dictionary = {}\\n \\n for a in areasList:\\n \\n dictionaries.append(self.grid.get_building_output_locations(a[0],a[1]))\\n \\n for dict in dictionaries:\\n for row in dict.iteritems(): \\n dictionary[row[0]] = row[1] \\n\\n print \\\"Number of buildings = %s\\\" % (len(dictionary))\\n\\n if (dictionary != {}):\\n self.run_nc.add_building_output_locations(dictionary, start, end,step)\",\n \"def __feature_set__(self):\\r\\n import numpy as np\\r\\n import datetime\\r\\n import time\\r\\n cols_norm = [col for col in self.columns]\\r\\n cols_lower = [col.lower() for col in self.columns]\\r\\n fields = []\\r\\n features = []\\r\\n date_fields = []\\r\\n _geom_types = {\\r\\n arcgis.geometry._types.Point : \\\"esriGeometryPoint\\\",\\r\\n arcgis.geometry._types.Polyline : \\\"esriGeometryPolyline\\\",\\r\\n arcgis.geometry._types.MultiPoint : \\\"esriGeometryMultipoint\\\",\\r\\n arcgis.geometry._types.Polygon : \\\"esriGeometryPolygon\\\"\\r\\n }\\r\\n if self.sr is None:\\r\\n sr = {'wkid' : 4326}\\r\\n else:\\r\\n sr = self.sr\\r\\n fs = {\\r\\n \\\"objectIdFieldName\\\" : \\\"\\\",\\r\\n \\\"globalIdFieldName\\\" : \\\"\\\",\\r\\n \\\"displayFieldName\\\" : \\\"\\\",\\r\\n \\\"geometryType\\\" : _geom_types[type(self.geometry[self.geometry.first_valid_index()])],\\r\\n \\\"spatialReference\\\" : sr,\\r\\n \\\"fields\\\" : [],\\r\\n \\\"features\\\" : []\\r\\n }\\r\\n if 'objectid' in cols_lower:\\r\\n fs['objectIdFieldName'] = cols_norm[cols_lower.index('objectid')]\\r\\n fs['displayFieldName'] = cols_norm[cols_lower.index('objectid')]\\r\\n elif 'fid' in cols_lower:\\r\\n fs['objectIdFieldName'] = cols_norm[cols_lower.index('fid')]\\r\\n fs['displayFieldName'] = cols_norm[cols_lower.index('fid')]\\r\\n elif 'oid' in cols_lower:\\r\\n fs['objectIdFieldName'] = cols_norm[cols_lower.index('oid')]\\r\\n fs['displayFieldName'] = cols_norm[cols_lower.index('oid')]\\r\\n else:\\r\\n self['OBJECTID'] = list(range(1, self.shape[0] + 1))\\r\\n res = self.__feature_set__\\r\\n del self['OBJECTID']\\r\\n return res\\r\\n if 'objectIdFieldName' in fs:\\r\\n fields.append({\\r\\n \\\"name\\\" : fs['objectIdFieldName'],\\r\\n \\\"type\\\" : \\\"esriFieldTypeOID\\\",\\r\\n \\\"alias\\\" : fs['objectIdFieldName']\\r\\n })\\r\\n cols_norm.pop(cols_norm.index(fs['objectIdFieldName']))\\r\\n if 'globalIdFieldName' in fs and len(fs['globalIdFieldName']) > 0:\\r\\n fields.append({\\r\\n \\\"name\\\" : fs['globalIdFieldName'],\\r\\n \\\"type\\\" : \\\"esriFieldTypeGlobalID\\\",\\r\\n \\\"alias\\\" : fs['globalIdFieldName']\\r\\n })\\r\\n cols_norm.pop(cols_norm.index(fs['globalIdFieldName']))\\r\\n elif 'globalIdFieldName' in fs and \\\\\\r\\n len(fs['globalIdFieldName']) == 0:\\r\\n del fs['globalIdFieldName']\\r\\n if self._geometry_column_name in cols_norm:\\r\\n cols_norm.pop(cols_norm.index(self._geometry_column_name))\\r\\n for col in cols_norm:\\r\\n try:\\r\\n idx = self[col].first_valid_index()\\r\\n col_val = self[col].loc[idx]\\r\\n except:\\r\\n col_val = \\\"\\\"\\r\\n if isinstance(col_val, (str, np.str)):\\r\\n l = self[col].str.len().max()\\r\\n if str(l) == 'nan':\\r\\n l = 255\\r\\n\\r\\n fields.append({\\r\\n \\\"name\\\" : col,\\r\\n \\\"type\\\" : \\\"esriFieldTypeString\\\",\\r\\n \\\"length\\\" : int(l),\\r\\n \\\"alias\\\" : col\\r\\n })\\r\\n if fs['displayFieldName'] == \\\"\\\":\\r\\n fs['displayFieldName'] = col\\r\\n elif isinstance(col_val, (datetime.datetime,\\r\\n pd.Timestamp,\\r\\n np.datetime64,\\r\\n pd.datetime)):\\r\\n fields.append({\\r\\n \\\"name\\\" : col,\\r\\n \\\"type\\\" : \\\"esriFieldTypeDate\\\",\\r\\n \\\"alias\\\" : col\\r\\n })\\r\\n date_fields.append(col)\\r\\n elif isinstance(col_val, (np.int32, np.int16, np.int8)):\\r\\n fields.append({\\r\\n \\\"name\\\" : col,\\r\\n \\\"type\\\" : \\\"esriFieldTypeSmallInteger\\\",\\r\\n \\\"alias\\\" : col\\r\\n })\\r\\n elif isinstance(col_val, (int, np.int, np.int64)):\\r\\n fields.append({\\r\\n \\\"name\\\" : col,\\r\\n \\\"type\\\" : \\\"esriFieldTypeInteger\\\",\\r\\n \\\"alias\\\" : col\\r\\n })\\r\\n elif isinstance(col_val, (float, np.float64)):\\r\\n fields.append({\\r\\n \\\"name\\\" : col,\\r\\n \\\"type\\\" : \\\"esriFieldTypeDouble\\\",\\r\\n \\\"alias\\\" : col\\r\\n })\\r\\n elif isinstance(col_val, (np.float32)):\\r\\n fields.append({\\r\\n \\\"name\\\" : col,\\r\\n \\\"type\\\" : \\\"esriFieldTypeSingle\\\",\\r\\n \\\"alias\\\" : col\\r\\n })\\r\\n fs['fields'] = fields\\r\\n for row in self.to_dict('records'):\\r\\n geom = {}\\r\\n if self._geometry_column_name in row:\\r\\n geom = row[self._geometry_column_name]\\r\\n del row[self._geometry_column_name]\\r\\n for f in date_fields:\\r\\n try:\\r\\n row[f] = int(row[f].to_pydatetime().timestamp() * 1000)\\r\\n except:\\r\\n row[f] = None\\r\\n features.append(\\r\\n {\\r\\n \\\"geometry\\\" : dict(geom),\\r\\n \\\"attributes\\\" : row\\r\\n }\\r\\n )\\r\\n del row\\r\\n del geom\\r\\n fs['features'] = features\\r\\n return fs\",\n \"def add_route_to_map(gdf_best_route: gpd.GeoDataFrame, basemap):\\n #create a list of colors\\n colors = ['orange', 'darkred', 'darkblue', 'purple', 'darkgreen', '#364e4a', 'cadetblues']\\n \\n # make a feature group for every route\\n # merge them to a feature group\\n for i, row in gdf_best_route.iterrows():\\n fg = folium.FeatureGroup(f\\\"Route {row['order']} from {row['start_city']} to {row['end_city']}\\\")\\n # add the simple route\\n fg.add_child(folium.PolyLine(\\n locations=row[\\\"folium_geom\\\"], \\n popup=f\\\"From {row['start_city']} to {row['end_city']}\\\",\\n tooltip=f\\\"Route {row['order']}\\\",\\n color=colors[i], \\n dash_array='10',\\n weight=4))\\n basemap.add_child(fg)\\n \\n return None\",\n \"def close(self): \\n \\n# web_pdb.set_trace()\\n # Process all the features\\n for feature in self.meta_features:\\n self.mapping_errors = [] # Reset the list that contains the errors\\n # Extract attribute value to process\\n att_2_map=feature.getAttribute('att_2_map')\\n \\n # Extract the status of the published parameters (passed through attributes)\\n bool_english_refresh = FME_utils.test_attribute_value(feature, ENGLISH_REFRESH, YES, False)\\n bool_french_refresh = FME_utils.test_attribute_value(feature, FRENCH_REFRESH, YES, False)\\n bool_code_refresh = FME_utils.test_attribute_value(feature, CODE_REFRESH, YES, False)\\n bool_error_not_mapped = FME_utils.test_attribute_value(feature, ERROR_NOT_MAPPED, YES, False)\\n \\n # Extract the attributes name to process. Can be a list or a single attribute\\n index_attributes = FME_utils.extract_attribute_list(feature, att_2_map)\\n \\n if index_attributes:\\n # Loop over the attributes\\n for index, att_name in index_attributes:\\n # Extract the attribute to process\\n att_value = FME_utils.feature_get_attribute(feature, att_name, False)\\n att_value = att_value.lower().rstrip(\\\" \\\").lstrip(\\\" \\\")\\n \\n # Extract the row from CSV dictionary\\n try:\\n csv_row = self.csv_features[att_value]\\n # Map the value according to the requirements\\n if bool_english_refresh:\\n feature.setAttribute(att_name, csv_row.value_english)\\n if bool_french_refresh:\\n feature.setAttribute(att_name+\\\"_fr\\\", csv_row.value_french)\\n if bool_code_refresh:\\n feature.setAttribute(att_name+\\\"_code\\\", csv_row.code_value)\\n except KeyError:\\n # Value not found in the dictionary. Add the error in the list\\n str_error = (\\\"Unable to map value: {0} for attribute: {1}.\\\".format(att_value,att_name))\\n self.mapping_errors.append(str_error)\\n else:\\n # The requested attribute is not found\\n str_error = ('The requested attribute to map (ATT_TO_MAP): {} is not present on the FME feature.'.format(att_2_map))\\n self.mapping_errors.append(str_error)\\n \\n # Append the errors in the FME error attribute\\n if bool_error_not_mapped:\\n # Mapping errors are registered in FME attribute\\n if self.mapping_errors:\\n # Extract the number of existing error\\n err_count = FME_utils.max_index_attribute_list(feature, \\\"mapping_errors{}.error\\\")\\n err_count += 1\\n for i, mapping_error in enumerate(self.mapping_errors):\\n # Append the error to the existing list of error\\n feature.setAttribute(\\\"mapping_errors{%d}.error\\\"%(i+err_count), mapping_error)\\n else:\\n # Mapping error list empty ===> Nothing to do\\n pass\\n else:\\n # Mapping error are not registered in FME attribute\\n pass\\n \\n # Output the feature to FME after processing all the attributes\\n self.pyoutput(feature)\\n \\n return\",\n \"def processAlgorithm(self, parameters, context, feedback):\\r\\n\\r\\n # Retrieve the feature source and sink. The 'dest_id' variable is used\\r\\n # to uniquely identify the feature sink, and must be included in the\\r\\n # dictionary returned by the processAlgorithm function.\\r\\n source = self.parameterAsSource(\\r\\n parameters,\\r\\n self.INPUT,\\r\\n context\\r\\n )\\r\\n source = self.parameterAsSource(\\r\\n parameters,\\r\\n self.INPUTBUFFER,\\r\\n context\\r\\n )\\r\\n source = self.parameterAsSource(\\r\\n parameters,\\r\\n self.INPUT2,\\r\\n context\\r\\n )\\r\\n source = self.parameterAsSource(\\r\\n parameters,\\r\\n self.INPUT3,\\r\\n context\\r\\n )\\r\\n source = self.parameterAsSource(\\r\\n parameters,\\r\\n self.INPUT4,\\r\\n context\\r\\n )\\r\\n source = self.parameterAsSource(\\r\\n parameters,\\r\\n self.INPUTSIZE,\\r\\n context\\r\\n )\\r\\n \\r\\n \\r\\n \\r\\n \\r\\n \\r\\n ## Obtain filepath from selected address layer, could not extend this functionality to work for actual layer inputs,\\r\\n ## resulted in instant crash if using the filePathFile, or 'INPUT1-4' as input for processing tools\\r\\n filePathFile = self.parameterDefinition('INPUT').valueAsPythonString(parameters['INPUT'], context)\\r\\n in_path = os.path.dirname(filePathFile[1:]) + '/'\\r\\n out_path = in_path \\r\\n \\r\\n \\r\\n bufferdist = self.parameterAsDouble(parameters, self.INPUTBUFFER,\\r\\n context)\\r\\n \\r\\n sigsize = self.parameterAsDouble(parameters, self.INPUTSIZE,\\r\\n context)\\r\\n \\r\\n\\r\\n ## Defining filepaths and filenames\\r\\n #############################################################################\\r\\n ## NEED TO BE MANUALLY DEFINED BY USER IF USING FILES WITH DIFFERENT NAMES ##\\r\\n #############################################################################\\r\\n ##Script set up for test 20 address file\\r\\n \\r\\n addressFile = \\\"AddressesTest.shp\\\"\\r\\n\\r\\n ## Uncomment below line for use with full address file (NOTE: SCRIPT WILL NOT COMPLETE DUE TO DATASET SIZE)\\r\\n ## addressFile = \\\"Addresses.shp\\\"\\r\\n\\r\\n ## Uses original parkland file as no geometry issues using zonal method\\r\\n parklandFile = \\\"Parkland2.shp\\\"\\r\\n \\r\\n hospitalFile = \\\"Hospitals.shp\\\"\\r\\n groceryFile = \\\"Grocery.shp\\\"\\r\\n \\r\\n \\r\\n ##############################################################################\\r\\n ##############################################################################\\r\\n #############################################################################\\r\\n\\r\\n ## Add address layer to view\\r\\n addressLayer = iface.addVectorLayer(in_path + addressFile, addressFile[:-4], 'ogr')\\r\\n\\r\\n ## Define parameter dictionary, and run buffer tool\\r\\n ## Output result to /Output/ folder\\r\\n bufferDict = {\\r\\n 'INPUT': addressLayer, \\r\\n 'DISTANCE': bufferdist, \\r\\n 'SEGMENTS': 10, \\r\\n 'ENDCAPSTYLE': 0, \\r\\n 'JOIN_STYLE':0,\\r\\n 'MITER_LIMIT':2,\\r\\n 'DISSOLVE_RESULT': False, \\r\\n 'OUTPUT': (out_path + 'buffer_' + addressFile)\\r\\n }\\r\\n processing.run('native:buffer', bufferDict)\\r\\n \\r\\n ## Define filename of buffered file\\r\\n bufferedFile = ('buffer_' + addressFile) \\r\\n\\r\\n ## Load buffered layer and hopsital layer to view\\r\\n bufferedLayer = iface.addVectorLayer(out_path + bufferedFile, bufferedFile[:-4], 'ogr') \\r\\n hospitalLayer = iface.addVectorLayer(in_path + hospitalFile, hospitalFile[:-4], 'ogr')\\r\\n\\r\\n ## Define parameter dictionary, and run count points in polygons tool\\r\\n ## Output result to /Output/ folder\\r\\n HcountDict = {\\r\\n 'CLASSFIELD' : '', \\r\\n 'FIELD' : 'Hcount', \\r\\n 'OUTPUT' : out_path + 'bufferHcount.shp', \\r\\n 'POINTS' : hospitalLayer, \\r\\n 'POLYGONS' : bufferedLayer, \\r\\n 'WEIGHT' : ''\\r\\n } \\r\\n processing.run('native:countpointsinpolygon', HcountDict)\\r\\n\\r\\n\\r\\n ## Define filename of buffers w/ hospital count, add layer to view\\r\\n HcountFile = 'bufferHcount.shp'\\r\\n HcountLayer = iface.addVectorLayer(out_path + HcountFile, HcountFile[:-4], 'ogr')\\r\\n\\r\\n ## Add grocery store layer to view\\r\\n groceryLayer = iface.addVectorLayer(in_path + groceryFile, groceryFile[:-4], 'ogr')\\r\\n\\r\\n ## Define parameter dictionary, and run points in polygons tool\\r\\n ## Output result to /Output/ folder\\r\\n GcountDict = {\\r\\n 'CLASSFIELD' : '', \\r\\n 'FIELD' : 'Gcount', \\r\\n 'OUTPUT' : out_path + 'bufferHGcount.shp', \\r\\n 'POINTS' : groceryLayer, \\r\\n 'POLYGONS' : HcountLayer, \\r\\n 'WEIGHT' : ''\\r\\n } \\r\\n processing.run('native:countpointsinpolygon', GcountDict)\\r\\n\\r\\n ## Define filename of buffers with hospital and store counts, and add layer to view \\r\\n HGcountFile = 'bufferHGcount.shp'\\r\\n HGcountLayer = iface.addVectorLayer(out_path + HGcountFile, HGcountFile[:-4], 'ogr')\\r\\n\\r\\n ## Add parkland layer to view\\r\\n parklandLayer = iface.addVectorLayer(in_path + parklandFile, parklandFile[:-4], 'ogr')\\r\\n\\r\\n ## Define parameter dictionary, and run buffer tool\\r\\n ## Output result to /Output/ folder\\r\\n parkbufferDict = {\\r\\n 'INPUT': parklandLayer, \\r\\n 'DISTANCE': 20, \\r\\n 'SEGMENTS': 10, \\r\\n 'ENDCAPSTYLE': 0, \\r\\n 'JOIN_STYLE':0,\\r\\n 'MITER_LIMIT':2,\\r\\n 'DISSOLVE_RESULT': True, \\r\\n 'OUTPUT': (out_path + 'buffer_' + parklandFile)\\r\\n }\\r\\n processing.run('native:buffer', parkbufferDict)\\r\\n\\r\\n ## Define filename of buffered dissolved parkland, add layer to view\\r\\n parkBufferFile = 'buffer_' + parklandFile\\r\\n parkBufferLayer = iface.addVectorLayer(out_path + parkBufferFile, parkBufferFile[:-4], 'ogr')\\r\\n\\r\\n ## Define parameter dictionary, and run negative buffer tool\\r\\n ## Output result to /Output/ folder \\r\\n parkNegbufferDict = {\\r\\n 'INPUT': parkBufferLayer, \\r\\n 'DISTANCE': -20, \\r\\n 'SEGMENTS': 10, \\r\\n 'ENDCAPSTYLE': 0, \\r\\n 'JOIN_STYLE':0,\\r\\n 'MITER_LIMIT':2,\\r\\n 'DISSOLVE_RESULT': False, \\r\\n 'OUTPUT': (out_path + 'dissolve_' + parklandFile)\\r\\n }\\r\\n processing.run('native:buffer', parkNegbufferDict)\\r\\n\\r\\n ## Define filename of de-buffered dissolved parkland, add layer to view\\r\\n parkDissolveFile = 'dissolve_' + parklandFile\\r\\n parkDissolveLayer = iface.addVectorLayer(out_path + parkDissolveFile, parkDissolveFile[:-4], 'ogr')\\r\\n\\r\\n ## Loop through the features in the de-buffered parkland layer, define parameter dictionary, and run multipart to singlepart tool\\r\\n ## Output result to /Output/ folder\\r\\n multiDict = { \\r\\n 'INPUT' : parkDissolveLayer, \\r\\n 'OUTPUT' : out_path + 'final_' + parklandFile\\r\\n }\\r\\n processing.run('native:multiparttosingleparts', multiDict)\\r\\n \\r\\n ## Define filename of de-buffered dissolved parkland, add layer to view\\r\\n finalParkFile = 'final_' + parklandFile\\r\\n finalParkLayer = iface.addVectorLayer(out_path + finalParkFile, finalParkFile[:-4], 'ogr')\\r\\n\\r\\n ## Define parameter dictionary, and run add geometry columns tool\\r\\n ## Output result to /Output/ folder\\r\\n geomDict = { \\r\\n 'CALC_METHOD' : 0, \\r\\n 'INPUT' : finalParkLayer, \\r\\n 'OUTPUT' : out_path + 'geom_'+ parklandFile\\r\\n }\\r\\n processing.run('qgis:exportaddgeometrycolumns', geomDict)\\r\\n\\r\\n ## Define filename of parkland w/ geometry, add layer to view\\r\\n parkGeomFile = 'geom_'+ parklandFile\\r\\n parkGeomLayer = iface.addVectorLayer(out_path + parkGeomFile, parkGeomFile[:-4], 'ogr')\\r\\n\\r\\n ## Define parameter dictionary, and run extract by attribute tool\\r\\n ## Output result to /Output/ folder\\r\\n extractDict = { \\r\\n 'FIELD' : 'area', \\r\\n 'INPUT' : out_path + parkGeomFile, \\r\\n 'OPERATOR' : 3, \\r\\n 'OUTPUT' : out_path + 'extract_'+ parklandFile, \\r\\n 'VALUE' : sigsize \\r\\n }\\r\\n processing.run('native:extractbyattribute', extractDict)\\r\\n \\r\\n ## Define extracted \\\"significant\\\" parkland filename, and add layer to view\\r\\n parkExtractFile = 'extract_'+ parklandFile\\r\\n parkExtractLayer = iface.addVectorLayer(out_path + parkExtractFile, parkExtractFile[:-4], 'ogr')\\r\\n\\r\\n extentDict = { \\r\\n 'INPUT' : out_path+parkExtractFile, \\r\\n 'OUTPUT' : out_path+'extent.shp', \\r\\n 'ROUND_TO' : 0 \\r\\n }\\r\\n processing.run('native:polygonfromlayerextent', extentDict)\\r\\n\\r\\n extentFile = out_path+'extent.shp'\\r\\n extentLayer = iface.addVectorLayer(extentFile, extentFile[:-4], 'ogr')\\r\\n extent = extentLayer.getFeatures()\\r\\n for feature in extent:\\r\\n extentAttributes = feature.attributes()\\r\\n extentString = str(str(extentAttributes[0])+','+str(extentAttributes[2])+','+str(extentAttributes[1])+','+str(extentAttributes[3])+'['+str(extentLayer.crs().authid())+']') \\r\\n print(extentString)\\r\\n\\r\\n rasterizeDict = {\\r\\n 'BURN' : 1, \\r\\n 'DATA_TYPE' : 5, \\r\\n 'EXTENT' : extentString, \\r\\n 'EXTRA' : '', \\r\\n 'FIELD' : '', \\r\\n 'HEIGHT' : 5000, \\r\\n 'INIT' : None, \\r\\n 'INPUT' : parkExtractLayer, \\r\\n 'INVERT' : False, \\r\\n 'NODATA' : 0, \\r\\n 'OPTIONS' : '', \\r\\n 'OUTPUT' : out_path+'Raster.tif', \\r\\n 'UNITS' : 0, \\r\\n 'WIDTH' : 5000\\r\\n }\\r\\n processing.run('gdal:rasterize', rasterizeDict)\\r\\n\\r\\n rasterFile = out_path+'Raster.tif'\\r\\n\\r\\n ## Define parameter dictionary, and run clip tool with extracted parkland layer as overlay on address buffers\\r\\n ## Output result to /Output/ folder\\r\\n zonalDict = { \\r\\n 'COLUMN_PREFIX' : 'Z_',\\r\\n 'INPUT_VECTOR' : out_path + HGcountFile,\\r\\n 'INPUT_RASTER' : rasterFile, \\r\\n 'OUTPUT' : out_path+'zonal_'+addressFile, \\r\\n 'RASTER_BAND' : 1 \\r\\n }\\r\\n processing.run('native:zonalhistogram', zonalDict)\\r\\n\\r\\n ## Define filename of clipped buffer layer, add layer to view\\r\\n zonalFile = 'zonal_'+ addressFile\\r\\n zonalLayer = iface.addVectorLayer(out_path + zonalFile, zonalFile[:-4], 'ogr')\\r\\n\\r\\n\\r\\n ## Create QgsdataProvider object, used for updating data fields in clipped buffers w/ geometry layer\\r\\n zonal_provider = zonalLayer.dataProvider()\\r\\n\\r\\n ## Use QgsdataProvider.addAttributes method to add empty QgsField objects corresponding to the normalised scores, and liveability score\\r\\n ## to the geomLayer file, QVariant.Double method used to create fields of data type \\\"double\\\"\\r\\n zonal_provider.addAttributes([QgsField('HospNorm',QVariant.Double)])\\r\\n zonal_provider.addAttributes([QgsField('GrocNorm',QVariant.Double)])\\r\\n zonal_provider.addAttributes([QgsField('ParkNorm',QVariant.Double)])\\r\\n zonal_provider.addAttributes([QgsField('LiveScore',QVariant.Double)])\\r\\n\\r\\n ## Update these new data fields and commit changes\\r\\n zonalLayer.updateFields()\\r\\n zonalLayer.commitChanges\\r\\n\\r\\n ## Define indexes for each count and area value in the geomLayer. This is to be able to easily obtain max value for each field, for normalisation equation\\r\\n hospIndex = zonalLayer.fields().indexFromName('Hcount')\\r\\n grocIndex = zonalLayer.fields().indexFromName('Gcount')\\r\\n parkIndex = zonalLayer.fields().indexFromName('Z_1')\\r\\n\\r\\n ## Get features of geomLayer for subsequent loop\\r\\n zonalAddresses = zonalLayer.getFeatures()\\r\\n\\r\\n ## Using a for loop, update the previously created fields with normalised scores, and lockdown liveability score\\r\\n ## This is done mathematically using each features value and the max value for that field\\r\\n for address in zonalAddresses:\\r\\n \\r\\n zonalLayer.startEditing()\\r\\n try: \\r\\n address['HospNorm'] = address['Hcount']/(zonalLayer.maximumValue(hospIndex))\\r\\n except:\\r\\n address['HospNorm'] = 0\\r\\n try:\\r\\n address['GrocNorm'] = address['Gcount']/(zonalLayer.maximumValue(grocIndex))\\r\\n except:\\r\\n address['GrocNorm'] = 0\\r\\n try:\\r\\n address['ParkNorm'] = address['Z_1']/(zonalLayer.maximumValue(parkIndex))\\r\\n except:\\r\\n address['ParkNorm'] = 0\\r\\n address['LiveScore'] = (address['HospNorm']+address['GrocNorm']+address['ParkNorm'])/3\\r\\n \\r\\n zonalLayer.updateFeature(address)\\r\\n\\r\\n ## Commit changes to data fields\\r\\n zonalLayer.commitChanges\\r\\n\\r\\n ## Define parameter dictionary, and run join tool to join final attributes back to original layer\\r\\n ## Output result to /Output/ folder\\r\\n joinDict = { \\r\\n 'INPUT' : in_path + addressFile,\\r\\n 'FIELD' : 'PFI',\\r\\n 'INPUT_2' : out_path + zonalFile,\\r\\n 'FIELD_2' : 'PFI', \\r\\n 'FIELDS_TO_COPY' : ['Hcount','Gcount','area','HospNorm','GrocNorm','ParkNorm','LiveScore'],\\r\\n 'METHOD' : 1, \\r\\n 'DISCARD_NONMATCHING' : False,\\r\\n 'PREFIX' : '',\\r\\n 'OUTPUT' : out_path+'final_'+ addressFile, \\r\\n 'NON_MATCHING': out_path+'nonmatching.shp'\\r\\n }\\r\\n processing.run('native:joinattributestable', joinDict)\\r\\n \\r\\n ## Define filename of final layer, and add final layer to view \\r\\n finalFile = 'final_'+ addressFile\\r\\n finalLayer = iface.addVectorLayer(out_path + finalFile, finalFile[:-4], 'ogr')\\r\\n\\r\\n\\r\\n\\r\\n return {}\",\n \"def combine_features(feature1, feature2):\\n new_feature = Feature()\\n new_feature.coord = feature1.coord.copy()\\n for x in feature2.coord:\\n new_feature.coord.append(x)\\n return new_feature\",\n \"def execute(self, parameters, messages):\\r\\n arcpy.AddMessage(\\\"\\\\nPerforming overall merge...\\\")\\r\\n logging.info(\\\"Starting mergeAreas.py script...\\\\n\\\")\\r\\n # Define variables from parameters\\r\\n overlapWorkspace = parameters[0].valueAsText\\r\\n gdbWorkspace = parameters[1].valueAsText\\r\\n featWorkspace = parameters[2].valueAsText\\r\\n\\r\\n # Determine list of total overlap, no overlap and to merge feature classes in overlap feature dataset workspace to process.\\r\\n arcpy.env.workspace = overlapWorkspace\\r\\n mergeList = arcpy.ListFeatureClasses(\\\"*_toMerge\\\")\\r\\n totalOverlapList = arcpy.ListFeatureClasses(\\\"*_TotalOverlap\\\")\\r\\n noOverlapList = arcpy.ListFeatureClasses(\\\"*_noOverlap\\\")\\r\\n if len(mergeList) > 0:\\r\\n arcpy.AddMessage(\\\"Workspace contains the following \\\" + str(len(mergeList)) + \\\" feature classes to merge: \\\" + str(mergeList))\\r\\n\\r\\n # Organize toMerge feature classes by date\\r\\n mergeDictbyDate = {}\\r\\n for fc in mergeList:\\r\\n fcPath = os.path.join(overlapWorkspace, fc)\\r\\n fcDate = fc.split(\\\"_\\\")[1]\\r\\n mergeDictbyDate[fcDate] = [fcPath]\\r\\n\\r\\n # Append no overlap feature classes toMerge feature classes by date\\r\\n for noOverlapFc in noOverlapList:\\r\\n noOverlapPath = os.path.join(overlapWorkspace, noOverlapFc)\\r\\n noOverlapDate = noOverlapFc.split(\\\"_\\\")[1]\\r\\n mergeDictbyDate[noOverlapDate].append(noOverlapPath)\\r\\n\\r\\n # Organize dark targets feature classes by date\\r\\n arcpy.env.workspace = featWorkspace\\r\\n fcList = arcpy.ListFeatureClasses()\\r\\n fcDictByDate = {}\\r\\n for fc in fcList:\\r\\n fcPath = os.path.join(featWorkspace, fc)\\r\\n fcSplit = fc.split(\\\"_\\\")\\r\\n if fcSplit[1] in fcDictByDate:\\r\\n fcDictByDate[fcSplit[1]].append(fcPath)\\r\\n else:\\r\\n fcDictByDate[fcSplit[1]] = [fcPath]\\r\\n\\r\\n # Iterate through dark targets acquisition dates and check for acquisition dates with more than a single feature class (for merging)\\r\\n for key in fcDictByDate:\\r\\n if len(fcDictByDate[key]) > 1:\\r\\n\\r\\n # Iterate through feature classes within acquisition date\\r\\n for fc in fcDictByDate[key]:\\r\\n fcSplit = fc.split(\\\"_\\\")\\r\\n\\r\\n # Check for and add acquisition date toMerge feature classes if not already present\\r\\n if fcSplit[len(fcSplit)-2] not in mergeDictbyDate:\\r\\n mergeDictbyDate[fcSplit[len(fcSplit)-2]] = [fc]\\r\\n\\r\\n # Check for and add feature class toMerge feature classes if not already present within acquisition date\\r\\n else:\\r\\n fcValue = fc.split(\\\"\\\\\\\\\\\")[len(fc.split(\\\"\\\\\\\\\\\"))-1] + \\\"_noOverlap\\\"\\r\\n fcValuePath = os.path.join(overlapWorkspace, fcValue)\\r\\n if fcValuePath not in mergeDictbyDate[key]:\\r\\n mergeDictbyDate[key].append(fc)\\r\\n\\r\\n # Iterate through dark targets acquisition dates to compile lists of feature classes to merge\\r\\n for key in mergeDictbyDate:\\r\\n arcpy.AddMessage(\\\"\\\\nMerging feature classes in \\\" + key + \\\"...\\\")\\r\\n logging.info(\\\"Processing merges for acquisition date '%s'\\\", key)\\r\\n mergeList = []\\r\\n\\r\\n # Iterate through feature classes within acquisition date and append them to merge list\\r\\n for item in mergeDictbyDate[key]:\\r\\n mergeList.append(item)\\r\\n\\r\\n # Merge feature classes in merge list into single feature class for the acquisition date\\r\\n outputDissolveString = \\\"RS2_\\\" + key + \\\"_toDissolve\\\"\\r\\n outputDissolve = os.path.join(overlapWorkspace, outputDissolveString)\\r\\n arcpy.Merge_management(mergeList, outputDissolve)\\r\\n logging.info(\\\"Merge: '%s' created from merging the following feature classes: '%s'\\\", outputDissolve, str(mergeList))\\r\\n\\r\\n # Dissolve attribute duplicates and rename fields\\r\\n arcpy.AddMessage(\\\"Dissolving...\\\")\\r\\n dissolveLyr = \\\"dissolveLyr\\\"\\r\\n outputMergeString = \\\"RS2_\\\" + key + \\\"_merged\\\"\\r\\n outputMerge = os.path.join(gdbWorkspace, outputMergeString)\\r\\n dissolveFields = [\\\"Pid\\\", \\\"RsatID\\\"]\\r\\n fieldList = arcpy.ListFields(outputDissolve)\\r\\n statsFields = []\\r\\n for field in fieldList:\\r\\n if \\\"OBJECTID\\\" in field.name or \\\"FID\\\" in field.name or \\\"Shape\\\" in field.name or field.name in dissolveFields or field.name == \\\"ID\\\":\\r\\n continue\\r\\n statsField = [field.name,\\\"FIRST\\\"]\\r\\n statsFields.append(statsField)\\r\\n arcpy.MakeFeatureLayer_management(outputDissolve, dissolveLyr)\\r\\n logging.info(\\\"Make Feature Layer: '%s' layer created from '%s' feature class\\\", dissolveLyr, outputDissolve)\\r\\n arcpy.Dissolve_management(dissolveLyr, outputMerge, dissolveFields, statsFields)\\r\\n logging.info(\\\"Dissolve: '%s' feature class created from '%s' layer dissolve\\\", outputMerge, dissolveLyr)\\r\\n fieldList = arcpy.ListFields(outputMerge)\\r\\n for field in fieldList:\\r\\n if field.name.startswith(\\\"FIRST_\\\"):\\r\\n newName = field.name[6:]\\r\\n arcpy.AlterField_management(outputMerge, field.name, newName)\\r\\n\\r\\n # Update targetID with combined target ID for overlapping features\\r\\n arcpy.AddMessage(\\\"Updating targetID...\\\")\\r\\n finalOutputString = \\\"RS2_\\\" + key\\r\\n overlapBool = False\\r\\n\\r\\n # Iterate through total overlap feature classes\\r\\n for fc in totalOverlapList:\\r\\n\\r\\n # Check for merged acquisition date feature class containing overlapping features (by finding equivalent total overlap feature class)\\r\\n if finalOutputString == fc.strip(\\\"_TotalOverlap\\\"):\\r\\n overlapBool = True\\r\\n\\r\\n # Perform spatial join to access targetID field from total overlap feature class\\r\\n totalOverlapFc = os.path.join(overlapWorkspace, fc)\\r\\n finalOutput = os.path.join(gdbWorkspace, finalOutputString)\\r\\n fieldmappings = arcpy.FieldMappings()\\r\\n fieldmappings.addTable(outputMerge)\\r\\n fldmap_TARGETID = arcpy.FieldMap()\\r\\n fldmap_TARGETID.addInputField(totalOverlapFc, \\\"targetID\\\")\\r\\n fld_TARGETID = fldmap_TARGETID.outputField\\r\\n fld_TARGETID.name = \\\"targetID_1\\\"\\r\\n fldmap_TARGETID.outputField = fld_TARGETID\\r\\n fieldmappings.addFieldMap(fldmap_TARGETID)\\r\\n arcpy.SpatialJoin_analysis(outputMerge, totalOverlapFc, finalOutput, \\\"#\\\", \\\"#\\\", fieldmappings)\\r\\n logging.info(\\\"Spatial Join: '%s' feature class created by joining '%s' with '%s'\\\", finalOutput, outputMerge, totalOverlapFc)\\r\\n\\r\\n # Update targetID with combined targetID determined from total overlap feature class\\r\\n expression = \\\"copyTargetID(!targetID!, !targetID_1!)\\\"\\r\\n codeblock = \\\"\\\"\\\"def copyTargetID(targetID, comb_targetID):\\r\\n if comb_targetID is None:\\r\\n return targetID\\r\\n else:\\r\\n return comb_targetID\\\"\\\"\\\"\\r\\n arcpy.CalculateField_management(finalOutput, \\\"targetID\\\", expression, \\\"PYTHON_9.3\\\", codeblock)\\r\\n logging.info(\\\"Calculate Field: 'targetID' field value calculated for '%s' feature class\\\", finalOutput)\\r\\n\\r\\n # Delete extraneous fields\\r\\n arcpy.DeleteField_management(finalOutput, \\\"targetID_1\\\")\\r\\n arcpy.DeleteField_management(finalOutput, \\\"Join_Count\\\")\\r\\n arcpy.DeleteField_management(finalOutput, \\\"TARGET_FID\\\")\\r\\n\\r\\n # Rename merged acquisition date feature class to appropriate name if it does not contain overlapping targets\\r\\n if overlapBool is False:\\r\\n arcpy.Rename_management(outputMerge, finalOutputString)\\r\\n logging.info(\\\"Rename: '%s' feature class renamed to '%s'\\\", outputMerge, finalOutputString)\\r\\n\\r\\n # Delete unneeded process outputs (dissolve and merge outputs)\\r\\n arcpy.Delete_management(outputDissolve)\\r\\n logging.info(\\\"Delete: '%s' feature class deleted\\\", outputDissolve)\\r\\n if arcpy.Exists(outputMerge):\\r\\n arcpy.Delete_management(outputMerge)\\r\\n logging.info(\\\"Delete: '%s' feature class deleted\\\", outputMerge)\\r\\n\\r\\n logging.info(\\\"Processing for merges for acquisition date '%s' complete\\\\n\\\", key)\\r\\n\\r\\n # Iterate through dark targets acquisition dates to export single feature classes\\r\\n arcpy.AddMessage(\\\"\\\\nExporting single feature classes...\\\")\\r\\n logging.info(\\\"Processing single feature classes to export\\\")\\r\\n for key in fcDictByDate:\\r\\n if len(fcDictByDate[key]) == 1:\\r\\n for fc in fcList:\\r\\n fcSplit = fc.split(\\\"_\\\")\\r\\n if fcSplit[1] in mergeDictbyDate:\\r\\n continue\\r\\n else:\\r\\n outputFeatureName = \\\"RS2_\\\" + fcSplit[1]\\r\\n arcpy.FeatureClassToFeatureClass_conversion(fc, gdbWorkspace, outputFeatureName, \\\"#\\\", \\\"#\\\", )\\r\\n logging.info(\\\"Feature Class to Feature Class: '%s' feature class converted to '%s'\\\", fc, outputFeatureName)\\r\\n outputFeatPath = os.path.join(gdbWorkspace, outputFeatureName)\\r\\n arcpy.DeleteField_management(outputFeatPath, \\\"FID\\\")\\r\\n logging.info(\\\"Processing of single feature classes to export complete\\\")\\r\\n\\r\\n logging.info(\\\"mergeAreas.py script finished\\\\n\\\\n\\\")\\r\\n\\r\\n return\",\n \"def fdr_control(self, output_features):\\n # Map output feature names\\n output_feature_map = {output_feature.name: output_feature for output_feature in output_features}\\n # Update saved hierarchy with FDR-controlled results\\n queue = deque()\\n root = self.features[0].root\\n queue.append(root)\\n while queue:\\n parent = queue.popleft()\\n if not parent.children:\\n continue\\n pvalues = np.ones(len(parent.children))\\n for idx, child in enumerate(parent.children):\\n child.copy_attributes(output_feature_map[child.name])\\n pvalues[idx] = child.overall_pvalue\\n adjusted_pvalues, rejected_hypotheses = bh_procedure(pvalues, self.args.importance_significance_level)\\n for idx, child in enumerate(parent.children):\\n child.overall_pvalue = adjusted_pvalues[idx]\\n child.important = rejected_hypotheses[idx]\\n if child.important:\\n queue.append(child)\\n else:\\n child.window_important = False\\n child.ordering_important = False\\n child.window_ordering_important = False\",\n \"def derive_features(self):\\n\\n temp = int(self.stop_id)\\n\\n while temp not in self.stops_latlon.keys():\\n if temp < 7692:\\n temp += 1\\n else:\\n while temp not in self.stops_latlon.keys():\\n temp -= 1\\n\\n self.latitude = self.stops_latlon[temp][0]\\n self.longitude = self.stops_latlon[temp][1]\\n\\n self.distance_centre = FormatInput.haversine(self.latitude, self.longitude)\\n\\n self.cluster = FormatInput.map_stop_to_cluster(self.cluster_map, self.stop_id)\\n\\n self.holiday = FormatInput.add_holiday(self.date)\",\n \"def _insert_stops_many_to_many(self):\\r\\n # Store data of the relevant origins and destinations in dictionaries for quick lookups and reuse\\r\\n o_data = {} # {Origin ID: [Shape, transferred fields]}\\r\\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_origins_layer,\\r\\n [self.origin_id_field, \\\"SHAPE@\\\"] + self.origin_transfer_fields\\r\\n ):\\r\\n o_data[row[0]] = row[1:]\\r\\n d_data = {} # {Destination ID: [Shape, transferred fields]}\\r\\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\\r\\n self.input_destinations_layer,\\r\\n [self.dest_id_field, \\\"SHAPE@\\\"] + self.destination_transfer_fields\\r\\n ):\\r\\n d_data[row[0]] = row[1:]\\r\\n\\r\\n # Insert origins from each OD pair into the Route analysis\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.origin_unique_id_field_name, \\\"SHAPE@\\\"] + self.origin_transfer_fields\\r\\n ) as icur:\\r\\n for od_pair in self.od_pairs:\\r\\n origin_id, dest_id = od_pair\\r\\n try:\\r\\n origin_data = o_data[origin_id]\\r\\n except KeyError:\\r\\n # This should never happen because we should have preprocessed this out.\\r\\n self.logger.debug(\\r\\n f\\\"Origin from OD Pairs not found in inputs. Skipped pair {od_pair}.\\\")\\r\\n continue\\r\\n route_name = f\\\"{origin_id} - {dest_id}\\\"\\r\\n icur.insertRow((route_name, 1, origin_id) + origin_data)\\r\\n\\r\\n # Insert destinations from each OD pair into the Route analysis\\r\\n with self.rt_solver.insertCursor(\\r\\n arcpy.nax.RouteInputDataType.Stops,\\r\\n [\\\"RouteName\\\", \\\"Sequence\\\", self.dest_unique_id_field_name, \\\"SHAPE@\\\"] + self.destination_transfer_fields\\r\\n ) as icur:\\r\\n for od_pair in self.od_pairs:\\r\\n origin_id, dest_id = od_pair\\r\\n try:\\r\\n dest_data = d_data[dest_id]\\r\\n except KeyError:\\r\\n # This should never happen because we should have preprocessed this out.\\r\\n self.logger.debug(\\r\\n f\\\"Destination from OD Pairs not found in inputs. Skipped pair {od_pair}.\\\")\\r\\n continue\\r\\n route_name = f\\\"{origin_id} - {dest_id}\\\"\\r\\n icur.insertRow((route_name, 2, dest_id) + dest_data)\",\n \"def main():\\n # IMPORTANT: Specify a path to the new shapefile!\\n data_dir = os.path.join(\\\"C:\\\\\\\\\\\",\\\"Users\\\",\\\"janni\\\",\\\"OneDrive\\\",\\\"Desktop\\\",\\\"data\\\")\\n\\n #Store route identification codes in to a list\\n L_tracks=['\\\"tag_ident\\\"=72413','\\\"tag_ident\\\"=72417','\\\"tag_ident\\\"=73053','\\\"tag_ident\\\"=72364',\\\\\\n '\\\"tag_ident\\\"=73054','\\\"tag_ident\\\"=79694','\\\"tag_ident\\\"=79698']\\n\\n if(os.path.isdir(data_dir)):\\n print(\\\"Very good! You have chosen a valid directory!\\\")\\n # load the point shapefile of the white-fronted goose manually!\\n # access the active layer\\n point_layer = iface.activeLayer()\\n if not point_layer:\\n print(\\\"Shape file failed to load!\\\")\\n else:\\n # 1\\n addTimeAndDateObs(point_layer)\\n print(\\\"-----------Created Date and Time objects-------------\\\")\\n # 2\\n addDistance(point_layer, L_tracks)\\n print(\\\"-----------Distances calculation finished-------------\\\")\\n # 3\\n extractPoints(point_layer,Statistics(point_layer),data_dir)\\n print(\\\"-----------Low distance points extracted and save to a new shapefile-------------\\\")\\n print('Done')\\n\\n raster_fn = os.path.join(data_dir,\\\"Eurasia_Landcover.tif\\\")\\n landuse_legend_fn = os.path.join(data_dir,'Eurasia_Landcover_Legend.csv')\\n in_shape_fn = os.path.join(data_dir,\\\"lowDistance.shp\\\")\\n out_shape_fn = os.path.join(data_dir,\\\"lowDistanceLanduseID.shp\\\")\\n\\n\\n if(QgsProject.instance().mapLayersByName('lowDistanceLanduseID')==[]):\\n processing.run(\\\"qgis:rastersampling\\\",\\n {'COLUMN_PREFIX' : 'LanduseNr_',\\n 'INPUT' : in_shape_fn,\\n 'OUTPUT' : out_shape_fn,\\n 'RASTERCOPY' : raster_fn})\\n updated_shapefile = iface.addVectorLayer(out_shape_fn, '', 'ogr')\\n else:\\n updated_shapefile = QgsProject.instance().mapLayersByName('lowDistanceLanduseID')[0]\\n #2\\n convertIdFloatToInt(updated_shapefile)\\n #3\\n legend = preProcessLegend(landuse_legend_fn)\\n #4\\n convertIdToName(legend,updated_shapefile)\\n #5\\n plotLandUse(updated_shapefile,\\\"Pie\\\")\\n print(\\\"-----------finished!-------------\\\")\\n print(\\\"DONE! :)\\\")\\n else:\\n iface.messageBar().pushMessage(\\\"Error\\\", \\\"The directory does not exist. Please change data_dir in the code\\\",level = 1)\\n print(\\\"Please specify a valid directory in the main function of Code_Distance.py!\\\")\",\n \"def merge_energy_datatypes(osm_path): \\n #extract line data\\n df_line = powerline_limited(osm_path) #extract required data\\n if 'asset' in df_line.columns:\\n df_line['asset'] = list(map(lambda x: x.lower(), df_line['asset'])) #make sure that asset column is in lowercase characters\\n #reclassify assets \\n mapping_dict = {\\n \\\"cable\\\" : \\\"cable\\\", #underground\\n \\\"minor_cable\\\" : \\\"cable\\\", \\n #\\\"generator\\\" : \\\"generator\\\", #device used to convert power from one form to another\\n \\\"line\\\" : \\\"line\\\", #overground\\n \\\"minor_line\\\" : \\\"minor_line\\\", #overground\\n #\\\"plant\\\" : \\\"plant\\\", #place where power is generated\\n #\\\"substation\\\" : \\\"substation\\\"\\n }\\n df_line['asset'] = df_line.asset.apply(lambda x : mapping_dict[x]) #reclassification \\n\\n if 'voltage' in df_line.columns:\\n df_line = df_line.drop(['voltage'], axis=1) \\n \\n #extract polygon data\\n df_poly = power_polygon(osm_path) #extract required data\\n df_poly['geometry'] =pygeos.buffer(df_poly.geometry,0) #avoid intersection\\n \\n #extract point data\\n df_point = power_point(osm_path) #extract required data\\n \\n return pandas.concat([df_line, df_poly, df_point], ignore_index=True)\",\n \"def _update(self, features: DataFrameLike) -> None:\\n # add features\\n self._features = (\\n pd.concat([self._features, features], axis=1, sort=True)\\n # fill nans resulting from concatenation where features does not\\n # contain neighborless nodes (out-degree=0) on its axis\\n .fillna(0)\\n )\\n # prune redundant features\\n pruner = FeaturePruner(self._final_features, self._feature_group_thresh)\\n features_to_drop = pruner.prune_features(self._features)\\n self._features = self._features.drop(features_to_drop, axis=1)\\n # save features that remain after pruning and that\\n # have not previously been saved as final features\\n retained = features.columns.difference(features_to_drop)\\n feature_dict = as_frame(self._features[retained]).to_dict()\\n self._final_features[self.generation_count] = feature_dict\",\n \"def r_to_ws(road_fn, ws, paths, ta):\\n\\n # Open the road data source and find distinct road classes from 'tag' field\\n source_ds = ogr.Open(road_fn)\\n source_layer = source_ds.GetLayer()\\n feature = source_layer.GetNextFeature()\\n field_vals = set([feature.GetFieldAsString('tag') for feature in source_layer])\\n\\n # Read excel file with walking speeds into pandas dataframe and sort\\n costs = pd.read_csv(ws)\\n costs = costs.sort_values(by=['Walking_Speed'], ascending=False)\\n # TODO: Consider whether we should take into account congestion, crossings etc\\n if paths is False:\\n print()\\n # TODO: if False remove paths from pandas dataframe.... \\n\\n # blank array to use in first back fill\\n arr1 = ta.dst_ds.GetRasterBand(1).ReadAsArray()\\n\\n # Loop through road costs dataframe\\n for index, row in costs.iterrows():\\n\\n # use fuzzy match spreadsheet road classes to polyline road classes\\n match = process.extractOne(row[0], field_vals)\\n\\n # create SQL string to select one polyline road class at a time\\n # formatted string of SQL statement where match[0] = road feature class\\n sql_str = f\\\"SELECT * FROM AllRoads WHERE tag='{match[0]}'\\\" \\n\\n # rasterize one road class at a time using value from input csv\\n # to in-memory array sized based on landcover input\\n opt = gdal.RasterizeOptions(burnValues=row[1], # walking speed value to assign to pixel from input csv\\n allTouched=True, # value assigned to all pixels touched by line\\n SQLStatement=sql_str, # use above SQL string\\n SQLDialect='SQLITE')\\n gdal.Rasterize(ta.dst_ds, road_fn, options=opt) #(in-memory array, road shapefile, above options)\\n\\n # FIXME: \\n # Warning 1: The input vector layer has a SRS, but the output raster dataset SRS is unknown.\\n # Ensure output raster dataset has the same SRS, otherwise results might be incorrect.\\n\\n # get array from in-memory rasterized layer\\n arr = ta.dst_ds.GetRasterBand(1).ReadAsArray()\\n\\n # create one layer of all roads prioritising based on rasterizing order\\n arr1 = backfill(arr, arr1)\\n\\n return arr1\",\n \"def to_segmentation_task(\\n self, keep_geometries: Optional[List] = [Polygon, Bitmap], target_classes=None\\n ) -> Tuple[ProjectMeta, Dict[ObjClass, ObjClass]]:\\n mapping = {}\\n res_classes = []\\n for obj_class in self.obj_classes:\\n obj_class: ObjClass\\n\\n if target_classes is None or obj_class.name in target_classes:\\n if obj_class.geometry_type in keep_geometries:\\n if obj_class.geometry_type == Bitmap:\\n mapping[obj_class] = obj_class\\n res_classes.append(obj_class)\\n else:\\n new_class = obj_class.clone(geometry_type=Bitmap)\\n mapping[obj_class] = new_class\\n res_classes.append(new_class)\\n else:\\n mapping[obj_class] = None\\n else:\\n mapping[obj_class] = None\\n\\n res_meta = self.clone(obj_classes=ObjClassCollection(res_classes))\\n return res_meta, mapping\",\n \"def process(self, data):\\n allocating = (self._output is None)\\n ind = 0\\n for i, (name, feature) in enumerate(self.features):\\n if allocating:\\n x = feature.compute(data)\\n self.feature_indices[name] = (ind, ind+x.size)\\n ind += x.size\\n\\n if self._output is None:\\n self._output = x\\n else:\\n self._output = np.hstack([self._output, x])\\n else:\\n self._output[self.feature_indices[name][0]:\\n self.feature_indices[name][1]] = \\\\\\n feature.compute(data)\\n\\n return self._output\",\n \"def add_building_output_locations(self,area_id,start,end,step,type='BUILDINGS_AS_HOLES'): \\n print \\\"Getting buildings locations...\\\"\\n \\n dictionary = self.grid.get_building_output_locations(area_id,type)\\n if (dictionary != {}):\\n self.run_nc.add_building_output_locations(dictionary, start, end,step)\",\n \"def execute(self, parameters, messages):\\r\\n\\t\\tin_wikiplace_IRI = parameters[0]\\r\\n\\t\\tin_location_property = parameters[1]\\r\\n\\t\\tin_relation_degree = parameters[2]\\r\\n\\t\\tout_location = parameters[3]\\r\\n\\t\\tout_points_name = parameters[4]\\r\\n\\r\\n\\t\\t\\r\\n\\t\\tif in_wikiplace_IRI.value:\\r\\n\\t\\t\\tinputFeatureClassName = in_wikiplace_IRI.valueAsText\\r\\n\\t\\t\\tlocationCommonPropertyNameCount = in_location_property.valueAsText\\r\\n\\t\\t\\trelationDegree = int(in_relation_degree.valueAsText)\\r\\n\\t\\t\\toutLocation = out_location.valueAsText\\r\\n\\t\\t\\toutFeatureClassName = out_points_name.valueAsText\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tlastIndexOFGDB = inputFeatureClassName.rfind(\\\"\\\\\\\\\\\")\\r\\n\\t\\t\\toriginFeatureClassName = inputFeatureClassName[(lastIndexOFGDB+1):]\\r\\n\\r\\n\\t\\t\\tif outLocation.endswith(\\\".gdb\\\") == False:\\r\\n\\t\\t\\t\\tmessages.addErrorMessage(\\\"Please enter a file geodatabase as the file location for output feature class.\\\")\\r\\n\\t\\t\\t\\traise arcpy.ExecuteError\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tarcpy.env.workspace = outLocation\\r\\n\\r\\n\\t\\t\\t\\tendFeatureClassName = outLocation + \\\"\\\\\\\\\\\" + outFeatureClassName\\r\\n\\t\\t\\t\\tif arcpy.Exists(endFeatureClassName):\\r\\n\\t\\t\\t\\t\\tmessages.addErrorMessage(\\\"The output feature class name already exists in current workspace!\\\")\\r\\n\\t\\t\\t\\t\\traise arcpy.ExecuteError\\r\\n\\t\\t\\t\\telse:\\r\\n\\r\\n\\t\\t\\t\\t\\t# get all the IRI from input point feature class of wikidata places\\r\\n\\t\\t\\t\\t\\tinplaceIRIList = []\\r\\n\\t\\t\\t\\t\\tcursor = arcpy.SearchCursor(inputFeatureClassName)\\r\\n\\t\\t\\t\\t\\tfor row in cursor:\\r\\n\\t\\t\\t\\t\\t\\tinplaceIRIList.append(row.getValue(\\\"URL\\\"))\\r\\n\\r\\n\\t\\t\\t\\t\\tif relationDegree > 4:\\r\\n\\t\\t\\t\\t\\t\\trelationDegree = 4\\r\\n\\t\\t\\t\\t\\t\\tin_relation_degree.value = 4\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tlocationCommonPropertyURL = LocationPropertyPath.locationCommonPropertyDict[locationCommonPropertyNameCount]\\r\\n\\t\\t\\t\\t\\tlocationLinkageRelationJSONObj = SPARQLQuery.locationLinkageRelationQuery(inplaceIRIList, locationCommonPropertyURL, relationDegree)\\r\\n\\t\\t\\t\\t\\tlocationLinkageRelationJSON = locationLinkageRelationJSONObj[\\\"results\\\"][\\\"bindings\\\"]\\r\\n\\r\\n\\t\\t\\t\\t\\tendPlaceIRISet = Set()\\r\\n\\t\\t\\t\\t\\tfor jsonItem in locationLinkageRelationJSON:\\r\\n\\t\\t\\t\\t\\t\\tendPlaceIRISet.add(jsonItem[\\\"end\\\"][\\\"value\\\"])\\r\\n\\r\\n\\t\\t\\t\\t\\tendPlaceIRIList = list(endPlaceIRISet)\\r\\n\\r\\n\\t\\t\\t\\t\\t# endPlaceJSONObj = SPARQLQuery.endPlaceInformationQuery(endPlaceIRIList)\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tendPlaceJSON = SPARQLQuery.endPlaceInformationQuery(endPlaceIRIList)\\r\\n\\r\\n\\t\\t\\t\\t\\tJson2Field.creatPlaceFeatureClassFromJSON(endPlaceJSON, endFeatureClassName, None, \\\"\\\")\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t\\tlastIndex = locationCommonPropertyNameCount.rfind(\\\"(\\\")\\r\\n\\t\\t\\t\\t\\tlocationCommonPropertyName = locationCommonPropertyNameCount[:lastIndex]\\r\\n\\t\\t\\t\\t\\tlocationLinkageTableName = Json2Field.createLocationLinkageMappingTableFromJSON(locationLinkageRelationJSON, \\\"origin\\\", \\\"end\\\", inputFeatureClassName, endFeatureClassName, locationCommonPropertyURL, locationCommonPropertyName, relationDegree)\\r\\n\\r\\n\\t\\t\\t\\t\\tendFeatureRelationshipClassName = outFeatureClassName + \\\"_\\\" + locationLinkageTableName + \\\"_RelClass\\\"\\r\\n\\t\\t\\t\\t\\tarcpy.CreateRelationshipClass_management(outFeatureClassName, locationLinkageTableName, endFeatureRelationshipClassName, \\\"SIMPLE\\\",\\r\\n\\t\\t\\t\\t\\t\\t\\\"is \\\"+ locationCommonPropertyName + \\\"of\\\", locationCommonPropertyName,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\\"FORWARD\\\", \\\"ONE_TO_MANY\\\", \\\"NONE\\\", \\\"URL\\\", \\\"end\\\")\\r\\n\\r\\n\\t\\t\\t\\t\\toriginFeatureRelationshipClassName = originFeatureClassName + \\\"_\\\" + locationLinkageTableName + \\\"_RelClass\\\"\\r\\n\\t\\t\\t\\t\\tarcpy.CreateRelationshipClass_management(originFeatureClassName, locationLinkageTableName, originFeatureRelationshipClassName, \\\"SIMPLE\\\",\\r\\n\\t\\t\\t\\t\\t\\tlocationCommonPropertyName, \\\"is \\\"+ locationCommonPropertyName + \\\"of\\\",\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\\"FORWARD\\\", \\\"ONE_TO_MANY\\\", \\\"NONE\\\", \\\"URL\\\", \\\"origin\\\")\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\r\\n\\r\\n\\t\\treturn\",\n \"def PrepareWorkspace():\\n \\n # define expected file paths for file gdb folder, fgdb, taxi feature class \\n fgdb_folder = constants.fgdb_folder\\n fgdb_name = constants.taxi_fgdb_name\\n file_gdb = os.path.join(fgdb_folder, fgdb_name)\\n taxi_feature_class_name = \\\"TaxiLocations\\\"\\n taxi_feature_class = os.path.join(file_gdb, taxi_feature_class_name)\\n \\n out_coordinate_system = arcpy.SpatialReference('WGS 1984') # define output spatial reference\\n \\n if not os.path.exists(fgdb_folder): # if file gdb folder has not been created\\n os.mkdir(fgdb_folder) # create the folder\\n if not arcpy.Exists(file_gdb): # if file gdb has not been created\\n arcpy.CreateFileGDB_management(fgdb_folder, fgdb_name) # create the file gdb\\n \\n if not arcpy.Exists(taxi_feature_class): # if the taxi feature class does not exist\\n # create the point feature class in WGS84 spatial reference\\n arcpy.CreateFeatureclass_management(file_gdb, \\n taxi_feature_class_name, \\n \\\"Point\\\", \\n spatial_reference=out_coordinate_system) # create a point feature class with defined coordinate system\\n \\n arcpy.TruncateTable_management(taxi_feature_class) # delete existing features in the feature class\\n \\n return file_gdb, taxi_feature_class # return fgdb and feature class path to main\\n \\n \\n # %%\",\n \"def _link_single_worker(self):\\n self.det_link_map = OrderedDict()\\n self.id_link_map = OrderedDict()\\n\\n # Single-process implementation\\n # For each UID, cur_anno and cur_decl are relevant\\n for uid in np.unique(self.annotations_table.uid.values):\\n cur_anno = self.annotations_table[\\n self.annotations_table.uid.values == uid\\n ]\\n cur_decl = self.declarations_table[\\n self.declarations_table.uid.values == uid\\n ]\\n\\n anno_frames = cur_anno.frame.values\\n decl_frames = cur_decl.frame.values\\n\\n # For each frame, frame_anno and frame_decl are relevant. We don't\\n # have to loop over decl_frames, since any decl with decl_frame not\\n # present in anno_frames can't be linked to any annots\\n for frame in np.unique(anno_frames):\\n frame_anno = cur_anno[anno_frames == frame]\\n frame_decl = cur_decl[decl_frames == frame]\\n\\n # Note that due to PANDAS index magic, the resulting\\n # links and id_links map key values are the global indices, and\\n # not simply [1 ... len(frame_anno)]\\n links, id_links = self._link_frame(frame_anno, frame_decl)\\n\\n self.det_link_map.update(links)\\n self.id_link_map.update(id_links)\",\n \"def _merge_boundaries(self):\\n \\n optical_seg = self._amalgamated_optical_segments\\n if bool(optical_seg):\\n optical_seg[\\\"catagory\\\"] = OPTICAL * tf.ones_like(\\n optical_seg[\\\"x_start\\\"],\\n dtype=tf.int64\\n )\\n self._optical_seg_count = tf.shape(\\n optical_seg[\\\"x_start\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._optical_seg_count = 0\\n \\n stop_seg = self._amalgamated_stop_segments\\n if bool(stop_seg):\\n stop_seg[\\\"catagory\\\"] = STOP * tf.ones_like(\\n stop_seg[\\\"x_start\\\"],\\n dtype=tf.int64\\n )\\n self._stop_seg_count = tf.shape(\\n stop_seg[\\\"x_start\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._stop_seg_count = 0\\n \\n target_seg = self._amalgamated_target_segments\\n if bool(target_seg):\\n target_seg[\\\"catagory\\\"] = TARGET * tf.ones_like(\\n target_seg[\\\"x_start\\\"],\\n dtype=tf.int64\\n )\\n self._target_seg_count = tf.shape(\\n target_seg[\\\"x_start\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._target_seg_count = 0\\n \\n self._merged_segments = amalgamate(\\n [optical_seg, stop_seg, target_seg], \\n SEGMENT_GEO_SIG | {\\\"catagory\\\"}\\n )\\n \\n optical_arc = self._amalgamated_optical_arcs\\n if bool(optical_arc):\\n optical_arc[\\\"catagory\\\"] = OPTICAL * tf.ones_like(\\n optical_arc[\\\"x_center\\\"],\\n dtype=tf.int64\\n )\\n self._optical_arc_count = tf.shape(\\n optical_arc[\\\"x_center\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._optical_arc_count = 0\\n \\n stop_arc = self._amalgamated_stop_arcs\\n if bool(stop_arc):\\n stop_arc[\\\"catagory\\\"] = STOP * tf.ones_like(\\n stop_arc[\\\"x_center\\\"],\\n dtype=tf.int64\\n )\\n self._stop_arc_count = tf.shape(\\n stop_arc[\\\"x_center\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._stop_arc_count = 0\\n \\n target_arc = self._amalgamated_target_arcs\\n if bool(target_arc):\\n target_arc[\\\"catagory\\\"] = TARGET * tf.ones_like(\\n target_arc[\\\"x_center\\\"],\\n dtype=tf.int64\\n )\\n self._target_arc_count = tf.shape(\\n target_arc[\\\"x_center\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._target_arc_count = 0\\n \\n self._merged_arcs = amalgamate(\\n [optical_arc, stop_arc, target_arc], \\n ARC_GEO_SIG | {\\\"catagory\\\"}\\n )\",\n \"def _series_merging_map(self, map_list, feature_option=\\\"sift\\\"):\\n print(\\\" --- Start ---\\\")\\n # Transform state into 3 specified values\\n for i in range(len(map_list)):\\n map_list[i] = cv2.cvtColor(map_list[i], cv2.COLOR_RGB2GRAY)\\n map_list[i] = MF._transform_state(map_list[i])\\n \\n\\n map_ref = map_list[0]\\n for i in range(len(map_list)-1):\\n map_align = map_list[i+1]\\n\\n \\n if feature_option == \\\"orb\\\":\\n orb = cv2.ORB_create()\\n key_points_1, descriptor_1 = orb.detectAndCompute(map_ref, None)\\n key_points_2, descriptor_2 = orb.detectAndCompute(map_align, None)\\n \\n elif feature_option == \\\"surf\\\":\\n surf = cv2.xfeatures2d.SURF_create(400)\\n key_points_1, descriptor_1 = surf.detectAndCompute(map_ref, None)\\n key_points_2, descriptor_2 = surf.detectAndCompute(map_align, None)\\n else:\\n siftDetector = cv2.xfeatures2d.SIFT_create()\\n key_points_1, descriptor_1 = siftDetector.detectAndCompute(map_ref, None)\\n key_points_2, descriptor_2 = siftDetector.detectAndCompute(map_align, None)\\n\\n bf = cv2.BFMatcher()\\n matches = bf.knnMatch(descriptor_1, descriptor_2, k=2)\\n\\n good = []\\n for m, n in matches:\\n if m.distance < 0.75*n.distance:\\n good.append(m)\\n \\n pts_1, pts_2 = [], []\\n for i in good:\\n query_idx = i.queryIdx\\n train_idx = i.trainIdx\\n\\n pts_1.append([\\n key_points_1[query_idx].pt[0],\\n key_points_1[query_idx].pt[1],\\n ])\\n pts_2.append([\\n key_points_2[train_idx].pt[0],\\n key_points_2[train_idx].pt[1],\\n ])\\n \\n pts1 = np.array(pts_1)\\n pts2 = np.array(pts_2)\\n\\n # relation, value, _ = RMM._ransac_find_rotation_translation(pts_set_1=pts2, pts_set_2=pts1, sigma=0.5, max_iter=5000)\\n # print(\\\"- Inlier Percent: %f\\\"%value)\\n # # Because the coordinates between the maps and the SIFT features are different:\\n # # SIFT Features: Right: +x, Down: +y\\n # # Maps: Down: +x, Right: +y\\n # # Hence the dx and dy should be changed.\\n # dx = relation[1]\\n # dy = relation[0]\\n # dyaw = relation[2]\\n # print(\\\"- (x, y, t): (%f, %f, %f)\\\"%(dx,dy,dyaw))\\n\\n # # index, agr, dis = RMM._similarity_index(x=[dy, dx, dyaw], map1=map_ref, map2=map_align)\\n # # print(\\\"Similarity Index: %f\\\\nAgree Number: %f\\\\nDisargee Number: %f\\\"%(index, agr, dis))\\n # index, agr, dis, _ = RMM._similarity_index_2(x=[dx, dy, dyaw], map1=map_ref, map2=map_align)\\n # print(\\\"- Similarity Index: %f\\\\n- Agree Number: %f\\\\n- Disargee Number: %f\\\"%(index, agr, dis))\\n \\n # map_merged = MF._merging_map(dx=dx, dy=dy, dtheta=dyaw, map1=map_ref, map2=map_align)\\n # map_ref = map_merged.astype(np.uint8)\\n # map_ref = MF._modify_map_size(merged_map=map_ref)\\n\\n relation, value, _ = RANSAC_Map_Merging()._ransac_find_all(pts_set_1=pts2, pts_set_2=pts1, sigma=5, max_iter=2000)\\n dx = relation[1]\\n dy = relation[0]\\n dyaw = relation[2]\\n dr = relation[3]\\n print(\\\"- Inlier Percent: %f\\\"%value)\\n print(\\\"- (dx, dy, dyaw, dr) = %f, %f, %f, %f\\\"%(dx,dy,dyaw, dr))\\n map_merged = MAP_Function()._merging_map_ratio(dx=dx, dy=dy, dtheta=dyaw, dr=dr, map1=map_ref, map2=map_align)\\n map_ref = map_merged.astype(np.uint8)\\n map_ref = MF._modify_map_size(merged_map=map_ref)\\n\\n # return map_ref, (dx, dy, dyaw)\\n return map_ref, (dx, dy, dyaw, dr)\",\n \"def process_search_pages(self):\\r\\n features_list = []\\r\\n for page in self.url_list:\\r\\n listings = extract_listings(page)\\r\\n for listing in listings:\\r\\n features = extract_listing_features(listing, RULES_SEARCH_PAGE)\\r\\n features['sp_url'] = page\\r\\n features_list.append(features)\\r\\n\\r\\n self.base_features_list = features_list\",\n \"def finalizeFeatures(self):\\n pass\",\n \"def split_at_nodes(shp):\\n nodes = find_nodes(shp)\\n nodeIds = list(nodes)\\n nodeIds.sort()\\n nodeIds = dict([(node,i) for i,node in enumerate(nodeIds)])\\n \\n for road in shp:\\n vrts = road.vertices\\n midVrts = set(road.vertices[1:-1]) #we know end points are nodes\\n midNodes = midVrts.intersection(nodes) # find any nodes in the middle of the feature.\\n midIdx = [vrts.index(node) for node in midNodes] # Get their indices\\n midIdx.sort()\\n if midIdx:\\n #print vrts\\n starts = [0]+midIdx\\n stops = [x+1 for x in midIdx]+[None]\\n for start,stop in zip(starts,stops):\\n feat = pysal.cg.Chain(vrts[start:stop])\\n rec = (nodeIds[feat.vertices[0]],nodeIds[feat.vertices[-1]],False)\\n yield feat,rec\\n else:\\n rec = (nodeIds[road.vertices[0]],nodeIds[road.vertices[-1]],False)\\n yield road,rec\",\n \"def add_feature(layer, branchID, segs, lines, lon, lat, Ttime, density, Initial_loc, solubility, flows, concentration, water_level, dist): \\r\\n ctr=0\\r\\n for i in range(len(lines)):\\r\\n ctr+=1\\r\\n point = osgeo.ogr.Geometry(osgeo.ogr.wkbPoint)\\r\\n # Add points individually to the line\\r\\n #xy = lines[i]\\r\\n \\r\\n #line.AddPoint_2D(xy[0][0],xy[0][1])\\r\\n #line.AddPoint_2D(xy[1][0],xy[1][1])\\r\\n point.AddPoint(lon[i], lat[i])\\r\\n # Update the feature with the line data\\r\\n featureIndex = ctr\\r\\n feature = osgeo.ogr.Feature(layerDefinition)\\r\\n #feature.SetStyleString(\\\"PEN(c:r,w:5px)\\\") \\r\\n feature.SetGeometry(point)\\r\\n feature.SetFID(featureIndex)\\r\\n feature.SetGeometryDirectly(point)\\r\\n \\r\\n # Set the attribute table\\r\\n feature.SetField('BranchID', int(branchID[i])) \\r\\n feature.SetField('SegID', int(segs[i])) # convert to int() is necessary, osgeo cannot recognize numpy int32 type\\r\\n feature.SetField('Lon', \\\"{:.3f}\\\".format(lon[i]))\\r\\n feature.SetField('Lat', \\\"{:.3f}\\\".format(lat[i]))\\r\\n #feature.SetField('Lon_east', \\\"{:.3f}\\\".format(eastlon[i]))\\r\\n #feature.SetField('Lat_east', \\\"{:.3f}\\\".format(eastlat[i]))\\r\\n feature.SetField('T (day)', int(Ttime[i]))\\r\\n feature.SetField('Density', density[i])\\r\\n feature.SetField('Initial', Initial_loc[i])\\r\\n feature.SetField('Solubility', solubility[i])\\r\\n feature.SetField('Flow', flows[i])\\r\\n feature.SetField('C (mg/L)', concentration[i])\\r\\n feature.SetField('WSE (ft)', water_level[i])\\r\\n feature.SetField('D (ft)', dist[i])\\r\\n \\r\\n layer.CreateFeature(feature)\",\n \"def updateParameters(self, parameters):\\r\\n\\t\\tin_wikiplace_IRI = parameters[0]\\r\\n\\t\\tin_stat_fields = parameters[1]\\r\\n\\t\\t# out_location = parameters[2]\\r\\n\\t\\t# out_points_name = parameters[3]\\r\\n\\t\\t\\r\\n\\t\\tif in_wikiplace_IRI.altered and not in_stat_fields.altered:\\r\\n\\t\\t\\tinputFeatureClassName = in_wikiplace_IRI.valueAsText\\r\\n\\t\\t\\tlastIndexOFGDB = inputFeatureClassName.rfind(\\\"\\\\\\\\\\\")\\r\\n\\t\\t\\tfeatureClassName = inputFeatureClassName[(lastIndexOFGDB+1):]\\r\\n\\t\\t\\tcurrentWorkspace = inputFeatureClassName[:lastIndexOFGDB]\\r\\n\\r\\n\\t\\t\\tif currentWorkspace.endswith(\\\".gdb\\\") == False:\\r\\n\\t\\t\\t\\tmessages.addErrorMessage(\\\"Please enter a feature class in file geodatabase for the input feature class.\\\")\\r\\n\\t\\t\\t\\traise arcpy.ExecuteError\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\t# if in_related_table.value:\\r\\n\\t\\t\\t\\tarcpy.env.workspace = currentWorkspace\\r\\n\\t\\t\\t\\t# out_location.value = currentWorkspace\\r\\n\\t\\t\\t\\t# out_points_name.value = featureClassName + \\\"_noFunc_merge\\\"\\r\\n\\t\\t\\t\\t# # check whether the input table are in the same file geodatabase as the input feature class\\r\\n\\t\\t\\t\\t# inputTableName = in_related_table.valueAsText\\r\\n\\t\\t\\t\\t# lastIndexOFTable = inputTableName.rfind(\\\"\\\\\\\\\\\")\\r\\n\\t\\t\\t\\t# currentWorkspaceTable = inputTableName[:lastIndexOFTable]\\r\\n\\t\\t\\t\\t# if currentWorkspaceTable != currentWorkspace:\\r\\n\\t\\t\\t\\t# \\tmessages.addErrorMessage(\\\"Please enter a table in the same file geodatabase as the input feature class.\\\")\\r\\n\\t\\t\\t\\t# \\traise arcpy.ExecuteError\\r\\n\\t\\t\\t\\t# else:\\r\\n\\t\\t\\t\\t# \\tif UTIL.detectRelationship(inputFeatureClassName, inputTableName):\\r\\n\\t\\t\\t\\t# \\t\\tarcpy.AddMessage(\\\"The feature class and table are related!\\\")\\r\\n\\t\\t\\t\\trelatedTableList = UTIL.getRelatedTableFromFeatureClass(inputFeatureClassName)\\r\\n\\t\\t\\t\\t# fieldmappings = arcpy.FieldMappings()\\r\\n\\t\\t\\t\\t# fieldmappings.addTable(inputFeatureClassName)\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tnoFunctionalPropertyTable = []\\r\\n\\r\\n\\t\\t\\t\\tfor relatedTable in relatedTableList:\\r\\n\\t\\t\\t\\t\\tfieldList = arcpy.ListFields(relatedTable)\\r\\n\\t\\t\\t\\t\\tif \\\"origin\\\" not in fieldList and \\\"end\\\" not in fieldList:\\r\\n\\t\\t\\t\\t\\t\\tnoFunctionalFieldName = fieldList[2].name\\r\\n\\t\\t\\t\\t\\t\\tarcpy.AddMessage(\\\"noFunctionalFieldName: {0}\\\".format(noFunctionalFieldName))\\r\\n\\t\\t\\t\\t\\t\\tnoFunctionalPropertyTable.append([noFunctionalFieldName, 'COUNT', relatedTable])\\r\\n\\t\\t\\t\\t\\t\\t# MergeNoFunctionalProperty.relatedTableFieldList.append([noFunctionalFieldName, relatedTable, 'COUNT'])\\r\\n\\t\\t\\t\\t\\t# fieldmappings.addTable(relatedTable)\\r\\n\\t\\t\\t\\t\\t# fieldList = arcpy.ListFields(relatedTable)\\r\\n\\t\\t\\t\\t\\t# noFunctionalFieldName = fieldList[len(fieldList)-1].name\\r\\n\\t\\t\\t\\t\\t# arcpy.AddMessage(\\\"noFunctionalFieldName: {0}\\\".format(noFunctionalFieldName))\\r\\n\\t\\t\\t\\t\\t# fieldmap = fieldmappings.getFieldMap(fieldmappings.findFieldMapIndex(noFunctionalFieldName))\\r\\n\\t\\t\\t\\t\\t# fieldmap.addInputField(relatedTable, \\\"wikiURL\\\")\\r\\n\\t\\t\\t\\t\\t# fieldmap.addInputField(inputFeatureClassName, \\\"URL\\\")\\r\\n\\t\\t\\t\\t\\t# fieldmappings.replaceFieldMap(fieldmappings.findFieldMapIndex(noFunctionalFieldName), fieldmap)\\r\\n\\r\\n\\t\\t\\t\\tin_stat_fields.values = noFunctionalPropertyTable\\r\\n\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t# fieldmappings.removeFieldMap(fieldmappings.findFieldMapIndex(\\\"wikiURL\\\"))\\r\\n\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t# in_field_mapping.value = fieldmappings.exportToString()\\r\\n\\r\\n\\t\\t\\t# if in_stat_fields.altered:\\r\\n\\t\\t\\t# \\tfieldMergeRuleTest = in_stat_fields.valueAsText\\r\\n\\t\\t\\t# \\tif fieldMergeRuleTest:\\r\\n\\t\\t\\t# \\tfieldSplitList = fieldMergeRuleTest.split(\\\";\\\")\\r\\n\\t\\t\\t# \\tfor fieldSplitItem in fieldSplitList:\\r\\n\\t\\t\\t# \\t\\tfieldMergeList = fieldSplitList.split(\\\"\\\\t\\\")\\r\\n\\t\\t\\t# \\t\\tfor item in MergeNoFunctionalProperty.relatedTableFieldList:\\r\\n\\t\\t\\t# \\t\\t\\tif item[]\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\t\\t\\t\\r\\n\\r\\n\\t\\treturn\",\n \"def write_features(self):\\n num_features_per_file = math.ceil(len(self.features) / self.num_jobs)\\n for idx in range(self.num_jobs):\\n job_features = self.features[idx * num_features_per_file: (idx + 1) * num_features_per_file]\\n features_filename = constants.INPUT_FEATURES_FILENAME.format(self.args.output_dir, idx)\\n with open(features_filename, \\\"wb\\\") as features_file:\\n cloudpickle.dump(job_features, features_file, protocol=pickle.DEFAULT_PROTOCOL)\",\n \"def updateParameters(self, parameters):\\r\\n\\t\\tin_wikiplace_IRI = parameters[0]\\r\\n\\t\\tin_no_functional_property_list = parameters[1]\\r\\n\\t\\tin_related_table_list = parameters[2]\\r\\n\\t\\tin_merge_rule = parameters[3]\\r\\n\\t\\tin_cancatenate_delimiter = parameters[4]\\r\\n\\t\\t\\r\\n\\t\\tif in_wikiplace_IRI.altered:\\r\\n\\t\\t\\tinputFeatureClassName = in_wikiplace_IRI.valueAsText\\r\\n\\t\\t\\tlastIndexOFGDB = inputFeatureClassName.rfind(\\\"\\\\\\\\\\\")\\r\\n\\t\\t\\tfeatureClassName = inputFeatureClassName[(lastIndexOFGDB+1):]\\r\\n\\t\\t\\tcurrentWorkspace = inputFeatureClassName[:lastIndexOFGDB]\\r\\n\\r\\n\\t\\t\\tif currentWorkspace.endswith(\\\".gdb\\\") == False:\\r\\n\\t\\t\\t\\tmessages.addErrorMessage(\\\"Please enter a feature class in file geodatabase for the input feature class.\\\")\\r\\n\\t\\t\\t\\traise arcpy.ExecuteError\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\t# if in_related_table.value:\\r\\n\\t\\t\\t\\tarcpy.env.workspace = currentWorkspace\\r\\n\\t\\t\\t\\t# out_location.value = currentWorkspace\\r\\n\\t\\t\\t\\t# out_points_name.value = featureClassName + \\\"_noFunc_merge\\\"\\r\\n\\t\\t\\t\\t# # check whether the input table are in the same file geodatabase as the input feature class\\r\\n\\t\\t\\t\\t# inputTableName = in_related_table.valueAsText\\r\\n\\t\\t\\t\\t# lastIndexOFTable = inputTableName.rfind(\\\"\\\\\\\\\\\")\\r\\n\\t\\t\\t\\t# currentWorkspaceTable = inputTableName[:lastIndexOFTable]\\r\\n\\t\\t\\t\\t# if currentWorkspaceTable != currentWorkspace:\\r\\n\\t\\t\\t\\t# \\tmessages.addErrorMessage(\\\"Please enter a table in the same file geodatabase as the input feature class.\\\")\\r\\n\\t\\t\\t\\t# \\traise arcpy.ExecuteError\\r\\n\\t\\t\\t\\t# else:\\r\\n\\t\\t\\t\\t# \\tif UTIL.detectRelationship(inputFeatureClassName, inputTableName):\\r\\n\\t\\t\\t\\t# \\t\\tarcpy.AddMessage(\\\"The feature class and table are related!\\\")\\r\\n\\t\\t\\t\\tMergeSingleNoFunctionalProperty.relatedTableFieldList = []\\r\\n\\t\\t\\t\\tMergeSingleNoFunctionalProperty.relatedTableList = []\\r\\n\\t\\t\\t\\tMergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList = []\\r\\n\\r\\n\\t\\t\\t\\tMergeSingleNoFunctionalProperty.relatedTableList = UTIL.getRelatedTableFromFeatureClass(inputFeatureClassName)\\r\\n\\t\\t\\t\\tin_related_table_list.filter.list = MergeSingleNoFunctionalProperty.relatedTableList\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t# noFunctionalPropertyTable = []\\r\\n\\r\\n\\t\\t\\t\\tfor relatedTable in MergeSingleNoFunctionalProperty.relatedTableList:\\r\\n\\t\\t\\t\\t\\tfieldList = arcpy.ListFields(relatedTable)\\r\\n\\t\\t\\t\\t\\tif \\\"origin\\\" not in fieldList and \\\"end\\\" not in fieldList:\\r\\n\\t\\t\\t\\t\\t\\tnoFunctionalFieldName = fieldList[2].name\\r\\n\\t\\t\\t\\t\\t\\tarcpy.AddMessage(\\\"noFunctionalFieldName: {0}\\\".format(noFunctionalFieldName))\\r\\n\\t\\t\\t\\t\\t\\tMergeSingleNoFunctionalProperty.relatedTableFieldList.append(noFunctionalFieldName)\\r\\n\\t\\t\\t\\t\\t\\t# get the no functioal property URL from the firt row of this table field \\\"propURL\\\"\\r\\n\\t\\t\\t\\t\\t\\t# propURL = arcpy.da.SearchCursor(relatedTable, (\\\"propURL\\\")).next()[0]\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tTableRelationshipClassList = UTIL.getRelationshipClassFromTable(relatedTable)\\r\\n\\t\\t\\t\\t\\t\\tpropURL = arcpy.Describe(TableRelationshipClassList[0]).forwardPathLabel\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tMergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList.append(propURL)\\r\\n\\r\\n\\t\\t\\t\\tin_no_functional_property_list.filter.list = MergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList\\r\\n\\t\\t\\t\\t\\t\\t# noFunctionalPropertyTable.append([noFunctionalFieldName, 'COUNT', relatedTable])\\r\\n\\t\\t\\t\\t\\t\\t# MergeNoFunctionalProperty.relatedTableFieldList.append([noFunctionalFieldName, relatedTable, 'COUNT'])\\r\\n\\t\\t\\t\\t\\t# fieldmappings.addTable(relatedTable)\\r\\n\\t\\t\\t\\t\\t# fieldList = arcpy.ListFields(relatedTable)\\r\\n\\t\\t\\t\\t\\t# noFunctionalFieldName = fieldList[len(fieldList)-1].name\\r\\n\\t\\t\\t\\t\\t# arcpy.AddMessage(\\\"noFunctionalFieldName: {0}\\\".format(noFunctionalFieldName))\\r\\n\\r\\n\\t\\t\\t\\t# in_stat_fields.values = noFunctionalPropertyTable\\r\\n\\r\\n\\t\\tif in_no_functional_property_list.altered:\\r\\n\\t\\t\\tselectPropURL = in_no_functional_property_list.valueAsText\\r\\n\\t\\t\\tselectIndex = MergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList.index(selectPropURL)\\r\\n\\t\\t\\tselectFieldName = MergeSingleNoFunctionalProperty.relatedTableFieldList[selectIndex]\\r\\n\\t\\t\\tselectTableName = MergeSingleNoFunctionalProperty.relatedTableList[selectIndex]\\r\\n\\r\\n\\t\\t\\tin_related_table_list.value = selectTableName\\r\\n\\r\\n\\t\\t\\tcurrentDataType = UTIL.getFieldDataTypeInTable(selectFieldName, selectTableName)\\r\\n\\t\\t\\tif currentDataType in ['Single', 'Double', 'SmallInteger', 'Integer']:\\r\\n\\t\\t\\t\\tin_merge_rule.filter.list = ['SUM', 'MIN', 'MAX', 'STDEV', 'MEAN', 'COUNT', 'FIRST', 'LAST', 'CONCATENATE']\\r\\n\\t\\t\\t# elif currentDataType in ['SmallInteger', 'Integer']:\\r\\n\\t\\t\\t# \\tin_merge_rule.filter.list = ['SUM', 'MIN', 'MAX', 'COUNT', 'FIRST', 'LAST']\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tin_merge_rule.filter.list = ['COUNT', 'FIRST', 'LAST', 'CONCATENATE']\\r\\n\\r\\n\\t\\tif in_related_table_list.altered:\\r\\n\\t\\t\\tselectTableName = in_related_table_list.valueAsText\\r\\n\\t\\t\\tselectIndex = MergeSingleNoFunctionalProperty.relatedTableList.index(selectTableName)\\r\\n\\t\\t\\tselectFieldName = MergeSingleNoFunctionalProperty.relatedTableFieldList[selectIndex]\\r\\n\\t\\t\\tselectPropURL = MergeSingleNoFunctionalProperty.relatedNoFunctionalPropertyURLList[selectIndex]\\r\\n\\r\\n\\t\\t\\tin_no_functional_property_list.value = selectPropURL\\r\\n\\r\\n\\t\\t\\tcurrentDataType = UTIL.getFieldDataTypeInTable(selectFieldName, selectTableName)\\r\\n\\t\\t\\tif currentDataType in ['Single', 'Double', 'SmallInteger', 'Integer']:\\r\\n\\t\\t\\t\\tin_merge_rule.filter.list = ['SUM', 'MIN', 'MAX', 'STDEV', 'MEAN', 'COUNT', 'FIRST', 'LAST', 'CONCATENATE']\\r\\n\\t\\t\\t# elif currentDataType in ['SmallInteger', 'Integer']:\\r\\n\\t\\t\\t# \\tin_merge_rule.filter.list = ['SUM', 'MIN', 'MAX', 'COUNT', 'FIRST', 'LAST']\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tin_merge_rule.filter.list = ['COUNT', 'FIRST', 'LAST', 'CONCATENATE']\\r\\n\\t\\t\\t\\r\\n\\r\\n\\t\\tif in_merge_rule.valueAsText == \\\"CONCATENATE\\\":\\r\\n\\t\\t\\tin_cancatenate_delimiter.enabled = True\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\t\\treturn\",\n \"async def wrap_up_processing_reports(self):\\n if hasattr(Config(), 'results'):\\n new_row = []\\n for item in self.recorded_items:\\n item_value = {\\n 'global_round':\\n self.current_global_round,\\n 'round':\\n self.current_round,\\n 'accuracy':\\n self.accuracy * 100,\\n 'average_accuracy':\\n self.average_accuracy * 100,\\n 'edge_agg_num':\\n Config().algorithm.local_rounds,\\n 'local_epoch_num':\\n Config().trainer.epochs,\\n 'training_time':\\n max([\\n report.training_time for (report, __) in self.updates\\n ]),\\n 'round_time':\\n time.perf_counter() - self.round_start_time\\n }[item]\\n new_row.append(item_value)\\n\\n if Config().is_edge_server():\\n result_csv_file = f'{Config().result_dir}result_{Config().args.id}.csv'\\n else:\\n result_csv_file = f'{Config().result_dir}result.csv'\\n\\n csv_processor.write_csv(result_csv_file, new_row)\\n\\n if Config().is_edge_server():\\n # When a certain number of aggregations are completed, an edge client\\n # needs to be signaled to send a report to the central server\\n if self.current_round == Config().algorithm.local_rounds:\\n logging.info(\\n '[Server #%d] Completed %s rounds of local aggregation.',\\n os.getpid(),\\n Config().algorithm.local_rounds)\\n self.model_aggregated.set()\\n\\n self.current_round = 0\\n self.new_global_round_begins.clear()\\n # Wait until a new global round begins\\n # to avoid selecting clients before a new global round begins\\n await self.new_global_round_begins.wait()\",\n \"def finalize(self):\\n routes = self.routes.copy()\\n for child in self._children:\\n routes.extend(list(child.tree_routes))\\n\\n # Make a new Map() out of all of the routes.\\n rule_map = Map([route.create_rule() for route in routes])\\n self._route_map = rule_map\\n\\n self.finalized = True\",\n \"def _generate_feature_tree(self, features):\\n # build a set of all features, including top-level features and\\n # dependencies.\\n self.top_level_features = defaultdict(list)\\n\\n # find top-level features and index them by entity id.\\n for f in self.all_features:\\n _, num_forward = self.entityset.find_path(self.target_eid, f.entity.id,\\n include_num_forward=True)\\n if num_forward or f.entity.id == self.target_eid:\\n self.top_level_features[f.entity.id].append(f)\",\n \"def postprocess_spatial(self):\\n if self.spatial_finalization is not None:\\n for func in self.spatial_finalization:\\n self.spatial_data = func(self.spatial_data)\",\n \"def _merge_groups(self):\\n fof_rdd = self.fof_rdd\\n nPartitions = self.nPartitions\\n \\n def remap_local_groups(iterator): \\n gmap = iterator.next() \\n for p_arr in iterator:\\n remap_gid_partition_cython(p_arr, gmap)\\n yield p_arr\\n\\n mapping = self._get_level_map()\\n\\n group_merge_map = (mapping.flatMap(lambda (g,g_p):\\n [(gid, (g,g_p)) for gid in [decode_partition(g), decode_partition(g_p)]])\\n .partitionBy(nPartitions)\\n .map(lambda (k,v): v, preservesPartitioning=True)\\n .mapPartitions(create_map_dict, True)).cache() \\n\\n merged_rdd = (group_merge_map + fof_rdd).mapPartitions(remap_local_groups, preservesPartitioning=True)\\n merged_rdd.setName('merged_rdd')\\n\\n self.group_merge_map = group_merge_map\\n\\n return merged_rdd\",\n \"def _concatenate_features(features):\\n pass\",\n \"def create_from_feature_list(self, features): \\n for f in features:\\n featuretype = f.pop('featuretype', None)\\n if featuretype is None:\\n raise LoopException\\n if featuretype == 'strati':\\n self.create_and_add_foliation(f)\\n # if featuretype == 'fault':\\n # self.create_and_add_fault(f)\\n if featuretype == 'folded_strati':\\n self.create_and_add_folded_foliation(f)\",\n \"def collect_best_features(self):\\n bincsp = self.binary_csp # just to make code shorter\\n n_folds = len(self.binary_csp.folds)\\n n_class_pairs = len(self.binary_csp.class_pairs)\\n result_shape = (n_folds, n_class_pairs)\\n self.train_feature = np.empty(result_shape, dtype=object)\\n self.train_feature_full_fold = np.empty(result_shape, dtype=object)\\n self.test_feature = np.empty(result_shape, dtype=object)\\n self.test_feature_full_fold = np.empty(result_shape, dtype=object)\\n self.selected_filters_per_filterband = np.empty(result_shape, dtype=object)\\n for fold_i in range(n_folds):\\n for class_pair_i in range(n_class_pairs):\\n bin_csp_train_features = deepcopy(bincsp.train_feature[\\n self.selected_filter_inds, fold_i, class_pair_i])\\n bin_csp_train_features_full_fold = deepcopy(\\n bincsp.train_feature_full_fold[\\n self.selected_filter_inds,\\n fold_i, class_pair_i])\\n bin_csp_test_features = deepcopy(bincsp.test_feature[\\n self.selected_filter_inds, fold_i, class_pair_i])\\n bin_csp_test_features_full_fold = deepcopy(\\n bincsp.test_feature_full_fold[\\n self.selected_filter_inds,fold_i, class_pair_i])\\n selected_filters_per_filt = self.select_best_filters_best_filterbands(\\n bin_csp_train_features, max_features=self.n_features,\\n forward_steps=self.forward_steps, \\n backward_steps=self.backward_steps,\\n stop_when_no_improvement=self.stop_when_no_improvement)\\n self.train_feature[fold_i, class_pair_i] = \\\\\\n self.collect_features_for_filter_selection(\\n bin_csp_train_features, selected_filters_per_filt)\\n self.train_feature_full_fold[fold_i, class_pair_i] = \\\\\\n self.collect_features_for_filter_selection(\\n bin_csp_train_features_full_fold, selected_filters_per_filt)\\n \\n self.test_feature[fold_i, class_pair_i] = \\\\\\n self.collect_features_for_filter_selection(\\n bin_csp_test_features, selected_filters_per_filt)\\n self.test_feature_full_fold[fold_i, class_pair_i] = \\\\\\n self.collect_features_for_filter_selection(\\n bin_csp_test_features_full_fold, selected_filters_per_filt)\\n \\n self.selected_filters_per_filterband[fold_i, class_pair_i] = \\\\\\n selected_filters_per_filt\",\n \"def buildRoutesDict(self):\\n \\n # create route number and name xref dictionary\\n arcpy.env.workspace = PublicTransit.RTD_PATH\\n routes = arcpy.SearchCursor(PublicTransit.BUS_ROUTES, \\\"\\\", \\\"\\\", \\\"RouteID; Name\\\", \\\"\\\")\\n self.routeXref = dict()\\n for route in routes:\\n self.routeXref[route.RouteID] = route.Name\\n self.routeXref[route.Name] = route.RouteID\\n del routes\\n \\n #get mode lookup table\\n mode_table = self.getModeLookupTable()\\n \\n # Query the RTD database for the route name, operator, mode, and headways.\\n # We are querying for weekday routes (DAYTYPE_CLASS Weekday field = 'Y')\\n conn = pyodbc.connect(PublicTransit.DB_CONN_STRING)\\n cursor = conn.cursor()\\n self.transitRoutes = dict()\\n qry = \\\"\\\"\\\"\\n WITH t AS\\n (\\n SELECT CPT_AGENCYID, AGENCYNAME, SCH_ROUTEID, SCH_PATTERNID, CPT_MODE, SCH_ROUTEDESIGNATOR,\\n CASE\\n WHEN HOUR_CLASS >= 3 and HOUR_CLASS < 6 THEN 'EA'\\n WHEN HOUR_CLASS >= 6 and HOUR_CLASS < 10 THEN 'AM'\\n WHEN HOUR_CLASS >= 10 and HOUR_CLASS < 15 THEN 'MD'\\n WHEN HOUR_CLASS >= 15 and HOUR_CLASS < 19 THEN 'PM'\\n WHEN (HOUR_CLASS BETWEEN 19 AND 24) OR HOUR_CLASS < 3 THEN 'EV'\\n END AS tod,\\n [HOURLY_FREQUENCY(Daily until HOUR_CLASS update)], HOUR_CLASS\\n FROM dbo.[ROUTE HEADWAY AND FREQUENCY]\\n WHERE DAYTYPE_CLASS IN\\n (SELECT dc.CLASS FROM dbo.DAYTYPE_CLASS dc WHERE WEEKDAY = 'Y')\\n )\\n SELECT CPT_AGENCYID, AGENCYNAME, SCH_ROUTEID, SCH_PATTERNID, CPT_MODE, SCH_ROUTEDESIGNATOR, tod,\\n 60.0 / ROUND(AVG(CAST([HOURLY_FREQUENCY(Daily until HOUR_CLASS update)] AS FLOAT)), 0) as headway\\n FROM t\\n GROUP BY CPT_AGENCYID, AGENCYNAME, SCH_ROUTEID, SCH_PATTERNID, CPT_MODE, SCH_ROUTEDESIGNATOR, tod\\n ORDER BY SCH_ROUTEID, SCH_PATTERNID, tod\\\"\\\"\\\"\\n \\n used_route_names = []\\n # Iterate through result set and apply attributes.\\n for row in cursor.execute(qry):\\n routePattern = str(row.SCH_ROUTEID) + \\\"_\\\" + str(row.SCH_PATTERNID)\\n if routePattern not in self.transitRoutes:\\n self.transitRoutes[routePattern] = TransitRoute(routePattern,\\n routeId = row.SCH_ROUTEID,\\n patternId = row.SCH_PATTERNID)\\n self.transitRoutes[routePattern].new_name = self.__cleanRouteName(row.CPT_AGENCYID + \\\"_\\\" + row.SCH_ROUTEDESIGNATOR[:(11 - 1 - len(row.CPT_AGENCYID))],used_route_names) #12 is the maximum name length\\n self.transitRoutes[routePattern].agency = row.AGENCYNAME\\n mode = -1\\n for mode_row in mode_table:\\n if row.CPT_AGENCYID == mode_row[\\\"CPT_AGENCYID\\\"] and row.CPT_MODE == mode_row[\\\"CPT_MODE\\\"]:\\n if mode_row[\\\"SCH_ROUTEDESIGNATOR\\\"] != \\\"NA\\\":\\n if row.SCH_ROUTEDESIGNATOR == mode_row[\\\"SCH_ROUTEDESIGNATOR\\\"]:\\n mode = mode_row[\\\"MODECODE\\\"]\\n mode_group = Mode.getModeFromLookupTable(mode_row[\\\"MODEGROUP\\\"])\\n break #this is as detailed as we can get\\n else:\\n mode = mode_row[\\\"MODECODE\\\"]\\n mode_group = Mode.getModeFromLookupTable(mode_row[\\\"MODEGROUP\\\"])\\n self.transitRoutes[routePattern].mode = mode\\n self.transitRoutes[routePattern].mode_group = Mode.getModeName(mode_group)\\n # set headways\\n if row.tod == 'EA':\\n self.transitRoutes[routePattern].eaHeadway = row.headway\\n elif row.tod == 'AM':\\n self.transitRoutes[routePattern].amHeadway = row.headway\\n elif row.tod == 'MD':\\n self.transitRoutes[routePattern].mdHeadway = row.headway\\n elif row.tod == 'PM':\\n self.transitRoutes[routePattern].pmHeadway = row.headway\\n elif row.tod == 'EV':\\n self.transitRoutes[routePattern].evHeadway = row.headway\\n conn.close()\",\n \"def main(*argv):\\n try:\\n attr_features = argv[0]\\n sql_clause = argv[1]\\n polygon_grid = argv[2]\\n error_field_count = str(argv[3]) #'NULL_COUNT'#\\n error_field_def = str(argv[4]) #'NULL_COLUMNS'#\\n output_fc = argv[5]\\n out_fc_exists = arcpy.Exists(output_fc)\\n\\n # Local Variable\\n #\\n scratchFolder = env.scratchFolder\\n scratchGDB = env.scratchGDB\\n results = []\\n # Logic\\n #\\n if not out_fc_exists:\\n output_gdb = validate_workspace(os.path.dirname(output_fc))\\n # Create the grid\\n #\\n out_grid = arcpy.CopyFeatures_management(polygon_grid, output_fc)[0]\\n out_grid = extend_table(out_grid)\\n where_clause=None\\n else:\\n arcpy.MakeFeatureLayer_management(output_fc, \\\"lyr\\\")\\n arcpy.SelectLayerByLocation_management(\\\"lyr\\\", \\\"HAVE_THEIR_CENTER_IN\\\", polygon_grid)\\n oids = [row[0] for row in arcpy.da.SearchCursor(\\\"lyr\\\", \\\"OID@\\\")]\\n if len(oids) >1:\\n oids_string = str(tuple(oids))\\n else:\\n oids_string = str('('+ str(oids[0]) + ')')\\n\\n where_clause = 'OBJECTID IN ' + oids_string\\n\\n error_field = (error_field_def, error_field_count)\\n\\n # Process the Data\\n #\\n\\n poly_desc = arcpy.Describe(output_fc)\\n fc_desc = arcpy.Describe(attr_features)\\n if poly_desc.extent.within(fc_desc.extent):\\n\\n temp_fc = 'in_memory/clip'\\n arcpy.AddMessage('Clipping features to polygon')\\n arcpy.Clip_analysis(attr_features, output_fc, temp_fc)\\n arcpy.AddMessage('Created in_memory fc')\\n #data_sdf = geomotion.SpatialDataFrame.from_featureclass(temp_fc,\\n # fields=[value_field])\\n if sql_clause:\\n attr_sdf = SpatialDataFrame.from_featureclass(temp_fc,\\n fields=error_field,\\n where_clause=sql_clause)\\n else:\\n attr_sdf = SpatialDataFrame.from_featureclass(temp_fc,\\n fields=error_field)\\n arcpy.AddMessage('features read into spatial dataframe after clipping')\\n else:\\n #data_sdf = geomotion.SpatialDataFrame.from_featureclass(, fields=[value_field])\\n arcpy.AddMessage('features read into spatial dataframe without clipping')\\n if sql_clause:\\n attr_sdf = SpatialDataFrame.from_featureclass(attr_features,\\n fields=error_field,\\n where_clause=sql_clause)\\n else:\\n attr_sdf = SpatialDataFrame.from_featureclass(attr_features,\\n fields=error_field)\\n\\n grid_sdf = SpatialDataFrame.from_featureclass(filename=output_fc,\\n where_clause=where_clause)\\n\\n index = attr_sdf.sindex\\n for idx, row in enumerate(grid_sdf.iterrows()):\\n errors = []\\n attrs = []\\n geom = row[1].SHAPE\\n oid = row[1].OBJECTID\\n print(str(oid))\\n ext = [geom.extent.lowerLeft.X, geom.extent.lowerLeft.Y,\\n geom.extent.upperRight.X, geom.extent.upperRight.Y]\\n row_oids = list(index.intersect(ext))\\n df_current = attr_sdf.loc[row_oids]#.copy()\\n sq = df_current.geometry.disjoint(geom) == False\\n fcount = len(df_current[sq]) # Total Count\\n q2 = df_current[error_field_count] > 0\\n #& q2\\n df_current = df_current[sq].copy() # Get the # of features with deficiency_cnt > 0\\n #print(\\\"here\\\")\\n if fcount>0: #len(df_current) > 0:\\n errors += df_current[error_field_count].tolist()\\n arcpy.AddMessage(str(errors))\\n def process(x):\\n print(x)\\n return [va for va in x.replace(' ', '').split('|')[-1].split(',') if len(va) > 1]\\n for e in df_current[error_field_def].apply(process).tolist():\\n attrs += e\\n del e\\n row = get_answers(oid=oid,\\n err=errors,\\n attr=attrs,\\n feature_count=fcount)\\n results.append(row)\\n if len(results) > 250:\\n extend_table(table=output_fc, rows=results)\\n results = []\\n del idx\\n del row\\n del errors\\n del attrs\\n del geom\\n del oid\\n del ext\\n del row_oids\\n del df_current\\n del sq\\n del q2\\n if len(results) > 0:\\n extend_table(table=output_fc, rows=results)\\n del index\\n del results\\n del grid_sdf\\n del attr_sdf\\n except arcpy.ExecuteError:\\n line, filename, synerror = trace()\\n arcpy.AddError(\\\"error on line: %s\\\" % line)\\n arcpy.AddError(\\\"error in file name: %s\\\" % filename)\\n arcpy.AddError(\\\"with error message: %s\\\" % synerror)\\n arcpy.AddError(\\\"ArcPy Error Message: %s\\\" % arcpy.GetMessages(2))\\n except FunctionError as f_e:\\n messages = f_e.args[0]\\n arcpy.AddError(\\\"error in function: %s\\\" % messages[\\\"function\\\"])\\n arcpy.AddError(\\\"error on line: %s\\\" % messages[\\\"line\\\"])\\n arcpy.AddError(\\\"error in file name: %s\\\" % messages[\\\"filename\\\"])\\n arcpy.AddError(\\\"with error message: %s\\\" % messages[\\\"synerror\\\"])\\n arcpy.AddError(\\\"ArcPy Error Message: %s\\\" % messages[\\\"arc\\\"])\\n except:\\n line, filename, synerror = trace()\\n arcpy.AddError(\\\"error on line: %s\\\" % line)\\n arcpy.AddError(\\\"error in file name: %s\\\" % filename)\\n arcpy.AddError(\\\"with error message: %s\\\" % synerror)\",\n \"def _extract_features(self, times):\\n times[1] = time()\\n data = {n:self._extract_feature(f) for (n,f) in self.features.items()} \\n times[2] = time()\\n return (data, times, os.getpid())\",\n \"def _process_data(self):\\r\\n # Rename columns to match final feature class\\r\\n self._rename_columns()\\r\\n # Add point ID column\\r\\n self._add_pointid()\\r\\n # Sort rows by transect id and timestamp\\r\\n self._sort_rows()\\r\\n # Fill Null records with a value\\r\\n self._fill_nulls()\\r\\n # Set site_code to lower case\\r\\n self._lower_site_code()\\r\\n # Create survey_id\\r\\n self._calc_survey_id()\\r\\n # Calculate nativesg column if at least one of the veg columns is a Native seagrass type\\r\\n if set(self.veg_columns).intersection(set(NATIVESG_CODES)) > 0:\\r\\n self.nativesg_columns = list(set(self.veg_columns).intersection(set(NATIVESG_CODES)))\\r\\n self._calc_nativesg()\\r\\n #\\r\",\n \"def __merge_processes_data(self, manager_data, tracker=None):\\n\\n if manager_data is not None:\\n if (\\n not self.autosave.authorized\\n and PyFunceble.CONFIGURATION.multiprocess_merging_mode != \\\"live\\\"\\n and not PyFunceble.CONFIGURATION.quiet\\n ):\\n print(\\n Fore.MAGENTA\\n + Style.BRIGHT\\n + \\\"\\\\nMerging cross processes data... This process may take some time.\\\"\\n )\\n\\n for test_output in manager_data:\\n if self.autosave.authorized:\\n print(Fore.MAGENTA + Style.BRIGHT + \\\"Merging process data ...\\\")\\n\\n self.post_test_treatment(\\n test_output,\\n self.file_type,\\n complements_test_started=self.complements_test_started,\\n auto_continue_db=self.autocontinue,\\n inactive_db=self.inactive_db,\\n mining=self.mining,\\n whois_db=self.whois_db,\\n )\\n\\n if tracker:\\n tracker.add_position(len(test_output[\\\"given\\\"]))\\n\\n manager_data[:] = []\\n\\n self.autocontinue.save()\\n self.inactive_db.save()\\n self.mining.save()\\n\\n self.cleanup(self.autocontinue, self.autosave, test_completed=False)\",\n \"def _merge_boundaries(self):\\n optical = self._amalgamated_optical\\n if bool(optical):\\n optical[\\\"catagory\\\"] = OPTICAL * tf.ones_like(\\n optical[\\\"xp\\\"],\\n dtype=tf.int64\\n )\\n self._optical_count = tf.shape(\\n optical[\\\"xp\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._optical_count = 0\\n \\n stop = self._amalgamated_stop\\n if bool(stop):\\n stop[\\\"catagory\\\"] = STOP * tf.ones_like(\\n stop[\\\"xp\\\"],\\n dtype=tf.int64\\n )\\n self._stop_count = tf.shape(\\n stop[\\\"xp\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._stop_count = 0\\n \\n target = self._amalgamated_target\\n if bool(target):\\n target[\\\"catagory\\\"] = TARGET * tf.ones_like(\\n target[\\\"xp\\\"],\\n dtype=tf.int64\\n )\\n self._target_count = tf.shape(\\n target[\\\"xp\\\"],\\n out_type=tf.int64\\n )[0]\\n else:\\n self._target_count = 0\\n \\n self._merged = amalgamate(\\n [optical, stop, target], \\n TRIANGLE_GEO_SIG | {\\\"catagory\\\"}\\n )\",\n \"def extract_features(self):\\n self.extract_features_static()\\n self.extract_features_dynamic()\",\n \"def _get_features_geo(self, id):\\n #creates featues/geo tensors for all atoms in protein\\n if self.type_feature == \\\"hot_simple\\\":\\n features = self.hot_enc(id)\\n elif self.type_feature == \\\"mass_charges\\\":\\n features = self.mass_charges(id)\\n elif self.type_feature == \\\"bio_properties\\\":\\n features = self.bio_prop(id)\\n elif self.type_feature == \\\"bio_all_properties\\\":\\n features_1 = self.mass_charges(id)\\n features_2 = self.bio_prop(id)\\n features = np.concatenate((features_1, features_2), axis=1)\\n geometry = self._get_geometry_protein(id)\\n return features, geometry\",\n \"def execute(self, parameters, messages):\\r\\n\\t\\tin_wikiplace_IRI = parameters[0]\\r\\n\\t\\tin_stat_fields = parameters[1]\\r\\n\\t\\t# out_location = parameters[2]\\r\\n\\t\\t# out_points_name = parameters[3]\\r\\n\\r\\n\\t\\t\\r\\n\\t\\tif in_wikiplace_IRI.value:\\r\\n\\t\\t\\tinputFeatureClassName = in_wikiplace_IRI.valueAsText\\r\\n\\t\\t\\t# outLocation = out_location.valueAsText\\r\\n\\t\\t\\t# outFeatureClassName = out_points_name.valueAsText\\r\\n\\t\\t\\tfieldMergeRuleTest = in_stat_fields.valueAsText\\r\\n\\r\\n\\t\\t\\t# messages.addErrorMessage(\\\"in_stat_fields.values: {0}\\\".format(in_stat_fields.values))\\r\\n\\t\\t\\t# messages.addErrorMessage(\\\"MergeNoFunctionalProperty.relatedTableFieldList: {0}\\\".format(MergeNoFunctionalProperty.relatedTableFieldList))\\r\\n\\r\\n\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t# fieldmappings = in_field_mapping.valueAsText\\r\\n\\r\\n\\t\\t\\tlastIndexOFGDB = inputFeatureClassName.rfind(\\\"\\\\\\\\\\\")\\r\\n\\t\\t\\tcurrentWorkspace = inputFeatureClassName[:lastIndexOFGDB]\\r\\n\\r\\n\\t\\t\\tif currentWorkspace.endswith(\\\".gdb\\\") == False:\\r\\n\\t\\t\\t\\tmessages.addErrorMessage(\\\"Please enter a feature class in file geodatabase for the input feature class.\\\")\\r\\n\\t\\t\\t\\traise arcpy.ExecuteError\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\t# if in_related_table.value:\\r\\n\\t\\t\\t\\tarcpy.env.workspace = currentWorkspace\\r\\n\\t\\t\\t\\t# relatedTableList = UTIL.getRelatedTableFromFeatureClass(inputFeatureClassName)\\r\\n\\t\\t\\t\\t# fieldmappings = arcpy.FieldMappings()\\r\\n\\t\\t\\t\\t# fieldmappings.addTable(inputFeatureClassName)\\r\\n\\t\\t\\t\\t# for relatedTable in relatedTableList:\\r\\n\\t\\t\\t\\t# \\tfieldmappings.addTable(relatedTable)\\r\\n\\t\\t\\t\\t# \\tfieldList = arcpy.ListFields(relatedTable)\\r\\n\\t\\t\\t\\t# \\tfieldName = fieldList[len(fieldList)-1].name\\r\\n\\t\\t\\t\\t# \\tarcpy.AddMessage(\\\"fieldName: {0}\\\".format(fieldName))\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t# fieldmappings.removeFieldMap(fieldmappings.findFieldMapIndex(\\\"wikiURL\\\"))\\r\\n\\r\\n\\t\\t\\t\\t# arcpy.AddMessage(\\\"fieldmappings: {0}\\\".format(fieldmappings))\\r\\n\\t\\t\\t\\t# if out_location.value and out_points_name.value:\\r\\n\\t\\t\\t\\t# \\tarcpy.FeatureClassToFeatureClass_conversion(inputFeatureClassName, outLocation, outFeatureClassName, \\\"\\\", fieldmappings)\\r\\n\\r\\n\\t\\t\\t\\t# get the ValueTable(fieldName, merge rule, related table full path) \\r\\n\\t\\t\\t\\tfieldMergeRuleFileNameList = []\\r\\n\\r\\n\\t\\t\\t\\tif fieldMergeRuleTest:\\r\\n\\t\\t\\t\\t\\tfieldSplitList = fieldMergeRuleTest.split(\\\";\\\")\\r\\n\\t\\t\\t\\t\\tfor fieldSplitItem in fieldSplitList:\\r\\n\\t\\t\\t\\t\\t\\tfieldMergeList = fieldSplitItem.split(\\\" \\\", 2)\\r\\n\\t\\t\\t\\t\\t\\tfieldMergeRuleFileNameList.append(fieldMergeList)\\r\\n\\r\\n\\t\\t\\t\\tarcpy.AddMessage(\\\"fieldMergeRuleFileNameList: {0}\\\".format(fieldMergeRuleFileNameList))\\r\\n\\r\\n\\t\\t\\t\\tfor fieldMergeRuleFileNameItem in fieldMergeRuleFileNameList:\\r\\n\\t\\t\\t\\t\\tappendFieldName = fieldMergeRuleFileNameItem[0]\\r\\n\\t\\t\\t\\t\\tmergeRule = fieldMergeRuleFileNameItem[1]\\r\\n\\t\\t\\t\\t\\trelatedTableName = fieldMergeRuleFileNameItem[2].replace(\\\"'\\\", \\\"\\\")\\r\\n\\r\\n\\t\\t\\t\\t\\tnoFunctionalPropertyDict = UTIL.buildMultiValueDictFromNoFunctionalProperty(appendFieldName, relatedTableName)\\r\\n\\t\\t\\t\\t\\tif noFunctionalPropertyDict != -1:\\r\\n\\t\\t\\t\\t\\t\\tUTIL.appendFieldInFeatureClassByMergeRule(inputFeatureClassName, noFunctionalPropertyDict, appendFieldName, relatedTableName, mergeRule)\\r\\n\\r\\n\\t\\t\\t\\t# UTIL.buildMultiValueDictFromNoFunctionalProperty(fieldName, tableName)\\r\\n\\t\\t\\t\\t# UTIL.appendFieldInFeatureClassByMergeRule(inputFeatureClassName, noFunctionalPropertyDict, appendFieldName, relatedTableName, mergeRule)\\r\\n\\r\\n\\t\\treturn\",\n \"def FeaturesGen(ChopChopresults, outputDir, sgRNA_type):\\n \\n #make output Directory if it does not already exist\\n if not os.path.isdir(outputDir):\\n os.makedirs(outputDir)\\n \\n #list the directory contents \\n for i,j,k in os.walk(ChopChopresults): #use walk to go through and find all directories\\n \\n if j == []: #no subdirectories\\n saveDF = pd.DataFrame() #initiate dataframe\\n for target in k: #loop through to find the sgRNA sequences\\n if target.endswith('.offtargets'):\\n with open(os.path.join(i,target), 'r+') as f:\\n guide = f.readlines()\\n #add them to a dataframe\\n temp = pd.Series()\\n temp['guideNo'] = target.split('.')[0] + sgRNA_type\\n temp['guideSeq'] = guide.pop(0).rstrip()\\n \\n saveDF = saveDF.append(temp.to_frame().transpose())\\n saveDF['type'] = 'sgRNA'\\n \\n if sgRNA_type == 'General' or sgRNA_type == None:\\n saveDF['fwd'] = 'pink'\\n saveDF['rev'] = 'green'\\n elif sgRNA_type == 'GG':\\n saveDF['fwd'] = 'yellow'\\n saveDF['rev'] = 'plum'\\n elif sgRNA_type == 'GA':\\n saveDF['fwd'] = 'cyan'\\n saveDF['rev'] = 'cornflower blue'\\n \\n \\n #save to txt file with tab delimiter\\n saveDF.to_csv(os.path.join(outputDir, os.path.basename(i) + '_features.txt'),\\\\\\n index = False, header = False, sep = '\\\\t')\\n \\n del saveDF\",\n \"def _build_legs(self):\\n if self._primary_mode == 'transit':\\n for transit_leg in self._best_trip.get_transit_legs():\\n self._legs.append(transit_leg.get_directions())\\n else:\\n self._legs.append(self._best_trip.get_directions())\",\n \"def Point_to_FeatureClass(self, fc):\\n\\n\\n feature_class = []\\n for index, traectory in enumerate(self.__traectory_list):\\n point_row = arcpy.Point(X=traectory[0], Y=traectory[1], Z=traectory[2], ID=index)\\n feature_class.append(arcpy.PointGeometry(point_row, arcpy.SpatialReference(2436)))\\n arcpy.CopyFeatures_management(feature_class, (self.workspace + '\\\\\\\\' + fc))\\n print 'Complete Creating a Point Feature Class'\\n\\n return None\",\n \"def roadSegments(locations, API_key=\\\"Avah46_M-gfFeQ3P1w09Qq1ElAV9ZEHFDm9b8JRCRa8qPP5uVn21hDqAPVJgV4i_\\\"): \\n \\n # Base URL\\n uri = 'http://dev.virtualearth.net/' # Resource URL \\n path = 'REST/v1/Routes?'\\n \\n \\n # URL Parameters\\n params = { 'wayPoint.0' : locations[0]+',Singapore',\\n 'wayPoint.1' : locations[1]+',Singapore',\\n 'routeAttributes':'routePath',\\n 'key' : API_Key} # by default 'optimize' : 'time'} # this is by default\\n \\n url = uri+path\\n\\n results = requests.get(\\n url,\\n params = params\\n ).json()# ['resourceSets']\\n\\n # Retrieving values\\n statusCode = results['statusCode']\\n if statusCode == 200:\\n # print(statusCode)\\n\\n # TODO review the exceptions and modify these basic exception handlings\\n try:\\n travelDistance = results['resourceSets'][0]['resources'][0]['travelDistance']\\n except:\\n travelDistance = 0\\n try:\\n travelDuration = results['resourceSets'][0]['resources'][0]['travelDuration']\\n except:\\n travelDuration = 0\\n try:\\n travelDurationTraffic = results['resourceSets'][0]['resources'][0]['travelDurationTraffic']\\n except:\\n travelDurationTraffic = 0\\n\\n try:\\n numberSegments = len(results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\\\\n ['itineraryItems'])\\n except:\\n numberSegments = 0\\n try:\\n itineraryItems = results['resourceSets'][0]['resources'][0]['routeLegs'][0] \\\\\\n ['itineraryItems']\\n except:\\n itineraryItems = 'No items'\\n\\n pathCoord = results['resourceSets'][0]['resources'][0]['routePath']['line']['coordinates']\\n\\n roadName = []\\n travelDistances = []\\n travelDurations = []\\n maneuverType = []\\n\\n for seg in itineraryItems:\\n for i in range(len(seg['details'])):\\n # print(i)\\n try:\\n roadName.append(seg['details'][i]['names'])\\n except:\\n roadName.append(0)\\n try:\\n travelDistances.append(seg['travelDistance'])\\n except:\\n travelDistances.append(0)\\n\\n try:\\n travelDurations.append(seg['travelDuration'])\\n except:\\n travelDurations.append(0)\\n try:\\n maneuverType.append(seg['details'][i]['maneuverType'])\\n except:\\n maneuverType.append(0)\\n\\n\\n return statusCode,travelDistance,travelDuration,travelDurationTraffic,numberSegments,roadName, \\\\\\n travelDistances, travelDurations, maneuverType, pathCoord\\n\\n else:\\n print(\\\"Unsuccessful route calculation.\\\")\",\n \"def collect_ftmap(cls):\\n for obj in pm.get_object_list():\\n if obj.endswith(\\\".pdb\\\"):\\n new_name = obj[:-4].replace(\\\"crosscluster\\\", \\\"consensus\\\")\\n pm.set_name(obj, new_name)\\n yield from cls.collect()\",\n \"def obj_feature_map(self, features, rois):\\n feature_pool = RoIAlignFunction(self.pooling_size, self.pooling_size, spatial_scale=1 / 16)(self.compress(features) if self.use_resnet else features, rois)\\n return self.roi_fmap(feature_pool.view(rois.size(0), -1))\",\n \"def main():\\n state = sys.argv[1]\\n metaPath = root.joinpath(\\\"outputs\\\",\\\"groundwater\\\",\\\"csv\\\",state+\\\"_metadata.log\\\")\\n outputsPath = root.joinpath(\\\"outputs\\\",\\\"groundwater\\\")\\n \\n logging.basicConfig(level=logging.INFO,\\n format='%(asctime)s %(message)s',\\n datefmt='%m/%d/%Y %I:%M:%S %p',\\n handlers=[logging.FileHandler(str(metaPath))],\\n )\\n \\n logging.info(\\\"preProcessing '%s' dataset\\\",state)\\n path,metacols = gwcfg.get_params(state)\\n \\n # Initialize Well Data Object (which has self.df and self.gdf (geodataframe))\\n gwObj = gwmod.WellDataObj(path,metacols)\\n logging.info(\\\"original df and gdf initialized, shape: %s\\\",str(gwObj.df.shape))\\n \\n # Subset gdf to a single state\\n gwObj.subset_gdf(state)\\n logging.info(\\\"single state subsetted : %s , no of records: %d\\\",state,len(gwObj.gdf))\\n \\n # Remove Duplicates (entire row) ,Remove Null Data Rows, Drop Duplicate geometries\\n num_dups,num_nulls,num_geom_dups = gwObj.pre_process()\\n logging.info(\\\"number of duplicates found & dropped: %d \\\\\\n number of nulls found & dropped: %d \\\\\\n number of duplicate geometries found & dropped: %d\\\",num_dups,num_nulls,num_geom_dups)\\n \\n # Save processed dataframe to CSV , SHP(without data) and SHP(with data) \\n dfPath = outputsPath.joinpath(\\\"csv\\\", (state + '_processed' + path.suffix))\\n gdfPath = outputsPath.joinpath(\\\"shapefiles\\\", (state + '_processed' + \\\".shp\\\"))\\n gdfPathwData = outputsPath.joinpath(\\\"shapefiles\\\", (state + '_processed_wData' + \\\".shp\\\"))\\n \\n gwObj.df.to_csv(dfPath,index=False)\\n logging.info(\\\"saved df to CSV\\\")\\n gwObj.gdf.geometry.to_file(gdfPath,index=False)\\n logging.info(\\\"saved gdf (only geometries) to SHP\\\")\\n gwObj.gdf.to_file(gdfPathwData,index=False)\\n logging.info(\\\"saved gdf (with data) to SHP\\\")\",\n \"def obj_feature_map(self, features, rois):\\n feature_pool = RoIAlignFunction(self.pooling_size, self.pooling_size, spatial_scale=1 / 16)(features, rois)\\n return self.roi_fmap_obj(feature_pool.view(rois.size(0), -1))\",\n \"def _extract_features(self):\\n # print(os.getpid())\\n return {n:self._extract_feature(f) for (n,f) in self.features.items()}\",\n \"def chunk_user_route(detail_of_trip):\\n\\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\\n # since I can't get javascript to load, here's a hacky way of loading json\\n # that details the route based on the user's point A and point B\\n # detail_of_trip = api.directions(\\n # (40.760350, -73.976209),\\n # (40.754009, -73.981097),\\n # mode=\\\"walking\\\"\\n # )[0]\\n # $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\\n\\n # now that I have javascript sending over the json, load json that details\\n # the route based on the user's point A and point B\\n\\n # -------------- This section is for interpolation/splitting using shapely\\n first = True # to see if this is the start position for the entire route\\n line_points = [] # stores all the points to the route based on dict passed\\n\\n for leg in detail_of_trip['legs']:\\n for step in leg['steps']:\\n # Create a list of two element lists that represent points along the\\n # route. via google. line_points = [ [lat1, lng1], [lat2, lng2],...]\\n # Only add the starting point the first time. Every other iteration\\n # we will just tack on the end points to our line.\\n if first:\\n line_points.append([step['start_location']['lat'], step['start_location']['lng']])\\n first = False\\n line_points.append([step['end_location']['lat'], step['end_location']['lng']])\\n\\n # Now load those points into a geometry, here shapely's LineString type.\\n route_line = LineString(line_points)\\n return (route_line, line_points)\",\n \"def wfs_common(request, response, mode, spatial_mode='wfs'):\\n\\n outputpath = configuration.get_config_value('server', 'outputpath')\\n outputurl = configuration.get_config_value('server', 'outputurl')\\n\\n list_of_files = []\\n for one_resource in request.inputs['resource']:\\n # Download if not opendap\\n # Adding a maximum file size from a server config file would\\n # be possible here...\\n try:\\n nc_file = opendap_or_download(\\n one_resource.data,\\n auth_tkt_cookie=request.http_request.cookies,\\n output_path='/tmp')\\n except:\\n raise Exception(traceback.format_exc())\\n list_of_files.append(nc_file)\\n\\n if ('typename' in request.inputs) and ('featureids' in request.inputs):\\n typename = request.inputs['typename'][0].data\\n features = [f.data for f in request.inputs['featureids']]\\n if 'geoserver' in request.inputs:\\n geoserver = request.inputs['geoserver'][0].data\\n else:\\n geoserver = configuration.get_config_value('extra', 'geoserver')\\n if 'mosaic' in request.inputs:\\n mosaic = request.inputs['mosaic'][0].data\\n else:\\n mosaic = False\\n try:\\n conn = WebFeatureService(url=geoserver, version='2.0.0')\\n resp = conn.getfeature([typename], featureid=features,\\n outputFormat='application/json')\\n feature = json.loads(resp.read())\\n crs_code = owslib.crs.Crs(\\n feature['crs']['properties']['name']).code\\n crs = ocgis.CoordinateReferenceSystem(epsg=crs_code)\\n geom = [\\n {'geom': shape(f['geometry']), 'crs': crs,\\n 'properties': f['properties']}\\n for f in feature['features']]\\n except Exception as e:\\n msg = ('Failed to fetch features.\\\\ngeoserver: {0} \\\\n'\\n 'typename: {1}\\\\nfeatures {2}\\\\n{3}').format(\\n geoserver, typename, features, e)\\n raise Exception(msg)\\n if mosaic:\\n new_geom = geom[0]\\n for merge_geom in geom[1:]:\\n new_geom['geom'] = new_geom['geom'].union(merge_geom['geom'])\\n new_geom['properties'] = {'bbox': feature['bbox']}\\n geom = new_geom\\n elif spatial_mode == 'bbox':\\n geom = [[request.inputs['lon0'][0].data,\\n request.inputs['lat0'][0].data,\\n request.inputs['lon1'][0].data,\\n request.inputs['lat1'][0].data]]\\n else:\\n geom = [None]\\n\\n if ('initial_datetime' in request.inputs) and \\\\\\n ('final_datetime' in request.inputs):\\n tr = [request.inputs['initial_datetime'][0].data,\\n request.inputs['final_datetime'][0].data]\\n else:\\n tr = None\\n\\n try:\\n output_files = []\\n output_urls = []\\n mv_dir = tempfile.mkdtemp(dir=outputpath)\\n os.chmod(mv_dir, 0755)\\n\\n for one_file in list_of_files:\\n file_name = os.path.basename(one_file)\\n if file_name[-3:] == '.nc':\\n file_prefix = file_name[:-3]\\n else:\\n file_prefix = file_name\\n ocgis.env.DIR_OUTPUT = tempfile.mkdtemp(dir=os.getcwd())\\n ocgis.env.OVERWRITE = True\\n nc = netCDF4.Dataset(one_file, 'r')\\n var_names = guess_main_variables(nc)\\n nc.close()\\n rd = ocgis.RequestDataset(one_file, var_names)\\n for i, one_geom in enumerate(geom):\\n if one_geom is None:\\n ocgis_geom = None\\n elif spatial_mode == 'bbox':\\n ocgis_geom = one_geom\\n else:\\n ocgis_geom = one_geom['geom']\\n if mode == 'averager':\\n # Extent errors are ignored\\n try:\\n # Here with aggregate=True, can't pass the whole\\n # one_geom dictionary, is this a sign that this does\\n # not support multipolygon?\\n ops = ocgis.OcgOperations(\\n dataset=rd, geom=ocgis_geom,\\n spatial_operation='clip', aggregate=True,\\n time_range=tr, output_format='nc',\\n interpolate_spatial_bounds=True,\\n prefix=file_prefix).execute()\\n except ExtentError:\\n continue\\n elif mode == 'subsetter':\\n # Extent errors are ignored\\n try:\\n # Still having problem with the geometry, previously\\n # was passing geom=[one_geom]\\n ops = ocgis.OcgOperations(\\n dataset=rd, geom=ocgis_geom, time_range=tr,\\n output_format='nc',\\n interpolate_spatial_bounds=True,\\n prefix=file_prefix).execute()\\n except ExtentError:\\n continue\\n # Here, the global attribute 'subset_typename' and\\n # 'subset_featureid' are added to the NetCDF file to keep\\n # track of the feature used.\\n if (geom != [None]) and (spatial_mode == 'wfs'):\\n with netCDF4.Dataset(ops, 'a') as nc:\\n nc.subset_typename = typename\\n nc.subset_featureid = features[i]\\n\\n if (spatial_mode == 'wfs') and \\\\\\n ('featureids' in request.inputs):\\n mv_name = '{0}_{1}.nc'.format(\\n os.path.basename(ops)[:-3], features[i])\\n else:\\n mv_name = '{0}_{1}.nc'.format(\\n os.path.basename(ops)[:-3], 'subset')\\n\\n mv_file = os.path.join(mv_dir, mv_name)\\n shutil.move(ops, mv_file)\\n output_files.append(mv_file)\\n shutil.rmtree(ocgis.env.DIR_OUTPUT)\\n\\n # Cover the case of an online wps server and the offline\\n # mode for tests.\\n if outputurl == 'file:///tmp':\\n disk_file = 'file:///' + mv_file.lstrip('/')\\n output_urls.append(disk_file)\\n else:\\n url_file = os.path.join(\\n outputurl, os.path.basename(mv_dir), mv_name)\\n output_urls.append(url_file)\\n except:\\n raise Exception(traceback.format_exc())\\n\\n # If only ExtentError occured, the output_urls will be empty...\\n if not output_urls:\\n raise ExtentError(message=\\\"All ocgis calls returned ExtentError.\\\")\\n\\n time_str = time.strftime(\\\"%Y-%m-%dT%H:%M:%SZ\\\", time.gmtime())\\n output_file_name = \\\"result_%s_.json\\\" % (time_str,)\\n output_file = os.path.join('/tmp', output_file_name)\\n f1 = open(output_file, 'w')\\n f1.write(json.dumps(output_urls))\\n f1.close()\\n response.outputs['output'].file = output_file\\n response.outputs['output'].output_format = json_format\\n response.update_status(\\\"done\\\", 100)\\n return response\",\n \"def merge_global_features(global_features_list: List[Optional[kapture.GlobalFeatures]],\\n global_features_paths: List[str], output_path: str,\\n tar_handlers: List[TarCollection]) -> kapture.GlobalFeatures:\\n features = _merge_image_features(kapture.GlobalFeatures, global_features_list, global_features_paths,\\n output_path, tar_handlers)\\n assert isinstance(features, kapture.GlobalFeatures)\\n return features\",\n \"def bulk_train(self):\\n logger.info(\\\"collecting subfolders - relations\\\")\\n relations = self.collect_subfolders(self.input_dir)\\n logger.info(\\\"relations - {}\\\".format(relations))\\n\\n execution_times = []\\n\\n for rel, rel_path in tqdm(relations.items(), desc=\\\"relations\\\"):\\n logger.info(\\\"collecting training files from {}\\\".format(rel_path))\\n tr_files = self.collect_files(rel_path, self.regexp_train)\\n hyper_params = self.get_hyperparams()\\n hyper_params['graph'] = tr_files\\n\\n output_folder = os.path.join(self.output_dir, rel)\\n if not os.path.exists(output_folder):\\n logger.info(\\\"creating {} (did not exist)\\\".format(output_folder))\\n os.makedirs(output_folder)\\n\\n for params in tqdm(ParameterGrid(hyper_params), desc=\\\"training embedding\\\"):\\n logger.info(\\\"hyperparams: {}\\\".format(params))\\n train_file = params['graph']\\n model_name = self.compute_model_name(params, output_folder)\\n logger.info('training starspace model \\\"{}\\\" from file \\\"{}\\\"'.format(\\n model_name, train_file))\\n external_output, delta = self.call_starspace(params, train_file, model_name)\\n logger.info(\\\"executed in {:0.2f}s\\\".format(delta))\\n\\n logger.info(\\\"external command output logged in {}\\\".format(self.external_log))\\n if not os.path.exists(self.output_dir):\\n logger.info(\\\"creating {} (did not exist)\\\".format(self.output_dir))\\n os.makedirs(self.output_dir)\\n\\n with open(self.external_log, 'a') as f:\\n f.write(external_output)\\n\\n execution_times.append(dict({ 'time': delta }, **params))\\n \\n return execution_times\",\n \"def execute(self, parameters, messages):\\r\\n\\t\\tin_buf_query_center = parameters[0]\\r\\n\\t\\tin_place_type = parameters[1]\\r\\n\\t\\tin_is_directed_instance = parameters[2]\\r\\n\\t\\tin_radius = parameters[3]\\r\\n\\t\\tout_location = parameters[4]\\r\\n\\t\\tout_points_name = parameters[5]\\r\\n\\t\\tout_place_type_url = parameters[6]\\r\\n\\r\\n\\t\\tinBufCenter = in_buf_query_center.valueAsText\\r\\n\\t\\tinPlaceType = in_place_type.valueAsText\\r\\n\\t\\tsearchRadius = in_radius.valueAsText\\r\\n\\t\\toutLocation = out_location.valueAsText\\r\\n\\t\\toutFeatureClassName = out_points_name.valueAsText\\r\\n\\t\\t\\r\\n\\t\\tisDirectInstance = False\\r\\n\\t\\t\\r\\n\\t\\tif in_is_directed_instance.valueAsText == 'true':\\r\\n\\t\\t\\tisDirectInstance = True\\r\\n\\t\\telif in_is_directed_instance.valueAsText == 'false':\\r\\n\\t\\t\\tisDirectInstance = False\\r\\n\\r\\n\\t\\t# arcpy.AddMessage((\\\"in_is_directed_instance.valueAsText: {0}\\\").format(in_is_directed_instance.valueAsText))\\r\\n\\r\\n\\t\\r\\n\\t\\tif \\\".gdb\\\" in outLocation:\\r\\n\\t\\t\\t# if the outputLocation is a file geodatabase, cancatnate the outputlocation with outFeatureClassName to create a feature class in current geodatabase\\r\\n\\t\\t\\tout_path = os.path.join(outLocation,outFeatureClassName)\\r\\n\\t\\telse:\\r\\n\\t\\t\\t# if the outputLocation is a folder, creats a shapefile in this folder\\r\\n\\t\\t\\tout_path = os.path.join(outLocation,outFeatureClassName) + \\\".shp\\\"\\r\\n\\t\\t\\t# however, Relationship Class must be created in a geodatabase, so we forbid to create a shapfile\\r\\n\\t\\t\\t# messages.addErrorMessage(\\\"Please enter a file geodatabase as output location in order to create a relation class\\\")\\r\\n\\t\\t\\t# raise arcpy.ExecuteError\\r\\n\\t\\t\\t\\r\\n\\r\\n\\r\\n\\t\\tmessages.addMessage(\\\"outpath: {0}\\\".format(out_path))\\r\\n\\r\\n\\t\\tselectedURL = out_place_type_url.valueAsText\\r\\n\\r\\n\\t\\t# messages.addMessage(\\\"len(self.entityTypeLabel): {0}\\\".format(len(self.entityTypeLabel)))\\r\\n\\r\\n\\t\\t# for i in range(len(self.entityTypeLabel)):\\r\\n\\t\\t# \\tmessages.addMessage(\\\"Label: {0}\\\".format(self.entityTypeLabel[i]))\\r\\n\\t\\t# \\tif inPlaceType == self.entityTypeLabel[i]:\\r\\n\\t\\t# \\t\\tselectedURL = self.entityTypeURLList[i]\\r\\n\\r\\n\\t\\tmessages.addMessage(\\\"selectedURL: {0}\\\".format(selectedURL))\\r\\n\\r\\n\\t\\t# Create a FeatureSet object and load in_memory feature class\\r\\n\\t\\tin_feature_set = arcpy.FeatureSet()\\r\\n\\t\\tin_feature_set.load(inBufCenter)\\r\\n\\t\\tin_feature_set_json = json.loads(in_feature_set.JSON)\\r\\n\\r\\n\\t\\t# messages.addMessage(\\\"Points: {0}\\\".format(json.loads(in_feature_set.JSON)))\\r\\n\\r\\n\\t\\t# messages.addMessage(\\\"Point: {0}\\\".format(json.loads(in_feature_set.JSON)['spatialReference']['wkid']))\\r\\n\\r\\n\\t\\tWGS84Reference = arcpy.SpatialReference(4326)\\r\\n\\t\\tcurrentSpatialReference = arcpy.SpatialReference(in_feature_set_json['spatialReference']['latestWkid'])\\r\\n\\r\\n\\t\\t# a set of unique Coordinates for each input points\\r\\n\\t\\t# searchCoordsSet = Set()\\r\\n\\t\\tsearchCoordsSet = []\\r\\n\\t\\r\\n\\t\\tfor i in range(len(in_feature_set_json['features'])):\\r\\n\\t\\t\\tlat = in_feature_set_json['features'][i]['geometry']['y']\\r\\n\\t\\t\\tlng = in_feature_set_json['features'][i]['geometry']['x']\\r\\n\\t\\t\\tcoords = [lng, lat]\\r\\n\\t\\t\\tsearchCoordsSet.append(coords)\\r\\n\\t\\t# \\tif i == 0:\\r\\n\\t\\t# \\t\\tsearchCoordsSet.append(coords)\\r\\n\\t\\t# \\telse:\\r\\n\\t\\t# \\t\\tif coords not in searchCoordsSet:\\r\\n\\t\\t# \\t\\t\\tsearchCoordsSet.add(coords)\\r\\n\\r\\n\\r\\n\\t\\t# searchCoordsSet = List(searchCoordsSet)\\r\\n\\r\\n\\t\\t# a set of unique Coordinates for each found places\\r\\n\\t\\tplaceIRISet = Set()\\r\\n\\t\\tplaceList = []\\r\\n\\r\\n\\t\\tfor coord in searchCoordsSet:\\r\\n\\t\\t\\tlat = coord[1]\\r\\n\\t\\t\\tlng = coord[0]\\r\\n\\r\\n\\t\\t# lat = in_feature_set_json['features'][0]['geometry']['y']\\r\\n\\t\\t# lng = in_feature_set_json['features'][0]['geometry']['x']\\r\\n\\r\\n\\t\\t\\tif in_feature_set_json['spatialReference']['wkid'] != '4326' or in_feature_set_json['spatialReference']['latestWkid'] != '4326':\\r\\n\\t\\t\\t\\tWGS84PtGeometry = arcpy.PointGeometry(arcpy.Point(lng, lat), currentSpatialReference).projectAs(WGS84Reference)\\r\\n\\t\\t\\t\\t# messages.addMessage(\\\"My Coordinates: {0}\\\".format(WGS84PtGeometry.WKT))\\r\\n\\t\\t\\t\\tcoordList = re.split(\\\"[( )]\\\", WGS84PtGeometry.WKT)\\r\\n\\t\\t\\t\\tlat = coordList[3]\\r\\n\\t\\t\\t\\tlng = coordList[2]\\r\\n\\r\\n\\t\\t\\tqueryPrefix = \\\"\\\"\\\"PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX rdfs: <http://www.w3.org/2000/01/rdf-schema#>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX owl: <http://www.w3.org/2002/07/owl#>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX geo-pos: <http://www.w3.org/2003/01/geo/wgs84_pos#>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX omgeo: <http://www.ontotext.com/owlim/geo#>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX dbpedia: <http://dbpedia.org/resource/>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX dbp-ont: <http://dbpedia.org/ontology/>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX ff: <http://factforge.net/>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX om: <http://www.ontotext.com/owlim/>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX wikibase: <http://wikiba.se/ontology#>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX bd: <http://www.bigdata.com/rdf#>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX wdt: <http://www.wikidata.org/prop/direct/>\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tPREFIX geo: <http://www.opengis.net/ont/geosparql#>\\\"\\\"\\\"\\r\\n\\r\\n\\t\\t\\tif selectedURL != None:\\r\\n\\t\\t\\t\\tquery = queryPrefix + \\\"\\\"\\\"SELECT distinct ?place ?placeLabel ?distance ?location\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tWHERE {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# geospatial queries\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSERVICE wikibase:around {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# get the coordinates of a place\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t?place wdt:P625 ?location .\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# create a buffer around (-122.4784360859997 37.81826788900048)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbd:serviceParam wikibase:center \\\"Point(\\\"\\\"\\\" + str(lng) + \\\"\\\"\\\" \\\"\\\"\\\" + str(lat) + \\\"\\\"\\\")\\\"^^geo:wktLiteral .\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# buffer radius 2km\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbd:serviceParam wikibase:radius '\\\"\\\"\\\"+searchRadius+\\\"\\\"\\\"' .\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbd:serviceParam wikibase:distance ?distance .\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# retrieve the English label\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSERVICE wikibase:label {bd:serviceParam wikibase:language \\\"en\\\". ?place rdfs:label ?placeLabel .}\\\"\\\"\\\"\\r\\n\\t\\t\\t\\tif isDirectInstance == False:\\r\\n\\t\\t\\t\\t\\tquery +=\\t\\t\\t\\\"\\\"\\\"?place wdt:P31 ?placeFlatType.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t?placeFlatType wdt:P279* <\\\"\\\"\\\" + selectedURL + \\\"\\\"\\\">.\\\"\\\"\\\"\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\tquery +=\\t\\t\\t\\\"\\\"\\\"?place wdt:P31 <\\\"\\\"\\\" + selectedURL + \\\"\\\"\\\">.\\\"\\\"\\\"\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# show results ordered by distance\\r\\n\\t\\t\\t\\tquery +=\\t\\t\\t\\t\\\"\\\"\\\"} ORDER BY ?distance\\\"\\\"\\\"\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tquery = queryPrefix + \\\"\\\"\\\"SELECT distinct ?place ?placeLabel ?distance ?location \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tWHERE {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# geospatial queries\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSERVICE wikibase:around {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# get the coordinates of a place\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t?place wdt:P625 ?location .\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# create a buffer around (-122.4784360859997 37.81826788900048)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbd:serviceParam wikibase:center \\\"Point(\\\"\\\"\\\" + str(lng) + \\\"\\\"\\\" \\\"\\\"\\\" + str(lat) + \\\"\\\"\\\")\\\"^^geo:wktLiteral .\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# buffer radius 2km\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbd:serviceParam wikibase:radius '\\\"\\\"\\\"+searchRadius+\\\"\\\"\\\"' .\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbd:serviceParam wikibase:distance ?distance .\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# retrieve the English label\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSERVICE wikibase:label {bd:serviceParam wikibase:language \\\"en\\\". ?place rdfs:label ?placeLabel .}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t?place wdt:P31 ?placeFlatType.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t?placeFlatType wdt:P279* wd:Q2221906.\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t# show results ordered by distance\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} ORDER BY ?distance\\\"\\\"\\\"\\r\\n\\r\\n\\t\\t\\tsparqlParam = {'query': query, 'format': 'json'}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tsparqlRequest = requests.get('https://query.wikidata.org/sparql', params=sparqlParam)\\r\\n\\r\\n\\t\\t\\tprint(sparqlRequest.url)\\r\\n\\t\\t\\tmessages.addMessage(\\\"SPARQL: {0}\\\".format(sparqlRequest.url))\\r\\n\\t\\t \\r\\n\\t\\t\\t\\r\\n\\t\\t\\tbufferQueryResult = sparqlRequest.json()[\\\"results\\\"][\\\"bindings\\\"]\\r\\n\\r\\n\\t\\t\\t# if len(bufferQueryResult) == 0:\\r\\n\\t\\t\\t# \\tmessages.addMessage(\\\"No {0} nearby the clicked place can be finded!\\\".format(inPlaceType))\\r\\n\\t\\t\\t# \\t# pythonaddins.MessageBox(\\\"No \\\" + inPlaceType + \\\" nearby the clicked place can be finded!\\\",\\r\\n\\t\\t\\t# \\t# \\\"Warning Message\\\", 0)\\r\\n\\t\\t\\t# else:\\r\\n\\r\\n\\t\\t\\tfor item in bufferQueryResult:\\r\\n\\t\\t\\t\\tprint \\\"%s\\\\t%s\\\\t%s\\\\t%s\\\" % (\\r\\n\\t\\t\\t\\t\\titem[\\\"place\\\"][\\\"value\\\"], item[\\\"placeLabel\\\"][\\\"value\\\"], item[\\\"distance\\\"][\\\"value\\\"],\\r\\n\\t\\t\\t\\t\\titem[\\\"location\\\"][\\\"value\\\"])\\r\\n\\t\\t\\t\\tif len(placeIRISet) == 0 or item[\\\"place\\\"][\\\"value\\\"] not in placeIRISet:\\r\\n\\t\\t\\t\\t\\tplaceIRISet.add(item[\\\"place\\\"][\\\"value\\\"])\\r\\n\\t\\t\\t\\t\\tcoordItem = item[\\\"location\\\"][\\\"value\\\"]\\r\\n\\t\\t\\t\\t\\tcoordList = re.split(\\\"[( )]\\\", coordItem)\\r\\n\\t\\t\\t\\t\\titemlat = coordList[2]\\r\\n\\t\\t\\t\\t\\titemlng = coordList[1]\\r\\n\\t\\t\\t\\t\\tplaceList.append(\\r\\n\\t\\t\\t\\t\\t\\t[item[\\\"place\\\"][\\\"value\\\"], item[\\\"placeLabel\\\"][\\\"value\\\"], item[\\\"distance\\\"][\\\"value\\\"],\\r\\n\\t\\t\\t\\t\\t\\t itemlat,itemlng])\\r\\n\\r\\n\\t\\tif len(placeList) == 0:\\r\\n\\t\\t\\tmessages.addMessage(\\\"No {0} nearby the input point(s) can be finded!\\\".format(inPlaceType))\\r\\n\\t\\telse:\\r\\n\\t\\t\\t# Spatial reference set to GCS_WGS_1984\\r\\n\\t\\t\\tspatial_reference = arcpy.SpatialReference(4326)\\r\\n\\t\\t\\t# creat a Point feature class in arcpy\\r\\n\\t\\t\\tpt = arcpy.Point()\\r\\n\\t\\t\\tptGeoms = []\\r\\n\\t\\t\\tfor p in placeList:\\r\\n\\t\\t\\t\\tpt.X = float(p[4])\\r\\n\\t\\t\\t\\tpt.Y = float(p[3])\\r\\n\\t\\t\\t\\tpointGeometry = arcpy.PointGeometry(pt, spatial_reference)\\r\\n\\t\\t\\t\\tptGeoms.append(pointGeometry)\\r\\n\\r\\n\\t\\t\\t# out_path = pythonaddins.SaveDialog(\\\"Save Nearby Places\\\", \\\"placeNear\\\",\\r\\n\\t\\t\\t# os.path.dirname(arcpy.mapping.MapDocument(\\\"current\\\").filePath),\\r\\n\\t\\t\\t# FileGDBSave())\\r\\n\\r\\n\\t\\t\\tif out_path == None:\\r\\n\\t\\t\\t\\tmessages.addMessage(\\\"No data will be added to the map document.\\\")\\r\\n\\t\\t\\t\\t# pythonaddins.MessageBox(\\\"No data will be added to the map document.\\\", \\\"Warning Message\\\", 0)\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\t# create a geometry Feature class to represent \\r\\n\\t\\t\\t\\tplaceNearFeatureClass = arcpy.CopyFeatures_management(ptGeoms, out_path)\\r\\n\\r\\n\\t\\t\\t\\tlabelFieldLength = Json2Field.fieldLengthDecide(bufferQueryResult, \\\"placeLabel\\\")\\r\\n\\t\\t\\t\\tarcpy.AddMessage(\\\"labelFieldLength: {0}\\\".format(labelFieldLength))\\r\\n\\t\\t\\t\\t# add field to this point feature class\\r\\n\\t\\t\\t\\tarcpy.AddField_management(placeNearFeatureClass, \\\"Label\\\", \\\"TEXT\\\", field_length=labelFieldLength)\\r\\n\\t\\t\\t\\tarcpy.AddField_management(placeNearFeatureClass, \\\"URL\\\", \\\"TEXT\\\", field_length=100)\\r\\n\\t\\t\\t\\t# arcpy.AddField_management(placeNearFeatureClass, \\\"TypeURL\\\", \\\"TEXT\\\", field_length=50)\\r\\n\\t\\t\\t\\t# arcpy.AddField_management(placeNearFeatureClass, \\\"TypeName\\\", \\\"TEXT\\\", field_length=50)\\r\\n\\t\\t\\t\\t# if selectedURL != None:\\r\\n\\t\\t\\t\\t# \\tarcpy.AddField_management(placeNearFeatureClass, \\\"BTypeURL\\\", \\\"TEXT\\\", field_length=50)\\r\\n\\t\\t\\t\\t# \\tarcpy.AddField_management(placeNearFeatureClass, \\\"BTypeName\\\", \\\"TEXT\\\", field_length=50)\\r\\n\\t\\t\\t\\t# arcpy.AddField_management(placeNearFeatureClass, \\\"Latitude\\\", \\\"TEXT\\\", 10, 10)\\r\\n\\t\\t\\t\\t# arcpy.AddField_management(placeNearFeatureClass, \\\"Longitude\\\", \\\"TEXT\\\", 10, 10)\\r\\n\\r\\n\\t\\t\\t\\tarcpy.AddXY_management(placeNearFeatureClass)\\r\\n\\t\\t\\t\\t# add label, latitude, longitude value to this point feature class\\r\\n\\r\\n\\t\\t\\t\\ti = 0\\r\\n\\t\\t\\t\\tcursor = arcpy.UpdateCursor(out_path)\\r\\n\\t\\t\\t\\trow = cursor.next()\\r\\n\\t\\t\\t\\twhile row:\\r\\n\\t\\t\\t\\t\\trow.setValue(\\\"Label\\\", placeList[i][1])\\r\\n\\t\\t\\t\\t\\trow.setValue(\\\"URL\\\", placeList[i][0])\\r\\n\\t\\t\\t\\t\\t# row.setValue(\\\"TypeURL\\\", placeList[i][5])\\r\\n\\t\\t\\t\\t\\t# row.setValue(\\\"TypeName\\\", placeList[i][6])\\r\\n\\t\\t\\t\\t\\tcursor.updateRow(row)\\r\\n\\t\\t\\t\\t\\ti = i + 1\\r\\n\\t\\t\\t\\t\\trow = cursor.next()\\r\\n\\r\\n\\t\\t\\t\\t# if selectedURL != None:\\r\\n\\t\\t\\t\\t# \\ti = 0\\r\\n\\t\\t\\t\\t# \\tcursor = arcpy.UpdateCursor(out_path)\\r\\n\\t\\t\\t\\t# \\trow = cursor.next()\\r\\n\\t\\t\\t\\t# \\twhile row:\\r\\n\\t\\t\\t\\t# \\t\\trow.setValue(\\\"BTypeURL\\\", selectedURL)\\r\\n\\t\\t\\t\\t# \\t\\trow.setValue(\\\"BTypeName\\\", inPlaceType)\\r\\n\\t\\t\\t\\t# \\t\\tcursor.updateRow(row)\\r\\n\\t\\t\\t\\t# \\t\\ti = i + 1\\r\\n\\t\\t\\t\\t# \\t\\trow = cursor.next()\\r\\n\\r\\n\\t\\t\\t\\t# get the map document\\r\\n\\t\\t\\t\\t# mxd = arcpy.mapping.MapDocument(\\r\\n\\t\\t\\t\\t# r\\\"D:\\\\UCSB_STKO_Lab\\\\STKO Research\\\\research\\\\DBpedia-Search-plugin\\\\wiki1.mxd\\\")\\r\\n\\r\\n\\r\\n\\r\\n\\t\\t\\t\\tmxd = arcpy.mapping.MapDocument(\\\"CURRENT\\\")\\r\\n\\r\\n\\t\\t\\t\\t# get the data frame\\r\\n\\t\\t\\t\\tdf = arcpy.mapping.ListDataFrames(mxd)[0]\\r\\n\\r\\n\\t\\t\\t\\t# create a new layer\\r\\n\\t\\t\\t\\tplaceNearLayer = arcpy.mapping.Layer(out_path)\\r\\n\\r\\n\\t\\t\\t\\t# add the layer to the map at the bottom of the TOC in data frame 0\\r\\n\\t\\t\\t\\tarcpy.mapping.AddLayer(df, placeNearLayer, \\\"BOTTOM\\\")\\r\\n\\r\\n\\t\\treturn\",\n \"def merge_global_features_collections(global_features_collections_list: List[Optional[Dict[str,\\n kapture.GlobalFeatures]]],\\n global_features_paths: List[str],\\n output_path: str,\\n tar_handlers: List[TarCollection]) -> Dict[str, kapture.GlobalFeatures]:\\n return _merge_image_features_collection(kapture.GlobalFeatures, global_features_collections_list,\\n global_features_paths, output_path, tar_handlers)\",\n \"def speed_map_segs_to_geojson(seg_list):\\n # Initialize a new GeoJSON object\\n new_geojson = {\\n 'type': 'FeatureCollection',\\n 'features': []\\n }\\n\\n # Dont work on the input list\\n seg_list_copy = copy.deepcopy(seg_list)\\n\\n # Iterativley build the features of the new GeoJSON object\\n for i, seg in enumerate(seg_list_copy):\\n # Prepare the feature properties\\n del seg['fromStop']\\n del seg['toStop']\\n\\n # New attribute, can be used to identify segments\\n seg['order'] = i\\n\\n # Prepare the feature geometry coordinates\\n pathLocs = seg.pop('pathLocs')\\n coords = [[p['lon'], p['lat']] for p in pathLocs]\\n\\n # Construct feature\\n new_feature = {\\n 'type': 'Feature',\\n 'geometry': {'type': 'LineString', 'coordinates': coords},\\n 'properties': seg\\n }\\n\\n # Append feature to the list of features in GeoJSON object\\n new_geojson['features'].append(new_feature)\\n\\n return new_geojson\",\n \"def _finalize_features(self) -> DataFrameLike:\\n all_features_dict = dict(ChainMap(*self._final_features.values()))\\n return pd.DataFrame(all_features_dict)\",\n \"def run(self):\\n lineage_csv_gz = self.input_files_local[0][0]\\n output_db = self.output_files_local()[0]\\n log.write(f\\\"input: {lineage_csv_gz} output: {output_db}\\\")\\n\\n with IdSeqDictForUpdate(output_db, IdSeqDictValue.VALUE_TYPE_ARRAY) as lineage_dict:\\n batch_list = {}\\n with gzip.open(lineage_csv_gz, \\\"rt\\\") as gzf:\\n for line in gzf:\\n fields = line.rstrip().split(\\\",\\\")\\n taxid = fields[0]\\n species, genus, family = fields[-1:-4:-1]\\n batch_list[taxid] = [species, genus, family]\\n if len(batch_list) >= BATCH_INSERT_SIZE:\\n lineage_dict.batch_inserts(batch_list.items())\\n batch_list = {}\\n lineage_dict.batch_inserts(batch_list.items())\",\n \"def finalize(feature, features, obj, source, aipname, cta_aip, restrict_aip, aip_sup, tia_aip):\\n global completed\\n global country\\n global end_notam\\n\\n feature['properties']['source_href']=source\\n feature['properties']['country']=country\\n feature['geometry'] = obj\\n aipname = wstrip(str(aipname))\\n if aipname == 'EN D476':\\n aipname = 'EN D476 R og B 1'\\n if aipname == 'EN D477':\\n aipname = 'EN D477 R og B 2'\\n\\n if 'ACC' in aipname and country==\\\"ES\\\":\\n return {\\\"properties\\\":{}}, []\\n for ignore in ['ADS','AOR','FAB',' FIR','HTZ']:\\n if ignore in aipname:\\n logger.debug(\\\"Ignoring: %s\\\", aipname)\\n return {\\\"properties\\\":{}}, []\\n feature['properties']['name']=aipname\\n if cta_aip or aip_sup or tia_aip or 'ACC' in aipname:\\n recount = len([f for f in features if aipname in f['properties']['name']])\\n recount = recount or len([f for f in accsectors if aipname in f['properties']['name']])\\n if recount>0:\\n separator = \\\" \\\"\\n if re.search('\\\\d$', aipname):\\n separator=\\\"-\\\"\\n # special handling Farris TMA skipping counters\\n if \\\"Farris\\\" in aipname:\\n if recount > 4:\\n recount += 2\\n else:\\n recount += 1\\n logger.debug(\\\"RECOUNT renamed \\\" + aipname + \\\" INTO \\\" + aipname + separator + str(recount+1))\\n feature['properties']['name']=aipname + separator + str(recount+1)\\n if 'TIZ' in aipname or 'TIA' in aipname:\\n feature['properties']['class']='G'\\n elif 'CTR' in aipname:\\n feature['properties']['class']='D'\\n elif 'TRIDENT' in aipname \\\\\\n or 'EN D' in aipname or 'END' in aipname \\\\\\n or 'ES D' in aipname:\\n feature['properties']['class']='D'\\n elif 'EN R' in aipname \\\\\\n or 'ES R' in aipname or 'ESTRA' in aipname \\\\\\n or 'EUCBA' in aipname or 'RPAS' in aipname:\\n feature['properties']['class']='R'\\n elif 'TMA' in aipname or 'CTA' in aipname or 'FIR' in aipname \\\\\\n or 'ACC' in aipname or 'ATZ' in aipname or 'FAB' in aipname \\\\\\n or 'Sector' in aipname:\\n feature['properties']['class']='C'\\n elif '5.5' in source or \\\"Hareid\\\" in aipname:\\n if \\\"Nidaros\\\" in aipname:\\n #skip old Nidaros airspace\\n return {\\\"properties\\\":{}}, []\\n feature['properties']['class']='Luftsport'\\n index = len(collection)+len(features)\\n\\n if names.get(aipname):\\n logger.debug(\\\"DUPLICATE NAME: %s\\\", aipname)\\n\\n if len(obj)>100:\\n logger.debug(\\\"COMPLEX POLYGON %s with %i points\\\", feature['properties'].get('name'), len(obj))\\n obj=simplify_poly(obj, 100)\\n feature['geometry'] = obj\\n\\n if len(obj)>3:\\n logger.debug(\\\"Finalizing polygon #%i %s with %i points.\\\", index, feature['properties'].get('name'), len(obj))\\n\\n name = feature['properties'].get('name')\\n source = feature['properties'].get('source_href')\\n from_ = feature['properties'].get('from (ft amsl)')\\n to_ = feature['properties'].get('to (ft amsl)')\\n class_ = feature['properties'].get('class')\\n\\n\\n if name in completed:\\n logger.info(\\\"ERROR Duplicate feature name: #%i %s\\\", index, name)\\n return {\\\"properties\\\":{}}, []\\n #sys.exit(1)\\n else:\\n if 'ACC' in aipname:\\n logger.debug(\\\"Writing ACC sector to separate file: %s\\\", aipname)\\n accsectors.append(feature)\\n else:\\n features.append(feature)\\n\\n # SANITY CHECK\\n if name is None:\\n logger.error(\\\"Feature without name: #%i\\\", index)\\n sys.exit(1)\\n if \\\"None\\\" in name:\\n logger.error(\\\"Feature without name: #%i\\\", index)\\n sys.exit(1)\\n completed[name]=True\\n if source is None:\\n logger.error(\\\"Feature without source: #%i\\\", index)\\n sys.exit(1)\\n if feature['properties'].get('name') is None:\\n logger.error(\\\"Feature without name: #%i (%s)\\\", index, source)\\n sys.exit(1)\\n if class_ is None:\\n logger.error(\\\"Feature without class (boo): #%i (%s)\\\", index, source)\\n sys.exit(1)\\n # SPECIAL CASE NOTAM reserved ENR in Oslo area\\n if \\\"EN R\\\" in aipname and \\\"Kongsvinger\\\" in aipname:\\n feature['properties']['notam_only'] = 'true'\\n if \\\"EN R\\\" in aipname and (\\\"Romerike\\\" in aipname or (\\\"Oslo\\\" in aipname and not \\\"102\\\" in aipname)):\\n feature['properties']['notam_only'] = 'true'\\n feature['properties']['from (ft amsl)'] = '0'\\n feature['properties']['to (ft amsl)'] = '99999' # unspecified\\n feature['properties']['from (m amsl)'] = '0'\\n feature['properties']['to (m amsl)'] = '99999'\\n from_ = '0'\\n to_ = '0'\\n if (\\\"EN D\\\" in aipname or \\\"END\\\" in aipname) and end_notam:\\n feature['properties']['notam_only'] = 'true'\\n if from_ is None:\\n if \\\"en_sup_a_2018_015_en\\\" in source:\\n feature['properties']['from (ft amsl)']='0'\\n feature['properties']['from (m amsl)']='0'\\n from_ = '0'\\n else:\\n logger.error(\\\"Feature without lower limit: #%i (%s)\\\", index, source)\\n sys.exit(1)\\n if to_ is None:\\n if \\\"en_sup_a_2018_015_en\\\" in source:\\n feature['properties']['to (ft amsl)']='99999'\\n feature['properties']['to (m amsl)']='9999'\\n to_ = '99999'\\n else:\\n logger.error(\\\"Feature without upper limit: #%i (%s)\\\", index, source)\\n sys.exit(1)\\n if int(from_) >= int(to_):\\n # SPECIAL CASE NOTAM reserved ENR in Oslo area\\n if \\\"en_sup_a_2018_015_en\\\" in source or \\\"Romerike\\\" in aipname or \\\"Oslo\\\" in aipname:\\n feature['properties']['from (ft amsl)']=to_\\n feature['properties']['to (ft amsl)']=from_\\n else:\\n logger.error(\\\"Lower limit %s > upper limit %s: #%i (%s)\\\", from_, to_, index, source)\\n sys.exit(1)\\n elif len(obj)>0:\\n logger.error(\\\"ERROR Finalizing incomplete polygon #%i (%i points)\\\", index, len(obj))\\n\\n names[aipname]=True\\n logger.debug(\\\"OK polygon #%i %s with %i points (%s-%s).\\\", index, feature['properties'].get('name'),\\n len(obj),\\n feature['properties'].get('from (ft amsl)'),\\n feature['properties'].get('to (ft amsl)'))\\n return {\\\"properties\\\":{}}, []\",\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 extract_features(self):\\n\\n self.feature_paths = dict()\\n for feat_type in self.outlier_feat_types:\\n try:\\n print('Extracting feature type: {}'.format(feat_type))\\n self.feature_paths[feat_type] = self.feature_extractor(self, feat_type)\\n except:\\n traceback.print_exc()\\n print('Unable to extract {} features! skipping..'.format(feat_type))\",\n \"def generate(self):\\n i = self.start_index\\n df_array = []\\n # load the dataframes from the multiple files(one file per frame_id, agent_id pair)\\n for k in range(self.frame_length): # segment length\\n frame_id = i + k\\n # print(frame_id)\\n # breakpoint()\\n if frame_id >= len(self.agent_maps):\\n print(\\n f\\\"Trying to access frame {frame_id} but only have {len(self.agent_maps)}\\\"\\n )\\n # breakpoint()\\n break\\n df = pd.read_csv(self.agent_maps[frame_id], compression=\\\"gzip\\\")\\n df = df.query(f\\\"abs(pos_x)<{self.radius} & abs(pos_y)<{self.radius}\\\")\\n df_array.append(df)\\n # merge all dataframes together\\n if len(df_array) == 0:\\n self.df_merged = pd.DataFrame()\\n self.agent_tracks = {}\\n self.agent_metadata_dfs = {}\\n self.agent_track_len = {}\\n self.sorted_agent_ids = []\\n return\\n self.df_merged = pd.concat(df_array).reset_index()\\n # group all dataframes by id, so that we can get agent level metrics across time\\n agent_grp = self.df_merged.groupby(\\\"id\\\")\\n self.agent_tracks = {}\\n self.agent_metadata_dfs = {}\\n self.agent_track_len = {}\\n for agent_id in agent_grp.groups:\\n sub_df = self.df_merged.iloc[agent_grp.groups[agent_id]]\\n # empty template for the trajectories\\n tracks = [\\n [self.radius + 1, self.radius + 1] for _ in range(self.frame_length)\\n ]\\n track_len = 0\\n # populate the empty template\\n for idx, row in sub_df.iterrows():\\n frame_idx = row.frame_id - self.start_index\\n # if row.frame_id == 0:\\n # # check if the object is within the car position add to the current frame\\n # print(\\\"0 frame id\\\")\\n try:\\n tracks[frame_idx] = [row.pos_x, row.pos_y]\\n except:\\n breakpoint()\\n track_len += 1\\n self.agent_tracks[agent_id] = np.array(tracks)\\n self.agent_metadata_dfs[agent_id] = sub_df\\n self.agent_track_len[agent_id] = track_len\\n self.sorted_agent_ids = list(self.agent_track_len.keys())\\n self.sorted_agent_ids.sort(key=lambda x: self.agent_track_len[x], reverse=True)\",\n \"def _parse_features(self):\\n for root in self.roots:\\n for feature in root.iter('feature'):\\n api = feature.attrib.get('api', '')\\n feature_name = feature.attrib.get('name', '')\\n feature_number = int(float(feature.attrib.get('number', '')) * 10.0)\\n\\n # filter by api\\n if api != 'gl':\\n continue\\n\\n for require in feature.iter('require'):\\n require_profile = require.attrib.get('profile', '')\\n if require_profile and require_profile != 'core':\\n # filter by profile\\n continue\\n\\n for enum in require.iter('enum'):\\n enum_name = enum.attrib.get('name', '')\\n self.enum_list.append(enum_name)\\n self.enum_required_by_feature[enum_name].append({\\n 'api': api,\\n 'name': feature_name,\\n 'number': feature_number,\\n 'profile': require_profile\\n })\\n for command in require.iter('command'):\\n command_name = command.attrib['name']\\n self.command_list.append(command_name)\\n self.command_required_by_feature[command_name].append({\\n 'api': api,\\n 'name': feature_name,\\n 'number': feature_number,\\n 'profile': require_profile\\n })\\n\\n for remove in feature.iter('remove'):\\n remove_profile = remove.attrib.get('profile', '')\\n if require_profile and require_profile != 'core':\\n # filter by profile\\n continue\\n\\n for enum in remove.iter('enum'):\\n enum_name = enum.attrib.get('name', '')\\n self.enum_removed_by_feature[enum_name].append({\\n 'api': api,\\n 'name': feature_name,\\n 'number': feature_number,\\n 'profile': remove_profile\\n })\\n for command in remove.iter('command'):\\n command_name = command.attrib['name']\\n self.command_removed_by_feature[command_name].append({\\n 'api': api,\\n 'name': feature_name,\\n 'number': feature_number,\\n 'profile': remove_profile\\n })\",\n \"def _process_data(self):\\n assert not hasattr(self, 'changes'), '_process_data called twice.'\\n assert hasattr(self, 'errors'), (\\n '_process_data not called by is_valid().')\\n r_by_t = Collection.resource_by_type\\n\\n # Create and load collection of new data\\n new_collection = Collection()\\n for rtype, items in self.data.items():\\n resource_cls = r_by_t.get(rtype)\\n if resource_cls:\\n for seq, json_api_item in enumerate(items):\\n item = json_api_item.copy()\\n links = item.pop('links', {})\\n item.update(links)\\n resource = self.load_resource(resource_cls, item)\\n resource._seq = seq\\n new_collection.add(resource)\\n\\n # Create native representation of current feature data\\n current_collection = Collection(DjangoResourceClient())\\n feature_serializer = ViewFeatureSerializer(context=self.context)\\n current_feature = feature_serializer.to_representation(self.feature)\\n current_extra = current_feature.pop('_view_extra')\\n del current_extra['meta']\\n\\n # Load feature into new and current collection\\n current_feature_resource = self.load_resource(\\n r_by_t['features'], current_feature)\\n current_collection.add(current_feature_resource)\\n current_feature.update(self.feature._in_extra)\\n current_feature['id'] = str(current_feature['id'])\\n resource_feature = self.load_resource(\\n r_by_t['features'], current_feature)\\n resource_feature._seq = None\\n new_collection.add(resource_feature)\\n\\n # Populate collection of current data\\n for rtype, items in current_extra.items():\\n resource_cls = r_by_t[rtype]\\n for item in items:\\n resource = self.load_resource(resource_cls, item)\\n current_collection.add(resource)\\n\\n # Add existing items not explicit in PUT content\\n # This avoids 'delete' changes\\n new_items = new_collection.get_all_by_data_id()\\n for data_id, item in current_collection.get_all_by_data_id().items():\\n if data_id not in new_items:\\n rtype = item._resource_type\\n resource = r_by_t[rtype]()\\n json_api_rep = item.to_json_api()\\n json_api_rep[rtype]['id'] = item.id.id\\n resource.from_json_api(json_api_rep)\\n resource._seq = None\\n new_collection.add(resource)\\n\\n # Add existing items used in new collection to current collection\\n # This avoids incorrect 'new' changes\\n existing_items = current_collection.get_all_by_data_id()\\n for data_id, item in new_collection.get_all_by_data_id().items():\\n if item.id:\\n item_id = item.id.id\\n int_id = None\\n existing_item = existing_items.get(data_id)\\n try:\\n int_id = int(item_id)\\n except ValueError:\\n pass\\n if int_id and (existing_item is None):\\n rtype = item._resource_type\\n resource_cls = r_by_t[rtype]\\n model_cls, serializer_cls = view_cls_by_name[rtype]\\n obj = model_cls.objects.get(id=int_id)\\n serializer = serializer_cls()\\n data = serializer.to_representation(obj)\\n resource = self.load_resource(resource_cls, data)\\n current_collection.add(resource)\\n\\n # Load the diff\\n self.changeset = CollectionChangeset(\\n current_collection, new_collection)\\n assert not self.changeset.changes.get('deleted'), (\\n 'Existing items were not added, so deletions found:\\\\n%s'\\n % self.changes['deleted'])\",\n \"def _update_from_exons(self, feature):\\n # note that start and end here are in direction of translation\\n def start(loc):\\n return loc[0][1]\\n\\n def end(loc):\\n if loc[-1][2] == \\\"+\\\":\\n return loc[-1][1] + loc[-1][3] + 1\\n else:\\n return loc[-1][1] - loc[-1][3] - 1\\n\\n if 'exon' in feature:\\n # update the feature with the exon locations and sequences\\n feature['location'] = [x['location'][0] for x in feature['exon']]\\n feature['dna_sequence'] = \\\"\\\".join(\\n x['dna_sequence'] for x in feature['exon'])\\n feature['dna_sequence_length'] = len(feature['dna_sequence'])\\n\\n # construct feature location from utrs and cdss if present\\n elif 'cds' in feature:\\n cds = [copy.deepcopy(self.feature_dict[feature['cds']])]\\n locs = [] # type: list\\n seq = \\\"\\\"\\n for frag in feature.get('five_prime_UTR', []) + cds + \\\\\\n feature.get('three_prime_UTR', []):\\n\\n # merge into last location if adjacent\\n if locs and abs(end(locs) - start(frag['location'])) == 1:\\n # extend the location length by the length of the first\\n # location in the fragment\\n first = frag['location'].pop(0)\\n locs[-1][3] += first[3]\\n\\n locs.extend(frag['location'])\\n seq += frag['dna_sequence']\\n\\n feature['location'] = locs\\n feature['dna_sequence'] = seq\\n feature['dna_sequence_length'] = len(seq)\\n\\n # remove these properties as they are no longer needed\\n for x in ['five_prime_UTR', 'three_prime_UTR', 'exon']:\\n feature.pop(x, None)\\n\\n else:\\n ValueError('Feature {feature[\\\"id\\\"]} must contain either exon or cds data to '\\n 'construct an accurate location and sequence')\",\n \"def generate_feature(self):\\n for cmd in self.get_filtered_cmd_names():\\n self.command_info[cmd] = self.feature_cmd_params[cmd]\",\n \"def _parse_pbf(self):\\n # todo pyrosm bounding_box is inefficient, first extract bbox from pbf using pyosmium\\n osm = pyrosm.OSM(filepath=self._pbf, bounding_box=self._bbox)\\n osm.keep_node_info = True\\n logging.info(\\\"Parsing OSM ways and nodes from pbf file\\\")\\n ways = osm.get_network(self._profile)\\n\\n all_nodes = osm._nodes_gdf # todo this has all the attributes but goes out of memory easily\\n way_nodes_ids = ways.nodes.explode().unique().tolist()\\n nodes = all_nodes.loc[all_nodes.id.isin(way_nodes_ids)]\\n\\n def clip_way(way):\\n clipped_way = way.copy()\\n clipped_way.nodes = clipped_way.nodes[:len(way.geometry.coords.xy[0])-1]\\n return clipped_way\\n\\n broken_ways = ways.nodes.apply(lambda x: not all(n in nodes.id.to_list() for n in x))\\n for ix, way in ways.loc[broken_ways].iterrows():\\n ways.loc[ix] = clip_way(way)\\n\\n # all_nodes = osm._node_coordinates\\n # way_nodes = {id: all_nodes[id] for id in way_nodes_ids if id in all_nodes.keys()}\\n # nodes = pd.DataFrame.from_dict(way_nodes, orient='index', columns=['longitude', 'latitude'])\\n # nodes['id'] = nodes.index\\n\\n # ways_nodes_found = ways.nodes.apply(lambda x: all(n in nodes.id.to_list() for n in x))\\n # nodes = pd.DataFrame(columns=['id', 'latitude', 'longitude'])\\n # for ix, way in ways.iterrows():\\n # way_nodes = pd.DataFrame(columns=['id', 'latitude', 'longitude'])\\n # try:\\n # way_nodes.id = way.nodes\\n # way_nodes.latitude = way.geometry.coords.xy[1]\\n # way_nodes.longitude = way.geometry.coords.xy[0]\\n # except:\\n # pass\\n # nodes = nodes.append(way_nodes, ignore_index=True)\\n\\n logging.info(\\\"Done parsing pbf file\\\")\\n return nodes, ways\",\n \"def __surface_labelled_segmentation_pipeline(self, features):\\n tic = time.perf_counter()\\n\\n # Collect the data\\n ###########################################\\n training_data, dev_data, test_data = {}, {}, {}\\n dictionaries = (training_data, dev_data, test_data)\\n counter = 0\\n for file in self.input_files:\\n input_file = open(os.path.join(sys.path[0], file), 'r')\\n for line in input_file.readlines():\\n content = line.rstrip('\\\\n').split(\\\" | \\\")\\n labels = '-'.join(get_labels(content[2]))\\n segments = removeLabels(content[2])\\n\\n # dictionaries[counter][content[0]] = [segments, labels] # word:[[segments],[labels]]\\n dictionaries[counter][segments] = labels # segments : labels\\n input_file.close()\\n counter += 1\\n\\n toc = time.perf_counter()\\n print(\\\"Data Collected in \\\" + str(tic - toc.__round__(2)))\\n\\n # Evaluate Model On the Test Set Using Optimised Model\\n #######################################################\\n\\n print(\\\"Beginning Feature Computation and Model Optimisation\\\")\\n tic = time.perf_counter()\\n\\n X_training, Y_training, words_training = surface_labelled_data_preparation(training_data)\\n X_dev, Y_dev, words_dev = surface_labelled_data_preparation(dev_data)\\n X_test, Y_test, words_test = surface_labelled_data_preparation(test_data)\\n print(\\\"Data Processed\\\")\\n\\n best_epsilon = 1e-07\\n best_max_iteration = 280\\n best_algo = 'ap'\\n\\n # crf = sklearn_crfsuite.CRF(algorithm=best_algo, epsilon=best_epsilon, max_iterations=best_max_iteration)\\n '''crf = sklearn_crfsuite.CRF(\\n algorithm='lbfgs',\\n c1=0.1,\\n c2=0.1,\\n max_iterations=100,\\n all_possible_transitions=True\\n )'''\\n crf = sklearn_crfsuite.CRF(algorithm='ap', epsilon=best_epsilon, max_iterations=best_max_iteration)\\n print(\\\"CRF Initialized\\\")\\n # crf.fit(X_training, Y_training, X_dev=X_dev, y_dev=Y_dev)\\n crf.fit(X_training, Y_training)\\n print(\\\"Data Fitted\\\")\\n Y_predict = crf.predict(features)\\n labels = list(crf.classes_)\\n sorted_labels = sorted(labels)\\n return Y_predict, Y_test\",\n \"def compute(self, inputs, outputs):\\n\\n log.info(f\\\"Start optimisation iteration: {Rt.counter}\\\")\\n\\n # Update the geometry dictionary\\n for name, infos in Rt.geom_dict.items():\\n infos[1].append(inputs[name][0])\\n\\n if Rt.counter == 0:\\n\\n # For the first iteration, update the CPACS file from previous module\\n cpacs_in = Rt.modules[0].cpacs_in\\n cpacs_out = Rt.modules[0].cpacs_out\\n update_cpacs_file(cpacs_in, cpacs_out, Rt.geom_dict)\\n\\n else:\\n\\n for m, module in enumerate(Rt.modules):\\n\\n # Increment name of output CPACS file\\n Rt.modules[m].cpacs_out = Path(\\n Rt.modules[m].cpacs_out.parents[0],\\n \\\"iter_\\\" + str(Rt.counter).rjust(2, \\\"0\\\") + \\\".xml\\\",\\n )\\n\\n if m == 0:\\n\\n # Use output of the last module of the previous iteration as input\\n Rt.modules[m].cpacs_in = Rt.modules[-1].cpacs_out\\n\\n # Update the geometry of the CPACS file\\n cpacs_in = Rt.modules[m].cpacs_in\\n cpacs_out = Rt.modules[m].cpacs_out\\n update_cpacs_file(cpacs_in, cpacs_out, Rt.geom_dict)\\n\\n # # The first module of the loop must update its output where the input\\n # # was saved because it has been updated by \\\"update_cpacs_file\\\" function.\\n # Rt.modules[m].cpacs_in = Rt.modules[m].cpacs_out\\n\\n else:\\n\\n # Increment name of input CPACS file\\n Rt.modules[m].cpacs_in = Path(\\n Rt.modules[m].cpacs_in.parents[0],\\n \\\"iter_\\\" + str(Rt.counter).rjust(2, \\\"0\\\") + \\\".xml\\\",\\n )\\n\\n Rt.counter += 1\",\n \"def process(self):\\n coo_adj = sp.load_npz(os.path.join(self.raw_path, \\\"adj_full.npz\\\"))\\n g = from_scipy(coo_adj)\\n\\n features = np.load(os.path.join(self.raw_path, \\\"feats.npy\\\"))\\n features = F.tensor(features, dtype=F.float32)\\n\\n y = [-1] * features.shape[0]\\n with open(os.path.join(self.raw_path, \\\"class_map.json\\\")) as f:\\n class_map = json.load(f)\\n for key, item in class_map.items():\\n y[int(key)] = item\\n labels = F.tensor(np.array(y), dtype=F.int64)\\n\\n with open(os.path.join(self.raw_path, \\\"role.json\\\")) as f:\\n role = json.load(f)\\n\\n train_mask = np.zeros(features.shape[0], dtype=bool)\\n train_mask[role[\\\"tr\\\"]] = True\\n\\n val_mask = np.zeros(features.shape[0], dtype=bool)\\n val_mask[role[\\\"va\\\"]] = True\\n\\n test_mask = np.zeros(features.shape[0], dtype=bool)\\n test_mask[role[\\\"te\\\"]] = True\\n\\n g.ndata[\\\"feat\\\"] = features\\n g.ndata[\\\"label\\\"] = labels\\n g.ndata[\\\"train_mask\\\"] = generate_mask_tensor(train_mask)\\n g.ndata[\\\"val_mask\\\"] = generate_mask_tensor(val_mask)\\n g.ndata[\\\"test_mask\\\"] = generate_mask_tensor(test_mask)\\n\\n if self._reorder:\\n self._graph = reorder_graph(\\n g,\\n node_permute_algo=\\\"rcmk\\\",\\n edge_permute_algo=\\\"dst\\\",\\n store_ids=False,\\n )\\n else:\\n self._graph = g\",\n \"def add_features(self, fbids):\\n if not fbids:\\n warnings.warn(\\\"No fbids provided.\\\")\\n return False\\n feats = self.name_synonym_lookup(fbids)\\n proc_names = [f._asdict() for f in feats.values()]\\n for d in proc_names:\\n d['synonyms'] = '|'.join(d['synonyms'])\\n statement = \\\"MERGE (n:Feature:Class { short_form : line.fbid } ) \\\" \\\\\\n \\\"SET n.label = line.symbol SET n.synonyms = split(line.synonyms, '|') \\\" \\\\\\n \\\"SET n.iri = 'http://flybase.org/reports/' + line.fbid\\\" # Why not using ni? Can kbw have switch to work via csv?\\n self.commit_via_csv(statement, proc_names)\\n self.addTypes2Neo(fbids)\\n return feats\",\n \"def combine_all(self):\\n combined = copy.deepcopy(self.train)\\n\\n def _combine_data(data):\\n for img_path, pid, camid in data:\\n\\n if pid in self._junk_pids:\\n continue\\n #pdb.set_trace()\\n pid = self.dataset_name + \\\"_\\\" + str(pid)\\n camid = self.dataset_name + \\\"_\\\" + str(camid)\\n combined.append((img_path, pid, camid))\\n\\n _combine_data(self.query)\\n _combine_data(self.gallery)\\n\\n self.train = combined\\n self.num_train_pids = self.get_num_pids(self.train)\",\n \"def add_features_to_output(m: onnx.ModelProto) -> None:\\n del m.graph.output[:]\\n m.graph.output.extend(m.graph.value_info)\",\n \"def _extract_features(self, a_rel, a_parses):\\n feats = {}\\n doc_id = a_rel[DOC_ID]\\n toks_pos1 = self._get_toks_pos(a_parses[doc_id][SENTENCES],\\n a_rel, ARG1)\\n toks_pos2 = self._get_toks_pos(a_parses[doc_id][SENTENCES],\\n a_rel, ARG2)\\n self._get_product_rules(feats, doc_id, a_rel, a_parses)\\n self._get_dep_rules(feats, doc_id, a_rel, a_parses)\\n self._get_first_last_toks(feats, toks_pos1, toks_pos2)\\n self._get_modality(feats, toks_pos1, toks_pos2)\\n self._get_vb_class(feats, toks_pos1, toks_pos2)\\n self._get_brown_clusters(feats, toks_pos1, toks_pos2)\\n self._get_inquirer(feats, toks_pos1, toks_pos2)\\n self._get_MPQA(feats, toks_pos1, toks_pos2)\\n return feats\",\n \"def target_mapping(self):\\n\\n map_list = []\\n self.bin_tracking_array = self.seg_analyzer.bin_tracking_array\\n self.log.info(\\\"Spawning {0} jobs to begin building Target_Bed_Map_Array for permutation analysis.\\\"\\n .format(self.args.Spawn))\\n\\n p = pathos.multiprocessing.Pool(int(self.args.Spawn))\\n for lst in p.starmap(self.sub_target_mapping,\\n zip(itertools.repeat(self.bin_tracking_array), itertools.repeat(self.target_bed_array),\\n itertools.repeat(self.args), self.seg_analyzer.chrom_list)):\\n\\n map_list.extend(lst)\\n\\n map_list.sort(key=lambda x: x[0])\\n\\n if eval(self.args.Map_File):\\n self.log.info(\\\"Writing Map File\\\")\\n file_data = \\\"\\\"\\n map_file = open(\\\"{0}{1}_{2}_mapfile.txt\\\"\\n .format(self.args.Working_Folder, self.args.Job_Name, self.args.Cell_Name), 'w')\\n map_file.write(\\\"Chrom\\\\tstart\\\\tstop\\\\trefBinID\\\\ttargetBinID\\\\ttargetCount\\\\n\\\")\\n\\n for row in sorted(map_list, key=itemgetter(0)):\\n\\n coord_start = int(self.bin_tracking_array[self.bin_tracking_array[:, 0] == row[0]][0, 2])\\n coord_stop = int(self.bin_tracking_array[self.bin_tracking_array[:, 0] == row[0]][0, 3])\\n chrom = self.bin_tracking_array[self.bin_tracking_array[:, 0] == row[0]][0, 1].decode()\\n r_count = len(row[1])\\n file_data += (\\\"{0}\\\\t{1}\\\\t{2}\\\\t{3}\\\\t{4}\\\\t{5}\\\\n\\\"\\n .format(chrom, coord_start, coord_stop, row[0], row[1], r_count))\\n\\n map_file.write(file_data)\\n map_file.close()\\n self.log.info(\\\"Map File Written\\\")\\n\\n self.log.info(\\\"Target_Bed_Map_Array built.\\\")\\n return numpy.array(map_list, dtype='object')\",\n \"def get_stats(self):\\n # pool.map needs an arg for each function that will be run\\n dmx_mean = [self.dmx.mean()] * len(self.genome_paths)\\n with ProcessingPool() as pool:\\n results = pool.map(genome.mp_stats, self.genome_paths, dmx_mean)\\n self.stats = pd.concat(results)\\n self.stats.to_csv(self.stats_path)\",\n \"def collect_pipeline_runs(self):\\n db = self.mongo_client.metalearning\\n collection = db.pipeline_runs\\n collection_size = collection.count()\\n pipeline_cursor = collection.find()\\n list_of_experiments = {\\\"classification\\\": [], \\\"regression\\\": []}\\n for index, pipeline_run in enumerate(pipeline_cursor):\\n if index % 1000 == 0:\\n print(\\\"At {} out of {} documents\\\".format(index, collection_size))\\n # if index == 2000:\\n # # running into memory errors\\n # break\\n pipeline_run_info = self.get_pipeline_run_info(pipeline_run)\\n metafeatures = self.get_metafeature_info(pipeline_run)\\n # TODO: get all metafeatures so we don't need this\\n if metafeatures != {}:\\n experiment_json = dict(pipeline_run_info, **metafeatures)\\n list_of_experiments[experiment_json[\\\"problem_type\\\"]].append(experiment_json)\\n\\n for problem_type in list_of_experiments.keys():\\n final_data_file = json.dumps(list_of_experiments[problem_type], sort_keys=True, indent=4, default=json_util.default)\\n with open(\\\"data/complete_pipelines_and_metafeatures_test_{}.json\\\".format(problem_type), \\\"w\\\") as file:\\n file.write(final_data_file)\\n\\n return\",\n \"def add_mapping(self, protocol: Protocol, features: Set[FeatureName]) -> None:\\n instance = cast(interface.Features, self.get(protocol))\\n if instance:\\n for feature in features:\\n # Add feature to map if missing OR replace if this protocol has higher\\n # priority than previous mapping\\n if feature not in self._feature_map or self._has_higher_priority(\\n protocol, self._feature_map[feature][0]\\n ):\\n self._feature_map[feature] = (protocol, instance)\",\n \"def create_new_features(self):\\n train = self.train\\n \\n train['is_context'] = train['context_type'].isin(CONTEXT_TYPE_TEST)\\n train['is_context_flow'] = train['listen_type'] * train['is_context']\\n \\n train['is_listened_context'] = train['is_listened'] * train['is_context']\\n train['is_listened_flow'] = train['is_listened'] * train['listen_type']\\n train['is_listened_context_flow'] = train['is_listened'] * train['is_context_flow']\\n \\n for feature in self.categorize_features:\\n gby_feat = train.groupby(feature)\\n new_features(train, gby_feat, feature, feature in self.listen_type_features, self.context_features, self.flow_features, self.fillna)\\n \\n # Variable combinations\\n for feat1 in self.combo_features1:\\n for feat2 in self.combo_features2:\\n gby_feat = train.groupby([feat1, feat2])\\n name = feat1 + '_' + feat2\\n new_features(train, gby_feat, name, feat1 in self.listen_type_features, self.context_features, self.flow_features, self.fillna)\",\n \"def generate(self):\\n self.generate_points()\\n self.generate_edges()\",\n \"def run_map(self):\\n # Split input into chunks for processing\\n files = self.split_list()\\n # Make processing pool\\n pool = Pool(processes=self.args.ncore)\\n # Map processing to _run function\\n self.output = pool.map(_run, files)\\n # Close and join pool\\n pool.close()\\n pool.join()\",\n \"def social_infrastructure_combined(osm_path): \\n df_point = social_infrastructure_point(osm_path)\\n df_polygon = social_infrastructure_polygon(osm_path)\\n \\n df_polygon_filtered = compare_polygon_to_point(df_point, df_polygon) #remove duplicates polygon and point data \\n df_polygon_filtered['geometry'] = pygeos.centroid(df_polygon_filtered.geometry) #transform to pointdata\\n \\n return (df_point.append(df_polygon_filtered)).reset_index(drop=True)\",\n \"def output_grid_information():\\n # translate = [-74.26, 40.50]\\n # scale = [0.02, 0.02]\\n # step = 1\\n\\n translate = [0, 0]\\n scale = [1, 1]\\n step = 0.02\\n\\n lon_limits = [(-74.26 - translate[0]) / scale[0], (-73.76 - translate[0]) / scale[0]]\\n lat_limits = [(40.48 - translate[1]) / scale[1], (40.94 - translate[1]) / scale[1]]\\n\\n lons = np.arange(lon_limits[0], lon_limits[1] - step, step)\\n lats = np.arange(lat_limits[0], lat_limits[1] - step, step)\\n\\n all_json = {\\n \\\"type\\\": \\\"FeatureCollection\\\"\\n }\\n\\n gr_id = 0\\n grid_df = pd.DataFrame(columns=['gr_id', 'c_lat', 'c_lon', 's_lon', 'w_lat', 'n_lon', 'e_lat'])\\n features = []\\n\\n for lat in lats:\\n for lon in lons:\\n w_lon = lon\\n e_lon = lon + step\\n s_lat = lat\\n n_lat = lat + step\\n\\n c_lon = lon + step / 2\\n c_lat = lat + step / 2\\n\\n grid_df = grid_df.append(pd.DataFrame({\\\"gr_id\\\": [gr_id],\\n \\\"c_lon\\\": [c_lon], \\\"c_lat\\\": [c_lat],\\n \\\"w_lon\\\": [w_lon], \\\"s_lat\\\": [s_lat],\\n \\\"e_lon\\\": [e_lon], \\\"n_lat\\\": [n_lat]}))\\n\\n coor = [[[s_lat, w_lon], [n_lat, w_lon], [n_lat, e_lon],\\n [s_lat, e_lon], [s_lat, w_lon]]]\\n\\n feature = {\\n \\\"type\\\": \\\"Feature\\\",\\n \\\"geometry\\\": {\\n \\\"type\\\": \\\"Polygon\\\",\\n \\\"coordinates\\\": coor\\n },\\n \\\"properties\\\": {\\n \\\"id\\\": str(gr_id)\\n }\\n }\\n\\n features.append(feature)\\n\\n gr_id += 1\\n\\n all_json['features'] = features\\n\\n with open(BaseDir + '/grid.geojson', 'w') as f:\\n json.dump(all_json, f)\\n\\n grid_df.to_csv(BaseDir + '/grid_locs.csv', index=False)\",\n \"def updateFeatureClass(self, featureClass, query=[\\\"1=1\\\"], append=False, userFields=[], debug=False):\\n if debug:\\n debug = Debug()\\n debug.log(\\\"Running %s\\\" %debug.callingScript)\\n #check if user fileds already exist\\n if not self.userFields:\\n self.userFields = userFields\\n #check for errors\\n if not validWorkspace(featureClass):\\n raise IncorrectWorkspaceType(\\\"Incorrect workspace - feature class must be created in a local geodatabase\\\")\\n if not self.__matchSchema(featureClass):\\n raise SchemaMismatch(\\\"Schema of input feature class does not match object schema\\\")\\n queries = self.__generateQuery(query)\\n cursor = None\\n\\n #iterate over queries\\n for query in queries:\\n if debug: debug.log(\\\"Working on %s\\\" %query)\\n recordsInQuery = self.__getNumRecordsFromQuery(query, debug=debug)\\n if recordsInQuery == 0:\\n if debug: debug.log(\\\"Skipping query\\\")\\n continue\\n elif self.__numRecordsMoreThanMax(recordsInQuery):\\n del cursor\\n raise TooManyRecords(\\\"Query returns more than max allowed. Please refine query: \\\" + query)\\n #else do the rest\\n rValues = {\\\"where\\\":query,\\n \\\"f\\\":\\\"json\\\",\\n \\\"returnCountOnly\\\":\\\"false\\\",\\n \\\"outFields\\\": \\\"*\\\"}\\n featureData = self._getEsriRESTJSON(self.url+\\\"/query\\\", rValues, useIjson=True, debug=debug)\\n if debug: debug.log(\\\"Successfully returned data\\\")\\n\\n #Append or overwrite mode - prevents deletion if service is unavailable\\n if all([not append, not cursor]):\\n if debug: debug.log(\\\"Deleting records\\\")\\n arcpy.DeleteFeatures_management(featureClass)\\n\\n #instantiate cursor\\n if not cursor:\\n if debug: debug.log(\\\"Instantiating cursor\\\")\\n updateFields = [f['name'] for f in self.updateFields]\\n cursor = arcpy.da.InsertCursor(featureClass, updateFields)\\n\\n for feature in featureData:\\n #if geometry is bad, skip record\\n try:\\n geom = self.__getGeometry(feature['geometry'])\\n except NullGeometryError as e:\\n if debug: debug.log(\\\"Null geometry error\\\")\\n continue\\n except:\\n if debug: debug.log(\\\"Some other geometry error - couldn't get geometry\\\")\\n attributes = []\\n attributes.append(geom)\\n for field in self.updateFields:\\n if field['name'] == \\\"Shape@\\\":\\n continue\\n elif 'date' in field['type'].lower():\\n attributes.append(self.__handleDateAttribute(feature['attributes'][field['name']]))\\n else:\\n \\\"\\\"\\\"getting strange OverflowError Python int too large to convert to C long,\\n so casting section getting problem with some services where some fields\\n aren't returned in results so added try/catch block\\\"\\\"\\\"\\n try:\\n newAttribute = feature['attributes'][field['name']]\\n if type(newAttribute) is long:\\n if type(int(newAttribute)) is long:\\n attributes.append(float(newAttribute))\\n else:\\n attributes.append(newAttribute)\\n else:\\n attributes.append(newAttribute)\\n except KeyError, e:\\n attributes.append(None)\\n cursor.insertRow(attributes)\\n #Delete cursor\\n del cursor\\n if debug: debug.close()\",\n \"def __data_generation(self, batch_data):\\n X = np.zeros((self.batch_size, self.num_features), dtype=float)\\n y = np.zeros((self.batch_size, self.num_outputs), dtype=float)\\n\\n for i, sample in batch_data.iterrows():\\n # Get lat/long of pickup and dropoff locations\\n PULocation = self.taxizone_data.loc[sample['PULocationID']].centroids\\n PULocationLong, PULocationLat = PULocation.x, PULocation.y\\n DOLocation = self.taxizone_data.loc[sample['DOLocationID']].centroids\\n DOLocationLong, DOLocationLat = DOLocation.x, DOLocation.y\\n\\n # Get month date, day of week and hours/mins for pickup\\n PUDateTime = datetime.strptime(sample.tpep_pickup_datetime, '%Y-%m-%d %H:%M:%S')\\n PUDate = PUDateTime.strftime('%Y-%m-%d')\\n PUYear, PUMonth, PUMonthDate = PUDate.split('-')\\n # TODO - Add this to pre-processing of trip data! Some random months in the data!!\\n if PUYear != '2018' or PUMonth != '06':\\n continue\\n PUDayOfWeek = PUDateTime.weekday()\\n PUTimeHour, PUTimeMinute = datetime.strptime(\\n sample.tpep_pickup_datetime, '%Y-%m-%d %H:%M:%S'\\n ).strftime('%H:%M').split(':')\\n\\n # Get precipitation for that day\\n Precipitation = self.weather_data[self.weather_data['DATE'] == PUDate]['PRCP'].values[0]\\n\\n X[i] = np.concatenate((np.array([\\n\\n PULocationLat,\\n PULocationLong,\\n DOLocationLat,\\n DOLocationLong,\\n abs((PULocationLat - DOLocationLat) ** 2 + abs(PULocationLong - DOLocationLong) ** 2) ** 0.5,\\n Precipitation\\n ]),\\n to_categorical(PUDayOfWeek, 7),\\n to_categorical(PUMonthDate, 31),\\n to_categorical(PUTimeHour, 24)\\n ))\\n\\n y[i] = [sample['duration']] if self.generator_type == 'duration' \\\\\\n else [sample['total_amount'] - sample['tip_amount']]\\n\\n return X, y\",\n \"def aggregate_from_base(\\n base_dir: str, ref_seq: str, ref_pos: t.Sequence[int],\\n pos_parser: t.Callable[[str], t.List[str]] = lambda x: x.split('-'),\\n temperature: float = 0.6, count_threshold: int = 100,\\n holo: str = 'holo', apo: str = 'apo', mc: str = 'MC',\\n bias_name: str = 'ADAPT.inp.dat', seqs_name: str = 'RESULTS.tsv') -> pd.DataFrame:\\n\\n ref_pos_str = list(map(str, ref_pos))\\n ref_pos_mapping = {p: i for i, p in enumerate(ref_pos_str)}\\n\\n def affinity_df(pair_base):\\n pop_apo = pd.read_csv(f'{pair_base}/{apo}/{mc}/{seqs_name}', sep='\\\\t')\\n pop_holo = pd.read_csv(f'{pair_base}/{holo}/{mc}/{seqs_name}', sep='\\\\t')\\n bias_apo = f'{pair_base}/{apo}/{mc}/{bias_name}'\\n bias_holo = f'{pair_base}/{holo}/{mc}/{bias_name}'\\n stability_apo = stability(pop_apo, bias_apo, ref_seq, temperature, count_threshold, ref_pos_str)\\n stability_holo = stability(pop_holo, bias_holo, ref_seq, temperature, count_threshold, ref_pos_str)\\n df = pd.merge(stability_apo, stability_holo, on='seq', how='outer', suffixes=['_apo', '_holo'])\\n df['affinity'] = df['stability_holo'] - df['stability_apo']\\n positions = pos_parser(pair_base)\\n df['seq_subset'] = df['seq'].apply(lambda s: ''.join(s[ref_pos_mapping[p]] for p in positions))\\n df['pos'] = '-'.join(positions)\\n return df\\n\\n paths = tqdm(glob(f'{base_dir}/*'), desc='Aggregating workers')\\n dfs = []\\n for p in paths:\\n try:\\n dfs.append(affinity_df(p))\\n except (NoReferenceError, ValueError, KeyError) as e:\\n warn(f'Could not aggregate worker {p} due to {e}')\\n\\n return pd.concat(dfs)\",\n \"def add_starters_to_map(gdf_best_route: gpd.GeoDataFrame, basemap):\\n #create a list of colors\\n colors = ['orange', 'darkred', 'darkblue', 'purple', 'darkgreen', '#364e4a', 'cadetblue']\\n\\n # make one feature group for the markers\\n fg_marker = folium.FeatureGroup(\\\"Destination Cities\\\")\\n for i, row in gdf_best_route.iterrows():\\n fg_marker.add_child(folium.Marker(\\n location=row[\\\"folium_geom\\\"][0],\\n tooltip=f\\\"{row['start_city']}\\\",\\n icon=folium.Icon(color=colors[i], icon='train', prefix='fa')\\n ))\\n basemap.add_child(fg_marker)\\n\\n return None\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60113615","0.5859844","0.5772984","0.5617712","0.5504301","0.5316391","0.5313953","0.5273943","0.5268024","0.5257252","0.52431345","0.52355766","0.52347904","0.52220434","0.52174675","0.5180655","0.5177188","0.5174838","0.51718193","0.5159236","0.51124686","0.5109292","0.510242","0.50930285","0.5087657","0.50649846","0.50555915","0.50475895","0.50474733","0.5042096","0.50420177","0.50235105","0.50206584","0.5001425","0.49987257","0.49842116","0.49836","0.49588332","0.49417564","0.4941491","0.49233416","0.49091232","0.48984444","0.48829246","0.48796776","0.4875922","0.48649535","0.48646176","0.48635963","0.48541203","0.48523244","0.48502696","0.48496088","0.48406643","0.48399097","0.48395613","0.4838682","0.48379478","0.48339674","0.4828731","0.48277986","0.48123452","0.48109213","0.480335","0.4798574","0.4795563","0.47937748","0.478979","0.47871247","0.47756946","0.47748452","0.4773466","0.47731283","0.47669122","0.4764467","0.4764071","0.4762774","0.47588864","0.47572532","0.47553825","0.47551683","0.4749441","0.47483194","0.47347736","0.47338828","0.47322264","0.47315612","0.4726866","0.47256452","0.47250763","0.4721439","0.47200787","0.47161666","0.4715844","0.47147956","0.4710743","0.47101262","0.47086066","0.4706868","0.470503"],"string":"[\n \"0.60113615\",\n \"0.5859844\",\n \"0.5772984\",\n \"0.5617712\",\n \"0.5504301\",\n \"0.5316391\",\n \"0.5313953\",\n \"0.5273943\",\n \"0.5268024\",\n \"0.5257252\",\n \"0.52431345\",\n \"0.52355766\",\n \"0.52347904\",\n \"0.52220434\",\n \"0.52174675\",\n \"0.5180655\",\n \"0.5177188\",\n \"0.5174838\",\n \"0.51718193\",\n \"0.5159236\",\n \"0.51124686\",\n \"0.5109292\",\n \"0.510242\",\n \"0.50930285\",\n \"0.5087657\",\n \"0.50649846\",\n \"0.50555915\",\n \"0.50475895\",\n \"0.50474733\",\n \"0.5042096\",\n \"0.50420177\",\n \"0.50235105\",\n \"0.50206584\",\n \"0.5001425\",\n \"0.49987257\",\n \"0.49842116\",\n \"0.49836\",\n \"0.49588332\",\n \"0.49417564\",\n \"0.4941491\",\n \"0.49233416\",\n \"0.49091232\",\n \"0.48984444\",\n \"0.48829246\",\n \"0.48796776\",\n \"0.4875922\",\n \"0.48649535\",\n \"0.48646176\",\n \"0.48635963\",\n \"0.48541203\",\n \"0.48523244\",\n \"0.48502696\",\n \"0.48496088\",\n \"0.48406643\",\n \"0.48399097\",\n \"0.48395613\",\n \"0.4838682\",\n \"0.48379478\",\n \"0.48339674\",\n \"0.4828731\",\n \"0.48277986\",\n \"0.48123452\",\n \"0.48109213\",\n \"0.480335\",\n \"0.4798574\",\n \"0.4795563\",\n \"0.47937748\",\n \"0.478979\",\n \"0.47871247\",\n \"0.47756946\",\n \"0.47748452\",\n \"0.4773466\",\n \"0.47731283\",\n \"0.47669122\",\n \"0.4764467\",\n \"0.4764071\",\n \"0.4762774\",\n \"0.47588864\",\n \"0.47572532\",\n \"0.47553825\",\n \"0.47551683\",\n \"0.4749441\",\n \"0.47483194\",\n \"0.47347736\",\n \"0.47338828\",\n \"0.47322264\",\n \"0.47315612\",\n \"0.4726866\",\n \"0.47256452\",\n \"0.47250763\",\n \"0.4721439\",\n \"0.47200787\",\n \"0.47161666\",\n \"0.4715844\",\n \"0.47147956\",\n \"0.4710743\",\n \"0.47101262\",\n \"0.47086066\",\n \"0.4706868\",\n \"0.470503\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.71977544"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94760,"cells":{"query":{"kind":"string","value":"Read arguments passed in via subprocess and run the parallel Route. This script is intended to be called via subprocess via the solve_large_route_pair_analysis.py module, which does essential preprocessing and validation. Users should not call this script directly from the command line. We must launch this script via subprocess in order to support parallel processing from an ArcGIS Pro script tool, which cannot do parallel processing directly."},"document":{"kind":"string","value":"def launch_parallel_rt_pairs():\r\n # Create the parser\r\n parser = argparse.ArgumentParser(description=globals().get(\"__doc__\", \"\"), fromfile_prefix_chars='@')\r\n\r\n # Define Arguments supported by the command line utility\r\n\r\n # --pair-type parameter\r\n help_string = \"The type of origin-destination pair assignment to use. Either one_to_one or many_to_many.\"\r\n parser.add_argument(\"-pt\", \"--pair-type\", action=\"store\", dest=\"pair_type_str\", help=help_string, required=True)\r\n\r\n # --origins parameter\r\n help_string = \"The full catalog path to the feature class containing the origins.\"\r\n parser.add_argument(\"-o\", \"--origins\", action=\"store\", dest=\"origins\", help=help_string, required=True)\r\n\r\n # --origins-id-field parameter\r\n help_string = \"The name of the unique ID field in origins.\"\r\n parser.add_argument(\r\n \"-oif\", \"--origins-id-field\", action=\"store\", dest=\"origin_id_field\", help=help_string, required=True)\r\n\r\n # --destinations parameter\r\n help_string = \"The full catalog path to the feature class containing the destinations.\"\r\n parser.add_argument(\"-d\", \"--destinations\", action=\"store\", dest=\"destinations\", help=help_string, required=True)\r\n\r\n # --destinations-id-field parameter\r\n help_string = \"The name of the unique ID field in destinations.\"\r\n parser.add_argument(\r\n \"-dif\", \"--destinations-id-field\", action=\"store\", dest=\"dest_id_field\", help=help_string, required=True)\r\n\r\n # --network-data-source parameter\r\n help_string = \"The full catalog path to the network dataset or a portal url that will be used for the analysis.\"\r\n parser.add_argument(\r\n \"-n\", \"--network-data-source\", action=\"store\", dest=\"network_data_source\", help=help_string, required=True)\r\n\r\n # --travel-mode parameter\r\n help_string = (\r\n \"The name or JSON string representation of the travel mode from the network data source that will be used for \"\r\n \"the analysis.\"\r\n )\r\n parser.add_argument(\"-tm\", \"--travel-mode\", action=\"store\", dest=\"travel_mode\", help=help_string, required=True)\r\n\r\n # --time-units parameter\r\n help_string = \"String name of the time units for the analysis. These units will be used in the output.\"\r\n parser.add_argument(\"-tu\", \"--time-units\", action=\"store\", dest=\"time_units\", help=help_string, required=True)\r\n\r\n # --distance-units parameter\r\n help_string = \"String name of the distance units for the analysis. These units will be used in the output.\"\r\n parser.add_argument(\r\n \"-du\", \"--distance-units\", action=\"store\", dest=\"distance_units\", help=help_string, required=True)\r\n\r\n # --max-routes parameter\r\n help_string = \"Maximum number of routes that can be in one chunk for parallel processing of Route solves.\"\r\n parser.add_argument(\r\n \"-mr\", \"--max-routes\", action=\"store\", dest=\"max_routes\", type=int, help=help_string, required=True)\r\n\r\n # --max-processes parameter\r\n help_string = \"Maximum number parallel processes to use for the Route solves.\"\r\n parser.add_argument(\r\n \"-mp\", \"--max-processes\", action=\"store\", dest=\"max_processes\", type=int, help=help_string, required=True)\r\n\r\n # --reverse-direction parameter\r\n help_string = \"Whether to reverse the direction of travel (destination to origin).\"\r\n parser.add_argument(\r\n \"-rd\", \"--reverse-direction\", action=\"store\", type=lambda x: bool(strtobool(x)),\r\n dest=\"reverse_direction\", help=help_string, required=True)\r\n\r\n # --out-routes parameter\r\n help_string = \"The full catalog path to the output routes feature class.\"\r\n parser.add_argument(\"-r\", \"--out-routes\", action=\"store\", dest=\"out_routes\", help=help_string, required=True)\r\n\r\n # --scratch-folder parameter\r\n help_string = \"The full catalog path to the scratch folder where intermediate outputs will be stored.\"\r\n parser.add_argument(\r\n \"-sf\", \"--scratch-folder\", action=\"store\", dest=\"scratch_folder\", help=help_string, required=True)\r\n\r\n # --assigned-dest-field parameter\r\n help_string = (\"The name of the field in origins indicating the assigned destination. \"\r\n \"Required for one_to_one pair-type\")\r\n parser.add_argument(\r\n \"-adf\", \"--assigned-dest-field\", action=\"store\", dest=\"assigned_dest_field\", help=help_string, required=False)\r\n\r\n # --od-pair-table parameter\r\n help_string = \"CSV file holding preassigned OD pairs. Required for many_to_many pair-type.\"\r\n parser.add_argument(\r\n \"-odp\", \"--od-pair-table\", action=\"store\", dest=\"od_pair_table\", help=help_string, required=False)\r\n\r\n # --time-of-day parameter\r\n help_string = (f\"The time of day for the analysis. Must be in {helpers.DATETIME_FORMAT} format. Set to None for \"\r\n \"time neutral.\")\r\n parser.add_argument(\"-tod\", \"--time-of-day\", action=\"store\", dest=\"time_of_day\", help=help_string, required=False)\r\n\r\n # --barriers parameter\r\n help_string = \"A list of catalog paths to the feature classes containing barriers to use in the Route.\"\r\n parser.add_argument(\r\n \"-b\", \"--barriers\", action=\"store\", dest=\"barriers\", help=help_string, nargs='*', required=False)\r\n\r\n try:\r\n # Get arguments as dictionary.\r\n args = vars(parser.parse_args())\r\n\r\n # Initialize a parallel Route calculator class\r\n rt_calculator = ParallelRoutePairCalculator(**args)\r\n # Solve the Route in parallel chunks\r\n start_time = time.time()\r\n rt_calculator.solve_route_in_parallel()\r\n LOGGER.info(f\"Parallel Route calculation completed in {round((time.time() - start_time) / 60, 2)} minutes\")\r\n\r\n except Exception: # pylint: disable=broad-except\r\n LOGGER.error(\"Error in parallelization subprocess.\")\r\n errs = traceback.format_exc().splitlines()\r\n for err in errs:\r\n LOGGER.error(err)\r\n raise"},"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 solve_route_in_parallel(self):\r\n # Validate Route settings. Essentially, create a dummy Route class instance and set up the\r\n # solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes\r\n # that are guaranteed to all fail.\r\n self._validate_route_settings()\r\n\r\n # Check if the input origins and destinations have any fields we should use in the route analysis\r\n self._populate_input_data_transfer_fields()\r\n\r\n # Compute Route in parallel\r\n LOGGER.info(f\"Beginning parallelized Route solves ({self.total_jobs} chunks)\")\r\n completed_jobs = 0 # Track the number of jobs completed so far to use in logging\r\n # Use the concurrent.futures ProcessPoolExecutor to spin up parallel processes that solve the routes\r\n with futures.ProcessPoolExecutor(max_workers=self.max_processes) as executor:\r\n # Each parallel process calls the solve_route() function with the rt_inputs dictionary for the\r\n # given origin ranges and their assigned destinations.\r\n jobs = {executor.submit(solve_route, self.rt_inputs, range): range for range in self.chunks}\r\n # As each job is completed, add some logging information and store the results to post-process later\r\n for future in futures.as_completed(jobs):\r\n try:\r\n # The Route job returns a results dictionary. Retrieve it.\r\n result = future.result()\r\n except Exception: # pylint: disable=broad-except\r\n # If we couldn't retrieve the result, some terrible error happened and the job errored.\r\n # Note: This does not mean solve failed. It means some unexpected error was thrown. The most likely\r\n # causes are:\r\n # a) If you're calling a service, the service was temporarily down.\r\n # b) You had a temporary file read/write or resource issue on your machine.\r\n # c) If you're actively updating the code, you introduced an error.\r\n # To make the tool more robust against temporary glitches, retry submitting the job up to the number\r\n # of times designated in helpers.MAX_RETRIES. If the job is still erroring after that many retries,\r\n # fail the entire tool run.\r\n errs = traceback.format_exc().splitlines()\r\n failed_range = jobs[future]\r\n LOGGER.debug((\r\n f\"Failed to get results for Route chunk {failed_range} from the parallel process. Will retry \"\r\n f\"up to {helpers.MAX_RETRIES} times. Errors: {errs}\"\r\n ))\r\n job_failed = True\r\n num_retries = 0\r\n while job_failed and num_retries < helpers.MAX_RETRIES:\r\n num_retries += 1\r\n try:\r\n future = executor.submit(solve_route, self.rt_inputs, failed_range)\r\n result = future.result()\r\n job_failed = False\r\n LOGGER.debug(f\"Route chunk {failed_range} succeeded after {num_retries} retries.\")\r\n except Exception: # pylint: disable=broad-except\r\n # Update exception info to the latest error\r\n errs = traceback.format_exc().splitlines()\r\n if job_failed:\r\n # The job errored and did not succeed after retries. Fail the tool run because something\r\n # terrible is happening.\r\n LOGGER.debug(f\"Route chunk {failed_range} continued to error after {num_retries} retries.\")\r\n LOGGER.error(\"Failed to get Route result from parallel processing.\")\r\n errs = traceback.format_exc().splitlines()\r\n for err in errs:\r\n LOGGER.error(err)\r\n raise\r\n\r\n # If we got this far, the job completed successfully and we retrieved results.\r\n completed_jobs += 1\r\n LOGGER.info(\r\n f\"Finished Route calculation {completed_jobs} of {self.total_jobs}.\")\r\n\r\n # Parse the results dictionary and store components for post-processing.\r\n if result[\"solveSucceeded\"]:\r\n self.route_fcs.append(result[\"outputRoutes\"])\r\n else:\r\n # Typically, a solve fails because no destinations were found for any of the origins in the chunk,\r\n # and this is a perfectly legitimate failure. It is not an error. However, they may be other, less\r\n # likely, reasons for solve failure. Write solve messages to the main GP message thread in debug\r\n # mode only in case the user is having problems. The user can also check the individual OD log\r\n # files.\r\n LOGGER.debug(f\"Solve failed for job id {result['jobId']}.\")\r\n LOGGER.debug(result[\"solveMessages\"])\r\n\r\n # Post-process outputs\r\n if self.route_fcs:\r\n LOGGER.info(\"Post-processing Route results...\")\r\n self.route_fcs = sorted(self.route_fcs)\r\n self._post_process_route_fcs()\r\n else:\r\n LOGGER.warning(\"All Route solves failed, so no output was produced.\")\r\n\r\n # Clean up\r\n # Delete the job folders if the job succeeded\r\n if DELETE_INTERMEDIATE_OUTPUTS:\r\n LOGGER.info(\"Deleting intermediate outputs...\")\r\n try:\r\n shutil.rmtree(self.scratch_folder, ignore_errors=True)\r\n except Exception: # pylint: disable=broad-except\r\n # If deletion doesn't work, just throw a warning and move on. This does not need to kill the tool.\r\n LOGGER.warning(f\"Unable to delete intermediate Route output folder {self.scratch_folder}.\")\r\n\r\n LOGGER.info(\"Finished calculating Routes.\")","def main() -> None:\n args = _get_arguments()\n\n file_level_logging = logging.DEBUG if args.log_to_file else None\n setup_logger(logging.INFO, file_level_logging)\n\n if not os.path.exists(args.smiles):\n mol = Molecule(smiles=args.smiles)\n if mol.rd_mol is None:\n logger().error(\n f\"The --smiles argument ({args.smiles})\"\n \" does not point to an existing file or is a valid RDKit SMILES.\"\n \" Cannot start retrosynthesis planning.\"\n )\n return\n\n if args.nproc:\n _multiprocess_smiles(args)\n return\n\n multi_smiles = os.path.exists(args.smiles)\n\n finder = AiZynthFinder(configfile=args.config)\n _select_stocks(finder, args)\n post_processing = _load_postprocessing_jobs(args.post_processing)\n finder.expansion_policy.select(args.policy or finder.expansion_policy.items[0])\n if args.filter:\n finder.filter_policy.select(args.filter)\n else:\n finder.filter_policy.select_all()\n\n params = [\n args.smiles,\n finder,\n args.output,\n args.cluster,\n args.route_distance_model,\n post_processing,\n args.checkpoint,\n ]\n if multi_smiles:\n _process_multi_smiles(*params)\n else:\n params = params[:-1]\n _process_single_smiles(*params)","def parseCommandLineArguments():\n parser = argparse.ArgumentParser(prog=\"findPhasiRNAs.py\",description=\"findPhasiRNAs can be used to find genomic locations where phasing occurs. \")\n optional_arg = parser.add_argument_group(\"Optional Arguments\")\n required_arg = parser.add_argument_group(\"Required Arguments\")\n genome_mutex = parser.add_mutually_exclusive_group(required = True)\n \n required_arg.add_argument(\"--input_library\",\"-i\",help=\"Specify the name of the file which has the small-RNA reads. This option is mutually exclusive with --consolidated_library\")\n genome_mutex.add_argument(\"--genome\",\"-g\",help=\"Specify the name of the genome fasta file of the organism. Please note that the program will not be able to handle multiple fasta files. \")\n genome_mutex.add_argument(\"--bowtie_index\",\"-bindex\",help=\"Provide the bowtie index. This argument is optional. If no index is provided then the software will generate one.\")\n required_arg.add_argument(\"--output_directory\",\"-out\",help=\"Specify an output directory to which all the generated files will be housed. This includes the log file which can be later checked. Please make sure that there are sufficient permissions to create the output directory. The program will throw an error if creation of the output directory fails. If the directory already exists then its contents will be overwritten without warning. This directory will contain the summary file containing the details of the execution\",required=True)\n optional_arg.add_argument(\"--small_rna_size\",\"-srnasize\",nargs=\"+\",help=\"Specify the size of the small RNA that you wish to analyze. You can enter more than one possible size.\",default=[\"21\"])\n optional_arg.add_argument(\"--number_of_cycles\",\"-numcycles\",nargs=\"+\",help=\"Specify the number of cycles you wish to analyze with. You can enter multiple number of number of cycles. The accepted values are 9, 10, 11, 12 and 13\",default=[\"9\"])\n optional_arg.add_argument(\"--pvalue_cutoff\",\"-p\",help=\"Enter the p-value cut off\",default=0.05)\n optional_arg.add_argument(\"--clean_up\",\"-c\",help=\"Set this to 1 if you wish to clean up all the intermediate files. The program will keep all temporary files by default.\",default=0)\n optional_arg.add_argument(\"--CPU\",\"-n\",help=\"Provide the number of CPUs to be used. Default is 1.\",default=\"1\")\n optional_arg.add_argument(\"--map_limit\",\"-mapl\",help=\"Specify the mapping limit. Only reads which are mapped at most -mapl times will be considered. The default is 1. The maximum number of alignments allowed for a single read is 10. \",default=1)\n optional_arg.add_argument(\"--force\",\"-f\",help=\"Overwrite contents of output directory if it exists.\",default=0)\n \n # Supressed arguments\n parser.add_argument(\"--input_filename\",\"-ifname\",help=argparse.SUPPRESS)\n parser.add_argument(\"--input_path\",\"-ipath\",help=argparse.SUPPRESS)\n parser.add_argument(\"--consolidated_filename\",\"-cfname\",help=argparse.SUPPRESS)\n parser.add_argument(\"--adapter_trimmed_filename\",\"-atfname\",help=argparse.SUPPRESS)\n parser.add_argument(\"--output_directory_per_run\",\"-output_directory_per_run\",help=argparse.SUPPRESS)\n #parser.add_argument(\"--output_directory\",\"-actual_out\",help=argparse.SUPPRESS)\n \n return parser.parse_args()","def main():\n parser = argparse.ArgumentParser(\n description='Runs test for C++ implementation of M*')\n parser.add_argument('test_file', help='File describing test cases')\n parser.add_argument('output_file', help='Name of output file')\n parser.add_argument('num_processors', type=int, action='store',\n help='Number of processes to run on each node. ' +\n 'The local host running the primary server will ' +\n 'run one fewer worker processes')\n parser.add_argument('-i', action='store', type=float, default=1.0,\n help='Set inflation factor for the heuristic, ' +\n 'defaults to 1', metavar='INF', dest='inflation')\n parser.add_argument('-t', action='store', type=int, default=120,\n help='Set time limit for planning. Defaults to 2 ' +\n 'minutes', dest='time_limit')\n parser.add_argument('--hosts', action='store',\n default=('python', 'cobra', 'viper', 'anaconda'),\n help='Hostnames/IPs to use as processing nodes.',\n nargs='*', metavar='HOSTNAME')\n\n args = parser.parse_args()\n\n run_cpp_mstar_trial(args.test_file, args.output_file,\n inflation=args.inflation, time_limit=args.time_limit,\n hosts=args.hosts, num_processors=args.num_processors)","def __init__(self, **kwargs):\r\n self.pair_type = kwargs[\"pair_type\"]\r\n self.origins = kwargs[\"origins\"]\r\n self.origin_id_field = kwargs[\"origin_id_field\"]\r\n self.destinations = kwargs[\"destinations\"]\r\n self.dest_id_field = kwargs[\"dest_id_field\"]\r\n self.network_data_source = kwargs[\"network_data_source\"]\r\n self.travel_mode = kwargs[\"travel_mode\"]\r\n self.time_units = kwargs[\"time_units\"]\r\n self.distance_units = kwargs[\"distance_units\"]\r\n self.time_of_day = kwargs[\"time_of_day\"]\r\n self.reverse_direction = kwargs[\"reverse_direction\"]\r\n self.scratch_folder = kwargs[\"scratch_folder\"]\r\n self.assigned_dest_field = kwargs[\"assigned_dest_field\"]\r\n self.od_pair_table = kwargs[\"od_pair_table\"]\r\n self.origin_transfer_fields = kwargs[\"origin_transfer_fields\"]\r\n self.destination_transfer_fields = kwargs[\"destination_transfer_fields\"]\r\n self.barriers = []\r\n if \"barriers\" in kwargs:\r\n self.barriers = kwargs[\"barriers\"]\r\n\r\n # Create a job ID and a folder for this job\r\n self._create_job_folder()\r\n\r\n # Setup the class logger. Logs for each parallel process are not written to the console but instead to a\r\n # process-specific log file.\r\n self.setup_logger(\"RoutePairs\")\r\n\r\n # Get field objects for the origin and destination ID fields since we need this in multiple places\r\n self.origin_id_field_obj = arcpy.ListFields(self.origins, wild_card=self.origin_id_field)[0]\r\n self.dest_id_field_obj = arcpy.ListFields(self.destinations, wild_card=self.dest_id_field)[0]\r\n\r\n # Set up other instance attributes\r\n self.is_service = helpers.is_nds_service(self.network_data_source)\r\n self.rt_solver = None\r\n self.solve_result = None\r\n self.input_origins_layer = \"InputOrigins\" + self.job_id\r\n self.input_destinations_layer = \"InputDestinations\" + self.job_id\r\n self.input_origins_layer_obj = None\r\n self.input_dests_layer_obj = None\r\n self.origin_unique_id_field_name = \"OriginUniqueID\"\r\n self.dest_unique_id_field_name = \"DestinationUniqueID\"\r\n self.od_pairs = None\r\n\r\n # Create a network dataset layer if needed\r\n if not self.is_service:\r\n self._make_nds_layer()\r\n\r\n # Prepare a dictionary to store info about the analysis results\r\n self.job_result = {\r\n \"jobId\": self.job_id,\r\n \"jobFolder\": self.job_folder,\r\n \"solveSucceeded\": False,\r\n \"solveMessages\": \"\",\r\n \"outputRoutes\": \"\",\r\n \"logFile\": self.log_file\r\n }","def parse_command_line_arguments(command_line_arguments):\n # First determine if a we're loading from a file\n filename = False\n if \"--file\" in command_line_arguments:\n index = command_line_arguments.index(\"--file\")+1\n filename = command_line_arguments[index]\n if output.tracking_suffix in filename:\n # Assumes simulation in progress. So, if final_sweep ==\n # current_sweep, the simulation will load and then\n # immediately end.\n return get_progress_file_info(filename)\n if not (output.output_suffix in filename):\n raise ValueError(\"Can only load from *.boundaryprg2p1 or \"\n +\"*.boundary2p1 files!\")\n # If filename is of type *.boundary2p1, we assume its okay and\n # load from it. None of the other command line arguments\n # change.\n\n if \"--select\" in command_line_arguments:\n index = command_line_arguments.index(\"--select\")+1\n if command_line_arguments[index] == \"std\":\n algorithm = monte_carlo.select_for_curvature\n elif command_line_arguments[index] == \"area\":\n algorithm = monte_carlo.select_for_area\n else:\n algorithm = default_algorithm\n else:\n algorithm = default_algorithm \n\n if \"--target-area\" in command_line_arguments:\n index = command_line_arguments.index(\"--target-area\")+1\n target_area = int(eval(command_line_arguments[index]))\n else:\n target_area = int(eval(command_line_arguments[0]))\n\n if \"--target-std\" in command_line_arguments:\n index = command_line_arguments.index(\"--target-std\")+1\n target_std = float(eval(command_line_arguments[index]))\n else:\n target_std = default_target_std\n\n if \"--area-damping\" in command_line_arguments:\n index = command_line_arguments.index(\"--area-damping\")+1\n area_damping_strength = float(eval(command_line_arguments[index]))\n else:\n area_damping_strength = default_area_damping\n if not 0 <= area_damping_strength <= 1:\n raise ValueError(\"Damping must be between 0 and 1.\")\n\n if \"--std-damping\" in command_line_arguments:\n index = command_line_arguments.index(\"--std-damping\")+1\n std_damping_strength = float(eval(command_line_arguments[index]))\n else:\n std_damping_strength = default_std_damping\n if not 0 <= area_damping_strength <= 1:\n raise ValueError(\"Damping must be between 0 and 1.\")\n\n if \"--initial\" in command_line_arguments:\n index = command_line_arguments.index(\"--initial\")+1\n initial_sweep = int(eval(command_line_arguments[index]))\n else:\n initial_sweep = default_initial_sweep\n\n if \"--final\" in command_line_arguments:\n index = command_line_arguments.index(\"--final\")+1\n final_sweep = int(eval(command_line_arguments[index]))\n else:\n final_sweep = default_final_sweep\n\n if \"--save\" in command_line_arguments:\n index = command_line_arguments.index(\"--save\")+1\n save_every_n_sweeps = int(eval(command_line_arguments[index]))\n else:\n save_every_n_sweeps = default_save_every_n_sweeps\n if save_every_n_sweeps < 1:\n raise ValueError(\"You must save at least every 1 sweeps!\")\n\n if \"--v5\" in command_line_arguments:\n index = command_line_arguments.index(\"--v5\")+1\n v5damping = int(eval(command_line_arguments[index]))\n else:\n v5damping = target_area/10\n\n if \"--v6\" in command_line_arguments:\n index = command_line_arguments.index(\"--v6\")+1\n v6damping = int(eval(command_line_arguments[index]))\n else:\n v6damping = target_area/10\n \n if \"--many\" in command_line_arguments:\n if \"--one\" in command_line_arguments or \"--exact\" in command_line_arguments:\n raise ValueError(\"Contradictory input!\")\n if \"--micro\" in command_line_arguments:\n gather_data_function = output.save_many_microscopically_optimal\n else:\n gather_data_function = output.gather_data_to_n_files\n elif \"--one\" in command_line_arguments:\n if \"--many\" in command_line_arguments or \"--exact\" in command_line_arguments:\n raise ValueError(\"Condtradictory input!\")\n if \"--micro\" in command_line_arguments:\n gather_data_function = output.stop_at_microscopically_optimal\n else:\n gather_data_function = output.gather_data_to_1_file\n elif \"--exact\" in command_line_arguments:\n if \"--many\" in command_line_arguments or \"--one\" in command_line_arguments:\n raise ValueError(\"Contradictory input!\")\n gather_data_function = output.generate_n_exact_spheres\n index = command_line_arguments.index(\"--exact\")+1\n # In this case, v5damping is fitness_damping, as defined\n # in generate_n_exact_spheres\n v5damping = int(eval(command_line_arguments[index]))\n else:\n if \"--micro\" in command_line_arguments:\n gather_data_function = output.stop_at_microscopically_optimal\n else:\n gather_data_function = output.gather_data_to_1_file\n\n # return a class with all the info we need\n params = parameters(filename, target_area, area_damping_strength,\n target_std, std_damping_strength,\n initial_sweep, final_sweep,\n save_every_n_sweeps,\n v5damping, v6damping,\n algorithm,\n gather_data_function)\n return params","def solve_route(inputs, chunk):\r\n rt = Route(**inputs)\r\n if inputs[\"pair_type\"] is helpers.PreassignedODPairType.one_to_one:\r\n rt.logger.info(f\"Processing origins OID {chunk[0]} to {chunk[1]} as job id {rt.job_id}\")\r\n elif inputs[\"pair_type\"] is helpers.PreassignedODPairType.many_to_many:\r\n rt.logger.info(f\"Processing chunk {chunk[0]} as job id {rt.job_id}\")\r\n rt.solve(chunk)\r\n rt.teardown_logger()\r\n return rt.job_result","def main():\n # Instantiate the data problem.\n data = create_data_model()\n\n # NEW SPOT TO MAKE distance_matrix\n distance_matrix = compute_euclidean_distance_matrix(destinations_1)\n manager = pywrapcp.RoutingIndexManager(\n len(destinations_1), data['num_vehicles'], data['depot'])\n\n# # Create the routing index manager.\n# manager = pywrapcp.RoutingIndexManager(\n# len(data['locations']), data['num_vehicles'], data['depot'])\n\n # Create Routing Model.\n routing = pywrapcp.RoutingModel(manager)","def run_parallel(pid, call_method_id, run_id='gwas', kinship_method='ibd'):\n job_id = '%s_%s_%d_%d' % (run_id, kinship_method, call_method_id, pid)\n file_prefix = env.env['results_dir'] + job_id\n\n #Cluster specific parameters \n shstr = '#!/bin/bash\\n'\n shstr += '#$ -S /bin/bash\\n'\n shstr += '#$ -N %s\\n' % job_id\n #shstr += '#$ -o %s_job_$JOB_ID.out\\n' % file_prefix\n #shstr += '#$ -e %s_job_$JOB_ID.err\\n' % file_prefix\n shstr += '#$ -o %s_job.out\\n' % file_prefix\n shstr += '#$ -e %s_job.err\\n' % file_prefix\n shstr += 'source /etc/modules-env.sh\\n'\n shstr += 'module load scipy/GotoBLAS2/0.9.0\\n'\n shstr += 'module load matplotlib/1.0.0\\n'\n shstr += 'module load mysqldb/1.2.3\\n'\n\tshstr += 'module load h5py/2.0.0\\n'\n shstr += 'export GOTO_NUM_THREADS=1\\n'\n\n\n shstr += \"python %sfullseq_gwas_project.py %s %s %d %d\" % \\\n (env.env['script_dir'], run_id, kinship_method, call_method_id, pid)\n\n #shstr += \"> \" + file_prefix + \"_job.out) >& \" + file_prefix + \"_job.err\\n\"\n print '\\n', shstr, '\\n'\n script_file_name = run_id + \".sh\"\n f = open(script_file_name, 'w')\n f.write(shstr)\n f.close()\n\n #Execute qsub script\n os.system(\"qsub \" + script_file_name)","def main():\n (\n calibration_file,\n drs4_ped_file,\n time_calibration_file,\n systematic_correction_file,\n drive_log_file,\n run_summary_file,\n pedestal_ids_file,\n run_number,\n ) = data_sequence_cli_parsing()\n\n if options.verbose:\n log.setLevel(logging.DEBUG)\n else:\n log.setLevel(logging.INFO)\n\n # Run the routine piping all the analysis steps\n rc = data_sequence(\n calibration_file,\n drs4_ped_file,\n time_calibration_file,\n systematic_correction_file,\n drive_log_file,\n run_summary_file,\n pedestal_ids_file,\n run_number,\n )\n sys.exit(rc)","def _do_run(self, path, args):\n try:\n self.router.route(path, args)\n except TypeError, e:\n # To catch the follow errors\n # TypeError: xxxx got an unexpected keyword argument 'k'\n # TypeError: 'print_my_good() takes at least 1 argument (0 given)'\n print \"run job %s with arg < %s > error:\" % (path, \", \".join(args))\n print \"%s\" % e","def main():\n\t\n\tparser = argparse.ArgumentParser(description=\"This invokes a java program to place and/or route a design using Vivado tcl.\")\n\tparser.add_argument('input_dcp', nargs=1, help=\"Input design checkpoint (.dcp) file.\")\n\tparser.add_argument('output_dcp', nargs=1, help=\"Output dcp file.\")\n\tparser.add_argument('-p', '--place', dest='place', action='store_true', help=\"Place design.\")\n\tparser.add_argument('-r', '--route', dest='route', action='store_true', help=\"Route design.\")\n\tparser.add_argument('-b', '--both', dest='place_and_route', action='store_true', help=\"Place and route design. This option supercedes -p or -r.\")\n\tparser.add_argument('-q', '--quiet', dest='quiet', action='store_true', help=\"Suppress messages.\")\n\tparser.add_argument('-f', '--force', dest='force', action='store_true', help=\"Overwrite file at destination if it exists.\")\n\targs = parser.parse_args()\n\t\n\t\n\tif args.place or args.place_and_route:\n\t\tplace_flag = \"-p true\"\n\telse:\n\t\tplace_flag = \"-p false\"\n\t\t\n\tif args.route or args.place_and_route:\n\t\troute_flag = \"-r true\"\n\telse:\n\t\troute_flag = \"-r false\"\n\t\n\tif args.force:\n\t\tforce_flag = \"-f true\"\n\telse:\n\t\tforce_flag = \"-f false\"\n\tif args.quiet:\n\t\tquiet_flag = \"-q true\"\n\telse:\n\t\tquiet_flag = \"-q false\"\n\t\n\t\n\tplace_and_route_dir = \"~/Documents/2019_summer/AddILA/\"\n\tclass_path = \".:/nfs/ug/thesis/thesis0/pc2019/Software/RapidWright/RapidWright\"\n\t\n\tcd_cmd = \"cd {}\".format(place_and_route_dir)\n\tjava_compile_cmd = \"javac PlaceAndRoute.java\".format()\n\n\ttry:\n\t\tif not args.quiet:\n\t\t\tprint(\"pwd\")\n\t\tpwd = subprocess.check_output(\"pwd\").decode(sys.stdout.encoding).strip()\n\t\tif not args.quiet:\n\t\t\tprint(cd_cmd)\n\t\tos.system(cd_cmd)\n\texcept:\n\t\tprint(\"\\nERROR: Failed to execute '{}'.\".format(cd_cmd))\n\t\treturn 1\n\n\tif args.input_dcp[0][0] in {'~', '/'}:\n\t\tinput_dcp = args.input_dcp[0]\n\telse:\n\t\tinput_dcp = pwd + \"/\" + args.input_dcp[0]\n\tif args.output_dcp[0][0] in {'~', '/'}:\n\t\toutput_dcp = args.output_dcp[0]\n\telse:\n\t\toutput_dcp = pwd + \"/\" + args.output_dcp[0]\n\t\n\tjava_execute_cmd = \"java -cp {0} PlaceAndRoute {1} {2} {3} {4} {5} {6}\".format(class_path, input_dcp, output_dcp, place_flag, route_flag, force_flag, quiet_flag)\n\t\n\ttry:\n\t\tif not args.quiet:\n\t\t\tprint(java_compile_cmd)\n\t\tos.system(java_compile_cmd)\n\texcept:\n\t\tprint(\"\\nERROR: Failed to execute '{}'.\".format(java_compile_cmd))\n\t\treturn 1\n\n\ttry:\n\t\tif not args.quiet:\n\t\t\tprint(java_execute_cmd)\n\t\tos.system(java_execute_cmd)\n\texcept:\n\t\tprint(\"\\nERROR: Failed to execute '{}'.\".format(java_execute_cmd))\n\t\treturn 1","def main ():\n\n print(\"MapReduce Map Worker program\")\n\n # first parse the command line arguments\n parsed_args = parseCmdLineArgs ()\n \n # instantiate a map object with the parsed args\n mapobj = MR_Map (parsed_args)\n\n # initialize the map worker network connections\n mapobj.init_worker ()\n \n # invoke the map process. We run this map process forever\n while True:\n mapobj.do_work ()\n print(\"MapReduce Map Worker done for this iteration\")\n time.sleep (5)","def main(*args):\n \n # Read input file in as dictionary\n with open(args[0]) as f:\n input_dict = iprPy.input.parse(f, allsingular=True)\n \n # Interpret and process input parameters\n process_input(input_dict, *args[1:])\n \n # Call calculation's function(s)\n results_dict = bondscan(input_dict['lammps_command'],\n input_dict['potential'],\n input_dict['symbols'],\n mpi_command = input_dict['mpi_command'],\n rmin = input_dict['minimum_r'],\n rmax = input_dict['maximum_r'],\n rnum = input_dict['number_of_steps_r'],\n thetamin = input_dict['minimum_theta'],\n thetamax = input_dict['maximum_theta'],\n thetanum = input_dict['number_of_steps_theta'])\n \n # Build and save data model of results\n record = iprPy.load_record(record_style)\n record.buildcontent(input_dict, results_dict)\n with open('results.json', 'w') as f:\n record.content.json(fp=f, indent=4)","def main():\n\n parser = argparse.ArgumentParser(\n formatter_class=argparse.ArgumentDefaultsHelpFormatter,\n )\n\n parser.add_argument('-V', '--version', action='version', version=VERSION)\n\n\n file_group = parser.add_argument_group('Input Files')\n file_group.add_argument('-f', dest='traj', required=True, type=str,\n help='trajectory file (XTC/TRR/GRO/PDB ...)')\n file_group.add_argument('-s', dest='tpr', required=True, type=str,\n help='tpr file (TPR)')\n file_group.add_argument('-o', dest='outpath', type=str,\n help='name of the mapped trajectory (XTC/GRO)')\n file_group.add_argument('-m', dest='map_file', type=str,\n help='.mapping file or path to directory of .map files')\n\n mapping_group = parser.add_argument_group('Mapping Options')\n mapping_group.add_argument('-mode', dest='mode', required=False, type=str,\n help='COG or COM mapping', default='COG')\n mapping_group.add_argument('-pbc', action='store_true', required=False, dest='pbc_complete',\n help='complete pbc with MDAnalysis; this is slow!')\n mapping_group.add_argument('-mols', dest='mol_names', required=True, type=str, nargs='+',\n help='names of molecules to consider when mapping as in the [moleculetypes] directive')\n mapping_group.add_argument('-add_H', dest='h_association', nargs='+', type=lambda s: s.split(':'),\n default=[],\n help='atom-types corresponding to CH3, CH2, CH1 for aliphatic groups and CH2d for double bonds.')\n args = parser.parse_args()\n\n print(\"INFO - Loading universe\")\n # load trajectory\n init_universe = UniverseHandler(args.mol_names,\n args.tpr,\n args.traj,\n in_memory=True)\n if args.pbc_complete:\n print(\"INFO - PBC completing trajectory\")\n init_universe.pbc_complete()\n\n if args.h_association:\n print(\"INFO - Adding Hydrogen to united-atoms\")\n treated_atoms = init_universe.shift_united_atom_carbons(dict(args.h_association))\n else:\n treated_atoms = np.array([])\n\n print(\"INFO - Loading mapping files\")\n #determine if we have a single .mapping file or a directory of .map files\n map_path = pathlib.Path(args.map_file)\n if map_path.is_file() == True:\n with open(args.map_file, \"r\") as _file:\n lines = _file.readlines()\n elif map_path.is_dir() == True:\n l = []\n for i in map_path.glob('*.map'):\n with open(i, \"r\") as _file:\n l.append(_file.readlines())\n if len(l) > 0:\n lines = [item for sublist in l for item in sublist]\n else:\n msg = (\"Couldn't find any .map files in the directory given.\"\n \"Please check the -m argument!\")\n raise IOError(msg)\n else:\n msg = (\"\\nCannot determine if you have given me a single .mapping file\\n\"\n \"or a directory of .map files. Please check!\\n\")\n raise IOError(msg)\n\n mappings = read_mapping(lines)[0]\n\n print(\"INFO - Mapping universe - indices\")\n # first mapp the atom indices\n mapped_atoms, bead_idxs = forward_map_indices(init_universe,\n mappings)\n n_frames = len(init_universe.trajectory)\n\n print(\"INFO - Mapping universe - positions\")\n mapped_atoms = numba.typed.List(mapped_atoms)\n bead_idxs = numba.typed.List(bead_idxs)\n # extract the position array from universe\n # if it's not a trajectory we have to emulate\n # a single frame\n path = pathlib.Path(args.traj)\n file_extension = path.suffix.casefold()[1:]\n if file_extension in [\"xtc\", \"trr\"]:\n positions = init_universe.trajectory.coordinate_array\n else:\n positions = init_universe.atoms.positions\n positions = positions.reshape(1, -1, 3)\n\n mapped_trajectory = forward_map_positions(mapped_atoms,\n bead_idxs,\n positions,\n n_frames,\n args.mode,\n treated_atoms)\n\n print(\"INFO - Mapping universe - building pos-array\")\n cg_universe = create_new_universe(init_universe, mapped_trajectory, mappings)\n\n # write coordinate\n print(\"INFO - Writing CG trajectory\")\n if args.traj:\n path = pathlib.Path(args.traj)\n file_extension = path.suffix.casefold()[1:]\n else:\n file_extension = \"xtc\"\n\n if file_extension in [\"xtc\", \"trr\"]:\n cg_beads = cg_universe.atoms\n with mda.Writer(args.outpath,\n multiframe=True,\n n_atoms=len(cg_universe.atoms)) as mapped:\n for time_step in cg_universe.trajectory:\n mapped.write(cg_beads)\n else:\n cg_universe.atoms.positions = cg_universe.trajectory.coordinate_array[0]\n cg_beads = cg_universe.atoms\n cg_universe.atoms.dimensions = init_universe.atoms.dimensions\n with mda.Writer(args.outpath, n_atoms=len(cg_universe.atoms)) as mapped:\n mapped.write(cg_beads)","def main():\n args = parse_args()\n process_args(args)","def main() -> None:\n\n data = Ground(sys.argv[1])\n DeliveryMan.show_route(data.coordinates)","def parse_command_line(args):\r\n\r\n\r\n # Initial validity check of input command: each argument may be\r\n # defined only once\r\n for a in args:\r\n if a.startswith('--'):\r\n if args.count(a) > 1:\r\n raise STAPLERerror.STAPLERerror('Each command line parameter can be '\r\n 'defined only once! The following '\r\n 'parameter was defined multiple times:\\n '\r\n '{0}'.format(a))\r\n\r\n # Initialize a named tuple to store all available command line arguments\r\n Command_line_parameters = namedtuple('Input_file_parameters',\r\n ['all_parameters',\r\n 'staplerfile_path',\r\n 'resource_manager',\r\n 'max_job_count',\r\n 'auto_split_workflows',\r\n 'compress_run',\r\n 'validate_run',\r\n 'fix_run',\r\n 'rm_workflow'])\r\n\r\n # Parse user command line and check sanity of values\r\n\r\n # Parse the resource manager to use\r\n all_parameters = ' '.join(args)\r\n resource_manager = None\r\n if '--lsf' in args:\r\n resource_manager = 'lsf'\r\n args.remove('--lsf')\r\n if '--sge' in args:\r\n if resource_manager is not None:\r\n raise STAPLERerror.STAPLERerror('Multiple resource managers are listed in the '\r\n 'command line. Please, choose only one.')\r\n resource_manager = 'sge'\r\n args.remove('--sge')\r\n if '--slurm' in args:\r\n if resource_manager is not None:\r\n raise STAPLERerror.STAPLERerror('Multiple resource managers are listed in the '\r\n 'command line. Please, choose only one.')\r\n resource_manager = 'slurm'\r\n args.remove('--slurm')\r\n if '--torque' in args:\r\n if resource_manager is not None:\r\n raise STAPLERerror.STAPLERerror('Multiple resource managers are listed in the '\r\n 'command line. Please, choose only one.')\r\n resource_manager = 'torque'\r\n args.remove('--torque')\r\n if '--UNIX' in args or resource_manager is None:\r\n if resource_manager is not None:\r\n raise STAPLERerror.STAPLERerror('Multiple resource managers are listed in the '\r\n 'command line. Please, choose only one.')\r\n resource_manager = 'unix'\r\n if '--UNIX' in args: args.remove('--UNIX')\r\n\r\n # Parse the limit for maximum number of jobs to spawn\r\n if '--max_job_count' in args:\r\n if resource_manager is None:\r\n raise STAPLERerror.STAPLERerror('--max_job_count parameter can only be defined '\r\n 'if a resource manager is also defined '\r\n '(e.g. --slurm)!')\r\n try:\r\n max_job_count = int(args[args.index('--max_job_count')+1])\r\n except (TypeError, IndexError):\r\n raise STAPLERerror.STAPLERerror('--max_job_count requires a positive integer '\r\n 'value, e.g. --max_job_count 16')\r\n if max_job_count < 1:\r\n raise STAPLERerror.STAPLERerror('--max_job_count requires a positive integer '\r\n 'value, e.g. --max_job_count 16')\r\n args.pop(args.index('--max_job_count')+1)\r\n args.remove('--max_job_count')\r\n else:\r\n if resource_manager == 'unix':\r\n max_job_count = multiprocessing.cpu_count()\r\n else:\r\n max_job_count = None\r\n\r\n # Parse workflow control parameters\r\n if '--priority' in args:\r\n if resource_manager is None:\r\n raise STAPLERerror.STAPLERerror('--priority parameter can be used only if a '\r\n 'resource manager (e.g. SLURM) is specified!')\r\n if resource_manager == 'unix':\r\n raise STAPLERerror.STAPLERerror('--priority parameter cannot be '\r\n 'used in combination with --UNIX '\r\n 'parameter!')\r\n try:\r\n if (args[args.index('--priority')+1]).lower() in ('continuous', 'c'):\r\n auto_split_workflows = False\r\n elif (args[args.index('--priority')+1]).lower() in ('split', 's'):\r\n auto_split_workflows = True\r\n else:\r\n raise STAPLERerror.STAPLERerror('Allowed values for --priority parameter are '\r\n '\"continuous\", \"c\", \"split\" and \"s\"!')\r\n except (TypeError, IndexError):\r\n raise STAPLERerror('--priority parameter requires a value! Allowed values are '\r\n '\"continuous\", \"c\", \"split\" and \"s\" ')\r\n args.pop(args.index('--priority')+1)\r\n args.remove('--priority')\r\n else:\r\n if resource_manager == 'unix':\r\n auto_split_workflows = True\r\n else:\r\n auto_split_workflows = False\r\n compress_run = None\r\n\r\n # Parse workflow compression/decompression parameters\r\n if '--compress' in args:\r\n compress_run = 'compress'\r\n args.remove('--compress')\r\n if '--decompress' in args:\r\n if '--compress' in args:\r\n raise STAPLERerror.STAPLERerror('--compress and --decompress parameters can '\r\n 'not be used simultaneously!')\r\n compress_run = 'decompress'\r\n args.remove('--decompress')\r\n\r\n # Parse workflow validation/fixing/removing parameters\r\n if '--validate_run' in args:\r\n validate_run = True\r\n args.remove('--validate_run')\r\n else:\r\n validate_run = False\r\n if '--fix_run' in args:\r\n fix_run = True\r\n args.remove('--fix_run')\r\n else:\r\n fix_run = False\r\n if '--remove' in args:\r\n rm_workflow = True\r\n args.remove('--remove')\r\n else:\r\n rm_workflow = False\r\n\r\n # Parse path to staplefile. All other valid parameters are now read & removed\r\n # from args.\r\n if len(args) == 1:\r\n if os.path.isfile(args[0]):\r\n staplerfile_path = args[0]\r\n else:\r\n raise STAPLERerror.STAPLERerror('Command line contains an odd value:\\n{0}\\n '\r\n 'This is not an existing path to a staplerfile '\r\n 'or any other recognized parameter!'.format(\r\n args[0]))\r\n elif len(args) == 0:\r\n raise STAPLERerror.STAPLERerror('Command line is missing path to staplerfile!')\r\n elif len(args) > 1:\r\n for a in args:\r\n if os.path.isfile(a):\r\n odd_values = args\r\n args.remove(a)\r\n raise STAPLERerror.STAPLERerror('Command line contains some odd '\r\n 'parameters! The string \"{0}\" is '\r\n 'probably the path to stapler file, '\r\n 'but the following parameters are '\r\n 'unknown:\\n{1}\\nFor more info, '\r\n 'type\\npython STAPLER.py -h'.format(a,\r\n '\\n'.join(odd_values)))\r\n raise STAPLERerror.STAPLERerror('Command line is missing path to staplerfile! '\r\n 'Instead, some odd parameters are present:\\n{0}'.format('\\n'.join(args)))\r\n\r\n # Do further validity checks for different parameter combinations\r\n if validate_run and fix_run:\r\n raise STAPLERerror.STAPLERerror('--validate_run and --fix_run cannot be used '\r\n 'in the same command!')\r\n if validate_run and rm_workflow:\r\n raise STAPLERerror.STAPLERerror('--remove_WORKFLOW and --validate_run cannot be '\r\n 'used in the same command!')\r\n if fix_run and rm_workflow:\r\n raise STAPLERerror.STAPLERerror('--fix_run and REMOVE_WORKFLOW cannot be used in '\r\n 'the same command!')\r\n if compress_run is not None:\r\n if validate_run or rm_workflow or fix_run:\r\n raise STAPLERerror.STAPLERerror('--validate_run, --remove_WORKFLOW or --fix_run '\r\n 'parameters cannot be used in the same command '\r\n 'with --COMRESS_RUN!')\r\n if validate_run or rm_workflow:\r\n if resource_manager is not 'unix':\r\n raise STAPLERerror.STAPLERerror('Resource managers cannot be used when '\r\n 'removing workflows!')\r\n\r\n command_line_parameters = Command_line_parameters(\r\n all_parameters=all_parameters,\r\n staplerfile_path=staplerfile_path,\r\n resource_manager=resource_manager,\r\n max_job_count=max_job_count,\r\n auto_split_workflows=auto_split_workflows,\r\n compress_run=compress_run,\r\n validate_run=validate_run,\r\n fix_run=fix_run,\r\n rm_workflow=rm_workflow)\r\n\r\n return command_line_parameters","def run_multimapping(SRA):\n\n if not os.path.exists(\"TMP/ambiguous_reads/\"):\n os.mkdir(\"TMP/ambiguous_reads/\")\n\n cmd_STAR = 'STAR --outSAMtype BAM SortedByCoordinate --runThreadN 8 --winAnchorMultimapNmax 200 --seedSearchStartLmax 15 --genomeDir' + ' ' + STAR_TRANSCRIPTOME_DIR + ' ' + '--readFilesIn' + ' ' + TMP_DIR+SRA+'_rrnaUnmapped.fastq' + ' ' + '--outFileNamePrefix' + ' ' + TMP_DIR+'ambiguous_reads/'+SRA+'_STAR_transcriptome_'\n output = subprocess.run(cmd_STAR, shell=True)\n\n \n # Keep only multi-mapping reads:\n cmd_filter = 'python code/sam_STAR_mapq_filtering.py' + ' ' + TMP_DIR+'ambiguous_reads/'+SRA+'_STAR_transcriptome_Aligned.sortedByCoord.out.bam' + ' ' + TMP_DIR+'ambiguous_reads/'+SRA+'_STAR_transcriptome_multi_mapped_sorted.bam' + ' ' + 'all'\n output = subprocess.run(cmd_filter, shell=True)\n\n cmd_samtools2 = 'samtools index' + ' ' + TMP_DIR+'ambiguous_reads/'+SRA+'_STAR_transcriptome_multi_mapped_sorted.bam'\n output = subprocess.run(cmd_samtools2, shell=True)","def read_arguments():\n\n parser = argparse.ArgumentParser(\n description='Enter arguments to run the pipeline.')\n\n # arguments for external files that might be necessary to run the program\n parser.add_argument(\n '--cost_network', type=str,\n help='file storing the state dictionary of the cost network.'\n )\n\n parser.add_argument(\n '--policy_network', type=str,\n help='File storing the state dictionary of the Policy network.'\n )\n\n parser.add_argument(\n '--state_dictionary', type=str,\n help='Environment on which to run the algo (obstacle/no obstacle)'\n )\n\n parser.add_argument(\n '--expert_trajectory_file', type=str,\n help='Path to file containing the exeprt trajectories.')\n\n # network hyper parameters\n parser.add_argument(\n '--cost_network_input', type=int, default=29,\n help='layer size of cost network. None if you have specified cost \\\n network state dict.')\n\n parser.add_argument(\n '--cost_network_hidden', nargs='+', type=int, default=[256, 256],\n help='Hidden size of cost network.None if you have specified cost \\\n network state dict.')\n\n parser.add_argument(\n '--cost_network_output', type=int, default=1,\n help='Output layer size of cost network.None if you have specified \\\n cost network state dict.')\n\n parser.add_argument(\n '--policy_network_input', type=int, default=29,\n help='Input layer size of policy network.None if you have specified \\\n policy network state dict.')\n\n parser.add_argument(\n '--policy_network_hidden', nargs='+', type=int, default=[256, 256],\n help='Hidden layer size of policy network.None if you have specified \\\n policy network state dict.')\n\n parser.add_argument(\n '--policy_network_output', type=int, default=4,\n help='Output layer size of policy network.None if you have specified \\\n policy network state dict.')\n\n # other run hyper parameters like optimizer and all???\n\n # run hyperparameters\n parser.add_argument('--irl_iterations', type=int,\n help='Number of times to iterate over the IRL part.')\n\n parser.add_argument(\n '--no_of_samples', type=int,\n help='Number of samples to create agent state visitation frequency.')\n\n parser.add_argument(\n '--rl_iterations', type=int,\n help='Number of iterations to be performed in the RL section.')\n\n # arguments for the I/O of the program\n parser.add_argument(\n '--display_board', type=str, default='False',\n help='If True, draw envirnment.')\n\n parser.add_argument(\n '--on_server', type=str, default='True',\n help='False if program is to run on server.')\n\n parser.add_argument('--store_results', type=str, default='True')\n\n parser.add_argument(\n '--plot_interval', type=int, default=10,\n help='Iterations before loss and reward curve plots are stored.')\n\n parser.add_argument(\n '--savedict_policy_interval', type=int, default=100,\n help='Iterations after which the policy network will be stored.')\n\n parser.add_argument(\n '--savedict_cost_interval', type=int, default=1,\n help='Iterations after which the cost network will be stored.')\n\n # arguments for the broader pipeLine\n parser.add_argument(\n '--rl_method', type=str,\n help='Enter the RL method to be used.')\n\n parser.add_argument(\n '--feature_space', type=str,\n help='Type of features to be used to get the state of the agent.')\n\n parser.add_argument('--irl_method', type=str,\n help='Enter the IRL method to be used.')\n\n parser.add_argument(\n '--run_type', type=str, default='train',\n help='Enter if it is a train run or a test run.(train/test).')\n\n parser.add_argument(\n '--verbose', type=str, default='False',\n help='Set verbose to \"True\" to get a myriad of print statements crowd\\\n your terminal. Necessary information should be provided with either\\\n of the modes.')\n\n parser.add_argument(\n '--no_of_testRuns', type=int, default=0,\n help='If --run_type set to test, then this denotes the number of test \\\n runs you want to conduct.')\n\n _args = parser.parse_args()\n\n return _args","def process_argv(argv):\n # Initial preparation\n import __main__\n for (k,v) in global_constants.items():\n exec '%s = %s' % (k,v) in __main__.__dict__\n\n # Allow param.normalize_path.prefix to be overridden in the\n # startup files, but otherwise force it to exist before doing\n # anything else\n param.normalize_path.prefix = default_output_path()\n exec_startup_files()\n set_output_path(param.normalize_path.prefix)\n\n # Tell the user how many cores are in use, if available\n openmp_main=Parameterized(name=\"OpenMP\") # Dummy object just for messages\n try:\n import os,multiprocessing\n total_cores = multiprocessing.cpu_count()\n num_threads = int(os.environ.get('OMP_NUM_THREADS',total_cores))\n openmp_main.verbose(\"Using %d threads on a machine with %d detected CPUs\",num_threads, total_cores)\n except:\n pass\n\n # Repeatedly process options, if any, followed by filenames, if any, until nothing is left\n topo_parser.disable_interspersed_args()\n args=argv\n option=None\n global something_executed\n while True:\n # Process options up until the first filename\n (option,args) = topo_parser.parse_args(args,option)\n\n # Handle filename\n if args:\n filename=args.pop(0)\n #print \"Executing %s\" % (filename)\n filedir = os.path.dirname(os.path.abspath(filename))\n sys.path.insert(0,filedir) # Allow imports relative to this file's path\n sim_name_from_filename(filename) # Default value of topo.sim.name\n\n execfile(filename,__main__.__dict__)\n something_executed=True\n\n if not args:\n break\n\n global_params.check_for_unused_names()\n\n # If no scripts and no commands were given, pretend -i was given.\n if not something_executed: interactive()\n\n if option.gui: topo.guimain.title(topo.sim.name)\n\n ## INTERACTIVE SESSION BEGINS HERE (i.e. can't have anything but\n ## some kind of cleanup code afterwards)\n if os.environ.get('PYTHONINSPECT'):\n print \"Output path: %s\" % param.normalize_path.prefix\n print BANNER\n # CBALERT: should probably allow a way for users to pass\n # things to IPython? Or at least set up some kind of\n # topographica ipython config file. Right now, a topo_parser\n # option has to be added for every ipython option we want to\n # support (e.g. see --pdb)\n\n if ipython_shell_interface == \"IPython.Shell\":\n # IPython 0.10 and earlier\n\n # Stop IPython namespace hack?\n # http://www.nabble.com/__main__-vs-__main__-td14606612.html\n __main__.__name__=\"__mynamespace__\"\n\n ipython_args = ['-noconfirm_exit','-nobanner',\n '-pi1',CommandPrompt.get_format(),\n '-pi2',CommandPrompt2.get_format(),\n '-po',OutputPrompt.get_format()]\n if option.pdb:\n ipython_args.append('-pdb')\n\n ipshell = IPShell(ipython_args,user_ns=__main__.__dict__)\n ipshell.mainloop(sys_exit=1)\n\n elif ipython_shell_interface == \"InteractiveShellEmbed\":\n # IPython 0.11 and later\n\n config = Config()\n\n if ipython_prompt_interface == \"PromptManager\":\n config.PromptManager.in_template = CommandPrompt.get_format()\n config.PromptManager.in2_template = CommandPrompt2.get_format()\n config.PromptManager.out_template = OutputPrompt.get_format()\n else:\n config.InteractiveShell.prompt_in1 = CommandPrompt.get_format()\n config.InteractiveShell.prompt_in2 = CommandPrompt2.get_format()\n config.InteractiveShell.prompt_out = OutputPrompt.get_format()\n config.InteractiveShell.confirm_exit = False\n ipshell = IPShell(config=config,user_ns=__main__.__dict__,\n banner1=\"\",exit_msg=\"\")\n if option.pdb:\n ipshell.call_pdb = True\n\n # Load Topographica IPython extension in embedded shell\n try:\n ipshell.extension_manager.load_extension('topo.misc.ipython')\n except:\n cmdline_main.warning(\n \"Could not load IPython extension 'topo.misc.ipython'; ignored error was:\\n%s\"%traceback.format_exc())\n\n ipshell()\n\n global return_code\n if return_code != 0:\n cmdline_main.warning(\"Errors encountered; exiting with return code %d\" % return_code)\n\n sys.exit(return_code)","def main():\n arguments = docopt(__doc__, version='cluster_parameter_extractor 1.0 BETA')\n\n input_file = arguments['--input']\n output_file = arguments[\"--output\"]\n process_synthetic = arguments[\"--synthetic_peptides\"]\n\n # make sure the input file exists\n if not os.path.isfile(input_file):\n print(\"Error: Cannot find input file '\" + input_file + \"'\")\n sys.exit(1)\n\n # make sure the output file does not exist\n if os.path.isfile(output_file):\n print(\"Error: Output file exists '\" + output_file + \"'\")\n sys.exit(1)\n\n with open(output_file, \"w\") as OUT:\n # write the header\n OUT.write(\"id\\tprecursor_mz\\tav_charge\\tsize\\tidentified_spec_count\\tunidentified_spec_count\\t\"\n \"max_ratio\\tmax_il_ratio\\tprecursor_mz_range\\tsequences\\t\"\n \"max_sequence\\tmax_sequence_count\\tmax_sequence_mods\\t\"\n \"second_max_sequence\\tsecond_max_sequence_count\\tsecond_max_sequence_mods\\tn_input_files\\t\"\n \"max_consensus_peak_rel_tic\\tmax_consensus_peak_mz\")\n\n if process_synthetic:\n OUT.write(\"\\tsynth_count\\tsynth_ratio\\tsynth_max_sequence\")\n\n OUT.write(\"\\n\")\n\n # process the file\n parser = clustering_parser.ClusteringParser(input_file)\n\n for cluster in parser:\n cluster_line = process_cluster(cluster)\n OUT.write(cluster_line)\n\n # process synthetic peptides\n if process_synthetic:\n synth_line = process_synthetic_peptides(cluster)\n OUT.write(\"\\t\" + synth_line)\n\n OUT.write(\"\\n\")\n\n print(\"Results written to \" + output_file)","def test_cmdlineproc_test9():\n\n parameters = {\n \"debug\": False,\n \"disconnect\": False,\n \"executable\": \"\",\n \"executableargs\": \"\",\n \"hosts\": \"\",\n \"job\": \"\",\n \"jobname\": \"\",\n \"log\": \"\",\n \"recover\": \"\",\n \"resource\": \"\",\n \"replicates\": \"\",\n \"verbose\": False\n }\n\n commandlineargs = [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--disconnect\", \"--replicates\", \"1000\", \"test.exe\",\n \"-i\", \"input.file\", \"param1\", \"--someflag\"]\n\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\n\n assert parameters[\"executable\"] == \"test.exe\"\n assert parameters[\"executableargs\"] == \"-i input.file param1 --someflag\"\n assert longbowargs == [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--disconnect\", \"--replicates\", \"1000\"]","def lammps(parameter, iteration, numberlist, density, chainlength):\n # input parameters\n var = parameter[0]\n x = var * numberlist[0]\n y = var * numberlist[1] * 1.732 / 2\n z = x / 2\n #nodeid = 55 + iteration % 5\n M = int((x * y * z * density - 4 * numberlist[0] * numberlist[1] * int(z / 0.3)) / chainlength) \n os.environ['var'] = str(var)\n os.environ['iteration'] = str(iteration)\n os.environ['M'] = str(M)\n #os.environ['nodeid'] = str(nodeid)\n # copy the files to modify\n os.system(\"cp in.asymmetric in.asymmetric_$iteration\")\n os.system(\"cp run_lammps.sh run_lammps_$iteration.sh\")\n os.system(\"cp MultiBCP_hexagonal_post.py MultiBCP_hexagonal_post_$iteration.py\")\n # modify relevant files\n os.system('sed -i -e \"s/distance = 12/distance = $var/\" MultiBCP_hexagonal_post_$iteration.py')\n os.system(\"python MultiBCP_hexagonal_post_$iteration.py\")\n time.sleep(3)\n os.system('sed -i -e \"s/3072/$M/\" in.asymmetric_$iteration')#modify according to the parameters\n os.system('sed -i -e \"s/XN_100/XN_100_$iteration/\" in.asymmetric_$iteration')\n os.system('sed -i -e \"s/finalasymmetric/finalasymmetric_$iteration/\" in.asymmetric_$iteration')\n os.system('sed -i -e \"s/POSTA2B8/POSTA2B8_$iteration/\" run_lammps_$iteration.sh')\n os.system('sed -i -e \"s/posta2b8.out/posta2b8_$iteration.out/\" run_lammps_$iteration.sh')\n #os.system('sed -i -e \"s/node55/node$nodeid/\" run_lammps_$iteration.sh')\n os.system('sed -i -e \"s/in.asymmetric/in.asymmetric_$iteration/\" run_lammps_$iteration.sh')\n # run the simulation\n os.system(\"sbatch run_lammps_$iteration.sh\")\n return None","def main(command_line_parameters = None):\n\n global task_count, job_count, job_ids, score_directories\n job_count = 0\n task_count = 0\n job_ids = {}\n score_directories = []\n\n command_line_options(command_line_parameters)\n\n global configuration, place_holder_key\n configuration = utils.read_config_file([args.configuration_file])\n place_holder_key = args.place_holder_key\n\n if args.preprocessor:\n configuration.preprocessor = args.preprocessor\n if args.extractor:\n configuration.extractor = args.extractor\n if args.algorithm:\n configuration.algorithm = args.algorithm\n\n if args.replace_variable is not None:\n exec(\"configuration.replace = configuration.%s\" % args.replace_variable)\n\n for attribute in ('preprocessor', 'extractor', 'algorithm'):\n if not hasattr(configuration, attribute):\n raise ValueError(\"The given configuration file '%s' does not contain the required attribute '%s', and it was not given on command line either\" %(args.configuration_file, attribute))\n\n # extract the dictionary of replacements from the configuration\n if not hasattr(configuration, 'replace'):\n raise ValueError(\"Please define a set of replacements using the 'replace' keyword.\")\n if not hasattr(configuration, 'imports'):\n configuration.imports = ['bob.bio.base']\n logger.info(\"No 'imports' specified in configuration file '%s' -> using default %s\", args.configuration_file, configuration.imports)\n\n if not hasattr(configuration, 'requirements'):\n configuration.requirements = []\n\n replace_dict = {}\n for step, replacements in configuration.replace.items():\n for key in replacements.keys():\n if key in replace_dict:\n raise ValueError(\"The replacement key '%s' was defined multiple times. Please use each key only once.\")\n # we always start with index 0.\n replace_dict[key] = 0\n\n # now, iterate through the list of replacements and create the according calls\n create_recursive(replace_dict, step_index = 0, directories = {}, dependency_level = 0)\n\n # finally, write some information about the\n if args.grid is not None:\n logger.info(\"The number of executed tasks is: %d, which are split up into %d jobs that are executed in the grid\" , task_count, job_count)\n\n if args.parallel is not None:\n logger.info(\"The total amount of finsihed tasks is: %d\", task_count)\n\n return score_directories","def _parse_args():\n parser = argparse.ArgumentParser(description='main.py')\n \n # General system running and configuration options\n parser.add_argument('--do_nearest_neighbor', dest='do_nearest_neighbor', default=False, action='store_true', help='run the nearest neighbor model')\n parser.add_argument('--debug', dest='debug', default=False, action='store_true', help='set to debug mode ')\n parser.add_argument('--num_train_sentence', dest='num_train_sentence', type=int, default=-1,\n help='set number of sentence to train on')\n parser.add_argument('--train_path', type=str, default='data/geo_train.tsv', help='path to train data')\n parser.add_argument('--dev_path', type=str, default='data/geo_dev.tsv', help='path to dev data')\n parser.add_argument('--test_path', type=str, default='data/geo_test.tsv', help='path to blind test data')\n parser.add_argument('--test_output_path', type=str, default='geo_test_output.tsv', help='path to write blind test results')\n parser.add_argument('--domain', type=str, default='geo', help='domain (geo for geoquery)')\n parser.add_argument('--attn_model', type=str, default='general', help='Attention model to use: general (default), dot, concat')\n\n # Some common arguments for your convenience\n parser.add_argument('--seed', type=int, default=0, help='RNG seed (default = 0)')\n parser.add_argument('--epochs', type=int, default=100, help='num epochs to train for')\n parser.add_argument('--lr', type=float, default=.001)\n parser.add_argument('--batch_size', type=int, default=2, help='batch size')\n # 65 is all you need for GeoQuery\n parser.add_argument('--decoder_len_limit', type=int, default=65, help='output length limit of the decoder')\n\n # Feel free to add other hyperparameters for your input dimension, etc. to control your network\n # 50-200 might be a good range to start with for embedding and LSTM sizes\n args = parser.parse_args()\n return args","def main():\r\n# Checking if argument was provided\r\n if len(sys.argv) <=1:\r\n print_usage()\r\n sys.exit(1)\r\n \r\n for arg in sys.argv:\r\n # Checking if help was called\r\n if arg == \"-h\" or arg == \"--help\":\r\n print_usage()\r\n sys.exit(1)\r\n \r\n # Checking for verbose mode \r\n if arg == \"-v\" or arg == \"--verbose\":\r\n global verbose_flag\r\n verbose_flag=1\r\n\r\n # Checking for input file\r\n if arg == \"-f\" or arg == \"--file\":\r\n global default_input_path\r\n global default_output_path\r\n default_input_path = sys.argv[2]\r\n default_output_path=default_input_path[:-4] + \"_results.txt\"\r\n\r\n #if arg == \"-u\" or arg == \"--url\":\r\n # input_url = sys.argv[2]\r\n\t \r\n if os.name == \"nt\":\r\n os.system('cls')\r\n else:\r\n os.system('clear')\r\n \r\n process_from_file()","def test_cmdlineproc_test11():\n\n parameters = {\n \"debug\": False,\n \"disconnect\": False,\n \"executable\": \"\",\n \"executableargs\": \"\",\n \"hosts\": \"\",\n \"job\": \"\",\n \"jobname\": \"\",\n \"log\": \"\",\n \"recover\": \"\",\n \"resource\": \"\",\n \"replicates\": \"\",\n \"verbose\": False\n }\n\n commandlineargs = [\"test.exe\", \"-i\", \"input.file\", \"param1\", \"--someflag\"]\n\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\n\n assert parameters[\"executable\"] == \"test.exe\"\n assert parameters[\"executableargs\"] == \"-i input.file param1 --someflag\"\n assert longbowargs == []","def main():\n # Default input parameters\n nelx, nely, volfrac, penalty, rmin, ft = cli.parse_args(\n nelx=120, volfrac=0.2, penalty=6.0, rmin=1.5)\n bc = DistributedMultipleLoadsBoundaryConditions(nelx, nely)\n problem = ComplianceProblem(bc, penalty)\n cli.main(nelx, nely, volfrac, penalty, rmin, ft, bc=bc,\n problem=problem)","def main(options):\n # Check if path to MIRZA is valid\n if not is_executable(options.mirzabin):\n raise Exception(\"Path to MIRZA is invalid (%s)! Please define it with --mirzabin option.\" % options.mirzabin)\n if options.verbose:\n syserr(\"Reading coordinate file\\n\")\n coords = read_coordinates(options.coords, True)\n\n if options.verbose:\n syserr(\"Reading mRNA sequences\\n\")\n mRNAseqs = read_fasta_to_dict(options.seq)\n\n if options.verbose:\n syserr(\"Reading miRNA sequences\\n\")\n miRNAseqs = read_fasta_to_dict(options.motifs)\n\n if options.onlymirza != 'yes':\n if options.verbose:\n syserr(\"Preparing alignments and phylogenetic tree\\n\")\n\n phylo_tree = read_phylogenetic_tree(options.tree)\n multiple_alignment_dict = read_multiple_alignments(phylo_tree,\n options.mln_dir,\n coords)\n mirhomologues = make_homologues_mirnas(phylo_tree, miRNAseqs)\n\n with gzip.open(options.out, 'wb') as outfile:\n if options.verbose:\n syserr(\"Collecting sequences\\n\")\n mRNA_sequences = [cor[-1] for cor in coords]\n mRNA_ids = [\"%s,%s,%s\" % (cor[0], cor[2], cor[3]) for cor in coords]\n number_of_coords = len(set([cor[1] for cor in coords])) == 1\n if number_of_coords > 1:\n raise Exception(\"More than mirna in coordinate file\")\n if number_of_coords == 0:\n syserr(\"There is no coordinates. Exit.\")\n sys.exit()\n\n miRNAseq = miRNAseqs[list(set([cor[1] for cor in coords]))[0]][:21]\n miRNAid = list(set([cor[1] for cor in coords]))[0]\n\n if options.verbose:\n syserr(\"Running MIRZA\\n\")\n results = calculate_mirza(mRNA_sequences, mRNA_ids, miRNAseq, miRNAid)\n\n if options.verbose:\n syserr(\"Collecting results\\n\")\n for key, group in itertools.groupby(results.splitlines(), lambda x: x == \"\"):\n if not key:\n proper_group = False\n for line in group:\n if line.startswith(\">\"):\n mRNAid = line.split()[0][1:].split(\",\")[0]\n beg = line.split()[0][1:].split(\",\")[1]\n end = line.split()[0][1:].split(\",\")[2]\n score = float(line.split()[-1])\n proper_group = True\n # elif line.startswith(\"miRNA\"):\n # mirhyb = line.split(\"\\t\")[1].split(\" \")[0]\n # elif line.startswith(\"A L\"):\n # hyb = line.split(\"\\t\")[1].rstrip()\n elif line.startswith(\"mRNA\"):\n mrhyb = line.split(\"\\t\")[1].split(\" \")[0]\n if proper_group:\n if len(miRNAseq) < 21:\n outtext = '%s,%s,%s,%s\\t%s\\t%s\\t%s\\t%s\\t%s\\n' % (mRNAid,\n miRNAid,\n beg,\n end,\n \"NA\",\n \"NA\",\n \"NA\",\n \"NA\",\n \"NA\")\n outfile.write(outtext)\n continue\n\n # hybrids = [mirhyb, hyb, mrhyb]\n # mirseq, hybseq, mrhybseq, mrpos = get_hybrid_vector(hybrids)\n # canonical, type_of_site = is_canonical([mirseq, hybseq, mrhybseq])\n if options.onlymirza != 'yes':\n try:\n mln_frag = multiple_alignment_dict[mRNAid]\n qd = calculate_conservation(phylotree=phylo_tree,\n mrna_frag=mrhyb.replace(\"-\", \"\")[::-1],\n mrnaid=mRNAid,\n mirna=mirhomologues,\n mirname=miRNAid,\n mln_dict=mln_frag,\n ref_org=options.reforg,\n threshold=options.thr,\n mrna_len=options.contextLen)\n qd = str(qd)\n except KeyError, e:\n qd = \"NA\"\n sys.stderr.write(\"KeyError: \" + str(e) + \"\\n\")\n sys.stderr.write(\"Trace: \"\n + traceback.format_exc()\n + \"\\n\")\n # raise KeyError\n else:\n qd = \"NA\"\n outtext = '%s,%s,%s,%s\\t%f\\t%s\\n' % (mRNAid,\n miRNAid,\n beg,\n end,\n score,\n # \":\".join(hybrids),\n qd)\n # \"canonical\" if canonical else \"non-canonical\",\n # type_of_site)\n outfile.write(outtext)\n clean()","def main(argv=None):\n\n if not argv:\n argv = sys.argv\n\n # setup command line parser\n parser = E.OptionParser(version=\"%prog version: $Id$\",\n usage=globals()[\"__doc__\"])\n\n parser.add_option(\"-b\", \"--bam-file\", dest=\"bam\", type=\"string\",\n help=\"BAM file containing iCLIP reads\")\n parser.add_option(\"-s\", \"--spread\", dest=\"spread\", type=\"int\",\n default=15,\n help=\"Number of bases each site of each bases\"\n \"to use when calculating height\")\n parser.add_option(\"-r\", \"--randomisations\", dest=\"rands\", type=\"int\",\n default=100,\n help=\"Number of randomisations to use when\"\n \"calculating FDR\")\n parser.add_option(\"-t\", \"--threshold\", dest=\"threshold\", type=\"float\",\n default=0.05,\n help=\"FDR threshold on which to select bases\")\n parser.add_option(\"-f\", \"--feature\", dest=\"feature\", type=\"choice\",\n choices=[\"transcript\", \"gene\"],\n default=\"gene\",\n help=\"GTF feature to use. Gene or transcript\")\n parser.add_option(\"-p\", \"--processes\", dest=\"proc\", type=\"int\",\n default=None,\n help=\"Number of processes to use for multiprocessing\")\n\n # add common options (-h/--help, ...) and parse command line\n (options, args) = E.Start(parser, argv=argv)\n\n if options.proc:\n try:\n import multiprocessing\n pool = multiprocessing.Pool(options.proc)\n except ImportError:\n E.warn(\"Failed to setup multiprocessing, using single processor\")\n pool = None\n else:\n pool = None\n\n if options.feature == \"gene\":\n iterator = GTF.flat_gene_iterator(GTF.iterator(options.stdin))\n elif options.feature == \"transcript\":\n iterator = GTF.transcript_iterator(GTF.iterator(options.stdin))\n else:\n raise ValueError(\"Unknown feature type %s\" % options.feature)\n\n bam = pysam.AlignmentFile(options.bam)\n\n results = clusters.get_crosslink_fdr_by_randomisation(\n iterator, bam, options.rands, options.spread, pool)\n\n results = results[results <= options.threshold]\n results = results.sort_index()\n results = results.reset_index()\n results.columns = [\"contig\", \"start\", \"FDR\"]\n results[\"start\"] = results[\"start\"].astype(\"int\")\n results[\"end\"] = results.start + 1\n results = results.loc[:,[\"contig\", \"start\", \"end\", \"FDR\"]]\n results[\"FDR\"] = -numpy.log10(results[\"FDR\"])\n results.to_csv(options.stdout, header=False, index=False, sep=\"\\t\")\n # write footer and output benchmark information.\n E.Stop()","def main(cliargs=None):\n\n try:\n args = parsecli(cliargs)\n # checkargs(args)\n result = 0 # process(args)\n log.info(\"Done.\")\n return result\n\n except KeyboardInterrupt:\n return 10","def test_cmdlineproc_test8():\n\n parameters = {\n \"debug\": False,\n \"disconnect\": False,\n \"executable\": \"\",\n \"executableargs\": \"\",\n \"hosts\": \"\",\n \"job\": \"\",\n \"jobname\": \"\",\n \"log\": \"\",\n \"recover\": \"\",\n \"resource\": \"\",\n \"replicates\": \"\",\n \"verbose\": False\n }\n\n commandlineargs = [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--replicates\", \"1000\", \"--disconnect\", \"test.exe\",\n \"-i\", \"input.file\", \"param1\", \"--someflag\"]\n\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\n\n assert parameters[\"executable\"] == \"test.exe\"\n assert parameters[\"executableargs\"] == \"-i input.file param1 --someflag\"\n assert longbowargs == [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--replicates\", \"1000\", \"--disconnect\"]","def _parse_args():\n parser = argparse.ArgumentParser(description='main.py')\n \n # General system running and configuration options\n parser.add_argument('--do_nearest_neighbor', dest='do_nearest_neighbor', default=False, action='store_true', help='run the nearest neighbor model')\n\n parser.add_argument('--train_path', type=str, default='data/geo_train.tsv', help='path to train data')\n parser.add_argument('--dev_path', type=str, default='data/geo_dev.tsv', help='path to dev data')\n parser.add_argument('--test_path', type=str, default='data/geo_test.tsv', help='path to blind test data')\n parser.add_argument('--test_output_path', type=str, default='geo_test_output.tsv', help='path to write blind test results')\n parser.add_argument('--domain', type=str, default='geo', help='domain (geo for geoquery)')\n \n # Some common arguments for your convenience\n parser.add_argument('--seed', type=int, default=0, help='RNG seed (default = 0)')\n parser.add_argument('--epochs', type=int, default=100, help='num epochs to train for')\n parser.add_argument('--lr', type=float, default=.001)\n parser.add_argument('--batch_size', type=int, default=2, help='batch size')\n # 65 is all you need for GeoQuery\n parser.add_argument('--decoder_len_limit', type=int, default=65, help='output length limit of the decoder')\n\n # Feel free to add other hyperparameters for your input dimension, etc. to control your network\n # 50-200 might be a good range to start with for embedding and LSTM sizes\n args = parser.parse_args()\n return args","def main(argv=None):\n\n parser = ArgParser(\n description=\"Extrapolate input data to required lead times.\")\n parser.add_argument(\"input_filepath\", metavar=\"INPUT_FILEPATH\",\n type=str, help=\"Path to input NetCDF file.\")\n\n group = parser.add_mutually_exclusive_group()\n group.add_argument(\"--output_dir\", metavar=\"OUTPUT_DIR\", type=str,\n default=\"\", help=\"Directory to write output files.\")\n group.add_argument(\"--output_filepaths\", nargs=\"+\", type=str,\n help=\"List of full paths to output nowcast files, in \"\n \"order of increasing lead time.\")\n\n optflw = parser.add_argument_group('Advect using files containing the x '\n ' and y components of the velocity')\n optflw.add_argument(\"--eastward_advection_filepath\", type=str, help=\"Path\"\n \" to input file containing Eastward advection \"\n \"velocities.\")\n optflw.add_argument(\"--northward_advection_filepath\", type=str, help=\"Path\"\n \" to input file containing Northward advection \"\n \"velocities.\")\n\n speed = parser.add_argument_group('Advect using files containing speed and'\n ' direction')\n speed.add_argument(\"--advection_speed_filepath\", type=str, help=\"Path\"\n \" to input file containing advection speeds,\"\n \" usually wind speeds, on multiple pressure levels.\")\n speed.add_argument(\"--advection_direction_filepath\", type=str,\n help=\"Path to input file containing the directions from\"\n \" which advection speeds are coming (180 degrees from\"\n \" the direction in which the speed is directed). The\"\n \" directions should be on the same grid as the input\"\n \" speeds, including the same vertical levels.\")\n speed.add_argument(\"--pressure_level\", type=int, default=75000, help=\"The\"\n \" pressure level in Pa to extract from the multi-level\"\n \" advection_speed and advection_direction files. The\"\n \" velocities at this level are used for advection.\")\n parser.add_argument(\"--orographic_enhancement_filepaths\", nargs=\"+\",\n type=str, default=None, help=\"List or wildcarded \"\n \"file specification to the input orographic \"\n \"enhancement files. Orographic enhancement files are \"\n \"compulsory for precipitation fields.\")\n parser.add_argument(\"--json_file\", metavar=\"JSON_FILE\", default=None,\n help=\"Filename for the json file containing \"\n \"required changes to the metadata. Information \"\n \"describing the intended contents of the json file \"\n \"is available in \"\n \"improver.utilities.cube_metadata.amend_metadata.\"\n \"Every output cube will have the metadata_dict \"\n \"applied. Defaults to None.\", type=str)\n parser.add_argument(\"--max_lead_time\", type=int, default=360,\n help=\"Maximum lead time required (mins).\")\n parser.add_argument(\"--lead_time_interval\", type=int, default=15,\n help=\"Interval between required lead times (mins).\")\n\n accumulation_args = parser.add_argument_group(\n 'Calculate accumulations from advected fields')\n accumulation_args.add_argument(\n \"--accumulation_fidelity\", type=int, default=0,\n help=\"If set, this CLI will additionally return accumulations\"\n \" calculated from the advected fields. This fidelity specifies the\"\n \" time interval in minutes between advected fields that is used to\"\n \" calculate these accumulations. This interval must be a factor of\"\n \" the lead_time_interval.\")\n accumulation_args.add_argument(\n \"--accumulation_period\", type=int, default=15,\n help=\"The period over which the accumulation is calculated (mins). \"\n \"Only full accumulation periods will be computed. At lead times \"\n \"that are shorter than the accumulation period, no accumulation \"\n \"output will be produced.\")\n accumulation_args.add_argument(\n \"--accumulation_units\", type=str, default='m',\n help=\"Desired units in which the accumulations should be expressed,\"\n \"e.g. mm\")\n\n # Load Cubes\n args = parser.parse_args(args=argv)\n\n metadata_dict = load_json_or_none(args.json_file)\n\n upath, vpath = (args.eastward_advection_filepath,\n args.northward_advection_filepath)\n spath, dpath = (args.advection_speed_filepath,\n args.advection_direction_filepath)\n\n # load files and initialise advection plugin\n input_cube = load_cube(args.input_filepath)\n orographic_enhancement_cube = load_cube(\n args.orographic_enhancement_filepaths, allow_none=True)\n\n speed_cube = direction_cube = ucube = vcube = None\n if (upath and vpath) and not (spath or dpath):\n ucube = load_cube(upath)\n vcube = load_cube(vpath)\n elif (spath and dpath) and not (upath or vpath):\n level_constraint = Constraint(pressure=args.pressure_level)\n try:\n speed_cube = load_cube(spath, constraints=level_constraint)\n direction_cube = load_cube(dpath, constraints=level_constraint)\n except ValueError as err:\n raise ValueError(\n '{} Unable to extract specified pressure level from given '\n 'speed and direction files.'.format(err))\n else:\n raise ValueError('Cannot mix advection component velocities with speed'\n ' and direction')\n\n # Process Cubes\n accumulation_cubes, forecast_to_return = process(\n input_cube, ucube, vcube, speed_cube, direction_cube,\n orographic_enhancement_cube, metadata_dict, args.max_lead_time,\n args.lead_time_interval, args.accumulation_fidelity,\n args.accumulation_period, args.accumulation_units)\n\n # Save Cube\n if args.output_filepaths and \\\n len(args.output_filepaths) != len(forecast_to_return):\n raise ValueError(\"Require exactly one output file name for each \"\n \"forecast lead time\")\n for i, cube in enumerate(forecast_to_return):\n # save to a suitably-named output file\n if args.output_filepaths:\n file_name = args.output_filepaths[i]\n else:\n file_name = os.path.join(\n args.output_dir, generate_file_name(cube))\n save_netcdf(cube, file_name)\n\n if args.accumulation_fidelity > 0:\n # return accumulation cubes\n for i, cube in enumerate(accumulation_cubes):\n file_name = os.path.join(args.output_dir, generate_file_name(cube))\n save_netcdf(cube, file_name)","def test_cmdlineproc_test5():\n\n parameters = {\n \"debug\": False,\n \"disconnect\": False,\n \"executable\": \"\",\n \"executableargs\": \"\",\n \"hosts\": \"\",\n \"job\": \"\",\n \"jobname\": \"\",\n \"log\": \"\",\n \"recover\": \"\",\n \"resource\": \"\",\n \"replicates\": \"\",\n \"verbose\": False\n }\n\n commandlineargs = [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--replicates\", \"1000\", \"--disconnect\", \"pmemd.MPI\"]\n\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\n\n assert parameters[\"executable\"] == \"pmemd.MPI\"\n assert parameters[\"executableargs\"] == \"\"\n assert longbowargs == [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--replicates\", \"1000\", \"--disconnect\"]","def run_parallel(heritability, x_start_i, x_stop_i, cluster='usc'):\n\trun_id = 'corr_trait_sim'\n\tjob_id = ' % s_ % d_ % d' % (run_id, x_start_i, x_stop_i)\n\tfile_prefix = env.env['results_dir'] + run_id + '_' + str(x_start_i) + '_' + str(x_stop_i)\n\n\t#Cluster specific parameters\t\n\tif cluster == 'gmi': #GMI cluster.\n\t\tshstr = '#!/bin/sh\\n'\n\t\tshstr += '#$ -N %s\\n' % job_id\n\t\tshstr += \"#$ -q q.norm@blade*\\n\"\n\t\tshstr += '#$ -o %s.log\\n' % job_id\n\t\t#shstr += '#$ -cwd /home/GMI/$HOME\\n'\n\t\t#shstr += '#$ -M bjarni.vilhjalmsson@gmi.oeaw.ac.at\\n\\n'\n\n\telif cluster == 'usc': #USC cluster.\n\t\tshstr = \"#!/bin/csh\\n\"\n\t\tshstr += \"#PBS -l walltime=%s \\n\" % '72:00:00'\n\t\tshstr += \"#PBS -l mem=%s \\n\" % '1950mb'\n\t\tshstr += \"#PBS -q cmb\\n\"\n\t\tshstr += \"#PBS -N p%s \\n\" % job_id\n\n\tshstr += \"(python %scorr_trait_sim.py %s %d %d \" % (env.env['script_dir'], heritability, x_start_i, x_stop_i)\n\n\tshstr += \"> \" + file_prefix + \"_job.out) >& \" + file_prefix + \"_job.err\\n\"\n\tprint '\\n', shstr, '\\n'\n\tscript_file_name = run_id + \".sh\"\n\tf = open(script_file_name, 'w')\n\tf.write(shstr)\n\tf.close()\n\n\t#Execute qsub script\n\tos.system(\"qsub \" + script_file_name)","def main():\n # Check the user CLI input matches correct syntax\n try:\n # Specify the valid CLI options/arguments\n opts, _ = getopt.getopt(\n sys.argv[1:],\n \"hv\",\n [\n \"help\",\n \"verbose\",\n \"input=\",\n \"output=\",\n \"locations=\",\n \"trips=\",\n \"results=\",\n ],\n )\n except getopt.GetoptError as err:\n print(str(err))\n usage()\n sys.exit(2)\n\n # Define input arguments and initialize default values.\n input_file = \"tests/input/input1.txt\"\n output_file = \"tests/output/output1.txt\"\n locations_file = \"data/locations.csv\"\n trips_file = \"data/trips.csv\"\n results = 3\n\n # Loop through all the User CLI options/arguments\n for opt, arg in opts:\n if opt in (\"-h\", \"--help\"):\n usage()\n sys.exit()\n elif opt in (\"-v\", \"--verbose\"):\n logging.basicConfig()\n logging.getLogger().setLevel(logging.DEBUG)\n elif opt == \"--input\":\n input_file = arg\n\n if not os.path.exists(input_file):\n sys.exit(\"Could not find input file\")\n elif opt == \"--output\":\n output_file = arg\n elif opt == \"--locations\":\n locations_file = arg\n\n if not os.path.exists(locations_file):\n sys.exit(\"Could not find locations file\")\n elif opt == \"--trips\":\n trips_file = arg\n\n if not os.path.exists(trips_file):\n sys.exit(\"Could not find trips file\")\n elif opt == \"--results\":\n results = int(arg)\n\n parse(\n locations_file,\n trips_file,\n input_file,\n output_file,\n results,\n )","def parseCommandLine():\n\n parser = argparse.ArgumentParser(\n description='Determine photometric zeropoint of banzai-reduced LCO imaging data.')\n\n\n parser.add_argument('--log-level', dest='log_level', default='INFO', choices=['DEBUG', 'INFO'],\n help='Set the log level')\n parser.add_argument('--ps1dir', dest='ps1dir', default='~/Catalogs/ps1odi/panstarrs/',\n help='Directory of PS1 catalog')\n parser.add_argument(\"--diagnosticplotsdir\", dest='outputimageRootDir', default=None,\n help='Output directory for diagnostic photometry plots. No plots generated if option is omitted. This is a time consuming task. ')\n parser.add_argument('--photodb', dest='imagedbPrefix', default='~/lcozpplots/lcophotzp.db',\n help='Result output directory. .db file is written here')\n parser.add_argument('--imagerootdir', dest='rootdir', default='/archive/engineering',\n help=\"LCO archive root directory\")\n parser.add_argument('--site', dest='site', default=None, help='sites code for camera')\n parser.add_argument('--mintexp', dest='mintexp', default=60, type=float, help='Minimum exposure time to accept')\n parser.add_argument('--redo', action='store_true')\n parser.add_argument ('--preview', dest='processstatus', default='processed', action='store_const', const='preview')\n\n\n\n mutex = parser.add_mutually_exclusive_group()\n mutex.add_argument('--date', dest='date', default=[None,], nargs='+', help='Specific date to process.')\n mutex.add_argument('--lastNdays', type=int)\n\n\n cameragroup = parser.add_mutually_exclusive_group()\n\n cameragroup.add_argument('--camera', dest='camera', default=None, help='specific camera to process. ')\n cameragroup.add_argument('--cameratype', dest='cameratype', default=None, choices=['fs', 'fl', 'kb'],\n help='camera type to process at selected sites to process. ')\n cameragroup.add_argument('--crawldirectory', default=None, type=str,\n help=\"process all reduced image in specific directoy\")\n\n args = parser.parse_args()\n\n logging.basicConfig(level=getattr(logging, args.log_level.upper()),\n format='%(asctime)s.%(msecs).03d %(levelname)7s: %(module)20s: %(message)s')\n\n args.imagedbPrefix = os.path.expanduser(args.imagedbPrefix)\n\n if args.outputimageRootDir is not None:\n args.outputimageRootDir = os.path.expanduser(args.outputimageRootDir)\n print (\"Writing db to directory: %s\" % args.outputimageRootDir)\n\n if args.crawldirectory is not None:\n args.crawldirectory = os.path.expanduser(args.crawldirectory)\n\n\n\n if (args.lastNdays is not None):\n args.date=[]\n today = datetime.datetime.utcnow()\n for ii in range (args.lastNdays):\n day = today - datetime.timedelta(days=ii)\n args.date.append (day.strftime(\"%Y%m%d\"))\n\n args.date = args.date[::-1]\n\n args.ps1dir = os.path.expanduser(args.ps1dir)\n\n print (args.processstatus)\n return args","def main(args):\n options = parseArgs(args)\n dir = \"\"\n # Check if were doing a local or global directory. \n if options.outputDir.startswith(\"/\"):\n dir = options.outputDir\n else: dir = os.getcwd() + \"/\" + options.outputDir\n \n # Check that the directory doesn't exist and make it. \n if not os.path.exists(dir):\n os.makedirs(dir)\n os.chdir(dir)\n else:\n print (\"The output dir provided, %s, is already in use. Aborting.\"%(options.outputDir))\n exit(1)\n\n if options.verbose: print (\"Start run kallisto on a batch of fastq files (cdwManiFastqToKallisto).\")\n if options.verbose: print (\"Making the job list...\")\n makeJobList(\"../\"+options.manifestFile, open(\"jobList\",\"w\", 1),options.isMouse, options.bootstrap, options.outputDir, options.verbose)\n \n if options.test:\n print (\"You have selected a dry run, the program is stopping now.\")\n exit(1)\n\n # Go onto the server and run the joblist. \n paraRunKallisto(options.verbose, os.getenv(\"HOST\")) \n if options.verbose: print (\"Starting the parasol run...\")\n if options.verbose: print (\"Completed run kallisto on a batch of fastq files (cdwManiFastqToKallisto).\")","def execute(self, parameters, messages):\r\n\r\n # Gather all necessary parameters\r\n in_nc = parameters[0].valueAsText\r\n in_csv = parameters[1].valueAsText\r\n basin_mask = parameters[2].valueAsText\r\n routing = parameters[3].valueAsText\r\n Lake_routing = parameters[4].valueAsText\r\n in_reservoir = parameters[5].valueAsText\r\n in_raster = parameters[6].valueAsText\r\n cellsize = parameters[7].valueAsText\r\n threshold = parameters[8].valueAsText\r\n ovroughrtfac_val = parameters[9].valueAsText\r\n retdeprtfac_val = parameters[10].valueAsText\r\n out_zip = parameters[11].valueAsText\r\n\r\n # Prepare output log file\r\n outtable = open(os.path.join(os.path.dirname(out_zip), os.path.basename(out_zip) + '.log'), \"w\")\r\n loglines = ['Begining processing on %s' %time.ctime()]\r\n loglines.append('64-bit background geoprocessing: %s' %bit64)\r\n tic = time.time()\r\n loglines.append('Input parameters:')\r\n for param in parameters:\r\n loglines.append(' Parameter: %s: %s' %(param.displayName, param.valueAsText))\r\n outtable.writelines(\"\\n\".join(loglines) + \"\\n\")\r\n\r\n # Create scratch directory for temporary outputs\r\n projdir = os.path.dirname(out_zip) + os.sep + 'scratchdir' # This is the only instance where we need the 'os' module!\r\n if not os.path.exists(projdir):\r\n os.makedirs(projdir)\r\n arcpy.env.overwriteOutput = True\r\n arcpy.env.workspace = projdir\r\n arcpy.env.scratchWorkspace = projdir\r\n\r\n # Set the input units to meters\r\n inunits = 'm'\r\n\r\n # Interpret the input for reservoir routing\r\n if Lake_routing == 'false':\r\n in_lakes = ''\r\n else:\r\n in_lakes = in_reservoir\r\n\r\n # Step 1 - Georeference geogrid file\r\n\r\n LU_INDEX, sr2, Projection_String, loglines = wrf_hydro_functions.georeference_geogrid_file(arcpy, in_nc, 'LU_INDEX') # Process: Generate LU Index grid\r\n outtable.writelines(\"\\n\".join(loglines) + \"\\n\")\r\n \r\n hgt_m_raster, sr2, Projection_String, loglines = wrf_hydro_functions.georeference_geogrid_file(arcpy, in_nc, 'HGT_M')\r\n outtable.writelines(\"\\n\".join(loglines) + \"\\n\")\r\n\r\n\r\n # Step 2 - Create high resolution topography layers\r\n mosprj, cellsize1, cellsize2, loglines = wrf_hydro_functions.create_high_res_topogaphy(arcpy, in_raster, hgt_m_raster, cellsize, sr2, projdir)\r\n outtable.writelines(\"\\n\".join(loglines) + \"\\n\")\r\n\r\n # Step 3 - Create latitude and longitude rasters\r\n loglines = wrf_hydro_functions.create_lat_lon_rasters(arcpy, projdir, mosprj)\r\n outtable.writelines(\"\\n\".join(loglines) + \"\\n\")\r\n\r\n # Step 4 - Hyrdo processing functions\r\n loglines = wrf_hydro_functions.sa_functions(arcpy, basin_mask, mosprj, ovroughrtfac_val, retdeprtfac_val, projdir, in_csv, out_zip, threshold, inunits, LU_INDEX, cellsize1, cellsize2, routing, in_lakes) # , mosprj2,\r\n outtable.writelines(\"\\n\".join(loglines) + \"\\n\")\r\n\r\n # Clean up and give finishing message\r\n #del LU_INDEX, hgt_m_raster\r\n #shutil.rmtree(projdir)\r\n loglines = ['Completed without error in %s seconds.\\n' %(time.time()-tic)]\r\n arcpy.AddMessage(loglines[-1])\r\n outtable.write(loglines[-1])\r\n outtable.close()\r\n return","def main():\n parser = argparse.ArgumentParser(description=\"Renumber atoms and residues from a 3D structure.\", formatter_class=lambda prog: argparse.RawTextHelpFormatter(prog, width=99999))\n parser.add_argument('-c', '--config', required=False, help=\"This file can be a YAML file, JSON file or JSON string\")\n\n # Specific args of each building block\n required_args = parser.add_argument_group('required arguments')\n required_args.add_argument('-i', '--input_gro_path', required=True, help=\"Input GRO file name\")\n required_args.add_argument('-o', '--output_gro_path', required=True, help=\"Output sorted GRO file name\")\n\n args = parser.parse_args()\n config = args.config if args.config else None\n properties = settings.ConfReader(config=config).get_prop_dic()\n\n # Specific call of each building block\n sort_gro_residues(input_gro_path=args.input_gro_path,\n output_gro_path=args.output_gro_path,\n properties=properties)","def test_cmdlineproc_test6():\n\n parameters = {\n \"debug\": False,\n \"disconnect\": False,\n \"executable\": \"\",\n \"executableargs\": \"\",\n \"hosts\": \"\",\n \"job\": \"\",\n \"jobname\": \"\",\n \"log\": \"\",\n \"recover\": \"\",\n \"resource\": \"\",\n \"replicates\": \"\",\n \"verbose\": False\n }\n\n commandlineargs = [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--maxtime\", \"01:00\", \"--replicates\", \"1000\",\n \"--disconnect\", \"pmemd.MPI\", \"-O\", \"-i\", \"ex.in\", \"-c\",\n \"ex.min\", \"-p\", \"ex.top\", \"-o\", \"ex.out\"]\n\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\n\n assert parameters[\"executable\"] == \"pmemd.MPI\"\n assert parameters[\"executableargs\"] == \\\n \"-O -i ex.in -c ex.min -p ex.top -o ex.out\"\n assert longbowargs == [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--maxtime\", \"01:00\", \"--replicates\", \"1000\",\n \"--disconnect\"]","def process_arguments():\n # Create ArgumentParser object. Description message will be displayed as part of help message if script is run with -h flag\n parser = argparse.ArgumentParser(description='Prints tier 1 and 2 variant details to stdout for a given 100k case')\n # Define the arguments that will be taken.\n parser.add_argument('-i', '--ir_id', required=True, help='GeL Interpretation Request ID in format 12345-1')\n parser.add_argument('-p', '--proband_id', required=True, help='GeL participant ID for proband')\n # Return the arguments\n return parser.parse_args()","def run(args):\n # args = args_init(vars(get_args()), align=True)\n\n log.info('running RNAseq pipeline')\n\n ## default arguments, for RNAseq2 only\n args['align_to_rRNA'] = True\n\n ## multireads should not be discarded\n ## https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4728800/\n ## Genome Biology, 2016\n if args['include_multi_reads']:\n args['unique_only'] = False # \n else:\n args['unique_only'] = True # default \n\n # determine gtf file\n # gene gtf\n if args['gtf'] is None:\n args['gtf'] = Genome(**args).gene_gtf('refseq') # ucsc version\n\n # for GRCh38 genome, using GENCODE version \n # if args['genome'] == 'GRCh38':\n if args['genome'] in ['GRCh38', 'GRCm38']:\n args['gtf'] = Genome(**args).gene_gtf('ensembl') # gencode\n\n # te gtf\n if args['te_gtf'] is None:\n args['te_gtf'] = Genome(**args).te_gtf()\n\n # print(args['gtf'])\n\n ## update prefix\n ctl_prefix = str_common([os.path.basename(f) for f in args['c1']])\n ctl_prefix = ctl_prefix.rstrip('r|R|rep|Rep').rstrip('_|.')\n if args['C'] is None:\n args['C'] = ctl_prefix\n tre_prefix = str_common([os.path.basename(f) for f in args['t1']])\n tre_prefix = tre_prefix.rstrip('r|R|rep|Rep').rstrip('_|.')\n if args['T'] is None:\n args['T'] = tre_prefix\n \n ## run pipeline\n if args['extra_index']:\n extra_rnaseq(args, args['extra_gtf'])\n elif args['align_to_te']:\n te_rnaseq(args, args['te_gtf'])\n else:\n gene_rnaseq(args)\n\n log.info('finish')","def parse_args():\n parser = argparser()\n args = parser.parse_args()\n\n # --------------------------------------------------------- #\n # Parse and check runtime parameters.\n # --------------------------------------------------------- #\n\n # check validity of cores selection.\n max_ppn = max_cpu() + 1\n if args.proc_per_node > max_ppn:\n warnings.warn('{0} is greater than the number of available cores ({1}). Reducing to {2}'\n .format(args.proc_per_node, max_ppn, max_ppn - 1))\n args.proc_per_node = max_ppn - 1\n\n # ensure that user has supplied fresh .bam/.bai files or a directory containing alignment files.\n if not args.bam_files and not args.bam_dir:\n raise ValueError('Must specify either --bam-files or --bam-dir.')\n\n if args.bam_files and args.bam_dir:\n raise ValueError('Both --bam-files and --bam-dir were provided! Not sure which data set to use.')\n\n # --------------------------------------------------------- #\n # Gather input RNA-Seq + genome annotation files.\n # --------------------------------------------------------- #\n\n # check validity of gene annotation file selection.\n if not args.genome_annotation:\n raise ValueError('If warm-start directory not specified, gene annotation file must be specified!')\n\n else:\n if not os.path.isfile(args.genome_annotation):\n raise FileNotFoundError('Gene annotation file {0} not found.'.format(args.genome_annotation))\n\n # check validity of file i/o selection.\n bam_files = list()\n bai_files = list()\n create_bai_files = list()\n\n # INPUT OPTION 1: a --bam-dir was specified.\n if args.bam_dir:\n\n # if user used both --bam-dir and --bam-files and/or --bai-files, yell at them. (only use one method).\n if args.bam_files is not None or args.bai_files is not None:\n raise ValueError('Do not specify both a --bam-dir and either --bam-files and/or --bai-files.'\n 'Use one input selection method or the other.')\n\n # check that the dir actually exists.\n if not os.path.isdir(args.bam_dir):\n raise NotADirectoryError('Cannot find --bam-dir {0}'.format(args.bam_dir))\n\n # scan directory for .bam files.\n for f in os.listdir(args.bam_dir):\n if f.endswith('.bam'):\n bam_files.append(os.path.join(args.bam_dir, f))\n\n # search for .bai files in the --bam-dir. If they don't exist, try to make them.\n for bam_file in bam_files:\n bai_file = re.sub('.bam$', '.bai', bam_file)\n\n # if .bai file under same basename as .bam file doesn't exist,\n # add it to list of .bai files that need to be created.\n if not os.path.isfile(bai_file):\n bai_files.append(bai_from_bam_file(bam_file))\n create_bai_files.append(bam_file)\n else:\n bai_files.append(bai_file)\n\n # INPUT OPTION 2: --bam-files and possibly --bai-files were specified.\n else:\n # ensure .bam files are actually .bam files.\n for bam_file in args.bam_files:\n if not bam_file.endswith('.bam'):\n raise ValueError('{0} is not a .bam file.'.format(bam_file))\n elif not os.path.isfile(bam_file):\n raise FileNotFoundError('Count not find .bam file {0}'.format(bam_file))\n else:\n bam_files.append(bam_file)\n\n # case where user has specified .bai files to accompany .bam files.\n if args.bai_files is not None:\n # if user has supplied an incorrect number of bai files, fail out.\n if len(args.bai_files) != len(bam_files):\n raise ValueError('Number of supplied .bai files does not match number of supplied .bam files.')\n\n # ensure .bai files are actually .bai files.\n for bai_file in args.bai_files:\n if not bai_file.endswith('.bai'):\n raise ValueError('{0} is not a .bai file.'.format(bai_file))\n elif not os.path.isfile(bai_file):\n raise FileNotFoundError('Count not find .bai file {0}'.format(bai_file))\n else:\n bai_files.append(bai_file)\n\n # if user has not supplied any bai files: look for them under the same name\n # as each of the .bam files, or create new .bai files with samtools (if possible).\n else:\n for bam_file in bam_files:\n bai_file = re.sub('.bam$', '.bai', bam_file)\n\n # if .bai file under same name as .bam file doesn't exist,\n # add it to list of .bam files for which we need to create a .bai file.\n if not os.path.isfile(bai_file):\n bai_files.append(bai_from_bam_file(bam_file))\n create_bai_files.append(bam_file)\n else:\n bai_files.append(bai_file)\n\n # ensure that input files are uniquely named.\n if len(bam_files) != len(set(bam_files)):\n raise ValueError('Supplied .bam files are not uniquely named!')\n\n # create parser attributes for bam/index files.\n args.bam_files = bam_files\n args.bai_files = bai_files\n args.create_bai_files = create_bai_files\n\n return args","def get_options():\n parser = argparse.ArgumentParser(description='ZA Machine learning for full run2 Ulegacy data')\n \n parser.add_argument('-o', '--outputs', action='store', required=True, type=str,\n help='ZA machine learning outputs dir ')\n\n #=========================================================================\n # Local For Test : Scan, deploy and restore arguments #\n #=========================================================================\n a = parser.add_argument_group('Scan, deploy and restore arguments')\n a.add_argument('-s','--scan', action='store', required=False, type=str, default='',\n help='Name of the scan to be used (modify scan parameters in NeuralNet.py)')\n a.add_argument('-task','--task', action='store', required=False, type=str, default='',\n help='Name of dict to be used for scan (Used by function itself when submitting jobs or DEBUG)')\n a.add_argument('--generator', action='store_true', required=False, default=False, \n help='Wether to use a generator for the neural network')\n a.add_argument('--resume', action='store_true', required=False, default=False,\n help='Wether to resume the training of a given model (path in parameters.py)')\n #=========================================================================\n # Slurm Submissions : Splitting and submitting jobs arguments #\n #=========================================================================\n b = parser.add_argument_group('Splitting and submitting jobs arguments')\n b.add_argument('-split','--split', action='store', required=False, type=int, default=0,\n help='Number of parameter sets per jobs to be used for splitted training for slurm submission (if -1, will create a single subdict)')\n b.add_argument('-submit','--submit', action='store', required=False, default='', type=str,\n help='Wether to submit jons to slurm (must have specified --split)')\n b.add_argument('-resubmit','--resubmit', action='store', required=False, default='', type=str,\n help='Wether to resubmit failed jobs given the name you give during submission ( must giev the same output)')\n b.add_argument('-debug','--debug', action='store_true', required=False, default=False,\n help='Debug mode of the slurm submission, does everything except submit the jobs')\n #=========================================================================\n # Repot and Produce Outputs: This do csv concatenation and get the best model : workdir/model/*.csv\n # Further used for : Analyzing or producing outputs of the given model \n #=========================================================================\n c = parser.add_argument_group('Analyzing or producing outputs for given model (csv or zip file)')\n c.add_argument('-r','--report', action='store_true', required=False, default=False,\n help='report 10 best models (according to the eval_criterion) and plot on the console several histograms and *.png files')\n c.add_argument('-m','--model', action='store', required=False, type=str, default='',\n help='Loads the provided model name (without .zip and type, it will find them)') \n c.add_argument('-k','--key', action='store', required=False, nargs='+', type=str, default=[], \n help='Applies the provided model (do not forget -k) on the list of keys from parameters.TTree') \n #=========================================================================\n # Physics arguments #\n #=========================================================================\n e = parser.add_argument_group('Physics arguments')\n e.add_argument('-p','--process', action='store', required=False, nargs='+', default=[],\n help='Which process you want to submit for training ')\n e.add_argument('--resolved', action='store_true', required=False, default=False,\n help='Resolved topology')\n e.add_argument('--boosted', action='store_true', required=False, default=False,\n help='Boosted topology')\n #=========================================================================\n # Additional arguments #\n #=========================================================================\n f = parser.add_argument_group('Additional arguments')\n f.add_argument('-v','--verbose', action='store_true', required=False, default=False,\n help='Show DEGUG logging')\n f.add_argument('--GPU', action='store_true', required=False, default=False,\n help='GPU requires to execute some commandes before')\n f.add_argument('--cache', action='store_true', required=False, default=False,\n help='Will use the cache')\n f.add_argument('--interactive', action='store_true', required=False, default=False,\n help='Interactive mode to check the dataframe')\n \n opt = parser.parse_args()\n\n if opt.split!=0 or opt.submit!='':\n if opt.scan!='' or opt.report:\n logging.critical('These parameters cannot be used together: ') \n logging.critical('\\t--scan --debug --verbose : to debug and check that all okay locally') \n logging.critical('\\t--submit --split 1 : to submit jobs to slurm if the previous okay') \n logging.critical('\\t--report : should be the last step in order to get the best model, plots, etc...')\n sys.exit(1)\n \n if opt.submit!='': # Need --output or --split arguments\n if opt.split==0 and len(opt.key)==0:\n logging.warning('In case of learning you forgot to specify --split')\n sys.exit(1)\n \n if opt.split!=0 and (opt.report or opt.key!='' or opt.scan!=''):\n logging.warning('Since you have specified a split, all the other arguments will be skipped')\n \n if opt.report and (opt.key!='' or opt.scan!=''):\n logging.warning('Since you have specified a scan report, all the other arguments will be skipped')\n \n if len(opt.key)!=0 and opt.key == '': \n logging.critical(f'--key is missing choices: {parameters.TTree}')\n sys.exit(1)\n \n if opt.generator:\n logging.info(\"Will use the generator\")\n \n if opt.resume:\n logging.info(\"Will resume the training of the model\")\n\n return opt","def RunJobs(self, runfile_mapping, server_run_map):\n if self.workflow is None:\n raise RuntimeError(\"Tried to create unnamed workflow!\")\n\n \n # Generate jobs for the first pass over the data\n for run in sorted(runfile_mapping.keys()):\n if self.VERBOSE>0:\n inputfiles=\"/%s/rawdata/volatile/%s/rawdata/Run%06d/hd_rawdata_*.evio\"%(HDRunFileRAIDList.GetRAIDDirFromRun(run,server_run_map),HDJobUtils.GetRunPeriodFromRun(run),run)\n\n # PASS 0\n print \"processing run %d, phase 0 ...\"%(int(run))\n\n # set up command to execute\n if self.nthreads:\n cmd += \" %s/scripts/%s %s %s %06d %03d %d\"%(self.basedir,\"job_wrapper_local.csh\",\"local_calib_pass0.csh\",self.basedir,run,inputfiles,int(self.nthreads))\n else:\n cmd += \" %s/scripts/%s %s %s %06d %03d\"%(self.basedir,\"job_wrapper_local.csh\",\"local_calib_pass0.csh\",self.basedir,run,inputfiles)\n\n # run command\n os.system(cmd)\n\n # PASS 1\n print \"processing run %d, phase 1 ...\"%(int(run))\n\n # set up command to execute\n if self.nthreads:\n cmd += \" %s/scripts/%s %s %s %06d %03d %d\"%(self.basedir,\"job_wrapper_local.csh\",\"local_calib_pass1.csh\",self.basedir,run,inputfiles,int(self.nthreads))\n else:\n cmd += \" %s/scripts/%s %s %s %06d %03d\"%(self.basedir,\"job_wrapper_local.csh\",\"local_calib_pass1.csh\",self.basedir,run,inputfiles)\n\n # run command\n os.system(cmd)","def execute_waypoint_sequence(detail_of_trip):\n\n # rets (route_line, line_points)\n sliced_route_and_line_points = chunk_user_route(detail_of_trip)\n\n sliced_route = sliced_route_and_line_points[0]\n line_points = sliced_route_and_line_points[1]\n\n # Interpolate/Break into 1/10 segments\n segmented_points = interpolate_points(sliced_route, line_points)\n waypoints = find_crime_areas(segmented_points)\n\n # print \"segmented_points\", json.dumps(segmented_points, indent=2)\n print \"\\n\\n\\n\\n\" # compensating for the giant GET request\n return waypoints","def test_cmdlineproc_test4():\n\n parameters = {\n \"debug\": False,\n \"disconnect\": False,\n \"executable\": \"\",\n \"executableargs\": \"\",\n \"hosts\": \"\",\n \"job\": \"\",\n \"jobname\": \"\",\n \"log\": \"\",\n \"recover\": \"\",\n \"resource\": \"\",\n \"replicates\": \"\",\n \"verbose\": False\n }\n\n commandlineargs = [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--replicates\", \"1000\", \"--disconnect\"]\n\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\n\n assert parameters[\"executable\"] == \"\"\n assert parameters[\"executableargs\"] == \"\"\n assert longbowargs == [\"--hosts\", \"hosts.file\", \"--jobname\", \"test\",\n \"--replicates\", \"1000\", \"--disconnect\"]","def parse_args(args):\n parser = argparse.ArgumentParser(\n description=\"Download SMAP data. Register at https://urs.earthdata.nasa.gov/ first.\"\n )\n parser.add_argument(\n \"localroot\", help='Root of local filesystem where the data is stored.')\n parser.add_argument(\n \"-s\",\n \"--start\",\n type=mkdate,\n help=(\n \"Startdate. Either in format YYYY-MM-DD or YYYY-MM-DDTHH:MM.\"\n \" If not given then the target folder is scanned for a start date.\"\n \" If no data is found there then the first available date of the product is used.\"\n ))\n parser.add_argument(\n \"-e\",\n \"--end\",\n type=mkdate,\n help=(\"Enddate. Either in format YYYY-MM-DD or YYYY-MM-DDTHH:MM.\"\n \" If not given then the current date is used.\"))\n parser.add_argument(\n \"--product\",\n type=str,\n default=\"SPL3SMP.008\",\n help='SMAP product to download. (default: SPL3SMP.008).'\n ' See also https://n5eil01u.ecs.nsidc.org/SMAP/ ')\n parser.add_argument(\n \"--filetypes\",\n nargs=\"*\",\n default=[\"h5\", \"nc\"],\n help=\"File types (extensions) to download. Files with\"\n \"other extensions are ignored. \"\n \"Default is equivalent to --filetypes h5 nc\")\n parser.add_argument(\"--username\", help='Username to use for download.')\n parser.add_argument(\"--password\", help='password to use for download.')\n parser.add_argument(\n \"--n_proc\",\n default=1,\n type=int,\n help='Number of parallel processes to use for downloading.')\n args = parser.parse_args(args)\n # set defaults that can not be handled by argparse\n\n if args.start is None or args.end is None:\n first, last = folder_get_first_last(args.localroot)\n if args.start is None:\n if last is None:\n args.start = get_start_date(args.product)\n else:\n args.start = last\n if args.end is None:\n args.end = datetime.now()\n\n args.urlroot = 'https://n5eil01u.ecs.nsidc.org'\n args.urlsubdirs = ['SMAP', args.product, '%Y.%m.%d']\n args.localsubdirs = ['%Y.%m.%d']\n\n print(\n f\"Downloading SMAP {args.product} data from {args.start.isoformat()} \"\n f\"to {args.end.isoformat()} into folder {args.localroot}.\")\n\n return args","def main(argv = sys.argv[1:]):\n\n parser = OptionParser(\"\"\"usage: %prog RESULT_DIR RUNNIGN_SCRIPT <optional parameters>\"\"\")\n\n # OPTIONAL\n group_opt = OptionGroup(parser, \"Optional parameters\",\n \"Defaults should normally be fine for these options in order to run batch\")\n group_opt.add_option(\"-r\", \"--repeats\",\n type=\"int\", default=50,\n help=\"\"\"number of repeats of each configuration\"\"\")\n group_opt.add_option(\"-a\", \"--args\",\n type=\"string\", default=\"//home//veredhi//EMIRGE_SMURF//cluster_summary.csv\",\n help=\"arguments csv path\")\n\n parser.add_option_group(group_opt)\n\n # ACTUALLY PARSE ARGS\n (options, args) = parser.parse_args(argv)\n\n # minimal sanity checking of input\n if len(args) != 2:\n parser.error(\n \"RESULT_DIR ans RUNNIGN_SCRIPT are required, and all options except should have a flag associated with them (options without flags: %s)\" % args)\n\n params_dict['HOME_PATH'] = os.path.join(os.path.abspath(args[0]), \"CONFIG_INDEX\")\n params_dict['REPEATS'] = str(options.repeats)\n\n args_path = os.path.abspath(options.args)\n params_dict['SCRIPT_PATH'] = os.path.abspath(args[1])\n\n args_df = pd.read_csv(args_path)\n\n for i in range(args_df.shape[0]):\n params_dict['CONFIG_INDEX'] = str(i)\n\n mkdir_if_not_exists(replace_in_string(params_dict['HOME_PATH'], params_dict))\n mkdir_if_not_exists(replace_in_string(params_dict['SLURM_OUTPUT_FOLDER'], params_dict))\n mkdir_if_not_exists(replace_in_string(params_dict['SBATCH_PATH'], params_dict))\n mkdir_if_not_exists(replace_in_string(params_dict['PYTHON_OUTPUT_FOLDER'], params_dict))\n mkdir_if_not_exists(replace_in_string(params_dict['TMP_FOLDER'], params_dict))\n\n row = args_df.iloc[i]\n params_dict[\"c_bases\"] = str(row['number of changed bases'])\n params_dict[\"c_references\"] = str(row['number of changed bacterias'])\n params_dict[\"mix_size\"] = str(row['mock_mixure_size'])\n params_dict[\"unique\"] = str(row['unique_bacteria_in_mixture'])\n\n for j in range(int(params_dict['REPEATS'])):\n\n index=str(j)\n test_name = \"test_\" + index\n\n params_dict[\"index\"] = index\n\n if os.path.isfile(os.path.join(replace_in_string(params_dict[\"PYTHON_OUTPUT_FOLDER\"], params_dict),\n test_name, \"emirge_smurf_WFalseSTrue.csv\")):\n continue\n\n params_dict[\"out_file\"] = index + '_out'\n params_dict[\"err_file\"] = index + '_err'\n\n sbatch_text = replace_in_string(SBATCH_TEMPLATE, params_dict)\n\n sbatch_file_path = os.path.join(replace_in_string(params_dict['SBATCH_PATH'], params_dict), test_name)\n with open(sbatch_file_path, 'w') as f:\n f.write(sbatch_text)\n\n command = 'sbatch \"{}\"'.format(sbatch_file_path)\n process = subprocess.Popen(command, shell=True, stdout=subprocess.PIPE)\n status = process.wait()\n while status is not 0:\n status = process.wait()\n print(\"Add {} {}\".format(i, test_name))","def parse_args():\n parser = argparse.ArgumentParser(description='use STAR for mapping reads')\n #input files\n parser.add_argument('-s', '--sequences',\n help='number of sequences to take for testing')\n parser.add_argument('--tmpdir',\n help='tmp directory',default=\"/tmp/\")\n parser.add_argument('--input_dir',\n help='optional: Choose input directory')\n parser.add_argument('--reads_R1',\n help='Forward unmerged reads')\n parser.add_argument('--reads_R2',\n help='Reverse unmerged reads')\n parser.add_argument('--merged',\n help='merged watson and crick fastq')\n parser.add_argument('--reference',\n help='reference clusters')\n parser.add_argument('--refgenome',\n help='reference clusters')\n parser.add_argument('--barcodes',\n help='Barcodes used in output')\n parser.add_argument('--species',\n help='Species: if selected only that species will be put in BAM RG header')\n parser.add_argument('--threads',\n help='Number of threads to used where multithreading is possible')\n parser.add_argument('--output_dir',\n help='Choose output directory')\n parser.add_argument('--extraflags',\n help='extra flags for testing')\n args = parser.parse_args()\n if args.input_dir:\n args.reads_R1 = os.path.join(args.input_dir,'Unassembled.R1.watson.fq.gz')\n args.reads_R2 = os.path.join(args.input_dir,'Unassembled.R2.crick.fq.gz')\n args.merged = os.path.join(args.input_dir,'Assembled.fq.gz')\n args.reference = os.path.join(args.input_dir,'consensus_cluster.renamed.fa')\n if args.output_dir:\n if not os.path.exists(args.output_dir):\n os.mkdir(args.output_dir)\n if 'log' not in args:\n args.log = os.path.join(args.output_dir,'mapping_variantcalling.log')\n args.watson_vcf = os.path.join(args.output_dir,'watson.vcf')\n args.crick_vcf = os.path.join(args.output_dir,'crick.vcf')\n args.snp_vcf = os.path.join(args.output_dir,'snp.vcf')\n args.methylation_vcf = os.path.join(args.output_dir,'methylation.vcf')\n args.heatmap = os.path.join(args.output_dir,'heatmap.igv')\n #2 bed files should be made for subsequent analysis using Rnbeads or other software\n args.mastermeth = os.path.join(args.output_dir,'methylation.bed')\n args.tmpdir = tempfile.mkdtemp(suffix='STAR', prefix='tmp', dir=args.tmpdir)\n return args","def main():\n args = load_args()\n\n perturbation_file = args.perturbation_file\n vm_params = load_yaml(args.vm_params_location)\n processes = args.n_processes\n verbose = args.verbose\n\n if args.perturbation:\n if args.model:\n perturbation_model = pd.read_csv(args.model)\n generate_velocity_model_perturbation_file_from_model(\n vm_params, perturbation_model, perturbation_file, processes, verbose\n )\n elif args.parameter_file:\n common_params, layer_params = load_parameter_file(args.parameter_file)\n generate_velocity_model_perturbation_file_from_config(\n common_params, layer_params, perturbation_file, processes, verbose\n )\n else:\n create_constant_vm_file(\n perturbation_file, vm_params[\"nx\"] * vm_params[\"ny\"] * vm_params[\"nz\"]\n )\n\n if args.fault_damage_zone:\n apply_fault_damage_zone(\n srf_location=args.srf_location,\n vm_params=vm_params,\n pert_f_location=perturbation_file,\n depth_km=args.depth_km,\n max_depth_km=args.max_depth_km,\n width_km=args.width_km,\n max_width_km=args.max_width_km,\n min_damage_velocity=args.max_velocity_drop,\n n_processes=processes,\n )","def main():\n parser = argparse.ArgumentParser(\n description=\"Returns back the entire solution graph.\")\n parser.add_argument(\"-M\", \"--master\", type=str, default=\"local[8]\",\n help=\"url of the master for this job\")\n parser.add_argument(\"-O\", \"--output\", type=str, default=\"solution-out\",\n help=\"name of the output file\")\n parser.add_argument(\"-H\", \"--height\", type=int, default=2,\n help=\"height of the puzzle\")\n parser.add_argument(\"-W\", \"--width\", type=int, default=2,\n help=\"width of the puzzle\")\n args = parser.parse_args()\n\n\n # open file for writing and create a writer function\n output_file = open(args.output, \"w\")\n writer = lambda line: output_file.write(line + \"\\n\")\n\n # call the puzzle solver\n solve_sliding_puzzle(args.master, writer, args.height, args.width)\n\n # close the output file\n output_file.close()","def exec_from_args(args):\n outfolder = args.folder + '/normal/'\n check(outfolder, 'm')\n\n makeconfig(str(args.gene_names), str(args.sequences), str(args.org_included),\n len_threshold=args.len_threshold,\n its=str(args.its), query_cover=str(args.query_cover), identity=str(args.identity),\n distance=str(args.string_distance), subsp=str(args.subsp), excluded=str(args.org_excluded),\n remote=str(args.remote_blast), folder=args.folder, date=args.today, blacklist=args.blacklist,\n synonyms=args.synonyms)\n\n r = Run('n', args.folder, args.debug)\n r.start()","def main(args):\n options = parse_cmd_parameters_(args)\n execute_(options)","def run_genomemap(args):\n genome_map(args)","def main(matrix,model,processors,algorithm):\n if algorithm == \"raxml-ng\":\n ab = subprocess.call(['which', 'raxml-ng'])\n if ab == 0:\n pass\n else:\n print(\"RAxML must be in your path as raxml-ng\")\n sys.exit()\n elif algorithm == \"raxml-HPC\":\n ab = subprocess.call(['which', 'raxmlHPC-PTHREADS-SSE3'])\n if ab == 0:\n pass\n else:\n print(\"RAxML must be in your path as raxmlHPC-PTHREADS-SSE3\")\n sys.exit()\n last=get_field_index(matrix)\n matrix_to_fasta(matrix, last)\n #Prep the creation of the FASTA file, removing odd characters\n os.system(\"sed 's/://g' all.fasta | sed 's/,//g' > out.fasta\")\n if model == \"ASC_GTRGAMMA\":\n subprocess.check_call(\"raxmlHPC-SSE3 -f d -p 12345 -m %s -s out.fasta -n nasp --asc-corr=lewis --no-bfgs > /dev/null 2>&1\" % model, stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\n subprocess.check_call(\"raxmlHPC-SSE3 -f e -m %s -s out.fasta -t RAxML_bestTree.nasp -n PARAMS --asc-corr=lewis --no-bfgs > /dev/null 2>&1\" % model, stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\n else:\n if algorithm == \"raxml-HPC\":\n subprocess.check_call(\"raxmlHPC-PTHREADS-SSE3 -T %s -f d -p 12345 -m %s -s out.fasta -n nasp --no-bfgs > /dev/null 2>&1\" % (processors,model), stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\n subprocess.check_call(\"raxmlHPC-PTHREADS-SSE3 -T %s -f e -m %s -s out.fasta -t RAxML_bestTree.nasp -n PARAMS --no-bfgs > /dev/null 2>&1\" % (processors,model), stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\n elif algorithm == \"raxml-ng\":\n subprocess.check_call(\"raxml-ng --msa out.fasta --model GTR+G --threads %s --prefix nasp\" % processors,stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\n if algorithm == \"raxml-HPC\":\n subprocess.check_call(\"mv RAxML_bestTree.nasp nasp_raxml.tree\", shell=True)\n subprocess.check_call(\"mv RAxML_binaryModelParameters.PARAMS nasp.PARAMS\", shell=True)\n subprocess.check_call(\"rm RAxML_* out.fasta all.fasta\", shell=True)\n else:\n subprocess.check_call(\"mv nasp.raxml.bestTree nasp_raxml.tree\", stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\n subprocess.check_call(\"rm nasp.raxml.startTree out.fasta all.fasta\", stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\n print(\"Model used: %s\" % model)","def __main__():\r\n\tparser = optparse.OptionParser()\r\n\tparser.add_option(\"-i\", \"--input\", default=None, dest=\"input\",\r\n\t\t\t\t\t help=\"The input bam file\")\r\n\tparser.add_option(\"-c\", \"--chromfile\", default=None, dest=\"chromfile\",\r\n\t\t\t\t\t help=\"The input list of chromosomes \")\r\n\tparser.add_option(\"-d\", \"--directory\", default=None, dest=\"directory\",\r\n\t\t\t\t\t\thelp=\"directory\")\r\n\tparser.add_option(\"-l\", \"--lane\", default=None, dest=\"lane\",\r\n\t\t\t\t\t\thelp=\"Lane\")\t\t\t\t \r\n\tparser.add_option(\"-o\", \"--output\", default=None, dest=\"output\",\r\n\t\t\t\t\t help=\"The output file\")\r\n\t(options, args) = parser.parse_args()\r\n\t\r\n\tif not options.input:\r\n\t\tparser.error(\"Need to specify the input file\")\r\n\tif not options.chromfile:\r\n\t\tparser.error(\"Need to specify the list of chromosomes file\")\r\n\tif not options.output:\r\n\t\tparser.error(\"Need to specify the output file\")\r\n\r\n\twith open(options.output, \"w\") as outfile:\r\n\t\twith open(options.chromfile, \"r\") as handle:\r\n\t\t\tfor line in handle:\r\n\t\t\t\tline = line.rstrip()\r\n\t\t\t\t#p = subprocess.run([\"echo %s\" % line], shell=True, check=True, stdout=subprocess.PIPE)\r\n\t\t\t\tp = subprocess.run([\"samtools depth -r %s %s/%s | sort -n -k 3 | tail -n 1\" % (line, options.directory, options.input)], shell=True, check=True, stdout=subprocess.PIPE)\r\n\t\t\t\toutfile.write(p.stdout.decode('utf-8').rstrip() + \"\\t%s\" % options.input + \"\\t%s\\n\" % options.lane)","def exec_ripser(data_path,output_path,max_dim,input_file='input.txt',format_file = 'lower-distance',threshold=None):\n ############# RIPSER ####################\n # high dimension\n ## execfile ripser (OUTPUT from ripser)\n start = timeit.default_timer() \n print 'input_file ',input_file\n input_file_full = os.path.join(data_path,input_file)\n output_file_full = os.path.join(output_path,'output_ripser.txt')\n\n if threshold is None:\n ripser_arguments = 'ripser --format %s --dim %i %s'%(format_file,max_dim,input_file_full)\n else:\n ripser_arguments = 'ripser --format %s --dim %i --threshold %f %s'%(format_file,max_dim,threshold,input_file_full)\n \n ripser_call(ripser_arguments.split(' '),output_file_full)\n #os.system(ripser_call) # OLD CALL BASED ON executable\n\n stop = timeit.default_timer()\n print 'Ripser execution time '\n print stop - start \n input_file_path = os.path.join(data_path,'input.txt')\n if(os.path.isfile(input_file_path)):\n os.remove(input_file_path) ## remove auxiliar file with lower matrix used as input for Ripser\n return()","def main_parse_args():\n parser = ArgumentParser()\n parser.add_argument('infile', help='path to the file to be mapped.It should\\\n contain one identifer on each line.')\n parser.add_argument('-rh', '--redis_host', default=DEFAULT_REDIS_URL,\n help='url of Redis db')\n parser.add_argument('-rp', '--redis_port', default=DEFAULT_REDIS_PORT,\n help='port for Redis db')\n parser.add_argument('-rps', '--redis_pass', default=DEFAULT_REDIS_PASS,\n help='password for Redis db')\n parser.add_argument('-of', '--outfile', default=None,\n help='path to the output file')\n parser.add_argument('-sh', '--source_hint', help='suggestion for ID source \\\n database used to resolve ambiguities in mapping',\n default=DEFAULT_HINT)\n parser.add_argument('-t', '--taxon', help='taxon id of species of all gene \\\n names', default=DEFAULT_TAXON)\n myargs = parser.parse_args()\n return myargs","def parse_arguments_for_single_machine():\n\n # setup command line parser and parse arguments\n parser = argparse.ArgumentParser()\n\n arg_help = 'the path of the point sprite data (positions and intensities)' \n parser.add_argument('--input-directory',\n action='store',\n dest='input_directory',\n help=arg_help)\n \n arg_help = 'the directory where the configuration files will be generated'\n parser.add_argument('--output-directory',\n action='store',\n dest='output_directory',\n help=arg_help)\n\n arg_help = 'the point sprite header file (meta data of the sprite)'\n parser.add_argument('--psh-file',\n action='store', default='NO_FILE_PROVIDED',\n dest='psh_file',\n help=arg_help)\n \n arg_help = 'the data configuration file for the circuit and the sensor'\n parser.add_argument('--data-config-file',\n action='store', default='NO_FILE_PROVIDED',\n dest='data_config_file',\n help=arg_help)\n\n arg_help = 'simulation method, direct-sprite, linear-sprite, ... '\n parser.add_argument('--simulation-method',\n action='store', default='direct-sprite',\n dest='simulation_method',\n help=arg_help)\n\n arg_help = 'the template pbrt sensor configuration file for sprite'\n parser.add_argument('--pbrt-sprite-sensor-config',\n action='store', default='NO_FILE_PROVIDED',\n dest='pbrt_sprite_sensor_config',\n help=arg_help)\n \n arg_help = 'the template pbrt sensor configuration file for volume'\n parser.add_argument('--pbrt-volume-sensor-config',\n action='store', default='NO_FILE_PROVIDED',\n dest='pbrt_volume_sensor_config',\n help=arg_help)\n\n arg_help = 'the path of the pbrt executable that will run the simulation'\n parser.add_argument('--pbrt-executable',\n action='store', default='pbrt', # installed\n dest='pbrt_executable',\n help=arg_help)\n\n arg_help = 'the path of the sprite volumeizer executable that will ' \\\n 'convert the sprite to a volume '\n parser.add_argument('--volumizer-executable',\n action='store', default='volumizesprite', # installed \n dest='volumizer_executable',\n help=arg_help)\n \n arg_help = 'the path of the spritebounds executable that will ' \\\n 'quicky extract the bounds of the sprite to get the sensor data'\n parser.add_argument('--sprite-bounds-executable',\n action='store', default='spritebounds', # installed \n dest='spritebounds_executable',\n help=arg_help)\n\n arg_help = 'resolution of the grid converted from the sprite'\n parser.add_argument('--grid-resolution',\n action='store', default='512',\n dest='grid_resolution',\n help=arg_help)\n\n arg_help = 'running node, cluster or local, cluster by default'\n parser.add_argument('--node',\n action='store', default='cluster',\n dest='node',\n help=arg_help)\n \n arg_help = 'the base (maximum) resolution of the sensor'\n parser.add_argument('--sensor-resolution',\n action='store', default='512', \n dest='sensor_resolution',\n help=arg_help)\n\n # parse the arguments\n args = parser.parse_args()\n \n return args","def run():\n import argparse\n parser = argparse.ArgumentParser(description=\"Create and solve mazes\")\n parser.add_argument(\"-c\", \"--cli\", help=\"Switch to CLI mode\", action='store_true')\n parser.add_argument(\"-f\", \"--file\", help=\"File to import map from\")\n parser.add_argument(\"-s\", \"--start\", help=\"Starting position in the maze\")\n parser.add_argument(\"-e\", \"--end\", help=\"Ending position in the maze\")\n args = parser.parse_args()\n if args.file:\n myfile = args.file\n else:\n myfile = 'map1.txt'\n with open(myfile, 'r') as mapfile:\n maze_str = mapfile.read()\n maze = Maze(maze_str, cli=args.cli, start=parse_seq(args.start), finish=parse_seq(args.end))\n maze.game_loop()","def _main():\n import argparse\n\n # Get command line arguments\n parser = argparse.ArgumentParser(description=\"This wrapper script will run \\\n a pickled Python function on \\\n some pickled retrieved data \\\n via 0MQ. You almost never \\\n want to run this yourself.\")\n parser.add_argument('home_address',\n help='IP address of submitting host.')\n parser.add_argument('module_dir',\n help='Directory that contains module containing pickled\\\n function. This will get added to PYTHONPATH \\\n temporarily.')\n args = parser.parse_args()\n\n # Make warnings from built-in warnings module get formatted more nicely\n logging.captureWarnings(True)\n logging.basicConfig(format=('%(asctime)s - %(name)s - %(levelname)s - ' +\n '%(message)s'), level=logging.INFO)\n logger = logging.getLogger(__name__)\n\n logger.info(\"Appended {0} to PYTHONPATH\".format(args.module_dir))\n sys.path.insert(0, args.module_dir)\n\n logger.debug(\"Job ID: %i\\tHome address: %s\\tModule dir: %s\",\n os.environ['JOB_ID'],\n args.home_address, args.module_dir)\n\n # Process the database and get job started\n _run_job(os.environ['JOB_ID'], args.home_address)","def test_cmdlineproc_test12():\n\n parameters = {\n \"debug\": False,\n \"disconnect\": False,\n \"executable\": \"\",\n \"executableargs\": \"\",\n \"hosts\": \"\",\n \"job\": \"\",\n \"jobname\": \"\",\n \"log\": \"\",\n \"recover\": \"\",\n \"resource\": \"\",\n \"replicates\": \"\",\n \"verbose\": False\n }\n\n commandlineargs = [\"--hosts\", \"hosts.file\", \"--bogus\", \"--jobname\", \"test\",\n \"--replicates\", \"1000\", \"--disconnect\", \"pmemd.MPI\",\n \"-O\", \"-i\", \"ex.in\", \"-c\", \"ex.min\", \"-p\", \"ex.top\",\n \"-o\", \"ex.out\"]\n\n with pytest.raises(exceptions.CommandlineargsError):\n\n _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)","def main(options):\n coords = []\n if options.verbose == True:\n print \"Reading sequences from coordinate file %s\" % (options.coords)\n try:\n corfile = gzip.open(options.coords, 'rb')\n except IOError:\n raise IOError('Cannot read from coordinate file %s' % (options.coords))\n\n for c in corfile:\n try:\n c = c.rstrip().split()\n coords.append([c[0], int(c[2]), int(c[3]), c[1]])\n except ValueError, e:\n raise ValueError(\"Wrong coordinates: %s\" % \" \".join(c))\n\n\n # Read mRNA sequences into hash table: {id:sequence}\n if options.verbose == True:\n print \"Reading sequences from mRNA file %s\" % (options.seq)\n try:\n seq_obj = open(options.seq, 'Ur')\n except IOError:\n raise IOError('Cannot read from mRNA file %s' % (options.seq))\n\n mRNAseqs = {}\n for seq in SeqIO.parse(seq_obj, 'fasta'):\n mRNAseqs[str(seq.id)] = str(seq.seq)\n\n\n # Open output file and write first lines\n try:\n outfile = gzip.open(options.out, 'wb')\n except IOError:\n raise IOError(\"Connot open output file %s\" % (options.out))\n # outfile.write('#siteID\\tdistToBoundary\\n')\n\n # Iterate through the binding coordinates to calculate their score\n if options.verbose == True:\n print \"Calculating average G content... \"\n for (mrnaid, lowerix, upperix, mirnas) in coords:\n if mrnaid in mRNAseqs:\n mrnasequ = mRNAseqs[mrnaid]\n score = calculate_distance_to_boundary(len(mrnasequ), lowerix)\n for mirna in mirnas.split(\",\"):\n outtext = '%s,%s,%i,%i\\t%s\\n' % (mrnaid,\n mirna,\n lowerix,\n upperix,\n score)\n outfile.write(outtext)\n else:\n for mirna in mirnas.split(\",\"):\n outtext = '%s,%s,%i,%i\\t%s\\n' % (mrnaid,\n mirna,\n lowerix,\n upperix,\n \"NA\")\n outfile.write(outtext)\n\n\n outfile.close()","def main(argv=None):\n\n if argv is None:\n argv = sys.argv[1:]\n\n parser = argparse.ArgumentParser(description=__description__)\n\n # Positionals\n parser.add_argument(\"fasta_file\",help=\"fasta file to be turned into kmers\")\n\n # Options\n parser.add_argument(\"-o\",\"--outbase\",help=\"base name for output files\",action=\"store\",type=str,default=None)\n parser.add_argument(\"-k\",\"--kmersize\",help=\"kmer size\",action=\"store\",type=int,default=12)\n parser.add_argument(\"-s\",\"--seqperfile\",help=\"number of sequences per output file\",action=\"store\",\n type=int,default=50000)\n parser.add_argument(\"-n\",\"--numkmers\",\n help=\"Number of kmers to make, starting from most to least common. If -1, make all possible.\",\n type=int,default=1000000)\n\n args = parser.parse_args(argv)\n\n if args.outbase is None:\n out_base = args.fasta_file\n else:\n out_base = args.outbase\n\n parse_proteome(args.fasta_file,kmer_size=args.kmersize,out_base=out_base,\n seq_per_file=args.seqperfile,num_to_write=args.numkmers)","def process_command_line():\n parser = argparse.ArgumentParser()\n parser.add_argument(\"srcDir\", type=str, help=\"Directory containing Unit Hydrograph grids to be aggregated\")\n parser.add_argument(\"gridFile\", type=str, help=\"Input netCDF target grid\")\n parser.add_argument(\"--remapDir\", type=str, help=\"Directory containing Output Unit Hydrograph grids\")\n parser.add_argument(\"--aggDir\", type=str, help=\"Directory where to store aggregated files (before remap)\")\n parser.add_argument(\"--inPrefix\", type=str, help=\"Input Unit Hydrograph File Prefix (default=UH_)\",default='UH_')\n parser.add_argument(\"--outPrefix\", type=str, help=\"Output Unit Hydrograph File Prefix (default=Agg_UH_)\", default=\"Agg_UH_\")\n parser.add_argument(\"--time\", type=str, help=\"Input Unit Hydrograph time variable name (default=time)\",default='time')\n parser.add_argument(\"--lon\", type=str, help=\"Input Unit Hydrograph longitude variable name (default=lon)\",default='lon')\n parser.add_argument(\"--lat\", type=str, help=\"Input Unit Hydrograph latitude variable name (default=lat)\",default='lat')\n parser.add_argument(\"--fraction\", type=str, help=\"Input Unit Hydrograph fraction variable name (default=fraction)\",default='fraction')\n parser.add_argument(\"--unit_hydrograph\",type=str, help=\"Input unit hydrograph variable name (default=unit_hydrograph)\",default='unit_hydrograph')\n parser.add_argument(\"--xc\", type=str, help=\"Input target grid longitude variable (default=xc)\",default='xc')\n parser.add_argument(\"--yc\", type=str, help=\"Input target grid latitude variable (default=yc)\",default='yc') \n parser.add_argument(\"--testAgg\",help=\"Do a test aggregation, where all inpoint points are aggregated into one file, remapping can be done afterwards using the --remap flag\",action=\"store_true\")\n parser.add_argument(\"--cdoDebug\",help=\"Enable CDO debuging (prings each step to screen)\",action=\"store_true\")\n parser.add_argument(\"--cdoForce\",help=\"Enable CDO force output (will overwrite existing files during remap)\",action=\"store_true\")\n parser.add_argument(\"--verbose\",help=\"Make script verbose\",action=\"store_true\")\n parser.add_argument(\"--remap\",help=\"Remap the aggregated Unit Hydrographs to outDir and put the aggregated files in the tempDir\",action='store_true')\n parser.add_argument(\"--agg\",help=\"Aggregate the input files onto the targetGrid (gridFile)\",action='store_true')\n parser.add_argument(\"--fill_value\",type=float,help=\"value to use as masked value (default=9.96920996839e+36)\",default = 9.96920996839e+36)\n parser.add_argument(\"--pad\",type=int,help=\"Set number of empty cells to include around each aggregated basin (default=10)\",default=10)\n parser.add_argument(\"--resolution\",type=float,help=\"Set resolution of input Unit Hydrographs (default=1/16.)\",default=1/16.)\n parser.add_argument(\"--clean\",help=\"Clean up aggregated Unit Hydrograph grids if remapping\", action='store_true')\n parser.add_argument(\"--dryrun\",help=\"Do the mapping between the source and target grid based on the files in the input directory, return the performance stats for the run\", action='store_true')\n args = parser.parse_args()\n\n options = {}\n paths = {}\n # parse the basics\n Rvars = (args.time,args.lon,args.lat,args.fraction,args.unit_hydrograph)\n Cvars = (args.yc,args.xc)\n paths['srcDir'] = args.srcDir\n paths['gridFile'] = args.gridFile\n\n if args.aggDir:\n paths['aggDir'] = args.aggDir\n else:\n paths['aggDir'] = os.path.join(paths['srcDir'],'../aggregated/')\n if not os.path.exists(paths['aggDir']):\n os.makedirs(paths['aggDir'])\n\n options['verbose'] = args.verbose\n options['fill_value'] = args.fill_value\n options['pad'] = args.pad\n options['resolution'] = args.resolution\n options['inPrefix'] = args.inPrefix\n options['outPrefix'] = args.outPrefix\n options['dryrun'] = args.dryrun\n options['testAgg'] = args.testAgg\n options['clean']=args.clean\n options['remap']=args.remap\n options['agg']=args.agg\n \n if options['remap']:\n cdo.debug=args.cdoDebug\n cdo.forceOutput=args.cdoForce\n if args.remapDir:\n paths['remapDir'] = args.remapDir\n else:\n paths['remapDir'] = os.path.join(paths['srcDir'],'../remaped/')\n if not os.path.exists(paths['remapDir']):\n os.makedirs(paths['remapDir'])\n print paths['remapDir'] \n\n return Rvars,Cvars,paths,options","def main(argv=None):\n\n if argv is None:\n argv = sys.argv\n\n # setup command line parser\n parser = E.ArgumentParser(description=__doc__)\n\n parser.add_argument(\"--ID-file\", dest=\"ID_file\", type=str,\n help=\"Supply txt file with Sample Name assigned to Sequencing Number\")\n\n parser.add_argument(\"--Infile-dir\", dest=\"Infile_Dir\", type=str,\n help=\"Supply path to files to be moved\")\n\n parser.add_argument(\"--Outfile-ID-1\", dest=\"Outfile1_ID\", type=str,\n help=\"Supply identifier that can be used to move file to a particular directory e.g. CMS\")\n\n parser.add_argument(\"--Outfile-ID-2\", dest=\"Outfile2_ID\", type=str,\n help=\"Supply identifier within file name that can be used to move file to a particular directory e.g. GFU\")\n\n parser.add_argument(\"--Outfile-dir-1\", dest=\"Outfile1_Dir\", type=str,\n help=\"Supply desired directory for file containing identifier given in --Outfile-ID-1\")\n\n parser.add_argument(\"--Outfile-dir-2\", dest=\"Outfile2_Dir\", type=str,\n help=\"Supply desired directory for file containing identifier given in --Outfile-ID-2\")\n\n \n # add common options (-h/--help, ...) and parse command line\n (args) = E.start(parser, argv=argv)\n\n ###############################################\n ###############################################\n ############## Execute Functions ##############\n ###############################################\n ###############################################\n\n\n IDDict = CreateIDDict(args.ID_file)\n Shuttle(IDDict, args.Infile_Dir, args.Outfile1_ID, args.Outfile2_ID, args.Outfile1_Dir, args.Outfile2_Dir)\n \n \n # write footer and output benchmark information.\n E.stop()","def main():\n sys.argv.pop(0)\n (cmd, var, args) = process_options(sys.argv[:])\n execute(cmd, var, args)","def main():\n parser = argparse.ArgumentParser(description=main.__doc__,\n formatter_class=argparse.RawTextHelpFormatter)\n\n parser.add_argument('-1',\n dest='r1',\n help='Path to first fasta file.')\n\n parser.add_argument('-2',\n dest='r2',\n help='Path to paired fasta file.')\n\n args = parser.parse_args()\n salmon(args.r1, args.r2)","def process_command_line(argv):\n\tif argv is None:\n\t\targv = sys.argv[1:]\n\t\t\n\t# initialize the parser object:\n\tparser = optparse.OptionParser(\n\t\t\t formatter=optparse.TitledHelpFormatter(width=78),\n\t\t\t add_help_option=None)\n\n\t# define options here:\n\n\tparser.add_option(\n\t\t'-w', '--workdir',\n\t\thelp='Workdir where temporary and final files will be saved.')\n\n\tparser.add_option(\n\t\t'-a', '--assembly_file',\n\t\thelp='File with a list of assemblies for which a reference genome is to be determined.')\n\n\tparser.add_option(\n \t'--installation',\n \thelp='Pipeline installation.')\n\n parser.add_option(\n '--EDIRECT',\n help='edirect tools installation.')\n\n parser.add_option(\n '--QUAST',\n help='Quast installation.')\n\n parser.add_option(\n '--mail',\n help='Email for edirect.')\n\n\tparser.add_option(\n\t\t'-o', '--organism',\n\t\thelp='Organism to be searched for on NCBI Assembly.')\n\n\tparser.add_option(\n\t\t'--dont_delete', action=\"store_true\",\n\t\thelp='Do not delete temporary files after running.')\n\t\t\n\tparser.add_option(\n\t\t'-s', '--script', default=\"/home/users/yair/Documents/PhD_projects/project_B/bin/downloading_database/determine_best_genome.sh\",\n\t\thelp='Path of determine_best_genome.sh script')\n\n\tparser.add_option( # customized description; put --help last\n\t\t'-h', '--help', action='help',\n\t\thelp='Show this help message and exit.')\n\n\tsettings, args = parser.parse_args(argv)\n\n\treturn settings, args","def main():\n run_simulation(spectral=False, ml=False, num_procs=1)\n run_simulation(spectral=True, ml=False, num_procs=1)\n run_simulation(spectral=False, ml=True, num_procs=1)\n run_simulation(spectral=True, ml=True, num_procs=1)\n run_simulation(spectral=False, ml=True, num_procs=10)\n run_simulation(spectral=True, ml=True, num_procs=10)","def main():\n args = _parse_arguments()\n\n util.log_init(\"sitl_A%s_%s.txt\" % (args.id, util.get_latest_log(\"latest_sitl.txt\")), util.log_level[args.level])\n\n shared.AGENT_ID = 'A%s' % args.id\n shared.AGENT_COUNT = args.n\n shared.CURRENT_ALGORITHM = args.algorithm\n shared.AGENT_CHARACTER = args.character\n shared.des_alt = args.alt\n \n util.log_info(\"AGENT_ID = %s\" % shared.AGENT_ID)\n util.log_info(\"Algorithm: %s\" % shared.CURRENT_ALGORITHM)\n util.log_info(\"Agent type: %s\" % shared.AGENT_CHARACTER)\n\n print \"Start simulator (SITL)\"\n sitl = SITL(args.pix) # initialize SITL with firmware path\n\n if shared.AGENT_ID in start_loc:\n sitl_args = ['--home=%s' % start_loc[shared.AGENT_ID]]\n else:\n sitl_args = ['--home=%s' % start_loc['FFF']]\n \n # Pre-recorded coordinates.\n #sitl_args = ['-I0', '--model', 'quad', '--home=31.301201,121.498192,9,353']\t\n sitl.launch(sitl_args, await_ready=True, restart=True)\n\n # Connect to the vehicle. (Spawn an instance of Vehicle named \"vehicle\")\n # connection port is coded in the file name of the firmware like \"ac3.4.5_port5760\"\n # use regular expression to search the string and extract port number\n port = re.search(r'port\\d{4}', args.pix)\n port = re.search(r'\\d{4}', port.group()).group()\n\n print \"Connecting to copter on: TCP: 127.0.0.1:%s\" % port\n copter = nav.connect('tcp:127.0.0.1:%s' % port, wait_ready=True, rate=20)\n util.log_info(\"Copter connected. Firmware: %s\" % copter.version)\n \n if not args.xbee: # simulate XBee using ZeroMQ\n [pub, sub] = comm.zmq_init(comm_port_list[shared.AGENT_ID], comm_port_list)\n subscriber_thread = comm.Subscriber(shared.AGENT_ID, sub)\n subscriber_thread.start()\n xbee = pub # make xbee the publisher\n util.log_info(\"ZeroMQ initialzied.\") \n \n else: # use actual xbee ports\n ser = serial.Serial(args.xbee, 57600)\n xbee = comm.xbee_init(ser)\n util.log_info(\"Xbee initialzed.\")\n\n info = \"IFO,%s connected with firmware %s\" % (shared.AGENT_ID, copter.version)\n comm.xbee_broadcast(xbee, info)\n\n _add_listeners(copter)\n\n takeoff_thread = nav.Takeoff(copter, xbee, shared.des_alt, 3)\n purge_thread = comm.Purge(shared.neighbors)\n broadcast_thread = comm.Broadcast(shared.AGENT_ID, copter, xbee)\n flocking_thread = _choose_algorithm(copter, xbee, shared.neighbors)\n\n takeoff_thread.start()\n takeoff_thread.join() # wait until takeoff procedure completed\n\n if shared.status['airborne']: # only execute the threads when airborne\n util.log_info(\"Copter is airborne, starting threads.\")\n broadcast_thread.start()\n purge_thread.start()\n flocking_thread.start()\n\n # main loop\n while True:\n try: time.sleep(.2)\n except KeyboardInterrupt: break\n \n if shared.status['airborne']:\n # echo exiting status\n if shared.status['exiting']:\n info = \"IFO,%s %s-ing.\" % (shared.AGENT_ID,shared.status['command'])\n comm.xbee_broadcast(xbee, info)\n util.log_info(info)\n\n # if an rtl or land command is received, kill flocking and set the `exiting` flag\n elif shared.status['command'] == 'RTL' or shared.status['command'] == 'LAND':\n shared.status['thread_flag'] |= shared.FLOCKING_FLAG\n nav.set_mode(copter, shared.status['command'])\n shared.status['exiting'] = True\n\n if not flocking_thread.is_alive(): # break the loop if finished\n break\n\n nav.wait_for_disarm(copter) # wait for disarm\n comm.xbee_broadcast(xbee, 'IFO,%s terminated.' % shared.AGENT_ID)\n\n # clean up\n purge_thread.stop()\n while purge_thread.is_alive(): \n util.log_info('Waiting for purge to shutdown') \n purge_thread.join(3)\n util.log_info('Purge killed.')\n\n broadcast_thread.stop()\n while broadcast_thread.is_alive(): \n util.log_info('Waiting for broadcast to shutdown') \n broadcast_thread.join(3)\n util.log_info('Broadcast killed.')\n\n copter.close()\n util.log_info(\"Copter shutdown.\")\n\n if args.xbee:\n xbee.halt()\n ser.close()\n util.log_info(\"Xbee and serial closed.\")\n else:\n subscriber_thread.stop()\n while subscriber_thread.is_alive(): \n util.log_info('Waiting for Subscriber to shutdown') \n subscriber_thread.join(3)\n util.log_info('Subscriber killed.')\n\n sitl.stop()\n util.log_info(\"SITL shutdown.\")","def ParseArguments():\n\t#TODO: check input variable types!\n\t# check for integers ans strings\n\t# check for distance and distance cutoff value: ONLY CERTAIN VALUES ALLOWED\n\targ_parser = argparse.ArgumentParser(description=\"Program to get background distribution matching user input SNPs on the following parameters {MAF, distance to nearest gene, gene density}\")\n\tsubparsers = arg_parser.add_subparsers(dest='subcommand',\n\t\t\t\t\t\t\t\t\t title='subcommands in this script',\n\t\t\t\t\t\t\t\t\t description='valid subcommands. set subcommand after main program required arguments',\n\t\t\t\t\t\t\t\t\t help='You can get additional help by writing <program-name> <subcommand> --help')\n\n\t## Subparsers\n\targ_parser_annotate = subparsers.add_parser('annotate')\n\t#arg_parser_annotate.set_defaults(func=run_annotate)\n\targ_parser_match = subparsers.add_parser('match')\n\t#arg_parser_annotate.set_defaults(func=run_match)\n\n\n\targ_parser.add_argument(\"--user_snps_file\", help=\"Path to file with user-defined SNPs\", required=True) # TODO: make the program read from STDIN via '-'\n\targ_parser.add_argument(\"--output_dir\", help=\"Directory in which output files, i.e. random SNPs will be written\", required=True)\n\t#arg_parser.add_argument(\"--output_dir\", type=ArgparseAdditionalUtils.check_if_writable, help=\"Directory in which output files, i.e. random SNPs will be written\", required=True)\n\targ_parser.add_argument(\"--distance_type\", help=\"ld or kb\", required=True)\n\targ_parser.add_argument(\"--distance_cutoff\", help=\"r2, or kb distance\", required=True)\n\t# NEW: options\n\t#arg_parser.add_argument(\"--status_file\", help=\"Bool (switch, takes no value after argument); if set then logging is ENABLED.\", action='store_true')\n\t#arg_parser.add_argument(\"--status_file\", help=\"If set, a json file will be written. Value should be the a filepath.\")\n\targ_parser.add_argument(\"--web\", help=\"If set, the program will run in web mode. VALUE should be the a filepath to output (temporary) file - usually this will be the session_id. The web mode activates: 1) creating a status_obj and writing it to json file; 2) ENABLE writing a json report file;\")\n\targ_parser.add_argument(\"--NoLogger\", help=\"Bool (switch, takes no value after argument); if set then logging is DISAPLED. Logfile will be placed in outputdir.\", action='store_true')\n\n\n\t### MATCH arguments\n\targ_parser_match.add_argument(\"--N_sample_sets\", type=int, help=\"Number of matched SNPs to retrieve\", required=True) # 1000 - \"Permutations?\" TODO: change name to --n_random_snp_sets or --N\n\t#TODO: add argument that describes if ABSOLUTE of PERCENTAGE deviation should be used\n\targ_parser_match.add_argument(\"--max_freq_deviation\", type=int,help=\"Maximal deviation of SNP MAF bin [MAF +/- deviation]\", default=5) # 5\n\targ_parser_match.add_argument(\"--max_distance_deviation\", type=int, help=\"Maximal PERCENTAGE POINT deviation of distance to nearest gene [distance +/- %%deviation])\", default=5) # 20000\n\t#TODO: CHECK THAT max_distance_deviation > 1 %\n\t#TODO: WHY IS max_genes_count_deviation type float!!!!????\n\targ_parser_match.add_argument(\"--max_genes_count_deviation\", type=float, help=\"Maximal PERCENTAGE POINT deviation of genes in locus [gene_density +/- %%deviation]\", default=5) # 0.2\n\targ_parser_match.add_argument(\"--set_file\", help=\"Bool (switch, takes no value after argument); if set then write out set files to rand_set..gz. Default is false\", action='store_true')\n\n\targs = arg_parser.parse_args()\n\n\treturn args","def test_cmdlineproc_test1():\n\n parameters = {\n \"debug\": False,\n \"disconnect\": False,\n \"executable\": \"\",\n \"executableargs\": \"\",\n \"hosts\": \"\",\n \"job\": \"\",\n \"jobname\": \"\",\n \"log\": \"\",\n \"recover\": \"\",\n \"resource\": \"\",\n \"replicates\": \"\",\n \"verbose\": False\n }\n\n commandlineargs = []\n\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\n\n assert parameters[\"executable\"] == \"\"\n assert parameters[\"executableargs\"] == \"\"\n assert longbowargs == []","def main():\r\n # Instantiate the data problem.\r\n data = create_data_model()\r\n\r\n # Create the routing index manager.\r\n manager = pywrapcp.RoutingIndexManager(len(data['distance_matrix']), data['num_vehicles'], data['depot'])\r\n\r\n # Create Routing Model.\r\n routing = pywrapcp.RoutingModel(manager)\r\n\r\n\r\n # Create and register a transit callback.\r\n def distance_callback(from_index, to_index):\r\n \"\"\"Returns the distance between the two nodes.\"\"\"\r\n # Convert from routing variable Index to distance matrix NodeIndex.\r\n from_node = manager.IndexToNode(from_index)\r\n to_node = manager.IndexToNode(to_index)\r\n return data['distance_matrix'][from_node][to_node]\r\n\r\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\r\n\r\n # Define cost of each arc.\r\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\r\n\r\n\r\n # Add Capacity constraint.\r\n def demand_callback(from_index):\r\n \"\"\"Returns the demand of the node.\"\"\"\r\n # Convert from routing variable Index to demands NodeIndex.\r\n from_node = manager.IndexToNode(from_index)\r\n return data['demands'][from_node]\r\n\r\n demand_callback_index = routing.RegisterUnaryTransitCallback(\r\n demand_callback)\r\n routing.AddDimensionWithVehicleCapacity(\r\n demand_callback_index,\r\n 0, # null capacity slack\r\n data['vehicle_capacities'], # vehicle maximum capacities\r\n True, # start cumul to zero\r\n 'Capacity')\r\n\r\n # Setting first solution heuristic.\r\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\r\n search_parameters.first_solution_strategy = (\r\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\r\n\r\n\r\n # Solve the problem.\r\n assignment = routing.SolveWithParameters(search_parameters)\r\n\r\n # Print solution on console.\r\n if assignment:\r\n print_solution(data, manager, routing, assignment)","def runTriplexator(args):\n global TRIPLEXATOR_LIBRARY_ENV\n triplex_lib_path = os.environ.get(TRIPLEXATOR_LIBRARY_ENV)\n\n if os.environ.get(TRIPLEXATOR_LIBRARY_ENV) is None:\n print \"Please set the environment variable for the Triplexator library (\" + TRIPLEXATOR_LIBRARY_ENV + \").\"\n else:\n triplex_lib = cdll.LoadLibrary(triplex_lib_path)\n arg_strings = args.split(' ')\n arg_ptr = (c_char_p * (len(arg_strings) + 1))()\n\n arg_ptr[0] = \"triplexator\" # to simulate calling from cmd line\n for i, s in enumerate(arg_strings):\n arg_ptr[i + 1] = s\n\n triplex_lib.pyTriplexator(len(arg_strings) + 1, arg_ptr)","def main():\n utl.calibrate(False)\n undistort(False)\n edge_detect(False)\n transform(False)\n identify_line(False)\n lane_line(True)","def system_parallel(cmdL, nproc=None, verbose=True):\n if nproc is None:\n nproc = multiprocessing.cpu_count()\n sh_filename = '_run_parallel_' + hashlib.md5('\\n'.join(cmdL).encode('utf-8')).hexdigest()\n with open(sh_filename, 'wt') as f:\n f.write('\\n'.join(cmdL))\n out = subprocess.check_output('parallel -j%d %s--keep-order < %s' % (nproc, '--verbose ' if verbose else '', sh_filename), shell=True)\n out = out.decode('utf-8')\n if verbose:\n print('-'*80)\n print('system_parallel output:')\n print('-'*80)\n print(out)\n os.remove(sh_filename)\n return out","def parse_arguments():\n\n info = 'Divides pdb info files for parallelization'\n parser = argparse.ArgumentParser(description=info)\n\n # program arguments\n parser.add_argument('-f', '--in-file',\n type=str,\n required=True,\n help='PDB info file to divide')\n parser.add_argument('-n', '--num-splits',\n default=1000,\n type=int,\n help='Number of splits to perform (Default: 1000)')\n parser.add_argument('-m', '--mut-file',\n type=str,\n required=True,\n help='File containing mutation information')\n parser.add_argument('--split-dir',\n default = \"../data/split_pdbs/\",\n type=str,\n help='Output directory for split PDB info files')\n\n args = parser.parse_args()\n opts = vars(args)\n return opts","def main():\r\n\r\n option_parser, opts, args = parse_command_line_parameters(**script_info)\r\n\r\n # additional option checks\r\n if opts.chimera_detection_method == 'blast_fragments':\r\n if not (opts.blast_db or opts.reference_seqs_fp):\r\n option_parser.error('Must provide either --blast_db or' +\r\n ' --reference_seqs_fp and --id_to_taxonomy_fp when' +\r\n ' method is blast_fragments.')\r\n if not opts.id_to_taxonomy_fp:\r\n option_parser.error('Must provide --id_to_taxonomy_fp when method' +\r\n ' is blast_fragments.')\r\n if opts.num_fragments < 2:\r\n option_parser.error('Invalid number of fragments (-n %d) Must be >= 2.'\r\n % opts.num_fragments)\r\n elif opts.chimera_detection_method == 'ChimeraSlayer':\r\n if not opts.aligned_reference_seqs_fp:\r\n option_parser.error(\"Must provide --aligned_reference_seqs_fp \"\r\n \"when using method ChimeraSlayer\")\r\n elif opts.chimera_detection_method == 'usearch61':\r\n if opts.suppress_usearch61_ref and opts.suppress_usearch61_denovo:\r\n option_parser.error(\"Supressing both de novo and reference \"\r\n \"chimera detection not allowed.\")\r\n if not opts.reference_seqs_fp and not opts.suppress_usearch61_ref:\r\n option_parser.error(\"--reference_seqs_fp required for reference \"\r\n \"based chimera detection, suppress reference based chimera \"\r\n \"detection with --suppress_usearch61_ref\")\r\n if opts.reference_seqs_fp:\r\n try:\r\n temp_f = open(opts.reference_seqs_fp, \"U\")\r\n temp_f.close()\r\n except IOError:\r\n raise IOError(\"Unable to open --reference_seqs_fp, please \"\r\n \"check filepath and permissions.\")\r\n if opts.non_chimeras_retention not in ['intersection', 'union']:\r\n option_parser.error(\"--non_chimeras_retention must be either \"\r\n \"'union' or 'intersection'\")\r\n if opts.usearch61_xn <= 1:\r\n option_parser.error(\"--usearch61_xn must be > 1\")\r\n if opts.usearch61_dn <= 0:\r\n option_parser.error(\"--usearch61_dn must be > 0\")\r\n if opts.usearch61_mindiffs <= 0:\r\n option_parser.error(\"--usearch61_mindiffs must be > 0\")\r\n if opts.usearch61_mindiv <= 0:\r\n option_parser.error(\"--usearch61_mindiv must be > 0\")\r\n if opts.usearch61_abundance_skew <= 0:\r\n option_parser.error(\"--usearch61_abundance_skew must be > 0\")\r\n\r\n verbose = opts.verbose # not used yet ...\r\n input_seqs_fp = opts.input_fasta_fp\r\n id_to_taxonomy_fp = opts.id_to_taxonomy_fp\r\n reference_seqs_fp = opts.reference_seqs_fp\r\n chimera_detection_method = opts.chimera_detection_method\r\n num_fragments = opts.num_fragments\r\n output_fp = opts.output_fp\r\n taxonomy_depth = opts.taxonomy_depth\r\n max_e_value = opts.max_e_value\r\n blast_db = opts.blast_db\r\n keep_intermediates = opts.keep_intermediates\r\n threads = opts.threads\r\n\r\n # calculate threads as 1 per CPU, or use float of input value\r\n if threads == 'one_per_cpu':\r\n threads = float(1 / cpu_count())\r\n else:\r\n # Make sure input is a float\r\n try:\r\n threads = float(threads)\r\n except ValueError:\r\n option_parser.error(\"--threads must be a float value if \"\r\n \"default 'one_per_cpu' value overridden.\")\r\n\r\n if not output_fp:\r\n if chimera_detection_method == \"usearch61\":\r\n output_dir = \"usearch61_chimeras/\"\r\n create_dir(output_dir, fail_on_exist=False)\r\n else:\r\n input_basename = splitext(split(input_seqs_fp)[1])[0]\r\n output_fp = '%s_chimeric.txt' % input_basename\r\n elif chimera_detection_method == \"usearch61\":\r\n output_dir = output_fp\r\n create_dir(output_dir, fail_on_exist=False)\r\n\r\n if chimera_detection_method == 'blast_fragments':\r\n blast_fragments_identify_chimeras(input_seqs_fp,\r\n id_to_taxonomy_fp,\r\n reference_seqs_fp, blast_db=blast_db,\r\n num_fragments=opts.num_fragments,\r\n max_e_value=max_e_value,\r\n output_fp=output_fp,\r\n taxonomy_depth=taxonomy_depth)\r\n elif chimera_detection_method == 'ChimeraSlayer':\r\n chimeraSlayer_identify_chimeras(input_seqs_fp,\r\n output_fp=output_fp,\r\n db_FASTA_fp=opts.reference_seqs_fp,\r\n db_NAST_fp=opts.aligned_reference_seqs_fp,\r\n min_div_ratio=opts.min_div_ratio,\r\n keep_intermediates=keep_intermediates)\r\n elif chimera_detection_method == 'usearch61':\r\n usearch61_chimera_check(input_seqs_fp,\r\n output_dir=output_dir,\r\n reference_seqs_fp=reference_seqs_fp,\r\n suppress_usearch61_intermediates=opts.suppress_usearch61_intermediates,\r\n suppress_usearch61_ref=opts.suppress_usearch61_ref,\r\n suppress_usearch61_denovo=opts.suppress_usearch61_denovo,\r\n split_by_sampleid=opts.split_by_sampleid,\r\n non_chimeras_retention=opts.non_chimeras_retention,\r\n usearch61_minh=opts.usearch61_minh,\r\n usearch61_xn=opts.usearch61_xn,\r\n usearch61_dn=opts.usearch61_dn,\r\n usearch61_mindiffs=opts.usearch61_mindiffs,\r\n usearch61_mindiv=opts.usearch61_mindiv,\r\n usearch61_abundance_skew=opts.usearch61_abundance_skew,\r\n percent_id_usearch61=opts.percent_id_usearch61,\r\n minlen=opts.minlen,\r\n word_length=opts.word_length,\r\n max_accepts=opts.max_accepts,\r\n max_rejects=opts.max_rejects,\r\n verbose=opts.verbose,\r\n threads=threads)","def ProcessCommandLine():\n\tparser = argparse.ArgumentParser(description=__doc__.strip())\n\n\tparser.add_argument('--calibrate', action='store_true', default=False,\n help='Create pixel position calibration using camera')\n\tparser.add_argument('--calibrate-rgb', metavar='R,G,B', type=str, default='50,50,50',\n help='Calibration RGB value 0-255,0-255,0-255')\n \tparser.add_argument('--calibration-name', metavar='FILENAME', type=str, default=None,\n help='Pixel calibration name to create/read')\n\tparser.add_argument('--plot', action='store_true', default=False,\n help='Plot the calibration')\n\tparser.add_argument('--clear', action='store_true', default=False,\n help='Switch of all pixels')\n\tparser.add_argument('--debug', action='store_true', default=False,\n\t\t\t help='Print back trace in event of exception')\n\n\n\treturn parser.parse_args()","def main():\n\n parser = argparse.ArgumentParser()\n\n parser.add_argument(\"-hgt\", \"--imgHeight\", help=\"The height of the images, default=720.\",\n type=int, default=720)\n\n parser.add_argument(\"-wd\", \"--imgWidth\", help=\"The width of the images, default=1280.\",\n type=int, default=1280)\n\n parser.add_argument(\"-r\", \"--chessboardRows\", help=\"The rows of the chessboard calibration images, default=6.\",\n type=int, default=6)\n\n parser.add_argument(\"-c\", \"--chessboardCols\", help=\"The cols of the chessboard calibration images, default=9.\",\n type=int, default=9)\n\n parser.add_argument(\"-cp\", \"--calibrationPath\", help=\"The height of the images, default=720.\",\n type=str, default='')\n\n parser.add_argument(\"-in\", \"--inputVideoPath\", help=\"The path to the input video to be processed.\",\n type=str, default='')\n\n parser.add_argument(\"-out\", \"--outputVideoPath\", help=\"The path to the where to store output video.\",\n type=str, default='')\n\n args = parser.parse_args()\n\n print(args)\n\n assert args.calibrationPath != '', \"The path to calibration images can't be empty\"\n assert args.inputVideoPath != '', \"The path to input video can't be empty\"\n assert args.outputVideoPath != '', \"The path to output video can't be empty\"\n\n camera_mtx, dist_coeff = CameraCalibration((args.imgHeight, args.imgWidth),\n (args.chessboardRows, args.chessboardCols),\n args.calibrationPath).calibrate()\n print(\"Camera Mtx\", camera_mtx)\n print(\"Distortion Coefficient\", dist_coeff)\n # img = cv2.imread('test_images/test5.jpg')\n # img = cv2.cvtColor(img, cv2.COLOR_BGR2RGB)\n\n AdvancedLaneDetection(args.inputVideoPath, camera_mtx, dist_coeff).process_video(args.outputVideoPath)\n\n # cv2.imwrite(\"output.jpg\", result)","def main(target_clusters, clusters_per_lane, project_id, dest_plate_list, allow_non_dupl_struct): \n couch = connection()\n structure = proj_struct(couch, project_id, target_clusters)\n [lane_maps, clusters_rem, clusters_expr] = parse_indata(structure, target_clusters)\n if allow_non_dupl_struct:\n aggregator(lane_maps,clusters_rem,clusters_per_lane)\n else:\n simple_unique_set(lane_maps)\n [ideal_ratios, req_lanes, total_lanes] = sample_distributor(lane_maps, clusters_rem, clusters_per_lane)\n acc_ratios = correct_numbers(lane_maps, clusters_expr, ideal_ratios, req_lanes, total_lanes)\n generate_output(project_id, dest_plate_list, total_lanes, req_lanes, lane_maps, acc_ratios)","def run_lammps(lammps_executable, input_file, output_file):\n # run lammps\n lammps_command = f\"{lammps_executable} -in {input_file} \"\n print(\"run command:\", lammps_command)\n with open(\"tmp2False.out\", \"w+\") as fout:\n subprocess.call(lammps_command.split(), stdout=fout)","def main():\n # get arguments from command line\n args = parse_arguments()\n\n # checks on the output file\n # if args.stats_only:\n # assert args.output, \"The output file was not provided\"\n if args.output and os.path.exists(args.output):\n warnings.warn(\"Overwriting task file \" + args.output, UserWarning)\n os.remove(args.output)\n\n # initialize the task\n task = Task(\n args.database, args.on,\n across=args.across,\n by=args.by,\n filters=args.filters,\n regressors=args.regressors,\n verbose=args.verbose)\n\n if args.stats_only:\n task.print_stats()\n else:\n if args.tempdir and not os.path.exists(args.tempdir):\n os.makedirs(args.tempdir)\n\n # generate triplets and unique pairs\n task.generate_triplets(\n output=args.output,\n threshold=args.threshold,\n tmpdir=args.tempdir,\n seed=args.seed)","def main():\n arg_parser = argparse.ArgumentParser(description=\"\"\"\n This utility will take a SAM alignment file from paired end reads \n and filter the original read FASTQ files do those reads without\n high-likelihood alignments to human.\n For gzipped alignments, consider using pipes: \n gunzip -c ref.fna.gz | strip_mt_ebv.py | gzip > ref.nomtebv.fna.gz\n \"\"\")\n\n arg_parser.add_argument(\n '--alnfile', '-A',\n type=argparse.FileType('r'),\n help='Alignment File. Can be stdin. For gzip, consider pipes',\n default=sys.stdin\n )\n arg_parser.add_argument(\n '--r1in', '-1',\n required=True,\n help='Input fastq file for R1'\n )\n arg_parser.add_argument(\n '--r2in', '-2',\n required=True,\n help='Input fastq file for R2'\n )\n arg_parser.add_argument(\n '--r1out', '-o1',\n required=True,\n help='Output fastq file for R1'\n )\n arg_parser.add_argument(\n '--r2out', '-o2',\n required=True,\n help='Output fastq file for R2'\n )\n arg_parser.add_argument(\n '--mapq',\n default=30,\n type=int,\n help='Minimum mapq required to be considered a valid read'\n )\n arg_parser.add_argument(\n '--cov_min',\n type=float,\n default=0.9\n )\n\n args = arg_parser.parse_args()\n\n passed_ids = get_passing_ids(\n args.alnfile,\n args.mapq,\n args.cov_min,\n )\n\n filter_fastq(\n passed_ids,\n args.r1in,\n args.r2in,\n args.r1out,\n args.r2out\n )","def main():\n parser = argparse.ArgumentParser(description=MAIN_DESCRIPTION)\n parser.add_argument('-a', '--algorithm', help=ALGORITHM_DESCRIPTION)\n parser.add_argument('-n', '--number', type=int, help=NUMBER_DESCRIPTION)\n parser.add_argument('-o', '--order', help=ORDER_DESCRIPTION)\n parser.add_argument('-s', '--size', help=SIZE_DESCRIPTION)\n args = parser.parse_args()\n try:\n if not (args.algorithm and args.number and args.order and args.size):\n raise ValueError\n create_structure()\n try:\n data = get_data(args.number, args.order, args.size)\n except IOError:\n data = generate_in_files(args.number, args.order, args.size)\n finally:\n alg, out, time = sorting_algorithm(data, args.algorithm)\n # generate_out_files(out, args.number)\n generate_log_file(args.algorithm, args.number, args.order,\n args.size, alg.compares, alg.moves, time)\n except (TypeError, UnboundLocalError, ValueError) as e:\n parser.print_help()","def parseArgs():\n parser = ArgumentParser(description='Main deepSAMIREI script.')\n parser.add_argument('-v', '--verbose',dest='verbose', action='store_true', \n default=False, help=\"verbose output [default is quiet running]\")\n \n parser.add_argument('-o','--outDir',dest='directory',type=str,\n action='store',help=\"output directory\", default='')\n parser.add_argument('-m','--mode', dest='mode',type=str,\n action='store',help=\"Mode of operation: train or test.\", default='train') \n parser.add_argument('--deskload', dest='deskLoad',\n action='store_true',default=False,\n help=\"Load dataset from desk. If false, the data is converted into tensors and kept in main memory (not recommended for large datasets).\") \n parser.add_argument('-w','--numworkers',dest='numWorkers',type=int,\n action='store',help=\"Number of workers used in data loader. For loading from the desk, use more than 1 for faster fetching.\", default=1) \n #parser.add_argument('-c','--cvtype',dest='cvtype',type=str,action='store',\n # help=\"Type of cross validation to use. Options are: chrom (leave-one-chrom-out), nfolds (N fold CV), and none (No CV, just regular train test split)\",\n # default='none')\n #parser.add_argument('--numfolds',dest='numfolds',type=int,action='store',\n # help=\"Number of folds for N fold CV\", default=10)\n parser.add_argument('--splittype',dest='splitType',type=str, action='store',\n help=\"Either to use a percantage of data for valid,test or use specific chromosomes. In the later case, provide chrA,chrB for valid,test. Default value is percent and --splitperc value will be used.\", default='percent')\n parser.add_argument('--splitperc',dest='splitperc',type=float, action='store',\n help=\"Pecentages of test, and validation data splits, eg. 10 for 10 percent data used for testing and validation.\", default=10)\n parser.add_argument('--motifanalysis', dest='motifAnalysis',\n action='store_true',default=False,\n help=\"Analyze CNN filters for motifs and search them against known TF database.\")\n parser.add_argument('--scorecutoff',dest='scoreCutoff',type=float,\n action='store',default=0.65,\n help=\"In case of binary labels, the positive probability cutoff to use.\")\n parser.add_argument('--tomtompath',dest='tomtomPath',\n type=str,action='store',default=None,\n help=\"Provide path to where TomTom (from MEME suite) is located.\") \n parser.add_argument('--database',dest='tfDatabase',type=str,action='store',\n help=\"Search CNN motifs against known TF database. Default is Human CISBP TFs.\", default=None)\n parser.add_argument('--annotate',dest='annotateTomTom',type=str,action='store',\n default=None, help=\"Annotate tomtom motifs. The options are: 1. path to annotation file, 2. No (not to annotate the output) 3. None (default where human CISBP annotations are used)\") \n parser.add_argument('-a','--attnfigs', dest='attnFigs',\n action='store_true',default=False,\n help=\"Generate Attention (matrix) figures for every test example.\")\n parser.add_argument('-i','--interactions', dest='featInteractions',\n action='store_true',default=False,\n help=\"Self attention based feature(TF) interactions analysis.\")\n parser.add_argument('-b','--background', dest='intBackground',type=str,\n action='store',default=None,\n help=\"Background used in interaction analysis: shuffle (for di-nucleotide shuffled sequences with embedded motifs.), negative (for negative test set). Default is not to use background (and significance test).\")\n parser.add_argument('--attncutoff', dest='attnCutoff',type=float,\n action='store',default=0.04,\n help=\"Attention (probability) cutoff value to use while searching for maximum interaction. A value (say K) greater than 1.0 will mean using top K interaction values.\") #In human promoter DHSs data analysis, lowering the cutoff leads to more TF interactions. \n parser.add_argument('--intseqlimit', dest='intSeqLimit',type=int,\n action='store',default = -1,\n help=\"A limit on number of input sequences to test. Default is -1 (use all input sequences that qualify).\")\n parser.add_argument('-s','--store', dest='storeInterCNN',\n action='store_true',default=False,\n help=\"Store per batch attention and CNN outpout matrices. If false, the are kept in the main memory.\")\n parser.add_argument('--considertophit', dest='considerTopHit',\n action='store_true',default=False,\n help=\"Consider only the top matching TF/regulatory element for a filter (from TomTom results).\") #This is particularly useful when we have lots of TF hits with fewer (1 or two) filters per TF. Using the top TF match will lead to fewer interactions.\n parser.add_argument('--numlabels', dest='numLabels',type=int,\n action='store',default = 2,\n help=\"Number of labels. 2 for binary (default). For multi-class, multi label problem, can be more than 2. \")\n parser.add_argument('--tomtomdist', dest='tomtomDist',type=str,\n action='store',default = 'pearson',\n help=\"TomTom distance parameter (pearson, kullback, ed etc). Default is pearson. See TomTom help from MEME suite.\")\n parser.add_argument('--attrbatchsize', dest='attrBatchSize',type=int,\n action='store',default = 12,\n help=\"Batch size used while calculating attributes. Default is 12.\")\n parser.add_argument('--tomtompval', dest='tomtomPval',type=float,\n action='store',default = 0.05,\n help=\"Adjusted p-value cutoff from TomTom. Default is 0.05.\")\n parser.add_argument('--testall', dest='testAll',\n action='store_true',default=False,\n help=\"Test on the entire dataset (default False). Useful for interaction/motif analysis.\")\n parser.add_argument('--useall', dest='useAll',\n action='store_true',default=False,\n help=\"Use all examples in multi-label problem. Default is False.\")\n parser.add_argument('--precisionlimit', dest='precisionLimit',type=float,\n action='store',default = 0.50,\n help=\"Precision limit to use for selecting examples in case of multi-label problem.\")\t\t\t\t\t\n parser.add_argument('inputprefix', type=str,\n help=\"Input file prefix for the bed/text file and the corresponding fasta file (sequences).\")\n parser.add_argument('hparamfile',type=str,\n help='Name of the hyperparameters file to be used.')\n \n \n \n args = parser.parse_args()\n #if not validateArgs( args ):\n # raise Exception(\"Argument Errors: check arguments and usage!\")\n return args","def analyzeCommandLineArguments(options):\n print(options)\n flag=0\n if os.path.exists(options.output_directory)==False:\n cmd=\"mkdir \"+options.output_directory\n os.system(cmd)\n else:\n if options.force==0:\n os.system(\"echo \\\"Output directory already exists. Please re-run the program with -f 1 to enforce rewrite of the directory \\\" >> \"+options.output_directory+\"/Log.out\")\n flag=1\n else:\n cmd=\"rm -rf \"+options.output_directory\n os.system(cmd)\n cmd=\"mkdir \"+options.output_directory\n os.system(cmd)\n \n cmd=\"touch \"+options.output_directory+\"/Log.out\"\n os.system(cmd)\n if options.bowtie_index == None:\n os.system(\"echo \\\"No bowtie index provided. Proceeding to building index\\\" >> \"+options.output_directory+\"/Log.out\")\n if os.path.exists(options.genome)==False:\n os.system(\"echo \\\"The genome file you provided does not exist\\\" >> \"+options.output_directory+\"/Log.out\")\n flag=1\n if options.input_library==None:\n os.system(\"echo \\\"The input file \"+options.input_library+\" does not exist\\\" >> \"+options.output_directory+\"/Log.out\")\n flag=1\n \n if flag==1:\n print(\"The program had to terminate prematurely....Please check \"+options.output_directory+\"/Log.out file for more details\")\n sys.exit()\n for ele in options.number_of_cycles:\n if ele not in [\"9\",\"10\",\"11\",\"12\",\"13\"]:\n os.system(\"echo \\\"Incorrect number of cycles have been entered. Valid choices are 9, 10, 11, 12 and 13 \\\" >> \"+options.output_directory+\"/Log.out\")\n flag=1\n \n if options.input_library.split(\".\")[-1]==\"fq\" or options.input_library.split(\".\")[-1]==\"fastq\":\n options.input_filename=options.output_directory+\"/\"+options.input_library.split(\"/\")[-1].split(\".\")[0]+\".fa\"\n \n options.input_path=\"/\".join(options.input_library.split(\"/\")[:-1])\n options.input_filename=options.input_library.split(\"/\")[-1].split(\".\")[0]\n options.consolidated_filename=options.output_directory+\"/\"+options.input_filename+\".consolidated.fasta\"\n options.adapter_trimmed_filename=options.output_directory+\"/\"+options.input_filename+\"_adapter_trimmed.fastq\"\n \n options.small_rna_size=list(map(int,options.small_rna_size))\n options.number_of_cycles=list(map(int,options.number_of_cycles))\n options.pvalue_cutoff=float(options.pvalue_cutoff)\n options.map_limit=int(options.map_limit)\n return options","def runSlaveRun():\n\n np.set_printoptions(linewidth=1000)\n function = None\n options = None\n\n # print(\"Process {}/{} reporting for duty!\".format(rank, size))\n\n function = comm.bcast(function, root=0)\n arguments = comm.scatter(options, root=0)\n\n results = function(*arguments)\n\n comm.Barrier()\n comm.gather(results, root=0)\n comm.Disconnect()","def prepare_runs(args):\n output_directory = _prepare_output_dir(args.output_directory)\n z_score_dir = args.z_score_dir\n region_list = args.region_list \n if args.region_list is None:\n try:\n flanking_region = int(args.flanking_region)\n except ValueError:\n logging.error('Flanking region argument needs to be an integer')\n sys.exit(COMMAND_LINE_ERROR)\n build = args.build\n bed_directory = args.bed_directory\n # Create the SNPList\n try:\n min_maf = float(args.maf)\n except:\n logging.error(\"Min Maf -m or --min-maf needs to be an floating point number\")\n sys.exit(COMMAND_LINE_ERROR)\n if args.region_list is not None:\n region_list = {}\n snp_list = []\n with open(args.region_list) as input_file:\n # When using no flaking region SNP must be valid, but it doesn't actually matter what it is, need to ensure that is actually the case.\n for i, line in enumerate(input_file):\n rsid = str(i)+ \"_\" + ''.join(line.strip().split(\"\\t\"))\n chromosome = line.strip().split(\":\")[0] \n snp = Snp(chromosome,\"1\",rsid)\n snp_list.append(snp)\n region_list[snp.rsid] = line.strip()\n else:\n snp_list = SnpList(args.snp_list, build)\n logging.info(snp_list)\n # Locus to process\n # population_to_extract_vcf\n if not args.annotation_only:\n no_flanking = args.flanking_units\n if no_flanking:\n raise NotImplementedError(\"Using a number of flanking SNPs instead of a region is not supported\")\n populations= args.populations.split(',')\n logging.info(\"Populations to process: {0}\".format(populations))\n loci = []\n gemini_databases = []\n output_vcfs = []\n for snp in snp_list:\n logging.info('Preparing output files for SNP {0}'.format(snp.rsid))\n locus = snp.rsid\n loci.append(locus)\n logging.info(\"Obtaining VCF file from the 1000 genomes project\")\n if region_list is not None:\n vcf = get_vcf_file(snp, string_region=region_list[locus])\n else: \n vcf = get_vcf_file(snp, flanking_region=flanking_region)\n for population in populations:\n tmp_vcf = extract_population_from_1000_genomes(vcf=vcf, super_population=population)\n z_score_file = get_relevant_zscore(snp.chrom, population, z_score_dir)\n pos_list_zscore = create_pos_hash_table(z_score_file)\n output_vcf = generate_zscore_and_vcf_output(output_directory=output_directory, zscore_hash=pos_list_zscore, vcf=tmp_vcf, locus=locus,population=population, multiply_rsquare=args.multiply_rsquare)\n if bed_directory is None:\n logging.info(\"Creating gemini database\")\n # TODO: Fix broxen gemini referenec\n gemini_databases.append(create_gemini_database(vcf=output_vcf))\n vcf_to_plink(locus, output_directory=output_directory, vcf=output_vcf, population=population)\n plink_to_ld_matrix(locus, output_directory=output_directory, population=population)\n logging.info(\"Generate transancestrals matrices\")\n generate_transancestral_output(loci, populations, output_directory)\n if bed_directory is None:\n logging.info(\"Generating annotation matrices to be used with Paintor\")\n logging.info(gemini_databases)\n generate_and_write_encode_annotations(databases=gemini_databases, output_directory=output_directory, loci=snp_list)\n else:\n logging.info(\"Annotation using bed files\")\n generate_bed_file_annotations(loci=loci, bed_directory=bed_directory, output_directory=output_directory) \n # So finally we need to fix the LD matrices for inputting into PAINTOR. \n\n with open(os.path.join(output_directory, 'input.files'), 'w') as out_f:\n for snp in snp_list:\n out_f.write(snp.rsid +'\\n')\n # Remove .tbi files\n for file in os.listdir('.'):\n if fnmatch.fnmatch(file, '*.tbi'):\n try:\n os.remove(file)\n except OSError:\n logging.warning(\"Could not remove a .tbi file from the 1000 genomes tabix run\")\n else: \n loci = []\n for snp in snp_list:\n loci.append(snp.rsid)\n if bed_directory is not None:\n logging.info(\"Annotation using bed files\")\n generate_bed_file_annotations(loci=loci, bed_directory=bed_directory, output_directory=output_directory) \n logging.info(\"Finemapping file preparation complete\")","def main(args):\n if '-' in args['-p']:\n tmp = args['-p'].split('-')\n tgtPorts = [str(i) for i in xrange(int(tmp[0]), int(tmp[1])+1)]\n else:\n tgtPorts = [args['-p']]\n tgtHost = args['-H']\n for tgtPort in tgtPorts:\n nmapScan(tgtHost, tgtPort)","def launchJobs(options, cmdargs, errStream=sys.stdin):\n\n if options.queue == LOCAL:\n launchLocalJobs(options,cmdargs,errStream)\n return\n\n logging.debug(\"Launching task array: %r\" % ({'tmpDir':options.tmpDir,'splits':options.splits,'fragName':options.fragBase,'cmd':cmdargs,'sgeOpts':options.sgeOptions,'job':options.jobName,'priority':options.priority,'loglevel':options.verbose,'wait':options.wait, 'type':options.taskType}))\n \n # SGE or SLURM submission prefix\n command = getSubmissionCommandPrefix(options)\n\n # batch_runner command\n command.append(BATCHLAUNCHER)\n command+=[\"--mode\",\"run\",\"--tmp_dir\",options.tmpDir,\"--frag_base\",\n options.fragBase, \"--frag_dir\", options.frag_dir, \"--frag_suffix\", options.fragSuff, \"--loglevel\", str(options.verbose), \"--queue\", options.queue]\n if options.inputFlag is not None:\n command.append('-i=%s' % (options.inputFlag))\n if options.prefixFlag is not None:\n command.append('-p=%s' % (options.prefixFlag))\n if options.threadsFlag is not None:\n command+=['-t',str(options.threadsFlag)]\n if options.outputFlags is not None:\n for flag in options.outputFlags:\n command.append('-o=%s' % (flag))\n if options.taskType is not None:\n command+=['--taskType',options.taskType]\n if options.cwd:\n command.append('--cwd')\n command.append('--')\n command+=cmdargs\n\n # redirect qsub output to std, silence if vebose is 0\n #if options.verbose==0:\n # qsubOuts=open(os.devnull,'w')\n #else:\n # qsubOuts=errStream\n \n # run command\n logging.debug('Launching task array: %s' % (formatCommand(command)))\n try:\n submissionOutput = subprocess.check_output(command)\n try:\n submissionOutput = submissionOutput.decode()\n except:\n pass\n if options.verbose>0:\n errStream.write(\"Submission Output: \" + submissionOutput)\n except subprocess.CalledProcessError as error:\n if options.wait and options.queue != SLURM:\n # when using -sync y, the exit code may come from a task\n # (which cleanup will handle)\n logging.warning(\"qsub returned an error code of: %d\" \n % error.returncode)\n else:\n raise error\n\n # get job id\n try:\n jobid = re.search(r'(\\d+)\\s*$',submissionOutput).group(1)\n options.jobid = jobid\n except:\n if options.queue==SLURM:\n logging.error(\"Cannot parse SLURM job id from '%s'\" % (submissionOutput))\n raise\n\n # SLURM doesn't allow waiting for completion on array jobs, so we hack:\n # use srun to start a dummy job that will wait for our job array\n if options.wait and options.queue==SLURM:\n waitForSlurmArray(options, errStream)","def parse_args():\n\n parser = argparse.ArgumentParser(\n description='Assignment 1: Map directions.',\n epilog = 'If SERIALPORT is not specified, stdin/stdout are used.')\n parser.add_argument('-s', '--serial',\n help='path to serial port',\n dest='serialport',\n default=None)\n parser.add_argument('-v', dest='verbose',\n help='verbose',\n action='store_true')\n parser.add_argument('-g', '--graph',\n help='path to graph (DEFAULT = \" edmonton_roads.txt\")',\n dest='graphname',\n default='edmonton_roads.txt')\n\n return parser.parse_args()","def _run_job(args):\n # Note that we do not set the seed of the random number generator because\n # we already modified the interaction matrix before calling this function\n # and it does not harm us when all sub processes have the same sequence of\n # random numbers.\n \n # create the object ...\n obj = LibraryBinaryNumeric(**args[0])\n # ... get the method to evaluate ...\n method = getattr(obj, args[1])\n # ... and evaluate it\n if len(args) > 2:\n return method(**args[2])\n else:\n return method()","def ReadArguments():\n\n args = ParseArguments()\n\n logging.info('Command line arguments...')\n for arg in vars(args):\n logging.info(str(arg) + ': ' + str(getattr(args, arg)))\n logging.info('')\n\n IsTest(args)\n ProcessCacheSize(args)\n ProcessLineSize(args)\n ProcessMulti(args)\n ProcessMemPattern(args)\n ProcessMemFile(args)","def run_overlay_resources_score_motifs(motif_sites_dir,\n all_chromatin_makrs_all_cells_combined_dir_path,\n motifs_overlapping_tracks_output_dir,\n run_in_parallel_param,\n number_processes_to_run_in_parallel,\n normal_expression_per_tissue_origin_per_TF,\n matching_tissue_to_cell,\n motifTFName_TFNames_matches_dict,\n cells_assays_dict,\n cell_tfs,\n tf_cells,\n assay_cells_datatypes):\n\n # check if input motif_sites_dir is directory and get files from it\n if os.path.exists(motif_sites_dir):\n if not os.path.isdir(motif_sites_dir) and os.path.isfile(motif_sites_dir):\n motif_files = [motif_sites_dir]\n motif_sites_dir = \".\"\n else:\n motif_files = os.listdir(motif_sites_dir)\n else:\n sys.exit(\"Specified path to Motif files does not exist\")\n\n # get list of paths to all motif files\n motif_files_full_path = [motif_sites_dir + '/' + s for s in motif_files]\n\n # get list of all files of combined tracks\n chromatin_tracks_files = os.listdir(all_chromatin_makrs_all_cells_combined_dir_path)\n\n # create output directory if not existing\n if not os.path.exists(motifs_overlapping_tracks_output_dir):\n os.makedirs(motifs_overlapping_tracks_output_dir)\n\n # compute overlay resources score motif to find overlapping structures\n # Debug: print(run_in_parallel_param, motif_files)\n if run_in_parallel_param and len(motif_files) > 1:\n print(\"Run overlay_resources_score_motifs in parallel\")\n p = Pool(int(number_processes_to_run_in_parallel))\n motifs_overlapping_tracks_files = p.starmap(overlay_resources_score_motifs, product(motif_files_full_path,\n [\n motifs_overlapping_tracks_output_dir],\n [\n all_chromatin_makrs_all_cells_combined_dir_path],\n [chromatin_tracks_files]))\n p.close()\n p.join()\n else:\n print(\"Do not run overlay_resources_score_motifs in parallel\")\n motifs_overlapping_tracks_files = []\n for i in motif_files_full_path:\n if os.path.exists(i):\n motifs_overlapping_tracks_file = overlay_resources_score_motifs(i,\n motifs_overlapping_tracks_output_dir,\n all_chromatin_makrs_all_cells_combined_dir_path,\n chromatin_tracks_files)\n motifs_overlapping_tracks_files.append(motifs_overlapping_tracks_file)\n else:\n print(\"Motif file \" + i + \"cannot be found and will be ignored.\")\n\n print(\"Finished overlay_resources_score_motifs\")\n scored_motifs_overlapping_tracks_files = []\n for motifs_overlapping_tracks_file in motifs_overlapping_tracks_files:\n if motifs_overlapping_tracks_file is None:\n continue\n scored_motifs_chromatin_tracks_output_file = '.'.join(\n motifs_overlapping_tracks_file.split('.')[0:-1]) + '_scored.bed10'\n # create or overwrite scored motif (chromatin-wise) files\n if not os.path.exists(scored_motifs_chromatin_tracks_output_file): # score each motif-track_overlapping file\n print(\"computing scores to: \" + scored_motifs_chromatin_tracks_output_file)\n # TODO: control change below\n index_track_names = 7\n index_motif_name = 3\n with open(scored_motifs_chromatin_tracks_output_file, 'w') as scored_motifs_writefile:\n header_line = ['posrange', 'chr', 'motifstart', 'motifend', 'name', 'score', 'pval', 'strand']\n for cell in sorted(cells_assays_dict.keys()):\n for assay in sorted(cells_assays_dict[cell].keys()):\n if cell[0].isdigit():\n cell = 'a' + cell\n\n cell_name = '_'.join(((cell + \"___\" + assay).replace('(', '').replace(')', '')\n .replace('-', '__').replace('.', '').replace(\"'\", \"\")).split())\n header_line.append('\"' + cell_name + '\"')\n scored_motifs_writefile.write('\\t'.join(header_line) + '\\n')\n\n # TODO: end previous for loop here, call Rust function, input all files --> minimize switching between them\n # score motifs\n if (run_in_parallel_param):\n print(\"Run score_motifs per cell in parallel\")\n os.system(\"\"\"split -l 200000 {} {}\"\"\".format(motifs_overlapping_tracks_file,\n motifs_overlapping_tracks_file + '_tmp'))\n motifs_overlapping_tracks_file_splitted = glob.glob(motifs_overlapping_tracks_file + '_tmp*')\n p = Pool(int(number_processes_to_run_in_parallel))\n p.starmap(score_motifs_per_cell, product(motifs_overlapping_tracks_file_splitted,\n [normal_expression_per_tissue_origin_per_TF],\n [matching_tissue_to_cell],\n [motifTFName_TFNames_matches_dict],\n [cells_assays_dict],\n [cell_tfs],\n [tf_cells],\n [assay_cells_datatypes],\n [index_track_names],\n [index_motif_name]))\n p.close()\n p.join()\n\n # remove tmp split files\n with open(scored_motifs_chromatin_tracks_output_file, 'a') as scored_motifs_writefile:\n for f in motifs_overlapping_tracks_file_splitted:\n with open(f + '_scored', 'r') as f_score_ifile:\n l = f_score_ifile.readline()\n while l:\n scored_motifs_writefile.write(l)\n l = f_score_ifile.readline()\n\n f_score_ifile.close()\n os.remove(f)\n os.remove(f + '_scored')\n scored_motifs_writefile.close()\n else:\n print(\"Do not run score_motifs per cell in parallel\")\n scored_file_tmp = score_motifs_per_cell(motifs_overlapping_tracks_file,\n normal_expression_per_tissue_origin_per_TF,\n matching_tissue_to_cell,\n motifTFName_TFNames_matches_dict,\n cells_assays_dict,\n cell_tfs,\n tf_cells,\n assay_cells_datatypes,\n index_track_names,\n index_motif_name)\n # write scores into scored file with header\n with open(scored_file_tmp, 'r') as infile, \\\n open(scored_motifs_chromatin_tracks_output_file, 'a') as outfile:\n outfile.write(infile.read())\n\n scored_motifs_overlapping_tracks_files.append(scored_motifs_chromatin_tracks_output_file)\n print(\"Finished run_overlay_resources_score_motifs\")\n return motifs_overlapping_tracks_files, scored_motifs_overlapping_tracks_files"],"string":"[\n \"def solve_route_in_parallel(self):\\r\\n # Validate Route settings. Essentially, create a dummy Route class instance and set up the\\r\\n # solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes\\r\\n # that are guaranteed to all fail.\\r\\n self._validate_route_settings()\\r\\n\\r\\n # Check if the input origins and destinations have any fields we should use in the route analysis\\r\\n self._populate_input_data_transfer_fields()\\r\\n\\r\\n # Compute Route in parallel\\r\\n LOGGER.info(f\\\"Beginning parallelized Route solves ({self.total_jobs} chunks)\\\")\\r\\n completed_jobs = 0 # Track the number of jobs completed so far to use in logging\\r\\n # Use the concurrent.futures ProcessPoolExecutor to spin up parallel processes that solve the routes\\r\\n with futures.ProcessPoolExecutor(max_workers=self.max_processes) as executor:\\r\\n # Each parallel process calls the solve_route() function with the rt_inputs dictionary for the\\r\\n # given origin ranges and their assigned destinations.\\r\\n jobs = {executor.submit(solve_route, self.rt_inputs, range): range for range in self.chunks}\\r\\n # As each job is completed, add some logging information and store the results to post-process later\\r\\n for future in futures.as_completed(jobs):\\r\\n try:\\r\\n # The Route job returns a results dictionary. Retrieve it.\\r\\n result = future.result()\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # If we couldn't retrieve the result, some terrible error happened and the job errored.\\r\\n # Note: This does not mean solve failed. It means some unexpected error was thrown. The most likely\\r\\n # causes are:\\r\\n # a) If you're calling a service, the service was temporarily down.\\r\\n # b) You had a temporary file read/write or resource issue on your machine.\\r\\n # c) If you're actively updating the code, you introduced an error.\\r\\n # To make the tool more robust against temporary glitches, retry submitting the job up to the number\\r\\n # of times designated in helpers.MAX_RETRIES. If the job is still erroring after that many retries,\\r\\n # fail the entire tool run.\\r\\n errs = traceback.format_exc().splitlines()\\r\\n failed_range = jobs[future]\\r\\n LOGGER.debug((\\r\\n f\\\"Failed to get results for Route chunk {failed_range} from the parallel process. Will retry \\\"\\r\\n f\\\"up to {helpers.MAX_RETRIES} times. Errors: {errs}\\\"\\r\\n ))\\r\\n job_failed = True\\r\\n num_retries = 0\\r\\n while job_failed and num_retries < helpers.MAX_RETRIES:\\r\\n num_retries += 1\\r\\n try:\\r\\n future = executor.submit(solve_route, self.rt_inputs, failed_range)\\r\\n result = future.result()\\r\\n job_failed = False\\r\\n LOGGER.debug(f\\\"Route chunk {failed_range} succeeded after {num_retries} retries.\\\")\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # Update exception info to the latest error\\r\\n errs = traceback.format_exc().splitlines()\\r\\n if job_failed:\\r\\n # The job errored and did not succeed after retries. Fail the tool run because something\\r\\n # terrible is happening.\\r\\n LOGGER.debug(f\\\"Route chunk {failed_range} continued to error after {num_retries} retries.\\\")\\r\\n LOGGER.error(\\\"Failed to get Route result from parallel processing.\\\")\\r\\n errs = traceback.format_exc().splitlines()\\r\\n for err in errs:\\r\\n LOGGER.error(err)\\r\\n raise\\r\\n\\r\\n # If we got this far, the job completed successfully and we retrieved results.\\r\\n completed_jobs += 1\\r\\n LOGGER.info(\\r\\n f\\\"Finished Route calculation {completed_jobs} of {self.total_jobs}.\\\")\\r\\n\\r\\n # Parse the results dictionary and store components for post-processing.\\r\\n if result[\\\"solveSucceeded\\\"]:\\r\\n self.route_fcs.append(result[\\\"outputRoutes\\\"])\\r\\n else:\\r\\n # Typically, a solve fails because no destinations were found for any of the origins in the chunk,\\r\\n # and this is a perfectly legitimate failure. It is not an error. However, they may be other, less\\r\\n # likely, reasons for solve failure. Write solve messages to the main GP message thread in debug\\r\\n # mode only in case the user is having problems. The user can also check the individual OD log\\r\\n # files.\\r\\n LOGGER.debug(f\\\"Solve failed for job id {result['jobId']}.\\\")\\r\\n LOGGER.debug(result[\\\"solveMessages\\\"])\\r\\n\\r\\n # Post-process outputs\\r\\n if self.route_fcs:\\r\\n LOGGER.info(\\\"Post-processing Route results...\\\")\\r\\n self.route_fcs = sorted(self.route_fcs)\\r\\n self._post_process_route_fcs()\\r\\n else:\\r\\n LOGGER.warning(\\\"All Route solves failed, so no output was produced.\\\")\\r\\n\\r\\n # Clean up\\r\\n # Delete the job folders if the job succeeded\\r\\n if DELETE_INTERMEDIATE_OUTPUTS:\\r\\n LOGGER.info(\\\"Deleting intermediate outputs...\\\")\\r\\n try:\\r\\n shutil.rmtree(self.scratch_folder, ignore_errors=True)\\r\\n except Exception: # pylint: disable=broad-except\\r\\n # If deletion doesn't work, just throw a warning and move on. This does not need to kill the tool.\\r\\n LOGGER.warning(f\\\"Unable to delete intermediate Route output folder {self.scratch_folder}.\\\")\\r\\n\\r\\n LOGGER.info(\\\"Finished calculating Routes.\\\")\",\n \"def main() -> None:\\n args = _get_arguments()\\n\\n file_level_logging = logging.DEBUG if args.log_to_file else None\\n setup_logger(logging.INFO, file_level_logging)\\n\\n if not os.path.exists(args.smiles):\\n mol = Molecule(smiles=args.smiles)\\n if mol.rd_mol is None:\\n logger().error(\\n f\\\"The --smiles argument ({args.smiles})\\\"\\n \\\" does not point to an existing file or is a valid RDKit SMILES.\\\"\\n \\\" Cannot start retrosynthesis planning.\\\"\\n )\\n return\\n\\n if args.nproc:\\n _multiprocess_smiles(args)\\n return\\n\\n multi_smiles = os.path.exists(args.smiles)\\n\\n finder = AiZynthFinder(configfile=args.config)\\n _select_stocks(finder, args)\\n post_processing = _load_postprocessing_jobs(args.post_processing)\\n finder.expansion_policy.select(args.policy or finder.expansion_policy.items[0])\\n if args.filter:\\n finder.filter_policy.select(args.filter)\\n else:\\n finder.filter_policy.select_all()\\n\\n params = [\\n args.smiles,\\n finder,\\n args.output,\\n args.cluster,\\n args.route_distance_model,\\n post_processing,\\n args.checkpoint,\\n ]\\n if multi_smiles:\\n _process_multi_smiles(*params)\\n else:\\n params = params[:-1]\\n _process_single_smiles(*params)\",\n \"def parseCommandLineArguments():\\n parser = argparse.ArgumentParser(prog=\\\"findPhasiRNAs.py\\\",description=\\\"findPhasiRNAs can be used to find genomic locations where phasing occurs. \\\")\\n optional_arg = parser.add_argument_group(\\\"Optional Arguments\\\")\\n required_arg = parser.add_argument_group(\\\"Required Arguments\\\")\\n genome_mutex = parser.add_mutually_exclusive_group(required = True)\\n \\n required_arg.add_argument(\\\"--input_library\\\",\\\"-i\\\",help=\\\"Specify the name of the file which has the small-RNA reads. This option is mutually exclusive with --consolidated_library\\\")\\n genome_mutex.add_argument(\\\"--genome\\\",\\\"-g\\\",help=\\\"Specify the name of the genome fasta file of the organism. Please note that the program will not be able to handle multiple fasta files. \\\")\\n genome_mutex.add_argument(\\\"--bowtie_index\\\",\\\"-bindex\\\",help=\\\"Provide the bowtie index. This argument is optional. If no index is provided then the software will generate one.\\\")\\n required_arg.add_argument(\\\"--output_directory\\\",\\\"-out\\\",help=\\\"Specify an output directory to which all the generated files will be housed. This includes the log file which can be later checked. Please make sure that there are sufficient permissions to create the output directory. The program will throw an error if creation of the output directory fails. If the directory already exists then its contents will be overwritten without warning. This directory will contain the summary file containing the details of the execution\\\",required=True)\\n optional_arg.add_argument(\\\"--small_rna_size\\\",\\\"-srnasize\\\",nargs=\\\"+\\\",help=\\\"Specify the size of the small RNA that you wish to analyze. You can enter more than one possible size.\\\",default=[\\\"21\\\"])\\n optional_arg.add_argument(\\\"--number_of_cycles\\\",\\\"-numcycles\\\",nargs=\\\"+\\\",help=\\\"Specify the number of cycles you wish to analyze with. You can enter multiple number of number of cycles. The accepted values are 9, 10, 11, 12 and 13\\\",default=[\\\"9\\\"])\\n optional_arg.add_argument(\\\"--pvalue_cutoff\\\",\\\"-p\\\",help=\\\"Enter the p-value cut off\\\",default=0.05)\\n optional_arg.add_argument(\\\"--clean_up\\\",\\\"-c\\\",help=\\\"Set this to 1 if you wish to clean up all the intermediate files. The program will keep all temporary files by default.\\\",default=0)\\n optional_arg.add_argument(\\\"--CPU\\\",\\\"-n\\\",help=\\\"Provide the number of CPUs to be used. Default is 1.\\\",default=\\\"1\\\")\\n optional_arg.add_argument(\\\"--map_limit\\\",\\\"-mapl\\\",help=\\\"Specify the mapping limit. Only reads which are mapped at most -mapl times will be considered. The default is 1. The maximum number of alignments allowed for a single read is 10. \\\",default=1)\\n optional_arg.add_argument(\\\"--force\\\",\\\"-f\\\",help=\\\"Overwrite contents of output directory if it exists.\\\",default=0)\\n \\n # Supressed arguments\\n parser.add_argument(\\\"--input_filename\\\",\\\"-ifname\\\",help=argparse.SUPPRESS)\\n parser.add_argument(\\\"--input_path\\\",\\\"-ipath\\\",help=argparse.SUPPRESS)\\n parser.add_argument(\\\"--consolidated_filename\\\",\\\"-cfname\\\",help=argparse.SUPPRESS)\\n parser.add_argument(\\\"--adapter_trimmed_filename\\\",\\\"-atfname\\\",help=argparse.SUPPRESS)\\n parser.add_argument(\\\"--output_directory_per_run\\\",\\\"-output_directory_per_run\\\",help=argparse.SUPPRESS)\\n #parser.add_argument(\\\"--output_directory\\\",\\\"-actual_out\\\",help=argparse.SUPPRESS)\\n \\n return parser.parse_args()\",\n \"def main():\\n parser = argparse.ArgumentParser(\\n description='Runs test for C++ implementation of M*')\\n parser.add_argument('test_file', help='File describing test cases')\\n parser.add_argument('output_file', help='Name of output file')\\n parser.add_argument('num_processors', type=int, action='store',\\n help='Number of processes to run on each node. ' +\\n 'The local host running the primary server will ' +\\n 'run one fewer worker processes')\\n parser.add_argument('-i', action='store', type=float, default=1.0,\\n help='Set inflation factor for the heuristic, ' +\\n 'defaults to 1', metavar='INF', dest='inflation')\\n parser.add_argument('-t', action='store', type=int, default=120,\\n help='Set time limit for planning. Defaults to 2 ' +\\n 'minutes', dest='time_limit')\\n parser.add_argument('--hosts', action='store',\\n default=('python', 'cobra', 'viper', 'anaconda'),\\n help='Hostnames/IPs to use as processing nodes.',\\n nargs='*', metavar='HOSTNAME')\\n\\n args = parser.parse_args()\\n\\n run_cpp_mstar_trial(args.test_file, args.output_file,\\n inflation=args.inflation, time_limit=args.time_limit,\\n hosts=args.hosts, num_processors=args.num_processors)\",\n \"def __init__(self, **kwargs):\\r\\n self.pair_type = kwargs[\\\"pair_type\\\"]\\r\\n self.origins = kwargs[\\\"origins\\\"]\\r\\n self.origin_id_field = kwargs[\\\"origin_id_field\\\"]\\r\\n self.destinations = kwargs[\\\"destinations\\\"]\\r\\n self.dest_id_field = kwargs[\\\"dest_id_field\\\"]\\r\\n self.network_data_source = kwargs[\\\"network_data_source\\\"]\\r\\n self.travel_mode = kwargs[\\\"travel_mode\\\"]\\r\\n self.time_units = kwargs[\\\"time_units\\\"]\\r\\n self.distance_units = kwargs[\\\"distance_units\\\"]\\r\\n self.time_of_day = kwargs[\\\"time_of_day\\\"]\\r\\n self.reverse_direction = kwargs[\\\"reverse_direction\\\"]\\r\\n self.scratch_folder = kwargs[\\\"scratch_folder\\\"]\\r\\n self.assigned_dest_field = kwargs[\\\"assigned_dest_field\\\"]\\r\\n self.od_pair_table = kwargs[\\\"od_pair_table\\\"]\\r\\n self.origin_transfer_fields = kwargs[\\\"origin_transfer_fields\\\"]\\r\\n self.destination_transfer_fields = kwargs[\\\"destination_transfer_fields\\\"]\\r\\n self.barriers = []\\r\\n if \\\"barriers\\\" in kwargs:\\r\\n self.barriers = kwargs[\\\"barriers\\\"]\\r\\n\\r\\n # Create a job ID and a folder for this job\\r\\n self._create_job_folder()\\r\\n\\r\\n # Setup the class logger. Logs for each parallel process are not written to the console but instead to a\\r\\n # process-specific log file.\\r\\n self.setup_logger(\\\"RoutePairs\\\")\\r\\n\\r\\n # Get field objects for the origin and destination ID fields since we need this in multiple places\\r\\n self.origin_id_field_obj = arcpy.ListFields(self.origins, wild_card=self.origin_id_field)[0]\\r\\n self.dest_id_field_obj = arcpy.ListFields(self.destinations, wild_card=self.dest_id_field)[0]\\r\\n\\r\\n # Set up other instance attributes\\r\\n self.is_service = helpers.is_nds_service(self.network_data_source)\\r\\n self.rt_solver = None\\r\\n self.solve_result = None\\r\\n self.input_origins_layer = \\\"InputOrigins\\\" + self.job_id\\r\\n self.input_destinations_layer = \\\"InputDestinations\\\" + self.job_id\\r\\n self.input_origins_layer_obj = None\\r\\n self.input_dests_layer_obj = None\\r\\n self.origin_unique_id_field_name = \\\"OriginUniqueID\\\"\\r\\n self.dest_unique_id_field_name = \\\"DestinationUniqueID\\\"\\r\\n self.od_pairs = None\\r\\n\\r\\n # Create a network dataset layer if needed\\r\\n if not self.is_service:\\r\\n self._make_nds_layer()\\r\\n\\r\\n # Prepare a dictionary to store info about the analysis results\\r\\n self.job_result = {\\r\\n \\\"jobId\\\": self.job_id,\\r\\n \\\"jobFolder\\\": self.job_folder,\\r\\n \\\"solveSucceeded\\\": False,\\r\\n \\\"solveMessages\\\": \\\"\\\",\\r\\n \\\"outputRoutes\\\": \\\"\\\",\\r\\n \\\"logFile\\\": self.log_file\\r\\n }\",\n \"def parse_command_line_arguments(command_line_arguments):\\n # First determine if a we're loading from a file\\n filename = False\\n if \\\"--file\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--file\\\")+1\\n filename = command_line_arguments[index]\\n if output.tracking_suffix in filename:\\n # Assumes simulation in progress. So, if final_sweep ==\\n # current_sweep, the simulation will load and then\\n # immediately end.\\n return get_progress_file_info(filename)\\n if not (output.output_suffix in filename):\\n raise ValueError(\\\"Can only load from *.boundaryprg2p1 or \\\"\\n +\\\"*.boundary2p1 files!\\\")\\n # If filename is of type *.boundary2p1, we assume its okay and\\n # load from it. None of the other command line arguments\\n # change.\\n\\n if \\\"--select\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--select\\\")+1\\n if command_line_arguments[index] == \\\"std\\\":\\n algorithm = monte_carlo.select_for_curvature\\n elif command_line_arguments[index] == \\\"area\\\":\\n algorithm = monte_carlo.select_for_area\\n else:\\n algorithm = default_algorithm\\n else:\\n algorithm = default_algorithm \\n\\n if \\\"--target-area\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--target-area\\\")+1\\n target_area = int(eval(command_line_arguments[index]))\\n else:\\n target_area = int(eval(command_line_arguments[0]))\\n\\n if \\\"--target-std\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--target-std\\\")+1\\n target_std = float(eval(command_line_arguments[index]))\\n else:\\n target_std = default_target_std\\n\\n if \\\"--area-damping\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--area-damping\\\")+1\\n area_damping_strength = float(eval(command_line_arguments[index]))\\n else:\\n area_damping_strength = default_area_damping\\n if not 0 <= area_damping_strength <= 1:\\n raise ValueError(\\\"Damping must be between 0 and 1.\\\")\\n\\n if \\\"--std-damping\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--std-damping\\\")+1\\n std_damping_strength = float(eval(command_line_arguments[index]))\\n else:\\n std_damping_strength = default_std_damping\\n if not 0 <= area_damping_strength <= 1:\\n raise ValueError(\\\"Damping must be between 0 and 1.\\\")\\n\\n if \\\"--initial\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--initial\\\")+1\\n initial_sweep = int(eval(command_line_arguments[index]))\\n else:\\n initial_sweep = default_initial_sweep\\n\\n if \\\"--final\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--final\\\")+1\\n final_sweep = int(eval(command_line_arguments[index]))\\n else:\\n final_sweep = default_final_sweep\\n\\n if \\\"--save\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--save\\\")+1\\n save_every_n_sweeps = int(eval(command_line_arguments[index]))\\n else:\\n save_every_n_sweeps = default_save_every_n_sweeps\\n if save_every_n_sweeps < 1:\\n raise ValueError(\\\"You must save at least every 1 sweeps!\\\")\\n\\n if \\\"--v5\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--v5\\\")+1\\n v5damping = int(eval(command_line_arguments[index]))\\n else:\\n v5damping = target_area/10\\n\\n if \\\"--v6\\\" in command_line_arguments:\\n index = command_line_arguments.index(\\\"--v6\\\")+1\\n v6damping = int(eval(command_line_arguments[index]))\\n else:\\n v6damping = target_area/10\\n \\n if \\\"--many\\\" in command_line_arguments:\\n if \\\"--one\\\" in command_line_arguments or \\\"--exact\\\" in command_line_arguments:\\n raise ValueError(\\\"Contradictory input!\\\")\\n if \\\"--micro\\\" in command_line_arguments:\\n gather_data_function = output.save_many_microscopically_optimal\\n else:\\n gather_data_function = output.gather_data_to_n_files\\n elif \\\"--one\\\" in command_line_arguments:\\n if \\\"--many\\\" in command_line_arguments or \\\"--exact\\\" in command_line_arguments:\\n raise ValueError(\\\"Condtradictory input!\\\")\\n if \\\"--micro\\\" in command_line_arguments:\\n gather_data_function = output.stop_at_microscopically_optimal\\n else:\\n gather_data_function = output.gather_data_to_1_file\\n elif \\\"--exact\\\" in command_line_arguments:\\n if \\\"--many\\\" in command_line_arguments or \\\"--one\\\" in command_line_arguments:\\n raise ValueError(\\\"Contradictory input!\\\")\\n gather_data_function = output.generate_n_exact_spheres\\n index = command_line_arguments.index(\\\"--exact\\\")+1\\n # In this case, v5damping is fitness_damping, as defined\\n # in generate_n_exact_spheres\\n v5damping = int(eval(command_line_arguments[index]))\\n else:\\n if \\\"--micro\\\" in command_line_arguments:\\n gather_data_function = output.stop_at_microscopically_optimal\\n else:\\n gather_data_function = output.gather_data_to_1_file\\n\\n # return a class with all the info we need\\n params = parameters(filename, target_area, area_damping_strength,\\n target_std, std_damping_strength,\\n initial_sweep, final_sweep,\\n save_every_n_sweeps,\\n v5damping, v6damping,\\n algorithm,\\n gather_data_function)\\n return params\",\n \"def solve_route(inputs, chunk):\\r\\n rt = Route(**inputs)\\r\\n if inputs[\\\"pair_type\\\"] is helpers.PreassignedODPairType.one_to_one:\\r\\n rt.logger.info(f\\\"Processing origins OID {chunk[0]} to {chunk[1]} as job id {rt.job_id}\\\")\\r\\n elif inputs[\\\"pair_type\\\"] is helpers.PreassignedODPairType.many_to_many:\\r\\n rt.logger.info(f\\\"Processing chunk {chunk[0]} as job id {rt.job_id}\\\")\\r\\n rt.solve(chunk)\\r\\n rt.teardown_logger()\\r\\n return rt.job_result\",\n \"def main():\\n # Instantiate the data problem.\\n data = create_data_model()\\n\\n # NEW SPOT TO MAKE distance_matrix\\n distance_matrix = compute_euclidean_distance_matrix(destinations_1)\\n manager = pywrapcp.RoutingIndexManager(\\n len(destinations_1), data['num_vehicles'], data['depot'])\\n\\n# # Create the routing index manager.\\n# manager = pywrapcp.RoutingIndexManager(\\n# len(data['locations']), data['num_vehicles'], data['depot'])\\n\\n # Create Routing Model.\\n routing = pywrapcp.RoutingModel(manager)\",\n \"def run_parallel(pid, call_method_id, run_id='gwas', kinship_method='ibd'):\\n job_id = '%s_%s_%d_%d' % (run_id, kinship_method, call_method_id, pid)\\n file_prefix = env.env['results_dir'] + job_id\\n\\n #Cluster specific parameters \\n shstr = '#!/bin/bash\\\\n'\\n shstr += '#$ -S /bin/bash\\\\n'\\n shstr += '#$ -N %s\\\\n' % job_id\\n #shstr += '#$ -o %s_job_$JOB_ID.out\\\\n' % file_prefix\\n #shstr += '#$ -e %s_job_$JOB_ID.err\\\\n' % file_prefix\\n shstr += '#$ -o %s_job.out\\\\n' % file_prefix\\n shstr += '#$ -e %s_job.err\\\\n' % file_prefix\\n shstr += 'source /etc/modules-env.sh\\\\n'\\n shstr += 'module load scipy/GotoBLAS2/0.9.0\\\\n'\\n shstr += 'module load matplotlib/1.0.0\\\\n'\\n shstr += 'module load mysqldb/1.2.3\\\\n'\\n\\tshstr += 'module load h5py/2.0.0\\\\n'\\n shstr += 'export GOTO_NUM_THREADS=1\\\\n'\\n\\n\\n shstr += \\\"python %sfullseq_gwas_project.py %s %s %d %d\\\" % \\\\\\n (env.env['script_dir'], run_id, kinship_method, call_method_id, pid)\\n\\n #shstr += \\\"> \\\" + file_prefix + \\\"_job.out) >& \\\" + file_prefix + \\\"_job.err\\\\n\\\"\\n print '\\\\n', shstr, '\\\\n'\\n script_file_name = run_id + \\\".sh\\\"\\n f = open(script_file_name, 'w')\\n f.write(shstr)\\n f.close()\\n\\n #Execute qsub script\\n os.system(\\\"qsub \\\" + script_file_name)\",\n \"def main():\\n (\\n calibration_file,\\n drs4_ped_file,\\n time_calibration_file,\\n systematic_correction_file,\\n drive_log_file,\\n run_summary_file,\\n pedestal_ids_file,\\n run_number,\\n ) = data_sequence_cli_parsing()\\n\\n if options.verbose:\\n log.setLevel(logging.DEBUG)\\n else:\\n log.setLevel(logging.INFO)\\n\\n # Run the routine piping all the analysis steps\\n rc = data_sequence(\\n calibration_file,\\n drs4_ped_file,\\n time_calibration_file,\\n systematic_correction_file,\\n drive_log_file,\\n run_summary_file,\\n pedestal_ids_file,\\n run_number,\\n )\\n sys.exit(rc)\",\n \"def _do_run(self, path, args):\\n try:\\n self.router.route(path, args)\\n except TypeError, e:\\n # To catch the follow errors\\n # TypeError: xxxx got an unexpected keyword argument 'k'\\n # TypeError: 'print_my_good() takes at least 1 argument (0 given)'\\n print \\\"run job %s with arg < %s > error:\\\" % (path, \\\", \\\".join(args))\\n print \\\"%s\\\" % e\",\n \"def main():\\n\\t\\n\\tparser = argparse.ArgumentParser(description=\\\"This invokes a java program to place and/or route a design using Vivado tcl.\\\")\\n\\tparser.add_argument('input_dcp', nargs=1, help=\\\"Input design checkpoint (.dcp) file.\\\")\\n\\tparser.add_argument('output_dcp', nargs=1, help=\\\"Output dcp file.\\\")\\n\\tparser.add_argument('-p', '--place', dest='place', action='store_true', help=\\\"Place design.\\\")\\n\\tparser.add_argument('-r', '--route', dest='route', action='store_true', help=\\\"Route design.\\\")\\n\\tparser.add_argument('-b', '--both', dest='place_and_route', action='store_true', help=\\\"Place and route design. This option supercedes -p or -r.\\\")\\n\\tparser.add_argument('-q', '--quiet', dest='quiet', action='store_true', help=\\\"Suppress messages.\\\")\\n\\tparser.add_argument('-f', '--force', dest='force', action='store_true', help=\\\"Overwrite file at destination if it exists.\\\")\\n\\targs = parser.parse_args()\\n\\t\\n\\t\\n\\tif args.place or args.place_and_route:\\n\\t\\tplace_flag = \\\"-p true\\\"\\n\\telse:\\n\\t\\tplace_flag = \\\"-p false\\\"\\n\\t\\t\\n\\tif args.route or args.place_and_route:\\n\\t\\troute_flag = \\\"-r true\\\"\\n\\telse:\\n\\t\\troute_flag = \\\"-r false\\\"\\n\\t\\n\\tif args.force:\\n\\t\\tforce_flag = \\\"-f true\\\"\\n\\telse:\\n\\t\\tforce_flag = \\\"-f false\\\"\\n\\tif args.quiet:\\n\\t\\tquiet_flag = \\\"-q true\\\"\\n\\telse:\\n\\t\\tquiet_flag = \\\"-q false\\\"\\n\\t\\n\\t\\n\\tplace_and_route_dir = \\\"~/Documents/2019_summer/AddILA/\\\"\\n\\tclass_path = \\\".:/nfs/ug/thesis/thesis0/pc2019/Software/RapidWright/RapidWright\\\"\\n\\t\\n\\tcd_cmd = \\\"cd {}\\\".format(place_and_route_dir)\\n\\tjava_compile_cmd = \\\"javac PlaceAndRoute.java\\\".format()\\n\\n\\ttry:\\n\\t\\tif not args.quiet:\\n\\t\\t\\tprint(\\\"pwd\\\")\\n\\t\\tpwd = subprocess.check_output(\\\"pwd\\\").decode(sys.stdout.encoding).strip()\\n\\t\\tif not args.quiet:\\n\\t\\t\\tprint(cd_cmd)\\n\\t\\tos.system(cd_cmd)\\n\\texcept:\\n\\t\\tprint(\\\"\\\\nERROR: Failed to execute '{}'.\\\".format(cd_cmd))\\n\\t\\treturn 1\\n\\n\\tif args.input_dcp[0][0] in {'~', '/'}:\\n\\t\\tinput_dcp = args.input_dcp[0]\\n\\telse:\\n\\t\\tinput_dcp = pwd + \\\"/\\\" + args.input_dcp[0]\\n\\tif args.output_dcp[0][0] in {'~', '/'}:\\n\\t\\toutput_dcp = args.output_dcp[0]\\n\\telse:\\n\\t\\toutput_dcp = pwd + \\\"/\\\" + args.output_dcp[0]\\n\\t\\n\\tjava_execute_cmd = \\\"java -cp {0} PlaceAndRoute {1} {2} {3} {4} {5} {6}\\\".format(class_path, input_dcp, output_dcp, place_flag, route_flag, force_flag, quiet_flag)\\n\\t\\n\\ttry:\\n\\t\\tif not args.quiet:\\n\\t\\t\\tprint(java_compile_cmd)\\n\\t\\tos.system(java_compile_cmd)\\n\\texcept:\\n\\t\\tprint(\\\"\\\\nERROR: Failed to execute '{}'.\\\".format(java_compile_cmd))\\n\\t\\treturn 1\\n\\n\\ttry:\\n\\t\\tif not args.quiet:\\n\\t\\t\\tprint(java_execute_cmd)\\n\\t\\tos.system(java_execute_cmd)\\n\\texcept:\\n\\t\\tprint(\\\"\\\\nERROR: Failed to execute '{}'.\\\".format(java_execute_cmd))\\n\\t\\treturn 1\",\n \"def main ():\\n\\n print(\\\"MapReduce Map Worker program\\\")\\n\\n # first parse the command line arguments\\n parsed_args = parseCmdLineArgs ()\\n \\n # instantiate a map object with the parsed args\\n mapobj = MR_Map (parsed_args)\\n\\n # initialize the map worker network connections\\n mapobj.init_worker ()\\n \\n # invoke the map process. We run this map process forever\\n while True:\\n mapobj.do_work ()\\n print(\\\"MapReduce Map Worker done for this iteration\\\")\\n time.sleep (5)\",\n \"def main(*args):\\n \\n # Read input file in as dictionary\\n with open(args[0]) as f:\\n input_dict = iprPy.input.parse(f, allsingular=True)\\n \\n # Interpret and process input parameters\\n process_input(input_dict, *args[1:])\\n \\n # Call calculation's function(s)\\n results_dict = bondscan(input_dict['lammps_command'],\\n input_dict['potential'],\\n input_dict['symbols'],\\n mpi_command = input_dict['mpi_command'],\\n rmin = input_dict['minimum_r'],\\n rmax = input_dict['maximum_r'],\\n rnum = input_dict['number_of_steps_r'],\\n thetamin = input_dict['minimum_theta'],\\n thetamax = input_dict['maximum_theta'],\\n thetanum = input_dict['number_of_steps_theta'])\\n \\n # Build and save data model of results\\n record = iprPy.load_record(record_style)\\n record.buildcontent(input_dict, results_dict)\\n with open('results.json', 'w') as f:\\n record.content.json(fp=f, indent=4)\",\n \"def main():\\n\\n parser = argparse.ArgumentParser(\\n formatter_class=argparse.ArgumentDefaultsHelpFormatter,\\n )\\n\\n parser.add_argument('-V', '--version', action='version', version=VERSION)\\n\\n\\n file_group = parser.add_argument_group('Input Files')\\n file_group.add_argument('-f', dest='traj', required=True, type=str,\\n help='trajectory file (XTC/TRR/GRO/PDB ...)')\\n file_group.add_argument('-s', dest='tpr', required=True, type=str,\\n help='tpr file (TPR)')\\n file_group.add_argument('-o', dest='outpath', type=str,\\n help='name of the mapped trajectory (XTC/GRO)')\\n file_group.add_argument('-m', dest='map_file', type=str,\\n help='.mapping file or path to directory of .map files')\\n\\n mapping_group = parser.add_argument_group('Mapping Options')\\n mapping_group.add_argument('-mode', dest='mode', required=False, type=str,\\n help='COG or COM mapping', default='COG')\\n mapping_group.add_argument('-pbc', action='store_true', required=False, dest='pbc_complete',\\n help='complete pbc with MDAnalysis; this is slow!')\\n mapping_group.add_argument('-mols', dest='mol_names', required=True, type=str, nargs='+',\\n help='names of molecules to consider when mapping as in the [moleculetypes] directive')\\n mapping_group.add_argument('-add_H', dest='h_association', nargs='+', type=lambda s: s.split(':'),\\n default=[],\\n help='atom-types corresponding to CH3, CH2, CH1 for aliphatic groups and CH2d for double bonds.')\\n args = parser.parse_args()\\n\\n print(\\\"INFO - Loading universe\\\")\\n # load trajectory\\n init_universe = UniverseHandler(args.mol_names,\\n args.tpr,\\n args.traj,\\n in_memory=True)\\n if args.pbc_complete:\\n print(\\\"INFO - PBC completing trajectory\\\")\\n init_universe.pbc_complete()\\n\\n if args.h_association:\\n print(\\\"INFO - Adding Hydrogen to united-atoms\\\")\\n treated_atoms = init_universe.shift_united_atom_carbons(dict(args.h_association))\\n else:\\n treated_atoms = np.array([])\\n\\n print(\\\"INFO - Loading mapping files\\\")\\n #determine if we have a single .mapping file or a directory of .map files\\n map_path = pathlib.Path(args.map_file)\\n if map_path.is_file() == True:\\n with open(args.map_file, \\\"r\\\") as _file:\\n lines = _file.readlines()\\n elif map_path.is_dir() == True:\\n l = []\\n for i in map_path.glob('*.map'):\\n with open(i, \\\"r\\\") as _file:\\n l.append(_file.readlines())\\n if len(l) > 0:\\n lines = [item for sublist in l for item in sublist]\\n else:\\n msg = (\\\"Couldn't find any .map files in the directory given.\\\"\\n \\\"Please check the -m argument!\\\")\\n raise IOError(msg)\\n else:\\n msg = (\\\"\\\\nCannot determine if you have given me a single .mapping file\\\\n\\\"\\n \\\"or a directory of .map files. Please check!\\\\n\\\")\\n raise IOError(msg)\\n\\n mappings = read_mapping(lines)[0]\\n\\n print(\\\"INFO - Mapping universe - indices\\\")\\n # first mapp the atom indices\\n mapped_atoms, bead_idxs = forward_map_indices(init_universe,\\n mappings)\\n n_frames = len(init_universe.trajectory)\\n\\n print(\\\"INFO - Mapping universe - positions\\\")\\n mapped_atoms = numba.typed.List(mapped_atoms)\\n bead_idxs = numba.typed.List(bead_idxs)\\n # extract the position array from universe\\n # if it's not a trajectory we have to emulate\\n # a single frame\\n path = pathlib.Path(args.traj)\\n file_extension = path.suffix.casefold()[1:]\\n if file_extension in [\\\"xtc\\\", \\\"trr\\\"]:\\n positions = init_universe.trajectory.coordinate_array\\n else:\\n positions = init_universe.atoms.positions\\n positions = positions.reshape(1, -1, 3)\\n\\n mapped_trajectory = forward_map_positions(mapped_atoms,\\n bead_idxs,\\n positions,\\n n_frames,\\n args.mode,\\n treated_atoms)\\n\\n print(\\\"INFO - Mapping universe - building pos-array\\\")\\n cg_universe = create_new_universe(init_universe, mapped_trajectory, mappings)\\n\\n # write coordinate\\n print(\\\"INFO - Writing CG trajectory\\\")\\n if args.traj:\\n path = pathlib.Path(args.traj)\\n file_extension = path.suffix.casefold()[1:]\\n else:\\n file_extension = \\\"xtc\\\"\\n\\n if file_extension in [\\\"xtc\\\", \\\"trr\\\"]:\\n cg_beads = cg_universe.atoms\\n with mda.Writer(args.outpath,\\n multiframe=True,\\n n_atoms=len(cg_universe.atoms)) as mapped:\\n for time_step in cg_universe.trajectory:\\n mapped.write(cg_beads)\\n else:\\n cg_universe.atoms.positions = cg_universe.trajectory.coordinate_array[0]\\n cg_beads = cg_universe.atoms\\n cg_universe.atoms.dimensions = init_universe.atoms.dimensions\\n with mda.Writer(args.outpath, n_atoms=len(cg_universe.atoms)) as mapped:\\n mapped.write(cg_beads)\",\n \"def main():\\n args = parse_args()\\n process_args(args)\",\n \"def main() -> None:\\n\\n data = Ground(sys.argv[1])\\n DeliveryMan.show_route(data.coordinates)\",\n \"def parse_command_line(args):\\r\\n\\r\\n\\r\\n # Initial validity check of input command: each argument may be\\r\\n # defined only once\\r\\n for a in args:\\r\\n if a.startswith('--'):\\r\\n if args.count(a) > 1:\\r\\n raise STAPLERerror.STAPLERerror('Each command line parameter can be '\\r\\n 'defined only once! The following '\\r\\n 'parameter was defined multiple times:\\\\n '\\r\\n '{0}'.format(a))\\r\\n\\r\\n # Initialize a named tuple to store all available command line arguments\\r\\n Command_line_parameters = namedtuple('Input_file_parameters',\\r\\n ['all_parameters',\\r\\n 'staplerfile_path',\\r\\n 'resource_manager',\\r\\n 'max_job_count',\\r\\n 'auto_split_workflows',\\r\\n 'compress_run',\\r\\n 'validate_run',\\r\\n 'fix_run',\\r\\n 'rm_workflow'])\\r\\n\\r\\n # Parse user command line and check sanity of values\\r\\n\\r\\n # Parse the resource manager to use\\r\\n all_parameters = ' '.join(args)\\r\\n resource_manager = None\\r\\n if '--lsf' in args:\\r\\n resource_manager = 'lsf'\\r\\n args.remove('--lsf')\\r\\n if '--sge' in args:\\r\\n if resource_manager is not None:\\r\\n raise STAPLERerror.STAPLERerror('Multiple resource managers are listed in the '\\r\\n 'command line. Please, choose only one.')\\r\\n resource_manager = 'sge'\\r\\n args.remove('--sge')\\r\\n if '--slurm' in args:\\r\\n if resource_manager is not None:\\r\\n raise STAPLERerror.STAPLERerror('Multiple resource managers are listed in the '\\r\\n 'command line. Please, choose only one.')\\r\\n resource_manager = 'slurm'\\r\\n args.remove('--slurm')\\r\\n if '--torque' in args:\\r\\n if resource_manager is not None:\\r\\n raise STAPLERerror.STAPLERerror('Multiple resource managers are listed in the '\\r\\n 'command line. Please, choose only one.')\\r\\n resource_manager = 'torque'\\r\\n args.remove('--torque')\\r\\n if '--UNIX' in args or resource_manager is None:\\r\\n if resource_manager is not None:\\r\\n raise STAPLERerror.STAPLERerror('Multiple resource managers are listed in the '\\r\\n 'command line. Please, choose only one.')\\r\\n resource_manager = 'unix'\\r\\n if '--UNIX' in args: args.remove('--UNIX')\\r\\n\\r\\n # Parse the limit for maximum number of jobs to spawn\\r\\n if '--max_job_count' in args:\\r\\n if resource_manager is None:\\r\\n raise STAPLERerror.STAPLERerror('--max_job_count parameter can only be defined '\\r\\n 'if a resource manager is also defined '\\r\\n '(e.g. --slurm)!')\\r\\n try:\\r\\n max_job_count = int(args[args.index('--max_job_count')+1])\\r\\n except (TypeError, IndexError):\\r\\n raise STAPLERerror.STAPLERerror('--max_job_count requires a positive integer '\\r\\n 'value, e.g. --max_job_count 16')\\r\\n if max_job_count < 1:\\r\\n raise STAPLERerror.STAPLERerror('--max_job_count requires a positive integer '\\r\\n 'value, e.g. --max_job_count 16')\\r\\n args.pop(args.index('--max_job_count')+1)\\r\\n args.remove('--max_job_count')\\r\\n else:\\r\\n if resource_manager == 'unix':\\r\\n max_job_count = multiprocessing.cpu_count()\\r\\n else:\\r\\n max_job_count = None\\r\\n\\r\\n # Parse workflow control parameters\\r\\n if '--priority' in args:\\r\\n if resource_manager is None:\\r\\n raise STAPLERerror.STAPLERerror('--priority parameter can be used only if a '\\r\\n 'resource manager (e.g. SLURM) is specified!')\\r\\n if resource_manager == 'unix':\\r\\n raise STAPLERerror.STAPLERerror('--priority parameter cannot be '\\r\\n 'used in combination with --UNIX '\\r\\n 'parameter!')\\r\\n try:\\r\\n if (args[args.index('--priority')+1]).lower() in ('continuous', 'c'):\\r\\n auto_split_workflows = False\\r\\n elif (args[args.index('--priority')+1]).lower() in ('split', 's'):\\r\\n auto_split_workflows = True\\r\\n else:\\r\\n raise STAPLERerror.STAPLERerror('Allowed values for --priority parameter are '\\r\\n '\\\"continuous\\\", \\\"c\\\", \\\"split\\\" and \\\"s\\\"!')\\r\\n except (TypeError, IndexError):\\r\\n raise STAPLERerror('--priority parameter requires a value! Allowed values are '\\r\\n '\\\"continuous\\\", \\\"c\\\", \\\"split\\\" and \\\"s\\\" ')\\r\\n args.pop(args.index('--priority')+1)\\r\\n args.remove('--priority')\\r\\n else:\\r\\n if resource_manager == 'unix':\\r\\n auto_split_workflows = True\\r\\n else:\\r\\n auto_split_workflows = False\\r\\n compress_run = None\\r\\n\\r\\n # Parse workflow compression/decompression parameters\\r\\n if '--compress' in args:\\r\\n compress_run = 'compress'\\r\\n args.remove('--compress')\\r\\n if '--decompress' in args:\\r\\n if '--compress' in args:\\r\\n raise STAPLERerror.STAPLERerror('--compress and --decompress parameters can '\\r\\n 'not be used simultaneously!')\\r\\n compress_run = 'decompress'\\r\\n args.remove('--decompress')\\r\\n\\r\\n # Parse workflow validation/fixing/removing parameters\\r\\n if '--validate_run' in args:\\r\\n validate_run = True\\r\\n args.remove('--validate_run')\\r\\n else:\\r\\n validate_run = False\\r\\n if '--fix_run' in args:\\r\\n fix_run = True\\r\\n args.remove('--fix_run')\\r\\n else:\\r\\n fix_run = False\\r\\n if '--remove' in args:\\r\\n rm_workflow = True\\r\\n args.remove('--remove')\\r\\n else:\\r\\n rm_workflow = False\\r\\n\\r\\n # Parse path to staplefile. All other valid parameters are now read & removed\\r\\n # from args.\\r\\n if len(args) == 1:\\r\\n if os.path.isfile(args[0]):\\r\\n staplerfile_path = args[0]\\r\\n else:\\r\\n raise STAPLERerror.STAPLERerror('Command line contains an odd value:\\\\n{0}\\\\n '\\r\\n 'This is not an existing path to a staplerfile '\\r\\n 'or any other recognized parameter!'.format(\\r\\n args[0]))\\r\\n elif len(args) == 0:\\r\\n raise STAPLERerror.STAPLERerror('Command line is missing path to staplerfile!')\\r\\n elif len(args) > 1:\\r\\n for a in args:\\r\\n if os.path.isfile(a):\\r\\n odd_values = args\\r\\n args.remove(a)\\r\\n raise STAPLERerror.STAPLERerror('Command line contains some odd '\\r\\n 'parameters! The string \\\"{0}\\\" is '\\r\\n 'probably the path to stapler file, '\\r\\n 'but the following parameters are '\\r\\n 'unknown:\\\\n{1}\\\\nFor more info, '\\r\\n 'type\\\\npython STAPLER.py -h'.format(a,\\r\\n '\\\\n'.join(odd_values)))\\r\\n raise STAPLERerror.STAPLERerror('Command line is missing path to staplerfile! '\\r\\n 'Instead, some odd parameters are present:\\\\n{0}'.format('\\\\n'.join(args)))\\r\\n\\r\\n # Do further validity checks for different parameter combinations\\r\\n if validate_run and fix_run:\\r\\n raise STAPLERerror.STAPLERerror('--validate_run and --fix_run cannot be used '\\r\\n 'in the same command!')\\r\\n if validate_run and rm_workflow:\\r\\n raise STAPLERerror.STAPLERerror('--remove_WORKFLOW and --validate_run cannot be '\\r\\n 'used in the same command!')\\r\\n if fix_run and rm_workflow:\\r\\n raise STAPLERerror.STAPLERerror('--fix_run and REMOVE_WORKFLOW cannot be used in '\\r\\n 'the same command!')\\r\\n if compress_run is not None:\\r\\n if validate_run or rm_workflow or fix_run:\\r\\n raise STAPLERerror.STAPLERerror('--validate_run, --remove_WORKFLOW or --fix_run '\\r\\n 'parameters cannot be used in the same command '\\r\\n 'with --COMRESS_RUN!')\\r\\n if validate_run or rm_workflow:\\r\\n if resource_manager is not 'unix':\\r\\n raise STAPLERerror.STAPLERerror('Resource managers cannot be used when '\\r\\n 'removing workflows!')\\r\\n\\r\\n command_line_parameters = Command_line_parameters(\\r\\n all_parameters=all_parameters,\\r\\n staplerfile_path=staplerfile_path,\\r\\n resource_manager=resource_manager,\\r\\n max_job_count=max_job_count,\\r\\n auto_split_workflows=auto_split_workflows,\\r\\n compress_run=compress_run,\\r\\n validate_run=validate_run,\\r\\n fix_run=fix_run,\\r\\n rm_workflow=rm_workflow)\\r\\n\\r\\n return command_line_parameters\",\n \"def run_multimapping(SRA):\\n\\n if not os.path.exists(\\\"TMP/ambiguous_reads/\\\"):\\n os.mkdir(\\\"TMP/ambiguous_reads/\\\")\\n\\n cmd_STAR = 'STAR --outSAMtype BAM SortedByCoordinate --runThreadN 8 --winAnchorMultimapNmax 200 --seedSearchStartLmax 15 --genomeDir' + ' ' + STAR_TRANSCRIPTOME_DIR + ' ' + '--readFilesIn' + ' ' + TMP_DIR+SRA+'_rrnaUnmapped.fastq' + ' ' + '--outFileNamePrefix' + ' ' + TMP_DIR+'ambiguous_reads/'+SRA+'_STAR_transcriptome_'\\n output = subprocess.run(cmd_STAR, shell=True)\\n\\n \\n # Keep only multi-mapping reads:\\n cmd_filter = 'python code/sam_STAR_mapq_filtering.py' + ' ' + TMP_DIR+'ambiguous_reads/'+SRA+'_STAR_transcriptome_Aligned.sortedByCoord.out.bam' + ' ' + TMP_DIR+'ambiguous_reads/'+SRA+'_STAR_transcriptome_multi_mapped_sorted.bam' + ' ' + 'all'\\n output = subprocess.run(cmd_filter, shell=True)\\n\\n cmd_samtools2 = 'samtools index' + ' ' + TMP_DIR+'ambiguous_reads/'+SRA+'_STAR_transcriptome_multi_mapped_sorted.bam'\\n output = subprocess.run(cmd_samtools2, shell=True)\",\n \"def read_arguments():\\n\\n parser = argparse.ArgumentParser(\\n description='Enter arguments to run the pipeline.')\\n\\n # arguments for external files that might be necessary to run the program\\n parser.add_argument(\\n '--cost_network', type=str,\\n help='file storing the state dictionary of the cost network.'\\n )\\n\\n parser.add_argument(\\n '--policy_network', type=str,\\n help='File storing the state dictionary of the Policy network.'\\n )\\n\\n parser.add_argument(\\n '--state_dictionary', type=str,\\n help='Environment on which to run the algo (obstacle/no obstacle)'\\n )\\n\\n parser.add_argument(\\n '--expert_trajectory_file', type=str,\\n help='Path to file containing the exeprt trajectories.')\\n\\n # network hyper parameters\\n parser.add_argument(\\n '--cost_network_input', type=int, default=29,\\n help='layer size of cost network. None if you have specified cost \\\\\\n network state dict.')\\n\\n parser.add_argument(\\n '--cost_network_hidden', nargs='+', type=int, default=[256, 256],\\n help='Hidden size of cost network.None if you have specified cost \\\\\\n network state dict.')\\n\\n parser.add_argument(\\n '--cost_network_output', type=int, default=1,\\n help='Output layer size of cost network.None if you have specified \\\\\\n cost network state dict.')\\n\\n parser.add_argument(\\n '--policy_network_input', type=int, default=29,\\n help='Input layer size of policy network.None if you have specified \\\\\\n policy network state dict.')\\n\\n parser.add_argument(\\n '--policy_network_hidden', nargs='+', type=int, default=[256, 256],\\n help='Hidden layer size of policy network.None if you have specified \\\\\\n policy network state dict.')\\n\\n parser.add_argument(\\n '--policy_network_output', type=int, default=4,\\n help='Output layer size of policy network.None if you have specified \\\\\\n policy network state dict.')\\n\\n # other run hyper parameters like optimizer and all???\\n\\n # run hyperparameters\\n parser.add_argument('--irl_iterations', type=int,\\n help='Number of times to iterate over the IRL part.')\\n\\n parser.add_argument(\\n '--no_of_samples', type=int,\\n help='Number of samples to create agent state visitation frequency.')\\n\\n parser.add_argument(\\n '--rl_iterations', type=int,\\n help='Number of iterations to be performed in the RL section.')\\n\\n # arguments for the I/O of the program\\n parser.add_argument(\\n '--display_board', type=str, default='False',\\n help='If True, draw envirnment.')\\n\\n parser.add_argument(\\n '--on_server', type=str, default='True',\\n help='False if program is to run on server.')\\n\\n parser.add_argument('--store_results', type=str, default='True')\\n\\n parser.add_argument(\\n '--plot_interval', type=int, default=10,\\n help='Iterations before loss and reward curve plots are stored.')\\n\\n parser.add_argument(\\n '--savedict_policy_interval', type=int, default=100,\\n help='Iterations after which the policy network will be stored.')\\n\\n parser.add_argument(\\n '--savedict_cost_interval', type=int, default=1,\\n help='Iterations after which the cost network will be stored.')\\n\\n # arguments for the broader pipeLine\\n parser.add_argument(\\n '--rl_method', type=str,\\n help='Enter the RL method to be used.')\\n\\n parser.add_argument(\\n '--feature_space', type=str,\\n help='Type of features to be used to get the state of the agent.')\\n\\n parser.add_argument('--irl_method', type=str,\\n help='Enter the IRL method to be used.')\\n\\n parser.add_argument(\\n '--run_type', type=str, default='train',\\n help='Enter if it is a train run or a test run.(train/test).')\\n\\n parser.add_argument(\\n '--verbose', type=str, default='False',\\n help='Set verbose to \\\"True\\\" to get a myriad of print statements crowd\\\\\\n your terminal. Necessary information should be provided with either\\\\\\n of the modes.')\\n\\n parser.add_argument(\\n '--no_of_testRuns', type=int, default=0,\\n help='If --run_type set to test, then this denotes the number of test \\\\\\n runs you want to conduct.')\\n\\n _args = parser.parse_args()\\n\\n return _args\",\n \"def process_argv(argv):\\n # Initial preparation\\n import __main__\\n for (k,v) in global_constants.items():\\n exec '%s = %s' % (k,v) in __main__.__dict__\\n\\n # Allow param.normalize_path.prefix to be overridden in the\\n # startup files, but otherwise force it to exist before doing\\n # anything else\\n param.normalize_path.prefix = default_output_path()\\n exec_startup_files()\\n set_output_path(param.normalize_path.prefix)\\n\\n # Tell the user how many cores are in use, if available\\n openmp_main=Parameterized(name=\\\"OpenMP\\\") # Dummy object just for messages\\n try:\\n import os,multiprocessing\\n total_cores = multiprocessing.cpu_count()\\n num_threads = int(os.environ.get('OMP_NUM_THREADS',total_cores))\\n openmp_main.verbose(\\\"Using %d threads on a machine with %d detected CPUs\\\",num_threads, total_cores)\\n except:\\n pass\\n\\n # Repeatedly process options, if any, followed by filenames, if any, until nothing is left\\n topo_parser.disable_interspersed_args()\\n args=argv\\n option=None\\n global something_executed\\n while True:\\n # Process options up until the first filename\\n (option,args) = topo_parser.parse_args(args,option)\\n\\n # Handle filename\\n if args:\\n filename=args.pop(0)\\n #print \\\"Executing %s\\\" % (filename)\\n filedir = os.path.dirname(os.path.abspath(filename))\\n sys.path.insert(0,filedir) # Allow imports relative to this file's path\\n sim_name_from_filename(filename) # Default value of topo.sim.name\\n\\n execfile(filename,__main__.__dict__)\\n something_executed=True\\n\\n if not args:\\n break\\n\\n global_params.check_for_unused_names()\\n\\n # If no scripts and no commands were given, pretend -i was given.\\n if not something_executed: interactive()\\n\\n if option.gui: topo.guimain.title(topo.sim.name)\\n\\n ## INTERACTIVE SESSION BEGINS HERE (i.e. can't have anything but\\n ## some kind of cleanup code afterwards)\\n if os.environ.get('PYTHONINSPECT'):\\n print \\\"Output path: %s\\\" % param.normalize_path.prefix\\n print BANNER\\n # CBALERT: should probably allow a way for users to pass\\n # things to IPython? Or at least set up some kind of\\n # topographica ipython config file. Right now, a topo_parser\\n # option has to be added for every ipython option we want to\\n # support (e.g. see --pdb)\\n\\n if ipython_shell_interface == \\\"IPython.Shell\\\":\\n # IPython 0.10 and earlier\\n\\n # Stop IPython namespace hack?\\n # http://www.nabble.com/__main__-vs-__main__-td14606612.html\\n __main__.__name__=\\\"__mynamespace__\\\"\\n\\n ipython_args = ['-noconfirm_exit','-nobanner',\\n '-pi1',CommandPrompt.get_format(),\\n '-pi2',CommandPrompt2.get_format(),\\n '-po',OutputPrompt.get_format()]\\n if option.pdb:\\n ipython_args.append('-pdb')\\n\\n ipshell = IPShell(ipython_args,user_ns=__main__.__dict__)\\n ipshell.mainloop(sys_exit=1)\\n\\n elif ipython_shell_interface == \\\"InteractiveShellEmbed\\\":\\n # IPython 0.11 and later\\n\\n config = Config()\\n\\n if ipython_prompt_interface == \\\"PromptManager\\\":\\n config.PromptManager.in_template = CommandPrompt.get_format()\\n config.PromptManager.in2_template = CommandPrompt2.get_format()\\n config.PromptManager.out_template = OutputPrompt.get_format()\\n else:\\n config.InteractiveShell.prompt_in1 = CommandPrompt.get_format()\\n config.InteractiveShell.prompt_in2 = CommandPrompt2.get_format()\\n config.InteractiveShell.prompt_out = OutputPrompt.get_format()\\n config.InteractiveShell.confirm_exit = False\\n ipshell = IPShell(config=config,user_ns=__main__.__dict__,\\n banner1=\\\"\\\",exit_msg=\\\"\\\")\\n if option.pdb:\\n ipshell.call_pdb = True\\n\\n # Load Topographica IPython extension in embedded shell\\n try:\\n ipshell.extension_manager.load_extension('topo.misc.ipython')\\n except:\\n cmdline_main.warning(\\n \\\"Could not load IPython extension 'topo.misc.ipython'; ignored error was:\\\\n%s\\\"%traceback.format_exc())\\n\\n ipshell()\\n\\n global return_code\\n if return_code != 0:\\n cmdline_main.warning(\\\"Errors encountered; exiting with return code %d\\\" % return_code)\\n\\n sys.exit(return_code)\",\n \"def main():\\n arguments = docopt(__doc__, version='cluster_parameter_extractor 1.0 BETA')\\n\\n input_file = arguments['--input']\\n output_file = arguments[\\\"--output\\\"]\\n process_synthetic = arguments[\\\"--synthetic_peptides\\\"]\\n\\n # make sure the input file exists\\n if not os.path.isfile(input_file):\\n print(\\\"Error: Cannot find input file '\\\" + input_file + \\\"'\\\")\\n sys.exit(1)\\n\\n # make sure the output file does not exist\\n if os.path.isfile(output_file):\\n print(\\\"Error: Output file exists '\\\" + output_file + \\\"'\\\")\\n sys.exit(1)\\n\\n with open(output_file, \\\"w\\\") as OUT:\\n # write the header\\n OUT.write(\\\"id\\\\tprecursor_mz\\\\tav_charge\\\\tsize\\\\tidentified_spec_count\\\\tunidentified_spec_count\\\\t\\\"\\n \\\"max_ratio\\\\tmax_il_ratio\\\\tprecursor_mz_range\\\\tsequences\\\\t\\\"\\n \\\"max_sequence\\\\tmax_sequence_count\\\\tmax_sequence_mods\\\\t\\\"\\n \\\"second_max_sequence\\\\tsecond_max_sequence_count\\\\tsecond_max_sequence_mods\\\\tn_input_files\\\\t\\\"\\n \\\"max_consensus_peak_rel_tic\\\\tmax_consensus_peak_mz\\\")\\n\\n if process_synthetic:\\n OUT.write(\\\"\\\\tsynth_count\\\\tsynth_ratio\\\\tsynth_max_sequence\\\")\\n\\n OUT.write(\\\"\\\\n\\\")\\n\\n # process the file\\n parser = clustering_parser.ClusteringParser(input_file)\\n\\n for cluster in parser:\\n cluster_line = process_cluster(cluster)\\n OUT.write(cluster_line)\\n\\n # process synthetic peptides\\n if process_synthetic:\\n synth_line = process_synthetic_peptides(cluster)\\n OUT.write(\\\"\\\\t\\\" + synth_line)\\n\\n OUT.write(\\\"\\\\n\\\")\\n\\n print(\\\"Results written to \\\" + output_file)\",\n \"def test_cmdlineproc_test9():\\n\\n parameters = {\\n \\\"debug\\\": False,\\n \\\"disconnect\\\": False,\\n \\\"executable\\\": \\\"\\\",\\n \\\"executableargs\\\": \\\"\\\",\\n \\\"hosts\\\": \\\"\\\",\\n \\\"job\\\": \\\"\\\",\\n \\\"jobname\\\": \\\"\\\",\\n \\\"log\\\": \\\"\\\",\\n \\\"recover\\\": \\\"\\\",\\n \\\"resource\\\": \\\"\\\",\\n \\\"replicates\\\": \\\"\\\",\\n \\\"verbose\\\": False\\n }\\n\\n commandlineargs = [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--disconnect\\\", \\\"--replicates\\\", \\\"1000\\\", \\\"test.exe\\\",\\n \\\"-i\\\", \\\"input.file\\\", \\\"param1\\\", \\\"--someflag\\\"]\\n\\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\\n\\n assert parameters[\\\"executable\\\"] == \\\"test.exe\\\"\\n assert parameters[\\\"executableargs\\\"] == \\\"-i input.file param1 --someflag\\\"\\n assert longbowargs == [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--disconnect\\\", \\\"--replicates\\\", \\\"1000\\\"]\",\n \"def lammps(parameter, iteration, numberlist, density, chainlength):\\n # input parameters\\n var = parameter[0]\\n x = var * numberlist[0]\\n y = var * numberlist[1] * 1.732 / 2\\n z = x / 2\\n #nodeid = 55 + iteration % 5\\n M = int((x * y * z * density - 4 * numberlist[0] * numberlist[1] * int(z / 0.3)) / chainlength) \\n os.environ['var'] = str(var)\\n os.environ['iteration'] = str(iteration)\\n os.environ['M'] = str(M)\\n #os.environ['nodeid'] = str(nodeid)\\n # copy the files to modify\\n os.system(\\\"cp in.asymmetric in.asymmetric_$iteration\\\")\\n os.system(\\\"cp run_lammps.sh run_lammps_$iteration.sh\\\")\\n os.system(\\\"cp MultiBCP_hexagonal_post.py MultiBCP_hexagonal_post_$iteration.py\\\")\\n # modify relevant files\\n os.system('sed -i -e \\\"s/distance = 12/distance = $var/\\\" MultiBCP_hexagonal_post_$iteration.py')\\n os.system(\\\"python MultiBCP_hexagonal_post_$iteration.py\\\")\\n time.sleep(3)\\n os.system('sed -i -e \\\"s/3072/$M/\\\" in.asymmetric_$iteration')#modify according to the parameters\\n os.system('sed -i -e \\\"s/XN_100/XN_100_$iteration/\\\" in.asymmetric_$iteration')\\n os.system('sed -i -e \\\"s/finalasymmetric/finalasymmetric_$iteration/\\\" in.asymmetric_$iteration')\\n os.system('sed -i -e \\\"s/POSTA2B8/POSTA2B8_$iteration/\\\" run_lammps_$iteration.sh')\\n os.system('sed -i -e \\\"s/posta2b8.out/posta2b8_$iteration.out/\\\" run_lammps_$iteration.sh')\\n #os.system('sed -i -e \\\"s/node55/node$nodeid/\\\" run_lammps_$iteration.sh')\\n os.system('sed -i -e \\\"s/in.asymmetric/in.asymmetric_$iteration/\\\" run_lammps_$iteration.sh')\\n # run the simulation\\n os.system(\\\"sbatch run_lammps_$iteration.sh\\\")\\n return None\",\n \"def main(command_line_parameters = None):\\n\\n global task_count, job_count, job_ids, score_directories\\n job_count = 0\\n task_count = 0\\n job_ids = {}\\n score_directories = []\\n\\n command_line_options(command_line_parameters)\\n\\n global configuration, place_holder_key\\n configuration = utils.read_config_file([args.configuration_file])\\n place_holder_key = args.place_holder_key\\n\\n if args.preprocessor:\\n configuration.preprocessor = args.preprocessor\\n if args.extractor:\\n configuration.extractor = args.extractor\\n if args.algorithm:\\n configuration.algorithm = args.algorithm\\n\\n if args.replace_variable is not None:\\n exec(\\\"configuration.replace = configuration.%s\\\" % args.replace_variable)\\n\\n for attribute in ('preprocessor', 'extractor', 'algorithm'):\\n if not hasattr(configuration, attribute):\\n raise ValueError(\\\"The given configuration file '%s' does not contain the required attribute '%s', and it was not given on command line either\\\" %(args.configuration_file, attribute))\\n\\n # extract the dictionary of replacements from the configuration\\n if not hasattr(configuration, 'replace'):\\n raise ValueError(\\\"Please define a set of replacements using the 'replace' keyword.\\\")\\n if not hasattr(configuration, 'imports'):\\n configuration.imports = ['bob.bio.base']\\n logger.info(\\\"No 'imports' specified in configuration file '%s' -> using default %s\\\", args.configuration_file, configuration.imports)\\n\\n if not hasattr(configuration, 'requirements'):\\n configuration.requirements = []\\n\\n replace_dict = {}\\n for step, replacements in configuration.replace.items():\\n for key in replacements.keys():\\n if key in replace_dict:\\n raise ValueError(\\\"The replacement key '%s' was defined multiple times. Please use each key only once.\\\")\\n # we always start with index 0.\\n replace_dict[key] = 0\\n\\n # now, iterate through the list of replacements and create the according calls\\n create_recursive(replace_dict, step_index = 0, directories = {}, dependency_level = 0)\\n\\n # finally, write some information about the\\n if args.grid is not None:\\n logger.info(\\\"The number of executed tasks is: %d, which are split up into %d jobs that are executed in the grid\\\" , task_count, job_count)\\n\\n if args.parallel is not None:\\n logger.info(\\\"The total amount of finsihed tasks is: %d\\\", task_count)\\n\\n return score_directories\",\n \"def _parse_args():\\n parser = argparse.ArgumentParser(description='main.py')\\n \\n # General system running and configuration options\\n parser.add_argument('--do_nearest_neighbor', dest='do_nearest_neighbor', default=False, action='store_true', help='run the nearest neighbor model')\\n parser.add_argument('--debug', dest='debug', default=False, action='store_true', help='set to debug mode ')\\n parser.add_argument('--num_train_sentence', dest='num_train_sentence', type=int, default=-1,\\n help='set number of sentence to train on')\\n parser.add_argument('--train_path', type=str, default='data/geo_train.tsv', help='path to train data')\\n parser.add_argument('--dev_path', type=str, default='data/geo_dev.tsv', help='path to dev data')\\n parser.add_argument('--test_path', type=str, default='data/geo_test.tsv', help='path to blind test data')\\n parser.add_argument('--test_output_path', type=str, default='geo_test_output.tsv', help='path to write blind test results')\\n parser.add_argument('--domain', type=str, default='geo', help='domain (geo for geoquery)')\\n parser.add_argument('--attn_model', type=str, default='general', help='Attention model to use: general (default), dot, concat')\\n\\n # Some common arguments for your convenience\\n parser.add_argument('--seed', type=int, default=0, help='RNG seed (default = 0)')\\n parser.add_argument('--epochs', type=int, default=100, help='num epochs to train for')\\n parser.add_argument('--lr', type=float, default=.001)\\n parser.add_argument('--batch_size', type=int, default=2, help='batch size')\\n # 65 is all you need for GeoQuery\\n parser.add_argument('--decoder_len_limit', type=int, default=65, help='output length limit of the decoder')\\n\\n # Feel free to add other hyperparameters for your input dimension, etc. to control your network\\n # 50-200 might be a good range to start with for embedding and LSTM sizes\\n args = parser.parse_args()\\n return args\",\n \"def main():\\r\\n# Checking if argument was provided\\r\\n if len(sys.argv) <=1:\\r\\n print_usage()\\r\\n sys.exit(1)\\r\\n \\r\\n for arg in sys.argv:\\r\\n # Checking if help was called\\r\\n if arg == \\\"-h\\\" or arg == \\\"--help\\\":\\r\\n print_usage()\\r\\n sys.exit(1)\\r\\n \\r\\n # Checking for verbose mode \\r\\n if arg == \\\"-v\\\" or arg == \\\"--verbose\\\":\\r\\n global verbose_flag\\r\\n verbose_flag=1\\r\\n\\r\\n # Checking for input file\\r\\n if arg == \\\"-f\\\" or arg == \\\"--file\\\":\\r\\n global default_input_path\\r\\n global default_output_path\\r\\n default_input_path = sys.argv[2]\\r\\n default_output_path=default_input_path[:-4] + \\\"_results.txt\\\"\\r\\n\\r\\n #if arg == \\\"-u\\\" or arg == \\\"--url\\\":\\r\\n # input_url = sys.argv[2]\\r\\n\\t \\r\\n if os.name == \\\"nt\\\":\\r\\n os.system('cls')\\r\\n else:\\r\\n os.system('clear')\\r\\n \\r\\n process_from_file()\",\n \"def test_cmdlineproc_test11():\\n\\n parameters = {\\n \\\"debug\\\": False,\\n \\\"disconnect\\\": False,\\n \\\"executable\\\": \\\"\\\",\\n \\\"executableargs\\\": \\\"\\\",\\n \\\"hosts\\\": \\\"\\\",\\n \\\"job\\\": \\\"\\\",\\n \\\"jobname\\\": \\\"\\\",\\n \\\"log\\\": \\\"\\\",\\n \\\"recover\\\": \\\"\\\",\\n \\\"resource\\\": \\\"\\\",\\n \\\"replicates\\\": \\\"\\\",\\n \\\"verbose\\\": False\\n }\\n\\n commandlineargs = [\\\"test.exe\\\", \\\"-i\\\", \\\"input.file\\\", \\\"param1\\\", \\\"--someflag\\\"]\\n\\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\\n\\n assert parameters[\\\"executable\\\"] == \\\"test.exe\\\"\\n assert parameters[\\\"executableargs\\\"] == \\\"-i input.file param1 --someflag\\\"\\n assert longbowargs == []\",\n \"def main():\\n # Default input parameters\\n nelx, nely, volfrac, penalty, rmin, ft = cli.parse_args(\\n nelx=120, volfrac=0.2, penalty=6.0, rmin=1.5)\\n bc = DistributedMultipleLoadsBoundaryConditions(nelx, nely)\\n problem = ComplianceProblem(bc, penalty)\\n cli.main(nelx, nely, volfrac, penalty, rmin, ft, bc=bc,\\n problem=problem)\",\n \"def main(options):\\n # Check if path to MIRZA is valid\\n if not is_executable(options.mirzabin):\\n raise Exception(\\\"Path to MIRZA is invalid (%s)! Please define it with --mirzabin option.\\\" % options.mirzabin)\\n if options.verbose:\\n syserr(\\\"Reading coordinate file\\\\n\\\")\\n coords = read_coordinates(options.coords, True)\\n\\n if options.verbose:\\n syserr(\\\"Reading mRNA sequences\\\\n\\\")\\n mRNAseqs = read_fasta_to_dict(options.seq)\\n\\n if options.verbose:\\n syserr(\\\"Reading miRNA sequences\\\\n\\\")\\n miRNAseqs = read_fasta_to_dict(options.motifs)\\n\\n if options.onlymirza != 'yes':\\n if options.verbose:\\n syserr(\\\"Preparing alignments and phylogenetic tree\\\\n\\\")\\n\\n phylo_tree = read_phylogenetic_tree(options.tree)\\n multiple_alignment_dict = read_multiple_alignments(phylo_tree,\\n options.mln_dir,\\n coords)\\n mirhomologues = make_homologues_mirnas(phylo_tree, miRNAseqs)\\n\\n with gzip.open(options.out, 'wb') as outfile:\\n if options.verbose:\\n syserr(\\\"Collecting sequences\\\\n\\\")\\n mRNA_sequences = [cor[-1] for cor in coords]\\n mRNA_ids = [\\\"%s,%s,%s\\\" % (cor[0], cor[2], cor[3]) for cor in coords]\\n number_of_coords = len(set([cor[1] for cor in coords])) == 1\\n if number_of_coords > 1:\\n raise Exception(\\\"More than mirna in coordinate file\\\")\\n if number_of_coords == 0:\\n syserr(\\\"There is no coordinates. Exit.\\\")\\n sys.exit()\\n\\n miRNAseq = miRNAseqs[list(set([cor[1] for cor in coords]))[0]][:21]\\n miRNAid = list(set([cor[1] for cor in coords]))[0]\\n\\n if options.verbose:\\n syserr(\\\"Running MIRZA\\\\n\\\")\\n results = calculate_mirza(mRNA_sequences, mRNA_ids, miRNAseq, miRNAid)\\n\\n if options.verbose:\\n syserr(\\\"Collecting results\\\\n\\\")\\n for key, group in itertools.groupby(results.splitlines(), lambda x: x == \\\"\\\"):\\n if not key:\\n proper_group = False\\n for line in group:\\n if line.startswith(\\\">\\\"):\\n mRNAid = line.split()[0][1:].split(\\\",\\\")[0]\\n beg = line.split()[0][1:].split(\\\",\\\")[1]\\n end = line.split()[0][1:].split(\\\",\\\")[2]\\n score = float(line.split()[-1])\\n proper_group = True\\n # elif line.startswith(\\\"miRNA\\\"):\\n # mirhyb = line.split(\\\"\\\\t\\\")[1].split(\\\" \\\")[0]\\n # elif line.startswith(\\\"A L\\\"):\\n # hyb = line.split(\\\"\\\\t\\\")[1].rstrip()\\n elif line.startswith(\\\"mRNA\\\"):\\n mrhyb = line.split(\\\"\\\\t\\\")[1].split(\\\" \\\")[0]\\n if proper_group:\\n if len(miRNAseq) < 21:\\n outtext = '%s,%s,%s,%s\\\\t%s\\\\t%s\\\\t%s\\\\t%s\\\\t%s\\\\n' % (mRNAid,\\n miRNAid,\\n beg,\\n end,\\n \\\"NA\\\",\\n \\\"NA\\\",\\n \\\"NA\\\",\\n \\\"NA\\\",\\n \\\"NA\\\")\\n outfile.write(outtext)\\n continue\\n\\n # hybrids = [mirhyb, hyb, mrhyb]\\n # mirseq, hybseq, mrhybseq, mrpos = get_hybrid_vector(hybrids)\\n # canonical, type_of_site = is_canonical([mirseq, hybseq, mrhybseq])\\n if options.onlymirza != 'yes':\\n try:\\n mln_frag = multiple_alignment_dict[mRNAid]\\n qd = calculate_conservation(phylotree=phylo_tree,\\n mrna_frag=mrhyb.replace(\\\"-\\\", \\\"\\\")[::-1],\\n mrnaid=mRNAid,\\n mirna=mirhomologues,\\n mirname=miRNAid,\\n mln_dict=mln_frag,\\n ref_org=options.reforg,\\n threshold=options.thr,\\n mrna_len=options.contextLen)\\n qd = str(qd)\\n except KeyError, e:\\n qd = \\\"NA\\\"\\n sys.stderr.write(\\\"KeyError: \\\" + str(e) + \\\"\\\\n\\\")\\n sys.stderr.write(\\\"Trace: \\\"\\n + traceback.format_exc()\\n + \\\"\\\\n\\\")\\n # raise KeyError\\n else:\\n qd = \\\"NA\\\"\\n outtext = '%s,%s,%s,%s\\\\t%f\\\\t%s\\\\n' % (mRNAid,\\n miRNAid,\\n beg,\\n end,\\n score,\\n # \\\":\\\".join(hybrids),\\n qd)\\n # \\\"canonical\\\" if canonical else \\\"non-canonical\\\",\\n # type_of_site)\\n outfile.write(outtext)\\n clean()\",\n \"def main(argv=None):\\n\\n if not argv:\\n argv = sys.argv\\n\\n # setup command line parser\\n parser = E.OptionParser(version=\\\"%prog version: $Id$\\\",\\n usage=globals()[\\\"__doc__\\\"])\\n\\n parser.add_option(\\\"-b\\\", \\\"--bam-file\\\", dest=\\\"bam\\\", type=\\\"string\\\",\\n help=\\\"BAM file containing iCLIP reads\\\")\\n parser.add_option(\\\"-s\\\", \\\"--spread\\\", dest=\\\"spread\\\", type=\\\"int\\\",\\n default=15,\\n help=\\\"Number of bases each site of each bases\\\"\\n \\\"to use when calculating height\\\")\\n parser.add_option(\\\"-r\\\", \\\"--randomisations\\\", dest=\\\"rands\\\", type=\\\"int\\\",\\n default=100,\\n help=\\\"Number of randomisations to use when\\\"\\n \\\"calculating FDR\\\")\\n parser.add_option(\\\"-t\\\", \\\"--threshold\\\", dest=\\\"threshold\\\", type=\\\"float\\\",\\n default=0.05,\\n help=\\\"FDR threshold on which to select bases\\\")\\n parser.add_option(\\\"-f\\\", \\\"--feature\\\", dest=\\\"feature\\\", type=\\\"choice\\\",\\n choices=[\\\"transcript\\\", \\\"gene\\\"],\\n default=\\\"gene\\\",\\n help=\\\"GTF feature to use. Gene or transcript\\\")\\n parser.add_option(\\\"-p\\\", \\\"--processes\\\", dest=\\\"proc\\\", type=\\\"int\\\",\\n default=None,\\n help=\\\"Number of processes to use for multiprocessing\\\")\\n\\n # add common options (-h/--help, ...) and parse command line\\n (options, args) = E.Start(parser, argv=argv)\\n\\n if options.proc:\\n try:\\n import multiprocessing\\n pool = multiprocessing.Pool(options.proc)\\n except ImportError:\\n E.warn(\\\"Failed to setup multiprocessing, using single processor\\\")\\n pool = None\\n else:\\n pool = None\\n\\n if options.feature == \\\"gene\\\":\\n iterator = GTF.flat_gene_iterator(GTF.iterator(options.stdin))\\n elif options.feature == \\\"transcript\\\":\\n iterator = GTF.transcript_iterator(GTF.iterator(options.stdin))\\n else:\\n raise ValueError(\\\"Unknown feature type %s\\\" % options.feature)\\n\\n bam = pysam.AlignmentFile(options.bam)\\n\\n results = clusters.get_crosslink_fdr_by_randomisation(\\n iterator, bam, options.rands, options.spread, pool)\\n\\n results = results[results <= options.threshold]\\n results = results.sort_index()\\n results = results.reset_index()\\n results.columns = [\\\"contig\\\", \\\"start\\\", \\\"FDR\\\"]\\n results[\\\"start\\\"] = results[\\\"start\\\"].astype(\\\"int\\\")\\n results[\\\"end\\\"] = results.start + 1\\n results = results.loc[:,[\\\"contig\\\", \\\"start\\\", \\\"end\\\", \\\"FDR\\\"]]\\n results[\\\"FDR\\\"] = -numpy.log10(results[\\\"FDR\\\"])\\n results.to_csv(options.stdout, header=False, index=False, sep=\\\"\\\\t\\\")\\n # write footer and output benchmark information.\\n E.Stop()\",\n \"def main(cliargs=None):\\n\\n try:\\n args = parsecli(cliargs)\\n # checkargs(args)\\n result = 0 # process(args)\\n log.info(\\\"Done.\\\")\\n return result\\n\\n except KeyboardInterrupt:\\n return 10\",\n \"def test_cmdlineproc_test8():\\n\\n parameters = {\\n \\\"debug\\\": False,\\n \\\"disconnect\\\": False,\\n \\\"executable\\\": \\\"\\\",\\n \\\"executableargs\\\": \\\"\\\",\\n \\\"hosts\\\": \\\"\\\",\\n \\\"job\\\": \\\"\\\",\\n \\\"jobname\\\": \\\"\\\",\\n \\\"log\\\": \\\"\\\",\\n \\\"recover\\\": \\\"\\\",\\n \\\"resource\\\": \\\"\\\",\\n \\\"replicates\\\": \\\"\\\",\\n \\\"verbose\\\": False\\n }\\n\\n commandlineargs = [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--replicates\\\", \\\"1000\\\", \\\"--disconnect\\\", \\\"test.exe\\\",\\n \\\"-i\\\", \\\"input.file\\\", \\\"param1\\\", \\\"--someflag\\\"]\\n\\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\\n\\n assert parameters[\\\"executable\\\"] == \\\"test.exe\\\"\\n assert parameters[\\\"executableargs\\\"] == \\\"-i input.file param1 --someflag\\\"\\n assert longbowargs == [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--replicates\\\", \\\"1000\\\", \\\"--disconnect\\\"]\",\n \"def _parse_args():\\n parser = argparse.ArgumentParser(description='main.py')\\n \\n # General system running and configuration options\\n parser.add_argument('--do_nearest_neighbor', dest='do_nearest_neighbor', default=False, action='store_true', help='run the nearest neighbor model')\\n\\n parser.add_argument('--train_path', type=str, default='data/geo_train.tsv', help='path to train data')\\n parser.add_argument('--dev_path', type=str, default='data/geo_dev.tsv', help='path to dev data')\\n parser.add_argument('--test_path', type=str, default='data/geo_test.tsv', help='path to blind test data')\\n parser.add_argument('--test_output_path', type=str, default='geo_test_output.tsv', help='path to write blind test results')\\n parser.add_argument('--domain', type=str, default='geo', help='domain (geo for geoquery)')\\n \\n # Some common arguments for your convenience\\n parser.add_argument('--seed', type=int, default=0, help='RNG seed (default = 0)')\\n parser.add_argument('--epochs', type=int, default=100, help='num epochs to train for')\\n parser.add_argument('--lr', type=float, default=.001)\\n parser.add_argument('--batch_size', type=int, default=2, help='batch size')\\n # 65 is all you need for GeoQuery\\n parser.add_argument('--decoder_len_limit', type=int, default=65, help='output length limit of the decoder')\\n\\n # Feel free to add other hyperparameters for your input dimension, etc. to control your network\\n # 50-200 might be a good range to start with for embedding and LSTM sizes\\n args = parser.parse_args()\\n return args\",\n \"def main(argv=None):\\n\\n parser = ArgParser(\\n description=\\\"Extrapolate input data to required lead times.\\\")\\n parser.add_argument(\\\"input_filepath\\\", metavar=\\\"INPUT_FILEPATH\\\",\\n type=str, help=\\\"Path to input NetCDF file.\\\")\\n\\n group = parser.add_mutually_exclusive_group()\\n group.add_argument(\\\"--output_dir\\\", metavar=\\\"OUTPUT_DIR\\\", type=str,\\n default=\\\"\\\", help=\\\"Directory to write output files.\\\")\\n group.add_argument(\\\"--output_filepaths\\\", nargs=\\\"+\\\", type=str,\\n help=\\\"List of full paths to output nowcast files, in \\\"\\n \\\"order of increasing lead time.\\\")\\n\\n optflw = parser.add_argument_group('Advect using files containing the x '\\n ' and y components of the velocity')\\n optflw.add_argument(\\\"--eastward_advection_filepath\\\", type=str, help=\\\"Path\\\"\\n \\\" to input file containing Eastward advection \\\"\\n \\\"velocities.\\\")\\n optflw.add_argument(\\\"--northward_advection_filepath\\\", type=str, help=\\\"Path\\\"\\n \\\" to input file containing Northward advection \\\"\\n \\\"velocities.\\\")\\n\\n speed = parser.add_argument_group('Advect using files containing speed and'\\n ' direction')\\n speed.add_argument(\\\"--advection_speed_filepath\\\", type=str, help=\\\"Path\\\"\\n \\\" to input file containing advection speeds,\\\"\\n \\\" usually wind speeds, on multiple pressure levels.\\\")\\n speed.add_argument(\\\"--advection_direction_filepath\\\", type=str,\\n help=\\\"Path to input file containing the directions from\\\"\\n \\\" which advection speeds are coming (180 degrees from\\\"\\n \\\" the direction in which the speed is directed). The\\\"\\n \\\" directions should be on the same grid as the input\\\"\\n \\\" speeds, including the same vertical levels.\\\")\\n speed.add_argument(\\\"--pressure_level\\\", type=int, default=75000, help=\\\"The\\\"\\n \\\" pressure level in Pa to extract from the multi-level\\\"\\n \\\" advection_speed and advection_direction files. The\\\"\\n \\\" velocities at this level are used for advection.\\\")\\n parser.add_argument(\\\"--orographic_enhancement_filepaths\\\", nargs=\\\"+\\\",\\n type=str, default=None, help=\\\"List or wildcarded \\\"\\n \\\"file specification to the input orographic \\\"\\n \\\"enhancement files. Orographic enhancement files are \\\"\\n \\\"compulsory for precipitation fields.\\\")\\n parser.add_argument(\\\"--json_file\\\", metavar=\\\"JSON_FILE\\\", default=None,\\n help=\\\"Filename for the json file containing \\\"\\n \\\"required changes to the metadata. Information \\\"\\n \\\"describing the intended contents of the json file \\\"\\n \\\"is available in \\\"\\n \\\"improver.utilities.cube_metadata.amend_metadata.\\\"\\n \\\"Every output cube will have the metadata_dict \\\"\\n \\\"applied. Defaults to None.\\\", type=str)\\n parser.add_argument(\\\"--max_lead_time\\\", type=int, default=360,\\n help=\\\"Maximum lead time required (mins).\\\")\\n parser.add_argument(\\\"--lead_time_interval\\\", type=int, default=15,\\n help=\\\"Interval between required lead times (mins).\\\")\\n\\n accumulation_args = parser.add_argument_group(\\n 'Calculate accumulations from advected fields')\\n accumulation_args.add_argument(\\n \\\"--accumulation_fidelity\\\", type=int, default=0,\\n help=\\\"If set, this CLI will additionally return accumulations\\\"\\n \\\" calculated from the advected fields. This fidelity specifies the\\\"\\n \\\" time interval in minutes between advected fields that is used to\\\"\\n \\\" calculate these accumulations. This interval must be a factor of\\\"\\n \\\" the lead_time_interval.\\\")\\n accumulation_args.add_argument(\\n \\\"--accumulation_period\\\", type=int, default=15,\\n help=\\\"The period over which the accumulation is calculated (mins). \\\"\\n \\\"Only full accumulation periods will be computed. At lead times \\\"\\n \\\"that are shorter than the accumulation period, no accumulation \\\"\\n \\\"output will be produced.\\\")\\n accumulation_args.add_argument(\\n \\\"--accumulation_units\\\", type=str, default='m',\\n help=\\\"Desired units in which the accumulations should be expressed,\\\"\\n \\\"e.g. mm\\\")\\n\\n # Load Cubes\\n args = parser.parse_args(args=argv)\\n\\n metadata_dict = load_json_or_none(args.json_file)\\n\\n upath, vpath = (args.eastward_advection_filepath,\\n args.northward_advection_filepath)\\n spath, dpath = (args.advection_speed_filepath,\\n args.advection_direction_filepath)\\n\\n # load files and initialise advection plugin\\n input_cube = load_cube(args.input_filepath)\\n orographic_enhancement_cube = load_cube(\\n args.orographic_enhancement_filepaths, allow_none=True)\\n\\n speed_cube = direction_cube = ucube = vcube = None\\n if (upath and vpath) and not (spath or dpath):\\n ucube = load_cube(upath)\\n vcube = load_cube(vpath)\\n elif (spath and dpath) and not (upath or vpath):\\n level_constraint = Constraint(pressure=args.pressure_level)\\n try:\\n speed_cube = load_cube(spath, constraints=level_constraint)\\n direction_cube = load_cube(dpath, constraints=level_constraint)\\n except ValueError as err:\\n raise ValueError(\\n '{} Unable to extract specified pressure level from given '\\n 'speed and direction files.'.format(err))\\n else:\\n raise ValueError('Cannot mix advection component velocities with speed'\\n ' and direction')\\n\\n # Process Cubes\\n accumulation_cubes, forecast_to_return = process(\\n input_cube, ucube, vcube, speed_cube, direction_cube,\\n orographic_enhancement_cube, metadata_dict, args.max_lead_time,\\n args.lead_time_interval, args.accumulation_fidelity,\\n args.accumulation_period, args.accumulation_units)\\n\\n # Save Cube\\n if args.output_filepaths and \\\\\\n len(args.output_filepaths) != len(forecast_to_return):\\n raise ValueError(\\\"Require exactly one output file name for each \\\"\\n \\\"forecast lead time\\\")\\n for i, cube in enumerate(forecast_to_return):\\n # save to a suitably-named output file\\n if args.output_filepaths:\\n file_name = args.output_filepaths[i]\\n else:\\n file_name = os.path.join(\\n args.output_dir, generate_file_name(cube))\\n save_netcdf(cube, file_name)\\n\\n if args.accumulation_fidelity > 0:\\n # return accumulation cubes\\n for i, cube in enumerate(accumulation_cubes):\\n file_name = os.path.join(args.output_dir, generate_file_name(cube))\\n save_netcdf(cube, file_name)\",\n \"def test_cmdlineproc_test5():\\n\\n parameters = {\\n \\\"debug\\\": False,\\n \\\"disconnect\\\": False,\\n \\\"executable\\\": \\\"\\\",\\n \\\"executableargs\\\": \\\"\\\",\\n \\\"hosts\\\": \\\"\\\",\\n \\\"job\\\": \\\"\\\",\\n \\\"jobname\\\": \\\"\\\",\\n \\\"log\\\": \\\"\\\",\\n \\\"recover\\\": \\\"\\\",\\n \\\"resource\\\": \\\"\\\",\\n \\\"replicates\\\": \\\"\\\",\\n \\\"verbose\\\": False\\n }\\n\\n commandlineargs = [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--replicates\\\", \\\"1000\\\", \\\"--disconnect\\\", \\\"pmemd.MPI\\\"]\\n\\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\\n\\n assert parameters[\\\"executable\\\"] == \\\"pmemd.MPI\\\"\\n assert parameters[\\\"executableargs\\\"] == \\\"\\\"\\n assert longbowargs == [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--replicates\\\", \\\"1000\\\", \\\"--disconnect\\\"]\",\n \"def run_parallel(heritability, x_start_i, x_stop_i, cluster='usc'):\\n\\trun_id = 'corr_trait_sim'\\n\\tjob_id = ' % s_ % d_ % d' % (run_id, x_start_i, x_stop_i)\\n\\tfile_prefix = env.env['results_dir'] + run_id + '_' + str(x_start_i) + '_' + str(x_stop_i)\\n\\n\\t#Cluster specific parameters\\t\\n\\tif cluster == 'gmi': #GMI cluster.\\n\\t\\tshstr = '#!/bin/sh\\\\n'\\n\\t\\tshstr += '#$ -N %s\\\\n' % job_id\\n\\t\\tshstr += \\\"#$ -q q.norm@blade*\\\\n\\\"\\n\\t\\tshstr += '#$ -o %s.log\\\\n' % job_id\\n\\t\\t#shstr += '#$ -cwd /home/GMI/$HOME\\\\n'\\n\\t\\t#shstr += '#$ -M bjarni.vilhjalmsson@gmi.oeaw.ac.at\\\\n\\\\n'\\n\\n\\telif cluster == 'usc': #USC cluster.\\n\\t\\tshstr = \\\"#!/bin/csh\\\\n\\\"\\n\\t\\tshstr += \\\"#PBS -l walltime=%s \\\\n\\\" % '72:00:00'\\n\\t\\tshstr += \\\"#PBS -l mem=%s \\\\n\\\" % '1950mb'\\n\\t\\tshstr += \\\"#PBS -q cmb\\\\n\\\"\\n\\t\\tshstr += \\\"#PBS -N p%s \\\\n\\\" % job_id\\n\\n\\tshstr += \\\"(python %scorr_trait_sim.py %s %d %d \\\" % (env.env['script_dir'], heritability, x_start_i, x_stop_i)\\n\\n\\tshstr += \\\"> \\\" + file_prefix + \\\"_job.out) >& \\\" + file_prefix + \\\"_job.err\\\\n\\\"\\n\\tprint '\\\\n', shstr, '\\\\n'\\n\\tscript_file_name = run_id + \\\".sh\\\"\\n\\tf = open(script_file_name, 'w')\\n\\tf.write(shstr)\\n\\tf.close()\\n\\n\\t#Execute qsub script\\n\\tos.system(\\\"qsub \\\" + script_file_name)\",\n \"def main():\\n # Check the user CLI input matches correct syntax\\n try:\\n # Specify the valid CLI options/arguments\\n opts, _ = getopt.getopt(\\n sys.argv[1:],\\n \\\"hv\\\",\\n [\\n \\\"help\\\",\\n \\\"verbose\\\",\\n \\\"input=\\\",\\n \\\"output=\\\",\\n \\\"locations=\\\",\\n \\\"trips=\\\",\\n \\\"results=\\\",\\n ],\\n )\\n except getopt.GetoptError as err:\\n print(str(err))\\n usage()\\n sys.exit(2)\\n\\n # Define input arguments and initialize default values.\\n input_file = \\\"tests/input/input1.txt\\\"\\n output_file = \\\"tests/output/output1.txt\\\"\\n locations_file = \\\"data/locations.csv\\\"\\n trips_file = \\\"data/trips.csv\\\"\\n results = 3\\n\\n # Loop through all the User CLI options/arguments\\n for opt, arg in opts:\\n if opt in (\\\"-h\\\", \\\"--help\\\"):\\n usage()\\n sys.exit()\\n elif opt in (\\\"-v\\\", \\\"--verbose\\\"):\\n logging.basicConfig()\\n logging.getLogger().setLevel(logging.DEBUG)\\n elif opt == \\\"--input\\\":\\n input_file = arg\\n\\n if not os.path.exists(input_file):\\n sys.exit(\\\"Could not find input file\\\")\\n elif opt == \\\"--output\\\":\\n output_file = arg\\n elif opt == \\\"--locations\\\":\\n locations_file = arg\\n\\n if not os.path.exists(locations_file):\\n sys.exit(\\\"Could not find locations file\\\")\\n elif opt == \\\"--trips\\\":\\n trips_file = arg\\n\\n if not os.path.exists(trips_file):\\n sys.exit(\\\"Could not find trips file\\\")\\n elif opt == \\\"--results\\\":\\n results = int(arg)\\n\\n parse(\\n locations_file,\\n trips_file,\\n input_file,\\n output_file,\\n results,\\n )\",\n \"def parseCommandLine():\\n\\n parser = argparse.ArgumentParser(\\n description='Determine photometric zeropoint of banzai-reduced LCO imaging data.')\\n\\n\\n parser.add_argument('--log-level', dest='log_level', default='INFO', choices=['DEBUG', 'INFO'],\\n help='Set the log level')\\n parser.add_argument('--ps1dir', dest='ps1dir', default='~/Catalogs/ps1odi/panstarrs/',\\n help='Directory of PS1 catalog')\\n parser.add_argument(\\\"--diagnosticplotsdir\\\", dest='outputimageRootDir', default=None,\\n help='Output directory for diagnostic photometry plots. No plots generated if option is omitted. This is a time consuming task. ')\\n parser.add_argument('--photodb', dest='imagedbPrefix', default='~/lcozpplots/lcophotzp.db',\\n help='Result output directory. .db file is written here')\\n parser.add_argument('--imagerootdir', dest='rootdir', default='/archive/engineering',\\n help=\\\"LCO archive root directory\\\")\\n parser.add_argument('--site', dest='site', default=None, help='sites code for camera')\\n parser.add_argument('--mintexp', dest='mintexp', default=60, type=float, help='Minimum exposure time to accept')\\n parser.add_argument('--redo', action='store_true')\\n parser.add_argument ('--preview', dest='processstatus', default='processed', action='store_const', const='preview')\\n\\n\\n\\n mutex = parser.add_mutually_exclusive_group()\\n mutex.add_argument('--date', dest='date', default=[None,], nargs='+', help='Specific date to process.')\\n mutex.add_argument('--lastNdays', type=int)\\n\\n\\n cameragroup = parser.add_mutually_exclusive_group()\\n\\n cameragroup.add_argument('--camera', dest='camera', default=None, help='specific camera to process. ')\\n cameragroup.add_argument('--cameratype', dest='cameratype', default=None, choices=['fs', 'fl', 'kb'],\\n help='camera type to process at selected sites to process. ')\\n cameragroup.add_argument('--crawldirectory', default=None, type=str,\\n help=\\\"process all reduced image in specific directoy\\\")\\n\\n args = parser.parse_args()\\n\\n logging.basicConfig(level=getattr(logging, args.log_level.upper()),\\n format='%(asctime)s.%(msecs).03d %(levelname)7s: %(module)20s: %(message)s')\\n\\n args.imagedbPrefix = os.path.expanduser(args.imagedbPrefix)\\n\\n if args.outputimageRootDir is not None:\\n args.outputimageRootDir = os.path.expanduser(args.outputimageRootDir)\\n print (\\\"Writing db to directory: %s\\\" % args.outputimageRootDir)\\n\\n if args.crawldirectory is not None:\\n args.crawldirectory = os.path.expanduser(args.crawldirectory)\\n\\n\\n\\n if (args.lastNdays is not None):\\n args.date=[]\\n today = datetime.datetime.utcnow()\\n for ii in range (args.lastNdays):\\n day = today - datetime.timedelta(days=ii)\\n args.date.append (day.strftime(\\\"%Y%m%d\\\"))\\n\\n args.date = args.date[::-1]\\n\\n args.ps1dir = os.path.expanduser(args.ps1dir)\\n\\n print (args.processstatus)\\n return args\",\n \"def main(args):\\n options = parseArgs(args)\\n dir = \\\"\\\"\\n # Check if were doing a local or global directory. \\n if options.outputDir.startswith(\\\"/\\\"):\\n dir = options.outputDir\\n else: dir = os.getcwd() + \\\"/\\\" + options.outputDir\\n \\n # Check that the directory doesn't exist and make it. \\n if not os.path.exists(dir):\\n os.makedirs(dir)\\n os.chdir(dir)\\n else:\\n print (\\\"The output dir provided, %s, is already in use. Aborting.\\\"%(options.outputDir))\\n exit(1)\\n\\n if options.verbose: print (\\\"Start run kallisto on a batch of fastq files (cdwManiFastqToKallisto).\\\")\\n if options.verbose: print (\\\"Making the job list...\\\")\\n makeJobList(\\\"../\\\"+options.manifestFile, open(\\\"jobList\\\",\\\"w\\\", 1),options.isMouse, options.bootstrap, options.outputDir, options.verbose)\\n \\n if options.test:\\n print (\\\"You have selected a dry run, the program is stopping now.\\\")\\n exit(1)\\n\\n # Go onto the server and run the joblist. \\n paraRunKallisto(options.verbose, os.getenv(\\\"HOST\\\")) \\n if options.verbose: print (\\\"Starting the parasol run...\\\")\\n if options.verbose: print (\\\"Completed run kallisto on a batch of fastq files (cdwManiFastqToKallisto).\\\")\",\n \"def execute(self, parameters, messages):\\r\\n\\r\\n # Gather all necessary parameters\\r\\n in_nc = parameters[0].valueAsText\\r\\n in_csv = parameters[1].valueAsText\\r\\n basin_mask = parameters[2].valueAsText\\r\\n routing = parameters[3].valueAsText\\r\\n Lake_routing = parameters[4].valueAsText\\r\\n in_reservoir = parameters[5].valueAsText\\r\\n in_raster = parameters[6].valueAsText\\r\\n cellsize = parameters[7].valueAsText\\r\\n threshold = parameters[8].valueAsText\\r\\n ovroughrtfac_val = parameters[9].valueAsText\\r\\n retdeprtfac_val = parameters[10].valueAsText\\r\\n out_zip = parameters[11].valueAsText\\r\\n\\r\\n # Prepare output log file\\r\\n outtable = open(os.path.join(os.path.dirname(out_zip), os.path.basename(out_zip) + '.log'), \\\"w\\\")\\r\\n loglines = ['Begining processing on %s' %time.ctime()]\\r\\n loglines.append('64-bit background geoprocessing: %s' %bit64)\\r\\n tic = time.time()\\r\\n loglines.append('Input parameters:')\\r\\n for param in parameters:\\r\\n loglines.append(' Parameter: %s: %s' %(param.displayName, param.valueAsText))\\r\\n outtable.writelines(\\\"\\\\n\\\".join(loglines) + \\\"\\\\n\\\")\\r\\n\\r\\n # Create scratch directory for temporary outputs\\r\\n projdir = os.path.dirname(out_zip) + os.sep + 'scratchdir' # This is the only instance where we need the 'os' module!\\r\\n if not os.path.exists(projdir):\\r\\n os.makedirs(projdir)\\r\\n arcpy.env.overwriteOutput = True\\r\\n arcpy.env.workspace = projdir\\r\\n arcpy.env.scratchWorkspace = projdir\\r\\n\\r\\n # Set the input units to meters\\r\\n inunits = 'm'\\r\\n\\r\\n # Interpret the input for reservoir routing\\r\\n if Lake_routing == 'false':\\r\\n in_lakes = ''\\r\\n else:\\r\\n in_lakes = in_reservoir\\r\\n\\r\\n # Step 1 - Georeference geogrid file\\r\\n\\r\\n LU_INDEX, sr2, Projection_String, loglines = wrf_hydro_functions.georeference_geogrid_file(arcpy, in_nc, 'LU_INDEX') # Process: Generate LU Index grid\\r\\n outtable.writelines(\\\"\\\\n\\\".join(loglines) + \\\"\\\\n\\\")\\r\\n \\r\\n hgt_m_raster, sr2, Projection_String, loglines = wrf_hydro_functions.georeference_geogrid_file(arcpy, in_nc, 'HGT_M')\\r\\n outtable.writelines(\\\"\\\\n\\\".join(loglines) + \\\"\\\\n\\\")\\r\\n\\r\\n\\r\\n # Step 2 - Create high resolution topography layers\\r\\n mosprj, cellsize1, cellsize2, loglines = wrf_hydro_functions.create_high_res_topogaphy(arcpy, in_raster, hgt_m_raster, cellsize, sr2, projdir)\\r\\n outtable.writelines(\\\"\\\\n\\\".join(loglines) + \\\"\\\\n\\\")\\r\\n\\r\\n # Step 3 - Create latitude and longitude rasters\\r\\n loglines = wrf_hydro_functions.create_lat_lon_rasters(arcpy, projdir, mosprj)\\r\\n outtable.writelines(\\\"\\\\n\\\".join(loglines) + \\\"\\\\n\\\")\\r\\n\\r\\n # Step 4 - Hyrdo processing functions\\r\\n loglines = wrf_hydro_functions.sa_functions(arcpy, basin_mask, mosprj, ovroughrtfac_val, retdeprtfac_val, projdir, in_csv, out_zip, threshold, inunits, LU_INDEX, cellsize1, cellsize2, routing, in_lakes) # , mosprj2,\\r\\n outtable.writelines(\\\"\\\\n\\\".join(loglines) + \\\"\\\\n\\\")\\r\\n\\r\\n # Clean up and give finishing message\\r\\n #del LU_INDEX, hgt_m_raster\\r\\n #shutil.rmtree(projdir)\\r\\n loglines = ['Completed without error in %s seconds.\\\\n' %(time.time()-tic)]\\r\\n arcpy.AddMessage(loglines[-1])\\r\\n outtable.write(loglines[-1])\\r\\n outtable.close()\\r\\n return\",\n \"def main():\\n parser = argparse.ArgumentParser(description=\\\"Renumber atoms and residues from a 3D structure.\\\", formatter_class=lambda prog: argparse.RawTextHelpFormatter(prog, width=99999))\\n parser.add_argument('-c', '--config', required=False, help=\\\"This file can be a YAML file, JSON file or JSON string\\\")\\n\\n # Specific args of each building block\\n required_args = parser.add_argument_group('required arguments')\\n required_args.add_argument('-i', '--input_gro_path', required=True, help=\\\"Input GRO file name\\\")\\n required_args.add_argument('-o', '--output_gro_path', required=True, help=\\\"Output sorted GRO file name\\\")\\n\\n args = parser.parse_args()\\n config = args.config if args.config else None\\n properties = settings.ConfReader(config=config).get_prop_dic()\\n\\n # Specific call of each building block\\n sort_gro_residues(input_gro_path=args.input_gro_path,\\n output_gro_path=args.output_gro_path,\\n properties=properties)\",\n \"def test_cmdlineproc_test6():\\n\\n parameters = {\\n \\\"debug\\\": False,\\n \\\"disconnect\\\": False,\\n \\\"executable\\\": \\\"\\\",\\n \\\"executableargs\\\": \\\"\\\",\\n \\\"hosts\\\": \\\"\\\",\\n \\\"job\\\": \\\"\\\",\\n \\\"jobname\\\": \\\"\\\",\\n \\\"log\\\": \\\"\\\",\\n \\\"recover\\\": \\\"\\\",\\n \\\"resource\\\": \\\"\\\",\\n \\\"replicates\\\": \\\"\\\",\\n \\\"verbose\\\": False\\n }\\n\\n commandlineargs = [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--maxtime\\\", \\\"01:00\\\", \\\"--replicates\\\", \\\"1000\\\",\\n \\\"--disconnect\\\", \\\"pmemd.MPI\\\", \\\"-O\\\", \\\"-i\\\", \\\"ex.in\\\", \\\"-c\\\",\\n \\\"ex.min\\\", \\\"-p\\\", \\\"ex.top\\\", \\\"-o\\\", \\\"ex.out\\\"]\\n\\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\\n\\n assert parameters[\\\"executable\\\"] == \\\"pmemd.MPI\\\"\\n assert parameters[\\\"executableargs\\\"] == \\\\\\n \\\"-O -i ex.in -c ex.min -p ex.top -o ex.out\\\"\\n assert longbowargs == [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--maxtime\\\", \\\"01:00\\\", \\\"--replicates\\\", \\\"1000\\\",\\n \\\"--disconnect\\\"]\",\n \"def process_arguments():\\n # Create ArgumentParser object. Description message will be displayed as part of help message if script is run with -h flag\\n parser = argparse.ArgumentParser(description='Prints tier 1 and 2 variant details to stdout for a given 100k case')\\n # Define the arguments that will be taken.\\n parser.add_argument('-i', '--ir_id', required=True, help='GeL Interpretation Request ID in format 12345-1')\\n parser.add_argument('-p', '--proband_id', required=True, help='GeL participant ID for proband')\\n # Return the arguments\\n return parser.parse_args()\",\n \"def run(args):\\n # args = args_init(vars(get_args()), align=True)\\n\\n log.info('running RNAseq pipeline')\\n\\n ## default arguments, for RNAseq2 only\\n args['align_to_rRNA'] = True\\n\\n ## multireads should not be discarded\\n ## https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4728800/\\n ## Genome Biology, 2016\\n if args['include_multi_reads']:\\n args['unique_only'] = False # \\n else:\\n args['unique_only'] = True # default \\n\\n # determine gtf file\\n # gene gtf\\n if args['gtf'] is None:\\n args['gtf'] = Genome(**args).gene_gtf('refseq') # ucsc version\\n\\n # for GRCh38 genome, using GENCODE version \\n # if args['genome'] == 'GRCh38':\\n if args['genome'] in ['GRCh38', 'GRCm38']:\\n args['gtf'] = Genome(**args).gene_gtf('ensembl') # gencode\\n\\n # te gtf\\n if args['te_gtf'] is None:\\n args['te_gtf'] = Genome(**args).te_gtf()\\n\\n # print(args['gtf'])\\n\\n ## update prefix\\n ctl_prefix = str_common([os.path.basename(f) for f in args['c1']])\\n ctl_prefix = ctl_prefix.rstrip('r|R|rep|Rep').rstrip('_|.')\\n if args['C'] is None:\\n args['C'] = ctl_prefix\\n tre_prefix = str_common([os.path.basename(f) for f in args['t1']])\\n tre_prefix = tre_prefix.rstrip('r|R|rep|Rep').rstrip('_|.')\\n if args['T'] is None:\\n args['T'] = tre_prefix\\n \\n ## run pipeline\\n if args['extra_index']:\\n extra_rnaseq(args, args['extra_gtf'])\\n elif args['align_to_te']:\\n te_rnaseq(args, args['te_gtf'])\\n else:\\n gene_rnaseq(args)\\n\\n log.info('finish')\",\n \"def parse_args():\\n parser = argparser()\\n args = parser.parse_args()\\n\\n # --------------------------------------------------------- #\\n # Parse and check runtime parameters.\\n # --------------------------------------------------------- #\\n\\n # check validity of cores selection.\\n max_ppn = max_cpu() + 1\\n if args.proc_per_node > max_ppn:\\n warnings.warn('{0} is greater than the number of available cores ({1}). Reducing to {2}'\\n .format(args.proc_per_node, max_ppn, max_ppn - 1))\\n args.proc_per_node = max_ppn - 1\\n\\n # ensure that user has supplied fresh .bam/.bai files or a directory containing alignment files.\\n if not args.bam_files and not args.bam_dir:\\n raise ValueError('Must specify either --bam-files or --bam-dir.')\\n\\n if args.bam_files and args.bam_dir:\\n raise ValueError('Both --bam-files and --bam-dir were provided! Not sure which data set to use.')\\n\\n # --------------------------------------------------------- #\\n # Gather input RNA-Seq + genome annotation files.\\n # --------------------------------------------------------- #\\n\\n # check validity of gene annotation file selection.\\n if not args.genome_annotation:\\n raise ValueError('If warm-start directory not specified, gene annotation file must be specified!')\\n\\n else:\\n if not os.path.isfile(args.genome_annotation):\\n raise FileNotFoundError('Gene annotation file {0} not found.'.format(args.genome_annotation))\\n\\n # check validity of file i/o selection.\\n bam_files = list()\\n bai_files = list()\\n create_bai_files = list()\\n\\n # INPUT OPTION 1: a --bam-dir was specified.\\n if args.bam_dir:\\n\\n # if user used both --bam-dir and --bam-files and/or --bai-files, yell at them. (only use one method).\\n if args.bam_files is not None or args.bai_files is not None:\\n raise ValueError('Do not specify both a --bam-dir and either --bam-files and/or --bai-files.'\\n 'Use one input selection method or the other.')\\n\\n # check that the dir actually exists.\\n if not os.path.isdir(args.bam_dir):\\n raise NotADirectoryError('Cannot find --bam-dir {0}'.format(args.bam_dir))\\n\\n # scan directory for .bam files.\\n for f in os.listdir(args.bam_dir):\\n if f.endswith('.bam'):\\n bam_files.append(os.path.join(args.bam_dir, f))\\n\\n # search for .bai files in the --bam-dir. If they don't exist, try to make them.\\n for bam_file in bam_files:\\n bai_file = re.sub('.bam$', '.bai', bam_file)\\n\\n # if .bai file under same basename as .bam file doesn't exist,\\n # add it to list of .bai files that need to be created.\\n if not os.path.isfile(bai_file):\\n bai_files.append(bai_from_bam_file(bam_file))\\n create_bai_files.append(bam_file)\\n else:\\n bai_files.append(bai_file)\\n\\n # INPUT OPTION 2: --bam-files and possibly --bai-files were specified.\\n else:\\n # ensure .bam files are actually .bam files.\\n for bam_file in args.bam_files:\\n if not bam_file.endswith('.bam'):\\n raise ValueError('{0} is not a .bam file.'.format(bam_file))\\n elif not os.path.isfile(bam_file):\\n raise FileNotFoundError('Count not find .bam file {0}'.format(bam_file))\\n else:\\n bam_files.append(bam_file)\\n\\n # case where user has specified .bai files to accompany .bam files.\\n if args.bai_files is not None:\\n # if user has supplied an incorrect number of bai files, fail out.\\n if len(args.bai_files) != len(bam_files):\\n raise ValueError('Number of supplied .bai files does not match number of supplied .bam files.')\\n\\n # ensure .bai files are actually .bai files.\\n for bai_file in args.bai_files:\\n if not bai_file.endswith('.bai'):\\n raise ValueError('{0} is not a .bai file.'.format(bai_file))\\n elif not os.path.isfile(bai_file):\\n raise FileNotFoundError('Count not find .bai file {0}'.format(bai_file))\\n else:\\n bai_files.append(bai_file)\\n\\n # if user has not supplied any bai files: look for them under the same name\\n # as each of the .bam files, or create new .bai files with samtools (if possible).\\n else:\\n for bam_file in bam_files:\\n bai_file = re.sub('.bam$', '.bai', bam_file)\\n\\n # if .bai file under same name as .bam file doesn't exist,\\n # add it to list of .bam files for which we need to create a .bai file.\\n if not os.path.isfile(bai_file):\\n bai_files.append(bai_from_bam_file(bam_file))\\n create_bai_files.append(bam_file)\\n else:\\n bai_files.append(bai_file)\\n\\n # ensure that input files are uniquely named.\\n if len(bam_files) != len(set(bam_files)):\\n raise ValueError('Supplied .bam files are not uniquely named!')\\n\\n # create parser attributes for bam/index files.\\n args.bam_files = bam_files\\n args.bai_files = bai_files\\n args.create_bai_files = create_bai_files\\n\\n return args\",\n \"def get_options():\\n parser = argparse.ArgumentParser(description='ZA Machine learning for full run2 Ulegacy data')\\n \\n parser.add_argument('-o', '--outputs', action='store', required=True, type=str,\\n help='ZA machine learning outputs dir ')\\n\\n #=========================================================================\\n # Local For Test : Scan, deploy and restore arguments #\\n #=========================================================================\\n a = parser.add_argument_group('Scan, deploy and restore arguments')\\n a.add_argument('-s','--scan', action='store', required=False, type=str, default='',\\n help='Name of the scan to be used (modify scan parameters in NeuralNet.py)')\\n a.add_argument('-task','--task', action='store', required=False, type=str, default='',\\n help='Name of dict to be used for scan (Used by function itself when submitting jobs or DEBUG)')\\n a.add_argument('--generator', action='store_true', required=False, default=False, \\n help='Wether to use a generator for the neural network')\\n a.add_argument('--resume', action='store_true', required=False, default=False,\\n help='Wether to resume the training of a given model (path in parameters.py)')\\n #=========================================================================\\n # Slurm Submissions : Splitting and submitting jobs arguments #\\n #=========================================================================\\n b = parser.add_argument_group('Splitting and submitting jobs arguments')\\n b.add_argument('-split','--split', action='store', required=False, type=int, default=0,\\n help='Number of parameter sets per jobs to be used for splitted training for slurm submission (if -1, will create a single subdict)')\\n b.add_argument('-submit','--submit', action='store', required=False, default='', type=str,\\n help='Wether to submit jons to slurm (must have specified --split)')\\n b.add_argument('-resubmit','--resubmit', action='store', required=False, default='', type=str,\\n help='Wether to resubmit failed jobs given the name you give during submission ( must giev the same output)')\\n b.add_argument('-debug','--debug', action='store_true', required=False, default=False,\\n help='Debug mode of the slurm submission, does everything except submit the jobs')\\n #=========================================================================\\n # Repot and Produce Outputs: This do csv concatenation and get the best model : workdir/model/*.csv\\n # Further used for : Analyzing or producing outputs of the given model \\n #=========================================================================\\n c = parser.add_argument_group('Analyzing or producing outputs for given model (csv or zip file)')\\n c.add_argument('-r','--report', action='store_true', required=False, default=False,\\n help='report 10 best models (according to the eval_criterion) and plot on the console several histograms and *.png files')\\n c.add_argument('-m','--model', action='store', required=False, type=str, default='',\\n help='Loads the provided model name (without .zip and type, it will find them)') \\n c.add_argument('-k','--key', action='store', required=False, nargs='+', type=str, default=[], \\n help='Applies the provided model (do not forget -k) on the list of keys from parameters.TTree') \\n #=========================================================================\\n # Physics arguments #\\n #=========================================================================\\n e = parser.add_argument_group('Physics arguments')\\n e.add_argument('-p','--process', action='store', required=False, nargs='+', default=[],\\n help='Which process you want to submit for training ')\\n e.add_argument('--resolved', action='store_true', required=False, default=False,\\n help='Resolved topology')\\n e.add_argument('--boosted', action='store_true', required=False, default=False,\\n help='Boosted topology')\\n #=========================================================================\\n # Additional arguments #\\n #=========================================================================\\n f = parser.add_argument_group('Additional arguments')\\n f.add_argument('-v','--verbose', action='store_true', required=False, default=False,\\n help='Show DEGUG logging')\\n f.add_argument('--GPU', action='store_true', required=False, default=False,\\n help='GPU requires to execute some commandes before')\\n f.add_argument('--cache', action='store_true', required=False, default=False,\\n help='Will use the cache')\\n f.add_argument('--interactive', action='store_true', required=False, default=False,\\n help='Interactive mode to check the dataframe')\\n \\n opt = parser.parse_args()\\n\\n if opt.split!=0 or opt.submit!='':\\n if opt.scan!='' or opt.report:\\n logging.critical('These parameters cannot be used together: ') \\n logging.critical('\\\\t--scan --debug --verbose : to debug and check that all okay locally') \\n logging.critical('\\\\t--submit --split 1 : to submit jobs to slurm if the previous okay') \\n logging.critical('\\\\t--report : should be the last step in order to get the best model, plots, etc...')\\n sys.exit(1)\\n \\n if opt.submit!='': # Need --output or --split arguments\\n if opt.split==0 and len(opt.key)==0:\\n logging.warning('In case of learning you forgot to specify --split')\\n sys.exit(1)\\n \\n if opt.split!=0 and (opt.report or opt.key!='' or opt.scan!=''):\\n logging.warning('Since you have specified a split, all the other arguments will be skipped')\\n \\n if opt.report and (opt.key!='' or opt.scan!=''):\\n logging.warning('Since you have specified a scan report, all the other arguments will be skipped')\\n \\n if len(opt.key)!=0 and opt.key == '': \\n logging.critical(f'--key is missing choices: {parameters.TTree}')\\n sys.exit(1)\\n \\n if opt.generator:\\n logging.info(\\\"Will use the generator\\\")\\n \\n if opt.resume:\\n logging.info(\\\"Will resume the training of the model\\\")\\n\\n return opt\",\n \"def RunJobs(self, runfile_mapping, server_run_map):\\n if self.workflow is None:\\n raise RuntimeError(\\\"Tried to create unnamed workflow!\\\")\\n\\n \\n # Generate jobs for the first pass over the data\\n for run in sorted(runfile_mapping.keys()):\\n if self.VERBOSE>0:\\n inputfiles=\\\"/%s/rawdata/volatile/%s/rawdata/Run%06d/hd_rawdata_*.evio\\\"%(HDRunFileRAIDList.GetRAIDDirFromRun(run,server_run_map),HDJobUtils.GetRunPeriodFromRun(run),run)\\n\\n # PASS 0\\n print \\\"processing run %d, phase 0 ...\\\"%(int(run))\\n\\n # set up command to execute\\n if self.nthreads:\\n cmd += \\\" %s/scripts/%s %s %s %06d %03d %d\\\"%(self.basedir,\\\"job_wrapper_local.csh\\\",\\\"local_calib_pass0.csh\\\",self.basedir,run,inputfiles,int(self.nthreads))\\n else:\\n cmd += \\\" %s/scripts/%s %s %s %06d %03d\\\"%(self.basedir,\\\"job_wrapper_local.csh\\\",\\\"local_calib_pass0.csh\\\",self.basedir,run,inputfiles)\\n\\n # run command\\n os.system(cmd)\\n\\n # PASS 1\\n print \\\"processing run %d, phase 1 ...\\\"%(int(run))\\n\\n # set up command to execute\\n if self.nthreads:\\n cmd += \\\" %s/scripts/%s %s %s %06d %03d %d\\\"%(self.basedir,\\\"job_wrapper_local.csh\\\",\\\"local_calib_pass1.csh\\\",self.basedir,run,inputfiles,int(self.nthreads))\\n else:\\n cmd += \\\" %s/scripts/%s %s %s %06d %03d\\\"%(self.basedir,\\\"job_wrapper_local.csh\\\",\\\"local_calib_pass1.csh\\\",self.basedir,run,inputfiles)\\n\\n # run command\\n os.system(cmd)\",\n \"def execute_waypoint_sequence(detail_of_trip):\\n\\n # rets (route_line, line_points)\\n sliced_route_and_line_points = chunk_user_route(detail_of_trip)\\n\\n sliced_route = sliced_route_and_line_points[0]\\n line_points = sliced_route_and_line_points[1]\\n\\n # Interpolate/Break into 1/10 segments\\n segmented_points = interpolate_points(sliced_route, line_points)\\n waypoints = find_crime_areas(segmented_points)\\n\\n # print \\\"segmented_points\\\", json.dumps(segmented_points, indent=2)\\n print \\\"\\\\n\\\\n\\\\n\\\\n\\\" # compensating for the giant GET request\\n return waypoints\",\n \"def test_cmdlineproc_test4():\\n\\n parameters = {\\n \\\"debug\\\": False,\\n \\\"disconnect\\\": False,\\n \\\"executable\\\": \\\"\\\",\\n \\\"executableargs\\\": \\\"\\\",\\n \\\"hosts\\\": \\\"\\\",\\n \\\"job\\\": \\\"\\\",\\n \\\"jobname\\\": \\\"\\\",\\n \\\"log\\\": \\\"\\\",\\n \\\"recover\\\": \\\"\\\",\\n \\\"resource\\\": \\\"\\\",\\n \\\"replicates\\\": \\\"\\\",\\n \\\"verbose\\\": False\\n }\\n\\n commandlineargs = [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--replicates\\\", \\\"1000\\\", \\\"--disconnect\\\"]\\n\\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\\n\\n assert parameters[\\\"executable\\\"] == \\\"\\\"\\n assert parameters[\\\"executableargs\\\"] == \\\"\\\"\\n assert longbowargs == [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--replicates\\\", \\\"1000\\\", \\\"--disconnect\\\"]\",\n \"def parse_args(args):\\n parser = argparse.ArgumentParser(\\n description=\\\"Download SMAP data. Register at https://urs.earthdata.nasa.gov/ first.\\\"\\n )\\n parser.add_argument(\\n \\\"localroot\\\", help='Root of local filesystem where the data is stored.')\\n parser.add_argument(\\n \\\"-s\\\",\\n \\\"--start\\\",\\n type=mkdate,\\n help=(\\n \\\"Startdate. Either in format YYYY-MM-DD or YYYY-MM-DDTHH:MM.\\\"\\n \\\" If not given then the target folder is scanned for a start date.\\\"\\n \\\" If no data is found there then the first available date of the product is used.\\\"\\n ))\\n parser.add_argument(\\n \\\"-e\\\",\\n \\\"--end\\\",\\n type=mkdate,\\n help=(\\\"Enddate. Either in format YYYY-MM-DD or YYYY-MM-DDTHH:MM.\\\"\\n \\\" If not given then the current date is used.\\\"))\\n parser.add_argument(\\n \\\"--product\\\",\\n type=str,\\n default=\\\"SPL3SMP.008\\\",\\n help='SMAP product to download. (default: SPL3SMP.008).'\\n ' See also https://n5eil01u.ecs.nsidc.org/SMAP/ ')\\n parser.add_argument(\\n \\\"--filetypes\\\",\\n nargs=\\\"*\\\",\\n default=[\\\"h5\\\", \\\"nc\\\"],\\n help=\\\"File types (extensions) to download. Files with\\\"\\n \\\"other extensions are ignored. \\\"\\n \\\"Default is equivalent to --filetypes h5 nc\\\")\\n parser.add_argument(\\\"--username\\\", help='Username to use for download.')\\n parser.add_argument(\\\"--password\\\", help='password to use for download.')\\n parser.add_argument(\\n \\\"--n_proc\\\",\\n default=1,\\n type=int,\\n help='Number of parallel processes to use for downloading.')\\n args = parser.parse_args(args)\\n # set defaults that can not be handled by argparse\\n\\n if args.start is None or args.end is None:\\n first, last = folder_get_first_last(args.localroot)\\n if args.start is None:\\n if last is None:\\n args.start = get_start_date(args.product)\\n else:\\n args.start = last\\n if args.end is None:\\n args.end = datetime.now()\\n\\n args.urlroot = 'https://n5eil01u.ecs.nsidc.org'\\n args.urlsubdirs = ['SMAP', args.product, '%Y.%m.%d']\\n args.localsubdirs = ['%Y.%m.%d']\\n\\n print(\\n f\\\"Downloading SMAP {args.product} data from {args.start.isoformat()} \\\"\\n f\\\"to {args.end.isoformat()} into folder {args.localroot}.\\\")\\n\\n return args\",\n \"def main(argv = sys.argv[1:]):\\n\\n parser = OptionParser(\\\"\\\"\\\"usage: %prog RESULT_DIR RUNNIGN_SCRIPT <optional parameters>\\\"\\\"\\\")\\n\\n # OPTIONAL\\n group_opt = OptionGroup(parser, \\\"Optional parameters\\\",\\n \\\"Defaults should normally be fine for these options in order to run batch\\\")\\n group_opt.add_option(\\\"-r\\\", \\\"--repeats\\\",\\n type=\\\"int\\\", default=50,\\n help=\\\"\\\"\\\"number of repeats of each configuration\\\"\\\"\\\")\\n group_opt.add_option(\\\"-a\\\", \\\"--args\\\",\\n type=\\\"string\\\", default=\\\"//home//veredhi//EMIRGE_SMURF//cluster_summary.csv\\\",\\n help=\\\"arguments csv path\\\")\\n\\n parser.add_option_group(group_opt)\\n\\n # ACTUALLY PARSE ARGS\\n (options, args) = parser.parse_args(argv)\\n\\n # minimal sanity checking of input\\n if len(args) != 2:\\n parser.error(\\n \\\"RESULT_DIR ans RUNNIGN_SCRIPT are required, and all options except should have a flag associated with them (options without flags: %s)\\\" % args)\\n\\n params_dict['HOME_PATH'] = os.path.join(os.path.abspath(args[0]), \\\"CONFIG_INDEX\\\")\\n params_dict['REPEATS'] = str(options.repeats)\\n\\n args_path = os.path.abspath(options.args)\\n params_dict['SCRIPT_PATH'] = os.path.abspath(args[1])\\n\\n args_df = pd.read_csv(args_path)\\n\\n for i in range(args_df.shape[0]):\\n params_dict['CONFIG_INDEX'] = str(i)\\n\\n mkdir_if_not_exists(replace_in_string(params_dict['HOME_PATH'], params_dict))\\n mkdir_if_not_exists(replace_in_string(params_dict['SLURM_OUTPUT_FOLDER'], params_dict))\\n mkdir_if_not_exists(replace_in_string(params_dict['SBATCH_PATH'], params_dict))\\n mkdir_if_not_exists(replace_in_string(params_dict['PYTHON_OUTPUT_FOLDER'], params_dict))\\n mkdir_if_not_exists(replace_in_string(params_dict['TMP_FOLDER'], params_dict))\\n\\n row = args_df.iloc[i]\\n params_dict[\\\"c_bases\\\"] = str(row['number of changed bases'])\\n params_dict[\\\"c_references\\\"] = str(row['number of changed bacterias'])\\n params_dict[\\\"mix_size\\\"] = str(row['mock_mixure_size'])\\n params_dict[\\\"unique\\\"] = str(row['unique_bacteria_in_mixture'])\\n\\n for j in range(int(params_dict['REPEATS'])):\\n\\n index=str(j)\\n test_name = \\\"test_\\\" + index\\n\\n params_dict[\\\"index\\\"] = index\\n\\n if os.path.isfile(os.path.join(replace_in_string(params_dict[\\\"PYTHON_OUTPUT_FOLDER\\\"], params_dict),\\n test_name, \\\"emirge_smurf_WFalseSTrue.csv\\\")):\\n continue\\n\\n params_dict[\\\"out_file\\\"] = index + '_out'\\n params_dict[\\\"err_file\\\"] = index + '_err'\\n\\n sbatch_text = replace_in_string(SBATCH_TEMPLATE, params_dict)\\n\\n sbatch_file_path = os.path.join(replace_in_string(params_dict['SBATCH_PATH'], params_dict), test_name)\\n with open(sbatch_file_path, 'w') as f:\\n f.write(sbatch_text)\\n\\n command = 'sbatch \\\"{}\\\"'.format(sbatch_file_path)\\n process = subprocess.Popen(command, shell=True, stdout=subprocess.PIPE)\\n status = process.wait()\\n while status is not 0:\\n status = process.wait()\\n print(\\\"Add {} {}\\\".format(i, test_name))\",\n \"def parse_args():\\n parser = argparse.ArgumentParser(description='use STAR for mapping reads')\\n #input files\\n parser.add_argument('-s', '--sequences',\\n help='number of sequences to take for testing')\\n parser.add_argument('--tmpdir',\\n help='tmp directory',default=\\\"/tmp/\\\")\\n parser.add_argument('--input_dir',\\n help='optional: Choose input directory')\\n parser.add_argument('--reads_R1',\\n help='Forward unmerged reads')\\n parser.add_argument('--reads_R2',\\n help='Reverse unmerged reads')\\n parser.add_argument('--merged',\\n help='merged watson and crick fastq')\\n parser.add_argument('--reference',\\n help='reference clusters')\\n parser.add_argument('--refgenome',\\n help='reference clusters')\\n parser.add_argument('--barcodes',\\n help='Barcodes used in output')\\n parser.add_argument('--species',\\n help='Species: if selected only that species will be put in BAM RG header')\\n parser.add_argument('--threads',\\n help='Number of threads to used where multithreading is possible')\\n parser.add_argument('--output_dir',\\n help='Choose output directory')\\n parser.add_argument('--extraflags',\\n help='extra flags for testing')\\n args = parser.parse_args()\\n if args.input_dir:\\n args.reads_R1 = os.path.join(args.input_dir,'Unassembled.R1.watson.fq.gz')\\n args.reads_R2 = os.path.join(args.input_dir,'Unassembled.R2.crick.fq.gz')\\n args.merged = os.path.join(args.input_dir,'Assembled.fq.gz')\\n args.reference = os.path.join(args.input_dir,'consensus_cluster.renamed.fa')\\n if args.output_dir:\\n if not os.path.exists(args.output_dir):\\n os.mkdir(args.output_dir)\\n if 'log' not in args:\\n args.log = os.path.join(args.output_dir,'mapping_variantcalling.log')\\n args.watson_vcf = os.path.join(args.output_dir,'watson.vcf')\\n args.crick_vcf = os.path.join(args.output_dir,'crick.vcf')\\n args.snp_vcf = os.path.join(args.output_dir,'snp.vcf')\\n args.methylation_vcf = os.path.join(args.output_dir,'methylation.vcf')\\n args.heatmap = os.path.join(args.output_dir,'heatmap.igv')\\n #2 bed files should be made for subsequent analysis using Rnbeads or other software\\n args.mastermeth = os.path.join(args.output_dir,'methylation.bed')\\n args.tmpdir = tempfile.mkdtemp(suffix='STAR', prefix='tmp', dir=args.tmpdir)\\n return args\",\n \"def main():\\n args = load_args()\\n\\n perturbation_file = args.perturbation_file\\n vm_params = load_yaml(args.vm_params_location)\\n processes = args.n_processes\\n verbose = args.verbose\\n\\n if args.perturbation:\\n if args.model:\\n perturbation_model = pd.read_csv(args.model)\\n generate_velocity_model_perturbation_file_from_model(\\n vm_params, perturbation_model, perturbation_file, processes, verbose\\n )\\n elif args.parameter_file:\\n common_params, layer_params = load_parameter_file(args.parameter_file)\\n generate_velocity_model_perturbation_file_from_config(\\n common_params, layer_params, perturbation_file, processes, verbose\\n )\\n else:\\n create_constant_vm_file(\\n perturbation_file, vm_params[\\\"nx\\\"] * vm_params[\\\"ny\\\"] * vm_params[\\\"nz\\\"]\\n )\\n\\n if args.fault_damage_zone:\\n apply_fault_damage_zone(\\n srf_location=args.srf_location,\\n vm_params=vm_params,\\n pert_f_location=perturbation_file,\\n depth_km=args.depth_km,\\n max_depth_km=args.max_depth_km,\\n width_km=args.width_km,\\n max_width_km=args.max_width_km,\\n min_damage_velocity=args.max_velocity_drop,\\n n_processes=processes,\\n )\",\n \"def main():\\n parser = argparse.ArgumentParser(\\n description=\\\"Returns back the entire solution graph.\\\")\\n parser.add_argument(\\\"-M\\\", \\\"--master\\\", type=str, default=\\\"local[8]\\\",\\n help=\\\"url of the master for this job\\\")\\n parser.add_argument(\\\"-O\\\", \\\"--output\\\", type=str, default=\\\"solution-out\\\",\\n help=\\\"name of the output file\\\")\\n parser.add_argument(\\\"-H\\\", \\\"--height\\\", type=int, default=2,\\n help=\\\"height of the puzzle\\\")\\n parser.add_argument(\\\"-W\\\", \\\"--width\\\", type=int, default=2,\\n help=\\\"width of the puzzle\\\")\\n args = parser.parse_args()\\n\\n\\n # open file for writing and create a writer function\\n output_file = open(args.output, \\\"w\\\")\\n writer = lambda line: output_file.write(line + \\\"\\\\n\\\")\\n\\n # call the puzzle solver\\n solve_sliding_puzzle(args.master, writer, args.height, args.width)\\n\\n # close the output file\\n output_file.close()\",\n \"def exec_from_args(args):\\n outfolder = args.folder + '/normal/'\\n check(outfolder, 'm')\\n\\n makeconfig(str(args.gene_names), str(args.sequences), str(args.org_included),\\n len_threshold=args.len_threshold,\\n its=str(args.its), query_cover=str(args.query_cover), identity=str(args.identity),\\n distance=str(args.string_distance), subsp=str(args.subsp), excluded=str(args.org_excluded),\\n remote=str(args.remote_blast), folder=args.folder, date=args.today, blacklist=args.blacklist,\\n synonyms=args.synonyms)\\n\\n r = Run('n', args.folder, args.debug)\\n r.start()\",\n \"def main(args):\\n options = parse_cmd_parameters_(args)\\n execute_(options)\",\n \"def run_genomemap(args):\\n genome_map(args)\",\n \"def main(matrix,model,processors,algorithm):\\n if algorithm == \\\"raxml-ng\\\":\\n ab = subprocess.call(['which', 'raxml-ng'])\\n if ab == 0:\\n pass\\n else:\\n print(\\\"RAxML must be in your path as raxml-ng\\\")\\n sys.exit()\\n elif algorithm == \\\"raxml-HPC\\\":\\n ab = subprocess.call(['which', 'raxmlHPC-PTHREADS-SSE3'])\\n if ab == 0:\\n pass\\n else:\\n print(\\\"RAxML must be in your path as raxmlHPC-PTHREADS-SSE3\\\")\\n sys.exit()\\n last=get_field_index(matrix)\\n matrix_to_fasta(matrix, last)\\n #Prep the creation of the FASTA file, removing odd characters\\n os.system(\\\"sed 's/://g' all.fasta | sed 's/,//g' > out.fasta\\\")\\n if model == \\\"ASC_GTRGAMMA\\\":\\n subprocess.check_call(\\\"raxmlHPC-SSE3 -f d -p 12345 -m %s -s out.fasta -n nasp --asc-corr=lewis --no-bfgs > /dev/null 2>&1\\\" % model, stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\\n subprocess.check_call(\\\"raxmlHPC-SSE3 -f e -m %s -s out.fasta -t RAxML_bestTree.nasp -n PARAMS --asc-corr=lewis --no-bfgs > /dev/null 2>&1\\\" % model, stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\\n else:\\n if algorithm == \\\"raxml-HPC\\\":\\n subprocess.check_call(\\\"raxmlHPC-PTHREADS-SSE3 -T %s -f d -p 12345 -m %s -s out.fasta -n nasp --no-bfgs > /dev/null 2>&1\\\" % (processors,model), stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\\n subprocess.check_call(\\\"raxmlHPC-PTHREADS-SSE3 -T %s -f e -m %s -s out.fasta -t RAxML_bestTree.nasp -n PARAMS --no-bfgs > /dev/null 2>&1\\\" % (processors,model), stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\\n elif algorithm == \\\"raxml-ng\\\":\\n subprocess.check_call(\\\"raxml-ng --msa out.fasta --model GTR+G --threads %s --prefix nasp\\\" % processors,stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\\n if algorithm == \\\"raxml-HPC\\\":\\n subprocess.check_call(\\\"mv RAxML_bestTree.nasp nasp_raxml.tree\\\", shell=True)\\n subprocess.check_call(\\\"mv RAxML_binaryModelParameters.PARAMS nasp.PARAMS\\\", shell=True)\\n subprocess.check_call(\\\"rm RAxML_* out.fasta all.fasta\\\", shell=True)\\n else:\\n subprocess.check_call(\\\"mv nasp.raxml.bestTree nasp_raxml.tree\\\", stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\\n subprocess.check_call(\\\"rm nasp.raxml.startTree out.fasta all.fasta\\\", stdout=open(os.devnull, 'wb'),stderr=open(os.devnull, 'wb'),shell=True)\\n print(\\\"Model used: %s\\\" % model)\",\n \"def __main__():\\r\\n\\tparser = optparse.OptionParser()\\r\\n\\tparser.add_option(\\\"-i\\\", \\\"--input\\\", default=None, dest=\\\"input\\\",\\r\\n\\t\\t\\t\\t\\t help=\\\"The input bam file\\\")\\r\\n\\tparser.add_option(\\\"-c\\\", \\\"--chromfile\\\", default=None, dest=\\\"chromfile\\\",\\r\\n\\t\\t\\t\\t\\t help=\\\"The input list of chromosomes \\\")\\r\\n\\tparser.add_option(\\\"-d\\\", \\\"--directory\\\", default=None, dest=\\\"directory\\\",\\r\\n\\t\\t\\t\\t\\t\\thelp=\\\"directory\\\")\\r\\n\\tparser.add_option(\\\"-l\\\", \\\"--lane\\\", default=None, dest=\\\"lane\\\",\\r\\n\\t\\t\\t\\t\\t\\thelp=\\\"Lane\\\")\\t\\t\\t\\t \\r\\n\\tparser.add_option(\\\"-o\\\", \\\"--output\\\", default=None, dest=\\\"output\\\",\\r\\n\\t\\t\\t\\t\\t help=\\\"The output file\\\")\\r\\n\\t(options, args) = parser.parse_args()\\r\\n\\t\\r\\n\\tif not options.input:\\r\\n\\t\\tparser.error(\\\"Need to specify the input file\\\")\\r\\n\\tif not options.chromfile:\\r\\n\\t\\tparser.error(\\\"Need to specify the list of chromosomes file\\\")\\r\\n\\tif not options.output:\\r\\n\\t\\tparser.error(\\\"Need to specify the output file\\\")\\r\\n\\r\\n\\twith open(options.output, \\\"w\\\") as outfile:\\r\\n\\t\\twith open(options.chromfile, \\\"r\\\") as handle:\\r\\n\\t\\t\\tfor line in handle:\\r\\n\\t\\t\\t\\tline = line.rstrip()\\r\\n\\t\\t\\t\\t#p = subprocess.run([\\\"echo %s\\\" % line], shell=True, check=True, stdout=subprocess.PIPE)\\r\\n\\t\\t\\t\\tp = subprocess.run([\\\"samtools depth -r %s %s/%s | sort -n -k 3 | tail -n 1\\\" % (line, options.directory, options.input)], shell=True, check=True, stdout=subprocess.PIPE)\\r\\n\\t\\t\\t\\toutfile.write(p.stdout.decode('utf-8').rstrip() + \\\"\\\\t%s\\\" % options.input + \\\"\\\\t%s\\\\n\\\" % options.lane)\",\n \"def exec_ripser(data_path,output_path,max_dim,input_file='input.txt',format_file = 'lower-distance',threshold=None):\\n ############# RIPSER ####################\\n # high dimension\\n ## execfile ripser (OUTPUT from ripser)\\n start = timeit.default_timer() \\n print 'input_file ',input_file\\n input_file_full = os.path.join(data_path,input_file)\\n output_file_full = os.path.join(output_path,'output_ripser.txt')\\n\\n if threshold is None:\\n ripser_arguments = 'ripser --format %s --dim %i %s'%(format_file,max_dim,input_file_full)\\n else:\\n ripser_arguments = 'ripser --format %s --dim %i --threshold %f %s'%(format_file,max_dim,threshold,input_file_full)\\n \\n ripser_call(ripser_arguments.split(' '),output_file_full)\\n #os.system(ripser_call) # OLD CALL BASED ON executable\\n\\n stop = timeit.default_timer()\\n print 'Ripser execution time '\\n print stop - start \\n input_file_path = os.path.join(data_path,'input.txt')\\n if(os.path.isfile(input_file_path)):\\n os.remove(input_file_path) ## remove auxiliar file with lower matrix used as input for Ripser\\n return()\",\n \"def main_parse_args():\\n parser = ArgumentParser()\\n parser.add_argument('infile', help='path to the file to be mapped.It should\\\\\\n contain one identifer on each line.')\\n parser.add_argument('-rh', '--redis_host', default=DEFAULT_REDIS_URL,\\n help='url of Redis db')\\n parser.add_argument('-rp', '--redis_port', default=DEFAULT_REDIS_PORT,\\n help='port for Redis db')\\n parser.add_argument('-rps', '--redis_pass', default=DEFAULT_REDIS_PASS,\\n help='password for Redis db')\\n parser.add_argument('-of', '--outfile', default=None,\\n help='path to the output file')\\n parser.add_argument('-sh', '--source_hint', help='suggestion for ID source \\\\\\n database used to resolve ambiguities in mapping',\\n default=DEFAULT_HINT)\\n parser.add_argument('-t', '--taxon', help='taxon id of species of all gene \\\\\\n names', default=DEFAULT_TAXON)\\n myargs = parser.parse_args()\\n return myargs\",\n \"def parse_arguments_for_single_machine():\\n\\n # setup command line parser and parse arguments\\n parser = argparse.ArgumentParser()\\n\\n arg_help = 'the path of the point sprite data (positions and intensities)' \\n parser.add_argument('--input-directory',\\n action='store',\\n dest='input_directory',\\n help=arg_help)\\n \\n arg_help = 'the directory where the configuration files will be generated'\\n parser.add_argument('--output-directory',\\n action='store',\\n dest='output_directory',\\n help=arg_help)\\n\\n arg_help = 'the point sprite header file (meta data of the sprite)'\\n parser.add_argument('--psh-file',\\n action='store', default='NO_FILE_PROVIDED',\\n dest='psh_file',\\n help=arg_help)\\n \\n arg_help = 'the data configuration file for the circuit and the sensor'\\n parser.add_argument('--data-config-file',\\n action='store', default='NO_FILE_PROVIDED',\\n dest='data_config_file',\\n help=arg_help)\\n\\n arg_help = 'simulation method, direct-sprite, linear-sprite, ... '\\n parser.add_argument('--simulation-method',\\n action='store', default='direct-sprite',\\n dest='simulation_method',\\n help=arg_help)\\n\\n arg_help = 'the template pbrt sensor configuration file for sprite'\\n parser.add_argument('--pbrt-sprite-sensor-config',\\n action='store', default='NO_FILE_PROVIDED',\\n dest='pbrt_sprite_sensor_config',\\n help=arg_help)\\n \\n arg_help = 'the template pbrt sensor configuration file for volume'\\n parser.add_argument('--pbrt-volume-sensor-config',\\n action='store', default='NO_FILE_PROVIDED',\\n dest='pbrt_volume_sensor_config',\\n help=arg_help)\\n\\n arg_help = 'the path of the pbrt executable that will run the simulation'\\n parser.add_argument('--pbrt-executable',\\n action='store', default='pbrt', # installed\\n dest='pbrt_executable',\\n help=arg_help)\\n\\n arg_help = 'the path of the sprite volumeizer executable that will ' \\\\\\n 'convert the sprite to a volume '\\n parser.add_argument('--volumizer-executable',\\n action='store', default='volumizesprite', # installed \\n dest='volumizer_executable',\\n help=arg_help)\\n \\n arg_help = 'the path of the spritebounds executable that will ' \\\\\\n 'quicky extract the bounds of the sprite to get the sensor data'\\n parser.add_argument('--sprite-bounds-executable',\\n action='store', default='spritebounds', # installed \\n dest='spritebounds_executable',\\n help=arg_help)\\n\\n arg_help = 'resolution of the grid converted from the sprite'\\n parser.add_argument('--grid-resolution',\\n action='store', default='512',\\n dest='grid_resolution',\\n help=arg_help)\\n\\n arg_help = 'running node, cluster or local, cluster by default'\\n parser.add_argument('--node',\\n action='store', default='cluster',\\n dest='node',\\n help=arg_help)\\n \\n arg_help = 'the base (maximum) resolution of the sensor'\\n parser.add_argument('--sensor-resolution',\\n action='store', default='512', \\n dest='sensor_resolution',\\n help=arg_help)\\n\\n # parse the arguments\\n args = parser.parse_args()\\n \\n return args\",\n \"def run():\\n import argparse\\n parser = argparse.ArgumentParser(description=\\\"Create and solve mazes\\\")\\n parser.add_argument(\\\"-c\\\", \\\"--cli\\\", help=\\\"Switch to CLI mode\\\", action='store_true')\\n parser.add_argument(\\\"-f\\\", \\\"--file\\\", help=\\\"File to import map from\\\")\\n parser.add_argument(\\\"-s\\\", \\\"--start\\\", help=\\\"Starting position in the maze\\\")\\n parser.add_argument(\\\"-e\\\", \\\"--end\\\", help=\\\"Ending position in the maze\\\")\\n args = parser.parse_args()\\n if args.file:\\n myfile = args.file\\n else:\\n myfile = 'map1.txt'\\n with open(myfile, 'r') as mapfile:\\n maze_str = mapfile.read()\\n maze = Maze(maze_str, cli=args.cli, start=parse_seq(args.start), finish=parse_seq(args.end))\\n maze.game_loop()\",\n \"def _main():\\n import argparse\\n\\n # Get command line arguments\\n parser = argparse.ArgumentParser(description=\\\"This wrapper script will run \\\\\\n a pickled Python function on \\\\\\n some pickled retrieved data \\\\\\n via 0MQ. You almost never \\\\\\n want to run this yourself.\\\")\\n parser.add_argument('home_address',\\n help='IP address of submitting host.')\\n parser.add_argument('module_dir',\\n help='Directory that contains module containing pickled\\\\\\n function. This will get added to PYTHONPATH \\\\\\n temporarily.')\\n args = parser.parse_args()\\n\\n # Make warnings from built-in warnings module get formatted more nicely\\n logging.captureWarnings(True)\\n logging.basicConfig(format=('%(asctime)s - %(name)s - %(levelname)s - ' +\\n '%(message)s'), level=logging.INFO)\\n logger = logging.getLogger(__name__)\\n\\n logger.info(\\\"Appended {0} to PYTHONPATH\\\".format(args.module_dir))\\n sys.path.insert(0, args.module_dir)\\n\\n logger.debug(\\\"Job ID: %i\\\\tHome address: %s\\\\tModule dir: %s\\\",\\n os.environ['JOB_ID'],\\n args.home_address, args.module_dir)\\n\\n # Process the database and get job started\\n _run_job(os.environ['JOB_ID'], args.home_address)\",\n \"def test_cmdlineproc_test12():\\n\\n parameters = {\\n \\\"debug\\\": False,\\n \\\"disconnect\\\": False,\\n \\\"executable\\\": \\\"\\\",\\n \\\"executableargs\\\": \\\"\\\",\\n \\\"hosts\\\": \\\"\\\",\\n \\\"job\\\": \\\"\\\",\\n \\\"jobname\\\": \\\"\\\",\\n \\\"log\\\": \\\"\\\",\\n \\\"recover\\\": \\\"\\\",\\n \\\"resource\\\": \\\"\\\",\\n \\\"replicates\\\": \\\"\\\",\\n \\\"verbose\\\": False\\n }\\n\\n commandlineargs = [\\\"--hosts\\\", \\\"hosts.file\\\", \\\"--bogus\\\", \\\"--jobname\\\", \\\"test\\\",\\n \\\"--replicates\\\", \\\"1000\\\", \\\"--disconnect\\\", \\\"pmemd.MPI\\\",\\n \\\"-O\\\", \\\"-i\\\", \\\"ex.in\\\", \\\"-c\\\", \\\"ex.min\\\", \\\"-p\\\", \\\"ex.top\\\",\\n \\\"-o\\\", \\\"ex.out\\\"]\\n\\n with pytest.raises(exceptions.CommandlineargsError):\\n\\n _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\",\n \"def main(options):\\n coords = []\\n if options.verbose == True:\\n print \\\"Reading sequences from coordinate file %s\\\" % (options.coords)\\n try:\\n corfile = gzip.open(options.coords, 'rb')\\n except IOError:\\n raise IOError('Cannot read from coordinate file %s' % (options.coords))\\n\\n for c in corfile:\\n try:\\n c = c.rstrip().split()\\n coords.append([c[0], int(c[2]), int(c[3]), c[1]])\\n except ValueError, e:\\n raise ValueError(\\\"Wrong coordinates: %s\\\" % \\\" \\\".join(c))\\n\\n\\n # Read mRNA sequences into hash table: {id:sequence}\\n if options.verbose == True:\\n print \\\"Reading sequences from mRNA file %s\\\" % (options.seq)\\n try:\\n seq_obj = open(options.seq, 'Ur')\\n except IOError:\\n raise IOError('Cannot read from mRNA file %s' % (options.seq))\\n\\n mRNAseqs = {}\\n for seq in SeqIO.parse(seq_obj, 'fasta'):\\n mRNAseqs[str(seq.id)] = str(seq.seq)\\n\\n\\n # Open output file and write first lines\\n try:\\n outfile = gzip.open(options.out, 'wb')\\n except IOError:\\n raise IOError(\\\"Connot open output file %s\\\" % (options.out))\\n # outfile.write('#siteID\\\\tdistToBoundary\\\\n')\\n\\n # Iterate through the binding coordinates to calculate their score\\n if options.verbose == True:\\n print \\\"Calculating average G content... \\\"\\n for (mrnaid, lowerix, upperix, mirnas) in coords:\\n if mrnaid in mRNAseqs:\\n mrnasequ = mRNAseqs[mrnaid]\\n score = calculate_distance_to_boundary(len(mrnasequ), lowerix)\\n for mirna in mirnas.split(\\\",\\\"):\\n outtext = '%s,%s,%i,%i\\\\t%s\\\\n' % (mrnaid,\\n mirna,\\n lowerix,\\n upperix,\\n score)\\n outfile.write(outtext)\\n else:\\n for mirna in mirnas.split(\\\",\\\"):\\n outtext = '%s,%s,%i,%i\\\\t%s\\\\n' % (mrnaid,\\n mirna,\\n lowerix,\\n upperix,\\n \\\"NA\\\")\\n outfile.write(outtext)\\n\\n\\n outfile.close()\",\n \"def main(argv=None):\\n\\n if argv is None:\\n argv = sys.argv[1:]\\n\\n parser = argparse.ArgumentParser(description=__description__)\\n\\n # Positionals\\n parser.add_argument(\\\"fasta_file\\\",help=\\\"fasta file to be turned into kmers\\\")\\n\\n # Options\\n parser.add_argument(\\\"-o\\\",\\\"--outbase\\\",help=\\\"base name for output files\\\",action=\\\"store\\\",type=str,default=None)\\n parser.add_argument(\\\"-k\\\",\\\"--kmersize\\\",help=\\\"kmer size\\\",action=\\\"store\\\",type=int,default=12)\\n parser.add_argument(\\\"-s\\\",\\\"--seqperfile\\\",help=\\\"number of sequences per output file\\\",action=\\\"store\\\",\\n type=int,default=50000)\\n parser.add_argument(\\\"-n\\\",\\\"--numkmers\\\",\\n help=\\\"Number of kmers to make, starting from most to least common. If -1, make all possible.\\\",\\n type=int,default=1000000)\\n\\n args = parser.parse_args(argv)\\n\\n if args.outbase is None:\\n out_base = args.fasta_file\\n else:\\n out_base = args.outbase\\n\\n parse_proteome(args.fasta_file,kmer_size=args.kmersize,out_base=out_base,\\n seq_per_file=args.seqperfile,num_to_write=args.numkmers)\",\n \"def process_command_line():\\n parser = argparse.ArgumentParser()\\n parser.add_argument(\\\"srcDir\\\", type=str, help=\\\"Directory containing Unit Hydrograph grids to be aggregated\\\")\\n parser.add_argument(\\\"gridFile\\\", type=str, help=\\\"Input netCDF target grid\\\")\\n parser.add_argument(\\\"--remapDir\\\", type=str, help=\\\"Directory containing Output Unit Hydrograph grids\\\")\\n parser.add_argument(\\\"--aggDir\\\", type=str, help=\\\"Directory where to store aggregated files (before remap)\\\")\\n parser.add_argument(\\\"--inPrefix\\\", type=str, help=\\\"Input Unit Hydrograph File Prefix (default=UH_)\\\",default='UH_')\\n parser.add_argument(\\\"--outPrefix\\\", type=str, help=\\\"Output Unit Hydrograph File Prefix (default=Agg_UH_)\\\", default=\\\"Agg_UH_\\\")\\n parser.add_argument(\\\"--time\\\", type=str, help=\\\"Input Unit Hydrograph time variable name (default=time)\\\",default='time')\\n parser.add_argument(\\\"--lon\\\", type=str, help=\\\"Input Unit Hydrograph longitude variable name (default=lon)\\\",default='lon')\\n parser.add_argument(\\\"--lat\\\", type=str, help=\\\"Input Unit Hydrograph latitude variable name (default=lat)\\\",default='lat')\\n parser.add_argument(\\\"--fraction\\\", type=str, help=\\\"Input Unit Hydrograph fraction variable name (default=fraction)\\\",default='fraction')\\n parser.add_argument(\\\"--unit_hydrograph\\\",type=str, help=\\\"Input unit hydrograph variable name (default=unit_hydrograph)\\\",default='unit_hydrograph')\\n parser.add_argument(\\\"--xc\\\", type=str, help=\\\"Input target grid longitude variable (default=xc)\\\",default='xc')\\n parser.add_argument(\\\"--yc\\\", type=str, help=\\\"Input target grid latitude variable (default=yc)\\\",default='yc') \\n parser.add_argument(\\\"--testAgg\\\",help=\\\"Do a test aggregation, where all inpoint points are aggregated into one file, remapping can be done afterwards using the --remap flag\\\",action=\\\"store_true\\\")\\n parser.add_argument(\\\"--cdoDebug\\\",help=\\\"Enable CDO debuging (prings each step to screen)\\\",action=\\\"store_true\\\")\\n parser.add_argument(\\\"--cdoForce\\\",help=\\\"Enable CDO force output (will overwrite existing files during remap)\\\",action=\\\"store_true\\\")\\n parser.add_argument(\\\"--verbose\\\",help=\\\"Make script verbose\\\",action=\\\"store_true\\\")\\n parser.add_argument(\\\"--remap\\\",help=\\\"Remap the aggregated Unit Hydrographs to outDir and put the aggregated files in the tempDir\\\",action='store_true')\\n parser.add_argument(\\\"--agg\\\",help=\\\"Aggregate the input files onto the targetGrid (gridFile)\\\",action='store_true')\\n parser.add_argument(\\\"--fill_value\\\",type=float,help=\\\"value to use as masked value (default=9.96920996839e+36)\\\",default = 9.96920996839e+36)\\n parser.add_argument(\\\"--pad\\\",type=int,help=\\\"Set number of empty cells to include around each aggregated basin (default=10)\\\",default=10)\\n parser.add_argument(\\\"--resolution\\\",type=float,help=\\\"Set resolution of input Unit Hydrographs (default=1/16.)\\\",default=1/16.)\\n parser.add_argument(\\\"--clean\\\",help=\\\"Clean up aggregated Unit Hydrograph grids if remapping\\\", action='store_true')\\n parser.add_argument(\\\"--dryrun\\\",help=\\\"Do the mapping between the source and target grid based on the files in the input directory, return the performance stats for the run\\\", action='store_true')\\n args = parser.parse_args()\\n\\n options = {}\\n paths = {}\\n # parse the basics\\n Rvars = (args.time,args.lon,args.lat,args.fraction,args.unit_hydrograph)\\n Cvars = (args.yc,args.xc)\\n paths['srcDir'] = args.srcDir\\n paths['gridFile'] = args.gridFile\\n\\n if args.aggDir:\\n paths['aggDir'] = args.aggDir\\n else:\\n paths['aggDir'] = os.path.join(paths['srcDir'],'../aggregated/')\\n if not os.path.exists(paths['aggDir']):\\n os.makedirs(paths['aggDir'])\\n\\n options['verbose'] = args.verbose\\n options['fill_value'] = args.fill_value\\n options['pad'] = args.pad\\n options['resolution'] = args.resolution\\n options['inPrefix'] = args.inPrefix\\n options['outPrefix'] = args.outPrefix\\n options['dryrun'] = args.dryrun\\n options['testAgg'] = args.testAgg\\n options['clean']=args.clean\\n options['remap']=args.remap\\n options['agg']=args.agg\\n \\n if options['remap']:\\n cdo.debug=args.cdoDebug\\n cdo.forceOutput=args.cdoForce\\n if args.remapDir:\\n paths['remapDir'] = args.remapDir\\n else:\\n paths['remapDir'] = os.path.join(paths['srcDir'],'../remaped/')\\n if not os.path.exists(paths['remapDir']):\\n os.makedirs(paths['remapDir'])\\n print paths['remapDir'] \\n\\n return Rvars,Cvars,paths,options\",\n \"def main(argv=None):\\n\\n if argv is None:\\n argv = sys.argv\\n\\n # setup command line parser\\n parser = E.ArgumentParser(description=__doc__)\\n\\n parser.add_argument(\\\"--ID-file\\\", dest=\\\"ID_file\\\", type=str,\\n help=\\\"Supply txt file with Sample Name assigned to Sequencing Number\\\")\\n\\n parser.add_argument(\\\"--Infile-dir\\\", dest=\\\"Infile_Dir\\\", type=str,\\n help=\\\"Supply path to files to be moved\\\")\\n\\n parser.add_argument(\\\"--Outfile-ID-1\\\", dest=\\\"Outfile1_ID\\\", type=str,\\n help=\\\"Supply identifier that can be used to move file to a particular directory e.g. CMS\\\")\\n\\n parser.add_argument(\\\"--Outfile-ID-2\\\", dest=\\\"Outfile2_ID\\\", type=str,\\n help=\\\"Supply identifier within file name that can be used to move file to a particular directory e.g. GFU\\\")\\n\\n parser.add_argument(\\\"--Outfile-dir-1\\\", dest=\\\"Outfile1_Dir\\\", type=str,\\n help=\\\"Supply desired directory for file containing identifier given in --Outfile-ID-1\\\")\\n\\n parser.add_argument(\\\"--Outfile-dir-2\\\", dest=\\\"Outfile2_Dir\\\", type=str,\\n help=\\\"Supply desired directory for file containing identifier given in --Outfile-ID-2\\\")\\n\\n \\n # add common options (-h/--help, ...) and parse command line\\n (args) = E.start(parser, argv=argv)\\n\\n ###############################################\\n ###############################################\\n ############## Execute Functions ##############\\n ###############################################\\n ###############################################\\n\\n\\n IDDict = CreateIDDict(args.ID_file)\\n Shuttle(IDDict, args.Infile_Dir, args.Outfile1_ID, args.Outfile2_ID, args.Outfile1_Dir, args.Outfile2_Dir)\\n \\n \\n # write footer and output benchmark information.\\n E.stop()\",\n \"def main():\\n sys.argv.pop(0)\\n (cmd, var, args) = process_options(sys.argv[:])\\n execute(cmd, var, args)\",\n \"def main():\\n parser = argparse.ArgumentParser(description=main.__doc__,\\n formatter_class=argparse.RawTextHelpFormatter)\\n\\n parser.add_argument('-1',\\n dest='r1',\\n help='Path to first fasta file.')\\n\\n parser.add_argument('-2',\\n dest='r2',\\n help='Path to paired fasta file.')\\n\\n args = parser.parse_args()\\n salmon(args.r1, args.r2)\",\n \"def process_command_line(argv):\\n\\tif argv is None:\\n\\t\\targv = sys.argv[1:]\\n\\t\\t\\n\\t# initialize the parser object:\\n\\tparser = optparse.OptionParser(\\n\\t\\t\\t formatter=optparse.TitledHelpFormatter(width=78),\\n\\t\\t\\t add_help_option=None)\\n\\n\\t# define options here:\\n\\n\\tparser.add_option(\\n\\t\\t'-w', '--workdir',\\n\\t\\thelp='Workdir where temporary and final files will be saved.')\\n\\n\\tparser.add_option(\\n\\t\\t'-a', '--assembly_file',\\n\\t\\thelp='File with a list of assemblies for which a reference genome is to be determined.')\\n\\n\\tparser.add_option(\\n \\t'--installation',\\n \\thelp='Pipeline installation.')\\n\\n parser.add_option(\\n '--EDIRECT',\\n help='edirect tools installation.')\\n\\n parser.add_option(\\n '--QUAST',\\n help='Quast installation.')\\n\\n parser.add_option(\\n '--mail',\\n help='Email for edirect.')\\n\\n\\tparser.add_option(\\n\\t\\t'-o', '--organism',\\n\\t\\thelp='Organism to be searched for on NCBI Assembly.')\\n\\n\\tparser.add_option(\\n\\t\\t'--dont_delete', action=\\\"store_true\\\",\\n\\t\\thelp='Do not delete temporary files after running.')\\n\\t\\t\\n\\tparser.add_option(\\n\\t\\t'-s', '--script', default=\\\"/home/users/yair/Documents/PhD_projects/project_B/bin/downloading_database/determine_best_genome.sh\\\",\\n\\t\\thelp='Path of determine_best_genome.sh script')\\n\\n\\tparser.add_option( # customized description; put --help last\\n\\t\\t'-h', '--help', action='help',\\n\\t\\thelp='Show this help message and exit.')\\n\\n\\tsettings, args = parser.parse_args(argv)\\n\\n\\treturn settings, args\",\n \"def main():\\n run_simulation(spectral=False, ml=False, num_procs=1)\\n run_simulation(spectral=True, ml=False, num_procs=1)\\n run_simulation(spectral=False, ml=True, num_procs=1)\\n run_simulation(spectral=True, ml=True, num_procs=1)\\n run_simulation(spectral=False, ml=True, num_procs=10)\\n run_simulation(spectral=True, ml=True, num_procs=10)\",\n \"def main():\\n args = _parse_arguments()\\n\\n util.log_init(\\\"sitl_A%s_%s.txt\\\" % (args.id, util.get_latest_log(\\\"latest_sitl.txt\\\")), util.log_level[args.level])\\n\\n shared.AGENT_ID = 'A%s' % args.id\\n shared.AGENT_COUNT = args.n\\n shared.CURRENT_ALGORITHM = args.algorithm\\n shared.AGENT_CHARACTER = args.character\\n shared.des_alt = args.alt\\n \\n util.log_info(\\\"AGENT_ID = %s\\\" % shared.AGENT_ID)\\n util.log_info(\\\"Algorithm: %s\\\" % shared.CURRENT_ALGORITHM)\\n util.log_info(\\\"Agent type: %s\\\" % shared.AGENT_CHARACTER)\\n\\n print \\\"Start simulator (SITL)\\\"\\n sitl = SITL(args.pix) # initialize SITL with firmware path\\n\\n if shared.AGENT_ID in start_loc:\\n sitl_args = ['--home=%s' % start_loc[shared.AGENT_ID]]\\n else:\\n sitl_args = ['--home=%s' % start_loc['FFF']]\\n \\n # Pre-recorded coordinates.\\n #sitl_args = ['-I0', '--model', 'quad', '--home=31.301201,121.498192,9,353']\\t\\n sitl.launch(sitl_args, await_ready=True, restart=True)\\n\\n # Connect to the vehicle. (Spawn an instance of Vehicle named \\\"vehicle\\\")\\n # connection port is coded in the file name of the firmware like \\\"ac3.4.5_port5760\\\"\\n # use regular expression to search the string and extract port number\\n port = re.search(r'port\\\\d{4}', args.pix)\\n port = re.search(r'\\\\d{4}', port.group()).group()\\n\\n print \\\"Connecting to copter on: TCP: 127.0.0.1:%s\\\" % port\\n copter = nav.connect('tcp:127.0.0.1:%s' % port, wait_ready=True, rate=20)\\n util.log_info(\\\"Copter connected. Firmware: %s\\\" % copter.version)\\n \\n if not args.xbee: # simulate XBee using ZeroMQ\\n [pub, sub] = comm.zmq_init(comm_port_list[shared.AGENT_ID], comm_port_list)\\n subscriber_thread = comm.Subscriber(shared.AGENT_ID, sub)\\n subscriber_thread.start()\\n xbee = pub # make xbee the publisher\\n util.log_info(\\\"ZeroMQ initialzied.\\\") \\n \\n else: # use actual xbee ports\\n ser = serial.Serial(args.xbee, 57600)\\n xbee = comm.xbee_init(ser)\\n util.log_info(\\\"Xbee initialzed.\\\")\\n\\n info = \\\"IFO,%s connected with firmware %s\\\" % (shared.AGENT_ID, copter.version)\\n comm.xbee_broadcast(xbee, info)\\n\\n _add_listeners(copter)\\n\\n takeoff_thread = nav.Takeoff(copter, xbee, shared.des_alt, 3)\\n purge_thread = comm.Purge(shared.neighbors)\\n broadcast_thread = comm.Broadcast(shared.AGENT_ID, copter, xbee)\\n flocking_thread = _choose_algorithm(copter, xbee, shared.neighbors)\\n\\n takeoff_thread.start()\\n takeoff_thread.join() # wait until takeoff procedure completed\\n\\n if shared.status['airborne']: # only execute the threads when airborne\\n util.log_info(\\\"Copter is airborne, starting threads.\\\")\\n broadcast_thread.start()\\n purge_thread.start()\\n flocking_thread.start()\\n\\n # main loop\\n while True:\\n try: time.sleep(.2)\\n except KeyboardInterrupt: break\\n \\n if shared.status['airborne']:\\n # echo exiting status\\n if shared.status['exiting']:\\n info = \\\"IFO,%s %s-ing.\\\" % (shared.AGENT_ID,shared.status['command'])\\n comm.xbee_broadcast(xbee, info)\\n util.log_info(info)\\n\\n # if an rtl or land command is received, kill flocking and set the `exiting` flag\\n elif shared.status['command'] == 'RTL' or shared.status['command'] == 'LAND':\\n shared.status['thread_flag'] |= shared.FLOCKING_FLAG\\n nav.set_mode(copter, shared.status['command'])\\n shared.status['exiting'] = True\\n\\n if not flocking_thread.is_alive(): # break the loop if finished\\n break\\n\\n nav.wait_for_disarm(copter) # wait for disarm\\n comm.xbee_broadcast(xbee, 'IFO,%s terminated.' % shared.AGENT_ID)\\n\\n # clean up\\n purge_thread.stop()\\n while purge_thread.is_alive(): \\n util.log_info('Waiting for purge to shutdown') \\n purge_thread.join(3)\\n util.log_info('Purge killed.')\\n\\n broadcast_thread.stop()\\n while broadcast_thread.is_alive(): \\n util.log_info('Waiting for broadcast to shutdown') \\n broadcast_thread.join(3)\\n util.log_info('Broadcast killed.')\\n\\n copter.close()\\n util.log_info(\\\"Copter shutdown.\\\")\\n\\n if args.xbee:\\n xbee.halt()\\n ser.close()\\n util.log_info(\\\"Xbee and serial closed.\\\")\\n else:\\n subscriber_thread.stop()\\n while subscriber_thread.is_alive(): \\n util.log_info('Waiting for Subscriber to shutdown') \\n subscriber_thread.join(3)\\n util.log_info('Subscriber killed.')\\n\\n sitl.stop()\\n util.log_info(\\\"SITL shutdown.\\\")\",\n \"def ParseArguments():\\n\\t#TODO: check input variable types!\\n\\t# check for integers ans strings\\n\\t# check for distance and distance cutoff value: ONLY CERTAIN VALUES ALLOWED\\n\\targ_parser = argparse.ArgumentParser(description=\\\"Program to get background distribution matching user input SNPs on the following parameters {MAF, distance to nearest gene, gene density}\\\")\\n\\tsubparsers = arg_parser.add_subparsers(dest='subcommand',\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t title='subcommands in this script',\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t description='valid subcommands. set subcommand after main program required arguments',\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t help='You can get additional help by writing <program-name> <subcommand> --help')\\n\\n\\t## Subparsers\\n\\targ_parser_annotate = subparsers.add_parser('annotate')\\n\\t#arg_parser_annotate.set_defaults(func=run_annotate)\\n\\targ_parser_match = subparsers.add_parser('match')\\n\\t#arg_parser_annotate.set_defaults(func=run_match)\\n\\n\\n\\targ_parser.add_argument(\\\"--user_snps_file\\\", help=\\\"Path to file with user-defined SNPs\\\", required=True) # TODO: make the program read from STDIN via '-'\\n\\targ_parser.add_argument(\\\"--output_dir\\\", help=\\\"Directory in which output files, i.e. random SNPs will be written\\\", required=True)\\n\\t#arg_parser.add_argument(\\\"--output_dir\\\", type=ArgparseAdditionalUtils.check_if_writable, help=\\\"Directory in which output files, i.e. random SNPs will be written\\\", required=True)\\n\\targ_parser.add_argument(\\\"--distance_type\\\", help=\\\"ld or kb\\\", required=True)\\n\\targ_parser.add_argument(\\\"--distance_cutoff\\\", help=\\\"r2, or kb distance\\\", required=True)\\n\\t# NEW: options\\n\\t#arg_parser.add_argument(\\\"--status_file\\\", help=\\\"Bool (switch, takes no value after argument); if set then logging is ENABLED.\\\", action='store_true')\\n\\t#arg_parser.add_argument(\\\"--status_file\\\", help=\\\"If set, a json file will be written. Value should be the a filepath.\\\")\\n\\targ_parser.add_argument(\\\"--web\\\", help=\\\"If set, the program will run in web mode. VALUE should be the a filepath to output (temporary) file - usually this will be the session_id. The web mode activates: 1) creating a status_obj and writing it to json file; 2) ENABLE writing a json report file;\\\")\\n\\targ_parser.add_argument(\\\"--NoLogger\\\", help=\\\"Bool (switch, takes no value after argument); if set then logging is DISAPLED. Logfile will be placed in outputdir.\\\", action='store_true')\\n\\n\\n\\t### MATCH arguments\\n\\targ_parser_match.add_argument(\\\"--N_sample_sets\\\", type=int, help=\\\"Number of matched SNPs to retrieve\\\", required=True) # 1000 - \\\"Permutations?\\\" TODO: change name to --n_random_snp_sets or --N\\n\\t#TODO: add argument that describes if ABSOLUTE of PERCENTAGE deviation should be used\\n\\targ_parser_match.add_argument(\\\"--max_freq_deviation\\\", type=int,help=\\\"Maximal deviation of SNP MAF bin [MAF +/- deviation]\\\", default=5) # 5\\n\\targ_parser_match.add_argument(\\\"--max_distance_deviation\\\", type=int, help=\\\"Maximal PERCENTAGE POINT deviation of distance to nearest gene [distance +/- %%deviation])\\\", default=5) # 20000\\n\\t#TODO: CHECK THAT max_distance_deviation > 1 %\\n\\t#TODO: WHY IS max_genes_count_deviation type float!!!!????\\n\\targ_parser_match.add_argument(\\\"--max_genes_count_deviation\\\", type=float, help=\\\"Maximal PERCENTAGE POINT deviation of genes in locus [gene_density +/- %%deviation]\\\", default=5) # 0.2\\n\\targ_parser_match.add_argument(\\\"--set_file\\\", help=\\\"Bool (switch, takes no value after argument); if set then write out set files to rand_set..gz. Default is false\\\", action='store_true')\\n\\n\\targs = arg_parser.parse_args()\\n\\n\\treturn args\",\n \"def test_cmdlineproc_test1():\\n\\n parameters = {\\n \\\"debug\\\": False,\\n \\\"disconnect\\\": False,\\n \\\"executable\\\": \\\"\\\",\\n \\\"executableargs\\\": \\\"\\\",\\n \\\"hosts\\\": \\\"\\\",\\n \\\"job\\\": \\\"\\\",\\n \\\"jobname\\\": \\\"\\\",\\n \\\"log\\\": \\\"\\\",\\n \\\"recover\\\": \\\"\\\",\\n \\\"resource\\\": \\\"\\\",\\n \\\"replicates\\\": \\\"\\\",\\n \\\"verbose\\\": False\\n }\\n\\n commandlineargs = []\\n\\n longbowargs = _commandlineproc(ALLLONGBOWARGS, commandlineargs, parameters)\\n\\n assert parameters[\\\"executable\\\"] == \\\"\\\"\\n assert parameters[\\\"executableargs\\\"] == \\\"\\\"\\n assert longbowargs == []\",\n \"def main():\\r\\n # Instantiate the data problem.\\r\\n data = create_data_model()\\r\\n\\r\\n # Create the routing index manager.\\r\\n manager = pywrapcp.RoutingIndexManager(len(data['distance_matrix']), data['num_vehicles'], data['depot'])\\r\\n\\r\\n # Create Routing Model.\\r\\n routing = pywrapcp.RoutingModel(manager)\\r\\n\\r\\n\\r\\n # Create and register a transit callback.\\r\\n def distance_callback(from_index, to_index):\\r\\n \\\"\\\"\\\"Returns the distance between the two nodes.\\\"\\\"\\\"\\r\\n # Convert from routing variable Index to distance matrix NodeIndex.\\r\\n from_node = manager.IndexToNode(from_index)\\r\\n to_node = manager.IndexToNode(to_index)\\r\\n return data['distance_matrix'][from_node][to_node]\\r\\n\\r\\n transit_callback_index = routing.RegisterTransitCallback(distance_callback)\\r\\n\\r\\n # Define cost of each arc.\\r\\n routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index)\\r\\n\\r\\n\\r\\n # Add Capacity constraint.\\r\\n def demand_callback(from_index):\\r\\n \\\"\\\"\\\"Returns the demand of the node.\\\"\\\"\\\"\\r\\n # Convert from routing variable Index to demands NodeIndex.\\r\\n from_node = manager.IndexToNode(from_index)\\r\\n return data['demands'][from_node]\\r\\n\\r\\n demand_callback_index = routing.RegisterUnaryTransitCallback(\\r\\n demand_callback)\\r\\n routing.AddDimensionWithVehicleCapacity(\\r\\n demand_callback_index,\\r\\n 0, # null capacity slack\\r\\n data['vehicle_capacities'], # vehicle maximum capacities\\r\\n True, # start cumul to zero\\r\\n 'Capacity')\\r\\n\\r\\n # Setting first solution heuristic.\\r\\n search_parameters = pywrapcp.DefaultRoutingSearchParameters()\\r\\n search_parameters.first_solution_strategy = (\\r\\n routing_enums_pb2.FirstSolutionStrategy.PATH_CHEAPEST_ARC)\\r\\n\\r\\n\\r\\n # Solve the problem.\\r\\n assignment = routing.SolveWithParameters(search_parameters)\\r\\n\\r\\n # Print solution on console.\\r\\n if assignment:\\r\\n print_solution(data, manager, routing, assignment)\",\n \"def runTriplexator(args):\\n global TRIPLEXATOR_LIBRARY_ENV\\n triplex_lib_path = os.environ.get(TRIPLEXATOR_LIBRARY_ENV)\\n\\n if os.environ.get(TRIPLEXATOR_LIBRARY_ENV) is None:\\n print \\\"Please set the environment variable for the Triplexator library (\\\" + TRIPLEXATOR_LIBRARY_ENV + \\\").\\\"\\n else:\\n triplex_lib = cdll.LoadLibrary(triplex_lib_path)\\n arg_strings = args.split(' ')\\n arg_ptr = (c_char_p * (len(arg_strings) + 1))()\\n\\n arg_ptr[0] = \\\"triplexator\\\" # to simulate calling from cmd line\\n for i, s in enumerate(arg_strings):\\n arg_ptr[i + 1] = s\\n\\n triplex_lib.pyTriplexator(len(arg_strings) + 1, arg_ptr)\",\n \"def main():\\n utl.calibrate(False)\\n undistort(False)\\n edge_detect(False)\\n transform(False)\\n identify_line(False)\\n lane_line(True)\",\n \"def system_parallel(cmdL, nproc=None, verbose=True):\\n if nproc is None:\\n nproc = multiprocessing.cpu_count()\\n sh_filename = '_run_parallel_' + hashlib.md5('\\\\n'.join(cmdL).encode('utf-8')).hexdigest()\\n with open(sh_filename, 'wt') as f:\\n f.write('\\\\n'.join(cmdL))\\n out = subprocess.check_output('parallel -j%d %s--keep-order < %s' % (nproc, '--verbose ' if verbose else '', sh_filename), shell=True)\\n out = out.decode('utf-8')\\n if verbose:\\n print('-'*80)\\n print('system_parallel output:')\\n print('-'*80)\\n print(out)\\n os.remove(sh_filename)\\n return out\",\n \"def parse_arguments():\\n\\n info = 'Divides pdb info files for parallelization'\\n parser = argparse.ArgumentParser(description=info)\\n\\n # program arguments\\n parser.add_argument('-f', '--in-file',\\n type=str,\\n required=True,\\n help='PDB info file to divide')\\n parser.add_argument('-n', '--num-splits',\\n default=1000,\\n type=int,\\n help='Number of splits to perform (Default: 1000)')\\n parser.add_argument('-m', '--mut-file',\\n type=str,\\n required=True,\\n help='File containing mutation information')\\n parser.add_argument('--split-dir',\\n default = \\\"../data/split_pdbs/\\\",\\n type=str,\\n help='Output directory for split PDB info files')\\n\\n args = parser.parse_args()\\n opts = vars(args)\\n return opts\",\n \"def main():\\r\\n\\r\\n option_parser, opts, args = parse_command_line_parameters(**script_info)\\r\\n\\r\\n # additional option checks\\r\\n if opts.chimera_detection_method == 'blast_fragments':\\r\\n if not (opts.blast_db or opts.reference_seqs_fp):\\r\\n option_parser.error('Must provide either --blast_db or' +\\r\\n ' --reference_seqs_fp and --id_to_taxonomy_fp when' +\\r\\n ' method is blast_fragments.')\\r\\n if not opts.id_to_taxonomy_fp:\\r\\n option_parser.error('Must provide --id_to_taxonomy_fp when method' +\\r\\n ' is blast_fragments.')\\r\\n if opts.num_fragments < 2:\\r\\n option_parser.error('Invalid number of fragments (-n %d) Must be >= 2.'\\r\\n % opts.num_fragments)\\r\\n elif opts.chimera_detection_method == 'ChimeraSlayer':\\r\\n if not opts.aligned_reference_seqs_fp:\\r\\n option_parser.error(\\\"Must provide --aligned_reference_seqs_fp \\\"\\r\\n \\\"when using method ChimeraSlayer\\\")\\r\\n elif opts.chimera_detection_method == 'usearch61':\\r\\n if opts.suppress_usearch61_ref and opts.suppress_usearch61_denovo:\\r\\n option_parser.error(\\\"Supressing both de novo and reference \\\"\\r\\n \\\"chimera detection not allowed.\\\")\\r\\n if not opts.reference_seqs_fp and not opts.suppress_usearch61_ref:\\r\\n option_parser.error(\\\"--reference_seqs_fp required for reference \\\"\\r\\n \\\"based chimera detection, suppress reference based chimera \\\"\\r\\n \\\"detection with --suppress_usearch61_ref\\\")\\r\\n if opts.reference_seqs_fp:\\r\\n try:\\r\\n temp_f = open(opts.reference_seqs_fp, \\\"U\\\")\\r\\n temp_f.close()\\r\\n except IOError:\\r\\n raise IOError(\\\"Unable to open --reference_seqs_fp, please \\\"\\r\\n \\\"check filepath and permissions.\\\")\\r\\n if opts.non_chimeras_retention not in ['intersection', 'union']:\\r\\n option_parser.error(\\\"--non_chimeras_retention must be either \\\"\\r\\n \\\"'union' or 'intersection'\\\")\\r\\n if opts.usearch61_xn <= 1:\\r\\n option_parser.error(\\\"--usearch61_xn must be > 1\\\")\\r\\n if opts.usearch61_dn <= 0:\\r\\n option_parser.error(\\\"--usearch61_dn must be > 0\\\")\\r\\n if opts.usearch61_mindiffs <= 0:\\r\\n option_parser.error(\\\"--usearch61_mindiffs must be > 0\\\")\\r\\n if opts.usearch61_mindiv <= 0:\\r\\n option_parser.error(\\\"--usearch61_mindiv must be > 0\\\")\\r\\n if opts.usearch61_abundance_skew <= 0:\\r\\n option_parser.error(\\\"--usearch61_abundance_skew must be > 0\\\")\\r\\n\\r\\n verbose = opts.verbose # not used yet ...\\r\\n input_seqs_fp = opts.input_fasta_fp\\r\\n id_to_taxonomy_fp = opts.id_to_taxonomy_fp\\r\\n reference_seqs_fp = opts.reference_seqs_fp\\r\\n chimera_detection_method = opts.chimera_detection_method\\r\\n num_fragments = opts.num_fragments\\r\\n output_fp = opts.output_fp\\r\\n taxonomy_depth = opts.taxonomy_depth\\r\\n max_e_value = opts.max_e_value\\r\\n blast_db = opts.blast_db\\r\\n keep_intermediates = opts.keep_intermediates\\r\\n threads = opts.threads\\r\\n\\r\\n # calculate threads as 1 per CPU, or use float of input value\\r\\n if threads == 'one_per_cpu':\\r\\n threads = float(1 / cpu_count())\\r\\n else:\\r\\n # Make sure input is a float\\r\\n try:\\r\\n threads = float(threads)\\r\\n except ValueError:\\r\\n option_parser.error(\\\"--threads must be a float value if \\\"\\r\\n \\\"default 'one_per_cpu' value overridden.\\\")\\r\\n\\r\\n if not output_fp:\\r\\n if chimera_detection_method == \\\"usearch61\\\":\\r\\n output_dir = \\\"usearch61_chimeras/\\\"\\r\\n create_dir(output_dir, fail_on_exist=False)\\r\\n else:\\r\\n input_basename = splitext(split(input_seqs_fp)[1])[0]\\r\\n output_fp = '%s_chimeric.txt' % input_basename\\r\\n elif chimera_detection_method == \\\"usearch61\\\":\\r\\n output_dir = output_fp\\r\\n create_dir(output_dir, fail_on_exist=False)\\r\\n\\r\\n if chimera_detection_method == 'blast_fragments':\\r\\n blast_fragments_identify_chimeras(input_seqs_fp,\\r\\n id_to_taxonomy_fp,\\r\\n reference_seqs_fp, blast_db=blast_db,\\r\\n num_fragments=opts.num_fragments,\\r\\n max_e_value=max_e_value,\\r\\n output_fp=output_fp,\\r\\n taxonomy_depth=taxonomy_depth)\\r\\n elif chimera_detection_method == 'ChimeraSlayer':\\r\\n chimeraSlayer_identify_chimeras(input_seqs_fp,\\r\\n output_fp=output_fp,\\r\\n db_FASTA_fp=opts.reference_seqs_fp,\\r\\n db_NAST_fp=opts.aligned_reference_seqs_fp,\\r\\n min_div_ratio=opts.min_div_ratio,\\r\\n keep_intermediates=keep_intermediates)\\r\\n elif chimera_detection_method == 'usearch61':\\r\\n usearch61_chimera_check(input_seqs_fp,\\r\\n output_dir=output_dir,\\r\\n reference_seqs_fp=reference_seqs_fp,\\r\\n suppress_usearch61_intermediates=opts.suppress_usearch61_intermediates,\\r\\n suppress_usearch61_ref=opts.suppress_usearch61_ref,\\r\\n suppress_usearch61_denovo=opts.suppress_usearch61_denovo,\\r\\n split_by_sampleid=opts.split_by_sampleid,\\r\\n non_chimeras_retention=opts.non_chimeras_retention,\\r\\n usearch61_minh=opts.usearch61_minh,\\r\\n usearch61_xn=opts.usearch61_xn,\\r\\n usearch61_dn=opts.usearch61_dn,\\r\\n usearch61_mindiffs=opts.usearch61_mindiffs,\\r\\n usearch61_mindiv=opts.usearch61_mindiv,\\r\\n usearch61_abundance_skew=opts.usearch61_abundance_skew,\\r\\n percent_id_usearch61=opts.percent_id_usearch61,\\r\\n minlen=opts.minlen,\\r\\n word_length=opts.word_length,\\r\\n max_accepts=opts.max_accepts,\\r\\n max_rejects=opts.max_rejects,\\r\\n verbose=opts.verbose,\\r\\n threads=threads)\",\n \"def ProcessCommandLine():\\n\\tparser = argparse.ArgumentParser(description=__doc__.strip())\\n\\n\\tparser.add_argument('--calibrate', action='store_true', default=False,\\n help='Create pixel position calibration using camera')\\n\\tparser.add_argument('--calibrate-rgb', metavar='R,G,B', type=str, default='50,50,50',\\n help='Calibration RGB value 0-255,0-255,0-255')\\n \\tparser.add_argument('--calibration-name', metavar='FILENAME', type=str, default=None,\\n help='Pixel calibration name to create/read')\\n\\tparser.add_argument('--plot', action='store_true', default=False,\\n help='Plot the calibration')\\n\\tparser.add_argument('--clear', action='store_true', default=False,\\n help='Switch of all pixels')\\n\\tparser.add_argument('--debug', action='store_true', default=False,\\n\\t\\t\\t help='Print back trace in event of exception')\\n\\n\\n\\treturn parser.parse_args()\",\n \"def main():\\n\\n parser = argparse.ArgumentParser()\\n\\n parser.add_argument(\\\"-hgt\\\", \\\"--imgHeight\\\", help=\\\"The height of the images, default=720.\\\",\\n type=int, default=720)\\n\\n parser.add_argument(\\\"-wd\\\", \\\"--imgWidth\\\", help=\\\"The width of the images, default=1280.\\\",\\n type=int, default=1280)\\n\\n parser.add_argument(\\\"-r\\\", \\\"--chessboardRows\\\", help=\\\"The rows of the chessboard calibration images, default=6.\\\",\\n type=int, default=6)\\n\\n parser.add_argument(\\\"-c\\\", \\\"--chessboardCols\\\", help=\\\"The cols of the chessboard calibration images, default=9.\\\",\\n type=int, default=9)\\n\\n parser.add_argument(\\\"-cp\\\", \\\"--calibrationPath\\\", help=\\\"The height of the images, default=720.\\\",\\n type=str, default='')\\n\\n parser.add_argument(\\\"-in\\\", \\\"--inputVideoPath\\\", help=\\\"The path to the input video to be processed.\\\",\\n type=str, default='')\\n\\n parser.add_argument(\\\"-out\\\", \\\"--outputVideoPath\\\", help=\\\"The path to the where to store output video.\\\",\\n type=str, default='')\\n\\n args = parser.parse_args()\\n\\n print(args)\\n\\n assert args.calibrationPath != '', \\\"The path to calibration images can't be empty\\\"\\n assert args.inputVideoPath != '', \\\"The path to input video can't be empty\\\"\\n assert args.outputVideoPath != '', \\\"The path to output video can't be empty\\\"\\n\\n camera_mtx, dist_coeff = CameraCalibration((args.imgHeight, args.imgWidth),\\n (args.chessboardRows, args.chessboardCols),\\n args.calibrationPath).calibrate()\\n print(\\\"Camera Mtx\\\", camera_mtx)\\n print(\\\"Distortion Coefficient\\\", dist_coeff)\\n # img = cv2.imread('test_images/test5.jpg')\\n # img = cv2.cvtColor(img, cv2.COLOR_BGR2RGB)\\n\\n AdvancedLaneDetection(args.inputVideoPath, camera_mtx, dist_coeff).process_video(args.outputVideoPath)\\n\\n # cv2.imwrite(\\\"output.jpg\\\", result)\",\n \"def main(target_clusters, clusters_per_lane, project_id, dest_plate_list, allow_non_dupl_struct): \\n couch = connection()\\n structure = proj_struct(couch, project_id, target_clusters)\\n [lane_maps, clusters_rem, clusters_expr] = parse_indata(structure, target_clusters)\\n if allow_non_dupl_struct:\\n aggregator(lane_maps,clusters_rem,clusters_per_lane)\\n else:\\n simple_unique_set(lane_maps)\\n [ideal_ratios, req_lanes, total_lanes] = sample_distributor(lane_maps, clusters_rem, clusters_per_lane)\\n acc_ratios = correct_numbers(lane_maps, clusters_expr, ideal_ratios, req_lanes, total_lanes)\\n generate_output(project_id, dest_plate_list, total_lanes, req_lanes, lane_maps, acc_ratios)\",\n \"def run_lammps(lammps_executable, input_file, output_file):\\n # run lammps\\n lammps_command = f\\\"{lammps_executable} -in {input_file} \\\"\\n print(\\\"run command:\\\", lammps_command)\\n with open(\\\"tmp2False.out\\\", \\\"w+\\\") as fout:\\n subprocess.call(lammps_command.split(), stdout=fout)\",\n \"def main():\\n # get arguments from command line\\n args = parse_arguments()\\n\\n # checks on the output file\\n # if args.stats_only:\\n # assert args.output, \\\"The output file was not provided\\\"\\n if args.output and os.path.exists(args.output):\\n warnings.warn(\\\"Overwriting task file \\\" + args.output, UserWarning)\\n os.remove(args.output)\\n\\n # initialize the task\\n task = Task(\\n args.database, args.on,\\n across=args.across,\\n by=args.by,\\n filters=args.filters,\\n regressors=args.regressors,\\n verbose=args.verbose)\\n\\n if args.stats_only:\\n task.print_stats()\\n else:\\n if args.tempdir and not os.path.exists(args.tempdir):\\n os.makedirs(args.tempdir)\\n\\n # generate triplets and unique pairs\\n task.generate_triplets(\\n output=args.output,\\n threshold=args.threshold,\\n tmpdir=args.tempdir,\\n seed=args.seed)\",\n \"def main():\\n arg_parser = argparse.ArgumentParser(description=\\\"\\\"\\\"\\n This utility will take a SAM alignment file from paired end reads \\n and filter the original read FASTQ files do those reads without\\n high-likelihood alignments to human.\\n For gzipped alignments, consider using pipes: \\n gunzip -c ref.fna.gz | strip_mt_ebv.py | gzip > ref.nomtebv.fna.gz\\n \\\"\\\"\\\")\\n\\n arg_parser.add_argument(\\n '--alnfile', '-A',\\n type=argparse.FileType('r'),\\n help='Alignment File. Can be stdin. For gzip, consider pipes',\\n default=sys.stdin\\n )\\n arg_parser.add_argument(\\n '--r1in', '-1',\\n required=True,\\n help='Input fastq file for R1'\\n )\\n arg_parser.add_argument(\\n '--r2in', '-2',\\n required=True,\\n help='Input fastq file for R2'\\n )\\n arg_parser.add_argument(\\n '--r1out', '-o1',\\n required=True,\\n help='Output fastq file for R1'\\n )\\n arg_parser.add_argument(\\n '--r2out', '-o2',\\n required=True,\\n help='Output fastq file for R2'\\n )\\n arg_parser.add_argument(\\n '--mapq',\\n default=30,\\n type=int,\\n help='Minimum mapq required to be considered a valid read'\\n )\\n arg_parser.add_argument(\\n '--cov_min',\\n type=float,\\n default=0.9\\n )\\n\\n args = arg_parser.parse_args()\\n\\n passed_ids = get_passing_ids(\\n args.alnfile,\\n args.mapq,\\n args.cov_min,\\n )\\n\\n filter_fastq(\\n passed_ids,\\n args.r1in,\\n args.r2in,\\n args.r1out,\\n args.r2out\\n )\",\n \"def main():\\n parser = argparse.ArgumentParser(description=MAIN_DESCRIPTION)\\n parser.add_argument('-a', '--algorithm', help=ALGORITHM_DESCRIPTION)\\n parser.add_argument('-n', '--number', type=int, help=NUMBER_DESCRIPTION)\\n parser.add_argument('-o', '--order', help=ORDER_DESCRIPTION)\\n parser.add_argument('-s', '--size', help=SIZE_DESCRIPTION)\\n args = parser.parse_args()\\n try:\\n if not (args.algorithm and args.number and args.order and args.size):\\n raise ValueError\\n create_structure()\\n try:\\n data = get_data(args.number, args.order, args.size)\\n except IOError:\\n data = generate_in_files(args.number, args.order, args.size)\\n finally:\\n alg, out, time = sorting_algorithm(data, args.algorithm)\\n # generate_out_files(out, args.number)\\n generate_log_file(args.algorithm, args.number, args.order,\\n args.size, alg.compares, alg.moves, time)\\n except (TypeError, UnboundLocalError, ValueError) as e:\\n parser.print_help()\",\n \"def parseArgs():\\n parser = ArgumentParser(description='Main deepSAMIREI script.')\\n parser.add_argument('-v', '--verbose',dest='verbose', action='store_true', \\n default=False, help=\\\"verbose output [default is quiet running]\\\")\\n \\n parser.add_argument('-o','--outDir',dest='directory',type=str,\\n action='store',help=\\\"output directory\\\", default='')\\n parser.add_argument('-m','--mode', dest='mode',type=str,\\n action='store',help=\\\"Mode of operation: train or test.\\\", default='train') \\n parser.add_argument('--deskload', dest='deskLoad',\\n action='store_true',default=False,\\n help=\\\"Load dataset from desk. If false, the data is converted into tensors and kept in main memory (not recommended for large datasets).\\\") \\n parser.add_argument('-w','--numworkers',dest='numWorkers',type=int,\\n action='store',help=\\\"Number of workers used in data loader. For loading from the desk, use more than 1 for faster fetching.\\\", default=1) \\n #parser.add_argument('-c','--cvtype',dest='cvtype',type=str,action='store',\\n # help=\\\"Type of cross validation to use. Options are: chrom (leave-one-chrom-out), nfolds (N fold CV), and none (No CV, just regular train test split)\\\",\\n # default='none')\\n #parser.add_argument('--numfolds',dest='numfolds',type=int,action='store',\\n # help=\\\"Number of folds for N fold CV\\\", default=10)\\n parser.add_argument('--splittype',dest='splitType',type=str, action='store',\\n help=\\\"Either to use a percantage of data for valid,test or use specific chromosomes. In the later case, provide chrA,chrB for valid,test. Default value is percent and --splitperc value will be used.\\\", default='percent')\\n parser.add_argument('--splitperc',dest='splitperc',type=float, action='store',\\n help=\\\"Pecentages of test, and validation data splits, eg. 10 for 10 percent data used for testing and validation.\\\", default=10)\\n parser.add_argument('--motifanalysis', dest='motifAnalysis',\\n action='store_true',default=False,\\n help=\\\"Analyze CNN filters for motifs and search them against known TF database.\\\")\\n parser.add_argument('--scorecutoff',dest='scoreCutoff',type=float,\\n action='store',default=0.65,\\n help=\\\"In case of binary labels, the positive probability cutoff to use.\\\")\\n parser.add_argument('--tomtompath',dest='tomtomPath',\\n type=str,action='store',default=None,\\n help=\\\"Provide path to where TomTom (from MEME suite) is located.\\\") \\n parser.add_argument('--database',dest='tfDatabase',type=str,action='store',\\n help=\\\"Search CNN motifs against known TF database. Default is Human CISBP TFs.\\\", default=None)\\n parser.add_argument('--annotate',dest='annotateTomTom',type=str,action='store',\\n default=None, help=\\\"Annotate tomtom motifs. The options are: 1. path to annotation file, 2. No (not to annotate the output) 3. None (default where human CISBP annotations are used)\\\") \\n parser.add_argument('-a','--attnfigs', dest='attnFigs',\\n action='store_true',default=False,\\n help=\\\"Generate Attention (matrix) figures for every test example.\\\")\\n parser.add_argument('-i','--interactions', dest='featInteractions',\\n action='store_true',default=False,\\n help=\\\"Self attention based feature(TF) interactions analysis.\\\")\\n parser.add_argument('-b','--background', dest='intBackground',type=str,\\n action='store',default=None,\\n help=\\\"Background used in interaction analysis: shuffle (for di-nucleotide shuffled sequences with embedded motifs.), negative (for negative test set). Default is not to use background (and significance test).\\\")\\n parser.add_argument('--attncutoff', dest='attnCutoff',type=float,\\n action='store',default=0.04,\\n help=\\\"Attention (probability) cutoff value to use while searching for maximum interaction. A value (say K) greater than 1.0 will mean using top K interaction values.\\\") #In human promoter DHSs data analysis, lowering the cutoff leads to more TF interactions. \\n parser.add_argument('--intseqlimit', dest='intSeqLimit',type=int,\\n action='store',default = -1,\\n help=\\\"A limit on number of input sequences to test. Default is -1 (use all input sequences that qualify).\\\")\\n parser.add_argument('-s','--store', dest='storeInterCNN',\\n action='store_true',default=False,\\n help=\\\"Store per batch attention and CNN outpout matrices. If false, the are kept in the main memory.\\\")\\n parser.add_argument('--considertophit', dest='considerTopHit',\\n action='store_true',default=False,\\n help=\\\"Consider only the top matching TF/regulatory element for a filter (from TomTom results).\\\") #This is particularly useful when we have lots of TF hits with fewer (1 or two) filters per TF. Using the top TF match will lead to fewer interactions.\\n parser.add_argument('--numlabels', dest='numLabels',type=int,\\n action='store',default = 2,\\n help=\\\"Number of labels. 2 for binary (default). For multi-class, multi label problem, can be more than 2. \\\")\\n parser.add_argument('--tomtomdist', dest='tomtomDist',type=str,\\n action='store',default = 'pearson',\\n help=\\\"TomTom distance parameter (pearson, kullback, ed etc). Default is pearson. See TomTom help from MEME suite.\\\")\\n parser.add_argument('--attrbatchsize', dest='attrBatchSize',type=int,\\n action='store',default = 12,\\n help=\\\"Batch size used while calculating attributes. Default is 12.\\\")\\n parser.add_argument('--tomtompval', dest='tomtomPval',type=float,\\n action='store',default = 0.05,\\n help=\\\"Adjusted p-value cutoff from TomTom. Default is 0.05.\\\")\\n parser.add_argument('--testall', dest='testAll',\\n action='store_true',default=False,\\n help=\\\"Test on the entire dataset (default False). Useful for interaction/motif analysis.\\\")\\n parser.add_argument('--useall', dest='useAll',\\n action='store_true',default=False,\\n help=\\\"Use all examples in multi-label problem. Default is False.\\\")\\n parser.add_argument('--precisionlimit', dest='precisionLimit',type=float,\\n action='store',default = 0.50,\\n help=\\\"Precision limit to use for selecting examples in case of multi-label problem.\\\")\\t\\t\\t\\t\\t\\n parser.add_argument('inputprefix', type=str,\\n help=\\\"Input file prefix for the bed/text file and the corresponding fasta file (sequences).\\\")\\n parser.add_argument('hparamfile',type=str,\\n help='Name of the hyperparameters file to be used.')\\n \\n \\n \\n args = parser.parse_args()\\n #if not validateArgs( args ):\\n # raise Exception(\\\"Argument Errors: check arguments and usage!\\\")\\n return args\",\n \"def analyzeCommandLineArguments(options):\\n print(options)\\n flag=0\\n if os.path.exists(options.output_directory)==False:\\n cmd=\\\"mkdir \\\"+options.output_directory\\n os.system(cmd)\\n else:\\n if options.force==0:\\n os.system(\\\"echo \\\\\\\"Output directory already exists. Please re-run the program with -f 1 to enforce rewrite of the directory \\\\\\\" >> \\\"+options.output_directory+\\\"/Log.out\\\")\\n flag=1\\n else:\\n cmd=\\\"rm -rf \\\"+options.output_directory\\n os.system(cmd)\\n cmd=\\\"mkdir \\\"+options.output_directory\\n os.system(cmd)\\n \\n cmd=\\\"touch \\\"+options.output_directory+\\\"/Log.out\\\"\\n os.system(cmd)\\n if options.bowtie_index == None:\\n os.system(\\\"echo \\\\\\\"No bowtie index provided. Proceeding to building index\\\\\\\" >> \\\"+options.output_directory+\\\"/Log.out\\\")\\n if os.path.exists(options.genome)==False:\\n os.system(\\\"echo \\\\\\\"The genome file you provided does not exist\\\\\\\" >> \\\"+options.output_directory+\\\"/Log.out\\\")\\n flag=1\\n if options.input_library==None:\\n os.system(\\\"echo \\\\\\\"The input file \\\"+options.input_library+\\\" does not exist\\\\\\\" >> \\\"+options.output_directory+\\\"/Log.out\\\")\\n flag=1\\n \\n if flag==1:\\n print(\\\"The program had to terminate prematurely....Please check \\\"+options.output_directory+\\\"/Log.out file for more details\\\")\\n sys.exit()\\n for ele in options.number_of_cycles:\\n if ele not in [\\\"9\\\",\\\"10\\\",\\\"11\\\",\\\"12\\\",\\\"13\\\"]:\\n os.system(\\\"echo \\\\\\\"Incorrect number of cycles have been entered. Valid choices are 9, 10, 11, 12 and 13 \\\\\\\" >> \\\"+options.output_directory+\\\"/Log.out\\\")\\n flag=1\\n \\n if options.input_library.split(\\\".\\\")[-1]==\\\"fq\\\" or options.input_library.split(\\\".\\\")[-1]==\\\"fastq\\\":\\n options.input_filename=options.output_directory+\\\"/\\\"+options.input_library.split(\\\"/\\\")[-1].split(\\\".\\\")[0]+\\\".fa\\\"\\n \\n options.input_path=\\\"/\\\".join(options.input_library.split(\\\"/\\\")[:-1])\\n options.input_filename=options.input_library.split(\\\"/\\\")[-1].split(\\\".\\\")[0]\\n options.consolidated_filename=options.output_directory+\\\"/\\\"+options.input_filename+\\\".consolidated.fasta\\\"\\n options.adapter_trimmed_filename=options.output_directory+\\\"/\\\"+options.input_filename+\\\"_adapter_trimmed.fastq\\\"\\n \\n options.small_rna_size=list(map(int,options.small_rna_size))\\n options.number_of_cycles=list(map(int,options.number_of_cycles))\\n options.pvalue_cutoff=float(options.pvalue_cutoff)\\n options.map_limit=int(options.map_limit)\\n return options\",\n \"def runSlaveRun():\\n\\n np.set_printoptions(linewidth=1000)\\n function = None\\n options = None\\n\\n # print(\\\"Process {}/{} reporting for duty!\\\".format(rank, size))\\n\\n function = comm.bcast(function, root=0)\\n arguments = comm.scatter(options, root=0)\\n\\n results = function(*arguments)\\n\\n comm.Barrier()\\n comm.gather(results, root=0)\\n comm.Disconnect()\",\n \"def prepare_runs(args):\\n output_directory = _prepare_output_dir(args.output_directory)\\n z_score_dir = args.z_score_dir\\n region_list = args.region_list \\n if args.region_list is None:\\n try:\\n flanking_region = int(args.flanking_region)\\n except ValueError:\\n logging.error('Flanking region argument needs to be an integer')\\n sys.exit(COMMAND_LINE_ERROR)\\n build = args.build\\n bed_directory = args.bed_directory\\n # Create the SNPList\\n try:\\n min_maf = float(args.maf)\\n except:\\n logging.error(\\\"Min Maf -m or --min-maf needs to be an floating point number\\\")\\n sys.exit(COMMAND_LINE_ERROR)\\n if args.region_list is not None:\\n region_list = {}\\n snp_list = []\\n with open(args.region_list) as input_file:\\n # When using no flaking region SNP must be valid, but it doesn't actually matter what it is, need to ensure that is actually the case.\\n for i, line in enumerate(input_file):\\n rsid = str(i)+ \\\"_\\\" + ''.join(line.strip().split(\\\"\\\\t\\\"))\\n chromosome = line.strip().split(\\\":\\\")[0] \\n snp = Snp(chromosome,\\\"1\\\",rsid)\\n snp_list.append(snp)\\n region_list[snp.rsid] = line.strip()\\n else:\\n snp_list = SnpList(args.snp_list, build)\\n logging.info(snp_list)\\n # Locus to process\\n # population_to_extract_vcf\\n if not args.annotation_only:\\n no_flanking = args.flanking_units\\n if no_flanking:\\n raise NotImplementedError(\\\"Using a number of flanking SNPs instead of a region is not supported\\\")\\n populations= args.populations.split(',')\\n logging.info(\\\"Populations to process: {0}\\\".format(populations))\\n loci = []\\n gemini_databases = []\\n output_vcfs = []\\n for snp in snp_list:\\n logging.info('Preparing output files for SNP {0}'.format(snp.rsid))\\n locus = snp.rsid\\n loci.append(locus)\\n logging.info(\\\"Obtaining VCF file from the 1000 genomes project\\\")\\n if region_list is not None:\\n vcf = get_vcf_file(snp, string_region=region_list[locus])\\n else: \\n vcf = get_vcf_file(snp, flanking_region=flanking_region)\\n for population in populations:\\n tmp_vcf = extract_population_from_1000_genomes(vcf=vcf, super_population=population)\\n z_score_file = get_relevant_zscore(snp.chrom, population, z_score_dir)\\n pos_list_zscore = create_pos_hash_table(z_score_file)\\n output_vcf = generate_zscore_and_vcf_output(output_directory=output_directory, zscore_hash=pos_list_zscore, vcf=tmp_vcf, locus=locus,population=population, multiply_rsquare=args.multiply_rsquare)\\n if bed_directory is None:\\n logging.info(\\\"Creating gemini database\\\")\\n # TODO: Fix broxen gemini referenec\\n gemini_databases.append(create_gemini_database(vcf=output_vcf))\\n vcf_to_plink(locus, output_directory=output_directory, vcf=output_vcf, population=population)\\n plink_to_ld_matrix(locus, output_directory=output_directory, population=population)\\n logging.info(\\\"Generate transancestrals matrices\\\")\\n generate_transancestral_output(loci, populations, output_directory)\\n if bed_directory is None:\\n logging.info(\\\"Generating annotation matrices to be used with Paintor\\\")\\n logging.info(gemini_databases)\\n generate_and_write_encode_annotations(databases=gemini_databases, output_directory=output_directory, loci=snp_list)\\n else:\\n logging.info(\\\"Annotation using bed files\\\")\\n generate_bed_file_annotations(loci=loci, bed_directory=bed_directory, output_directory=output_directory) \\n # So finally we need to fix the LD matrices for inputting into PAINTOR. \\n\\n with open(os.path.join(output_directory, 'input.files'), 'w') as out_f:\\n for snp in snp_list:\\n out_f.write(snp.rsid +'\\\\n')\\n # Remove .tbi files\\n for file in os.listdir('.'):\\n if fnmatch.fnmatch(file, '*.tbi'):\\n try:\\n os.remove(file)\\n except OSError:\\n logging.warning(\\\"Could not remove a .tbi file from the 1000 genomes tabix run\\\")\\n else: \\n loci = []\\n for snp in snp_list:\\n loci.append(snp.rsid)\\n if bed_directory is not None:\\n logging.info(\\\"Annotation using bed files\\\")\\n generate_bed_file_annotations(loci=loci, bed_directory=bed_directory, output_directory=output_directory) \\n logging.info(\\\"Finemapping file preparation complete\\\")\",\n \"def main(args):\\n if '-' in args['-p']:\\n tmp = args['-p'].split('-')\\n tgtPorts = [str(i) for i in xrange(int(tmp[0]), int(tmp[1])+1)]\\n else:\\n tgtPorts = [args['-p']]\\n tgtHost = args['-H']\\n for tgtPort in tgtPorts:\\n nmapScan(tgtHost, tgtPort)\",\n \"def launchJobs(options, cmdargs, errStream=sys.stdin):\\n\\n if options.queue == LOCAL:\\n launchLocalJobs(options,cmdargs,errStream)\\n return\\n\\n logging.debug(\\\"Launching task array: %r\\\" % ({'tmpDir':options.tmpDir,'splits':options.splits,'fragName':options.fragBase,'cmd':cmdargs,'sgeOpts':options.sgeOptions,'job':options.jobName,'priority':options.priority,'loglevel':options.verbose,'wait':options.wait, 'type':options.taskType}))\\n \\n # SGE or SLURM submission prefix\\n command = getSubmissionCommandPrefix(options)\\n\\n # batch_runner command\\n command.append(BATCHLAUNCHER)\\n command+=[\\\"--mode\\\",\\\"run\\\",\\\"--tmp_dir\\\",options.tmpDir,\\\"--frag_base\\\",\\n options.fragBase, \\\"--frag_dir\\\", options.frag_dir, \\\"--frag_suffix\\\", options.fragSuff, \\\"--loglevel\\\", str(options.verbose), \\\"--queue\\\", options.queue]\\n if options.inputFlag is not None:\\n command.append('-i=%s' % (options.inputFlag))\\n if options.prefixFlag is not None:\\n command.append('-p=%s' % (options.prefixFlag))\\n if options.threadsFlag is not None:\\n command+=['-t',str(options.threadsFlag)]\\n if options.outputFlags is not None:\\n for flag in options.outputFlags:\\n command.append('-o=%s' % (flag))\\n if options.taskType is not None:\\n command+=['--taskType',options.taskType]\\n if options.cwd:\\n command.append('--cwd')\\n command.append('--')\\n command+=cmdargs\\n\\n # redirect qsub output to std, silence if vebose is 0\\n #if options.verbose==0:\\n # qsubOuts=open(os.devnull,'w')\\n #else:\\n # qsubOuts=errStream\\n \\n # run command\\n logging.debug('Launching task array: %s' % (formatCommand(command)))\\n try:\\n submissionOutput = subprocess.check_output(command)\\n try:\\n submissionOutput = submissionOutput.decode()\\n except:\\n pass\\n if options.verbose>0:\\n errStream.write(\\\"Submission Output: \\\" + submissionOutput)\\n except subprocess.CalledProcessError as error:\\n if options.wait and options.queue != SLURM:\\n # when using -sync y, the exit code may come from a task\\n # (which cleanup will handle)\\n logging.warning(\\\"qsub returned an error code of: %d\\\" \\n % error.returncode)\\n else:\\n raise error\\n\\n # get job id\\n try:\\n jobid = re.search(r'(\\\\d+)\\\\s*$',submissionOutput).group(1)\\n options.jobid = jobid\\n except:\\n if options.queue==SLURM:\\n logging.error(\\\"Cannot parse SLURM job id from '%s'\\\" % (submissionOutput))\\n raise\\n\\n # SLURM doesn't allow waiting for completion on array jobs, so we hack:\\n # use srun to start a dummy job that will wait for our job array\\n if options.wait and options.queue==SLURM:\\n waitForSlurmArray(options, errStream)\",\n \"def parse_args():\\n\\n parser = argparse.ArgumentParser(\\n description='Assignment 1: Map directions.',\\n epilog = 'If SERIALPORT is not specified, stdin/stdout are used.')\\n parser.add_argument('-s', '--serial',\\n help='path to serial port',\\n dest='serialport',\\n default=None)\\n parser.add_argument('-v', dest='verbose',\\n help='verbose',\\n action='store_true')\\n parser.add_argument('-g', '--graph',\\n help='path to graph (DEFAULT = \\\" edmonton_roads.txt\\\")',\\n dest='graphname',\\n default='edmonton_roads.txt')\\n\\n return parser.parse_args()\",\n \"def _run_job(args):\\n # Note that we do not set the seed of the random number generator because\\n # we already modified the interaction matrix before calling this function\\n # and it does not harm us when all sub processes have the same sequence of\\n # random numbers.\\n \\n # create the object ...\\n obj = LibraryBinaryNumeric(**args[0])\\n # ... get the method to evaluate ...\\n method = getattr(obj, args[1])\\n # ... and evaluate it\\n if len(args) > 2:\\n return method(**args[2])\\n else:\\n return method()\",\n \"def ReadArguments():\\n\\n args = ParseArguments()\\n\\n logging.info('Command line arguments...')\\n for arg in vars(args):\\n logging.info(str(arg) + ': ' + str(getattr(args, arg)))\\n logging.info('')\\n\\n IsTest(args)\\n ProcessCacheSize(args)\\n ProcessLineSize(args)\\n ProcessMulti(args)\\n ProcessMemPattern(args)\\n ProcessMemFile(args)\",\n \"def run_overlay_resources_score_motifs(motif_sites_dir,\\n all_chromatin_makrs_all_cells_combined_dir_path,\\n motifs_overlapping_tracks_output_dir,\\n run_in_parallel_param,\\n number_processes_to_run_in_parallel,\\n normal_expression_per_tissue_origin_per_TF,\\n matching_tissue_to_cell,\\n motifTFName_TFNames_matches_dict,\\n cells_assays_dict,\\n cell_tfs,\\n tf_cells,\\n assay_cells_datatypes):\\n\\n # check if input motif_sites_dir is directory and get files from it\\n if os.path.exists(motif_sites_dir):\\n if not os.path.isdir(motif_sites_dir) and os.path.isfile(motif_sites_dir):\\n motif_files = [motif_sites_dir]\\n motif_sites_dir = \\\".\\\"\\n else:\\n motif_files = os.listdir(motif_sites_dir)\\n else:\\n sys.exit(\\\"Specified path to Motif files does not exist\\\")\\n\\n # get list of paths to all motif files\\n motif_files_full_path = [motif_sites_dir + '/' + s for s in motif_files]\\n\\n # get list of all files of combined tracks\\n chromatin_tracks_files = os.listdir(all_chromatin_makrs_all_cells_combined_dir_path)\\n\\n # create output directory if not existing\\n if not os.path.exists(motifs_overlapping_tracks_output_dir):\\n os.makedirs(motifs_overlapping_tracks_output_dir)\\n\\n # compute overlay resources score motif to find overlapping structures\\n # Debug: print(run_in_parallel_param, motif_files)\\n if run_in_parallel_param and len(motif_files) > 1:\\n print(\\\"Run overlay_resources_score_motifs in parallel\\\")\\n p = Pool(int(number_processes_to_run_in_parallel))\\n motifs_overlapping_tracks_files = p.starmap(overlay_resources_score_motifs, product(motif_files_full_path,\\n [\\n motifs_overlapping_tracks_output_dir],\\n [\\n all_chromatin_makrs_all_cells_combined_dir_path],\\n [chromatin_tracks_files]))\\n p.close()\\n p.join()\\n else:\\n print(\\\"Do not run overlay_resources_score_motifs in parallel\\\")\\n motifs_overlapping_tracks_files = []\\n for i in motif_files_full_path:\\n if os.path.exists(i):\\n motifs_overlapping_tracks_file = overlay_resources_score_motifs(i,\\n motifs_overlapping_tracks_output_dir,\\n all_chromatin_makrs_all_cells_combined_dir_path,\\n chromatin_tracks_files)\\n motifs_overlapping_tracks_files.append(motifs_overlapping_tracks_file)\\n else:\\n print(\\\"Motif file \\\" + i + \\\"cannot be found and will be ignored.\\\")\\n\\n print(\\\"Finished overlay_resources_score_motifs\\\")\\n scored_motifs_overlapping_tracks_files = []\\n for motifs_overlapping_tracks_file in motifs_overlapping_tracks_files:\\n if motifs_overlapping_tracks_file is None:\\n continue\\n scored_motifs_chromatin_tracks_output_file = '.'.join(\\n motifs_overlapping_tracks_file.split('.')[0:-1]) + '_scored.bed10'\\n # create or overwrite scored motif (chromatin-wise) files\\n if not os.path.exists(scored_motifs_chromatin_tracks_output_file): # score each motif-track_overlapping file\\n print(\\\"computing scores to: \\\" + scored_motifs_chromatin_tracks_output_file)\\n # TODO: control change below\\n index_track_names = 7\\n index_motif_name = 3\\n with open(scored_motifs_chromatin_tracks_output_file, 'w') as scored_motifs_writefile:\\n header_line = ['posrange', 'chr', 'motifstart', 'motifend', 'name', 'score', 'pval', 'strand']\\n for cell in sorted(cells_assays_dict.keys()):\\n for assay in sorted(cells_assays_dict[cell].keys()):\\n if cell[0].isdigit():\\n cell = 'a' + cell\\n\\n cell_name = '_'.join(((cell + \\\"___\\\" + assay).replace('(', '').replace(')', '')\\n .replace('-', '__').replace('.', '').replace(\\\"'\\\", \\\"\\\")).split())\\n header_line.append('\\\"' + cell_name + '\\\"')\\n scored_motifs_writefile.write('\\\\t'.join(header_line) + '\\\\n')\\n\\n # TODO: end previous for loop here, call Rust function, input all files --> minimize switching between them\\n # score motifs\\n if (run_in_parallel_param):\\n print(\\\"Run score_motifs per cell in parallel\\\")\\n os.system(\\\"\\\"\\\"split -l 200000 {} {}\\\"\\\"\\\".format(motifs_overlapping_tracks_file,\\n motifs_overlapping_tracks_file + '_tmp'))\\n motifs_overlapping_tracks_file_splitted = glob.glob(motifs_overlapping_tracks_file + '_tmp*')\\n p = Pool(int(number_processes_to_run_in_parallel))\\n p.starmap(score_motifs_per_cell, product(motifs_overlapping_tracks_file_splitted,\\n [normal_expression_per_tissue_origin_per_TF],\\n [matching_tissue_to_cell],\\n [motifTFName_TFNames_matches_dict],\\n [cells_assays_dict],\\n [cell_tfs],\\n [tf_cells],\\n [assay_cells_datatypes],\\n [index_track_names],\\n [index_motif_name]))\\n p.close()\\n p.join()\\n\\n # remove tmp split files\\n with open(scored_motifs_chromatin_tracks_output_file, 'a') as scored_motifs_writefile:\\n for f in motifs_overlapping_tracks_file_splitted:\\n with open(f + '_scored', 'r') as f_score_ifile:\\n l = f_score_ifile.readline()\\n while l:\\n scored_motifs_writefile.write(l)\\n l = f_score_ifile.readline()\\n\\n f_score_ifile.close()\\n os.remove(f)\\n os.remove(f + '_scored')\\n scored_motifs_writefile.close()\\n else:\\n print(\\\"Do not run score_motifs per cell in parallel\\\")\\n scored_file_tmp = score_motifs_per_cell(motifs_overlapping_tracks_file,\\n normal_expression_per_tissue_origin_per_TF,\\n matching_tissue_to_cell,\\n motifTFName_TFNames_matches_dict,\\n cells_assays_dict,\\n cell_tfs,\\n tf_cells,\\n assay_cells_datatypes,\\n index_track_names,\\n index_motif_name)\\n # write scores into scored file with header\\n with open(scored_file_tmp, 'r') as infile, \\\\\\n open(scored_motifs_chromatin_tracks_output_file, 'a') as outfile:\\n outfile.write(infile.read())\\n\\n scored_motifs_overlapping_tracks_files.append(scored_motifs_chromatin_tracks_output_file)\\n print(\\\"Finished run_overlay_resources_score_motifs\\\")\\n return motifs_overlapping_tracks_files, scored_motifs_overlapping_tracks_files\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.64769953","0.62038994","0.57405895","0.554428","0.55252844","0.551435","0.55140823","0.55098575","0.54549307","0.5444846","0.54388684","0.54316586","0.5404963","0.53763914","0.5359437","0.5330171","0.5305152","0.53005004","0.53004366","0.5288501","0.5277907","0.5273782","0.5257273","0.5246049","0.52365404","0.52344126","0.5232616","0.52227193","0.52207667","0.52179265","0.5213977","0.5201716","0.51995957","0.5199537","0.5193075","0.51912445","0.5182842","0.5182086","0.51818806","0.51769966","0.51638764","0.51467633","0.5146361","0.5132422","0.51307225","0.511958","0.51034445","0.5095793","0.50772095","0.50756836","0.5072251","0.5071752","0.5064928","0.50619835","0.50588524","0.50558925","0.50369525","0.5035158","0.50324917","0.502804","0.50243616","0.5024271","0.50228816","0.500136","0.4992842","0.49835673","0.49820736","0.49819568","0.49788612","0.49778017","0.49711415","0.49690938","0.49648342","0.49579063","0.49542892","0.49518484","0.49478006","0.4945823","0.49454084","0.49359623","0.49357408","0.49282688","0.49263397","0.4922911","0.4922229","0.49207088","0.4915766","0.49147552","0.4914072","0.4911449","0.49093324","0.4907796","0.4901998","0.4899626","0.48919755","0.48900905","0.48865324","0.4875646","0.48731452","0.487209"],"string":"[\n \"0.64769953\",\n \"0.62038994\",\n \"0.57405895\",\n \"0.554428\",\n \"0.55252844\",\n \"0.551435\",\n \"0.55140823\",\n \"0.55098575\",\n \"0.54549307\",\n \"0.5444846\",\n \"0.54388684\",\n \"0.54316586\",\n \"0.5404963\",\n \"0.53763914\",\n \"0.5359437\",\n \"0.5330171\",\n \"0.5305152\",\n \"0.53005004\",\n \"0.53004366\",\n \"0.5288501\",\n \"0.5277907\",\n \"0.5273782\",\n \"0.5257273\",\n \"0.5246049\",\n \"0.52365404\",\n \"0.52344126\",\n \"0.5232616\",\n \"0.52227193\",\n \"0.52207667\",\n \"0.52179265\",\n \"0.5213977\",\n \"0.5201716\",\n \"0.51995957\",\n \"0.5199537\",\n \"0.5193075\",\n \"0.51912445\",\n \"0.5182842\",\n \"0.5182086\",\n \"0.51818806\",\n \"0.51769966\",\n \"0.51638764\",\n \"0.51467633\",\n \"0.5146361\",\n \"0.5132422\",\n \"0.51307225\",\n \"0.511958\",\n \"0.51034445\",\n \"0.5095793\",\n \"0.50772095\",\n \"0.50756836\",\n \"0.5072251\",\n \"0.5071752\",\n \"0.5064928\",\n \"0.50619835\",\n \"0.50588524\",\n \"0.50558925\",\n \"0.50369525\",\n \"0.5035158\",\n \"0.50324917\",\n \"0.502804\",\n \"0.50243616\",\n \"0.5024271\",\n \"0.50228816\",\n \"0.500136\",\n \"0.4992842\",\n \"0.49835673\",\n \"0.49820736\",\n \"0.49819568\",\n \"0.49788612\",\n \"0.49778017\",\n \"0.49711415\",\n \"0.49690938\",\n \"0.49648342\",\n \"0.49579063\",\n \"0.49542892\",\n \"0.49518484\",\n \"0.49478006\",\n \"0.4945823\",\n \"0.49454084\",\n \"0.49359623\",\n \"0.49357408\",\n \"0.49282688\",\n \"0.49263397\",\n \"0.4922911\",\n \"0.4922229\",\n \"0.49207088\",\n \"0.4915766\",\n \"0.49147552\",\n \"0.4914072\",\n \"0.4911449\",\n \"0.49093324\",\n \"0.4907796\",\n \"0.4901998\",\n \"0.4899626\",\n \"0.48919755\",\n \"0.48900905\",\n \"0.48865324\",\n \"0.4875646\",\n \"0.48731452\",\n \"0.487209\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.68828976"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94761,"cells":{"query":{"kind":"string","value":"Expand various colors to RRGGBB."},"document":{"kind":"string","value":"def expand_color(color, default=None, passthrough=False, block=None):\n if color:\n if color[0] == \"#\":\n color = color[1:]\n try:\n int(color, 16)\n except ValueError:\n return block\n length = len(color)\n if length in [3, 4]:\n color = \"\".join(color[x] * 2 for x in range(length))\n elif length not in [6, 8]:\n return block\n return \"#\" + color.upper()\n elif block:\n return block\n return COLOR_NAMES.get(color, color if passthrough else default)"},"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 color_rgb(r,g,b):\n return \"#%02x%02x%02x\" % (r,g,b)","def color_rgb(r,g,b):\n return \"#%02x%02x%02x\" % (r,g,b)","def color_rgb(r,g,b):\n return \"#%02x%02x%02x\" % (r,g,b)","def combine_color(red, green, blue):\r\n\r\n return (red << 16) + (green << 8) + blue","def rgb(r, g, b):\n return \"\".join([\"%02X\" % max(0, min(x, 255)) for x in [r, g, b]])","def rgb(r, g, b, alpha=1.0):\n global _cmds\n _cmds = (f\"color([{r/255},{g/255},\"\n f\"{b/255},{alpha}])\\n\") + _cmds","def setColorRGB(r,g,b):\n r, g, b = r/255., g/255., b/255.\n dislin.setrgb(r,g,b)","def RGB_to_fill(R, G, B):\n\n # based on https://stackoverflow.com/q/30484220\n\n return PatternFill(\n start_color=RGB_to_HEX(R, G, B),\n end_color=RGB_to_HEX(R, G, B),\n fill_type='solid'\n )","def get_rgb(self, r,g,b):\n return \"#%02x%02x%02x\" % (r,g,b)","def Color(red, green, blue, white = 0):\n\treturn (white << 24) | (red << 16)| (green << 8) | blue","def Color(red, green, blue, white = 0):\n return (white << 24) | (red << 16)| (green << 8) | blue","def _color565(self, r, g, b):\n return (((r & 0xF8) << 8) | ((g & 0xFC) << 3) | (b >> 3))","def get_color_in_rgb_decimal():\n\n # Grabbing custom colormap from matplotlib\n a = cm.get_cmap('cool', 32)\n b = cm.get_cmap('spring', 32)\n c = cm.get_cmap('autumn_r', 64)\n d = cm.get_cmap('bwr_r', 192)\n e = cm.get_cmap('Greens', 192)\n\n # Adding the colormaps into one stack to have a more comprehensive color spectrum \n newcolors = np.vstack((a(np.linspace(0, 1, 32)), \n b(np.linspace(0, 1, 32)), \n c(np.linspace(0, 1, 64)),\n d(np.linspace(0, 0.5, 192)),\n e(np.linspace(0, 1, 192)),\n ))\n return newcolors","def setColors(self):\n #productive\n profprint()\n self.color= [[0,0,0] for i in range(205)]\n self.color255= self.setColors255()\n for i in range(205):\n for j in range(3):\n self.color[i][j] = self.color255[i][j]/float(255)\n\n return self.color","def set_color_rgb(r, g, b):\r\n global _current_color\r\n _current_color = (r, g, b)","def fromInts(r, g, b):\n return IColor(r/255.,g/255.,b/255.)","def setColors(self):\r\n # productive\r\n profprint()\r\n self.color = [[0, 0, 0] for i in range(MAXCOL)]\r\n self.color255 = self.setColors255()\r\n for i in range(MAXCOL):\r\n for j in range(3):\r\n self.color[i][j] = self.color255[i][j] / float(255)\r\n\r\n return self.color","def multiply_rgb(color, alter):\n rgb = color[1:]\n chunks, chunk_size = len(rgb), len(rgb)/3\n r, g, b = [ int(int('0x%s' % rgb[i:i+chunk_size], 0) * alter) for i in range(0, chunks, chunk_size) ]\n return '#%.2x%.2x%.2x' % (r, g, b)","def convert_to_RGB_255(colors):\n return (colors[0]*255.0, colors[1]*255.0, colors[2]*255.0)","def merge_color(rate):\n if rate < 15:\n return 'r'\n if rate < 30:\n return 'y'\n return 'g'","def _to_color(indx, base):\n base2 = base * base\n b = 2 - indx / base2\n r = 2 - (indx % base2) / base\n g = 2 - (indx % base2) % base\n return b * 127, r * 127, g * 127","def color565(red, green=0, blue=0):\n try:\n red, green, blue = red # see if the first var is a tuple/list\n except TypeError:\n pass\n return (red & 0xf8) << 8 | (green & 0xfc) << 3 | blue >> 3","def reduceColorRGB(channels,levels):\n data = (levels[2]*levels[1]*reduceColor(channels[0],levels[0])+\n levels[2]*reduceColor(channels[1],levels[1])+\n reduceColor(channels[2],levels[2])).astype(numpy.uint8)\n return data","def color565(r, g=0, b=0):\n try:\n r, g, b = r # see if the first var is a tuple/list\n except TypeError:\n pass\n return (r & 0xf8) << 8 | (g & 0xfc) << 3 | b >> 3","def change_color():\n return random.randint(0, 255), random.randint(0, 255), random.randint(0, 255)","def set_rgb(self, r=0, g=0, b=0, calibrate=True):\n r = self.set_red(r)\n g = self.set_green(g)\n b = self.set_blue(b)\n return (r,g,b)","def _get_color(self, r, g, b):\n clr = (r, g, b)\n return clr","def get_xterm_color(r, g, b):\n rr = round_tint(r)\n rg = round_tint(g)\n rb = round_tint(b)\n\n return 16 + rr * 36 + rg * 6 + rb","def Red(*args, **kwargs):\n return _gdi_.Colour_Red(*args, **kwargs)","def set_rgb_color(r, g, b, a=1.0):\n glColor4fv(get_rgb_normalized(r, g, b, a))","def colorize(self):\n return","def _pack_rgb_values(r, g, b):\n if isinstance(r, np.ndarray):\n r = r.astype(np.int)\n rgb = r << 8\n rgb |= g\n rgb = rgb << 8\n rgb |= b\n return rgb","def rgbString(red,green,blue):\n return chr(red)+chr(green)+chr(blue)","def ramp_color_rgb(values, feature, parent): \r\n ramp_name = values[0]\r\n ramp_position = values[1]\r\n \r\n ramp = QgsStyleV2.defaultStyle().colorRampRef(ramp_name)\r\n if not ramp:\r\n parent.setEvalErrorString( QObject.tr( '\"{}\" is not a valid color ramp'.format(ramp_name)))\r\n return QColor(0,0,0).name()\r\n \r\n value, error = getFloat(ramp_position)\r\n if error:\r\n parent.setEvalErrorString(error)\r\n \r\n color = ramp.color(value)\r\n return \"{},{},{}\".format(color.red(), color.green(), color.blue())","def colorize(image, newColor):\n image = image.copy()\n\n # zero out RGB values\n image.fill((0, 0, 0, 255), None, pg.BLEND_RGBA_MULT)\n # add in new RGB values\n image.fill(newColor[0:3] + (0,), None, pg.BLEND_RGBA_ADD)\n\n return image","def update_r(color, new_r):\n\n color.update_r(new_r)","def rainbow_example(rounds=1, delay_secs=0.01):\n set_color('black') # Start with all LED's \"off\"\n update()\n\n saturation = 100 # 0 (grayer) to 100 (full color)\n brightness = 100 # 0 (darker) to 100 (brighter)\n\n for i in range(0, rounds):\n for hue in tuple(range(0, 360)) + tuple(range(360, -1, -1)): # 0..360..0\n color_str = \"hsb({}, {}%, {}%)\".format(hue, saturation, brightness)\n push_color(color_str)\n update()\n sleep(delay_secs)","def colors(self):\n\t\treturn [(0, 30, 255),(0, 30, 120)]","def generate_normalized_rgb(self):\n \n r,g,b=(Numeric.zeros(256),Numeric.zeros(256),Numeric.zeros(256))\n for i in Numeric.arange(256):\n r_,g_,b_=self.colfct(i/255.0) # these are from [0,1]\n r[i],g[i],b[i]=int(255*r_),int(255*g_),int(255*b_)\n return r/256.0,g/256.0,b/256.0","def _style_colours(self):\n\n pass","def rgb(r, g, b):\n return (r/255, g/255, b/255)","def get_rgb(self):\n\n return \"#%02X%02X%02X\" % (self.r, self.g, self.b)","def modify_color(color, sigma):\n\t# get values of individual colors, convert to hex integers, and modify\n\tred, green, blue = (vary(int(color[i:i+2], 16), sigma) for i in (1, 3, 5))\n\t# return combined hex representation of new color values\n\treturn '#%02X%02X%02X' % (red, green, blue)","def setColors255(self):\r\n # productive\r\n profprint()\r\n self.color255 = [[0, 0, 0] for i in range(MAXCOL)]\r\n self.color255[0] = [221, 108, 158]\r\n self.color255[1] = [128, 174, 128]\r\n self.color255[2] = [241, 214, 145]\r\n self.color255[3] = [177, 122, 101]\r\n self.color255[4] = [111, 184, 210]\r\n self.color255[5] = [216, 101, 79]\r\n self.color255[6] = [221, 130, 101]\r\n self.color255[7] = [144, 238, 144]\r\n self.color255[8] = [192, 104, 88]\r\n self.color255[9] = [220, 245, 20]\r\n self.color255[10] = [78, 63, 0]\r\n self.color255[11] = [255, 250, 220]\r\n self.color255[12] = [230, 220, 70]\r\n self.color255[13] = [200, 200, 235]\r\n self.color255[14] = [250, 250, 210]\r\n self.color255[15] = [244, 214, 49]\r\n self.color255[16] = [0, 151, 206]\r\n self.color255[17] = [183, 156, 220]\r\n self.color255[18] = [183, 214, 211]\r\n self.color255[19] = [152, 189, 207]\r\n self.color255[20] = [178, 212, 242]\r\n self.color255[21] = [68, 172, 100]\r\n self.color255[22] = [111, 197, 131]\r\n self.color255[23] = [85, 188, 255]\r\n self.color255[24] = [0, 145, 30]\r\n self.color255[25] = [214, 230, 130]\r\n self.color255[26] = [218, 255, 255]\r\n self.color255[27] = [170, 250, 250]\r\n self.color255[28] = [140, 224, 228]\r\n self.color255[29] = [188, 65, 28]\r\n self.color255[30] = [216, 191, 216]\r\n self.color255[31] = [145, 60, 66]\r\n self.color255[32] = [150, 98, 83]\r\n self.color255[33] = [250, 250, 225]\r\n self.color255[34] = [200, 200, 215]\r\n self.color255[35] = [68, 131, 98]\r\n self.color255[36] = [83, 146, 164]\r\n self.color255[37] = [162, 115, 105]\r\n self.color255[38] = [141, 93, 137]\r\n self.color255[39] = [182, 166, 110]\r\n self.color255[40] = [188, 135, 166]\r\n self.color255[41] = [154, 150, 201]\r\n self.color255[42] = [177, 140, 190]\r\n self.color255[43] = [30, 111, 85]\r\n self.color255[44] = [210, 157, 166]\r\n self.color255[45] = [48, 129, 126]\r\n self.color255[46] = [98, 153, 112]\r\n self.color255[47] = [69, 110, 53]\r\n self.color255[48] = [166, 113, 137]\r\n self.color255[49] = [122, 101, 38]\r\n self.color255[50] = [253, 135, 192]\r\n self.color255[51] = [145, 92, 109]\r\n self.color255[52] = [46, 101, 131]\r\n self.color255[53] = [0, 108, 112]\r\n self.color255[54] = [127, 150, 88]\r\n self.color255[55] = [159, 116, 163]\r\n self.color255[56] = [125, 102, 154]\r\n self.color255[57] = [106, 174, 155]\r\n self.color255[58] = [154, 146, 83]\r\n self.color255[59] = [126, 126, 55]\r\n self.color255[60] = [201, 160, 133]\r\n self.color255[61] = [78, 152, 141]\r\n self.color255[62] = [174, 140, 103]\r\n self.color255[63] = [139, 126, 177]\r\n self.color255[64] = [148, 120, 72]\r\n self.color255[65] = [186, 135, 135]\r\n self.color255[66] = [99, 106, 24]\r\n self.color255[67] = [156, 171, 108]\r\n self.color255[68] = [64, 123, 147]\r\n self.color255[69] = [138, 95, 74]\r\n self.color255[70] = [97, 113, 158]\r\n self.color255[71] = [126, 161, 197]\r\n self.color255[72] = [194, 195, 164]\r\n self.color255[73] = [88, 106, 215]\r\n self.color255[74] = [82, 174, 128]\r\n self.color255[75] = [57, 157, 110]\r\n self.color255[76] = [60, 143, 83]\r\n self.color255[77] = [92, 162, 109]\r\n self.color255[78] = [255, 244, 209]\r\n self.color255[79] = [201, 121, 77]\r\n self.color255[80] = [70, 163, 117]\r\n self.color255[81] = [188, 91, 95]\r\n self.color255[82] = [166, 84, 94]\r\n self.color255[83] = [182, 105, 107]\r\n self.color255[84] = [229, 147, 118]\r\n self.color255[85] = [174, 122, 90]\r\n self.color255[86] = [201, 112, 73]\r\n self.color255[87] = [194, 142, 0]\r\n self.color255[88] = [241, 213, 144]\r\n self.color255[89] = [203, 179, 77]\r\n self.color255[90] = [229, 204, 109]\r\n self.color255[91] = [255, 243, 152]\r\n self.color255[92] = [209, 185, 85]\r\n self.color255[93] = [248, 223, 131]\r\n self.color255[94] = [255, 230, 138]\r\n self.color255[95] = [196, 172, 68]\r\n self.color255[96] = [255, 255, 167]\r\n self.color255[97] = [255, 250, 160]\r\n self.color255[98] = [255, 237, 145]\r\n self.color255[99] = [242, 217, 123]\r\n self.color255[100] = [222, 198, 101]\r\n self.color255[101] = [213, 124, 109]\r\n self.color255[102] = [184, 105, 108]\r\n self.color255[103] = [150, 208, 243]\r\n self.color255[104] = [62, 162, 114]\r\n self.color255[105] = [242, 206, 142]\r\n self.color255[106] = [250, 210, 139]\r\n self.color255[107] = [255, 255, 207]\r\n self.color255[108] = [182, 228, 255]\r\n self.color255[109] = [175, 216, 244]\r\n self.color255[110] = [197, 165, 145]\r\n self.color255[111] = [172, 138, 115]\r\n self.color255[112] = [202, 164, 140]\r\n self.color255[113] = [224, 186, 162]\r\n self.color255[114] = [255, 245, 217]\r\n self.color255[115] = [206, 110, 84]\r\n self.color255[116] = [210, 115, 89]\r\n self.color255[117] = [203, 108, 81]\r\n self.color255[118] = [233, 138, 112]\r\n self.color255[119] = [195, 100, 73]\r\n self.color255[120] = [181, 85, 57]\r\n self.color255[121] = [152, 55, 13]\r\n self.color255[122] = [159, 63, 27]\r\n self.color255[123] = [166, 70, 38]\r\n self.color255[124] = [218, 123, 97]\r\n self.color255[125] = [225, 130, 104]\r\n self.color255[126] = [224, 97, 76]\r\n self.color255[127] = [184, 122, 154]\r\n self.color255[128] = [211, 171, 143]\r\n self.color255[129] = [47, 150, 103]\r\n self.color255[130] = [173, 121, 88]\r\n self.color255[131] = [188, 95, 76]\r\n self.color255[132] = [255, 239, 172]\r\n self.color255[133] = [226, 202, 134]\r\n self.color255[134] = [253, 232, 158]\r\n self.color255[135] = [244, 217, 154]\r\n self.color255[136] = [205, 179, 108]\r\n self.color255[137] = [186, 124, 161]\r\n self.color255[138] = [255, 255, 220]\r\n self.color255[139] = [234, 234, 194]\r\n self.color255[140] = [204, 142, 178]\r\n self.color255[141] = [180, 119, 153]\r\n self.color255[142] = [216, 132, 105]\r\n self.color255[143] = [255, 253, 229]\r\n self.color255[144] = [205, 167, 142]\r\n self.color255[145] = [204, 168, 143]\r\n self.color255[146] = [255, 224, 199]\r\n self.color255[147] = [139, 150, 98]\r\n self.color255[148] = [249, 180, 111]\r\n self.color255[149] = [157, 108, 162]\r\n self.color255[150] = [203, 136, 116]\r\n self.color255[151] = [185, 102, 83]\r\n self.color255[152] = [247, 182, 164]\r\n self.color255[153] = [222, 154, 132]\r\n self.color255[154] = [124, 186, 223]\r\n self.color255[155] = [249, 186, 150]\r\n self.color255[156] = [244, 170, 147]\r\n self.color255[157] = [255, 181, 158]\r\n self.color255[158] = [255, 190, 165]\r\n self.color255[159] = [227, 153, 130]\r\n self.color255[160] = [213, 141, 113]\r\n self.color255[161] = [193, 123, 103]\r\n self.color255[162] = [216, 146, 127]\r\n self.color255[163] = [230, 158, 140]\r\n self.color255[164] = [245, 172, 147]\r\n self.color255[165] = [241, 172, 151]\r\n self.color255[166] = [177, 124, 92]\r\n self.color255[167] = [171, 85, 68]\r\n self.color255[168] = [217, 198, 131]\r\n self.color255[169] = [212, 188, 102]\r\n self.color255[170] = [185, 135, 134]\r\n self.color255[171] = [198, 175, 125]\r\n self.color255[172] = [194, 98, 79]\r\n self.color255[173] = [255, 238, 170]\r\n self.color255[174] = [206, 111, 93]\r\n self.color255[175] = [216, 186, 0]\r\n self.color255[176] = [255, 226, 77]\r\n self.color255[177] = [255, 243, 106]\r\n self.color255[178] = [255, 234, 92]\r\n self.color255[179] = [240, 210, 35]\r\n self.color255[180] = [224, 194, 0]\r\n self.color255[181] = [213, 99, 79]\r\n self.color255[182] = [217, 102, 81]\r\n self.color255[183] = [0, 147, 202]\r\n self.color255[184] = [0, 122, 171]\r\n self.color255[185] = [186, 77, 64]\r\n self.color255[186] = [240, 255, 30]\r\n self.color255[187] = [185, 232, 61]\r\n self.color255[188] = [0, 226, 255]\r\n self.color255[189] = [251, 159, 255]\r\n self.color255[190] = [230, 169, 29]\r\n self.color255[191] = [0, 194, 113]\r\n self.color255[192] = [104, 160, 249]\r\n self.color255[193] = [221, 108, 158]\r\n self.color255[194] = [137, 142, 0]\r\n self.color255[195] = [230, 70, 0]\r\n self.color255[196] = [0, 147, 0]\r\n self.color255[197] = [0, 147, 248]\r\n self.color255[198] = [231, 0, 206]\r\n self.color255[199] = [129, 78, 0]\r\n self.color255[200] = [0, 116, 0]\r\n self.color255[201] = [0, 0, 255]\r\n self.color255[202] = [157, 0, 0]\r\n self.color255[203] = [100, 100, 130]\r\n self.color255[204] = [205, 205, 100]\r\n self.color255[205] = [255, 255, 0]\r\n\r\n return self.color255","def recolorRC(src,dst):\n b,g,r=cv2.split(src)\n cv2.addWeighted(b,0.5,g,0.5,0,b) #arguements(in order):first src array,a weight applied\n # to array, scnd src array, a weight applied to array\n # a constant added to the result and a destination array\n cv2.merge((b,b,r),dest) #replace b and g with modified b(which has both and g)","def rgb_to_ansi256(r, g, b):\n if r == g and g == b:\n if r < 8:\n return 16\n if r > 248:\n return 231\n\n return round(((r - 8) / 247.0) * 24) + 232\n\n ansi_r = 36 * round(r / 255.0 * 5.0)\n ansi_g = 6 * round(g / 255.0 * 5.0)\n ansi_b = round(b / 255.0 * 5.0)\n ansi = 16 + ansi_r + ansi_g + ansi_b\n return ansi","def to_color(self):\n return (int(self.r * 255), int(self.g * 255), int(self.b * 255))","def resetColor(self):\n self.setColor(255, 255, 255 ,255)","def addColors(*colorMultPairs):\n netRGB = [0, 0, 0]\n for color, mult in colorMultPairs:\n colorRGB = _getTkWdg().winfo_rgb(color)\n netRGB = [netRGB[ii] + (mult * colorRGB[ii]) for ii in range(3)]\n truncRGB = [max(min(int(val), 0xFFFF), 0) for val in netRGB]\n retColor = \"#%04x%04x%04x\" % tuple(truncRGB)\n #print \"mixColors(%r); netRGB=%s; truncRGB=%s; retColor=%r\" % (colorMultPairs, netRGB, truncRGB, retColor)\n return retColor","def fill(self, color):","def fill(self, colour: int, /) -> None:","def colors_to_string(colors):\n return ''.join(['%02x%02x%02x' % (r,g,b) for r,g,b in colors])","def rgbcolor(h, f):\n # q = 1 - f\n # t = f\n if h == 0:\n return v, f, p\n elif h == 1:\n return 1 - f, v, p\n elif h == 2:\n return p, v, f\n elif h == 3:\n return p, 1 - f, v\n elif h == 4:\n return f, p, v\n elif h == 5:\n return v, p, 1 - f","def packl(self):\n a = 255\n r = IColor.scaleClipl(self.r)\n g = IColor.scaleClipl(self.g)\n b = IColor.scaleClipl(self.b)\n return (a << 24) | (r << 16) | (g << 8) | (b)","def label_rgb(colors):\n return ('rgb(%s, %s, %s)' % (colors[0], colors[1], colors[2]))","def setRgb ( self, r, g = 0.0, b = 0.0 ):\n self.setRgba( r, g, b )","def IntermediateColor(startcol, targetcol, frac):\n if frac < 0:\n frac = 0\n if frac >= 1.0:\n frac = 1.0\n sc = MakeColorTuple(startcol)\n tc = MakeColorTuple(targetcol)\n dR = tc[0] - sc[0]\n dG = tc[1] - sc[1]\n dB = tc[2] - sc[2]\n R = sc[0] + dR * frac\n G = sc[1] + dG * frac\n B = sc[2] + dB * frac\n return \"#%02x%02x%02x\" % (R, G, B)","def __fill_color(self, uol_c, uil_c, lol_c, lil_c):\n self.__fill_lip_lines(uol_c, uil_c)\n self.__fill_lip_lines(lol_c, lil_c)\n self.__add_color(1)\n self.__fill_lip_solid(uol_c, uil_c)\n self.__fill_lip_solid(lol_c, lil_c)\n self.__smoothen_color(uol_c, uil_c)\n self.__smoothen_color(lol_c, lil_c)","def color(step: int=10) -> Tuple[int, int, int]:\n # Randomly seed the r g b values\n r, g, b = (random_uniform(0, 255), random_uniform(0, 255),\n random_uniform(0, 255))\n\n # Randomly determine if each r g and b value is increasing or not\n r_inc = True\n g_inc = True\n b_inc = True\n r_step = random_uniform(step)\n g_step = random_uniform(step)\n b_step = random_uniform(step)\n\n # Yield the initial r, g, b values\n yield r, g, b\n\n # Loop and yeild forever\n while True:\n # If r is increasing\n if r_inc:\n # Increment r by the step\n r += r_step\n # Ensure that the next step will be within the limits\n # if not then set the flag to decreasing\n r_inc = r < 255 - r_step\n # If r is decreasing\n else:\n # Decrement r by the step\n r -= r_step\n # Ensure that the next step will be within the limits\n # if not then set the flag to increasing\n r_inc = r < r_step\n\n # See above\n if g_inc:\n g += g_step\n g_inc = g < 255 - g_step\n else:\n g -= g_step\n g_inc = g < g_step\n\n # See above\n if b_inc:\n b += b_step\n b_inc = b < 255 - b_step\n else:\n b -= b_step\n b_inc = b < b_step\n\n # Yield the red, green, and blue values\n yield r, g, b","def unconvert_from_RGB_255(colors):\n un_rgb_color = (colors[0]/(255.0),\n colors[1]/(255.0),\n colors[2]/(255.0))\n\n return un_rgb_color","def rgb_to_ansi16(r, g, b, use_bright=False):\n ansi_b = round(b / 255.0) << 2\n ansi_g = round(g / 255.0) << 1\n ansi_r = round(r / 255.0)\n ansi = (90 if use_bright else 30) + (ansi_b | ansi_g | ansi_r)\n\n return ansi","def change_color(mutated_genome):\n index = random.randint(0,max(0,len(mutated_genome)-1))\n if color_mode == 'RGB':\n color_red = random.randint(-25,25)\n color_green = random.randint(-25,25)\n color_blue = random.randint(-25,25)\n color = mutated_genome[index][0]\n newcolor = (color[0]+color_red,color[1]+color_green,color[2]+color_blue)\n else: #color_mode == 'L':\n color_diff = random.randint(-25,25)\n color = mutated_genome[index][0]\n newcolor = color+color_diff\n mutated_genome[index][0] = newcolor","def setColors255(self):\n #productive\n profprint()\n self.color255= [[0,0,0] for i in range(205)]\n self.color255[0]=[221,108,158]\n self.color255[1]=[128,174,128]\n self.color255[2]=[241,214,145]\n self.color255[3]=[177,122,101]\n self.color255[4]=[111,184,210]\n self.color255[5]=[216,101,79]\n self.color255[6]=[221,130,101]\n self.color255[7]=[144,238,144]\n self.color255[8]=[192,104,88]\n self.color255[9]=[220,245,20]\n self.color255[10]=[78,63,0]\n self.color255[11]=[255,250,220]\n self.color255[12]=[230,220,70]\n self.color255[13]=[200,200,235]\n self.color255[14]=[250,250,210]\n self.color255[15]=[244,214,49]\n self.color255[16]=[0,151,206]\n self.color255[17]=[183,156,220]\n self.color255[18]=[183,214,211]\n self.color255[19]=[152,189,207]\n self.color255[20]=[178,212,242]\n self.color255[21]=[68,172,100]\n self.color255[22]=[111,197,131]\n self.color255[23]=[85,188,255]\n self.color255[24]=[0,145,30]\n self.color255[25]=[214,230,130]\n self.color255[26]=[218,255,255]\n self.color255[27]=[170,250,250]\n self.color255[28]=[140,224,228]\n self.color255[29]=[188,65,28]\n self.color255[30]=[216,191,216]\n self.color255[31]=[145,60,66]\n self.color255[32]=[150,98,83]\n self.color255[33]=[250,250,225]\n self.color255[34]=[200,200,215]\n self.color255[35]=[68,131,98]\n self.color255[36]=[83,146,164]\n self.color255[37]=[162,115,105]\n self.color255[38]=[141,93,137]\n self.color255[39]=[182,166,110]\n self.color255[40]=[188,135,166]\n self.color255[41]=[154,150,201]\n self.color255[42]=[177,140,190]\n self.color255[43]=[30,111,85]\n self.color255[44]=[210,157,166]\n self.color255[45]=[48,129,126]\n self.color255[46]=[98,153,112]\n self.color255[47]=[69,110,53]\n self.color255[48]=[166,113,137]\n self.color255[49]=[122,101,38]\n self.color255[50]=[253,135,192]\n self.color255[51]=[145,92,109]\n self.color255[52]=[46,101,131]\n self.color255[53]=[0,108,112]\n self.color255[54]=[127,150,88]\n self.color255[55]=[159,116,163]\n self.color255[56]=[125,102,154]\n self.color255[57]=[106,174,155]\n self.color255[58]=[154,146,83]\n self.color255[59]=[126,126,55]\n self.color255[60]=[201,160,133]\n self.color255[61]=[78,152,141]\n self.color255[62]=[174,140,103]\n self.color255[63]=[139,126,177]\n self.color255[64]=[148,120,72]\n self.color255[65]=[186,135,135]\n self.color255[66]=[99,106,24]\n self.color255[67]=[156,171,108]\n self.color255[68]=[64,123,147]\n self.color255[69]=[138,95,74]\n self.color255[70]=[97,113,158]\n self.color255[71]=[126,161,197]\n self.color255[72]=[194,195,164]\n self.color255[73]=[88,106,215]\n self.color255[74]=[82,174,128]\n self.color255[75]=[57,157,110]\n self.color255[76]=[60,143,83]\n self.color255[77]=[92,162,109]\n self.color255[78]=[255,244,209]\n self.color255[79]=[201,121,77]\n self.color255[80]=[70,163,117]\n self.color255[81]=[188,91,95]\n self.color255[82]=[166,84,94]\n self.color255[83]=[182,105,107]\n self.color255[84]=[229,147,118]\n self.color255[85]=[174,122,90]\n self.color255[86]=[201,112,73]\n self.color255[87]=[194,142,0]\n self.color255[88]=[241,213,144]\n self.color255[89]=[203,179,77]\n self.color255[90]=[229,204,109]\n self.color255[91]=[255,243,152]\n self.color255[92]=[209,185,85]\n self.color255[93]=[248,223,131]\n self.color255[94]=[255,230,138]\n self.color255[95]=[196,172,68]\n self.color255[96]=[255,255,167]\n self.color255[97]=[255,250,160]\n self.color255[98]=[255,237,145]\n self.color255[99]=[242,217,123]\n self.color255[100]=[222,198,101]\n self.color255[101]=[213,124,109]\n self.color255[102]=[184,105,108]\n self.color255[103]=[150,208,243]\n self.color255[104]=[62,162,114]\n self.color255[105]=[242,206,142]\n self.color255[106]=[250,210,139]\n self.color255[107]=[255,255,207]\n self.color255[108]=[182,228,255]\n self.color255[109]=[175,216,244]\n self.color255[110]=[197,165,145]\n self.color255[111]=[172,138,115]\n self.color255[112]=[202,164,140]\n self.color255[113]=[224,186,162]\n self.color255[114]=[255,245,217]\n self.color255[115]=[206,110,84]\n self.color255[116]=[210,115,89]\n self.color255[117]=[203,108,81]\n self.color255[118]=[233,138,112]\n self.color255[119]=[195,100,73]\n self.color255[120]=[181,85,57]\n self.color255[121]=[152,55,13]\n self.color255[122]=[159,63,27]\n self.color255[123]=[166,70,38]\n self.color255[124]=[218,123,97]\n self.color255[125]=[225,130,104]\n self.color255[126]=[224,97,76]\n self.color255[127]=[184,122,154]\n self.color255[128]=[211,171,143]\n self.color255[129]=[47,150,103]\n self.color255[130]=[173,121,88]\n self.color255[131]=[188,95,76]\n self.color255[132]=[255,239,172]\n self.color255[133]=[226,202,134]\n self.color255[134]=[253,232,158]\n self.color255[135]=[244,217,154]\n self.color255[136]=[205,179,108]\n self.color255[137]=[186,124,161]\n self.color255[138]=[255,255,220]\n self.color255[139]=[234,234,194]\n self.color255[140]=[204,142,178]\n self.color255[141]=[180,119,153]\n self.color255[142]=[216,132,105]\n self.color255[143]=[255,253,229]\n self.color255[144]=[205,167,142]\n self.color255[145]=[204,168,143]\n self.color255[146]=[255,224,199]\n self.color255[147]=[139,150,98]\n self.color255[148]=[249,180,111]\n self.color255[149]=[157,108,162]\n self.color255[150]=[203,136,116]\n self.color255[151]=[185,102,83]\n self.color255[152]=[247,182,164]\n self.color255[153]=[222,154,132]\n self.color255[154]=[124,186,223]\n self.color255[155]=[249,186,150]\n self.color255[156]=[244,170,147]\n self.color255[157]=[255,181,158]\n self.color255[158]=[255,190,165]\n self.color255[159]=[227,153,130]\n self.color255[160]=[213,141,113]\n self.color255[161]=[193,123,103]\n self.color255[162]=[216,146,127]\n self.color255[163]=[230,158,140]\n self.color255[164]=[245,172,147]\n self.color255[165]=[241,172,151]\n self.color255[166]=[177,124,92]\n self.color255[167]=[171,85,68]\n self.color255[168]=[217,198,131]\n self.color255[169]=[212,188,102]\n self.color255[170]=[185,135,134]\n self.color255[171]=[198,175,125]\n self.color255[172]=[194,98,79]\n self.color255[173]=[255,238,170]\n self.color255[174]=[206,111,93]\n self.color255[175]=[216,186,0]\n self.color255[176]=[255,226,77]\n self.color255[177]=[255,243,106]\n self.color255[178]=[255,234,92]\n self.color255[179]=[240,210,35]\n self.color255[180]=[224,194,0]\n self.color255[181]=[213,99,79]\n self.color255[182]=[217,102,81]\n self.color255[183]=[0,147,202]\n self.color255[184]=[0,122,171]\n self.color255[185]=[186,77,64]\n self.color255[186]=[240,255,30]\n self.color255[187]=[185,232,61]\n self.color255[188]=[0,226,255]\n self.color255[189]=[251,159,255]\n self.color255[190]=[230,169,29]\n self.color255[191]=[0,194,113]\n self.color255[192]=[104,160,249]\n self.color255[193]=[221,108,158]\n self.color255[194]=[137,142,0]\n self.color255[195]=[230,70,0]\n self.color255[196]=[0,147,0]\n self.color255[197]=[0,147,248]\n self.color255[198]=[231,0,206]\n self.color255[199]=[129,78,0]\n self.color255[200]=[0,116,0]\n self.color255[201]=[0,0,255]\n self.color255[202]=[157,0,0]\n self.color255[203]=[100,100,130]\n self.color255[204]=[205,205,100]\n \n return self.color255","def color(value):\r\n return 'RGB({}, {}, {})'.format(value.red(), value.blue(), value.green())","def color(c):\n\n if isinstance(c, tuple) and len(c) == 4:\n return c\n\n if c is None:\n return c\n\n if isinstance(c, basestring):\n if c[0] == '#':\n c = c[1:]\n\n if len(c) == 6:\n r = int(c[0]+c[1], 16)\n g = int(c[2]+c[3], 16)\n b = int(c[4]+c[5], 16)\n a = 255\n elif len(c) == 8:\n r = int(c[0]+c[1], 16)\n g = int(c[2]+c[3], 16)\n b = int(c[4]+c[5], 16)\n a = int(c[6]+c[7], 16)\n elif len(c) == 3:\n r = int(c[0], 16) * 0x11\n g = int(c[1], 16) * 0x11\n b = int(c[2], 16) * 0x11\n a = 255\n elif len(c) == 4:\n r = int(c[0], 16) * 0x11\n g = int(c[1], 16) * 0x11\n b = int(c[2], 16) * 0x11\n a = int(c[3], 16) * 0x11\n else:\n raise Exception(\"Color string must be 3, 4, 6, or 8 hex digits long.\")\n\n return (r, g, b, a)\n\n raise Exception(\"Not a color: %r\" % (c,))","def RGB(r, g, b):\n rm = min(255, Int(r))\n gm = min(255, Int(g))\n bm = min(255, Int(b))\n #\n if rm < 0 or gm < 0 or bm < 0:\n raise ValueError(\"RGB values must be >= 0, were (%s, %s, %s)\" % (r, g, b))\n #\n return ((bm * 256) + gm) * 256 + rm","def rainbow_all(self):\n while True:\n for g in range(0, 255, 1):\n self.BridgeObj.send_rgb_value(255, g, 0)\n time.sleep(self.speed)\n\n for r in range(255, 0, -1):\n self.BridgeObj.send_rgb_value(r, 255, 0)\n time.sleep(self.speed)\n\n for b in range(0, 255, 1):\n self.BridgeObj.send_rgb_value(0, 255, b)\n time.sleep(self.speed)\n\n for g in range(255, 0, -1):\n self.BridgeObj.send_rgb_value(0, g, 255)\n time.sleep(self.speed)\n\n for r in range(0, 255, 1):\n self.BridgeObj.send_rgb_value(r, 0, 255)\n time.sleep(self.speed)\n\n for b in range(255, 0, -1):\n self.BridgeObj.send_rgb_value(255, 0, b)\n time.sleep(self.speed)","def _color(self, args):","def change(widget, colors): \n\t\n new_val = '#'\n for name in ('red', 'green', 'blue'):\n new_val += colors[name].get()\n widget['bg'] = new_val","def rgb_pack(r: int, g: int, b: int) -> int:\n rgb = (r << 16) | (g << 8) | b\n return rgb","def normalize_rgb_colors_to_hex(css):\n log.debug(\"Converting all rgba to hexadecimal color values.\")\n regex = re.compile(r\"rgb\\s*\\(\\s*([0-9,\\s]+)\\s*\\)\")\n match = regex.search(css)\n while match:\n colors = map(lambda s: s.strip(), match.group(1).split(\",\"))\n hexcolor = '#%.2x%.2x%.2x' % tuple(map(int, colors))\n css = css.replace(match.group(), hexcolor)\n match = regex.search(css)\n return css","def combine_colors(c1, c2, factor=0.5):\n c3 = QtGui.QColor()\n c3.setRed(int((factor * c1.red() + (1 - factor) * c2.red())))\n c3.setGreen(int((factor * c1.green() + (1 - factor) * c2.green())))\n c3.setBlue(int((factor * c1.blue() + (1 - factor) * c2.blue())))\n return c3","def combine_colors(c1, c2, factor=0.5):\n c3 = QtGui.QColor()\n c3.setRed(int((factor * c1.red() + (1 - factor) * c2.red())))\n c3.setGreen(int((factor * c1.green() + (1 - factor) * c2.green())))\n c3.setBlue(int((factor * c1.blue() + (1 - factor) * c2.blue())))\n return c3","def default_colors():\n # default_colors = [\n # # r, g, b, a\n # [92, 192, 98, 0.5],\n # [90, 155, 212, 0.5],\n # [246, 236, 86, 0.6],\n # [241, 90, 96, 0.4],\n # [255, 117, 0, 0.3],\n # [82, 82, 190, 0.2],\n # ]\n\n default_colors = [\n # r, g, b, a\n [188, 114, 3, 0.5],\n [3, 133, 188, 0.5],\n [155, 9, 118, 0.6],\n [155, 53, 9, 0.4],\n [4, 140, 128, 0.3],\n [140, 8, 8, 0.2],\n ]\n\n default_colors = [\n [i[0] / 255.0, i[1] / 255.0, i[2] / 255.0, i[3]]\n for i in default_colors\n ]\n\n return default_colors","def reformatColor(self, colorStr):\n if type(colorStr) is str:\n if colorStr.startswith('#'):\n colorStr = colorStr.replace('#', '')\n else:\n raise Exception('color is not hex format')\n r = int(colorStr[:2], 16)\n g = int(colorStr[2:4], 16)\n b = int(colorStr[4:6], 16)\n return r, g, b","def from_rgb(r, g, b) -> str:\n return \"#{0:02x}{1:02x}{2:02x}\".format(r, g, b)","def _init_colors(self):\n self.clr_primary = None\n self.clr_secondary = 'green'\n self.clr_tertiary = 'cyan'\n self.clr_quaternary = 'yellow'\n self.clr_bold = 'cyan'\n self.clr_code = 'cyan'\n self.clr_error = 'red'\n self.clr_header = 'yellow'\n self.clr_link = 'green'\n self.clr_list = 'cyan'\n self.clr_message = None\n self.clr_num_comments = 'green'\n self.clr_num_points = 'green'\n self.clr_tag = 'cyan'\n self.clr_time = 'yellow'\n self.clr_title = None\n self.clr_tooltip = None\n self.clr_user = 'cyan'\n self.clr_view_link = 'magenta'\n self.clr_view_index = 'magenta'","def fill_rgb(self, r, g, b, start=0, end=0):\n if start < 0:\n start = 0\n if end == 0 or end > self.last_index:\n end = self.last_index\n for led in range(start, end + 1): # since 0-index include end in range\n self.__set_internal(led, r, g, b)","def glColor(self, r, g, b):\n if 0 <= r <= 1 or 0 <= g <= 1 or 0 <= b <= 1:\n self.vr = ceil(r * 255)\n self.vg = ceil(g * 255)\n self.vb = ceil(b * 255)\n else:\n print(\"Please insert numbers between 0 and 1\")\n sys.exit()","def get_color(self, value):\n value = min(max(0,value), 1) * 510\n\n if value < 255:\n redValue = 255\n greenValue = math.sqrt(value) * 16\n greenValue = int(greenValue)\n else:\n greenValue = 255\n value = value - 255\n redValue = 255 - (value * value / 255)\n redValue = int(redValue)\n return '#' + f\"{redValue:0{2}x}\" + f\"{greenValue:0{2}x}\" + '00'","def glClearColor(self, r, g, b):\n if 0 <= r <= 1 or 0 <= g <= 1 or 0 <= b <= 1:\n self.r = ceil(r * 255)\n self.g = ceil(g * 255)\n self.b = ceil(b * 255)\n else:\n print(\"Please insert numbers between 0 and 1\")\n sys.exit()","def random_color():\n colormode(255)\n return randint(0, 255), randint(0, 255), randint(0, 255)","def revert_color(cls, colors):\n # 0.5 is to map the color to the center of the range\n return [int((c+0.5) / cls.color_level * 256) for c in colors]","def recolorRGV(src,dst):\n b,g,r=cv2.split(src)\n cv2.min(b,g,b) # min() function computes the per-element minimum of the first two arguments\n # and writes them to the third argument\n cv2.min(b,r,b)\n cv2.merge((b,g,r),dest) # b is modified to the minimum of b,g,r at every pixel","def set_pattern(colors=('green', 'blue', 'red')): # (10)\n for i in range(0, int(ceil(float(NUM_LEDS)/float(len(colors))))):\n for color in colors:\n push_color(color)","def _proc_color(self, tokens):\n\n keys = tokens.keys()\n if \"red\" in keys: # RGB(A)\n rr, gg, bb = tokens[\"red\"], tokens[\"green\"], tokens[\"blue\"]\n hex2int = lambda h: int(h, 16)\n if \"alpha\" in keys:\n a = tokens[\"alpha\"]\n c = str((hex2int(rr), hex2int(gg), hex2int(bb), hex2int(a)))\n else:\n c = str((hex2int(rr), hex2int(gg), hex2int(bb)))\n elif \"hue\" in keys: # HSV\n r, g, b = hsv_to_rgb(tokens[\"hue\"],\n tokens[\"saturation\"],\n tokens[\"value\"])\n c = str((int(r*255), int(g*255), int(b*255)))\n else:\n c = tokens[\"color\"]\n\n return c","def rgb_to_color(*rgb):\n if(len(rgb)==1):\n r,g,b = rgb[0]\n else:\n r,g,b = rgb\n return \"#%02x%02x%02x\" % (r,g,b)","def color_negative_red_positive_green(val):\n if val < 0:\n color = 'red'\n elif val > 0:\n color = 'green'\n else:\n color = 'black'\n\n return 'color: %s' % color","def rgbToHex ( r, g = 0.0, b = 0.0 ):\n # Check if argument is list\n if isinstance(r, list):\n g = r[1]\n b = r[2]\n r = r[0]\n if isinstance( r, float ):\n r *= 255.0\n if isinstance( g, float ):\n g *= 255.0\n if isinstance( b, float ):\n b *= 255.0\n return \"%02x%02x%02x\" % ( round( r ), round( g ), round( b ))","def calibrate_rgb(self, r, g, b):\n new_r = r*self._calibrate[\"r\"] \n new_g = g*self._calibrate[\"g\"]\n new_b = b*self._calibrate[\"b\"]\n return (new_r,new_g,new_b)","def colorize(image, newColor):\n image = image.copy()\n\n # zero out RGB values\n image.fill((0, 0, 0, 255), None, pygame.BLEND_RGBA_MULT)\n # add in new RGB values\n image.fill(newColor[0:3] + [0,], None, pygame.BLEND_RGBA_ADD)\n\n return image","def create_unique_color_uchar(tag, hue_step=0.41):\n r, g, b = create_unique_color_float(tag, hue_step)\n return int(255*r), int(255*g), int(255*b)","def colormixer(colors, weights=None):\n def _to_hex(v):\n v_hex = hex(v)[2:]\n if len(v_hex) == 1:\n v_hex = \"0\" + v_hex\n return v_hex\n\n # Compute mean intensities for red, green and blue\n if weights is None:\n r = int(np.mean([int(c[1:3], 16) for c in colors]))\n g = int(np.mean([int(c[3:5], 16) for c in colors]))\n b = int(np.mean([int(c[5:7], 16) for c in colors]))\n else:\n r = int(sum([int(c[1:3], 16) * w for c, w in zip(colors, weights)]) / sum(weights))\n g = int(sum([int(c[3:5], 16) * w for c, w in zip(colors, weights)]) / sum(weights))\n b = int(sum([int(c[5:7], 16) * w for c, w in zip(colors, weights)]) / sum(weights))\n \n # Take mean of each and convert back to hex\n return '#' + _to_hex(r) + _to_hex(g) + _to_hex(b)","def color_negative_red(val):\n if val == 'k':\n color = 'red' \n else:\n color = 'yellow'\n return ['color: %s' % color]*3","def get_rgb_normalized(r, g, b, a=1.0):\n return r / 255.0, g / 255.0, b / 255.0, a","def rgb_565(self):\n return (\n (int(self.red * 0xF800) & 0xF800) |\n (int(self.green * 0x07E0) & 0x07E0) |\n (int(self.blue * 0x001F) & 0x001F))","def test_assembleColor(self):\n self.assertEqual(\n irc.assembleFormattedText(A.fg.red[A.bg.blue[\"hello\"]]),\n \"\\x0f\\x0305,02hello\",\n )","def _from_rgb(self, rgb):\r\n return \"#%02x%02x%02x\" % rgb","def create_color():\n r = random.randint(0,255)\n g = random.randint(0,255)\n b = random.randint(0,255)\n a = random.randint(0,255)\n return introcs.RGB(r,g,b,a)","def randcolor():\n return (randint(0,255), randint(0,255), randint(0,255))"],"string":"[\n \"def color_rgb(r,g,b):\\n return \\\"#%02x%02x%02x\\\" % (r,g,b)\",\n \"def color_rgb(r,g,b):\\n return \\\"#%02x%02x%02x\\\" % (r,g,b)\",\n \"def color_rgb(r,g,b):\\n return \\\"#%02x%02x%02x\\\" % (r,g,b)\",\n \"def combine_color(red, green, blue):\\r\\n\\r\\n return (red << 16) + (green << 8) + blue\",\n \"def rgb(r, g, b):\\n return \\\"\\\".join([\\\"%02X\\\" % max(0, min(x, 255)) for x in [r, g, b]])\",\n \"def rgb(r, g, b, alpha=1.0):\\n global _cmds\\n _cmds = (f\\\"color([{r/255},{g/255},\\\"\\n f\\\"{b/255},{alpha}])\\\\n\\\") + _cmds\",\n \"def setColorRGB(r,g,b):\\n r, g, b = r/255., g/255., b/255.\\n dislin.setrgb(r,g,b)\",\n \"def RGB_to_fill(R, G, B):\\n\\n # based on https://stackoverflow.com/q/30484220\\n\\n return PatternFill(\\n start_color=RGB_to_HEX(R, G, B),\\n end_color=RGB_to_HEX(R, G, B),\\n fill_type='solid'\\n )\",\n \"def get_rgb(self, r,g,b):\\n return \\\"#%02x%02x%02x\\\" % (r,g,b)\",\n \"def Color(red, green, blue, white = 0):\\n\\treturn (white << 24) | (red << 16)| (green << 8) | blue\",\n \"def Color(red, green, blue, white = 0):\\n return (white << 24) | (red << 16)| (green << 8) | blue\",\n \"def _color565(self, r, g, b):\\n return (((r & 0xF8) << 8) | ((g & 0xFC) << 3) | (b >> 3))\",\n \"def get_color_in_rgb_decimal():\\n\\n # Grabbing custom colormap from matplotlib\\n a = cm.get_cmap('cool', 32)\\n b = cm.get_cmap('spring', 32)\\n c = cm.get_cmap('autumn_r', 64)\\n d = cm.get_cmap('bwr_r', 192)\\n e = cm.get_cmap('Greens', 192)\\n\\n # Adding the colormaps into one stack to have a more comprehensive color spectrum \\n newcolors = np.vstack((a(np.linspace(0, 1, 32)), \\n b(np.linspace(0, 1, 32)), \\n c(np.linspace(0, 1, 64)),\\n d(np.linspace(0, 0.5, 192)),\\n e(np.linspace(0, 1, 192)),\\n ))\\n return newcolors\",\n \"def setColors(self):\\n #productive\\n profprint()\\n self.color= [[0,0,0] for i in range(205)]\\n self.color255= self.setColors255()\\n for i in range(205):\\n for j in range(3):\\n self.color[i][j] = self.color255[i][j]/float(255)\\n\\n return self.color\",\n \"def set_color_rgb(r, g, b):\\r\\n global _current_color\\r\\n _current_color = (r, g, b)\",\n \"def fromInts(r, g, b):\\n return IColor(r/255.,g/255.,b/255.)\",\n \"def setColors(self):\\r\\n # productive\\r\\n profprint()\\r\\n self.color = [[0, 0, 0] for i in range(MAXCOL)]\\r\\n self.color255 = self.setColors255()\\r\\n for i in range(MAXCOL):\\r\\n for j in range(3):\\r\\n self.color[i][j] = self.color255[i][j] / float(255)\\r\\n\\r\\n return self.color\",\n \"def multiply_rgb(color, alter):\\n rgb = color[1:]\\n chunks, chunk_size = len(rgb), len(rgb)/3\\n r, g, b = [ int(int('0x%s' % rgb[i:i+chunk_size], 0) * alter) for i in range(0, chunks, chunk_size) ]\\n return '#%.2x%.2x%.2x' % (r, g, b)\",\n \"def convert_to_RGB_255(colors):\\n return (colors[0]*255.0, colors[1]*255.0, colors[2]*255.0)\",\n \"def merge_color(rate):\\n if rate < 15:\\n return 'r'\\n if rate < 30:\\n return 'y'\\n return 'g'\",\n \"def _to_color(indx, base):\\n base2 = base * base\\n b = 2 - indx / base2\\n r = 2 - (indx % base2) / base\\n g = 2 - (indx % base2) % base\\n return b * 127, r * 127, g * 127\",\n \"def color565(red, green=0, blue=0):\\n try:\\n red, green, blue = red # see if the first var is a tuple/list\\n except TypeError:\\n pass\\n return (red & 0xf8) << 8 | (green & 0xfc) << 3 | blue >> 3\",\n \"def reduceColorRGB(channels,levels):\\n data = (levels[2]*levels[1]*reduceColor(channels[0],levels[0])+\\n levels[2]*reduceColor(channels[1],levels[1])+\\n reduceColor(channels[2],levels[2])).astype(numpy.uint8)\\n return data\",\n \"def color565(r, g=0, b=0):\\n try:\\n r, g, b = r # see if the first var is a tuple/list\\n except TypeError:\\n pass\\n return (r & 0xf8) << 8 | (g & 0xfc) << 3 | b >> 3\",\n \"def change_color():\\n return random.randint(0, 255), random.randint(0, 255), random.randint(0, 255)\",\n \"def set_rgb(self, r=0, g=0, b=0, calibrate=True):\\n r = self.set_red(r)\\n g = self.set_green(g)\\n b = self.set_blue(b)\\n return (r,g,b)\",\n \"def _get_color(self, r, g, b):\\n clr = (r, g, b)\\n return clr\",\n \"def get_xterm_color(r, g, b):\\n rr = round_tint(r)\\n rg = round_tint(g)\\n rb = round_tint(b)\\n\\n return 16 + rr * 36 + rg * 6 + rb\",\n \"def Red(*args, **kwargs):\\n return _gdi_.Colour_Red(*args, **kwargs)\",\n \"def set_rgb_color(r, g, b, a=1.0):\\n glColor4fv(get_rgb_normalized(r, g, b, a))\",\n \"def colorize(self):\\n return\",\n \"def _pack_rgb_values(r, g, b):\\n if isinstance(r, np.ndarray):\\n r = r.astype(np.int)\\n rgb = r << 8\\n rgb |= g\\n rgb = rgb << 8\\n rgb |= b\\n return rgb\",\n \"def rgbString(red,green,blue):\\n return chr(red)+chr(green)+chr(blue)\",\n \"def ramp_color_rgb(values, feature, parent): \\r\\n ramp_name = values[0]\\r\\n ramp_position = values[1]\\r\\n \\r\\n ramp = QgsStyleV2.defaultStyle().colorRampRef(ramp_name)\\r\\n if not ramp:\\r\\n parent.setEvalErrorString( QObject.tr( '\\\"{}\\\" is not a valid color ramp'.format(ramp_name)))\\r\\n return QColor(0,0,0).name()\\r\\n \\r\\n value, error = getFloat(ramp_position)\\r\\n if error:\\r\\n parent.setEvalErrorString(error)\\r\\n \\r\\n color = ramp.color(value)\\r\\n return \\\"{},{},{}\\\".format(color.red(), color.green(), color.blue())\",\n \"def colorize(image, newColor):\\n image = image.copy()\\n\\n # zero out RGB values\\n image.fill((0, 0, 0, 255), None, pg.BLEND_RGBA_MULT)\\n # add in new RGB values\\n image.fill(newColor[0:3] + (0,), None, pg.BLEND_RGBA_ADD)\\n\\n return image\",\n \"def update_r(color, new_r):\\n\\n color.update_r(new_r)\",\n \"def rainbow_example(rounds=1, delay_secs=0.01):\\n set_color('black') # Start with all LED's \\\"off\\\"\\n update()\\n\\n saturation = 100 # 0 (grayer) to 100 (full color)\\n brightness = 100 # 0 (darker) to 100 (brighter)\\n\\n for i in range(0, rounds):\\n for hue in tuple(range(0, 360)) + tuple(range(360, -1, -1)): # 0..360..0\\n color_str = \\\"hsb({}, {}%, {}%)\\\".format(hue, saturation, brightness)\\n push_color(color_str)\\n update()\\n sleep(delay_secs)\",\n \"def colors(self):\\n\\t\\treturn [(0, 30, 255),(0, 30, 120)]\",\n \"def generate_normalized_rgb(self):\\n \\n r,g,b=(Numeric.zeros(256),Numeric.zeros(256),Numeric.zeros(256))\\n for i in Numeric.arange(256):\\n r_,g_,b_=self.colfct(i/255.0) # these are from [0,1]\\n r[i],g[i],b[i]=int(255*r_),int(255*g_),int(255*b_)\\n return r/256.0,g/256.0,b/256.0\",\n \"def _style_colours(self):\\n\\n pass\",\n \"def rgb(r, g, b):\\n return (r/255, g/255, b/255)\",\n \"def get_rgb(self):\\n\\n return \\\"#%02X%02X%02X\\\" % (self.r, self.g, self.b)\",\n \"def modify_color(color, sigma):\\n\\t# get values of individual colors, convert to hex integers, and modify\\n\\tred, green, blue = (vary(int(color[i:i+2], 16), sigma) for i in (1, 3, 5))\\n\\t# return combined hex representation of new color values\\n\\treturn '#%02X%02X%02X' % (red, green, blue)\",\n \"def setColors255(self):\\r\\n # productive\\r\\n profprint()\\r\\n self.color255 = [[0, 0, 0] for i in range(MAXCOL)]\\r\\n self.color255[0] = [221, 108, 158]\\r\\n self.color255[1] = [128, 174, 128]\\r\\n self.color255[2] = [241, 214, 145]\\r\\n self.color255[3] = [177, 122, 101]\\r\\n self.color255[4] = [111, 184, 210]\\r\\n self.color255[5] = [216, 101, 79]\\r\\n self.color255[6] = [221, 130, 101]\\r\\n self.color255[7] = [144, 238, 144]\\r\\n self.color255[8] = [192, 104, 88]\\r\\n self.color255[9] = [220, 245, 20]\\r\\n self.color255[10] = [78, 63, 0]\\r\\n self.color255[11] = [255, 250, 220]\\r\\n self.color255[12] = [230, 220, 70]\\r\\n self.color255[13] = [200, 200, 235]\\r\\n self.color255[14] = [250, 250, 210]\\r\\n self.color255[15] = [244, 214, 49]\\r\\n self.color255[16] = [0, 151, 206]\\r\\n self.color255[17] = [183, 156, 220]\\r\\n self.color255[18] = [183, 214, 211]\\r\\n self.color255[19] = [152, 189, 207]\\r\\n self.color255[20] = [178, 212, 242]\\r\\n self.color255[21] = [68, 172, 100]\\r\\n self.color255[22] = [111, 197, 131]\\r\\n self.color255[23] = [85, 188, 255]\\r\\n self.color255[24] = [0, 145, 30]\\r\\n self.color255[25] = [214, 230, 130]\\r\\n self.color255[26] = [218, 255, 255]\\r\\n self.color255[27] = [170, 250, 250]\\r\\n self.color255[28] = [140, 224, 228]\\r\\n self.color255[29] = [188, 65, 28]\\r\\n self.color255[30] = [216, 191, 216]\\r\\n self.color255[31] = [145, 60, 66]\\r\\n self.color255[32] = [150, 98, 83]\\r\\n self.color255[33] = [250, 250, 225]\\r\\n self.color255[34] = [200, 200, 215]\\r\\n self.color255[35] = [68, 131, 98]\\r\\n self.color255[36] = [83, 146, 164]\\r\\n self.color255[37] = [162, 115, 105]\\r\\n self.color255[38] = [141, 93, 137]\\r\\n self.color255[39] = [182, 166, 110]\\r\\n self.color255[40] = [188, 135, 166]\\r\\n self.color255[41] = [154, 150, 201]\\r\\n self.color255[42] = [177, 140, 190]\\r\\n self.color255[43] = [30, 111, 85]\\r\\n self.color255[44] = [210, 157, 166]\\r\\n self.color255[45] = [48, 129, 126]\\r\\n self.color255[46] = [98, 153, 112]\\r\\n self.color255[47] = [69, 110, 53]\\r\\n self.color255[48] = [166, 113, 137]\\r\\n self.color255[49] = [122, 101, 38]\\r\\n self.color255[50] = [253, 135, 192]\\r\\n self.color255[51] = [145, 92, 109]\\r\\n self.color255[52] = [46, 101, 131]\\r\\n self.color255[53] = [0, 108, 112]\\r\\n self.color255[54] = [127, 150, 88]\\r\\n self.color255[55] = [159, 116, 163]\\r\\n self.color255[56] = [125, 102, 154]\\r\\n self.color255[57] = [106, 174, 155]\\r\\n self.color255[58] = [154, 146, 83]\\r\\n self.color255[59] = [126, 126, 55]\\r\\n self.color255[60] = [201, 160, 133]\\r\\n self.color255[61] = [78, 152, 141]\\r\\n self.color255[62] = [174, 140, 103]\\r\\n self.color255[63] = [139, 126, 177]\\r\\n self.color255[64] = [148, 120, 72]\\r\\n self.color255[65] = [186, 135, 135]\\r\\n self.color255[66] = [99, 106, 24]\\r\\n self.color255[67] = [156, 171, 108]\\r\\n self.color255[68] = [64, 123, 147]\\r\\n self.color255[69] = [138, 95, 74]\\r\\n self.color255[70] = [97, 113, 158]\\r\\n self.color255[71] = [126, 161, 197]\\r\\n self.color255[72] = [194, 195, 164]\\r\\n self.color255[73] = [88, 106, 215]\\r\\n self.color255[74] = [82, 174, 128]\\r\\n self.color255[75] = [57, 157, 110]\\r\\n self.color255[76] = [60, 143, 83]\\r\\n self.color255[77] = [92, 162, 109]\\r\\n self.color255[78] = [255, 244, 209]\\r\\n self.color255[79] = [201, 121, 77]\\r\\n self.color255[80] = [70, 163, 117]\\r\\n self.color255[81] = [188, 91, 95]\\r\\n self.color255[82] = [166, 84, 94]\\r\\n self.color255[83] = [182, 105, 107]\\r\\n self.color255[84] = [229, 147, 118]\\r\\n self.color255[85] = [174, 122, 90]\\r\\n self.color255[86] = [201, 112, 73]\\r\\n self.color255[87] = [194, 142, 0]\\r\\n self.color255[88] = [241, 213, 144]\\r\\n self.color255[89] = [203, 179, 77]\\r\\n self.color255[90] = [229, 204, 109]\\r\\n self.color255[91] = [255, 243, 152]\\r\\n self.color255[92] = [209, 185, 85]\\r\\n self.color255[93] = [248, 223, 131]\\r\\n self.color255[94] = [255, 230, 138]\\r\\n self.color255[95] = [196, 172, 68]\\r\\n self.color255[96] = [255, 255, 167]\\r\\n self.color255[97] = [255, 250, 160]\\r\\n self.color255[98] = [255, 237, 145]\\r\\n self.color255[99] = [242, 217, 123]\\r\\n self.color255[100] = [222, 198, 101]\\r\\n self.color255[101] = [213, 124, 109]\\r\\n self.color255[102] = [184, 105, 108]\\r\\n self.color255[103] = [150, 208, 243]\\r\\n self.color255[104] = [62, 162, 114]\\r\\n self.color255[105] = [242, 206, 142]\\r\\n self.color255[106] = [250, 210, 139]\\r\\n self.color255[107] = [255, 255, 207]\\r\\n self.color255[108] = [182, 228, 255]\\r\\n self.color255[109] = [175, 216, 244]\\r\\n self.color255[110] = [197, 165, 145]\\r\\n self.color255[111] = [172, 138, 115]\\r\\n self.color255[112] = [202, 164, 140]\\r\\n self.color255[113] = [224, 186, 162]\\r\\n self.color255[114] = [255, 245, 217]\\r\\n self.color255[115] = [206, 110, 84]\\r\\n self.color255[116] = [210, 115, 89]\\r\\n self.color255[117] = [203, 108, 81]\\r\\n self.color255[118] = [233, 138, 112]\\r\\n self.color255[119] = [195, 100, 73]\\r\\n self.color255[120] = [181, 85, 57]\\r\\n self.color255[121] = [152, 55, 13]\\r\\n self.color255[122] = [159, 63, 27]\\r\\n self.color255[123] = [166, 70, 38]\\r\\n self.color255[124] = [218, 123, 97]\\r\\n self.color255[125] = [225, 130, 104]\\r\\n self.color255[126] = [224, 97, 76]\\r\\n self.color255[127] = [184, 122, 154]\\r\\n self.color255[128] = [211, 171, 143]\\r\\n self.color255[129] = [47, 150, 103]\\r\\n self.color255[130] = [173, 121, 88]\\r\\n self.color255[131] = [188, 95, 76]\\r\\n self.color255[132] = [255, 239, 172]\\r\\n self.color255[133] = [226, 202, 134]\\r\\n self.color255[134] = [253, 232, 158]\\r\\n self.color255[135] = [244, 217, 154]\\r\\n self.color255[136] = [205, 179, 108]\\r\\n self.color255[137] = [186, 124, 161]\\r\\n self.color255[138] = [255, 255, 220]\\r\\n self.color255[139] = [234, 234, 194]\\r\\n self.color255[140] = [204, 142, 178]\\r\\n self.color255[141] = [180, 119, 153]\\r\\n self.color255[142] = [216, 132, 105]\\r\\n self.color255[143] = [255, 253, 229]\\r\\n self.color255[144] = [205, 167, 142]\\r\\n self.color255[145] = [204, 168, 143]\\r\\n self.color255[146] = [255, 224, 199]\\r\\n self.color255[147] = [139, 150, 98]\\r\\n self.color255[148] = [249, 180, 111]\\r\\n self.color255[149] = [157, 108, 162]\\r\\n self.color255[150] = [203, 136, 116]\\r\\n self.color255[151] = [185, 102, 83]\\r\\n self.color255[152] = [247, 182, 164]\\r\\n self.color255[153] = [222, 154, 132]\\r\\n self.color255[154] = [124, 186, 223]\\r\\n self.color255[155] = [249, 186, 150]\\r\\n self.color255[156] = [244, 170, 147]\\r\\n self.color255[157] = [255, 181, 158]\\r\\n self.color255[158] = [255, 190, 165]\\r\\n self.color255[159] = [227, 153, 130]\\r\\n self.color255[160] = [213, 141, 113]\\r\\n self.color255[161] = [193, 123, 103]\\r\\n self.color255[162] = [216, 146, 127]\\r\\n self.color255[163] = [230, 158, 140]\\r\\n self.color255[164] = [245, 172, 147]\\r\\n self.color255[165] = [241, 172, 151]\\r\\n self.color255[166] = [177, 124, 92]\\r\\n self.color255[167] = [171, 85, 68]\\r\\n self.color255[168] = [217, 198, 131]\\r\\n self.color255[169] = [212, 188, 102]\\r\\n self.color255[170] = [185, 135, 134]\\r\\n self.color255[171] = [198, 175, 125]\\r\\n self.color255[172] = [194, 98, 79]\\r\\n self.color255[173] = [255, 238, 170]\\r\\n self.color255[174] = [206, 111, 93]\\r\\n self.color255[175] = [216, 186, 0]\\r\\n self.color255[176] = [255, 226, 77]\\r\\n self.color255[177] = [255, 243, 106]\\r\\n self.color255[178] = [255, 234, 92]\\r\\n self.color255[179] = [240, 210, 35]\\r\\n self.color255[180] = [224, 194, 0]\\r\\n self.color255[181] = [213, 99, 79]\\r\\n self.color255[182] = [217, 102, 81]\\r\\n self.color255[183] = [0, 147, 202]\\r\\n self.color255[184] = [0, 122, 171]\\r\\n self.color255[185] = [186, 77, 64]\\r\\n self.color255[186] = [240, 255, 30]\\r\\n self.color255[187] = [185, 232, 61]\\r\\n self.color255[188] = [0, 226, 255]\\r\\n self.color255[189] = [251, 159, 255]\\r\\n self.color255[190] = [230, 169, 29]\\r\\n self.color255[191] = [0, 194, 113]\\r\\n self.color255[192] = [104, 160, 249]\\r\\n self.color255[193] = [221, 108, 158]\\r\\n self.color255[194] = [137, 142, 0]\\r\\n self.color255[195] = [230, 70, 0]\\r\\n self.color255[196] = [0, 147, 0]\\r\\n self.color255[197] = [0, 147, 248]\\r\\n self.color255[198] = [231, 0, 206]\\r\\n self.color255[199] = [129, 78, 0]\\r\\n self.color255[200] = [0, 116, 0]\\r\\n self.color255[201] = [0, 0, 255]\\r\\n self.color255[202] = [157, 0, 0]\\r\\n self.color255[203] = [100, 100, 130]\\r\\n self.color255[204] = [205, 205, 100]\\r\\n self.color255[205] = [255, 255, 0]\\r\\n\\r\\n return self.color255\",\n \"def recolorRC(src,dst):\\n b,g,r=cv2.split(src)\\n cv2.addWeighted(b,0.5,g,0.5,0,b) #arguements(in order):first src array,a weight applied\\n # to array, scnd src array, a weight applied to array\\n # a constant added to the result and a destination array\\n cv2.merge((b,b,r),dest) #replace b and g with modified b(which has both and g)\",\n \"def rgb_to_ansi256(r, g, b):\\n if r == g and g == b:\\n if r < 8:\\n return 16\\n if r > 248:\\n return 231\\n\\n return round(((r - 8) / 247.0) * 24) + 232\\n\\n ansi_r = 36 * round(r / 255.0 * 5.0)\\n ansi_g = 6 * round(g / 255.0 * 5.0)\\n ansi_b = round(b / 255.0 * 5.0)\\n ansi = 16 + ansi_r + ansi_g + ansi_b\\n return ansi\",\n \"def to_color(self):\\n return (int(self.r * 255), int(self.g * 255), int(self.b * 255))\",\n \"def resetColor(self):\\n self.setColor(255, 255, 255 ,255)\",\n \"def addColors(*colorMultPairs):\\n netRGB = [0, 0, 0]\\n for color, mult in colorMultPairs:\\n colorRGB = _getTkWdg().winfo_rgb(color)\\n netRGB = [netRGB[ii] + (mult * colorRGB[ii]) for ii in range(3)]\\n truncRGB = [max(min(int(val), 0xFFFF), 0) for val in netRGB]\\n retColor = \\\"#%04x%04x%04x\\\" % tuple(truncRGB)\\n #print \\\"mixColors(%r); netRGB=%s; truncRGB=%s; retColor=%r\\\" % (colorMultPairs, netRGB, truncRGB, retColor)\\n return retColor\",\n \"def fill(self, color):\",\n \"def fill(self, colour: int, /) -> None:\",\n \"def colors_to_string(colors):\\n return ''.join(['%02x%02x%02x' % (r,g,b) for r,g,b in colors])\",\n \"def rgbcolor(h, f):\\n # q = 1 - f\\n # t = f\\n if h == 0:\\n return v, f, p\\n elif h == 1:\\n return 1 - f, v, p\\n elif h == 2:\\n return p, v, f\\n elif h == 3:\\n return p, 1 - f, v\\n elif h == 4:\\n return f, p, v\\n elif h == 5:\\n return v, p, 1 - f\",\n \"def packl(self):\\n a = 255\\n r = IColor.scaleClipl(self.r)\\n g = IColor.scaleClipl(self.g)\\n b = IColor.scaleClipl(self.b)\\n return (a << 24) | (r << 16) | (g << 8) | (b)\",\n \"def label_rgb(colors):\\n return ('rgb(%s, %s, %s)' % (colors[0], colors[1], colors[2]))\",\n \"def setRgb ( self, r, g = 0.0, b = 0.0 ):\\n self.setRgba( r, g, b )\",\n \"def IntermediateColor(startcol, targetcol, frac):\\n if frac < 0:\\n frac = 0\\n if frac >= 1.0:\\n frac = 1.0\\n sc = MakeColorTuple(startcol)\\n tc = MakeColorTuple(targetcol)\\n dR = tc[0] - sc[0]\\n dG = tc[1] - sc[1]\\n dB = tc[2] - sc[2]\\n R = sc[0] + dR * frac\\n G = sc[1] + dG * frac\\n B = sc[2] + dB * frac\\n return \\\"#%02x%02x%02x\\\" % (R, G, B)\",\n \"def __fill_color(self, uol_c, uil_c, lol_c, lil_c):\\n self.__fill_lip_lines(uol_c, uil_c)\\n self.__fill_lip_lines(lol_c, lil_c)\\n self.__add_color(1)\\n self.__fill_lip_solid(uol_c, uil_c)\\n self.__fill_lip_solid(lol_c, lil_c)\\n self.__smoothen_color(uol_c, uil_c)\\n self.__smoothen_color(lol_c, lil_c)\",\n \"def color(step: int=10) -> Tuple[int, int, int]:\\n # Randomly seed the r g b values\\n r, g, b = (random_uniform(0, 255), random_uniform(0, 255),\\n random_uniform(0, 255))\\n\\n # Randomly determine if each r g and b value is increasing or not\\n r_inc = True\\n g_inc = True\\n b_inc = True\\n r_step = random_uniform(step)\\n g_step = random_uniform(step)\\n b_step = random_uniform(step)\\n\\n # Yield the initial r, g, b values\\n yield r, g, b\\n\\n # Loop and yeild forever\\n while True:\\n # If r is increasing\\n if r_inc:\\n # Increment r by the step\\n r += r_step\\n # Ensure that the next step will be within the limits\\n # if not then set the flag to decreasing\\n r_inc = r < 255 - r_step\\n # If r is decreasing\\n else:\\n # Decrement r by the step\\n r -= r_step\\n # Ensure that the next step will be within the limits\\n # if not then set the flag to increasing\\n r_inc = r < r_step\\n\\n # See above\\n if g_inc:\\n g += g_step\\n g_inc = g < 255 - g_step\\n else:\\n g -= g_step\\n g_inc = g < g_step\\n\\n # See above\\n if b_inc:\\n b += b_step\\n b_inc = b < 255 - b_step\\n else:\\n b -= b_step\\n b_inc = b < b_step\\n\\n # Yield the red, green, and blue values\\n yield r, g, b\",\n \"def unconvert_from_RGB_255(colors):\\n un_rgb_color = (colors[0]/(255.0),\\n colors[1]/(255.0),\\n colors[2]/(255.0))\\n\\n return un_rgb_color\",\n \"def rgb_to_ansi16(r, g, b, use_bright=False):\\n ansi_b = round(b / 255.0) << 2\\n ansi_g = round(g / 255.0) << 1\\n ansi_r = round(r / 255.0)\\n ansi = (90 if use_bright else 30) + (ansi_b | ansi_g | ansi_r)\\n\\n return ansi\",\n \"def change_color(mutated_genome):\\n index = random.randint(0,max(0,len(mutated_genome)-1))\\n if color_mode == 'RGB':\\n color_red = random.randint(-25,25)\\n color_green = random.randint(-25,25)\\n color_blue = random.randint(-25,25)\\n color = mutated_genome[index][0]\\n newcolor = (color[0]+color_red,color[1]+color_green,color[2]+color_blue)\\n else: #color_mode == 'L':\\n color_diff = random.randint(-25,25)\\n color = mutated_genome[index][0]\\n newcolor = color+color_diff\\n mutated_genome[index][0] = newcolor\",\n \"def setColors255(self):\\n #productive\\n profprint()\\n self.color255= [[0,0,0] for i in range(205)]\\n self.color255[0]=[221,108,158]\\n self.color255[1]=[128,174,128]\\n self.color255[2]=[241,214,145]\\n self.color255[3]=[177,122,101]\\n self.color255[4]=[111,184,210]\\n self.color255[5]=[216,101,79]\\n self.color255[6]=[221,130,101]\\n self.color255[7]=[144,238,144]\\n self.color255[8]=[192,104,88]\\n self.color255[9]=[220,245,20]\\n self.color255[10]=[78,63,0]\\n self.color255[11]=[255,250,220]\\n self.color255[12]=[230,220,70]\\n self.color255[13]=[200,200,235]\\n self.color255[14]=[250,250,210]\\n self.color255[15]=[244,214,49]\\n self.color255[16]=[0,151,206]\\n self.color255[17]=[183,156,220]\\n self.color255[18]=[183,214,211]\\n self.color255[19]=[152,189,207]\\n self.color255[20]=[178,212,242]\\n self.color255[21]=[68,172,100]\\n self.color255[22]=[111,197,131]\\n self.color255[23]=[85,188,255]\\n self.color255[24]=[0,145,30]\\n self.color255[25]=[214,230,130]\\n self.color255[26]=[218,255,255]\\n self.color255[27]=[170,250,250]\\n self.color255[28]=[140,224,228]\\n self.color255[29]=[188,65,28]\\n self.color255[30]=[216,191,216]\\n self.color255[31]=[145,60,66]\\n self.color255[32]=[150,98,83]\\n self.color255[33]=[250,250,225]\\n self.color255[34]=[200,200,215]\\n self.color255[35]=[68,131,98]\\n self.color255[36]=[83,146,164]\\n self.color255[37]=[162,115,105]\\n self.color255[38]=[141,93,137]\\n self.color255[39]=[182,166,110]\\n self.color255[40]=[188,135,166]\\n self.color255[41]=[154,150,201]\\n self.color255[42]=[177,140,190]\\n self.color255[43]=[30,111,85]\\n self.color255[44]=[210,157,166]\\n self.color255[45]=[48,129,126]\\n self.color255[46]=[98,153,112]\\n self.color255[47]=[69,110,53]\\n self.color255[48]=[166,113,137]\\n self.color255[49]=[122,101,38]\\n self.color255[50]=[253,135,192]\\n self.color255[51]=[145,92,109]\\n self.color255[52]=[46,101,131]\\n self.color255[53]=[0,108,112]\\n self.color255[54]=[127,150,88]\\n self.color255[55]=[159,116,163]\\n self.color255[56]=[125,102,154]\\n self.color255[57]=[106,174,155]\\n self.color255[58]=[154,146,83]\\n self.color255[59]=[126,126,55]\\n self.color255[60]=[201,160,133]\\n self.color255[61]=[78,152,141]\\n self.color255[62]=[174,140,103]\\n self.color255[63]=[139,126,177]\\n self.color255[64]=[148,120,72]\\n self.color255[65]=[186,135,135]\\n self.color255[66]=[99,106,24]\\n self.color255[67]=[156,171,108]\\n self.color255[68]=[64,123,147]\\n self.color255[69]=[138,95,74]\\n self.color255[70]=[97,113,158]\\n self.color255[71]=[126,161,197]\\n self.color255[72]=[194,195,164]\\n self.color255[73]=[88,106,215]\\n self.color255[74]=[82,174,128]\\n self.color255[75]=[57,157,110]\\n self.color255[76]=[60,143,83]\\n self.color255[77]=[92,162,109]\\n self.color255[78]=[255,244,209]\\n self.color255[79]=[201,121,77]\\n self.color255[80]=[70,163,117]\\n self.color255[81]=[188,91,95]\\n self.color255[82]=[166,84,94]\\n self.color255[83]=[182,105,107]\\n self.color255[84]=[229,147,118]\\n self.color255[85]=[174,122,90]\\n self.color255[86]=[201,112,73]\\n self.color255[87]=[194,142,0]\\n self.color255[88]=[241,213,144]\\n self.color255[89]=[203,179,77]\\n self.color255[90]=[229,204,109]\\n self.color255[91]=[255,243,152]\\n self.color255[92]=[209,185,85]\\n self.color255[93]=[248,223,131]\\n self.color255[94]=[255,230,138]\\n self.color255[95]=[196,172,68]\\n self.color255[96]=[255,255,167]\\n self.color255[97]=[255,250,160]\\n self.color255[98]=[255,237,145]\\n self.color255[99]=[242,217,123]\\n self.color255[100]=[222,198,101]\\n self.color255[101]=[213,124,109]\\n self.color255[102]=[184,105,108]\\n self.color255[103]=[150,208,243]\\n self.color255[104]=[62,162,114]\\n self.color255[105]=[242,206,142]\\n self.color255[106]=[250,210,139]\\n self.color255[107]=[255,255,207]\\n self.color255[108]=[182,228,255]\\n self.color255[109]=[175,216,244]\\n self.color255[110]=[197,165,145]\\n self.color255[111]=[172,138,115]\\n self.color255[112]=[202,164,140]\\n self.color255[113]=[224,186,162]\\n self.color255[114]=[255,245,217]\\n self.color255[115]=[206,110,84]\\n self.color255[116]=[210,115,89]\\n self.color255[117]=[203,108,81]\\n self.color255[118]=[233,138,112]\\n self.color255[119]=[195,100,73]\\n self.color255[120]=[181,85,57]\\n self.color255[121]=[152,55,13]\\n self.color255[122]=[159,63,27]\\n self.color255[123]=[166,70,38]\\n self.color255[124]=[218,123,97]\\n self.color255[125]=[225,130,104]\\n self.color255[126]=[224,97,76]\\n self.color255[127]=[184,122,154]\\n self.color255[128]=[211,171,143]\\n self.color255[129]=[47,150,103]\\n self.color255[130]=[173,121,88]\\n self.color255[131]=[188,95,76]\\n self.color255[132]=[255,239,172]\\n self.color255[133]=[226,202,134]\\n self.color255[134]=[253,232,158]\\n self.color255[135]=[244,217,154]\\n self.color255[136]=[205,179,108]\\n self.color255[137]=[186,124,161]\\n self.color255[138]=[255,255,220]\\n self.color255[139]=[234,234,194]\\n self.color255[140]=[204,142,178]\\n self.color255[141]=[180,119,153]\\n self.color255[142]=[216,132,105]\\n self.color255[143]=[255,253,229]\\n self.color255[144]=[205,167,142]\\n self.color255[145]=[204,168,143]\\n self.color255[146]=[255,224,199]\\n self.color255[147]=[139,150,98]\\n self.color255[148]=[249,180,111]\\n self.color255[149]=[157,108,162]\\n self.color255[150]=[203,136,116]\\n self.color255[151]=[185,102,83]\\n self.color255[152]=[247,182,164]\\n self.color255[153]=[222,154,132]\\n self.color255[154]=[124,186,223]\\n self.color255[155]=[249,186,150]\\n self.color255[156]=[244,170,147]\\n self.color255[157]=[255,181,158]\\n self.color255[158]=[255,190,165]\\n self.color255[159]=[227,153,130]\\n self.color255[160]=[213,141,113]\\n self.color255[161]=[193,123,103]\\n self.color255[162]=[216,146,127]\\n self.color255[163]=[230,158,140]\\n self.color255[164]=[245,172,147]\\n self.color255[165]=[241,172,151]\\n self.color255[166]=[177,124,92]\\n self.color255[167]=[171,85,68]\\n self.color255[168]=[217,198,131]\\n self.color255[169]=[212,188,102]\\n self.color255[170]=[185,135,134]\\n self.color255[171]=[198,175,125]\\n self.color255[172]=[194,98,79]\\n self.color255[173]=[255,238,170]\\n self.color255[174]=[206,111,93]\\n self.color255[175]=[216,186,0]\\n self.color255[176]=[255,226,77]\\n self.color255[177]=[255,243,106]\\n self.color255[178]=[255,234,92]\\n self.color255[179]=[240,210,35]\\n self.color255[180]=[224,194,0]\\n self.color255[181]=[213,99,79]\\n self.color255[182]=[217,102,81]\\n self.color255[183]=[0,147,202]\\n self.color255[184]=[0,122,171]\\n self.color255[185]=[186,77,64]\\n self.color255[186]=[240,255,30]\\n self.color255[187]=[185,232,61]\\n self.color255[188]=[0,226,255]\\n self.color255[189]=[251,159,255]\\n self.color255[190]=[230,169,29]\\n self.color255[191]=[0,194,113]\\n self.color255[192]=[104,160,249]\\n self.color255[193]=[221,108,158]\\n self.color255[194]=[137,142,0]\\n self.color255[195]=[230,70,0]\\n self.color255[196]=[0,147,0]\\n self.color255[197]=[0,147,248]\\n self.color255[198]=[231,0,206]\\n self.color255[199]=[129,78,0]\\n self.color255[200]=[0,116,0]\\n self.color255[201]=[0,0,255]\\n self.color255[202]=[157,0,0]\\n self.color255[203]=[100,100,130]\\n self.color255[204]=[205,205,100]\\n \\n return self.color255\",\n \"def color(value):\\r\\n return 'RGB({}, {}, {})'.format(value.red(), value.blue(), value.green())\",\n \"def color(c):\\n\\n if isinstance(c, tuple) and len(c) == 4:\\n return c\\n\\n if c is None:\\n return c\\n\\n if isinstance(c, basestring):\\n if c[0] == '#':\\n c = c[1:]\\n\\n if len(c) == 6:\\n r = int(c[0]+c[1], 16)\\n g = int(c[2]+c[3], 16)\\n b = int(c[4]+c[5], 16)\\n a = 255\\n elif len(c) == 8:\\n r = int(c[0]+c[1], 16)\\n g = int(c[2]+c[3], 16)\\n b = int(c[4]+c[5], 16)\\n a = int(c[6]+c[7], 16)\\n elif len(c) == 3:\\n r = int(c[0], 16) * 0x11\\n g = int(c[1], 16) * 0x11\\n b = int(c[2], 16) * 0x11\\n a = 255\\n elif len(c) == 4:\\n r = int(c[0], 16) * 0x11\\n g = int(c[1], 16) * 0x11\\n b = int(c[2], 16) * 0x11\\n a = int(c[3], 16) * 0x11\\n else:\\n raise Exception(\\\"Color string must be 3, 4, 6, or 8 hex digits long.\\\")\\n\\n return (r, g, b, a)\\n\\n raise Exception(\\\"Not a color: %r\\\" % (c,))\",\n \"def RGB(r, g, b):\\n rm = min(255, Int(r))\\n gm = min(255, Int(g))\\n bm = min(255, Int(b))\\n #\\n if rm < 0 or gm < 0 or bm < 0:\\n raise ValueError(\\\"RGB values must be >= 0, were (%s, %s, %s)\\\" % (r, g, b))\\n #\\n return ((bm * 256) + gm) * 256 + rm\",\n \"def rainbow_all(self):\\n while True:\\n for g in range(0, 255, 1):\\n self.BridgeObj.send_rgb_value(255, g, 0)\\n time.sleep(self.speed)\\n\\n for r in range(255, 0, -1):\\n self.BridgeObj.send_rgb_value(r, 255, 0)\\n time.sleep(self.speed)\\n\\n for b in range(0, 255, 1):\\n self.BridgeObj.send_rgb_value(0, 255, b)\\n time.sleep(self.speed)\\n\\n for g in range(255, 0, -1):\\n self.BridgeObj.send_rgb_value(0, g, 255)\\n time.sleep(self.speed)\\n\\n for r in range(0, 255, 1):\\n self.BridgeObj.send_rgb_value(r, 0, 255)\\n time.sleep(self.speed)\\n\\n for b in range(255, 0, -1):\\n self.BridgeObj.send_rgb_value(255, 0, b)\\n time.sleep(self.speed)\",\n \"def _color(self, args):\",\n \"def change(widget, colors): \\n\\t\\n new_val = '#'\\n for name in ('red', 'green', 'blue'):\\n new_val += colors[name].get()\\n widget['bg'] = new_val\",\n \"def rgb_pack(r: int, g: int, b: int) -> int:\\n rgb = (r << 16) | (g << 8) | b\\n return rgb\",\n \"def normalize_rgb_colors_to_hex(css):\\n log.debug(\\\"Converting all rgba to hexadecimal color values.\\\")\\n regex = re.compile(r\\\"rgb\\\\s*\\\\(\\\\s*([0-9,\\\\s]+)\\\\s*\\\\)\\\")\\n match = regex.search(css)\\n while match:\\n colors = map(lambda s: s.strip(), match.group(1).split(\\\",\\\"))\\n hexcolor = '#%.2x%.2x%.2x' % tuple(map(int, colors))\\n css = css.replace(match.group(), hexcolor)\\n match = regex.search(css)\\n return css\",\n \"def combine_colors(c1, c2, factor=0.5):\\n c3 = QtGui.QColor()\\n c3.setRed(int((factor * c1.red() + (1 - factor) * c2.red())))\\n c3.setGreen(int((factor * c1.green() + (1 - factor) * c2.green())))\\n c3.setBlue(int((factor * c1.blue() + (1 - factor) * c2.blue())))\\n return c3\",\n \"def combine_colors(c1, c2, factor=0.5):\\n c3 = QtGui.QColor()\\n c3.setRed(int((factor * c1.red() + (1 - factor) * c2.red())))\\n c3.setGreen(int((factor * c1.green() + (1 - factor) * c2.green())))\\n c3.setBlue(int((factor * c1.blue() + (1 - factor) * c2.blue())))\\n return c3\",\n \"def default_colors():\\n # default_colors = [\\n # # r, g, b, a\\n # [92, 192, 98, 0.5],\\n # [90, 155, 212, 0.5],\\n # [246, 236, 86, 0.6],\\n # [241, 90, 96, 0.4],\\n # [255, 117, 0, 0.3],\\n # [82, 82, 190, 0.2],\\n # ]\\n\\n default_colors = [\\n # r, g, b, a\\n [188, 114, 3, 0.5],\\n [3, 133, 188, 0.5],\\n [155, 9, 118, 0.6],\\n [155, 53, 9, 0.4],\\n [4, 140, 128, 0.3],\\n [140, 8, 8, 0.2],\\n ]\\n\\n default_colors = [\\n [i[0] / 255.0, i[1] / 255.0, i[2] / 255.0, i[3]]\\n for i in default_colors\\n ]\\n\\n return default_colors\",\n \"def reformatColor(self, colorStr):\\n if type(colorStr) is str:\\n if colorStr.startswith('#'):\\n colorStr = colorStr.replace('#', '')\\n else:\\n raise Exception('color is not hex format')\\n r = int(colorStr[:2], 16)\\n g = int(colorStr[2:4], 16)\\n b = int(colorStr[4:6], 16)\\n return r, g, b\",\n \"def from_rgb(r, g, b) -> str:\\n return \\\"#{0:02x}{1:02x}{2:02x}\\\".format(r, g, b)\",\n \"def _init_colors(self):\\n self.clr_primary = None\\n self.clr_secondary = 'green'\\n self.clr_tertiary = 'cyan'\\n self.clr_quaternary = 'yellow'\\n self.clr_bold = 'cyan'\\n self.clr_code = 'cyan'\\n self.clr_error = 'red'\\n self.clr_header = 'yellow'\\n self.clr_link = 'green'\\n self.clr_list = 'cyan'\\n self.clr_message = None\\n self.clr_num_comments = 'green'\\n self.clr_num_points = 'green'\\n self.clr_tag = 'cyan'\\n self.clr_time = 'yellow'\\n self.clr_title = None\\n self.clr_tooltip = None\\n self.clr_user = 'cyan'\\n self.clr_view_link = 'magenta'\\n self.clr_view_index = 'magenta'\",\n \"def fill_rgb(self, r, g, b, start=0, end=0):\\n if start < 0:\\n start = 0\\n if end == 0 or end > self.last_index:\\n end = self.last_index\\n for led in range(start, end + 1): # since 0-index include end in range\\n self.__set_internal(led, r, g, b)\",\n \"def glColor(self, r, g, b):\\n if 0 <= r <= 1 or 0 <= g <= 1 or 0 <= b <= 1:\\n self.vr = ceil(r * 255)\\n self.vg = ceil(g * 255)\\n self.vb = ceil(b * 255)\\n else:\\n print(\\\"Please insert numbers between 0 and 1\\\")\\n sys.exit()\",\n \"def get_color(self, value):\\n value = min(max(0,value), 1) * 510\\n\\n if value < 255:\\n redValue = 255\\n greenValue = math.sqrt(value) * 16\\n greenValue = int(greenValue)\\n else:\\n greenValue = 255\\n value = value - 255\\n redValue = 255 - (value * value / 255)\\n redValue = int(redValue)\\n return '#' + f\\\"{redValue:0{2}x}\\\" + f\\\"{greenValue:0{2}x}\\\" + '00'\",\n \"def glClearColor(self, r, g, b):\\n if 0 <= r <= 1 or 0 <= g <= 1 or 0 <= b <= 1:\\n self.r = ceil(r * 255)\\n self.g = ceil(g * 255)\\n self.b = ceil(b * 255)\\n else:\\n print(\\\"Please insert numbers between 0 and 1\\\")\\n sys.exit()\",\n \"def random_color():\\n colormode(255)\\n return randint(0, 255), randint(0, 255), randint(0, 255)\",\n \"def revert_color(cls, colors):\\n # 0.5 is to map the color to the center of the range\\n return [int((c+0.5) / cls.color_level * 256) for c in colors]\",\n \"def recolorRGV(src,dst):\\n b,g,r=cv2.split(src)\\n cv2.min(b,g,b) # min() function computes the per-element minimum of the first two arguments\\n # and writes them to the third argument\\n cv2.min(b,r,b)\\n cv2.merge((b,g,r),dest) # b is modified to the minimum of b,g,r at every pixel\",\n \"def set_pattern(colors=('green', 'blue', 'red')): # (10)\\n for i in range(0, int(ceil(float(NUM_LEDS)/float(len(colors))))):\\n for color in colors:\\n push_color(color)\",\n \"def _proc_color(self, tokens):\\n\\n keys = tokens.keys()\\n if \\\"red\\\" in keys: # RGB(A)\\n rr, gg, bb = tokens[\\\"red\\\"], tokens[\\\"green\\\"], tokens[\\\"blue\\\"]\\n hex2int = lambda h: int(h, 16)\\n if \\\"alpha\\\" in keys:\\n a = tokens[\\\"alpha\\\"]\\n c = str((hex2int(rr), hex2int(gg), hex2int(bb), hex2int(a)))\\n else:\\n c = str((hex2int(rr), hex2int(gg), hex2int(bb)))\\n elif \\\"hue\\\" in keys: # HSV\\n r, g, b = hsv_to_rgb(tokens[\\\"hue\\\"],\\n tokens[\\\"saturation\\\"],\\n tokens[\\\"value\\\"])\\n c = str((int(r*255), int(g*255), int(b*255)))\\n else:\\n c = tokens[\\\"color\\\"]\\n\\n return c\",\n \"def rgb_to_color(*rgb):\\n if(len(rgb)==1):\\n r,g,b = rgb[0]\\n else:\\n r,g,b = rgb\\n return \\\"#%02x%02x%02x\\\" % (r,g,b)\",\n \"def color_negative_red_positive_green(val):\\n if val < 0:\\n color = 'red'\\n elif val > 0:\\n color = 'green'\\n else:\\n color = 'black'\\n\\n return 'color: %s' % color\",\n \"def rgbToHex ( r, g = 0.0, b = 0.0 ):\\n # Check if argument is list\\n if isinstance(r, list):\\n g = r[1]\\n b = r[2]\\n r = r[0]\\n if isinstance( r, float ):\\n r *= 255.0\\n if isinstance( g, float ):\\n g *= 255.0\\n if isinstance( b, float ):\\n b *= 255.0\\n return \\\"%02x%02x%02x\\\" % ( round( r ), round( g ), round( b ))\",\n \"def calibrate_rgb(self, r, g, b):\\n new_r = r*self._calibrate[\\\"r\\\"] \\n new_g = g*self._calibrate[\\\"g\\\"]\\n new_b = b*self._calibrate[\\\"b\\\"]\\n return (new_r,new_g,new_b)\",\n \"def colorize(image, newColor):\\n image = image.copy()\\n\\n # zero out RGB values\\n image.fill((0, 0, 0, 255), None, pygame.BLEND_RGBA_MULT)\\n # add in new RGB values\\n image.fill(newColor[0:3] + [0,], None, pygame.BLEND_RGBA_ADD)\\n\\n return image\",\n \"def create_unique_color_uchar(tag, hue_step=0.41):\\n r, g, b = create_unique_color_float(tag, hue_step)\\n return int(255*r), int(255*g), int(255*b)\",\n \"def colormixer(colors, weights=None):\\n def _to_hex(v):\\n v_hex = hex(v)[2:]\\n if len(v_hex) == 1:\\n v_hex = \\\"0\\\" + v_hex\\n return v_hex\\n\\n # Compute mean intensities for red, green and blue\\n if weights is None:\\n r = int(np.mean([int(c[1:3], 16) for c in colors]))\\n g = int(np.mean([int(c[3:5], 16) for c in colors]))\\n b = int(np.mean([int(c[5:7], 16) for c in colors]))\\n else:\\n r = int(sum([int(c[1:3], 16) * w for c, w in zip(colors, weights)]) / sum(weights))\\n g = int(sum([int(c[3:5], 16) * w for c, w in zip(colors, weights)]) / sum(weights))\\n b = int(sum([int(c[5:7], 16) * w for c, w in zip(colors, weights)]) / sum(weights))\\n \\n # Take mean of each and convert back to hex\\n return '#' + _to_hex(r) + _to_hex(g) + _to_hex(b)\",\n \"def color_negative_red(val):\\n if val == 'k':\\n color = 'red' \\n else:\\n color = 'yellow'\\n return ['color: %s' % color]*3\",\n \"def get_rgb_normalized(r, g, b, a=1.0):\\n return r / 255.0, g / 255.0, b / 255.0, a\",\n \"def rgb_565(self):\\n return (\\n (int(self.red * 0xF800) & 0xF800) |\\n (int(self.green * 0x07E0) & 0x07E0) |\\n (int(self.blue * 0x001F) & 0x001F))\",\n \"def test_assembleColor(self):\\n self.assertEqual(\\n irc.assembleFormattedText(A.fg.red[A.bg.blue[\\\"hello\\\"]]),\\n \\\"\\\\x0f\\\\x0305,02hello\\\",\\n )\",\n \"def _from_rgb(self, rgb):\\r\\n return \\\"#%02x%02x%02x\\\" % rgb\",\n \"def create_color():\\n r = random.randint(0,255)\\n g = random.randint(0,255)\\n b = random.randint(0,255)\\n a = random.randint(0,255)\\n return introcs.RGB(r,g,b,a)\",\n \"def randcolor():\\n return (randint(0,255), randint(0,255), randint(0,255))\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.64377636","0.64377636","0.64377636","0.6364302","0.6349941","0.63338196","0.6211546","0.6143853","0.6105021","0.61023855","0.61022055","0.604399","0.60202074","0.59963423","0.5995744","0.5948604","0.5905812","0.59024096","0.5871113","0.5865381","0.58587396","0.5849928","0.5790233","0.577555","0.5775024","0.5770818","0.5755066","0.57245517","0.57170194","0.57158446","0.5676525","0.5671496","0.566357","0.56464934","0.56379133","0.56363493","0.5633417","0.5622261","0.5621576","0.5616633","0.5609301","0.56029654","0.5598874","0.55984074","0.5597183","0.5587633","0.5571618","0.55639","0.5560921","0.55603486","0.554384","0.55382043","0.55381936","0.5518484","0.5516351","0.5500107","0.5499479","0.54983604","0.547251","0.54699135","0.54627055","0.54474586","0.544473","0.54408187","0.54405797","0.54362816","0.5429488","0.5417087","0.5415945","0.5414931","0.54148436","0.5408335","0.54078317","0.5400248","0.5398956","0.5397154","0.5392102","0.53889227","0.5386328","0.5385033","0.53828776","0.537499","0.5371485","0.5370518","0.53659457","0.5362467","0.53580457","0.53577566","0.5354663","0.5349667","0.53404355","0.5336262","0.53360426","0.53359425","0.5335196","0.5334805","0.5333479","0.5330766","0.53269446","0.53252995"],"string":"[\n \"0.64377636\",\n \"0.64377636\",\n \"0.64377636\",\n \"0.6364302\",\n \"0.6349941\",\n \"0.63338196\",\n \"0.6211546\",\n \"0.6143853\",\n \"0.6105021\",\n \"0.61023855\",\n \"0.61022055\",\n \"0.604399\",\n \"0.60202074\",\n \"0.59963423\",\n \"0.5995744\",\n \"0.5948604\",\n \"0.5905812\",\n \"0.59024096\",\n \"0.5871113\",\n \"0.5865381\",\n \"0.58587396\",\n \"0.5849928\",\n \"0.5790233\",\n \"0.577555\",\n \"0.5775024\",\n \"0.5770818\",\n \"0.5755066\",\n \"0.57245517\",\n \"0.57170194\",\n \"0.57158446\",\n \"0.5676525\",\n \"0.5671496\",\n \"0.566357\",\n \"0.56464934\",\n \"0.56379133\",\n \"0.56363493\",\n \"0.5633417\",\n \"0.5622261\",\n \"0.5621576\",\n \"0.5616633\",\n \"0.5609301\",\n \"0.56029654\",\n \"0.5598874\",\n \"0.55984074\",\n \"0.5597183\",\n \"0.5587633\",\n \"0.5571618\",\n \"0.55639\",\n \"0.5560921\",\n \"0.55603486\",\n \"0.554384\",\n \"0.55382043\",\n \"0.55381936\",\n \"0.5518484\",\n \"0.5516351\",\n \"0.5500107\",\n \"0.5499479\",\n \"0.54983604\",\n \"0.547251\",\n \"0.54699135\",\n \"0.54627055\",\n \"0.54474586\",\n \"0.544473\",\n \"0.54408187\",\n \"0.54405797\",\n \"0.54362816\",\n \"0.5429488\",\n \"0.5417087\",\n \"0.5415945\",\n \"0.5414931\",\n \"0.54148436\",\n \"0.5408335\",\n \"0.54078317\",\n \"0.5400248\",\n \"0.5398956\",\n \"0.5397154\",\n \"0.5392102\",\n \"0.53889227\",\n \"0.5386328\",\n \"0.5385033\",\n \"0.53828776\",\n \"0.537499\",\n \"0.5371485\",\n \"0.5370518\",\n \"0.53659457\",\n \"0.5362467\",\n \"0.53580457\",\n \"0.53577566\",\n \"0.5354663\",\n \"0.5349667\",\n \"0.53404355\",\n \"0.5336262\",\n \"0.53360426\",\n \"0.53359425\",\n \"0.5335196\",\n \"0.5334805\",\n \"0.5333479\",\n \"0.5330766\",\n \"0.53269446\",\n \"0.53252995\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5423834"},"document_rank":{"kind":"string","value":"67"}}},{"rowIdx":94762,"cells":{"query":{"kind":"string","value":"Get the tokenized format_string. Tokenizing is resource intensive so we only do it once and cache it"},"document":{"kind":"string","value":"def tokens(self, format_string):\n if format_string not in self.format_string_cache:\n tokens = list(re.finditer(self.reg_ex, format_string))\n self.format_string_cache[format_string] = tokens\n return self.format_string_cache[format_string]"},"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_format(self, token):\n if token in self._formats:\n return self._formats[token]\n\n if self._style is None:\n result = self._get_format_from_document(token, self._document)\n else:\n result = self._get_format_from_style(token, self._style)\n\n self._formats[token] = result\n return result","def get_format(self):\n return self._format[0]","def get_format(cls):\n return cls._format","def reformat(ctx):\n pass","def token(self) -> str:","def _get_format_from_style(self, token, style):\n result = QtGui.QTextCharFormat()\n for key, value in style.style_for_token(token).items():\n if value:\n if key == 'color':\n result.setForeground(self._get_brush(value))\n elif key == 'bgcolor':\n result.setBackground(self._get_brush(value))\n elif key == 'bold':\n result.setFontWeight(QtGui.QFont.Bold)\n elif key == 'italic':\n result.setFontItalic(True)\n elif key == 'underline':\n result.setUnderlineStyle(\n QtGui.QTextCharFormat.SingleUnderline)\n elif key == 'sans':\n result.setFontStyleHint(QtGui.QFont.SansSerif)\n elif key == 'roman':\n result.setFontStyleHint(QtGui.QFont.Times)\n elif key == 'mono':\n result.setFontStyleHint(QtGui.QFont.TypeWriter)\n return result","def format(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"format\")","def get_text_format(self) -> constants.TextFormatStr:\n return constants.TEXT_FORMAT.inverse[self.textFormat()]","def get_template(self, format):\n for pattern, converter in self._patterns:\n if converter.format == format:\n template = pattern.generate('{name}')\n if template:\n return template\n return '{name}' f'.{format}'","def _get_format_from_document(self, token, document):\n code, html = next(self._formatter._format_lines([(token, u'dummy')]))\n self._document.setHtml(html)\n return QtGui.QTextCursor(self._document).charFormat()","def get_format(self):\n pass","def asformat(self, format):","def formatter(text):\n repl_map = {\n \"degC\": \"$^o$C\",\n \"K\": \"$^o$C\",\n \"month-1\": \"month$^{{-1}}$\",\n \"day-1\": \"day$^{{-1}}$\",\n \"d-1\": \"day$^{{-1}}$\",\n \"decade-1\": \"decade$^{{-1}}$\",\n \"year-1\": \"year$^{{-1}}$\",\n \"rcp85\": \"RCP8.5\",\n \"rcp45\": \"RCP4.5\",\n \"rcp26\": \"RCP2.6\",\n \"RCP85\": \"RCP8.5\",\n \"RCP45\": \"RCP4.5\",\n \"RCP26\": \"RCP2.6\",\n \"cmip5-85\": \"RCP8.5\",\n \"cmip5-60\": \"RCP6.0\",\n \"cmip5-45\": \"RCP4.5\",\n \"cmip5-26\": \"RCP2.6\",\n \"ssp585\": \"SSP5-8.5\",\n \"ssp245\": \"SSP2-4.5\",\n \"ssp126\": \"SSP1-2.6\",\n \"SSP585\": \"SSP5-8.5\",\n \"SSP245\": \"SSP2-4.5\",\n \"SSP126\": \"SSP1-2.6\",\n \"cmip6-85\": \"SSP5-8.5\",\n \"cmip6-70\": \"SSP3-7.0\",\n \"cmip6-60\": \"SSP4-6.0\",\n \"cmip6-34\": \"SSP4-3.4\",\n \"cmip6-45\": \"SSP2-4.5\",\n \"cmip6-26\": \"SSP1-2.6\",\n \"cmip6-19\": \"SSP1-1.9\",\n \"1\": \"%\",\n \"era5\": \"ERA5\",\n \"gpcc025x025_v8\": \"GPCC\",\n \"cru\": \"CRU\",\n \"jra55\": \"JRA55\",\n \"HIGHRESMIP\": \"HighResMIP\",\n \" \": \"\",\n }\n for key, val in repl_map.items():\n if key in text:\n text = text.replace(key, val)\n break\n return text","def token_lookup():\n Tokenize = {'.': '||Period||',\n '.': '||Period||',\n ',': '||Comma||',\n '\"': '||Quotation_Mark||', \n ';': '||Semicolon||', \n '!': '||Exclamation_mark||', \n '?': '||Question_mark||', \n '(': '||Left_Parentheses||', \n ')': '||Right_Parentheses||', \n '--': '||Dash||',\n '\\n': '||Return||'} \n \n return Tokenize","def tokenize_text(self, s):\n tokens = []\n # We could just have a \"while s:\" here instead of \"for line: while\n # line:\", but for really large log messages with heavy\n # tokenization, the cost in both performance and memory\n # consumption of the approach taken was atrocious.\n for line in s.replace(\"\\r\\n\", \"\\n\").split(\"\\n\"):\n line = line + \"\\n\"\n while line:\n best_match = best_conv = best_userdata = None\n for test in self._formatters:\n match = test[0].search(line)\n # If we find and match and (a) its our first one, or (b) it\n # matches text earlier than our previous best match, or (c) it\n # matches text at the same location as our previous best match\n # but extends to cover more text than that match, then this is\n # our new best match.\n #\n # Implied here is that when multiple formatters match exactly\n # the same text, the first formatter in the registration list wins.\n if match and (\n (best_match is None)\n or (match.start() < best_match.start())\n or (\n (match.start() == best_match.start())\n and (match.end() > best_match.end())\n )\n ):\n best_match = match\n best_conv = test[1]\n best_userdata = test[2]\n # If we found a match...\n if best_match:\n # ... add any non-matching stuff first, then the matching bit.\n start = best_match.start()\n end = best_match.end()\n if start > 0:\n tokens.append(\n _item(match=line[:start], converter=self.format_text, userdata=None)\n )\n tokens.append(\n _item(match=best_match, converter=best_conv, userdata=best_userdata)\n )\n line = line[end:]\n else:\n # Otherwise, just add the rest of the string.\n tokens.append(_item(match=line, converter=self.format_text, userdata=None))\n line = \"\"\n return ViewVCHtmlFormatterTokens(tokens)","def update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\n and token.group(\"key\") in placeholder_formats\n ):\n output.append(f\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\")\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def register_str_format(\n tag: Tag, conformer: Optional[Conformer] = None\n) -> Callable[[ValidatorFn], ValidatorFn]:\n\n def create_str_format(f: ValidatorFn) -> ValidatorFn:\n with _STR_FORMAT_LOCK:\n _STR_FORMATS[tag] = StrFormat(f, conformer=conformer)\n return f\n\n return create_str_format","def format(self):\n return self._format","def compile(format):\n try:\n return _cache[format]\n except KeyError:\n _cache[format] = retval = SF_Pattern.__new__(SF_Pattern, format)\n return retval","def initFormat(self):\n self.formatList = self.splitText(self.format)","def format_using_current_token(service, token_etag, token_name):\n is_current = is_service_current(service, token_etag, token_name)\n if is_current:\n return terminal.success('Current')\n else:\n return 'Not Current'","def _interpolate(format):\n from tokenize import tokenprog\n\n def matchorfail(text, pos):\n match = tokenprog.match(text, pos)\n if match is None:\n raise _ItplError(text, pos)\n return match, match.end()\n\n namechars = \"abcdefghijklmnopqrstuvwxyz\" \\\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\";\n chunks = []\n pos = 0\n\n while 1:\n dollar = format.find(\"$\", pos)\n if dollar < 0: \n break\n nextchar = format[dollar + 1]\n\n if nextchar == \"{\":\n chunks.append((0, format[pos:dollar]))\n pos, level = dollar + 2, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token == \"{\": \n level = level + 1\n elif token == \"}\": \n level = level - 1\n chunks.append((1, format[dollar + 2:pos - 1]))\n\n elif nextchar in namechars:\n chunks.append((0, format[pos:dollar]))\n match, pos = matchorfail(format, dollar + 1)\n while pos < len(format):\n if format[pos] == \".\" and \\\n pos + 1 < len(format) and format[pos + 1] in namechars:\n match, pos = matchorfail(format, pos + 1)\n elif format[pos] in \"([\":\n pos, level = pos + 1, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token[0] in \"([\": \n level = level + 1\n elif token[0] in \")]\": \n level = level - 1\n else: \n break\n chunks.append((1, format[dollar + 1:pos]))\n else:\n chunks.append((0, format[pos:dollar + 1]))\n pos = dollar + 1 + (nextchar == \"$\")\n\n if pos < len(format): \n chunks.append((0, format[pos:]))\n return chunks","def format( self ) :\n\n return( self.__format )","def format(self):\n return self[\"format\"]","def format(self):\n return self[\"format\"]","def get_formatted_string(self, input_string):\n if isinstance(input_string, str):\n try:\n return self.get_processed_string(input_string)\n except KeyError as err:\n # Wrapping the KeyError into a less cryptic error for end-user\n # friendliness\n missing_key = err.args[0]\n raise KeyNotInContextError(\n f'Unable to format \\'{input_string}\\' with '\n f'{{{missing_key}}}, because '\n f'context[\\'{missing_key}\\'] doesn\\'t exist') from err\n else:\n raise TypeError(f\"can only format on strings. {input_string} is a \"\n f\"{type(input_string)} instead.\")","def get_formatter(self, group):\n return getattr(self, \"format_\" + group + \"_standings\")","def re_format(self):\n return self._re.pattern","def format(self) -> str:","def formatted(s):\n matches = re.findall(_format_re, normalize(s))\n if len(matches) == 1 and matches[0][0] != '':\n return matches[0][0]\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\n if txt_none != '':\n return FORMAT_NONE, txt_none\n elif txt_sw != '':\n return FORMAT_SW, txt_sw\n elif txt_rem != '':\n return FORMAT_REM, txt_rem\n elif txt_em != '':\n return FORMAT_EM, txt_em\n elif txt_a != '':\n return FORMAT_A, txt_a\n return [to_fmt(*m) for m in matches]","def format(self) -> str:\n return pulumi.get(self, \"format\")","def formatsrc(self):\n return self[\"formatsrc\"]","def formatsrc(self):\n return self[\"formatsrc\"]","def get_formatter(style):\n if style == 'authoryear':\n return AuthorYearFormatter\n return AuthorYearFormatter","def get_processed_string(self, input_string):\n if input_string[:6] == '[sic]\"':\n return input_string[6: -1]\n else:\n return input_string.format(**self)","def __format__(self, format_spec):\n if format_spec == \"polite\":\n return self.polite\n elif format_spec == \"casual\":\n return self.casual\n else:\n # Using string addition here to avoid triggering flake8-sfs\n # while still giving a meaningful self-contained example:\n raise ValueError(format_spec + \" not a format defined by Client object\")","def get_format_identifier(self, message_type: str) -> str:","def __init__(self, format_string):\r\n if not isinstance(format_string, Compatibility.string):\r\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\r\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\r\n self._re = re.compile(self._re_pattern)","def get(self):\n return get_msg_form(config['format_path'])","def getFormatManager(self) -> ghidra.app.util.viewer.format.FormatManager:\n ...","def __normalize(self, ctx: commands.Context, format: str) -> str:\n\t\t# convert to lowercase\n\t\tlower_format = format.lower()\n\t\t# check if inputted format is recognized\n\t\tif lower_format in self.formats:\n\t\t\treturn lower_format\n\t\t# check for aliases\n\t\telif lower_format in self.aliases:\n\t\t\treturn self.aliases[lower_format]\n\t\t# format is not recognized\n\t\telse:\n\t\t\traise FriendlyError(\n\t\t\t\tf\"'{format}' is not a recognized format.\", ctx.channel, ctx.author\n\t\t\t)","def get_format(fstr):\n fstr = fstr.lower() # support uppercase letters\n if os.sep in fstr:\n fstr = fstr.split(os.sep)[-1]\n try:\n fname, ext = fstr.split(\".\", 1)\n except:\n fname, ext = (\"\", \"\")\n\n if ext.startswith(\"bm\"):\n return FORMAT_BMP\n elif ext == \"txt\":\n return FORMAT_CAR\n elif ext == \"ta.csv\":\n return FORMAT_TA_CSV\n elif ext == \"fin\":\n return FORMAT_FIN\n elif ext == \"hul\":\n return FORMAT_HUL\n elif ext in [\"ncp\"]:\n return FORMAT_NCP\n elif ext in [\"prm\", \"m\"]:\n return FORMAT_PRM\n elif ext == \"rim\":\n return FORMAT_RIM\n elif ext == \"w\":\n return FORMAT_W\n else:\n return FORMAT_UNK","def assign_format(self):\n if self.is_output or self.is_req_output:\n if self.pname in self.tool_data[self.tool_name]['output_fmt']:\n return self.tool_data[self.tool_name]['output_fmt'][self.pname]\n elif self.pname in self.gen_out_fmt:\n return self.gen_out_fmt[self.pname]\n elif self.is_input:\n if self.pname in self.tool_data[self.tool_name]['input_fmt']:\n print(self.tool_data[self.tool_name])\n return self.tool_data[self.tool_name]['input_fmt'][self.pname]\n elif self.pname in self.gen_in_fmt:\n return self.gen_in_fmt[self.pname]\n else:\n # Not sure yet what this will be used for, but I think we need it.\n return ''","def format_string(s, formatter='minimal'):\n if not callable(formatter):\n formatter = get_formatter_for_name(formatter)\n if formatter is None:\n output = s\n else:\n output = formatter(s)\n return output","def format(self):\n return self.getparam(\"FORMAT\")","def format(self):\n return self.getparam(\"FORMAT\")","def read_fmt(bib_name, bib_file):\n cache_name, formatted_cache_name = _cache_name(bib_name, bib_file)\n\n try:\n meta_data, formatted_entries = cache.read_global(formatted_cache_name)\n except:\n raise cache.CacheMiss()\n\n # raise a cache miss if the modification took place after the caching\n modified_time = os.path.getmtime(bib_file)\n if modified_time > meta_data[\"cache_time\"]:\n raise cache.CacheMiss()\n\n # validate the version and format strings are still valid\n if (meta_data[\"version\"] != _VERSION or\n any(meta_data[s] != get_setting(\"cite_\" + s)\n for s in [\"panel_format\", \"autocomplete_format\"])):\n print(\"Formatting string has changed, updating cache...\")\n # read the base information from the unformatted cache\n current_time, bib_entries = cache.read_global(cache_name)\n # format and cache the entries\n formatted_entries = _create_formatted_entries(formatted_cache_name,\n bib_entries,\n current_time)\n\n return formatted_entries","def token(self):\n if not hasattr(self,'_tokens'):\n ts = str(time.time())\n rs = str(random.randint(1234,65535))\n self._tokens = '%s_%s_%s' % (self.key().name(),ts,rs)\n return self._tokens","def _process_str(self, fmt, *args, **kwargs):\n log_str = fmt\n if len(args) > 0 or len(kwargs) > 0:\n log_str = fmt.format(*args, **kwargs)\n\n return log_str","def _get_format(value, quote_mode='always'):\n\n formats = {'always': '{key}=\"{value}\"\\n', 'auto': '{key}={value}\\n'}\n\n if quote_mode not in formats.keys():\n return KeyError(f'quote_mode {quote_mode} is invalid')\n\n _mode = quote_mode\n if quote_mode == 'auto' and ' ' in value:\n _mode = 'always'\n return formats.get(_mode)","def format(self) -> pulumi.Output[Optional['outputs.FlowLogFormatParametersResponse']]:\n return pulumi.get(self, \"format\")","def from_tokens(\n output: RenderOutput,\n *,\n consecutive_numbering: bool = True,\n warning_stream: Optional[IO] = None,\n) -> str:\n md_renderer = MDRenderer()\n # TODO option for consecutive numbering consecutive_numbering, etc\n options = {\n \"parser_extension\": [\n PARSER_EXTENSIONS[name]\n for name in [\"myst\", \"tables\", \"frontmatter\", \"deflist\"]\n ]\n + [AdditionalRenderers],\n \"mdformat\": {\"number\": consecutive_numbering},\n }\n\n # temporarily redirect mdformat logging\n warning_handler = None\n if warning_stream:\n warning_handler = logging.StreamHandler(warning_stream)\n warning_handler.setLevel(logging.WARNING)\n LOGGER.addHandler(warning_handler)\n try:\n # mdformat outputs only used reference definitions during 'finalize'\n # instead we want to output all parsed reference definitions\n text = md_renderer.render(output.tokens, options, output.env, finalize=False)\n if output.env[\"references\"]:\n if text:\n text += \"\\n\\n\"\n output.env[\"used_refs\"] = set(output.env[\"references\"])\n text += md_renderer._write_references(output.env)\n finally:\n if warning_handler:\n LOGGER.removeHandler(warning_handler)\n if text:\n text += \"\\n\"\n return text","def handleFormatText(paragraphContent):\n # We tokenize and remove the stop word\n words = tokenizeWord(paragraphContent) \n \n stemWords = []\n # We loop on each word.\n for word in words:\n stemWord = STEMMER.stem(word)\n \n # Selection on a part of string.\n stemWord = re.sub(\"[*\\'\\.+:,\\`:/]\", '', stemWord)\n if stemWord.isdigit() or len(stemWord) < 2:\n continue\n \n stemWords.append(stemWord)\n my_r_string = stemWords.pop(0)\n for word in stemWords:\n my_r_string += \" \"+str(word)\n return my_r_string","def get_timestamp(format_str=\"%Y%m%d_%H-%M-%S\"):\n now = datetime.now()\n current_timestamp = now.strftime(format_str)\n\n return current_timestamp","def extract_pattern(fmt):\n class FakeDict(object):\n def __init__(self):\n self.seen_keys = set()\n\n def __getitem__(self, key):\n self.seen_keys.add(key)\n return ''\n\n def keys(self):\n return self.seen_keys\n\n fake = FakeDict()\n try:\n fmt % fake\n except TypeError:\n # Formatting error\n pass\n return set(fake.keys())","def token_str(self) -> Optional[str]:\n return self._token_str","def get_placeholder_formats_list(self, format_string):\n placeholders = []\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.append((token.group(\"key\"), token.group(\"format\")))\n return placeholders","def strfdate(self, fmt):\n pattern = r'%({})'.format(reduce(lambda x, y: '{}|{}'.format(x, y), FORMAT_MAP.keys()))\n for f in re.findall(pattern, fmt):\n fmt = fmt.replace('%{}'.format(f), FORMAT_MAP[f](self))\n return fmt","def format(self, tweet):\n return self._format_string.format(tweet=tweet)","def _get_token(self):\n # Skip initial whitespace.\n pos = self._skip_whitespace()\n\n # Find the token here, if there's one.\n token = None\n\n for (token_type, regex) in TOKEN_REGEXEN:\n re_match = regex.match(self.body, pos)\n if re_match:\n token_content = next(g for g in re_match.groups() if g is not None)\n token = Token(token_type, token_content, re_match.end())\n break\n\n return token","def getCachedToken( self ):\n if ( os.path.exists( TOKEN_PATH )):\n return open( TOKEN_PATH ).read()\n else :\n return None","def _parse(self, fmtstr):\n def _match_brace(string, start_pos, pair='[]'):\n \"\"\"Pairing brackets (used internally in _parse method)\"\"\"\n depth = 1\n if string[start_pos] != pair[0]:\n return None\n for index, char in enumerate(string[start_pos + 1:]):\n if char == pair[0]:\n depth += 1\n elif char == pair[1]:\n depth -= 1\n if depth == 0:\n return start_pos + index + 1\n return None\n\n #----------------------------------------------------------------------\n\n t_fmt = self.__class__._T_FMT\n t_prefix = self.__class__._T_PREFIX\n\n ptr = 0\n # it seems that field id 0 is invalid\n field_id = 1\n length = len(fmtstr)\n parsed_list = []\n\n while ptr < length:\n parsed = {}\n m_prefix = t_prefix.match(fmtstr[ptr:])\n if m_prefix:\n ptr += _get_length_of_match(m_prefix)\n parsed['prefix'] = m_prefix.group(1)\n\n # check if we have a nested structure\n if m_prefix.group(2):\n brace_offset = _match_brace(fmtstr, ptr - 1)\n\n # bracket not match\n if not brace_offset:\n raise BadFormatString(\n 'Unmatched brace on position {0}'.format(ptr)\n )\n parsed['field_id'] = field_id\n parsed['field_type'] = 'a'\n parsed['subcontent'] = self._parse(\n fmtstr[ptr:brace_offset]\n )\n ptr = brace_offset + 1\n field_id += 1\n\n parsed_list.append(parsed)\n continue\n m_fmt = t_fmt.match(fmtstr[ptr:])\n if m_fmt:\n ptr += _get_length_of_match(m_fmt)\n\n # fmt is an alias\n if m_fmt.group(2):\n parsed['field_type'] = self.__class__\\\n .FIELD_ALIAS[m_fmt.group(2)]\n # fmt is an actual field type\n elif m_fmt.group(1):\n parsed['field_type'] = m_fmt.group(1)\n\n # save field id\n parsed['field_id'] = field_id\n\n # check for type clones (e.g. `v3')\n if m_fmt.group(3):\n parsed['repeat'] = int(m_fmt.group(3))\n field_id += int(m_fmt.group(3))\n else:\n parsed['repeat'] = 1\n field_id += 1\n\n parsed_list.append(parsed)\n\n else:\n raise BadFormatString(\n 'Invalid token on position {0}'.format(ptr)\n )\n\n # all set\n return parsed_list","def get_format_table(self):\n try:\n with open(self._config.values['format'], 'r') as f:\n return f.read()\n except:\n return None","def format(self) -> str:\n return self._format","def format(self) -> str:\n return self._format","def format(self) -> Optional[pulumi.Input['FlowLogFormatParametersArgs']]:\n return pulumi.get(self, \"format\")","def _tokenize(source):\n lines = source.split(\"\\n\")\n print(\n \"{type:<10}{string:<25} {start:^12} {end:^12}\".format(\n type=\"Type\", string=\"String\", start=\"Start\", end=\"End\"\n )\n )\n print(\"-\" * 60)\n for line in lines:\n tokens = collect_tokens(line)\n for token in tokens:\n print(token)","def get_token(self):\n return self.__token","def get_token(self):\n return self.__token","def string_val(self) -> str:\n return self.current_token","def token(self) -> str:\n raise NotImplementedError","def formatted(self) -> str:\r\n ...","def get_token(word, flag):\n if flag == 1:\n return \"_RARE_\"\n elif flag == 2:\n if bool(re.search(r'\\d', word)):\n return \"AlphaNum\"\n else:\n return \"oThEr\"\n elif flag == 3:\n if word[-3:] == \"ing\":\n return \"enDiNg\"\n else:\n return \"oThEr\"","def _read_token(token_file):\n try:\n return _fortworth.read(token_file).strip()\n except FileNotFoundError:\n raise _errors.TokenNotFoundError(token_file)","def format(fmt, st):\n ret = \"\"\n if not st: return ret\n if fmt not in valid_combos:\n return st\n cm = charmap[fmt]\n for c in st:\n ret += cm.get(c, c)\n return ret","def token(uncapped_token):\n return uncapped_token","def get_retokenized(tokenizer, text):\n return ' '.join(tokenizer.tokenize(text))","def _tokenize(self, _string):\n return re.search(self._access_log_regex, _string)","def token_lookup():\n token_dict = {}\n token_dict['.'] = \"||Period||\"\n token_dict[','] = \"||Comma||\"\n token_dict['\"'] = \"||Quotation_Mark||\"\n token_dict[';'] = \"||Semicolon||\"\n token_dict['!'] = \"||Exclamation_Mark||\"\n token_dict['?'] = \"||Question_Mark||\"\n token_dict['('] = \"||Left_Parentheses||\"\n token_dict[')'] = \"||Right_Parentheses||\"\n token_dict['--'] = \"||Dash||\"\n token_dict['\\n'] = \"||Return||\"\n\n return token_dict","def get(self):\n return get_msg_form(config['msg_format_path'])","def formats():\n return _FORMATS","def _handle_token(self, token: str) -> Optional[str]:\n return token","def read_token(self):\n self._skip_white_space()\n return self._get_token()","def __format__(self, format_spec):\n # This calls the compiled regex stored on ANSIString's class to analyze the format spec.\n # It returns a dictionary.\n format_data = self.re_format.match(format_spec).groupdict()\n clean = self.clean()\n base_output = ANSIString(self.raw())\n align = format_data.get(\"align\", \"<\")\n fill = format_data.get(\"fill\", \" \")\n\n # Need to coerce width into an integer. We can be certain that it's numeric thanks to regex.\n width = format_data.get(\"width\", None)\n if width is None:\n width = len(clean)\n else:\n width = int(width)\n\n if align == \"<\":\n base_output = self.ljust(width, fill)\n elif align == \">\":\n base_output = self.rjust(width, fill)\n elif align == \"^\":\n base_output = self.center(width, fill)\n elif align == \"=\":\n pass\n\n # Return the raw string with ANSI markup, ready to be displayed.\n return base_output.raw()","def get_format(request, default='html'):\n format_ = request.GET.get('format', None)\n if not format_:\n format_ = request.GET.get('view', default)\n return format_","def format_to_extension(self, format):","def formatEditText(self, storedText):\n format = globalref.options.strData('EditDateFormat', True)\n try:\n return (GenDate(storedText).dateStr(format), True)\n except GenDateError:\n return (storedText, not storedText)","def formatLookup(format_str):\n pat = '(\\d+)([A-Z])'\n match = re.search(pat, format_str)\n #print match.group()\n \n data_len = int(match.group(1))\n data_fmt = str(match.group(2))\n np_fmt = fitsFormatLookup(data_fmt)\n np_dtype = '%i%s'%(data_len, np_fmt)\n \n return np_dtype, data_len, np_fmt","def parser_formatter(format_class, **kwargs):\n try:\n return lambda prog: format_class(prog, **kwargs)\n except TypeError:\n return format_class","def parser_formatter(format_class, **kwargs):\n try:\n return lambda prog: format_class(prog, **kwargs)\n except TypeError:\n return format_class","def _translate_fmts(self):\n fmt_info = []\n fmt_append = fmt_info.append\n \n isvalid = self._is_valid_fmt\n typlist = self._typlist\n isstrvar = self._isstrvar\n default_fmts = self._default_fmts\n \n for i, fmt in enumerate(self._fmtlist):\n fmt = fmt.strip()\n \n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\n \n if iscalendar or not isvalid(fmt):\n if isstrvar(i):\n wid = min(typlist[i], 10)\n fmt_append(('s', \"{{:>{}s}}\".format(wid), wid))\n continue\n else:\n fmt = default_fmts[typlist[i]]\n \n last_char = fmt[-1]\n if last_char == 's': # string\n m = STR_FMT_RE.match(fmt)\n align, _, wid = m.group(1), m.group(2), m.group(3)\n new_align = (\"<\" if align == \"-\" \n else \"^\" if align == \"~\" else \">\")\n new = \"\".join((\"{:\", new_align, wid, \"s}\"))\n fmt_append(('s', new, int(wid)))\n elif last_char == 'H' or last_char == 'L': # binary\n fmt_append((last_char, fmt, int(fmt[1:-1])))\n elif last_char == 'x': # hexadecimal\n fmt_append(('x', fmt, 21))\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\n m = NUM_FMT_RE.match(fmt)\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \n m.group(3), m.group(4),\n m.group(5), m.group(6),\n m.group(7))\n aln = \"<\" if align == \"-\" else \">\"\n sep = \",\" if com is not None else \"\"\n if type == \"g\" and int(prec) == 0:\n new = \"\".join((\"{:\", aln, wid, sep, type, \"}\"))\n else:\n new = \"\".join((\"{:\", aln, wid, sep, \".\", prec, type, \"}\"))\n fmt_append((type, new, int(wid), delim, com))\n \n return fmt_info","def parse_token(bn,token):\n return bn.split(token)[1].split('_')[0]","def format(self):\n ...","def get_format_type(self):\n raise Unimplemented()","def GetFormatCount(format_):\n\n if isinstance(format_, str):\n match = re.search(r'\\s*(\\d+)', format_)\n if match:\n return int(match.group(0))\n\n return 1","def _get_token(self):\n self._skip()\n\n token = None\n # Checks single-quoted string.\n if self.current_char == \"'\":\n start_position = self.current_position\n while not (self.current_char != \"\\\\\" and self._peek() == \"'\"):\n self._next_char()\n if self.EOF:\n raise LexerError(\n start_position, f\"EOL while scanning string literal at position {start_position}\")\n self._next_char()\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\n _token_names.STRING, self.stream[start_position:self.current_position + 1])\n\n # Checks double-quoted string.\n elif self.current_char == '\"':\n start_position = self.current_position\n while not (self.current_char != \"\\\\\" and self._peek() == '\"'):\n self._next_char()\n if self.EOF:\n raise LexerError(\n start_position, f\"EOL while scanning string literal at position {start_position}\")\n self._next_char()\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\n _token_names.STRING, self.stream[start_position:self.current_position + 1])\n\n # Checks number begins with a digit.\n elif self.current_char.isdigit():\n start_position = self.current_position\n while self._peek().isdigit():\n self._next_char()\n if self._peek() == \".\":\n self._next_char()\n while self._peek().isdigit():\n self._next_char()\n if self._peek() in [\"d\", \"D\", \"f\", \"F\"]:\n self._next_char()\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\n _token_names.NUMBER, self.stream[start_position:self.current_position + 1])\n\n # Checks number begins with a dot.\n elif self.current_char == \".\":\n if self._peek().isdigit():\n start_position = self.current_position\n while self._peek().isdigit():\n self._next_char()\n if self._peek() in [\"d\", \"D\", \"f\", \"F\"]:\n self._next_char()\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\n _token_names.NUMBER, self.stream[start_position:self.current_position + 1])\n else:\n token = Token(self.line_number, self.line_start_position, self.current_position, self.current_position,\n _token_names.Separators(self.current_char).name, self.current_char)\n\n # Checks word begins with an alphabetic letter or an underscore.\n elif self.current_char.isalpha() or self.current_char == \"_\":\n start_position = self.current_position\n while True:\n if (self._peek() in [\" \", \"\\t\", \"\\r\", \"\\n\", \"\\0\"]\n or self._peek() in _token_names.SEPARATORS\n or self._peek() in _token_names.OPERATORS):\n break\n self._next_char()\n word = self.stream[start_position:self.current_position + 1]\n # Checks if word is a keyword.\n if word in _token_names.Keywords.values():\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\n _token_names.Keywords(word).name, word)\n elif word in _token_names.KeywordsType.values():\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\n _token_names.KeywordsType(word).name, word)\n elif word in _token_names.KeywordsAttribute.values():\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\n _token_names.KeywordsAttribute(word).name, word)\n # Otherwise put it as identifier.\n else:\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\n _token_names.IDENTIFIER, word)\n\n # Checks if is a separator.\n elif self.current_char in _token_names.Separators.values():\n token = Token(self.line_number, self.line_start_position, self.current_position, self.current_position,\n _token_names.Separators(self.current_char).name, self.current_char)\n\n # Checks if is an operator.\n elif self.current_char in _token_names.Operators.values():\n last_position = self.current_position\n if self.current_char not in [\"&\", \"|\"] and self._peek() == \"=\":\n val = self.current_char + self._peek()\n self._next_char()\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\n _token_names.Operators(val).name, val)\n elif self.current_char == \"+\" and self._peek() == \"+\":\n val = self.current_char + self._peek()\n self._next_char()\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\n _token_names.Operators(val).name, val)\n elif self.current_char == \"-\" and self._peek() == \"-\":\n val = self.current_char + self._peek()\n self._next_char()\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\n _token_names.Operators(val).name, val)\n elif self.current_char == \"&\" and self._peek() == \"&\":\n val = self.current_char + self._peek()\n self._next_char()\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\n _token_names.Operators(val).name, val)\n elif self.current_char == \"|\" and self._peek() == \"|\":\n val = self.current_char + self._peek()\n self._next_char()\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\n _token_names.Operators(val).name, val)\n else:\n token = Token(self.line_number, self.line_start_position, self.current_position, self.current_position,\n _token_names.Operators(self.current_char).name, self.current_char)\n\n # Checks if is EOF\n elif self.current_char == \"\\0\":\n token = Token(self.line_number, self.line_start_position, self.current_position, self.current_position,\n _token_names.EOF, self.current_char)\n\n # Raise error if is an unknown token.\n else:\n raise LexerError(self.current_position)\n\n self._next_char()\n return token","def format(self, *args, **kwargs) -> String:\n pass","def tokenize(*args, **kwargs):\n if kwargs.pop('pure', False):\n return base.tokenize(*args)\n else:\n return str(uuid.uuid4())","def _get_name_from_url(self, request):\n\n format = request.GET.get('format', None)\n if not format:\n match = self._format_query_pattern.match(request.path)\n if match and match.group('format'):\n format = match.group('format')\n return format","def initFormat(self):\n pass"],"string":"[\n \"def _get_format(self, token):\\n if token in self._formats:\\n return self._formats[token]\\n\\n if self._style is None:\\n result = self._get_format_from_document(token, self._document)\\n else:\\n result = self._get_format_from_style(token, self._style)\\n\\n self._formats[token] = result\\n return result\",\n \"def get_format(self):\\n return self._format[0]\",\n \"def get_format(cls):\\n return cls._format\",\n \"def reformat(ctx):\\n pass\",\n \"def token(self) -> str:\",\n \"def _get_format_from_style(self, token, style):\\n result = QtGui.QTextCharFormat()\\n for key, value in style.style_for_token(token).items():\\n if value:\\n if key == 'color':\\n result.setForeground(self._get_brush(value))\\n elif key == 'bgcolor':\\n result.setBackground(self._get_brush(value))\\n elif key == 'bold':\\n result.setFontWeight(QtGui.QFont.Bold)\\n elif key == 'italic':\\n result.setFontItalic(True)\\n elif key == 'underline':\\n result.setUnderlineStyle(\\n QtGui.QTextCharFormat.SingleUnderline)\\n elif key == 'sans':\\n result.setFontStyleHint(QtGui.QFont.SansSerif)\\n elif key == 'roman':\\n result.setFontStyleHint(QtGui.QFont.Times)\\n elif key == 'mono':\\n result.setFontStyleHint(QtGui.QFont.TypeWriter)\\n return result\",\n \"def format(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"format\\\")\",\n \"def get_text_format(self) -> constants.TextFormatStr:\\n return constants.TEXT_FORMAT.inverse[self.textFormat()]\",\n \"def get_template(self, format):\\n for pattern, converter in self._patterns:\\n if converter.format == format:\\n template = pattern.generate('{name}')\\n if template:\\n return template\\n return '{name}' f'.{format}'\",\n \"def _get_format_from_document(self, token, document):\\n code, html = next(self._formatter._format_lines([(token, u'dummy')]))\\n self._document.setHtml(html)\\n return QtGui.QTextCursor(self._document).charFormat()\",\n \"def get_format(self):\\n pass\",\n \"def asformat(self, format):\",\n \"def formatter(text):\\n repl_map = {\\n \\\"degC\\\": \\\"$^o$C\\\",\\n \\\"K\\\": \\\"$^o$C\\\",\\n \\\"month-1\\\": \\\"month$^{{-1}}$\\\",\\n \\\"day-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"d-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"decade-1\\\": \\\"decade$^{{-1}}$\\\",\\n \\\"year-1\\\": \\\"year$^{{-1}}$\\\",\\n \\\"rcp85\\\": \\\"RCP8.5\\\",\\n \\\"rcp45\\\": \\\"RCP4.5\\\",\\n \\\"rcp26\\\": \\\"RCP2.6\\\",\\n \\\"RCP85\\\": \\\"RCP8.5\\\",\\n \\\"RCP45\\\": \\\"RCP4.5\\\",\\n \\\"RCP26\\\": \\\"RCP2.6\\\",\\n \\\"cmip5-85\\\": \\\"RCP8.5\\\",\\n \\\"cmip5-60\\\": \\\"RCP6.0\\\",\\n \\\"cmip5-45\\\": \\\"RCP4.5\\\",\\n \\\"cmip5-26\\\": \\\"RCP2.6\\\",\\n \\\"ssp585\\\": \\\"SSP5-8.5\\\",\\n \\\"ssp245\\\": \\\"SSP2-4.5\\\",\\n \\\"ssp126\\\": \\\"SSP1-2.6\\\",\\n \\\"SSP585\\\": \\\"SSP5-8.5\\\",\\n \\\"SSP245\\\": \\\"SSP2-4.5\\\",\\n \\\"SSP126\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-85\\\": \\\"SSP5-8.5\\\",\\n \\\"cmip6-70\\\": \\\"SSP3-7.0\\\",\\n \\\"cmip6-60\\\": \\\"SSP4-6.0\\\",\\n \\\"cmip6-34\\\": \\\"SSP4-3.4\\\",\\n \\\"cmip6-45\\\": \\\"SSP2-4.5\\\",\\n \\\"cmip6-26\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-19\\\": \\\"SSP1-1.9\\\",\\n \\\"1\\\": \\\"%\\\",\\n \\\"era5\\\": \\\"ERA5\\\",\\n \\\"gpcc025x025_v8\\\": \\\"GPCC\\\",\\n \\\"cru\\\": \\\"CRU\\\",\\n \\\"jra55\\\": \\\"JRA55\\\",\\n \\\"HIGHRESMIP\\\": \\\"HighResMIP\\\",\\n \\\" \\\": \\\"\\\",\\n }\\n for key, val in repl_map.items():\\n if key in text:\\n text = text.replace(key, val)\\n break\\n return text\",\n \"def token_lookup():\\n Tokenize = {'.': '||Period||',\\n '.': '||Period||',\\n ',': '||Comma||',\\n '\\\"': '||Quotation_Mark||', \\n ';': '||Semicolon||', \\n '!': '||Exclamation_mark||', \\n '?': '||Question_mark||', \\n '(': '||Left_Parentheses||', \\n ')': '||Right_Parentheses||', \\n '--': '||Dash||',\\n '\\\\n': '||Return||'} \\n \\n return Tokenize\",\n \"def tokenize_text(self, s):\\n tokens = []\\n # We could just have a \\\"while s:\\\" here instead of \\\"for line: while\\n # line:\\\", but for really large log messages with heavy\\n # tokenization, the cost in both performance and memory\\n # consumption of the approach taken was atrocious.\\n for line in s.replace(\\\"\\\\r\\\\n\\\", \\\"\\\\n\\\").split(\\\"\\\\n\\\"):\\n line = line + \\\"\\\\n\\\"\\n while line:\\n best_match = best_conv = best_userdata = None\\n for test in self._formatters:\\n match = test[0].search(line)\\n # If we find and match and (a) its our first one, or (b) it\\n # matches text earlier than our previous best match, or (c) it\\n # matches text at the same location as our previous best match\\n # but extends to cover more text than that match, then this is\\n # our new best match.\\n #\\n # Implied here is that when multiple formatters match exactly\\n # the same text, the first formatter in the registration list wins.\\n if match and (\\n (best_match is None)\\n or (match.start() < best_match.start())\\n or (\\n (match.start() == best_match.start())\\n and (match.end() > best_match.end())\\n )\\n ):\\n best_match = match\\n best_conv = test[1]\\n best_userdata = test[2]\\n # If we found a match...\\n if best_match:\\n # ... add any non-matching stuff first, then the matching bit.\\n start = best_match.start()\\n end = best_match.end()\\n if start > 0:\\n tokens.append(\\n _item(match=line[:start], converter=self.format_text, userdata=None)\\n )\\n tokens.append(\\n _item(match=best_match, converter=best_conv, userdata=best_userdata)\\n )\\n line = line[end:]\\n else:\\n # Otherwise, just add the rest of the string.\\n tokens.append(_item(match=line, converter=self.format_text, userdata=None))\\n line = \\\"\\\"\\n return ViewVCHtmlFormatterTokens(tokens)\",\n \"def update_placeholder_formats(self, format_string, placeholder_formats):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if (\\n token.group(\\\"placeholder\\\")\\n and (not token.group(\\\"format\\\"))\\n and token.group(\\\"key\\\") in placeholder_formats\\n ):\\n output.append(f\\\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\\\")\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def register_str_format(\\n tag: Tag, conformer: Optional[Conformer] = None\\n) -> Callable[[ValidatorFn], ValidatorFn]:\\n\\n def create_str_format(f: ValidatorFn) -> ValidatorFn:\\n with _STR_FORMAT_LOCK:\\n _STR_FORMATS[tag] = StrFormat(f, conformer=conformer)\\n return f\\n\\n return create_str_format\",\n \"def format(self):\\n return self._format\",\n \"def compile(format):\\n try:\\n return _cache[format]\\n except KeyError:\\n _cache[format] = retval = SF_Pattern.__new__(SF_Pattern, format)\\n return retval\",\n \"def initFormat(self):\\n self.formatList = self.splitText(self.format)\",\n \"def format_using_current_token(service, token_etag, token_name):\\n is_current = is_service_current(service, token_etag, token_name)\\n if is_current:\\n return terminal.success('Current')\\n else:\\n return 'Not Current'\",\n \"def _interpolate(format):\\n from tokenize import tokenprog\\n\\n def matchorfail(text, pos):\\n match = tokenprog.match(text, pos)\\n if match is None:\\n raise _ItplError(text, pos)\\n return match, match.end()\\n\\n namechars = \\\"abcdefghijklmnopqrstuvwxyz\\\" \\\\\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\\\";\\n chunks = []\\n pos = 0\\n\\n while 1:\\n dollar = format.find(\\\"$\\\", pos)\\n if dollar < 0: \\n break\\n nextchar = format[dollar + 1]\\n\\n if nextchar == \\\"{\\\":\\n chunks.append((0, format[pos:dollar]))\\n pos, level = dollar + 2, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token == \\\"{\\\": \\n level = level + 1\\n elif token == \\\"}\\\": \\n level = level - 1\\n chunks.append((1, format[dollar + 2:pos - 1]))\\n\\n elif nextchar in namechars:\\n chunks.append((0, format[pos:dollar]))\\n match, pos = matchorfail(format, dollar + 1)\\n while pos < len(format):\\n if format[pos] == \\\".\\\" and \\\\\\n pos + 1 < len(format) and format[pos + 1] in namechars:\\n match, pos = matchorfail(format, pos + 1)\\n elif format[pos] in \\\"([\\\":\\n pos, level = pos + 1, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token[0] in \\\"([\\\": \\n level = level + 1\\n elif token[0] in \\\")]\\\": \\n level = level - 1\\n else: \\n break\\n chunks.append((1, format[dollar + 1:pos]))\\n else:\\n chunks.append((0, format[pos:dollar + 1]))\\n pos = dollar + 1 + (nextchar == \\\"$\\\")\\n\\n if pos < len(format): \\n chunks.append((0, format[pos:]))\\n return chunks\",\n \"def format( self ) :\\n\\n return( self.__format )\",\n \"def format(self):\\n return self[\\\"format\\\"]\",\n \"def format(self):\\n return self[\\\"format\\\"]\",\n \"def get_formatted_string(self, input_string):\\n if isinstance(input_string, str):\\n try:\\n return self.get_processed_string(input_string)\\n except KeyError as err:\\n # Wrapping the KeyError into a less cryptic error for end-user\\n # friendliness\\n missing_key = err.args[0]\\n raise KeyNotInContextError(\\n f'Unable to format \\\\'{input_string}\\\\' with '\\n f'{{{missing_key}}}, because '\\n f'context[\\\\'{missing_key}\\\\'] doesn\\\\'t exist') from err\\n else:\\n raise TypeError(f\\\"can only format on strings. {input_string} is a \\\"\\n f\\\"{type(input_string)} instead.\\\")\",\n \"def get_formatter(self, group):\\n return getattr(self, \\\"format_\\\" + group + \\\"_standings\\\")\",\n \"def re_format(self):\\n return self._re.pattern\",\n \"def format(self) -> str:\",\n \"def formatted(s):\\n matches = re.findall(_format_re, normalize(s))\\n if len(matches) == 1 and matches[0][0] != '':\\n return matches[0][0]\\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\\n if txt_none != '':\\n return FORMAT_NONE, txt_none\\n elif txt_sw != '':\\n return FORMAT_SW, txt_sw\\n elif txt_rem != '':\\n return FORMAT_REM, txt_rem\\n elif txt_em != '':\\n return FORMAT_EM, txt_em\\n elif txt_a != '':\\n return FORMAT_A, txt_a\\n return [to_fmt(*m) for m in matches]\",\n \"def format(self) -> str:\\n return pulumi.get(self, \\\"format\\\")\",\n \"def formatsrc(self):\\n return self[\\\"formatsrc\\\"]\",\n \"def formatsrc(self):\\n return self[\\\"formatsrc\\\"]\",\n \"def get_formatter(style):\\n if style == 'authoryear':\\n return AuthorYearFormatter\\n return AuthorYearFormatter\",\n \"def get_processed_string(self, input_string):\\n if input_string[:6] == '[sic]\\\"':\\n return input_string[6: -1]\\n else:\\n return input_string.format(**self)\",\n \"def __format__(self, format_spec):\\n if format_spec == \\\"polite\\\":\\n return self.polite\\n elif format_spec == \\\"casual\\\":\\n return self.casual\\n else:\\n # Using string addition here to avoid triggering flake8-sfs\\n # while still giving a meaningful self-contained example:\\n raise ValueError(format_spec + \\\" not a format defined by Client object\\\")\",\n \"def get_format_identifier(self, message_type: str) -> str:\",\n \"def __init__(self, format_string):\\r\\n if not isinstance(format_string, Compatibility.string):\\r\\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\\r\\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\\r\\n self._re = re.compile(self._re_pattern)\",\n \"def get(self):\\n return get_msg_form(config['format_path'])\",\n \"def getFormatManager(self) -> ghidra.app.util.viewer.format.FormatManager:\\n ...\",\n \"def __normalize(self, ctx: commands.Context, format: str) -> str:\\n\\t\\t# convert to lowercase\\n\\t\\tlower_format = format.lower()\\n\\t\\t# check if inputted format is recognized\\n\\t\\tif lower_format in self.formats:\\n\\t\\t\\treturn lower_format\\n\\t\\t# check for aliases\\n\\t\\telif lower_format in self.aliases:\\n\\t\\t\\treturn self.aliases[lower_format]\\n\\t\\t# format is not recognized\\n\\t\\telse:\\n\\t\\t\\traise FriendlyError(\\n\\t\\t\\t\\tf\\\"'{format}' is not a recognized format.\\\", ctx.channel, ctx.author\\n\\t\\t\\t)\",\n \"def get_format(fstr):\\n fstr = fstr.lower() # support uppercase letters\\n if os.sep in fstr:\\n fstr = fstr.split(os.sep)[-1]\\n try:\\n fname, ext = fstr.split(\\\".\\\", 1)\\n except:\\n fname, ext = (\\\"\\\", \\\"\\\")\\n\\n if ext.startswith(\\\"bm\\\"):\\n return FORMAT_BMP\\n elif ext == \\\"txt\\\":\\n return FORMAT_CAR\\n elif ext == \\\"ta.csv\\\":\\n return FORMAT_TA_CSV\\n elif ext == \\\"fin\\\":\\n return FORMAT_FIN\\n elif ext == \\\"hul\\\":\\n return FORMAT_HUL\\n elif ext in [\\\"ncp\\\"]:\\n return FORMAT_NCP\\n elif ext in [\\\"prm\\\", \\\"m\\\"]:\\n return FORMAT_PRM\\n elif ext == \\\"rim\\\":\\n return FORMAT_RIM\\n elif ext == \\\"w\\\":\\n return FORMAT_W\\n else:\\n return FORMAT_UNK\",\n \"def assign_format(self):\\n if self.is_output or self.is_req_output:\\n if self.pname in self.tool_data[self.tool_name]['output_fmt']:\\n return self.tool_data[self.tool_name]['output_fmt'][self.pname]\\n elif self.pname in self.gen_out_fmt:\\n return self.gen_out_fmt[self.pname]\\n elif self.is_input:\\n if self.pname in self.tool_data[self.tool_name]['input_fmt']:\\n print(self.tool_data[self.tool_name])\\n return self.tool_data[self.tool_name]['input_fmt'][self.pname]\\n elif self.pname in self.gen_in_fmt:\\n return self.gen_in_fmt[self.pname]\\n else:\\n # Not sure yet what this will be used for, but I think we need it.\\n return ''\",\n \"def format_string(s, formatter='minimal'):\\n if not callable(formatter):\\n formatter = get_formatter_for_name(formatter)\\n if formatter is None:\\n output = s\\n else:\\n output = formatter(s)\\n return output\",\n \"def format(self):\\n return self.getparam(\\\"FORMAT\\\")\",\n \"def format(self):\\n return self.getparam(\\\"FORMAT\\\")\",\n \"def read_fmt(bib_name, bib_file):\\n cache_name, formatted_cache_name = _cache_name(bib_name, bib_file)\\n\\n try:\\n meta_data, formatted_entries = cache.read_global(formatted_cache_name)\\n except:\\n raise cache.CacheMiss()\\n\\n # raise a cache miss if the modification took place after the caching\\n modified_time = os.path.getmtime(bib_file)\\n if modified_time > meta_data[\\\"cache_time\\\"]:\\n raise cache.CacheMiss()\\n\\n # validate the version and format strings are still valid\\n if (meta_data[\\\"version\\\"] != _VERSION or\\n any(meta_data[s] != get_setting(\\\"cite_\\\" + s)\\n for s in [\\\"panel_format\\\", \\\"autocomplete_format\\\"])):\\n print(\\\"Formatting string has changed, updating cache...\\\")\\n # read the base information from the unformatted cache\\n current_time, bib_entries = cache.read_global(cache_name)\\n # format and cache the entries\\n formatted_entries = _create_formatted_entries(formatted_cache_name,\\n bib_entries,\\n current_time)\\n\\n return formatted_entries\",\n \"def token(self):\\n if not hasattr(self,'_tokens'):\\n ts = str(time.time())\\n rs = str(random.randint(1234,65535))\\n self._tokens = '%s_%s_%s' % (self.key().name(),ts,rs)\\n return self._tokens\",\n \"def _process_str(self, fmt, *args, **kwargs):\\n log_str = fmt\\n if len(args) > 0 or len(kwargs) > 0:\\n log_str = fmt.format(*args, **kwargs)\\n\\n return log_str\",\n \"def _get_format(value, quote_mode='always'):\\n\\n formats = {'always': '{key}=\\\"{value}\\\"\\\\n', 'auto': '{key}={value}\\\\n'}\\n\\n if quote_mode not in formats.keys():\\n return KeyError(f'quote_mode {quote_mode} is invalid')\\n\\n _mode = quote_mode\\n if quote_mode == 'auto' and ' ' in value:\\n _mode = 'always'\\n return formats.get(_mode)\",\n \"def format(self) -> pulumi.Output[Optional['outputs.FlowLogFormatParametersResponse']]:\\n return pulumi.get(self, \\\"format\\\")\",\n \"def from_tokens(\\n output: RenderOutput,\\n *,\\n consecutive_numbering: bool = True,\\n warning_stream: Optional[IO] = None,\\n) -> str:\\n md_renderer = MDRenderer()\\n # TODO option for consecutive numbering consecutive_numbering, etc\\n options = {\\n \\\"parser_extension\\\": [\\n PARSER_EXTENSIONS[name]\\n for name in [\\\"myst\\\", \\\"tables\\\", \\\"frontmatter\\\", \\\"deflist\\\"]\\n ]\\n + [AdditionalRenderers],\\n \\\"mdformat\\\": {\\\"number\\\": consecutive_numbering},\\n }\\n\\n # temporarily redirect mdformat logging\\n warning_handler = None\\n if warning_stream:\\n warning_handler = logging.StreamHandler(warning_stream)\\n warning_handler.setLevel(logging.WARNING)\\n LOGGER.addHandler(warning_handler)\\n try:\\n # mdformat outputs only used reference definitions during 'finalize'\\n # instead we want to output all parsed reference definitions\\n text = md_renderer.render(output.tokens, options, output.env, finalize=False)\\n if output.env[\\\"references\\\"]:\\n if text:\\n text += \\\"\\\\n\\\\n\\\"\\n output.env[\\\"used_refs\\\"] = set(output.env[\\\"references\\\"])\\n text += md_renderer._write_references(output.env)\\n finally:\\n if warning_handler:\\n LOGGER.removeHandler(warning_handler)\\n if text:\\n text += \\\"\\\\n\\\"\\n return text\",\n \"def handleFormatText(paragraphContent):\\n # We tokenize and remove the stop word\\n words = tokenizeWord(paragraphContent) \\n \\n stemWords = []\\n # We loop on each word.\\n for word in words:\\n stemWord = STEMMER.stem(word)\\n \\n # Selection on a part of string.\\n stemWord = re.sub(\\\"[*\\\\'\\\\.+:,\\\\`:/]\\\", '', stemWord)\\n if stemWord.isdigit() or len(stemWord) < 2:\\n continue\\n \\n stemWords.append(stemWord)\\n my_r_string = stemWords.pop(0)\\n for word in stemWords:\\n my_r_string += \\\" \\\"+str(word)\\n return my_r_string\",\n \"def get_timestamp(format_str=\\\"%Y%m%d_%H-%M-%S\\\"):\\n now = datetime.now()\\n current_timestamp = now.strftime(format_str)\\n\\n return current_timestamp\",\n \"def extract_pattern(fmt):\\n class FakeDict(object):\\n def __init__(self):\\n self.seen_keys = set()\\n\\n def __getitem__(self, key):\\n self.seen_keys.add(key)\\n return ''\\n\\n def keys(self):\\n return self.seen_keys\\n\\n fake = FakeDict()\\n try:\\n fmt % fake\\n except TypeError:\\n # Formatting error\\n pass\\n return set(fake.keys())\",\n \"def token_str(self) -> Optional[str]:\\n return self._token_str\",\n \"def get_placeholder_formats_list(self, format_string):\\n placeholders = []\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"placeholder\\\"):\\n placeholders.append((token.group(\\\"key\\\"), token.group(\\\"format\\\")))\\n return placeholders\",\n \"def strfdate(self, fmt):\\n pattern = r'%({})'.format(reduce(lambda x, y: '{}|{}'.format(x, y), FORMAT_MAP.keys()))\\n for f in re.findall(pattern, fmt):\\n fmt = fmt.replace('%{}'.format(f), FORMAT_MAP[f](self))\\n return fmt\",\n \"def format(self, tweet):\\n return self._format_string.format(tweet=tweet)\",\n \"def _get_token(self):\\n # Skip initial whitespace.\\n pos = self._skip_whitespace()\\n\\n # Find the token here, if there's one.\\n token = None\\n\\n for (token_type, regex) in TOKEN_REGEXEN:\\n re_match = regex.match(self.body, pos)\\n if re_match:\\n token_content = next(g for g in re_match.groups() if g is not None)\\n token = Token(token_type, token_content, re_match.end())\\n break\\n\\n return token\",\n \"def getCachedToken( self ):\\n if ( os.path.exists( TOKEN_PATH )):\\n return open( TOKEN_PATH ).read()\\n else :\\n return None\",\n \"def _parse(self, fmtstr):\\n def _match_brace(string, start_pos, pair='[]'):\\n \\\"\\\"\\\"Pairing brackets (used internally in _parse method)\\\"\\\"\\\"\\n depth = 1\\n if string[start_pos] != pair[0]:\\n return None\\n for index, char in enumerate(string[start_pos + 1:]):\\n if char == pair[0]:\\n depth += 1\\n elif char == pair[1]:\\n depth -= 1\\n if depth == 0:\\n return start_pos + index + 1\\n return None\\n\\n #----------------------------------------------------------------------\\n\\n t_fmt = self.__class__._T_FMT\\n t_prefix = self.__class__._T_PREFIX\\n\\n ptr = 0\\n # it seems that field id 0 is invalid\\n field_id = 1\\n length = len(fmtstr)\\n parsed_list = []\\n\\n while ptr < length:\\n parsed = {}\\n m_prefix = t_prefix.match(fmtstr[ptr:])\\n if m_prefix:\\n ptr += _get_length_of_match(m_prefix)\\n parsed['prefix'] = m_prefix.group(1)\\n\\n # check if we have a nested structure\\n if m_prefix.group(2):\\n brace_offset = _match_brace(fmtstr, ptr - 1)\\n\\n # bracket not match\\n if not brace_offset:\\n raise BadFormatString(\\n 'Unmatched brace on position {0}'.format(ptr)\\n )\\n parsed['field_id'] = field_id\\n parsed['field_type'] = 'a'\\n parsed['subcontent'] = self._parse(\\n fmtstr[ptr:brace_offset]\\n )\\n ptr = brace_offset + 1\\n field_id += 1\\n\\n parsed_list.append(parsed)\\n continue\\n m_fmt = t_fmt.match(fmtstr[ptr:])\\n if m_fmt:\\n ptr += _get_length_of_match(m_fmt)\\n\\n # fmt is an alias\\n if m_fmt.group(2):\\n parsed['field_type'] = self.__class__\\\\\\n .FIELD_ALIAS[m_fmt.group(2)]\\n # fmt is an actual field type\\n elif m_fmt.group(1):\\n parsed['field_type'] = m_fmt.group(1)\\n\\n # save field id\\n parsed['field_id'] = field_id\\n\\n # check for type clones (e.g. `v3')\\n if m_fmt.group(3):\\n parsed['repeat'] = int(m_fmt.group(3))\\n field_id += int(m_fmt.group(3))\\n else:\\n parsed['repeat'] = 1\\n field_id += 1\\n\\n parsed_list.append(parsed)\\n\\n else:\\n raise BadFormatString(\\n 'Invalid token on position {0}'.format(ptr)\\n )\\n\\n # all set\\n return parsed_list\",\n \"def get_format_table(self):\\n try:\\n with open(self._config.values['format'], 'r') as f:\\n return f.read()\\n except:\\n return None\",\n \"def format(self) -> str:\\n return self._format\",\n \"def format(self) -> str:\\n return self._format\",\n \"def format(self) -> Optional[pulumi.Input['FlowLogFormatParametersArgs']]:\\n return pulumi.get(self, \\\"format\\\")\",\n \"def _tokenize(source):\\n lines = source.split(\\\"\\\\n\\\")\\n print(\\n \\\"{type:<10}{string:<25} {start:^12} {end:^12}\\\".format(\\n type=\\\"Type\\\", string=\\\"String\\\", start=\\\"Start\\\", end=\\\"End\\\"\\n )\\n )\\n print(\\\"-\\\" * 60)\\n for line in lines:\\n tokens = collect_tokens(line)\\n for token in tokens:\\n print(token)\",\n \"def get_token(self):\\n return self.__token\",\n \"def get_token(self):\\n return self.__token\",\n \"def string_val(self) -> str:\\n return self.current_token\",\n \"def token(self) -> str:\\n raise NotImplementedError\",\n \"def formatted(self) -> str:\\r\\n ...\",\n \"def get_token(word, flag):\\n if flag == 1:\\n return \\\"_RARE_\\\"\\n elif flag == 2:\\n if bool(re.search(r'\\\\d', word)):\\n return \\\"AlphaNum\\\"\\n else:\\n return \\\"oThEr\\\"\\n elif flag == 3:\\n if word[-3:] == \\\"ing\\\":\\n return \\\"enDiNg\\\"\\n else:\\n return \\\"oThEr\\\"\",\n \"def _read_token(token_file):\\n try:\\n return _fortworth.read(token_file).strip()\\n except FileNotFoundError:\\n raise _errors.TokenNotFoundError(token_file)\",\n \"def format(fmt, st):\\n ret = \\\"\\\"\\n if not st: return ret\\n if fmt not in valid_combos:\\n return st\\n cm = charmap[fmt]\\n for c in st:\\n ret += cm.get(c, c)\\n return ret\",\n \"def token(uncapped_token):\\n return uncapped_token\",\n \"def get_retokenized(tokenizer, text):\\n return ' '.join(tokenizer.tokenize(text))\",\n \"def _tokenize(self, _string):\\n return re.search(self._access_log_regex, _string)\",\n \"def token_lookup():\\n token_dict = {}\\n token_dict['.'] = \\\"||Period||\\\"\\n token_dict[','] = \\\"||Comma||\\\"\\n token_dict['\\\"'] = \\\"||Quotation_Mark||\\\"\\n token_dict[';'] = \\\"||Semicolon||\\\"\\n token_dict['!'] = \\\"||Exclamation_Mark||\\\"\\n token_dict['?'] = \\\"||Question_Mark||\\\"\\n token_dict['('] = \\\"||Left_Parentheses||\\\"\\n token_dict[')'] = \\\"||Right_Parentheses||\\\"\\n token_dict['--'] = \\\"||Dash||\\\"\\n token_dict['\\\\n'] = \\\"||Return||\\\"\\n\\n return token_dict\",\n \"def get(self):\\n return get_msg_form(config['msg_format_path'])\",\n \"def formats():\\n return _FORMATS\",\n \"def _handle_token(self, token: str) -> Optional[str]:\\n return token\",\n \"def read_token(self):\\n self._skip_white_space()\\n return self._get_token()\",\n \"def __format__(self, format_spec):\\n # This calls the compiled regex stored on ANSIString's class to analyze the format spec.\\n # It returns a dictionary.\\n format_data = self.re_format.match(format_spec).groupdict()\\n clean = self.clean()\\n base_output = ANSIString(self.raw())\\n align = format_data.get(\\\"align\\\", \\\"<\\\")\\n fill = format_data.get(\\\"fill\\\", \\\" \\\")\\n\\n # Need to coerce width into an integer. We can be certain that it's numeric thanks to regex.\\n width = format_data.get(\\\"width\\\", None)\\n if width is None:\\n width = len(clean)\\n else:\\n width = int(width)\\n\\n if align == \\\"<\\\":\\n base_output = self.ljust(width, fill)\\n elif align == \\\">\\\":\\n base_output = self.rjust(width, fill)\\n elif align == \\\"^\\\":\\n base_output = self.center(width, fill)\\n elif align == \\\"=\\\":\\n pass\\n\\n # Return the raw string with ANSI markup, ready to be displayed.\\n return base_output.raw()\",\n \"def get_format(request, default='html'):\\n format_ = request.GET.get('format', None)\\n if not format_:\\n format_ = request.GET.get('view', default)\\n return format_\",\n \"def format_to_extension(self, format):\",\n \"def formatEditText(self, storedText):\\n format = globalref.options.strData('EditDateFormat', True)\\n try:\\n return (GenDate(storedText).dateStr(format), True)\\n except GenDateError:\\n return (storedText, not storedText)\",\n \"def formatLookup(format_str):\\n pat = '(\\\\d+)([A-Z])'\\n match = re.search(pat, format_str)\\n #print match.group()\\n \\n data_len = int(match.group(1))\\n data_fmt = str(match.group(2))\\n np_fmt = fitsFormatLookup(data_fmt)\\n np_dtype = '%i%s'%(data_len, np_fmt)\\n \\n return np_dtype, data_len, np_fmt\",\n \"def parser_formatter(format_class, **kwargs):\\n try:\\n return lambda prog: format_class(prog, **kwargs)\\n except TypeError:\\n return format_class\",\n \"def parser_formatter(format_class, **kwargs):\\n try:\\n return lambda prog: format_class(prog, **kwargs)\\n except TypeError:\\n return format_class\",\n \"def _translate_fmts(self):\\n fmt_info = []\\n fmt_append = fmt_info.append\\n \\n isvalid = self._is_valid_fmt\\n typlist = self._typlist\\n isstrvar = self._isstrvar\\n default_fmts = self._default_fmts\\n \\n for i, fmt in enumerate(self._fmtlist):\\n fmt = fmt.strip()\\n \\n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\\n \\n if iscalendar or not isvalid(fmt):\\n if isstrvar(i):\\n wid = min(typlist[i], 10)\\n fmt_append(('s', \\\"{{:>{}s}}\\\".format(wid), wid))\\n continue\\n else:\\n fmt = default_fmts[typlist[i]]\\n \\n last_char = fmt[-1]\\n if last_char == 's': # string\\n m = STR_FMT_RE.match(fmt)\\n align, _, wid = m.group(1), m.group(2), m.group(3)\\n new_align = (\\\"<\\\" if align == \\\"-\\\" \\n else \\\"^\\\" if align == \\\"~\\\" else \\\">\\\")\\n new = \\\"\\\".join((\\\"{:\\\", new_align, wid, \\\"s}\\\"))\\n fmt_append(('s', new, int(wid)))\\n elif last_char == 'H' or last_char == 'L': # binary\\n fmt_append((last_char, fmt, int(fmt[1:-1])))\\n elif last_char == 'x': # hexadecimal\\n fmt_append(('x', fmt, 21))\\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\\n m = NUM_FMT_RE.match(fmt)\\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \\n m.group(3), m.group(4),\\n m.group(5), m.group(6),\\n m.group(7))\\n aln = \\\"<\\\" if align == \\\"-\\\" else \\\">\\\"\\n sep = \\\",\\\" if com is not None else \\\"\\\"\\n if type == \\\"g\\\" and int(prec) == 0:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, type, \\\"}\\\"))\\n else:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, \\\".\\\", prec, type, \\\"}\\\"))\\n fmt_append((type, new, int(wid), delim, com))\\n \\n return fmt_info\",\n \"def parse_token(bn,token):\\n return bn.split(token)[1].split('_')[0]\",\n \"def format(self):\\n ...\",\n \"def get_format_type(self):\\n raise Unimplemented()\",\n \"def GetFormatCount(format_):\\n\\n if isinstance(format_, str):\\n match = re.search(r'\\\\s*(\\\\d+)', format_)\\n if match:\\n return int(match.group(0))\\n\\n return 1\",\n \"def _get_token(self):\\n self._skip()\\n\\n token = None\\n # Checks single-quoted string.\\n if self.current_char == \\\"'\\\":\\n start_position = self.current_position\\n while not (self.current_char != \\\"\\\\\\\\\\\" and self._peek() == \\\"'\\\"):\\n self._next_char()\\n if self.EOF:\\n raise LexerError(\\n start_position, f\\\"EOL while scanning string literal at position {start_position}\\\")\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\\n _token_names.STRING, self.stream[start_position:self.current_position + 1])\\n\\n # Checks double-quoted string.\\n elif self.current_char == '\\\"':\\n start_position = self.current_position\\n while not (self.current_char != \\\"\\\\\\\\\\\" and self._peek() == '\\\"'):\\n self._next_char()\\n if self.EOF:\\n raise LexerError(\\n start_position, f\\\"EOL while scanning string literal at position {start_position}\\\")\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\\n _token_names.STRING, self.stream[start_position:self.current_position + 1])\\n\\n # Checks number begins with a digit.\\n elif self.current_char.isdigit():\\n start_position = self.current_position\\n while self._peek().isdigit():\\n self._next_char()\\n if self._peek() == \\\".\\\":\\n self._next_char()\\n while self._peek().isdigit():\\n self._next_char()\\n if self._peek() in [\\\"d\\\", \\\"D\\\", \\\"f\\\", \\\"F\\\"]:\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\\n _token_names.NUMBER, self.stream[start_position:self.current_position + 1])\\n\\n # Checks number begins with a dot.\\n elif self.current_char == \\\".\\\":\\n if self._peek().isdigit():\\n start_position = self.current_position\\n while self._peek().isdigit():\\n self._next_char()\\n if self._peek() in [\\\"d\\\", \\\"D\\\", \\\"f\\\", \\\"F\\\"]:\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\\n _token_names.NUMBER, self.stream[start_position:self.current_position + 1])\\n else:\\n token = Token(self.line_number, self.line_start_position, self.current_position, self.current_position,\\n _token_names.Separators(self.current_char).name, self.current_char)\\n\\n # Checks word begins with an alphabetic letter or an underscore.\\n elif self.current_char.isalpha() or self.current_char == \\\"_\\\":\\n start_position = self.current_position\\n while True:\\n if (self._peek() in [\\\" \\\", \\\"\\\\t\\\", \\\"\\\\r\\\", \\\"\\\\n\\\", \\\"\\\\0\\\"]\\n or self._peek() in _token_names.SEPARATORS\\n or self._peek() in _token_names.OPERATORS):\\n break\\n self._next_char()\\n word = self.stream[start_position:self.current_position + 1]\\n # Checks if word is a keyword.\\n if word in _token_names.Keywords.values():\\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\\n _token_names.Keywords(word).name, word)\\n elif word in _token_names.KeywordsType.values():\\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\\n _token_names.KeywordsType(word).name, word)\\n elif word in _token_names.KeywordsAttribute.values():\\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\\n _token_names.KeywordsAttribute(word).name, word)\\n # Otherwise put it as identifier.\\n else:\\n token = Token(self.line_number, self.line_start_position, start_position, self.current_position,\\n _token_names.IDENTIFIER, word)\\n\\n # Checks if is a separator.\\n elif self.current_char in _token_names.Separators.values():\\n token = Token(self.line_number, self.line_start_position, self.current_position, self.current_position,\\n _token_names.Separators(self.current_char).name, self.current_char)\\n\\n # Checks if is an operator.\\n elif self.current_char in _token_names.Operators.values():\\n last_position = self.current_position\\n if self.current_char not in [\\\"&\\\", \\\"|\\\"] and self._peek() == \\\"=\\\":\\n val = self.current_char + self._peek()\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\\n _token_names.Operators(val).name, val)\\n elif self.current_char == \\\"+\\\" and self._peek() == \\\"+\\\":\\n val = self.current_char + self._peek()\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\\n _token_names.Operators(val).name, val)\\n elif self.current_char == \\\"-\\\" and self._peek() == \\\"-\\\":\\n val = self.current_char + self._peek()\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\\n _token_names.Operators(val).name, val)\\n elif self.current_char == \\\"&\\\" and self._peek() == \\\"&\\\":\\n val = self.current_char + self._peek()\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\\n _token_names.Operators(val).name, val)\\n elif self.current_char == \\\"|\\\" and self._peek() == \\\"|\\\":\\n val = self.current_char + self._peek()\\n self._next_char()\\n token = Token(self.line_number, self.line_start_position, last_position, self.current_position,\\n _token_names.Operators(val).name, val)\\n else:\\n token = Token(self.line_number, self.line_start_position, self.current_position, self.current_position,\\n _token_names.Operators(self.current_char).name, self.current_char)\\n\\n # Checks if is EOF\\n elif self.current_char == \\\"\\\\0\\\":\\n token = Token(self.line_number, self.line_start_position, self.current_position, self.current_position,\\n _token_names.EOF, self.current_char)\\n\\n # Raise error if is an unknown token.\\n else:\\n raise LexerError(self.current_position)\\n\\n self._next_char()\\n return token\",\n \"def format(self, *args, **kwargs) -> String:\\n pass\",\n \"def tokenize(*args, **kwargs):\\n if kwargs.pop('pure', False):\\n return base.tokenize(*args)\\n else:\\n return str(uuid.uuid4())\",\n \"def _get_name_from_url(self, request):\\n\\n format = request.GET.get('format', None)\\n if not format:\\n match = self._format_query_pattern.match(request.path)\\n if match and match.group('format'):\\n format = match.group('format')\\n return format\",\n \"def initFormat(self):\\n pass\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7031436","0.5833799","0.5587852","0.55370355","0.55229795","0.5514945","0.5489987","0.5487361","0.5463768","0.5454155","0.54331946","0.53677803","0.5347152","0.5261837","0.5218769","0.52003187","0.5194947","0.51801944","0.5157241","0.5129288","0.51125944","0.51009524","0.50988346","0.50985765","0.50985765","0.50941116","0.50713986","0.50615126","0.50582445","0.5048388","0.50467664","0.49953192","0.49953192","0.4989755","0.49796894","0.49701267","0.49655125","0.49524215","0.49503097","0.4947215","0.49321675","0.49241","0.49229473","0.49032536","0.489689","0.489689","0.48950008","0.48915634","0.48847082","0.48694107","0.48614025","0.48594677","0.4859294","0.4850643","0.48468676","0.48444346","0.48228976","0.48201036","0.4800476","0.4793135","0.4789199","0.47849423","0.4779945","0.47765595","0.47765595","0.4767015","0.4762846","0.47609147","0.47609147","0.474834","0.47472036","0.4729222","0.47230813","0.471819","0.47161332","0.4703712","0.4702357","0.46922752","0.46868876","0.46840248","0.46786755","0.4656001","0.465319","0.46497196","0.46459505","0.4643527","0.46360722","0.4618882","0.46120974","0.46120974","0.45972872","0.4596433","0.4585631","0.45843905","0.45837885","0.45770916","0.4575302","0.45734084","0.45728123","0.45683858"],"string":"[\n \"0.7031436\",\n \"0.5833799\",\n \"0.5587852\",\n \"0.55370355\",\n \"0.55229795\",\n \"0.5514945\",\n \"0.5489987\",\n \"0.5487361\",\n \"0.5463768\",\n \"0.5454155\",\n \"0.54331946\",\n \"0.53677803\",\n \"0.5347152\",\n \"0.5261837\",\n \"0.5218769\",\n \"0.52003187\",\n \"0.5194947\",\n \"0.51801944\",\n \"0.5157241\",\n \"0.5129288\",\n \"0.51125944\",\n \"0.51009524\",\n \"0.50988346\",\n \"0.50985765\",\n \"0.50985765\",\n \"0.50941116\",\n \"0.50713986\",\n \"0.50615126\",\n \"0.50582445\",\n \"0.5048388\",\n \"0.50467664\",\n \"0.49953192\",\n \"0.49953192\",\n \"0.4989755\",\n \"0.49796894\",\n \"0.49701267\",\n \"0.49655125\",\n \"0.49524215\",\n \"0.49503097\",\n \"0.4947215\",\n \"0.49321675\",\n \"0.49241\",\n \"0.49229473\",\n \"0.49032536\",\n \"0.489689\",\n \"0.489689\",\n \"0.48950008\",\n \"0.48915634\",\n \"0.48847082\",\n \"0.48694107\",\n \"0.48614025\",\n \"0.48594677\",\n \"0.4859294\",\n \"0.4850643\",\n \"0.48468676\",\n \"0.48444346\",\n \"0.48228976\",\n \"0.48201036\",\n \"0.4800476\",\n \"0.4793135\",\n \"0.4789199\",\n \"0.47849423\",\n \"0.4779945\",\n \"0.47765595\",\n \"0.47765595\",\n \"0.4767015\",\n \"0.4762846\",\n \"0.47609147\",\n \"0.47609147\",\n \"0.474834\",\n \"0.47472036\",\n \"0.4729222\",\n \"0.47230813\",\n \"0.471819\",\n \"0.47161332\",\n \"0.4703712\",\n \"0.4702357\",\n \"0.46922752\",\n \"0.46868876\",\n \"0.46840248\",\n \"0.46786755\",\n \"0.4656001\",\n \"0.465319\",\n \"0.46497196\",\n \"0.46459505\",\n \"0.4643527\",\n \"0.46360722\",\n \"0.4618882\",\n \"0.46120974\",\n \"0.46120974\",\n \"0.45972872\",\n \"0.4596433\",\n \"0.4585631\",\n \"0.45843905\",\n \"0.45837885\",\n \"0.45770916\",\n \"0.4575302\",\n \"0.45734084\",\n \"0.45728123\",\n \"0.45683858\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7236307"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94763,"cells":{"query":{"kind":"string","value":"Parses the format_string and returns a set of color names."},"document":{"kind":"string","value":"def get_color_names(self, format_string):\n names = set()\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"command\"):\n name = dict(parse_qsl(token.group(\"command\"))).get(\"color\")\n if (\n not name\n or name in COLOR_NAMES_EXCLUDED\n or name in COLOR_NAMES\n or name[0] == \"#\"\n ):\n continue\n names.add(name)\n return names"},"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 reformatColor(self, colorStr):\n if type(colorStr) is str:\n if colorStr.startswith('#'):\n colorStr = colorStr.replace('#', '')\n else:\n raise Exception('color is not hex format')\n r = int(colorStr[:2], 16)\n g = int(colorStr[2:4], 16)\n b = int(colorStr[4:6], 16)\n return r, g, b","def get_placeholder_formats_list(self, format_string):\n placeholders = []\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.append((token.group(\"key\"), token.group(\"format\")))\n return placeholders","def parse_color(self):\n begin = self.tokenizer.next()\n begin.must_be('{')\n for name in self.tokenizer:\n if name.text == '}': return\n name.must_match(\"^[A-Za-z]\", \"%d:%d: Expected a color name, got %s instead.\" % (name.line, name.col, name.text))\n midpunct = self.tokenizer.next()\n if midpunct.text == \"{\":\n color = self.mkColor(name)\n if color in self.ColorDefinitions:\n raise Exception(\"%d:%d: Color %s has already been defined.\" % (name.line, name.col, name.text))\n self.ColorDefinitions[name.text] = color\n elif midpunct.text == ':':\n stack = []\n for token in self.tokenizer:\n if token.text == \".\":\n self.OrderedColorMappings += [Mapping(name,stack)]\n break\n elif token.text == \"}\": raise Exception(\"%d:%d: Color section ended while defining mapping for color %s\" % (name.line, name.col, name.text))\n try:\n stack += [ self.GlobalSymbolDict[token.text] ]\n except:\n raise Exception(\"%d:%d: Literal %s does not occur in the grammar\" % (token.line, token.col, token.text))\n \n elif midpunct.text == '}': raise Exception(\"%d:%d: Coloring section ended unexpectedly here.\" % (token.line, token.col))\n else: raise Exception(\"%d:%d: Expected : or {, not %s\" % (midpunct.line, midpunct.col, midpunct.text))\n raise Exception(\"%d:%d: Unexpected end-of-file while scanning color definition section beginning here.\" % (begin.line, begin.col))","def from_str (s):\n try: \n return from_csv(s)\n except Exception: \n pass\n \n try: \n return from_hex(s)\n except Exception: \n pass\n\n try:\n return from_name(s)\n except Exception: \n pass\n\n raise ColourFormatError(\"'%s' is not a recognized colour string\"%s)","def parse_styles(text: str) -> List[dict]:\n styles = []\n regex = r'(\\d{3})=(\".*?\"),(\\d+\\.?\\d+),(\\(.*?\\))'\n\n for line in text.split(\"\\r\\n\"):\n if line == \"\":\n continue\n\n n, font, font_size, color = re.match(regex, line).groups()\n styles.append(\n {\n \"id\": int(n),\n \"f\": font.replace('\"', \"\"),\n \"fs\": float(font_size),\n \"rgb\": [\n int(i)\n for i in color.replace(\"(\", \"\")\n .replace(\")\", \"\").split(\",\")]\n }\n )\n\n return styles","def tokens(self, format_string):\n if format_string not in self.format_string_cache:\n tokens = list(re.finditer(self.reg_ex, format_string))\n self.format_string_cache[format_string] = tokens\n return self.format_string_cache[format_string]","def parse_color(colstr):\n if('rgb' in colstr):\n expr = r\"rgb\\(\\s*([0-9]{1,3})\\,\\s*([0-9]{1,3})\\,\\s*([0-9]{1,3})\\s*\\)\"\n results = re.search(expr, colstr)\n if(results and len(results.groups()) == 3):\n rgb = (int(results.group(1)), int(results.group(2)), int(results.group(3)))\n for val in rgb:\n if(val > 255):\n print(\"Invalid rgb color. All values should be from 0-255.\")\n exit(-1)\n\n return ('rgb', rgb)\n\n else:\n print(\"Invalid rgb color. See help for more information\")\n exit(-1)\n elif('#' in colstr):\n if(len(colstr) != 7):\n print(\"Invalid hex value. Only 6 digit hex values are supported\")\n exit(-1)\n else:\n try:\n hexval = int(colstr[1:], 16)\n return (\"hex\", hexval)\n except:\n print(\"Failed to parse hex color\")\n exit(-1)\n elif('hsl' in colstr):\n expr = r\"hsl\\(\\s*([0-9]{1,3})\\,\\W*([0-9]{1,3})%{0,1}\\,\\s*([0-9]{1,3})%{0,1}\\s*\\)\"\n results = re.search(expr, colstr)\n if(results and len(results.groups()) == 3):\n h = int(results.group(1))\n s = int(results.group(2))\n l = int(results.group(3))\n if(h < 0 or h > 359):\n print(\"Hue out of range. Range: 0-359\")\n exit(-1)\n elif(s < 0 or s > 100):\n print(\"Saturation out of range. Range: 0-100%\")\n exit(-1)\n elif(l < 0 or s > 100):\n print(\"Lightness out of range. Range: 0-100%\")\n exit(-1)\n else:\n return (\"hsl\", (h, s, l))\n else:\n print(\"Invalid hsl color. See help for more information\")\n exit(-1)\n elif('cmyk' in colstr):\n expr = r\"cmyk\\(\\s*([0-9]{1,3})%{0,1}\\,\\W*([0-9]{1,3})%{0,1}\\,\\s*([0-9]{1,3})%{0,1}\\,\\s*([0-9]{1,3})%{0,1}\\s*\\)\"\n results = re.search(expr, colstr)\n if(results and len(results.groups()) == 4):\n c = int(results.group(1))\n m = int(results.group(2))\n y = int(results.group(3))\n k = int(results.group(4))\n\n if(c < 0 or c > 100):\n print(\"Cyan out of range. Range: 0-100%\")\n exit(-1)\n elif(m < 0 or m > 100):\n print(\"Magenta out of range. Range: 0-100%\")\n exit(-1)\n elif(y < 0 or y > 100):\n print(\"Yellow out of range. Range: 0-100%\")\n exit(-1)\n elif(k < 0 or k > 100):\n print(\"Black out of range. Range 0-100%\")\n exit(-1)\n else:\n return(\"cmyk\", (c, m, y, k))\n else:\n print(\"Invalid cmyk color. See help for more information\")\n exit(-1)","def mkColor(self, name):\n known_attrs = [ 'font-family', 'font-style', 'font-weight', 'font-size', 'text-decoration', 'color', 'background-color' ]\n stack = []\n color = Color(name)\n for token in self.tokenizer:\n if token.text == \";\":\n stack[0].assert_symbol_name\n if stack[0].text not in known_attrs: raise Exception(\"%d:%d: Unknown color attribute %s\" % (stack[0].line, stack[0].col, stack[0].text))\n stack[1].must_be(\":\")\n stack[2].must_match(\"^\\w\", \"%d:%d: Expected a color attribute value instead of %s\" % (stack[2].line, stack[2].col, stack[2].text))\n color.attrs[stack[0].text] = stack[2].text\n stack = []\n elif token.text == \"}\":\n return color\n else:\n stack += [token]\n raise Exception(\"%d:%d: End-of-file reached while scanning color %s defined here.\" % (name.line, name.col, name.text))","def parse_colors():\n var = os.environ.get('LS_COLORS', '')\n items = var.split(':')\n ext_map = {}\n special_map = {}\n for item in items:\n try:\n pattern, val = item.split('=')\n except ValueError:\n # TODO\n continue\n pattern = pattern.lower()\n\n if pattern.startswith('*'):\n ext_map[pattern[1:]] = val\n else:\n special_map[pattern] = val\n logger.debug(''.join(list('%s %s\\n' % (k, v) for k, v in ext_map.items())))\n return ext_map, special_map","def __createStyleFromString(self, string):\n\n matches = re.findall(r\"([^=]+)=([^;]+)(;|$)\", str(string).lower());\n if not matches :\n return False;\n\n\n style = OutputFormatterStyle();\n for match in matches:\n if ('fg' == match[0]) :\n style.setForeground(match[1]);\n elif ('bg' == match[0]) :\n style.setBackground(match[1]);\n else :\n style.setOption(match[1]);\n\n\n\n return style;","def format_color_name(string, frame_name):\n if frame_name == \"primary\":\n color = \"red\"\n else:\n color = \"green\"\n return format_color(string, color)","def _string_to_colors(self):\n string = self.str_colors\n colors_three = [string[c:c+3] for c in range(0, len(string), 3)]\n colors_three = [list(color) for color in colors_three]\n pixels = [[ord(rgb) for rgb in color] for color in colors_three]\n return pixels","def parse_color(raw_color) -> list[float]:\n if isinstance(raw_color, str):\n return list(to_rgba(raw_color))\n return list(raw_color)","def format_color(string, color):\n cs = \"\\x1b[38;2;{};{};{}m{}\\x1b[0m\"\n\n # my colors\n if color == \"red1\":\n r, g, b = 215, 0, 0\n elif color == \"green1\":\n r, g, b = 0, 255, 0\n elif color == \"blue1\":\n r, g, b = 50, 50, 255\n\n # list from https://www.rapidtables.com/web/color/RGB_Color.html\n elif color == \"Black\":\n r, g, b = 0, 0, 0\n elif color == \"White\":\n r, g, b = 255, 255, 255\n elif color == \"Red\":\n r, g, b = 255, 0, 0\n elif color == \"Lime\":\n r, g, b = 0, 255, 0\n elif color == \"Blue\":\n r, g, b = 0, 0, 255\n elif color == \"Yellow\":\n r, g, b = 255, 255, 0\n elif color == \"Cyan\":\n r, g, b = 0, 255, 255\n elif color == \"Magenta\":\n r, g, b = 255, 0, 255\n elif color == \"Silver\":\n r, g, b = 192, 192, 192\n elif color == \"Gray\":\n r, g, b = 128, 128, 128\n elif color == \"Maroon\":\n r, g, b = 128, 0, 0\n elif color == \"Olive\":\n r, g, b = 128, 128, 0\n elif color == \"Green\":\n r, g, b = 0, 128, 0\n elif color == \"Purple\":\n r, g, b = 128, 0, 128\n elif color == \"Teal\":\n r, g, b = 0, 128, 128\n elif color == \"Navy\":\n r, g, b = 0, 0, 128\n elif color == \"maroon\":\n r, g, b = 128, 0, 0\n elif color == \"dark red\":\n r, g, b = 139, 0, 0\n elif color == \"brown\":\n r, g, b = 165, 42, 42\n elif color == \"firebrick\":\n r, g, b = 178, 34, 34\n elif color == \"crimson\":\n r, g, b = 220, 20, 60\n elif color == \"red\":\n r, g, b = 255, 0, 0\n elif color == \"tomato\":\n r, g, b = 255, 99, 71\n elif color == \"coral\":\n r, g, b = 255, 127, 80\n elif color == \"indian red\":\n r, g, b = 205, 92, 92\n elif color == \"light coral\":\n r, g, b = 240, 128, 128\n elif color == \"dark salmon\":\n r, g, b = 233, 150, 122\n elif color == \"salmon\":\n r, g, b = 250, 128, 114\n elif color == \"light salmon\":\n r, g, b = 255, 160, 122\n elif color == \"orange red\":\n r, g, b = 255, 69, 0\n elif color == \"dark orange\":\n r, g, b = 255, 140, 0\n elif color == \"orange\":\n r, g, b = 255, 165, 0\n elif color == \"gold\":\n r, g, b = 255, 215, 0\n elif color == \"dark golden rod\":\n r, g, b = 184, 134, 11\n elif color == \"golden rod\":\n r, g, b = 218, 165, 32\n elif color == \"pale golden rod\":\n r, g, b = 238, 232, 170\n elif color == \"dark khaki\":\n r, g, b = 189, 183, 107\n elif color == \"khaki\":\n r, g, b = 240, 230, 140\n elif color == \"olive\":\n r, g, b = 128, 128, 0\n elif color == \"yellow\":\n r, g, b = 255, 255, 0\n elif color == \"yellow green\":\n r, g, b = 154, 205, 50\n elif color == \"dark olive green\":\n r, g, b = 85, 107, 47\n elif color == \"olive drab\":\n r, g, b = 107, 142, 35\n elif color == \"lawn green\":\n r, g, b = 124, 252, 0\n elif color == \"chart reuse\":\n r, g, b = 127, 255, 0\n elif color == \"green yellow\":\n r, g, b = 173, 255, 47\n elif color == \"dark green\":\n r, g, b = 0, 100, 0\n elif color == \"green\":\n r, g, b = 0, 128, 0\n elif color == \"forest green\":\n r, g, b = 34, 139, 34\n elif color == \"lime\":\n r, g, b = 0, 255, 0\n elif color == \"lime green\":\n r, g, b = 50, 205, 50\n elif color == \"light green\":\n r, g, b = 144, 238, 144\n elif color == \"pale green\":\n r, g, b = 152, 251, 152\n elif color == \"dark sea green\":\n r, g, b = 143, 188, 143\n elif color == \"medium spring green\":\n r, g, b = 0, 250, 154\n elif color == \"spring green\":\n r, g, b = 0, 255, 127\n elif color == \"sea green\":\n r, g, b = 46, 139, 87\n elif color == \"medium aqua marine\":\n r, g, b = 102, 205, 170\n elif color == \"medium sea green\":\n r, g, b = 60, 179, 113\n elif color == \"light sea green\":\n r, g, b = 32, 178, 170\n elif color == \"dark slate gray\":\n r, g, b = 47, 79, 79\n elif color == \"teal\":\n r, g, b = 0, 128, 128\n elif color == \"dark cyan\":\n r, g, b = 0, 139, 139\n elif color == \"aqua\":\n r, g, b = 0, 255, 255\n elif color == \"cyan\":\n r, g, b = 0, 255, 255\n elif color == \"light cyan\":\n r, g, b = 224, 255, 255\n elif color == \"dark turquoise\":\n r, g, b = 0, 206, 209\n elif color == \"turquoise\":\n r, g, b = 64, 224, 208\n elif color == \"medium turquoise\":\n r, g, b = 72, 209, 204\n elif color == \"pale turquoise\":\n r, g, b = 175, 238, 238\n elif color == \"aqua marine\":\n r, g, b = 127, 255, 212\n elif color == \"powder blue\":\n r, g, b = 176, 224, 230\n elif color == \"cadet blue\":\n r, g, b = 95, 158, 160\n elif color == \"steel blue\":\n r, g, b = 70, 130, 180\n elif color == \"corn flower blue\":\n r, g, b = 100, 149, 237\n elif color == \"deep sky blue\":\n r, g, b = 0, 191, 255\n elif color == \"dodger blue\":\n r, g, b = 30, 144, 255\n elif color == \"light blue\":\n r, g, b = 173, 216, 230\n elif color == \"sky blue\":\n r, g, b = 135, 206, 235\n elif color == \"light sky blue\":\n r, g, b = 135, 206, 250\n elif color == \"midnight blue\":\n r, g, b = 25, 25, 112\n elif color == \"navy\":\n r, g, b = 0, 0, 128\n elif color == \"dark blue\":\n r, g, b = 0, 0, 139\n elif color == \"medium blue\":\n r, g, b = 0, 0, 205\n elif color == \"blue\":\n r, g, b = 0, 0, 255\n elif color == \"royal blue\":\n r, g, b = 65, 105, 225\n elif color == \"blue violet\":\n r, g, b = 138, 43, 226\n elif color == \"indigo\":\n r, g, b = 75, 0, 130\n elif color == \"dark slate blue\":\n r, g, b = 72, 61, 139\n elif color == \"slate blue\":\n r, g, b = 106, 90, 205\n elif color == \"medium slate blue\":\n r, g, b = 123, 104, 238\n elif color == \"medium purple\":\n r, g, b = 147, 112, 219\n elif color == \"dark magenta\":\n r, g, b = 139, 0, 139\n elif color == \"dark violet\":\n r, g, b = 148, 0, 211\n elif color == \"dark orchid\":\n r, g, b = 153, 50, 204\n elif color == \"medium orchid\":\n r, g, b = 186, 85, 211\n elif color == \"purple\":\n r, g, b = 128, 0, 128\n elif color == \"thistle\":\n r, g, b = 216, 191, 216\n elif color == \"plum\":\n r, g, b = 221, 160, 221\n elif color == \"violet\":\n r, g, b = 238, 130, 238\n elif color == \"magenta\":\n r, g, b = 255, 0, 255\n elif color == \"orchid\":\n r, g, b = 218, 112, 214\n elif color == \"medium violet red\":\n r, g, b = 199, 21, 133\n elif color == \"pale violet red\":\n r, g, b = 219, 112, 147\n elif color == \"deep pink\":\n r, g, b = 255, 20, 147\n elif color == \"hot pink\":\n r, g, b = 255, 105, 180\n elif color == \"light pink\":\n r, g, b = 255, 182, 193\n elif color == \"pink\":\n r, g, b = 255, 192, 203\n elif color == \"antique white\":\n r, g, b = 250, 235, 215\n elif color == \"beige\":\n r, g, b = 245, 245, 220\n elif color == \"bisque\":\n r, g, b = 255, 228, 196\n elif color == \"blanched almond\":\n r, g, b = 255, 235, 205\n elif color == \"wheat\":\n r, g, b = 245, 222, 179\n elif color == \"corn silk\":\n r, g, b = 255, 248, 220\n elif color == \"lemon chiffon\":\n r, g, b = 255, 250, 205\n elif color == \"light golden rod yellow\":\n r, g, b = 250, 250, 210\n elif color == \"light yellow\":\n r, g, b = 255, 255, 224\n elif color == \"saddle brown\":\n r, g, b = 139, 69, 19\n elif color == \"sienna\":\n r, g, b = 160, 82, 45\n elif color == \"chocolate\":\n r, g, b = 210, 105, 30\n elif color == \"peru\":\n r, g, b = 205, 133, 63\n elif color == \"sandy brown\":\n r, g, b = 244, 164, 96\n elif color == \"burly wood\":\n r, g, b = 222, 184, 135\n elif color == \"tan\":\n r, g, b = 210, 180, 140\n elif color == \"rosy brown\":\n r, g, b = 188, 143, 143\n elif color == \"moccasin\":\n r, g, b = 255, 228, 181\n elif color == \"navajo white\":\n r, g, b = 255, 222, 173\n elif color == \"peach puff\":\n r, g, b = 255, 218, 185\n elif color == \"misty rose\":\n r, g, b = 255, 228, 225\n elif color == \"lavender blush\":\n r, g, b = 255, 240, 245\n elif color == \"linen\":\n r, g, b = 250, 240, 230\n elif color == \"old lace\":\n r, g, b = 253, 245, 230\n elif color == \"papaya whip\":\n r, g, b = 255, 239, 213\n elif color == \"sea shell\":\n r, g, b = 255, 245, 238\n elif color == \"mint cream\":\n r, g, b = 245, 255, 250\n elif color == \"slate gray\":\n r, g, b = 112, 128, 144\n elif color == \"light slate gray\":\n r, g, b = 119, 136, 153\n elif color == \"light steel blue\":\n r, g, b = 176, 196, 222\n elif color == \"lavender\":\n r, g, b = 230, 230, 250\n elif color == \"floral white\":\n r, g, b = 255, 250, 240\n elif color == \"alice blue\":\n r, g, b = 240, 248, 255\n elif color == \"ghost white\":\n r, g, b = 248, 248, 255\n elif color == \"honeydew\":\n r, g, b = 240, 255, 240\n elif color == \"ivory\":\n r, g, b = 255, 255, 240\n elif color == \"azure\":\n r, g, b = 240, 255, 255\n elif color == \"snow\":\n r, g, b = 255, 250, 250\n elif color == \"black\":\n r, g, b = 0, 0, 0\n elif color == \"dim gray\":\n r, g, b = 105, 105, 105\n elif color == \"gray\":\n r, g, b = 128, 128, 128\n elif color == \"dark gray\":\n r, g, b = 169, 169, 169\n elif color == \"silver\":\n r, g, b = 192, 192, 192\n elif color == \"light gray\":\n r, g, b = 211, 211, 211\n elif color == \"gainsboro\":\n r, g, b = 220, 220, 220\n elif color == \"white smoke\":\n r, g, b = 245, 245, 245\n elif color == \"white\":\n r, g, b = 255, 255, 255\n else:\n r, g, b = 255, 255, 255\n\n return cs.format(r, g, b, string)","def parseColor(c):\n if c in baseColors:\n return baseColors[c]\n if len(c) == 6:\n return tuple(map(lambda x: int(x, 16), (c[:2], c[2:4], c[4:])))\n if len(c) == 3:\n return tuple(map(lambda x: 16*int(x, 16), c))\n raise ValueError(\"Can't find color '{}'\".format(c))","def select_stylestrs(cfgstr):\n stylestrs = []\n for s in cfgstr.split():\n if s in vars(fmt):\n stylestrs.append(s)\n return stylestrs","def parse_color(color):\n return (color[0], color[1], color[2])","def _process_colors(self, s: str) -> str:\r\n return self._color_regexp.sub(lambda m: self._ansi_equivalent(m.group()), s)","def _proc_color(self, tokens):\n\n keys = tokens.keys()\n if \"red\" in keys: # RGB(A)\n rr, gg, bb = tokens[\"red\"], tokens[\"green\"], tokens[\"blue\"]\n hex2int = lambda h: int(h, 16)\n if \"alpha\" in keys:\n a = tokens[\"alpha\"]\n c = str((hex2int(rr), hex2int(gg), hex2int(bb), hex2int(a)))\n else:\n c = str((hex2int(rr), hex2int(gg), hex2int(bb)))\n elif \"hue\" in keys: # HSV\n r, g, b = hsv_to_rgb(tokens[\"hue\"],\n tokens[\"saturation\"],\n tokens[\"value\"])\n c = str((int(r*255), int(g*255), int(b*255)))\n else:\n c = tokens[\"color\"]\n\n return c","def __init__(self, colorNames):\n self._lengthOfPattern = 0 # will later be queried from the user\n self._palette = '' # initials for color choices, e.g., R for red\n for color in colorNames:\n self._palette += color[0].upper()","def test_colorFormatting(self):\n self.assertEqual(irc.parseFormattedText(\"\\x0301yay\\x03\"), A.fg.black[\"yay\"])\n self.assertEqual(\n irc.parseFormattedText(\"\\x0301,02yay\\x03\"), A.fg.black[A.bg.blue[\"yay\"]]\n )\n self.assertEqual(\n irc.parseFormattedText(\"\\x0301yay\\x0302yipee\\x03\"),\n A.fg.black[\"yay\", A.fg.blue[\"yipee\"]],\n )","def build_rgb_and_opacity(s: str) -> tuple:\n # Set defaults\n color = \"000000\"\n opacity = 1\n\n if s.startswith(\"#\"):\n s = s[1:]\n if len(s) == 8:\n color = s[6:8] + s[4:6] + s[2:4]\n opacity = round(int(s[0:2], 16) / 256, 2)\n elif len(s) == 6:\n color = s[4:6] + s[2:4] + s[0:2]\n elif len(s) == 3:\n color = s[::-1]\n\n return \"#\" + color, opacity","def parse_color(color):\n try:\n color = webcolors.name_to_rgb(color)\n return color.red, color.green, color.blue\n except ValueError:\n pass\n\n try:\n color = webcolors.hex_to_rgb(color)\n return color.red, color.green, color.blue\n except ValueError:\n pass\n\n try:\n data = color.split(\",\")\n return int(data[0]), int(data[1]), int(data[2])\n except Exception:\n pass\n\n return None","def get_colors(stylename):\n style = get_style_by_name(stylename)\n fgcolor = style.style_for_token(Token.Text)['color'] or ''\n if len(fgcolor) in (3, 6):\n # could be 'abcdef' or 'ace' hex, which needs '#' prefix\n try:\n int(fgcolor, 16)\n except TypeError:\n pass\n else:\n fgcolor = \"#\" + fgcolor\n\n return dict(\n bgcolor=style.background_color,\n select=style.highlight_color,\n fgcolor=fgcolor\n )","def test_color__name_str_arg(self):\n for name in (\"aquamarine3\", \"AQUAMARINE3\", \"AqUAmArIne3\"):\n color = pygame.Color(name)\n\n self.assertEqual(color.r, 102)\n self.assertEqual(color.g, 205)\n self.assertEqual(color.b, 170)\n self.assertEqual(color.a, 255)","def formatLookup(format_str):\n pat = '(\\d+)([A-Z])'\n match = re.search(pat, format_str)\n #print match.group()\n \n data_len = int(match.group(1))\n data_fmt = str(match.group(2))\n np_fmt = fitsFormatLookup(data_fmt)\n np_dtype = '%i%s'%(data_len, np_fmt)\n \n return np_dtype, data_len, np_fmt","def colorname(line):\n strline = line.split('\\t')\n\n # get color name and hex\n clname = unidecode.unidecode(strline[0])\n clname = re.sub(BAD_CHARS, '', clname, 0, re.MULTILINE | re.IGNORECASE)\n clname = clname.lower()\n\n hexcol = strline[1].replace('#', '')\n return (clname, hexcol.upper(), strline[0])","def getPredefinedColors(self):\n colorNames = [ 'Comment', \\\n 'Constant', \\\n 'String', \\\n 'VariableName', \\\n 'FunctionName', \\\n 'Keyword', \\\n 'Type', \\\n 'None', \\\n 'Error' \\\n ]\n colors = {}\n for colorName in colorNames:\n colors[colorName]=Color(Token(None,None,colorName),True)\n return colors","def _format_rgb_str(rgb_str):\n return [int(c) for c in re.sub('[^0-9,]', '', rgb_str).split(',')]","def getColorDict():\n scribus.statusMessage(\"Reading existing colors...\")\n colornames = scribus.getColorNames()\n scribus.progressTotal(len(colornames))\n i=0\n colordict={}\n for name in colornames:\n colordict[name]=None\n i=i+1\n scribus.progressSet(i)\n return colordict #we can ask this dict if the color already exists","def getColorValueFromName( strName ):\n dictColor = {\n \"blue\": 0x0000FF,\n \"red\": 0xFF0000,\n \"green\": 0x00FF00,\n \"yellow\": 0xFFFF00,\n \"purple\": 0x801187,\n \"pink\": 0xff00ff,\n \"orange\": 0xff9e00,\n \"brown\": 0x733300,\n \"black\": 0x000000,\n \"grey\": 0x7F7F7F, \n \"white\": 0xFFFFFF,\n };\n try:\n nColor = dictColor[strName.lower()];\n return nColor;\n except:\n pass\n print( \"WRN: abcdk.color.getColorValueFromName: don't know color '%s'\" % strName );\n return -1;","def get_formats(self):\n return tuple(self._names.keys())","def colorize(self, string):\n D = \"(%s)\" % colorize(\"@R{D}\")\n L = \"(%s)\" % colorize(\"@G{L}\")\n DL = \"(%s,%s)\" % (colorize(\"@R{D}\"), colorize(\"@G{L}\"))\n colorized = string.replace(\"(D)\", D)\n colorized = colorized.replace(\"(L)\", L)\n colorized = colorized.replace(\"(D,L)\", DL)\n return colorized","def HTMLColorToRGB(colorstring):","def parse_color_setting(config_string):\n if not config_string:\n return PALETTES[DEFAULT_PALETTE]\n\n # Split the color configuration into parts\n parts = config_string.lower().split(';')\n palette = PALETTES[NOCOLOR_PALETTE].copy()\n for part in parts:\n if part in PALETTES:\n # A default palette has been specified\n palette.update(PALETTES[part])\n elif '=' in part:\n # Process a palette defining string\n definition = {}\n\n # Break the definition into the role,\n # plus the list of specific instructions.\n # The role must be in upper case\n role, instructions = part.split('=')\n role = role.upper()\n\n styles = instructions.split(',')\n styles.reverse()\n\n # The first instruction can contain a slash\n # to break apart fg/bg.\n colors = styles.pop().split('/')\n colors.reverse()\n foreg = colors.pop()\n if foreg in COLOR_NAMES:\n definition['fg'] = foreg\n if colors and colors[-1] in COLOR_NAMES:\n definition['bg'] = colors[-1]\n\n # All remaining instructions are options\n opts = tuple(s for s in styles if s in OPT_DICT.keys())\n if opts:\n definition['opts'] = opts\n\n # The nocolor palette has all available roles.\n # Use that palette as the basis for determining\n # if the role is valid.\n if role in PALETTES[NOCOLOR_PALETTE] and definition:\n palette[role] = definition\n\n # If there are no colors specified, return the empty palette.\n if palette == PALETTES[NOCOLOR_PALETTE]:\n return None\n return palette","def get_colors():\n colors = {}\n for h in wn.synset('chromatic_color.n.01').hyponyms():\n colors[h.lemmas()[0].name()] = [l.name() for l in h.lemmas()]\n colors[h.lemmas()[0].name()].extend(all_hyponyms(h)) \n for h in wn.synset('achromatic_color.n.01').hyponyms():\n colors[h.lemmas()[0].name()] = [l.name() for l in h.lemmas()]\n colors[h.lemmas()[0].name()].extend(all_hyponyms(h)) \n return colors","def split_color_string(color_string):\n if not color_string:\n return []\n return [thing for thing in regexes[\"whitespace\"].split(color_string) if thing]","def get_colors(lines):\n\n patt = re.compile('\\#\\w+')\n\n return [\n patt.search(line).group(0)\n for line in lines\n if patt.search(line)\n ]","def getColors():\n return ['#8c99fc', '#cacefd', '#fff1d7', '#feda98', '#fda85a', '#fc6647']","def __get_colour_from_string(self, colour_string):\n # Return the RGB list (black if not in dictionary)\n return self.__colour_dictionary.get(colour_string, color.black.value)","def convColor(colorString):\n if len(colorString) != 6:\n return None\n r, g, b = colorString[:2], colorString[2:4], colorString[4:]\n r, g, b = [int(n, 16) for n in (r, g, b)]\n return (r, g, b)","def string_to_color(s):\n if type(s) is not str:\n raise TypeError(\"s must be a string\")\n\n if not(s.startswith(\"#\") or s.startswith(\"0x\")):\n raise ValueError(\"value is not Color-compatible\")\n\n if s.startswith(\"#\"):\n s = s[1:]\n else:\n s = s[2:]\n\n r, g, b, a = 255, 255, 255, 255\n if len(s) in (3, 4):\n # A triple/quadruple in the form #ead == #eeaadd\n r = int(s[0], 16) << 4 | int(s[0], 16)\n g = int(s[1], 16) << 4 | int(s[1], 16)\n b = int(s[2], 16) << 4 | int(s[2], 16)\n if len(s) == 4:\n a = int(s[3], 16) << 4 | int(s[3], 16)\n elif len(s) in (6, 8):\n r = int(s[0], 16) << 4 | int(s[1], 16)\n g = int(s[2], 16) << 4 | int(s[3], 16)\n b = int(s[4], 16) << 4 | int(s[5], 16)\n if len(s) == 8:\n a = int(s[6], 16) << 4 | int(s[7], 16)\n else:\n raise ValueError(\"value is not Color-compatible\")\n return Color(r, g, b, a)","def parse(\n colstr,\n *,\n hex6=True,\n hex3=True,\n rgbfunc_int=True,\n rgbfunc_float=True,\n rgbfunc_percent=True,\n name_css=True,\n name_crayola=True,\n name_xkcd=True,\n name_meodai_best=True,\n name_meodai=True,\n):\n funcs = []\n if hex6:\n funcs.append(parse_hex6)\n if hex3:\n funcs.append(parse_hex3)\n if rgbfunc_int:\n funcs.append(parse_rgbfunc_int)\n if rgbfunc_float:\n funcs.append(parse_rgbfunc_float)\n if rgbfunc_percent:\n funcs.append(parse_rgbfunc_percent)\n if name_css:\n funcs.append(parse_name_css)\n if name_crayola:\n funcs.append(parse_name_crayola)\n if name_xkcd:\n funcs.append(parse_name_xkcd)\n if name_meodai_best:\n funcs.append(parse_name_meodai_best)\n if name_meodai:\n funcs.append(parse_name_meodai)\n\n res = None\n for func in funcs:\n try:\n res = func(colstr)\n except ValueError:\n pass\n if res is None:\n raise ValueError(f\"Could not find a working parser for {colstr!r}.\")\n return res","def hex2color(s):\n hexColorPattern = re.compile(\"\\A#[a-fA-F0-9]{6}\\Z\")\n if not isinstance(s, basestring):\n raise TypeError('hex2color requires a string argument')\n if hexColorPattern.match(s) is None:\n raise ValueError('invalid hex color string \"%s\"' % s)\n return tuple([int(n, 16)/255.0 for n in (s[1:3], s[3:5], s[5:7])])","def create_fixes_list(cls, string: str) -> List[str]:\n\n fixes = []\n\n for colour in COLOURS:\n if string.find(colour) != -1:\n fixes.append(colour)\n\n return fixes","def test_is_valid_color_name(self):\n self.assertTrue(is_valid_color_name('black'))\n self.assertTrue(is_valid_color_name('red'))\n self.assertFalse(is_valid_color_name('#aabb11'))\n self.assertFalse(is_valid_color_name('bl(ack'))","def formatted(s):\n matches = re.findall(_format_re, normalize(s))\n if len(matches) == 1 and matches[0][0] != '':\n return matches[0][0]\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\n if txt_none != '':\n return FORMAT_NONE, txt_none\n elif txt_sw != '':\n return FORMAT_SW, txt_sw\n elif txt_rem != '':\n return FORMAT_REM, txt_rem\n elif txt_em != '':\n return FORMAT_EM, txt_em\n elif txt_a != '':\n return FORMAT_A, txt_a\n return [to_fmt(*m) for m in matches]","def from_name (name_str):\n if name_str in colour_names:\n return Colour(*colour_names[name_str])\n raise KeyError(\"'%s' is not a recognized colour name\"%name_str)","def as_variable_name(self, string):\n return idaapi.COLSTR(string, idaapi.SCOLOR_REG)","def parse_format(var_sample):\n # ugh\n ret = []\n # Parsing format information\n # Need to see what all these could be...\n if None in var_sample[\"GT\"]:\n ret.append(3)\n elif var_sample[\"GT\"] == (0, 0):\n ret.append(0)\n elif var_sample[\"GT\"] == (0, 1):\n ret.append(1)\n elif var_sample[\"GT\"] == (1, 1):\n ret.append(2)\n \n ret.extend([var_sample[\"GQ\"] if var_sample[\"GQ\"] is not None else 0,\n var_sample[\"OV\"],\n var_sample[\"DP\"], # be careful these aren't '.'\n #split where _r is ref-allele and _a is alt-allele\n var_sample[\"AD\"][0],\n var_sample[\"AD\"][1],\n var_sample[\"PDP\"],\n var_sample[\"PAD\"][0],\n var_sample[\"PAD\"][1],\n var_sample[\"US\"][0],\n var_sample[\"US\"][1],\n var_sample[\"DS\"][0],\n var_sample[\"DS\"][1],\n var_sample[\"UC\"][0],\n var_sample[\"UC\"][1],\n var_sample[\"DC\"][0],\n var_sample[\"DC\"][1],\n var_sample[\"UDC\"][0],\n var_sample[\"UDC\"][1],\n var_sample[\"UCC\"][0],\n var_sample[\"UCC\"][1],\n var_sample[\"DDC\"][0],\n var_sample[\"DDC\"][1],\n var_sample[\"DCC\"][0],\n var_sample[\"DCC\"][1],\n var_sample[\"UMO\"][0],\n var_sample[\"UMO\"][1],\n var_sample[\"DMO\"][0],\n var_sample[\"DMO\"][1],\n var_sample[\"UXO\"][0],\n var_sample[\"UXO\"][1],\n var_sample[\"DXO\"][0],\n var_sample[\"DXO\"][1],\n var_sample[\"NR\"][0],\n var_sample[\"NR\"][1],\n var_sample[\"MO\"][0],\n var_sample[\"MO\"][1],\n var_sample[\"XO\"][0],\n var_sample[\"XO\"][1],\n var_sample[\"XC\"][0],\n var_sample[\"XC\"][1],\n var_sample[\"AC\"][0],\n var_sample[\"AC\"][1],\n var_sample[\"MC\"][0],\n var_sample[\"MC\"][1],\n var_sample[\"EC\"][0],\n var_sample[\"EC\"][1],\n var_sample[\"PL\"][0] if var_sample[\"PL\"][0] is not None else 0,\n var_sample[\"PL\"][1] if var_sample[\"PL\"][0] is not None else 0,\n var_sample[\"PL\"][2] if var_sample[\"PL\"][0] is not None else 0])\n return ret\n #END","def cmykstring2rgbstring(s):\n c, m, y, k = [float(j) for j in s.split()]\n r, g, b = cmyk2rgb(c, m, y, k)\n return f\"{r:.6f} {g:.6f} {b:.6f}\"","def parse_color(color_like: ColorLike) -> ColorType:\n if isinstance(color_like, str):\n if color_like.startswith(\"#\"):\n return hex_to_bgr(color_like)\n else:\n return getattr(Color, color_like)\n # TODO: validate?\n return tuple([int(v) for v in color_like])","def colored (string_, color, attrs):\n return string_","def is_color(s):\n def in_range(i): return 0 <= i <= int('0xFFFFFF', 0)\n\n try:\n if type(s) == int:\n return in_range(s)\n elif type(s) not in (str, bytes):\n return False\n elif s in webcolors.css3_names_to_hex:\n return True\n elif s[0] == '#':\n return in_range(int('0x' + s[1:], 0))\n elif s[0:2] == '0x':\n return in_range(int(s, 0))\n elif len(s) == 6:\n return in_range(int('0x' + s, 0))\n except ValueError:\n return False","def extract_pattern(fmt):\n class FakeDict(object):\n def __init__(self):\n self.seen_keys = set()\n\n def __getitem__(self, key):\n self.seen_keys.add(key)\n return ''\n\n def keys(self):\n return self.seen_keys\n\n fake = FakeDict()\n try:\n fmt % fake\n except TypeError:\n # Formatting error\n pass\n return set(fake.keys())","def check_color(style):\n for kw in list(cc.keys()):\n m = re.search(kw, style)\n if m:\n return m.group()\n\n # Return 'b' if nothing has found\n return 'b'","def color_parser(colors, function):\n if isinstance(colors, str):\n return function(colors)\n\n if isinstance(colors, tuple) and isinstance(colors[0], Number):\n return function(colors)\n\n if hasattr(colors, '__iter__'):\n if isinstance(colors, tuple):\n new_color_tuple = tuple(function(item) for item in colors)\n return new_color_tuple\n\n else:\n new_color_list = [function(item) for item in colors]\n return new_color_list","def clr_tuple(colorstring):\n\n if colorstring[0] == '#':\n if len(colorstring) == 7:\n return (ONE_OVER_256 * float(_hexbyte(colorstring[1:3])),\n ONE_OVER_256 * float(_hexbyte(colorstring[3:5])),\n ONE_OVER_256 * float(_hexbyte(colorstring[5:7])))\n if len(colorstring) == 4:\n return (ONE_OVER_16 * float(_hexchar(colorstring[1])),\n ONE_OVER_16 * float(_hexchar(colorstring[2])),\n ONE_OVER_16 * float(_hexchar(colorstring[3])))\n if colorstring in colors.CSS4_COLORS:\n return clr_tuple(colors.CSS4_COLORS[colorstring])\n if colorstring in colors.BASE_COLORS:\n return clr_tuple(colors.BASE_COLORS[colorstring])\n\n rgb_re = re.compile(\"rgb:(.*),(.*),(.*)\")\n\n rgb_match = rgb_re.search(colorstring)\n if rgb_match:\n return (float(rgb_match.group(1)),\n float(rgb_match.group(2)),\n float(rgb_match.group(3)))\n return None","def create_colors_list(color_dict):\r\n ret = []\r\n for i in range(len(color_dict)):\r\n ret.append('#' + color_dict[i]['@rgb'])\r\n return ret","def getColorString(color):\n if type(color) is not int:\n raise TypeError(\"The input to getColorString is not of type int.\")\n if color in COLOR_STRINGS:\n return COLOR_STRINGS[color]\n else:\n raise ValueError(\"Input color not found.\")","def get_color_schemes() -> dict[str, dict[str, str]]:\n COLOR_SCHEMES_FILE = Path(__file__).parent / \"color_schemes.tsv\"\n name2color_scheme = {}\n with open(COLOR_SCHEMES_FILE) as f:\n reader = csv.reader(f, delimiter=\"\\t\")\n header = next(reader)\n letters = header[1:]\n for row in reader:\n name, colors = row[0], row[1:]\n color_scheme = {}\n for letter, color in zip(letters, colors):\n color_scheme[letter] = color\n name2color_scheme[name] = color_scheme\n return name2color_scheme","def test_color__name_str_arg_from_colordict(self):\n for name, values in THECOLORS.items():\n color = pygame.Color(name)\n\n self.assertEqual(color.r, values[0])\n self.assertEqual(color.g, values[1])\n self.assertEqual(color.b, values[2])\n self.assertEqual(color.a, values[3])","def color_conversion(string):\n if (string == 'J'):\n return 0.14\n if (string == 'I'):\n return 0.28\n if (string == 'H'):\n return 0.42\n if (string == 'G'):\n return 0.56\n if (string == 'F'):\n return 0.70\n if (string == 'E'):\n return 0.84\n if (string == 'D'):\n return 1","def setColorConf(colors,ngroups)->list:\n if colors == \"hcl\":\n try:\n from colorspace import sequential_hcl\n color_repo = sequential_hcl(h=[15,375],l=65,c=70)\n colors_list = color_repo.colors(ngroups + 1)\n except ImportError:\n print('hcl colorspace package has not being installed.')\n print('please try the following command:')\n print('pip install git+https://github.com/retostauffer/python-colorspace')\n else:\n colors = list(plt.get_cmap(colors).colors)\n colors_list = [to_hex(color) for color in colors]\n colors_list = colors_list[:ngroups]\n\n return colors_list","def _read_color_labels(filename):\n line_parser = lambda line: (int(line.split(',')[0]), line.split(',')[-1])\n with open(filename, 'r') as labels:\n label_map = dict([line_parser(line.strip()) for line in labels])\n return label_map","def color(c):\n\n if isinstance(c, tuple) and len(c) == 4:\n return c\n\n if c is None:\n return c\n\n if isinstance(c, basestring):\n if c[0] == '#':\n c = c[1:]\n\n if len(c) == 6:\n r = int(c[0]+c[1], 16)\n g = int(c[2]+c[3], 16)\n b = int(c[4]+c[5], 16)\n a = 255\n elif len(c) == 8:\n r = int(c[0]+c[1], 16)\n g = int(c[2]+c[3], 16)\n b = int(c[4]+c[5], 16)\n a = int(c[6]+c[7], 16)\n elif len(c) == 3:\n r = int(c[0], 16) * 0x11\n g = int(c[1], 16) * 0x11\n b = int(c[2], 16) * 0x11\n a = 255\n elif len(c) == 4:\n r = int(c[0], 16) * 0x11\n g = int(c[1], 16) * 0x11\n b = int(c[2], 16) * 0x11\n a = int(c[3], 16) * 0x11\n else:\n raise Exception(\"Color string must be 3, 4, 6, or 8 hex digits long.\")\n\n return (r, g, b, a)\n\n raise Exception(\"Not a color: %r\" % (c,))","def update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\n and token.group(\"key\") in placeholder_formats\n ):\n output.append(f\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\")\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def hexToRgb(self, str):\n\n # If hex is shorthand, convert to a double value first.\n if len(str) == 3:\n val_1 = (int(str[0:1] * 2, 16))\n val_2 = (int(str[1:2] * 2, 16))\n val_3 = (int(str[2:3] * 2, 16))\n\n else:\n val_1 = (int(str[0:2], 16))\n val_2 = (int(str[2:4], 16))\n val_3 = (int(str[4:6], 16))\n\n # Return the preformatted string with the new values.\n return 'rgb(%d, %d, %d)' % (val_1, val_2, val_3)","def cleanup_passed_color_value(s):\n reo = re.compile('[0-9a-f]')\n cannotBeCleaned = ''\n if s[0] == '#' and len(s) in [4,7] and reo.match(s[1:]):\n return s\n if s in colorNamesAndCodes:\n col = colorNamesAndCodes[s]\n if reo.match(col[1:]):\n return col\n else:\n return cannotBeCleaned\n if len(s) in [3,6] and reo.match(s):\n return '#' + s\n if len(s) == 2 and reo.match(s):\n return '#' +s +s +s\n return cannotBeCleaned","def _get_colors():\n mapping = {\n \"terminal\": -1,\n \"black\": curses.COLOR_BLACK,\n \"red\": curses.COLOR_RED,\n \"green\": curses.COLOR_GREEN,\n \"yellow\": curses.COLOR_YELLOW,\n \"blue\": curses.COLOR_BLUE,\n \"magenta\": curses.COLOR_MAGENTA,\n \"cyan\": curses.COLOR_CYAN,\n \"white\": curses.COLOR_WHITE,\n }\n\n cp = get_config_file()\n\n if \"general\" in cp.sections():\n general = cp[\"general\"]\n else:\n general = {}\n\n defaults = {\n \"color_default_background\": \"black\",\n \"color_default_foreground\": \"white\",\n \"color_correct_background\": \"black\",\n \"color_correct_foreground\": \"green\",\n \"color_wrong_background\": \"red\",\n \"color_wrong_foreground\": \"white\",\n \"color_target_background\": \"magenta\",\n \"color_target_foreground\": \"white\",\n \"color_replay_background\": \"blue\",\n \"color_replay_foreground\": \"white\",\n }\n\n colors = {}\n\n for name, default in defaults.items():\n color = general.get(name, default)\n\n if color not in mapping:\n raise KeyError(f\"Unsupported color {color}\")\n\n colors[name] = mapping[color]\n\n return colors","def _get_format_from_style(self, token, style):\n result = QtGui.QTextCharFormat()\n for key, value in style.style_for_token(token).items():\n if value:\n if key == 'color':\n result.setForeground(self._get_brush(value))\n elif key == 'bgcolor':\n result.setBackground(self._get_brush(value))\n elif key == 'bold':\n result.setFontWeight(QtGui.QFont.Bold)\n elif key == 'italic':\n result.setFontItalic(True)\n elif key == 'underline':\n result.setUnderlineStyle(\n QtGui.QTextCharFormat.SingleUnderline)\n elif key == 'sans':\n result.setFontStyleHint(QtGui.QFont.SansSerif)\n elif key == 'roman':\n result.setFontStyleHint(QtGui.QFont.Times)\n elif key == 'mono':\n result.setFontStyleHint(QtGui.QFont.TypeWriter)\n return result","def condense_std_named_colors(css):\n log.debug(\"Condensing standard named color values.\")\n for color_name, color_hexa in iter(tuple({\n ':aqua;': ':#0ff;', ':blue;': ':#00f;',\n ':fuchsia;': ':#f0f;', ':yellow;': ':#ff0;'}.items())):\n css = css.replace(color_name, color_hexa)\n return css","def get_colors(use=True):\n colors = {\n \"BLACK\": \"\\033[0;30m\",\n \"DARK_GRAY\": \"\\033[1;30m\",\n \"RED\": \"\\033[0;31m\",\n \"LIGHT_RED\": \"\\033[1;31m\",\n \"GREEN\": \"\\033[0;32m\",\n \"LIGHT_GREEN\": \"\\033[1;32m\",\n \"BLUE\": \"\\033[0;34m\",\n \"LIGHT_BLUE\": \"\\033[1;34m\",\n \"MAGENTA\": \"\\033[0;35m\",\n \"LIGHT_MAGENTA\": \"\\033[1;35m\",\n \"CYAN\": \"\\033[0;36m\",\n \"LIGHT_CYAN\": \"\\033[1;36m\",\n \"LIGHT_GRAY\": \"\\033[0;37m\",\n \"WHITE\": \"\\033[1;37m\",\n \"DEFAULT_COLOR\": \"\\033[00m\",\n \"ENDC\": \"\\033[0m\",\n }\n\n if not use:\n for color in colors:\n colors[color] = ''\n\n return colors","def initFormat(self):\n self.formatList = self.splitText(self.format)","def clean_colors(self):\n err = _(\"Color must be a valid hex triplet.\")\n colors = ['background_color_custom', 'font_color_custom']\n colors2 = colors + ['background_color', 'font_color']\n # If there are custom colors specified in settings, length of\n # self.COLORS will be > 6, so check for validity\n if len(self.COLORS) > 6:\n colors = colors2\n for color in colors:\n c = getattr(self, color)\n l = len(c)\n if l:\n if l != 6:\n raise ValidationError(err)\n else:\n try:\n int(c, 16)\n except ValueError:\n raise ValidationError(err)","def colors(self):\n\t\treturn [(0, 30, 255),(0, 30, 120)]","def test_color__html_str_arg(self):\n # See test_webstyle() for related tests.\n color = pygame.Color(\"#a1B2c3D4\")\n\n self.assertEqual(color.r, 0xA1)\n self.assertEqual(color.g, 0xB2)\n self.assertEqual(color.b, 0xC3)\n self.assertEqual(color.a, 0xD4)","def get_placeholders(self, format_string):\n placeholders = set()\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.add(token.group(\"key\"))\n elif token.group(\"command\"):\n # get any placeholders used in commands\n commands = dict(parse_qsl(token.group(\"command\")))\n # placeholders only used in `if`\n if_ = commands.get(\"if\")\n if if_:\n placeholders.add(Condition(if_).variable)\n return placeholders","def guess_format(string):\n format_regexps = _compiled_format_regexps(_date_formats, _time_formats)\n for format, regexp in format_regexps:\n if regexp.search(string):\n return format\n # Nothing matched\n raise CannotParse(\"Could not guess date/time format in: %s\" % string)","def colorFlags(filterStr=\"\"):\n\tfilterStr = filterStr.upper()\n\tflags = [i for i in dir(cv2) if i.startswith('COLOR_') and filterStr in i]\n\treturn flags","def get_color_styles(color: str) -> str:\r\n # fmt: off\r\n color_selectors = [\"a\", \"a:hover\", \".stMultiSelect span:hover svg\", \".streamlit-expanderHeader:hover\"]\r\n bg_selectors = ['.stCheckbox label span[aria-checked=\"true\"]', \".stMultiSelect span\"]\r\n border_selectors = [\".stSelectbox > div[aria-controls] > div\", \".stMultiSelect > div[aria-controls] > div\", \".stTextArea > div:focus-within\", \".streamlit-expanderHeader:hover\"]\r\n fill_selectors = [\".streamlit-expanderHeader:hover svg\", \".stMultiSelect span:hover svg\"]\r\n # fmt: on\r\n css_root = \"#root { --primary: %s }\" % color\r\n css_color = \", \".join(color_selectors) + \"{ color: %s !important }\" % color\r\n css_fill = \", \".join(fill_selectors) + \"{ fill: %s !important }\" % color\r\n css_bg = \", \".join(bg_selectors) + \"{ background-color: %s !important }\" % color\r\n css_border = \", \".join(border_selectors) + \"{ border-color: %s !important }\" % color\r\n other = \".decoration { background: %s !important } code { color: inherit }\" % color\r\n return f\"<style>{css_root}{css_color}{css_bg}{css_border}{css_fill}{other}</style>\"","def prepare_colors(self):\n colors = self.colors\n # check whether user has defined colors, if not generate random colors\n if not colors :\n random_colors = [ random.randrange(0, 255) for i in range(3)]\n colors = {\n 'fillColor' : \"rgba({},{},{},0.2)\".format(*random_colors),\n 'strokeColor': \"rgba({},{},{},1)\".format(*random_colors),\n 'pointColor': \"rgba({},{},{},1)\".format(*random_colors),\n 'pointStrokeColor': \"#fff\",\n 'pointHighlightFill': \"#fff\",\n 'pointHighlightStroke': \"rgba({},{},{},1)\".format(*random_colors),\n }\n return colors","def highlight_series(s):\n return ['background-color: #eee' for v in s]","def getColor(k) :\n colors = [\"#862B59\",\"#A10000\",\"#0A6308\",\"#123677\",\"#ff8100\",\"#F28686\",\"#6adf4f\",\"#58ccdd\",\"#3a3536\",\"#00ab7c\"]\n return colors[k]","def get_colors(cls, font) -> tuple:\n\n return font[BFC]","def _color_info_text(self):\n\n t = ''\n for info in self.color_info:\n if info == 'rgbhex':\n t1 = tks.color_funcs.rgb_to_hex_string(self.rgb)\n elif info == 'rgb':\n t1 = tks.color_funcs.rgb_to_rgb_string(self.rgb, dp=2)\n elif info == 'hsv':\n t1 = tks.color_funcs.rgb_to_hsv_string(self.rgb, dp=2)\n elif info == 'hls':\n t1 = tks.color_funcs.rgb_to_hls_string(self.rgb, dp=2)\n\n t = t + '%s\\n' % t1\n\n return t","def assigning_colors():\n rgb_colors = {}\n for name, hex in matplotlib.colors.cnames.items():\n color = []\n # So the values are from 0-255 and not 0-1\n for i in matplotlib.colors.to_rgb(hex):\n color.append(int(i * 255))\n\n color = tuple(color)\n rgb_colors[name] = color\n\n return rgb_colors","def hex_color(s):\n\n if s.startswith(\"#\"):\n s = s[1:]\n valid = len(s) in [1, 2, 3, 4, 6, 12] and set(s) <= set(string.hexdigits)\n if not valid:\n raise ValueError(\"colour must be 1,2,3,4,6, or 12 hex-digits\")\n\n # For the 4-bit RGB, expand to 8-bit, by repeating digits.\n if len(s) == 3:\n s = \"\".join(c + c for c in s)\n\n if len(s) in [1, 2, 4]:\n # Single grey value.\n return (int(s, 16),)\n\n if len(s) in [6, 12]:\n w = len(s) // 3\n return tuple(int(s[i : i + w], 16) for i in range(0, len(s), w))","def get_color(cls, string_color: str) -> Union['Color', bool]:\n r = False\n for color in cls:\n # if color == cls.CSI:\n # continue\n if str(color) == string_color:\n return color\n if not r:\n r = str(color).startswith(string_color)\n\n return r","def get_colour_map(self):\n try:\n return {'C# minor' : 'Grey', 'A major' : 'Red', 'D minor' : 'Green',\n 'Eb Purple': 'greenyellow', 'D major' : 'Pink', 'G major' : 'Orange',\n 'G minor': 'goldenrod', 'A minor' : 'indianred', 'C minor' : 'peachpuff',\n 'B minor' : 'deepskyblue', 'Ab Major' : 'firebrick', 'Eb / D# minor' : 'orchid',\n 'Ab major' : 'moccasin', 'G# minor' : 'slateblue', 'Eb major' : 'turquoise',\n 'C major' : 'tomato', 'B major' : 'darkmagenta', 'F major' : 'olivedrab',\n 'F minor' : 'olive', 'Bb major' : 'lightsteelblue', 'Db major' : 'plum',\n 'Bb minor' : 'mediumspringgreen', 'E minor' : 'lightsalmon',\n 'F# / Gb major' : 'gold', 'F# minor' : 'burlywood'}\n\n # If colour not found to match, return grey as a last resort\n except KeyError as e:\n print('Unmatched colour: {0}'.format(e))\n return 'Grey'","def colors():\n\tenums = dict(\n\t\t#TIME_LEFT=\"red\",\n\t\tname=\"yellow\",\n\t\ttitle=\"magenta\",\n\t\tgenre=\"green\",\n\t\tsynopsis=\"cyan\",\n\t\tduration=\"blue\",\n\t\tdimension=\"red\"\n\t)\n\treturn type('Enum', (), enums)","def get_color_words():\n color_word_dict = {}\n color_data = csv.reader(open('./color_names.csv'), delimiter=\",\", quotechar='\"')\n\n for row in color_data:\n if row[0] != \"Colour Name\":\n name = row[0].lower()\n family = row[2].lower()\n hex_value = row[3].lower()\n color_word_dict[name] = (hex_value, family)\n return color_word_dict","def format_color(\n color: Union[ColorInputType, Any],\n warn_if_invalid: bool = True\n) -> Union[ColorType, Any]:\n if not isinstance(color, ColorInputInstance):\n return color\n if not isinstance(color, pygame.Color):\n try:\n if isinstance(color, VectorInstance) and 3 <= len(color) <= 4:\n if PYGAME_V2:\n for j in color:\n if not isinstance(j, int):\n raise ValueError('color cannot contain floating point values')\n c = pygame.Color(*color)\n else:\n c = pygame.Color(color)\n except ValueError:\n if warn_if_invalid:\n warn(f'invalid color value \"{color}\"')\n else:\n raise\n return color\n else:\n c = color\n return c.r, c.g, c.b, c.a","def get_color(self):\n colors = []\n color_specs = [self._red_spec, self._green_spec,\n self._blue_spec, self._white_spec]\n for spec in color_specs:\n driver = DRIVERS[spec.addr]\n colors.append(driver.get_duty_cycle(spec.pin))\n \n return colors","def read_colormap(name):\n\n path = get_demo_file(name + '.c3g')\n\n out = []\n with open(path, 'r') as file:\n for line in file:\n if 'rgb(' not in line:\n continue\n line = line.split('(')[-1].split(')')[0]\n out.append([float(n) for n in line.split(',')])\n\n return np.asarray(out).astype(float) / 256.","def _colorstr(self, args):","def importColors(colorlist):\n colordict=getColorDict()\n scribus.statusMessage(\"Defining new colors...\")\n scribus.progressTotal(len(colorlist))\n i=0\n for color in colorlist:\n name=color[0]\n c=color[1]\n m=color[2]\n y=color[3]\n k=color[4]\n while colordict.has_key(name):# check if color already exists - then add PREFIX to name\n name = PREFIX+name\n \n scribus.defineColor(name, c, m, y, k)\n i=i+1\n scribus.progressSet(i)","def stylecrunch(stystr):\n return dict(pair.split(\":\") for pair in semicolons.findall(stystr))","def test_string_to_rgb(self):\r\n strgb = string_to_rgb # for convenience\r\n self.assertEqual(strgb('#000000'), (0, 0, 0))\r\n self.assertEqual(strgb('#FFFFFF'), (255, 255, 255))\r\n self.assertEqual(strgb('#F0F0F0'), (240, 240, 240))\r\n self.assertEqual(strgb('#AFF0AA'), (175, 240, 170))","def _get_named_css(self):\n\n return [(name, style, attributes) for (name, (order, style, attributes)) in sorted(self._named_css.items(), key=operator.itemgetter(1))]"],"string":"[\n \"def reformatColor(self, colorStr):\\n if type(colorStr) is str:\\n if colorStr.startswith('#'):\\n colorStr = colorStr.replace('#', '')\\n else:\\n raise Exception('color is not hex format')\\n r = int(colorStr[:2], 16)\\n g = int(colorStr[2:4], 16)\\n b = int(colorStr[4:6], 16)\\n return r, g, b\",\n \"def get_placeholder_formats_list(self, format_string):\\n placeholders = []\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"placeholder\\\"):\\n placeholders.append((token.group(\\\"key\\\"), token.group(\\\"format\\\")))\\n return placeholders\",\n \"def parse_color(self):\\n begin = self.tokenizer.next()\\n begin.must_be('{')\\n for name in self.tokenizer:\\n if name.text == '}': return\\n name.must_match(\\\"^[A-Za-z]\\\", \\\"%d:%d: Expected a color name, got %s instead.\\\" % (name.line, name.col, name.text))\\n midpunct = self.tokenizer.next()\\n if midpunct.text == \\\"{\\\":\\n color = self.mkColor(name)\\n if color in self.ColorDefinitions:\\n raise Exception(\\\"%d:%d: Color %s has already been defined.\\\" % (name.line, name.col, name.text))\\n self.ColorDefinitions[name.text] = color\\n elif midpunct.text == ':':\\n stack = []\\n for token in self.tokenizer:\\n if token.text == \\\".\\\":\\n self.OrderedColorMappings += [Mapping(name,stack)]\\n break\\n elif token.text == \\\"}\\\": raise Exception(\\\"%d:%d: Color section ended while defining mapping for color %s\\\" % (name.line, name.col, name.text))\\n try:\\n stack += [ self.GlobalSymbolDict[token.text] ]\\n except:\\n raise Exception(\\\"%d:%d: Literal %s does not occur in the grammar\\\" % (token.line, token.col, token.text))\\n \\n elif midpunct.text == '}': raise Exception(\\\"%d:%d: Coloring section ended unexpectedly here.\\\" % (token.line, token.col))\\n else: raise Exception(\\\"%d:%d: Expected : or {, not %s\\\" % (midpunct.line, midpunct.col, midpunct.text))\\n raise Exception(\\\"%d:%d: Unexpected end-of-file while scanning color definition section beginning here.\\\" % (begin.line, begin.col))\",\n \"def from_str (s):\\n try: \\n return from_csv(s)\\n except Exception: \\n pass\\n \\n try: \\n return from_hex(s)\\n except Exception: \\n pass\\n\\n try:\\n return from_name(s)\\n except Exception: \\n pass\\n\\n raise ColourFormatError(\\\"'%s' is not a recognized colour string\\\"%s)\",\n \"def parse_styles(text: str) -> List[dict]:\\n styles = []\\n regex = r'(\\\\d{3})=(\\\".*?\\\"),(\\\\d+\\\\.?\\\\d+),(\\\\(.*?\\\\))'\\n\\n for line in text.split(\\\"\\\\r\\\\n\\\"):\\n if line == \\\"\\\":\\n continue\\n\\n n, font, font_size, color = re.match(regex, line).groups()\\n styles.append(\\n {\\n \\\"id\\\": int(n),\\n \\\"f\\\": font.replace('\\\"', \\\"\\\"),\\n \\\"fs\\\": float(font_size),\\n \\\"rgb\\\": [\\n int(i)\\n for i in color.replace(\\\"(\\\", \\\"\\\")\\n .replace(\\\")\\\", \\\"\\\").split(\\\",\\\")]\\n }\\n )\\n\\n return styles\",\n \"def tokens(self, format_string):\\n if format_string not in self.format_string_cache:\\n tokens = list(re.finditer(self.reg_ex, format_string))\\n self.format_string_cache[format_string] = tokens\\n return self.format_string_cache[format_string]\",\n \"def parse_color(colstr):\\n if('rgb' in colstr):\\n expr = r\\\"rgb\\\\(\\\\s*([0-9]{1,3})\\\\,\\\\s*([0-9]{1,3})\\\\,\\\\s*([0-9]{1,3})\\\\s*\\\\)\\\"\\n results = re.search(expr, colstr)\\n if(results and len(results.groups()) == 3):\\n rgb = (int(results.group(1)), int(results.group(2)), int(results.group(3)))\\n for val in rgb:\\n if(val > 255):\\n print(\\\"Invalid rgb color. All values should be from 0-255.\\\")\\n exit(-1)\\n\\n return ('rgb', rgb)\\n\\n else:\\n print(\\\"Invalid rgb color. See help for more information\\\")\\n exit(-1)\\n elif('#' in colstr):\\n if(len(colstr) != 7):\\n print(\\\"Invalid hex value. Only 6 digit hex values are supported\\\")\\n exit(-1)\\n else:\\n try:\\n hexval = int(colstr[1:], 16)\\n return (\\\"hex\\\", hexval)\\n except:\\n print(\\\"Failed to parse hex color\\\")\\n exit(-1)\\n elif('hsl' in colstr):\\n expr = r\\\"hsl\\\\(\\\\s*([0-9]{1,3})\\\\,\\\\W*([0-9]{1,3})%{0,1}\\\\,\\\\s*([0-9]{1,3})%{0,1}\\\\s*\\\\)\\\"\\n results = re.search(expr, colstr)\\n if(results and len(results.groups()) == 3):\\n h = int(results.group(1))\\n s = int(results.group(2))\\n l = int(results.group(3))\\n if(h < 0 or h > 359):\\n print(\\\"Hue out of range. Range: 0-359\\\")\\n exit(-1)\\n elif(s < 0 or s > 100):\\n print(\\\"Saturation out of range. Range: 0-100%\\\")\\n exit(-1)\\n elif(l < 0 or s > 100):\\n print(\\\"Lightness out of range. Range: 0-100%\\\")\\n exit(-1)\\n else:\\n return (\\\"hsl\\\", (h, s, l))\\n else:\\n print(\\\"Invalid hsl color. See help for more information\\\")\\n exit(-1)\\n elif('cmyk' in colstr):\\n expr = r\\\"cmyk\\\\(\\\\s*([0-9]{1,3})%{0,1}\\\\,\\\\W*([0-9]{1,3})%{0,1}\\\\,\\\\s*([0-9]{1,3})%{0,1}\\\\,\\\\s*([0-9]{1,3})%{0,1}\\\\s*\\\\)\\\"\\n results = re.search(expr, colstr)\\n if(results and len(results.groups()) == 4):\\n c = int(results.group(1))\\n m = int(results.group(2))\\n y = int(results.group(3))\\n k = int(results.group(4))\\n\\n if(c < 0 or c > 100):\\n print(\\\"Cyan out of range. Range: 0-100%\\\")\\n exit(-1)\\n elif(m < 0 or m > 100):\\n print(\\\"Magenta out of range. Range: 0-100%\\\")\\n exit(-1)\\n elif(y < 0 or y > 100):\\n print(\\\"Yellow out of range. Range: 0-100%\\\")\\n exit(-1)\\n elif(k < 0 or k > 100):\\n print(\\\"Black out of range. Range 0-100%\\\")\\n exit(-1)\\n else:\\n return(\\\"cmyk\\\", (c, m, y, k))\\n else:\\n print(\\\"Invalid cmyk color. See help for more information\\\")\\n exit(-1)\",\n \"def mkColor(self, name):\\n known_attrs = [ 'font-family', 'font-style', 'font-weight', 'font-size', 'text-decoration', 'color', 'background-color' ]\\n stack = []\\n color = Color(name)\\n for token in self.tokenizer:\\n if token.text == \\\";\\\":\\n stack[0].assert_symbol_name\\n if stack[0].text not in known_attrs: raise Exception(\\\"%d:%d: Unknown color attribute %s\\\" % (stack[0].line, stack[0].col, stack[0].text))\\n stack[1].must_be(\\\":\\\")\\n stack[2].must_match(\\\"^\\\\w\\\", \\\"%d:%d: Expected a color attribute value instead of %s\\\" % (stack[2].line, stack[2].col, stack[2].text))\\n color.attrs[stack[0].text] = stack[2].text\\n stack = []\\n elif token.text == \\\"}\\\":\\n return color\\n else:\\n stack += [token]\\n raise Exception(\\\"%d:%d: End-of-file reached while scanning color %s defined here.\\\" % (name.line, name.col, name.text))\",\n \"def parse_colors():\\n var = os.environ.get('LS_COLORS', '')\\n items = var.split(':')\\n ext_map = {}\\n special_map = {}\\n for item in items:\\n try:\\n pattern, val = item.split('=')\\n except ValueError:\\n # TODO\\n continue\\n pattern = pattern.lower()\\n\\n if pattern.startswith('*'):\\n ext_map[pattern[1:]] = val\\n else:\\n special_map[pattern] = val\\n logger.debug(''.join(list('%s %s\\\\n' % (k, v) for k, v in ext_map.items())))\\n return ext_map, special_map\",\n \"def __createStyleFromString(self, string):\\n\\n matches = re.findall(r\\\"([^=]+)=([^;]+)(;|$)\\\", str(string).lower());\\n if not matches :\\n return False;\\n\\n\\n style = OutputFormatterStyle();\\n for match in matches:\\n if ('fg' == match[0]) :\\n style.setForeground(match[1]);\\n elif ('bg' == match[0]) :\\n style.setBackground(match[1]);\\n else :\\n style.setOption(match[1]);\\n\\n\\n\\n return style;\",\n \"def format_color_name(string, frame_name):\\n if frame_name == \\\"primary\\\":\\n color = \\\"red\\\"\\n else:\\n color = \\\"green\\\"\\n return format_color(string, color)\",\n \"def _string_to_colors(self):\\n string = self.str_colors\\n colors_three = [string[c:c+3] for c in range(0, len(string), 3)]\\n colors_three = [list(color) for color in colors_three]\\n pixels = [[ord(rgb) for rgb in color] for color in colors_three]\\n return pixels\",\n \"def parse_color(raw_color) -> list[float]:\\n if isinstance(raw_color, str):\\n return list(to_rgba(raw_color))\\n return list(raw_color)\",\n \"def format_color(string, color):\\n cs = \\\"\\\\x1b[38;2;{};{};{}m{}\\\\x1b[0m\\\"\\n\\n # my colors\\n if color == \\\"red1\\\":\\n r, g, b = 215, 0, 0\\n elif color == \\\"green1\\\":\\n r, g, b = 0, 255, 0\\n elif color == \\\"blue1\\\":\\n r, g, b = 50, 50, 255\\n\\n # list from https://www.rapidtables.com/web/color/RGB_Color.html\\n elif color == \\\"Black\\\":\\n r, g, b = 0, 0, 0\\n elif color == \\\"White\\\":\\n r, g, b = 255, 255, 255\\n elif color == \\\"Red\\\":\\n r, g, b = 255, 0, 0\\n elif color == \\\"Lime\\\":\\n r, g, b = 0, 255, 0\\n elif color == \\\"Blue\\\":\\n r, g, b = 0, 0, 255\\n elif color == \\\"Yellow\\\":\\n r, g, b = 255, 255, 0\\n elif color == \\\"Cyan\\\":\\n r, g, b = 0, 255, 255\\n elif color == \\\"Magenta\\\":\\n r, g, b = 255, 0, 255\\n elif color == \\\"Silver\\\":\\n r, g, b = 192, 192, 192\\n elif color == \\\"Gray\\\":\\n r, g, b = 128, 128, 128\\n elif color == \\\"Maroon\\\":\\n r, g, b = 128, 0, 0\\n elif color == \\\"Olive\\\":\\n r, g, b = 128, 128, 0\\n elif color == \\\"Green\\\":\\n r, g, b = 0, 128, 0\\n elif color == \\\"Purple\\\":\\n r, g, b = 128, 0, 128\\n elif color == \\\"Teal\\\":\\n r, g, b = 0, 128, 128\\n elif color == \\\"Navy\\\":\\n r, g, b = 0, 0, 128\\n elif color == \\\"maroon\\\":\\n r, g, b = 128, 0, 0\\n elif color == \\\"dark red\\\":\\n r, g, b = 139, 0, 0\\n elif color == \\\"brown\\\":\\n r, g, b = 165, 42, 42\\n elif color == \\\"firebrick\\\":\\n r, g, b = 178, 34, 34\\n elif color == \\\"crimson\\\":\\n r, g, b = 220, 20, 60\\n elif color == \\\"red\\\":\\n r, g, b = 255, 0, 0\\n elif color == \\\"tomato\\\":\\n r, g, b = 255, 99, 71\\n elif color == \\\"coral\\\":\\n r, g, b = 255, 127, 80\\n elif color == \\\"indian red\\\":\\n r, g, b = 205, 92, 92\\n elif color == \\\"light coral\\\":\\n r, g, b = 240, 128, 128\\n elif color == \\\"dark salmon\\\":\\n r, g, b = 233, 150, 122\\n elif color == \\\"salmon\\\":\\n r, g, b = 250, 128, 114\\n elif color == \\\"light salmon\\\":\\n r, g, b = 255, 160, 122\\n elif color == \\\"orange red\\\":\\n r, g, b = 255, 69, 0\\n elif color == \\\"dark orange\\\":\\n r, g, b = 255, 140, 0\\n elif color == \\\"orange\\\":\\n r, g, b = 255, 165, 0\\n elif color == \\\"gold\\\":\\n r, g, b = 255, 215, 0\\n elif color == \\\"dark golden rod\\\":\\n r, g, b = 184, 134, 11\\n elif color == \\\"golden rod\\\":\\n r, g, b = 218, 165, 32\\n elif color == \\\"pale golden rod\\\":\\n r, g, b = 238, 232, 170\\n elif color == \\\"dark khaki\\\":\\n r, g, b = 189, 183, 107\\n elif color == \\\"khaki\\\":\\n r, g, b = 240, 230, 140\\n elif color == \\\"olive\\\":\\n r, g, b = 128, 128, 0\\n elif color == \\\"yellow\\\":\\n r, g, b = 255, 255, 0\\n elif color == \\\"yellow green\\\":\\n r, g, b = 154, 205, 50\\n elif color == \\\"dark olive green\\\":\\n r, g, b = 85, 107, 47\\n elif color == \\\"olive drab\\\":\\n r, g, b = 107, 142, 35\\n elif color == \\\"lawn green\\\":\\n r, g, b = 124, 252, 0\\n elif color == \\\"chart reuse\\\":\\n r, g, b = 127, 255, 0\\n elif color == \\\"green yellow\\\":\\n r, g, b = 173, 255, 47\\n elif color == \\\"dark green\\\":\\n r, g, b = 0, 100, 0\\n elif color == \\\"green\\\":\\n r, g, b = 0, 128, 0\\n elif color == \\\"forest green\\\":\\n r, g, b = 34, 139, 34\\n elif color == \\\"lime\\\":\\n r, g, b = 0, 255, 0\\n elif color == \\\"lime green\\\":\\n r, g, b = 50, 205, 50\\n elif color == \\\"light green\\\":\\n r, g, b = 144, 238, 144\\n elif color == \\\"pale green\\\":\\n r, g, b = 152, 251, 152\\n elif color == \\\"dark sea green\\\":\\n r, g, b = 143, 188, 143\\n elif color == \\\"medium spring green\\\":\\n r, g, b = 0, 250, 154\\n elif color == \\\"spring green\\\":\\n r, g, b = 0, 255, 127\\n elif color == \\\"sea green\\\":\\n r, g, b = 46, 139, 87\\n elif color == \\\"medium aqua marine\\\":\\n r, g, b = 102, 205, 170\\n elif color == \\\"medium sea green\\\":\\n r, g, b = 60, 179, 113\\n elif color == \\\"light sea green\\\":\\n r, g, b = 32, 178, 170\\n elif color == \\\"dark slate gray\\\":\\n r, g, b = 47, 79, 79\\n elif color == \\\"teal\\\":\\n r, g, b = 0, 128, 128\\n elif color == \\\"dark cyan\\\":\\n r, g, b = 0, 139, 139\\n elif color == \\\"aqua\\\":\\n r, g, b = 0, 255, 255\\n elif color == \\\"cyan\\\":\\n r, g, b = 0, 255, 255\\n elif color == \\\"light cyan\\\":\\n r, g, b = 224, 255, 255\\n elif color == \\\"dark turquoise\\\":\\n r, g, b = 0, 206, 209\\n elif color == \\\"turquoise\\\":\\n r, g, b = 64, 224, 208\\n elif color == \\\"medium turquoise\\\":\\n r, g, b = 72, 209, 204\\n elif color == \\\"pale turquoise\\\":\\n r, g, b = 175, 238, 238\\n elif color == \\\"aqua marine\\\":\\n r, g, b = 127, 255, 212\\n elif color == \\\"powder blue\\\":\\n r, g, b = 176, 224, 230\\n elif color == \\\"cadet blue\\\":\\n r, g, b = 95, 158, 160\\n elif color == \\\"steel blue\\\":\\n r, g, b = 70, 130, 180\\n elif color == \\\"corn flower blue\\\":\\n r, g, b = 100, 149, 237\\n elif color == \\\"deep sky blue\\\":\\n r, g, b = 0, 191, 255\\n elif color == \\\"dodger blue\\\":\\n r, g, b = 30, 144, 255\\n elif color == \\\"light blue\\\":\\n r, g, b = 173, 216, 230\\n elif color == \\\"sky blue\\\":\\n r, g, b = 135, 206, 235\\n elif color == \\\"light sky blue\\\":\\n r, g, b = 135, 206, 250\\n elif color == \\\"midnight blue\\\":\\n r, g, b = 25, 25, 112\\n elif color == \\\"navy\\\":\\n r, g, b = 0, 0, 128\\n elif color == \\\"dark blue\\\":\\n r, g, b = 0, 0, 139\\n elif color == \\\"medium blue\\\":\\n r, g, b = 0, 0, 205\\n elif color == \\\"blue\\\":\\n r, g, b = 0, 0, 255\\n elif color == \\\"royal blue\\\":\\n r, g, b = 65, 105, 225\\n elif color == \\\"blue violet\\\":\\n r, g, b = 138, 43, 226\\n elif color == \\\"indigo\\\":\\n r, g, b = 75, 0, 130\\n elif color == \\\"dark slate blue\\\":\\n r, g, b = 72, 61, 139\\n elif color == \\\"slate blue\\\":\\n r, g, b = 106, 90, 205\\n elif color == \\\"medium slate blue\\\":\\n r, g, b = 123, 104, 238\\n elif color == \\\"medium purple\\\":\\n r, g, b = 147, 112, 219\\n elif color == \\\"dark magenta\\\":\\n r, g, b = 139, 0, 139\\n elif color == \\\"dark violet\\\":\\n r, g, b = 148, 0, 211\\n elif color == \\\"dark orchid\\\":\\n r, g, b = 153, 50, 204\\n elif color == \\\"medium orchid\\\":\\n r, g, b = 186, 85, 211\\n elif color == \\\"purple\\\":\\n r, g, b = 128, 0, 128\\n elif color == \\\"thistle\\\":\\n r, g, b = 216, 191, 216\\n elif color == \\\"plum\\\":\\n r, g, b = 221, 160, 221\\n elif color == \\\"violet\\\":\\n r, g, b = 238, 130, 238\\n elif color == \\\"magenta\\\":\\n r, g, b = 255, 0, 255\\n elif color == \\\"orchid\\\":\\n r, g, b = 218, 112, 214\\n elif color == \\\"medium violet red\\\":\\n r, g, b = 199, 21, 133\\n elif color == \\\"pale violet red\\\":\\n r, g, b = 219, 112, 147\\n elif color == \\\"deep pink\\\":\\n r, g, b = 255, 20, 147\\n elif color == \\\"hot pink\\\":\\n r, g, b = 255, 105, 180\\n elif color == \\\"light pink\\\":\\n r, g, b = 255, 182, 193\\n elif color == \\\"pink\\\":\\n r, g, b = 255, 192, 203\\n elif color == \\\"antique white\\\":\\n r, g, b = 250, 235, 215\\n elif color == \\\"beige\\\":\\n r, g, b = 245, 245, 220\\n elif color == \\\"bisque\\\":\\n r, g, b = 255, 228, 196\\n elif color == \\\"blanched almond\\\":\\n r, g, b = 255, 235, 205\\n elif color == \\\"wheat\\\":\\n r, g, b = 245, 222, 179\\n elif color == \\\"corn silk\\\":\\n r, g, b = 255, 248, 220\\n elif color == \\\"lemon chiffon\\\":\\n r, g, b = 255, 250, 205\\n elif color == \\\"light golden rod yellow\\\":\\n r, g, b = 250, 250, 210\\n elif color == \\\"light yellow\\\":\\n r, g, b = 255, 255, 224\\n elif color == \\\"saddle brown\\\":\\n r, g, b = 139, 69, 19\\n elif color == \\\"sienna\\\":\\n r, g, b = 160, 82, 45\\n elif color == \\\"chocolate\\\":\\n r, g, b = 210, 105, 30\\n elif color == \\\"peru\\\":\\n r, g, b = 205, 133, 63\\n elif color == \\\"sandy brown\\\":\\n r, g, b = 244, 164, 96\\n elif color == \\\"burly wood\\\":\\n r, g, b = 222, 184, 135\\n elif color == \\\"tan\\\":\\n r, g, b = 210, 180, 140\\n elif color == \\\"rosy brown\\\":\\n r, g, b = 188, 143, 143\\n elif color == \\\"moccasin\\\":\\n r, g, b = 255, 228, 181\\n elif color == \\\"navajo white\\\":\\n r, g, b = 255, 222, 173\\n elif color == \\\"peach puff\\\":\\n r, g, b = 255, 218, 185\\n elif color == \\\"misty rose\\\":\\n r, g, b = 255, 228, 225\\n elif color == \\\"lavender blush\\\":\\n r, g, b = 255, 240, 245\\n elif color == \\\"linen\\\":\\n r, g, b = 250, 240, 230\\n elif color == \\\"old lace\\\":\\n r, g, b = 253, 245, 230\\n elif color == \\\"papaya whip\\\":\\n r, g, b = 255, 239, 213\\n elif color == \\\"sea shell\\\":\\n r, g, b = 255, 245, 238\\n elif color == \\\"mint cream\\\":\\n r, g, b = 245, 255, 250\\n elif color == \\\"slate gray\\\":\\n r, g, b = 112, 128, 144\\n elif color == \\\"light slate gray\\\":\\n r, g, b = 119, 136, 153\\n elif color == \\\"light steel blue\\\":\\n r, g, b = 176, 196, 222\\n elif color == \\\"lavender\\\":\\n r, g, b = 230, 230, 250\\n elif color == \\\"floral white\\\":\\n r, g, b = 255, 250, 240\\n elif color == \\\"alice blue\\\":\\n r, g, b = 240, 248, 255\\n elif color == \\\"ghost white\\\":\\n r, g, b = 248, 248, 255\\n elif color == \\\"honeydew\\\":\\n r, g, b = 240, 255, 240\\n elif color == \\\"ivory\\\":\\n r, g, b = 255, 255, 240\\n elif color == \\\"azure\\\":\\n r, g, b = 240, 255, 255\\n elif color == \\\"snow\\\":\\n r, g, b = 255, 250, 250\\n elif color == \\\"black\\\":\\n r, g, b = 0, 0, 0\\n elif color == \\\"dim gray\\\":\\n r, g, b = 105, 105, 105\\n elif color == \\\"gray\\\":\\n r, g, b = 128, 128, 128\\n elif color == \\\"dark gray\\\":\\n r, g, b = 169, 169, 169\\n elif color == \\\"silver\\\":\\n r, g, b = 192, 192, 192\\n elif color == \\\"light gray\\\":\\n r, g, b = 211, 211, 211\\n elif color == \\\"gainsboro\\\":\\n r, g, b = 220, 220, 220\\n elif color == \\\"white smoke\\\":\\n r, g, b = 245, 245, 245\\n elif color == \\\"white\\\":\\n r, g, b = 255, 255, 255\\n else:\\n r, g, b = 255, 255, 255\\n\\n return cs.format(r, g, b, string)\",\n \"def parseColor(c):\\n if c in baseColors:\\n return baseColors[c]\\n if len(c) == 6:\\n return tuple(map(lambda x: int(x, 16), (c[:2], c[2:4], c[4:])))\\n if len(c) == 3:\\n return tuple(map(lambda x: 16*int(x, 16), c))\\n raise ValueError(\\\"Can't find color '{}'\\\".format(c))\",\n \"def select_stylestrs(cfgstr):\\n stylestrs = []\\n for s in cfgstr.split():\\n if s in vars(fmt):\\n stylestrs.append(s)\\n return stylestrs\",\n \"def parse_color(color):\\n return (color[0], color[1], color[2])\",\n \"def _process_colors(self, s: str) -> str:\\r\\n return self._color_regexp.sub(lambda m: self._ansi_equivalent(m.group()), s)\",\n \"def _proc_color(self, tokens):\\n\\n keys = tokens.keys()\\n if \\\"red\\\" in keys: # RGB(A)\\n rr, gg, bb = tokens[\\\"red\\\"], tokens[\\\"green\\\"], tokens[\\\"blue\\\"]\\n hex2int = lambda h: int(h, 16)\\n if \\\"alpha\\\" in keys:\\n a = tokens[\\\"alpha\\\"]\\n c = str((hex2int(rr), hex2int(gg), hex2int(bb), hex2int(a)))\\n else:\\n c = str((hex2int(rr), hex2int(gg), hex2int(bb)))\\n elif \\\"hue\\\" in keys: # HSV\\n r, g, b = hsv_to_rgb(tokens[\\\"hue\\\"],\\n tokens[\\\"saturation\\\"],\\n tokens[\\\"value\\\"])\\n c = str((int(r*255), int(g*255), int(b*255)))\\n else:\\n c = tokens[\\\"color\\\"]\\n\\n return c\",\n \"def __init__(self, colorNames):\\n self._lengthOfPattern = 0 # will later be queried from the user\\n self._palette = '' # initials for color choices, e.g., R for red\\n for color in colorNames:\\n self._palette += color[0].upper()\",\n \"def test_colorFormatting(self):\\n self.assertEqual(irc.parseFormattedText(\\\"\\\\x0301yay\\\\x03\\\"), A.fg.black[\\\"yay\\\"])\\n self.assertEqual(\\n irc.parseFormattedText(\\\"\\\\x0301,02yay\\\\x03\\\"), A.fg.black[A.bg.blue[\\\"yay\\\"]]\\n )\\n self.assertEqual(\\n irc.parseFormattedText(\\\"\\\\x0301yay\\\\x0302yipee\\\\x03\\\"),\\n A.fg.black[\\\"yay\\\", A.fg.blue[\\\"yipee\\\"]],\\n )\",\n \"def build_rgb_and_opacity(s: str) -> tuple:\\n # Set defaults\\n color = \\\"000000\\\"\\n opacity = 1\\n\\n if s.startswith(\\\"#\\\"):\\n s = s[1:]\\n if len(s) == 8:\\n color = s[6:8] + s[4:6] + s[2:4]\\n opacity = round(int(s[0:2], 16) / 256, 2)\\n elif len(s) == 6:\\n color = s[4:6] + s[2:4] + s[0:2]\\n elif len(s) == 3:\\n color = s[::-1]\\n\\n return \\\"#\\\" + color, opacity\",\n \"def parse_color(color):\\n try:\\n color = webcolors.name_to_rgb(color)\\n return color.red, color.green, color.blue\\n except ValueError:\\n pass\\n\\n try:\\n color = webcolors.hex_to_rgb(color)\\n return color.red, color.green, color.blue\\n except ValueError:\\n pass\\n\\n try:\\n data = color.split(\\\",\\\")\\n return int(data[0]), int(data[1]), int(data[2])\\n except Exception:\\n pass\\n\\n return None\",\n \"def get_colors(stylename):\\n style = get_style_by_name(stylename)\\n fgcolor = style.style_for_token(Token.Text)['color'] or ''\\n if len(fgcolor) in (3, 6):\\n # could be 'abcdef' or 'ace' hex, which needs '#' prefix\\n try:\\n int(fgcolor, 16)\\n except TypeError:\\n pass\\n else:\\n fgcolor = \\\"#\\\" + fgcolor\\n\\n return dict(\\n bgcolor=style.background_color,\\n select=style.highlight_color,\\n fgcolor=fgcolor\\n )\",\n \"def test_color__name_str_arg(self):\\n for name in (\\\"aquamarine3\\\", \\\"AQUAMARINE3\\\", \\\"AqUAmArIne3\\\"):\\n color = pygame.Color(name)\\n\\n self.assertEqual(color.r, 102)\\n self.assertEqual(color.g, 205)\\n self.assertEqual(color.b, 170)\\n self.assertEqual(color.a, 255)\",\n \"def formatLookup(format_str):\\n pat = '(\\\\d+)([A-Z])'\\n match = re.search(pat, format_str)\\n #print match.group()\\n \\n data_len = int(match.group(1))\\n data_fmt = str(match.group(2))\\n np_fmt = fitsFormatLookup(data_fmt)\\n np_dtype = '%i%s'%(data_len, np_fmt)\\n \\n return np_dtype, data_len, np_fmt\",\n \"def colorname(line):\\n strline = line.split('\\\\t')\\n\\n # get color name and hex\\n clname = unidecode.unidecode(strline[0])\\n clname = re.sub(BAD_CHARS, '', clname, 0, re.MULTILINE | re.IGNORECASE)\\n clname = clname.lower()\\n\\n hexcol = strline[1].replace('#', '')\\n return (clname, hexcol.upper(), strline[0])\",\n \"def getPredefinedColors(self):\\n colorNames = [ 'Comment', \\\\\\n 'Constant', \\\\\\n 'String', \\\\\\n 'VariableName', \\\\\\n 'FunctionName', \\\\\\n 'Keyword', \\\\\\n 'Type', \\\\\\n 'None', \\\\\\n 'Error' \\\\\\n ]\\n colors = {}\\n for colorName in colorNames:\\n colors[colorName]=Color(Token(None,None,colorName),True)\\n return colors\",\n \"def _format_rgb_str(rgb_str):\\n return [int(c) for c in re.sub('[^0-9,]', '', rgb_str).split(',')]\",\n \"def getColorDict():\\n scribus.statusMessage(\\\"Reading existing colors...\\\")\\n colornames = scribus.getColorNames()\\n scribus.progressTotal(len(colornames))\\n i=0\\n colordict={}\\n for name in colornames:\\n colordict[name]=None\\n i=i+1\\n scribus.progressSet(i)\\n return colordict #we can ask this dict if the color already exists\",\n \"def getColorValueFromName( strName ):\\n dictColor = {\\n \\\"blue\\\": 0x0000FF,\\n \\\"red\\\": 0xFF0000,\\n \\\"green\\\": 0x00FF00,\\n \\\"yellow\\\": 0xFFFF00,\\n \\\"purple\\\": 0x801187,\\n \\\"pink\\\": 0xff00ff,\\n \\\"orange\\\": 0xff9e00,\\n \\\"brown\\\": 0x733300,\\n \\\"black\\\": 0x000000,\\n \\\"grey\\\": 0x7F7F7F, \\n \\\"white\\\": 0xFFFFFF,\\n };\\n try:\\n nColor = dictColor[strName.lower()];\\n return nColor;\\n except:\\n pass\\n print( \\\"WRN: abcdk.color.getColorValueFromName: don't know color '%s'\\\" % strName );\\n return -1;\",\n \"def get_formats(self):\\n return tuple(self._names.keys())\",\n \"def colorize(self, string):\\n D = \\\"(%s)\\\" % colorize(\\\"@R{D}\\\")\\n L = \\\"(%s)\\\" % colorize(\\\"@G{L}\\\")\\n DL = \\\"(%s,%s)\\\" % (colorize(\\\"@R{D}\\\"), colorize(\\\"@G{L}\\\"))\\n colorized = string.replace(\\\"(D)\\\", D)\\n colorized = colorized.replace(\\\"(L)\\\", L)\\n colorized = colorized.replace(\\\"(D,L)\\\", DL)\\n return colorized\",\n \"def HTMLColorToRGB(colorstring):\",\n \"def parse_color_setting(config_string):\\n if not config_string:\\n return PALETTES[DEFAULT_PALETTE]\\n\\n # Split the color configuration into parts\\n parts = config_string.lower().split(';')\\n palette = PALETTES[NOCOLOR_PALETTE].copy()\\n for part in parts:\\n if part in PALETTES:\\n # A default palette has been specified\\n palette.update(PALETTES[part])\\n elif '=' in part:\\n # Process a palette defining string\\n definition = {}\\n\\n # Break the definition into the role,\\n # plus the list of specific instructions.\\n # The role must be in upper case\\n role, instructions = part.split('=')\\n role = role.upper()\\n\\n styles = instructions.split(',')\\n styles.reverse()\\n\\n # The first instruction can contain a slash\\n # to break apart fg/bg.\\n colors = styles.pop().split('/')\\n colors.reverse()\\n foreg = colors.pop()\\n if foreg in COLOR_NAMES:\\n definition['fg'] = foreg\\n if colors and colors[-1] in COLOR_NAMES:\\n definition['bg'] = colors[-1]\\n\\n # All remaining instructions are options\\n opts = tuple(s for s in styles if s in OPT_DICT.keys())\\n if opts:\\n definition['opts'] = opts\\n\\n # The nocolor palette has all available roles.\\n # Use that palette as the basis for determining\\n # if the role is valid.\\n if role in PALETTES[NOCOLOR_PALETTE] and definition:\\n palette[role] = definition\\n\\n # If there are no colors specified, return the empty palette.\\n if palette == PALETTES[NOCOLOR_PALETTE]:\\n return None\\n return palette\",\n \"def get_colors():\\n colors = {}\\n for h in wn.synset('chromatic_color.n.01').hyponyms():\\n colors[h.lemmas()[0].name()] = [l.name() for l in h.lemmas()]\\n colors[h.lemmas()[0].name()].extend(all_hyponyms(h)) \\n for h in wn.synset('achromatic_color.n.01').hyponyms():\\n colors[h.lemmas()[0].name()] = [l.name() for l in h.lemmas()]\\n colors[h.lemmas()[0].name()].extend(all_hyponyms(h)) \\n return colors\",\n \"def split_color_string(color_string):\\n if not color_string:\\n return []\\n return [thing for thing in regexes[\\\"whitespace\\\"].split(color_string) if thing]\",\n \"def get_colors(lines):\\n\\n patt = re.compile('\\\\#\\\\w+')\\n\\n return [\\n patt.search(line).group(0)\\n for line in lines\\n if patt.search(line)\\n ]\",\n \"def getColors():\\n return ['#8c99fc', '#cacefd', '#fff1d7', '#feda98', '#fda85a', '#fc6647']\",\n \"def __get_colour_from_string(self, colour_string):\\n # Return the RGB list (black if not in dictionary)\\n return self.__colour_dictionary.get(colour_string, color.black.value)\",\n \"def convColor(colorString):\\n if len(colorString) != 6:\\n return None\\n r, g, b = colorString[:2], colorString[2:4], colorString[4:]\\n r, g, b = [int(n, 16) for n in (r, g, b)]\\n return (r, g, b)\",\n \"def string_to_color(s):\\n if type(s) is not str:\\n raise TypeError(\\\"s must be a string\\\")\\n\\n if not(s.startswith(\\\"#\\\") or s.startswith(\\\"0x\\\")):\\n raise ValueError(\\\"value is not Color-compatible\\\")\\n\\n if s.startswith(\\\"#\\\"):\\n s = s[1:]\\n else:\\n s = s[2:]\\n\\n r, g, b, a = 255, 255, 255, 255\\n if len(s) in (3, 4):\\n # A triple/quadruple in the form #ead == #eeaadd\\n r = int(s[0], 16) << 4 | int(s[0], 16)\\n g = int(s[1], 16) << 4 | int(s[1], 16)\\n b = int(s[2], 16) << 4 | int(s[2], 16)\\n if len(s) == 4:\\n a = int(s[3], 16) << 4 | int(s[3], 16)\\n elif len(s) in (6, 8):\\n r = int(s[0], 16) << 4 | int(s[1], 16)\\n g = int(s[2], 16) << 4 | int(s[3], 16)\\n b = int(s[4], 16) << 4 | int(s[5], 16)\\n if len(s) == 8:\\n a = int(s[6], 16) << 4 | int(s[7], 16)\\n else:\\n raise ValueError(\\\"value is not Color-compatible\\\")\\n return Color(r, g, b, a)\",\n \"def parse(\\n colstr,\\n *,\\n hex6=True,\\n hex3=True,\\n rgbfunc_int=True,\\n rgbfunc_float=True,\\n rgbfunc_percent=True,\\n name_css=True,\\n name_crayola=True,\\n name_xkcd=True,\\n name_meodai_best=True,\\n name_meodai=True,\\n):\\n funcs = []\\n if hex6:\\n funcs.append(parse_hex6)\\n if hex3:\\n funcs.append(parse_hex3)\\n if rgbfunc_int:\\n funcs.append(parse_rgbfunc_int)\\n if rgbfunc_float:\\n funcs.append(parse_rgbfunc_float)\\n if rgbfunc_percent:\\n funcs.append(parse_rgbfunc_percent)\\n if name_css:\\n funcs.append(parse_name_css)\\n if name_crayola:\\n funcs.append(parse_name_crayola)\\n if name_xkcd:\\n funcs.append(parse_name_xkcd)\\n if name_meodai_best:\\n funcs.append(parse_name_meodai_best)\\n if name_meodai:\\n funcs.append(parse_name_meodai)\\n\\n res = None\\n for func in funcs:\\n try:\\n res = func(colstr)\\n except ValueError:\\n pass\\n if res is None:\\n raise ValueError(f\\\"Could not find a working parser for {colstr!r}.\\\")\\n return res\",\n \"def hex2color(s):\\n hexColorPattern = re.compile(\\\"\\\\A#[a-fA-F0-9]{6}\\\\Z\\\")\\n if not isinstance(s, basestring):\\n raise TypeError('hex2color requires a string argument')\\n if hexColorPattern.match(s) is None:\\n raise ValueError('invalid hex color string \\\"%s\\\"' % s)\\n return tuple([int(n, 16)/255.0 for n in (s[1:3], s[3:5], s[5:7])])\",\n \"def create_fixes_list(cls, string: str) -> List[str]:\\n\\n fixes = []\\n\\n for colour in COLOURS:\\n if string.find(colour) != -1:\\n fixes.append(colour)\\n\\n return fixes\",\n \"def test_is_valid_color_name(self):\\n self.assertTrue(is_valid_color_name('black'))\\n self.assertTrue(is_valid_color_name('red'))\\n self.assertFalse(is_valid_color_name('#aabb11'))\\n self.assertFalse(is_valid_color_name('bl(ack'))\",\n \"def formatted(s):\\n matches = re.findall(_format_re, normalize(s))\\n if len(matches) == 1 and matches[0][0] != '':\\n return matches[0][0]\\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\\n if txt_none != '':\\n return FORMAT_NONE, txt_none\\n elif txt_sw != '':\\n return FORMAT_SW, txt_sw\\n elif txt_rem != '':\\n return FORMAT_REM, txt_rem\\n elif txt_em != '':\\n return FORMAT_EM, txt_em\\n elif txt_a != '':\\n return FORMAT_A, txt_a\\n return [to_fmt(*m) for m in matches]\",\n \"def from_name (name_str):\\n if name_str in colour_names:\\n return Colour(*colour_names[name_str])\\n raise KeyError(\\\"'%s' is not a recognized colour name\\\"%name_str)\",\n \"def as_variable_name(self, string):\\n return idaapi.COLSTR(string, idaapi.SCOLOR_REG)\",\n \"def parse_format(var_sample):\\n # ugh\\n ret = []\\n # Parsing format information\\n # Need to see what all these could be...\\n if None in var_sample[\\\"GT\\\"]:\\n ret.append(3)\\n elif var_sample[\\\"GT\\\"] == (0, 0):\\n ret.append(0)\\n elif var_sample[\\\"GT\\\"] == (0, 1):\\n ret.append(1)\\n elif var_sample[\\\"GT\\\"] == (1, 1):\\n ret.append(2)\\n \\n ret.extend([var_sample[\\\"GQ\\\"] if var_sample[\\\"GQ\\\"] is not None else 0,\\n var_sample[\\\"OV\\\"],\\n var_sample[\\\"DP\\\"], # be careful these aren't '.'\\n #split where _r is ref-allele and _a is alt-allele\\n var_sample[\\\"AD\\\"][0],\\n var_sample[\\\"AD\\\"][1],\\n var_sample[\\\"PDP\\\"],\\n var_sample[\\\"PAD\\\"][0],\\n var_sample[\\\"PAD\\\"][1],\\n var_sample[\\\"US\\\"][0],\\n var_sample[\\\"US\\\"][1],\\n var_sample[\\\"DS\\\"][0],\\n var_sample[\\\"DS\\\"][1],\\n var_sample[\\\"UC\\\"][0],\\n var_sample[\\\"UC\\\"][1],\\n var_sample[\\\"DC\\\"][0],\\n var_sample[\\\"DC\\\"][1],\\n var_sample[\\\"UDC\\\"][0],\\n var_sample[\\\"UDC\\\"][1],\\n var_sample[\\\"UCC\\\"][0],\\n var_sample[\\\"UCC\\\"][1],\\n var_sample[\\\"DDC\\\"][0],\\n var_sample[\\\"DDC\\\"][1],\\n var_sample[\\\"DCC\\\"][0],\\n var_sample[\\\"DCC\\\"][1],\\n var_sample[\\\"UMO\\\"][0],\\n var_sample[\\\"UMO\\\"][1],\\n var_sample[\\\"DMO\\\"][0],\\n var_sample[\\\"DMO\\\"][1],\\n var_sample[\\\"UXO\\\"][0],\\n var_sample[\\\"UXO\\\"][1],\\n var_sample[\\\"DXO\\\"][0],\\n var_sample[\\\"DXO\\\"][1],\\n var_sample[\\\"NR\\\"][0],\\n var_sample[\\\"NR\\\"][1],\\n var_sample[\\\"MO\\\"][0],\\n var_sample[\\\"MO\\\"][1],\\n var_sample[\\\"XO\\\"][0],\\n var_sample[\\\"XO\\\"][1],\\n var_sample[\\\"XC\\\"][0],\\n var_sample[\\\"XC\\\"][1],\\n var_sample[\\\"AC\\\"][0],\\n var_sample[\\\"AC\\\"][1],\\n var_sample[\\\"MC\\\"][0],\\n var_sample[\\\"MC\\\"][1],\\n var_sample[\\\"EC\\\"][0],\\n var_sample[\\\"EC\\\"][1],\\n var_sample[\\\"PL\\\"][0] if var_sample[\\\"PL\\\"][0] is not None else 0,\\n var_sample[\\\"PL\\\"][1] if var_sample[\\\"PL\\\"][0] is not None else 0,\\n var_sample[\\\"PL\\\"][2] if var_sample[\\\"PL\\\"][0] is not None else 0])\\n return ret\\n #END\",\n \"def cmykstring2rgbstring(s):\\n c, m, y, k = [float(j) for j in s.split()]\\n r, g, b = cmyk2rgb(c, m, y, k)\\n return f\\\"{r:.6f} {g:.6f} {b:.6f}\\\"\",\n \"def parse_color(color_like: ColorLike) -> ColorType:\\n if isinstance(color_like, str):\\n if color_like.startswith(\\\"#\\\"):\\n return hex_to_bgr(color_like)\\n else:\\n return getattr(Color, color_like)\\n # TODO: validate?\\n return tuple([int(v) for v in color_like])\",\n \"def colored (string_, color, attrs):\\n return string_\",\n \"def is_color(s):\\n def in_range(i): return 0 <= i <= int('0xFFFFFF', 0)\\n\\n try:\\n if type(s) == int:\\n return in_range(s)\\n elif type(s) not in (str, bytes):\\n return False\\n elif s in webcolors.css3_names_to_hex:\\n return True\\n elif s[0] == '#':\\n return in_range(int('0x' + s[1:], 0))\\n elif s[0:2] == '0x':\\n return in_range(int(s, 0))\\n elif len(s) == 6:\\n return in_range(int('0x' + s, 0))\\n except ValueError:\\n return False\",\n \"def extract_pattern(fmt):\\n class FakeDict(object):\\n def __init__(self):\\n self.seen_keys = set()\\n\\n def __getitem__(self, key):\\n self.seen_keys.add(key)\\n return ''\\n\\n def keys(self):\\n return self.seen_keys\\n\\n fake = FakeDict()\\n try:\\n fmt % fake\\n except TypeError:\\n # Formatting error\\n pass\\n return set(fake.keys())\",\n \"def check_color(style):\\n for kw in list(cc.keys()):\\n m = re.search(kw, style)\\n if m:\\n return m.group()\\n\\n # Return 'b' if nothing has found\\n return 'b'\",\n \"def color_parser(colors, function):\\n if isinstance(colors, str):\\n return function(colors)\\n\\n if isinstance(colors, tuple) and isinstance(colors[0], Number):\\n return function(colors)\\n\\n if hasattr(colors, '__iter__'):\\n if isinstance(colors, tuple):\\n new_color_tuple = tuple(function(item) for item in colors)\\n return new_color_tuple\\n\\n else:\\n new_color_list = [function(item) for item in colors]\\n return new_color_list\",\n \"def clr_tuple(colorstring):\\n\\n if colorstring[0] == '#':\\n if len(colorstring) == 7:\\n return (ONE_OVER_256 * float(_hexbyte(colorstring[1:3])),\\n ONE_OVER_256 * float(_hexbyte(colorstring[3:5])),\\n ONE_OVER_256 * float(_hexbyte(colorstring[5:7])))\\n if len(colorstring) == 4:\\n return (ONE_OVER_16 * float(_hexchar(colorstring[1])),\\n ONE_OVER_16 * float(_hexchar(colorstring[2])),\\n ONE_OVER_16 * float(_hexchar(colorstring[3])))\\n if colorstring in colors.CSS4_COLORS:\\n return clr_tuple(colors.CSS4_COLORS[colorstring])\\n if colorstring in colors.BASE_COLORS:\\n return clr_tuple(colors.BASE_COLORS[colorstring])\\n\\n rgb_re = re.compile(\\\"rgb:(.*),(.*),(.*)\\\")\\n\\n rgb_match = rgb_re.search(colorstring)\\n if rgb_match:\\n return (float(rgb_match.group(1)),\\n float(rgb_match.group(2)),\\n float(rgb_match.group(3)))\\n return None\",\n \"def create_colors_list(color_dict):\\r\\n ret = []\\r\\n for i in range(len(color_dict)):\\r\\n ret.append('#' + color_dict[i]['@rgb'])\\r\\n return ret\",\n \"def getColorString(color):\\n if type(color) is not int:\\n raise TypeError(\\\"The input to getColorString is not of type int.\\\")\\n if color in COLOR_STRINGS:\\n return COLOR_STRINGS[color]\\n else:\\n raise ValueError(\\\"Input color not found.\\\")\",\n \"def get_color_schemes() -> dict[str, dict[str, str]]:\\n COLOR_SCHEMES_FILE = Path(__file__).parent / \\\"color_schemes.tsv\\\"\\n name2color_scheme = {}\\n with open(COLOR_SCHEMES_FILE) as f:\\n reader = csv.reader(f, delimiter=\\\"\\\\t\\\")\\n header = next(reader)\\n letters = header[1:]\\n for row in reader:\\n name, colors = row[0], row[1:]\\n color_scheme = {}\\n for letter, color in zip(letters, colors):\\n color_scheme[letter] = color\\n name2color_scheme[name] = color_scheme\\n return name2color_scheme\",\n \"def test_color__name_str_arg_from_colordict(self):\\n for name, values in THECOLORS.items():\\n color = pygame.Color(name)\\n\\n self.assertEqual(color.r, values[0])\\n self.assertEqual(color.g, values[1])\\n self.assertEqual(color.b, values[2])\\n self.assertEqual(color.a, values[3])\",\n \"def color_conversion(string):\\n if (string == 'J'):\\n return 0.14\\n if (string == 'I'):\\n return 0.28\\n if (string == 'H'):\\n return 0.42\\n if (string == 'G'):\\n return 0.56\\n if (string == 'F'):\\n return 0.70\\n if (string == 'E'):\\n return 0.84\\n if (string == 'D'):\\n return 1\",\n \"def setColorConf(colors,ngroups)->list:\\n if colors == \\\"hcl\\\":\\n try:\\n from colorspace import sequential_hcl\\n color_repo = sequential_hcl(h=[15,375],l=65,c=70)\\n colors_list = color_repo.colors(ngroups + 1)\\n except ImportError:\\n print('hcl colorspace package has not being installed.')\\n print('please try the following command:')\\n print('pip install git+https://github.com/retostauffer/python-colorspace')\\n else:\\n colors = list(plt.get_cmap(colors).colors)\\n colors_list = [to_hex(color) for color in colors]\\n colors_list = colors_list[:ngroups]\\n\\n return colors_list\",\n \"def _read_color_labels(filename):\\n line_parser = lambda line: (int(line.split(',')[0]), line.split(',')[-1])\\n with open(filename, 'r') as labels:\\n label_map = dict([line_parser(line.strip()) for line in labels])\\n return label_map\",\n \"def color(c):\\n\\n if isinstance(c, tuple) and len(c) == 4:\\n return c\\n\\n if c is None:\\n return c\\n\\n if isinstance(c, basestring):\\n if c[0] == '#':\\n c = c[1:]\\n\\n if len(c) == 6:\\n r = int(c[0]+c[1], 16)\\n g = int(c[2]+c[3], 16)\\n b = int(c[4]+c[5], 16)\\n a = 255\\n elif len(c) == 8:\\n r = int(c[0]+c[1], 16)\\n g = int(c[2]+c[3], 16)\\n b = int(c[4]+c[5], 16)\\n a = int(c[6]+c[7], 16)\\n elif len(c) == 3:\\n r = int(c[0], 16) * 0x11\\n g = int(c[1], 16) * 0x11\\n b = int(c[2], 16) * 0x11\\n a = 255\\n elif len(c) == 4:\\n r = int(c[0], 16) * 0x11\\n g = int(c[1], 16) * 0x11\\n b = int(c[2], 16) * 0x11\\n a = int(c[3], 16) * 0x11\\n else:\\n raise Exception(\\\"Color string must be 3, 4, 6, or 8 hex digits long.\\\")\\n\\n return (r, g, b, a)\\n\\n raise Exception(\\\"Not a color: %r\\\" % (c,))\",\n \"def update_placeholder_formats(self, format_string, placeholder_formats):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if (\\n token.group(\\\"placeholder\\\")\\n and (not token.group(\\\"format\\\"))\\n and token.group(\\\"key\\\") in placeholder_formats\\n ):\\n output.append(f\\\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\\\")\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def hexToRgb(self, str):\\n\\n # If hex is shorthand, convert to a double value first.\\n if len(str) == 3:\\n val_1 = (int(str[0:1] * 2, 16))\\n val_2 = (int(str[1:2] * 2, 16))\\n val_3 = (int(str[2:3] * 2, 16))\\n\\n else:\\n val_1 = (int(str[0:2], 16))\\n val_2 = (int(str[2:4], 16))\\n val_3 = (int(str[4:6], 16))\\n\\n # Return the preformatted string with the new values.\\n return 'rgb(%d, %d, %d)' % (val_1, val_2, val_3)\",\n \"def cleanup_passed_color_value(s):\\n reo = re.compile('[0-9a-f]')\\n cannotBeCleaned = ''\\n if s[0] == '#' and len(s) in [4,7] and reo.match(s[1:]):\\n return s\\n if s in colorNamesAndCodes:\\n col = colorNamesAndCodes[s]\\n if reo.match(col[1:]):\\n return col\\n else:\\n return cannotBeCleaned\\n if len(s) in [3,6] and reo.match(s):\\n return '#' + s\\n if len(s) == 2 and reo.match(s):\\n return '#' +s +s +s\\n return cannotBeCleaned\",\n \"def _get_colors():\\n mapping = {\\n \\\"terminal\\\": -1,\\n \\\"black\\\": curses.COLOR_BLACK,\\n \\\"red\\\": curses.COLOR_RED,\\n \\\"green\\\": curses.COLOR_GREEN,\\n \\\"yellow\\\": curses.COLOR_YELLOW,\\n \\\"blue\\\": curses.COLOR_BLUE,\\n \\\"magenta\\\": curses.COLOR_MAGENTA,\\n \\\"cyan\\\": curses.COLOR_CYAN,\\n \\\"white\\\": curses.COLOR_WHITE,\\n }\\n\\n cp = get_config_file()\\n\\n if \\\"general\\\" in cp.sections():\\n general = cp[\\\"general\\\"]\\n else:\\n general = {}\\n\\n defaults = {\\n \\\"color_default_background\\\": \\\"black\\\",\\n \\\"color_default_foreground\\\": \\\"white\\\",\\n \\\"color_correct_background\\\": \\\"black\\\",\\n \\\"color_correct_foreground\\\": \\\"green\\\",\\n \\\"color_wrong_background\\\": \\\"red\\\",\\n \\\"color_wrong_foreground\\\": \\\"white\\\",\\n \\\"color_target_background\\\": \\\"magenta\\\",\\n \\\"color_target_foreground\\\": \\\"white\\\",\\n \\\"color_replay_background\\\": \\\"blue\\\",\\n \\\"color_replay_foreground\\\": \\\"white\\\",\\n }\\n\\n colors = {}\\n\\n for name, default in defaults.items():\\n color = general.get(name, default)\\n\\n if color not in mapping:\\n raise KeyError(f\\\"Unsupported color {color}\\\")\\n\\n colors[name] = mapping[color]\\n\\n return colors\",\n \"def _get_format_from_style(self, token, style):\\n result = QtGui.QTextCharFormat()\\n for key, value in style.style_for_token(token).items():\\n if value:\\n if key == 'color':\\n result.setForeground(self._get_brush(value))\\n elif key == 'bgcolor':\\n result.setBackground(self._get_brush(value))\\n elif key == 'bold':\\n result.setFontWeight(QtGui.QFont.Bold)\\n elif key == 'italic':\\n result.setFontItalic(True)\\n elif key == 'underline':\\n result.setUnderlineStyle(\\n QtGui.QTextCharFormat.SingleUnderline)\\n elif key == 'sans':\\n result.setFontStyleHint(QtGui.QFont.SansSerif)\\n elif key == 'roman':\\n result.setFontStyleHint(QtGui.QFont.Times)\\n elif key == 'mono':\\n result.setFontStyleHint(QtGui.QFont.TypeWriter)\\n return result\",\n \"def condense_std_named_colors(css):\\n log.debug(\\\"Condensing standard named color values.\\\")\\n for color_name, color_hexa in iter(tuple({\\n ':aqua;': ':#0ff;', ':blue;': ':#00f;',\\n ':fuchsia;': ':#f0f;', ':yellow;': ':#ff0;'}.items())):\\n css = css.replace(color_name, color_hexa)\\n return css\",\n \"def get_colors(use=True):\\n colors = {\\n \\\"BLACK\\\": \\\"\\\\033[0;30m\\\",\\n \\\"DARK_GRAY\\\": \\\"\\\\033[1;30m\\\",\\n \\\"RED\\\": \\\"\\\\033[0;31m\\\",\\n \\\"LIGHT_RED\\\": \\\"\\\\033[1;31m\\\",\\n \\\"GREEN\\\": \\\"\\\\033[0;32m\\\",\\n \\\"LIGHT_GREEN\\\": \\\"\\\\033[1;32m\\\",\\n \\\"BLUE\\\": \\\"\\\\033[0;34m\\\",\\n \\\"LIGHT_BLUE\\\": \\\"\\\\033[1;34m\\\",\\n \\\"MAGENTA\\\": \\\"\\\\033[0;35m\\\",\\n \\\"LIGHT_MAGENTA\\\": \\\"\\\\033[1;35m\\\",\\n \\\"CYAN\\\": \\\"\\\\033[0;36m\\\",\\n \\\"LIGHT_CYAN\\\": \\\"\\\\033[1;36m\\\",\\n \\\"LIGHT_GRAY\\\": \\\"\\\\033[0;37m\\\",\\n \\\"WHITE\\\": \\\"\\\\033[1;37m\\\",\\n \\\"DEFAULT_COLOR\\\": \\\"\\\\033[00m\\\",\\n \\\"ENDC\\\": \\\"\\\\033[0m\\\",\\n }\\n\\n if not use:\\n for color in colors:\\n colors[color] = ''\\n\\n return colors\",\n \"def initFormat(self):\\n self.formatList = self.splitText(self.format)\",\n \"def clean_colors(self):\\n err = _(\\\"Color must be a valid hex triplet.\\\")\\n colors = ['background_color_custom', 'font_color_custom']\\n colors2 = colors + ['background_color', 'font_color']\\n # If there are custom colors specified in settings, length of\\n # self.COLORS will be > 6, so check for validity\\n if len(self.COLORS) > 6:\\n colors = colors2\\n for color in colors:\\n c = getattr(self, color)\\n l = len(c)\\n if l:\\n if l != 6:\\n raise ValidationError(err)\\n else:\\n try:\\n int(c, 16)\\n except ValueError:\\n raise ValidationError(err)\",\n \"def colors(self):\\n\\t\\treturn [(0, 30, 255),(0, 30, 120)]\",\n \"def test_color__html_str_arg(self):\\n # See test_webstyle() for related tests.\\n color = pygame.Color(\\\"#a1B2c3D4\\\")\\n\\n self.assertEqual(color.r, 0xA1)\\n self.assertEqual(color.g, 0xB2)\\n self.assertEqual(color.b, 0xC3)\\n self.assertEqual(color.a, 0xD4)\",\n \"def get_placeholders(self, format_string):\\n placeholders = set()\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"placeholder\\\"):\\n placeholders.add(token.group(\\\"key\\\"))\\n elif token.group(\\\"command\\\"):\\n # get any placeholders used in commands\\n commands = dict(parse_qsl(token.group(\\\"command\\\")))\\n # placeholders only used in `if`\\n if_ = commands.get(\\\"if\\\")\\n if if_:\\n placeholders.add(Condition(if_).variable)\\n return placeholders\",\n \"def guess_format(string):\\n format_regexps = _compiled_format_regexps(_date_formats, _time_formats)\\n for format, regexp in format_regexps:\\n if regexp.search(string):\\n return format\\n # Nothing matched\\n raise CannotParse(\\\"Could not guess date/time format in: %s\\\" % string)\",\n \"def colorFlags(filterStr=\\\"\\\"):\\n\\tfilterStr = filterStr.upper()\\n\\tflags = [i for i in dir(cv2) if i.startswith('COLOR_') and filterStr in i]\\n\\treturn flags\",\n \"def get_color_styles(color: str) -> str:\\r\\n # fmt: off\\r\\n color_selectors = [\\\"a\\\", \\\"a:hover\\\", \\\".stMultiSelect span:hover svg\\\", \\\".streamlit-expanderHeader:hover\\\"]\\r\\n bg_selectors = ['.stCheckbox label span[aria-checked=\\\"true\\\"]', \\\".stMultiSelect span\\\"]\\r\\n border_selectors = [\\\".stSelectbox > div[aria-controls] > div\\\", \\\".stMultiSelect > div[aria-controls] > div\\\", \\\".stTextArea > div:focus-within\\\", \\\".streamlit-expanderHeader:hover\\\"]\\r\\n fill_selectors = [\\\".streamlit-expanderHeader:hover svg\\\", \\\".stMultiSelect span:hover svg\\\"]\\r\\n # fmt: on\\r\\n css_root = \\\"#root { --primary: %s }\\\" % color\\r\\n css_color = \\\", \\\".join(color_selectors) + \\\"{ color: %s !important }\\\" % color\\r\\n css_fill = \\\", \\\".join(fill_selectors) + \\\"{ fill: %s !important }\\\" % color\\r\\n css_bg = \\\", \\\".join(bg_selectors) + \\\"{ background-color: %s !important }\\\" % color\\r\\n css_border = \\\", \\\".join(border_selectors) + \\\"{ border-color: %s !important }\\\" % color\\r\\n other = \\\".decoration { background: %s !important } code { color: inherit }\\\" % color\\r\\n return f\\\"<style>{css_root}{css_color}{css_bg}{css_border}{css_fill}{other}</style>\\\"\",\n \"def prepare_colors(self):\\n colors = self.colors\\n # check whether user has defined colors, if not generate random colors\\n if not colors :\\n random_colors = [ random.randrange(0, 255) for i in range(3)]\\n colors = {\\n 'fillColor' : \\\"rgba({},{},{},0.2)\\\".format(*random_colors),\\n 'strokeColor': \\\"rgba({},{},{},1)\\\".format(*random_colors),\\n 'pointColor': \\\"rgba({},{},{},1)\\\".format(*random_colors),\\n 'pointStrokeColor': \\\"#fff\\\",\\n 'pointHighlightFill': \\\"#fff\\\",\\n 'pointHighlightStroke': \\\"rgba({},{},{},1)\\\".format(*random_colors),\\n }\\n return colors\",\n \"def highlight_series(s):\\n return ['background-color: #eee' for v in s]\",\n \"def getColor(k) :\\n colors = [\\\"#862B59\\\",\\\"#A10000\\\",\\\"#0A6308\\\",\\\"#123677\\\",\\\"#ff8100\\\",\\\"#F28686\\\",\\\"#6adf4f\\\",\\\"#58ccdd\\\",\\\"#3a3536\\\",\\\"#00ab7c\\\"]\\n return colors[k]\",\n \"def get_colors(cls, font) -> tuple:\\n\\n return font[BFC]\",\n \"def _color_info_text(self):\\n\\n t = ''\\n for info in self.color_info:\\n if info == 'rgbhex':\\n t1 = tks.color_funcs.rgb_to_hex_string(self.rgb)\\n elif info == 'rgb':\\n t1 = tks.color_funcs.rgb_to_rgb_string(self.rgb, dp=2)\\n elif info == 'hsv':\\n t1 = tks.color_funcs.rgb_to_hsv_string(self.rgb, dp=2)\\n elif info == 'hls':\\n t1 = tks.color_funcs.rgb_to_hls_string(self.rgb, dp=2)\\n\\n t = t + '%s\\\\n' % t1\\n\\n return t\",\n \"def assigning_colors():\\n rgb_colors = {}\\n for name, hex in matplotlib.colors.cnames.items():\\n color = []\\n # So the values are from 0-255 and not 0-1\\n for i in matplotlib.colors.to_rgb(hex):\\n color.append(int(i * 255))\\n\\n color = tuple(color)\\n rgb_colors[name] = color\\n\\n return rgb_colors\",\n \"def hex_color(s):\\n\\n if s.startswith(\\\"#\\\"):\\n s = s[1:]\\n valid = len(s) in [1, 2, 3, 4, 6, 12] and set(s) <= set(string.hexdigits)\\n if not valid:\\n raise ValueError(\\\"colour must be 1,2,3,4,6, or 12 hex-digits\\\")\\n\\n # For the 4-bit RGB, expand to 8-bit, by repeating digits.\\n if len(s) == 3:\\n s = \\\"\\\".join(c + c for c in s)\\n\\n if len(s) in [1, 2, 4]:\\n # Single grey value.\\n return (int(s, 16),)\\n\\n if len(s) in [6, 12]:\\n w = len(s) // 3\\n return tuple(int(s[i : i + w], 16) for i in range(0, len(s), w))\",\n \"def get_color(cls, string_color: str) -> Union['Color', bool]:\\n r = False\\n for color in cls:\\n # if color == cls.CSI:\\n # continue\\n if str(color) == string_color:\\n return color\\n if not r:\\n r = str(color).startswith(string_color)\\n\\n return r\",\n \"def get_colour_map(self):\\n try:\\n return {'C# minor' : 'Grey', 'A major' : 'Red', 'D minor' : 'Green',\\n 'Eb Purple': 'greenyellow', 'D major' : 'Pink', 'G major' : 'Orange',\\n 'G minor': 'goldenrod', 'A minor' : 'indianred', 'C minor' : 'peachpuff',\\n 'B minor' : 'deepskyblue', 'Ab Major' : 'firebrick', 'Eb / D# minor' : 'orchid',\\n 'Ab major' : 'moccasin', 'G# minor' : 'slateblue', 'Eb major' : 'turquoise',\\n 'C major' : 'tomato', 'B major' : 'darkmagenta', 'F major' : 'olivedrab',\\n 'F minor' : 'olive', 'Bb major' : 'lightsteelblue', 'Db major' : 'plum',\\n 'Bb minor' : 'mediumspringgreen', 'E minor' : 'lightsalmon',\\n 'F# / Gb major' : 'gold', 'F# minor' : 'burlywood'}\\n\\n # If colour not found to match, return grey as a last resort\\n except KeyError as e:\\n print('Unmatched colour: {0}'.format(e))\\n return 'Grey'\",\n \"def colors():\\n\\tenums = dict(\\n\\t\\t#TIME_LEFT=\\\"red\\\",\\n\\t\\tname=\\\"yellow\\\",\\n\\t\\ttitle=\\\"magenta\\\",\\n\\t\\tgenre=\\\"green\\\",\\n\\t\\tsynopsis=\\\"cyan\\\",\\n\\t\\tduration=\\\"blue\\\",\\n\\t\\tdimension=\\\"red\\\"\\n\\t)\\n\\treturn type('Enum', (), enums)\",\n \"def get_color_words():\\n color_word_dict = {}\\n color_data = csv.reader(open('./color_names.csv'), delimiter=\\\",\\\", quotechar='\\\"')\\n\\n for row in color_data:\\n if row[0] != \\\"Colour Name\\\":\\n name = row[0].lower()\\n family = row[2].lower()\\n hex_value = row[3].lower()\\n color_word_dict[name] = (hex_value, family)\\n return color_word_dict\",\n \"def format_color(\\n color: Union[ColorInputType, Any],\\n warn_if_invalid: bool = True\\n) -> Union[ColorType, Any]:\\n if not isinstance(color, ColorInputInstance):\\n return color\\n if not isinstance(color, pygame.Color):\\n try:\\n if isinstance(color, VectorInstance) and 3 <= len(color) <= 4:\\n if PYGAME_V2:\\n for j in color:\\n if not isinstance(j, int):\\n raise ValueError('color cannot contain floating point values')\\n c = pygame.Color(*color)\\n else:\\n c = pygame.Color(color)\\n except ValueError:\\n if warn_if_invalid:\\n warn(f'invalid color value \\\"{color}\\\"')\\n else:\\n raise\\n return color\\n else:\\n c = color\\n return c.r, c.g, c.b, c.a\",\n \"def get_color(self):\\n colors = []\\n color_specs = [self._red_spec, self._green_spec,\\n self._blue_spec, self._white_spec]\\n for spec in color_specs:\\n driver = DRIVERS[spec.addr]\\n colors.append(driver.get_duty_cycle(spec.pin))\\n \\n return colors\",\n \"def read_colormap(name):\\n\\n path = get_demo_file(name + '.c3g')\\n\\n out = []\\n with open(path, 'r') as file:\\n for line in file:\\n if 'rgb(' not in line:\\n continue\\n line = line.split('(')[-1].split(')')[0]\\n out.append([float(n) for n in line.split(',')])\\n\\n return np.asarray(out).astype(float) / 256.\",\n \"def _colorstr(self, args):\",\n \"def importColors(colorlist):\\n colordict=getColorDict()\\n scribus.statusMessage(\\\"Defining new colors...\\\")\\n scribus.progressTotal(len(colorlist))\\n i=0\\n for color in colorlist:\\n name=color[0]\\n c=color[1]\\n m=color[2]\\n y=color[3]\\n k=color[4]\\n while colordict.has_key(name):# check if color already exists - then add PREFIX to name\\n name = PREFIX+name\\n \\n scribus.defineColor(name, c, m, y, k)\\n i=i+1\\n scribus.progressSet(i)\",\n \"def stylecrunch(stystr):\\n return dict(pair.split(\\\":\\\") for pair in semicolons.findall(stystr))\",\n \"def test_string_to_rgb(self):\\r\\n strgb = string_to_rgb # for convenience\\r\\n self.assertEqual(strgb('#000000'), (0, 0, 0))\\r\\n self.assertEqual(strgb('#FFFFFF'), (255, 255, 255))\\r\\n self.assertEqual(strgb('#F0F0F0'), (240, 240, 240))\\r\\n self.assertEqual(strgb('#AFF0AA'), (175, 240, 170))\",\n \"def _get_named_css(self):\\n\\n return [(name, style, attributes) for (name, (order, style, attributes)) in sorted(self._named_css.items(), key=operator.itemgetter(1))]\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.61174923","0.60446614","0.60343224","0.6032042","0.5956374","0.5867158","0.5859119","0.5769622","0.57691973","0.57649046","0.5756081","0.5748874","0.5739813","0.5683501","0.5625979","0.5616915","0.5559172","0.55575323","0.5540814","0.5540103","0.5533907","0.54589003","0.54565936","0.5453469","0.5450036","0.53870416","0.53859806","0.53788674","0.535782","0.5326083","0.528517","0.52551705","0.5252099","0.5234997","0.52267635","0.5220064","0.5213845","0.5204326","0.5199273","0.51940846","0.519212","0.51888794","0.5185755","0.51686674","0.51518416","0.5112559","0.5106242","0.50956076","0.50415206","0.50283426","0.50075555","0.5003844","0.49999487","0.49996766","0.49992442","0.49990264","0.49945906","0.49900392","0.49853548","0.49752295","0.4963107","0.49569002","0.49554914","0.49501973","0.49344158","0.49295518","0.49283588","0.49218914","0.49171203","0.49145755","0.49123728","0.4911898","0.49115974","0.4904733","0.49019864","0.4901812","0.4897739","0.48912007","0.48901996","0.4876166","0.48715156","0.48689505","0.48673952","0.48666164","0.4863029","0.48616642","0.485295","0.48456308","0.4840736","0.48380876","0.48343346","0.48335347","0.48315033","0.4828827","0.48218355","0.48201567","0.48192173","0.4817997","0.48111755","0.48040816"],"string":"[\n \"0.61174923\",\n \"0.60446614\",\n \"0.60343224\",\n \"0.6032042\",\n \"0.5956374\",\n \"0.5867158\",\n \"0.5859119\",\n \"0.5769622\",\n \"0.57691973\",\n \"0.57649046\",\n \"0.5756081\",\n \"0.5748874\",\n \"0.5739813\",\n \"0.5683501\",\n \"0.5625979\",\n \"0.5616915\",\n \"0.5559172\",\n \"0.55575323\",\n \"0.5540814\",\n \"0.5540103\",\n \"0.5533907\",\n \"0.54589003\",\n \"0.54565936\",\n \"0.5453469\",\n \"0.5450036\",\n \"0.53870416\",\n \"0.53859806\",\n \"0.53788674\",\n \"0.535782\",\n \"0.5326083\",\n \"0.528517\",\n \"0.52551705\",\n \"0.5252099\",\n \"0.5234997\",\n \"0.52267635\",\n \"0.5220064\",\n \"0.5213845\",\n \"0.5204326\",\n \"0.5199273\",\n \"0.51940846\",\n \"0.519212\",\n \"0.51888794\",\n \"0.5185755\",\n \"0.51686674\",\n \"0.51518416\",\n \"0.5112559\",\n \"0.5106242\",\n \"0.50956076\",\n \"0.50415206\",\n \"0.50283426\",\n \"0.50075555\",\n \"0.5003844\",\n \"0.49999487\",\n \"0.49996766\",\n \"0.49992442\",\n \"0.49990264\",\n \"0.49945906\",\n \"0.49900392\",\n \"0.49853548\",\n \"0.49752295\",\n \"0.4963107\",\n \"0.49569002\",\n \"0.49554914\",\n \"0.49501973\",\n \"0.49344158\",\n \"0.49295518\",\n \"0.49283588\",\n \"0.49218914\",\n \"0.49171203\",\n \"0.49145755\",\n \"0.49123728\",\n \"0.4911898\",\n \"0.49115974\",\n \"0.4904733\",\n \"0.49019864\",\n \"0.4901812\",\n \"0.4897739\",\n \"0.48912007\",\n \"0.48901996\",\n \"0.4876166\",\n \"0.48715156\",\n \"0.48689505\",\n \"0.48673952\",\n \"0.48666164\",\n \"0.4863029\",\n \"0.48616642\",\n \"0.485295\",\n \"0.48456308\",\n \"0.4840736\",\n \"0.48380876\",\n \"0.48343346\",\n \"0.48335347\",\n \"0.48315033\",\n \"0.4828827\",\n \"0.48218355\",\n \"0.48201567\",\n \"0.48192173\",\n \"0.4817997\",\n \"0.48111755\",\n \"0.48040816\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.8132206"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94764,"cells":{"query":{"kind":"string","value":"Parses the format_string and returns a set of placeholders."},"document":{"kind":"string","value":"def get_placeholders(self, format_string):\n placeholders = set()\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.add(token.group(\"key\"))\n elif token.group(\"command\"):\n # get any placeholders used in commands\n commands = dict(parse_qsl(token.group(\"command\")))\n # placeholders only used in `if`\n if_ = commands.get(\"if\")\n if if_:\n placeholders.add(Condition(if_).variable)\n return placeholders"},"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_placeholder_formats_list(self, format_string):\n placeholders = []\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.append((token.group(\"key\"), token.group(\"format\")))\n return placeholders","def update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\n and token.group(\"key\") in placeholder_formats\n ):\n output.append(f\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\")\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def update_placeholders(self, format_string, placeholders):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if token.group(\"key\") in placeholders:\n output.append(\n \"{{{}{}}}\".format(placeholders[token.group(\"key\")], token.group(\"format\"))\n )\n continue\n elif token.group(\"command\"):\n # update any placeholders used in commands\n commands = parse_qsl(token.group(\"command\"), keep_blank_values=True)\n # placeholders only used in `if`\n if \"if\" in [x[0] for x in commands]:\n items = []\n for key, value in commands:\n if key == \"if\":\n # we have to rebuild from the parts we have\n condition = Condition(value)\n variable = condition.variable\n if variable in placeholders:\n variable = placeholders[variable]\n # negation via `!`\n not_ = \"!\" if not condition.default else \"\"\n condition_ = condition.condition or \"\"\n # if there is no condition then there is no\n # value\n if condition_:\n value_ = condition.value\n else:\n value_ = \"\"\n value = \"{}{}{}{}\".format(not_, variable, condition_, value_)\n if value:\n items.append(f\"{key}={value}\")\n else:\n items.append(key)\n\n # we cannot use urlencode because it will escape things\n # like `!`\n output.append(r\"\\?{} \".format(\"&\".join(items)))\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def parse_from_placeholder(string,pattern,encloser='%',matcher='(.+)'):\n pattern,fields = placeholder_to_regex(pattern,encloser,matcher)\n return parse_from_regex(string,pattern,fields)","def _interpolate(format):\n from tokenize import tokenprog\n\n def matchorfail(text, pos):\n match = tokenprog.match(text, pos)\n if match is None:\n raise _ItplError(text, pos)\n return match, match.end()\n\n namechars = \"abcdefghijklmnopqrstuvwxyz\" \\\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\";\n chunks = []\n pos = 0\n\n while 1:\n dollar = format.find(\"$\", pos)\n if dollar < 0: \n break\n nextchar = format[dollar + 1]\n\n if nextchar == \"{\":\n chunks.append((0, format[pos:dollar]))\n pos, level = dollar + 2, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token == \"{\": \n level = level + 1\n elif token == \"}\": \n level = level - 1\n chunks.append((1, format[dollar + 2:pos - 1]))\n\n elif nextchar in namechars:\n chunks.append((0, format[pos:dollar]))\n match, pos = matchorfail(format, dollar + 1)\n while pos < len(format):\n if format[pos] == \".\" and \\\n pos + 1 < len(format) and format[pos + 1] in namechars:\n match, pos = matchorfail(format, pos + 1)\n elif format[pos] in \"([\":\n pos, level = pos + 1, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token[0] in \"([\": \n level = level + 1\n elif token[0] in \")]\": \n level = level - 1\n else: \n break\n chunks.append((1, format[dollar + 1:pos]))\n else:\n chunks.append((0, format[pos:dollar + 1]))\n pos = dollar + 1 + (nextchar == \"$\")\n\n if pos < len(format): \n chunks.append((0, format[pos:]))\n return chunks","def _parse(self, fmtstr):\n def _match_brace(string, start_pos, pair='[]'):\n \"\"\"Pairing brackets (used internally in _parse method)\"\"\"\n depth = 1\n if string[start_pos] != pair[0]:\n return None\n for index, char in enumerate(string[start_pos + 1:]):\n if char == pair[0]:\n depth += 1\n elif char == pair[1]:\n depth -= 1\n if depth == 0:\n return start_pos + index + 1\n return None\n\n #----------------------------------------------------------------------\n\n t_fmt = self.__class__._T_FMT\n t_prefix = self.__class__._T_PREFIX\n\n ptr = 0\n # it seems that field id 0 is invalid\n field_id = 1\n length = len(fmtstr)\n parsed_list = []\n\n while ptr < length:\n parsed = {}\n m_prefix = t_prefix.match(fmtstr[ptr:])\n if m_prefix:\n ptr += _get_length_of_match(m_prefix)\n parsed['prefix'] = m_prefix.group(1)\n\n # check if we have a nested structure\n if m_prefix.group(2):\n brace_offset = _match_brace(fmtstr, ptr - 1)\n\n # bracket not match\n if not brace_offset:\n raise BadFormatString(\n 'Unmatched brace on position {0}'.format(ptr)\n )\n parsed['field_id'] = field_id\n parsed['field_type'] = 'a'\n parsed['subcontent'] = self._parse(\n fmtstr[ptr:brace_offset]\n )\n ptr = brace_offset + 1\n field_id += 1\n\n parsed_list.append(parsed)\n continue\n m_fmt = t_fmt.match(fmtstr[ptr:])\n if m_fmt:\n ptr += _get_length_of_match(m_fmt)\n\n # fmt is an alias\n if m_fmt.group(2):\n parsed['field_type'] = self.__class__\\\n .FIELD_ALIAS[m_fmt.group(2)]\n # fmt is an actual field type\n elif m_fmt.group(1):\n parsed['field_type'] = m_fmt.group(1)\n\n # save field id\n parsed['field_id'] = field_id\n\n # check for type clones (e.g. `v3')\n if m_fmt.group(3):\n parsed['repeat'] = int(m_fmt.group(3))\n field_id += int(m_fmt.group(3))\n else:\n parsed['repeat'] = 1\n field_id += 1\n\n parsed_list.append(parsed)\n\n else:\n raise BadFormatString(\n 'Invalid token on position {0}'.format(ptr)\n )\n\n # all set\n return parsed_list","def _get_placeholders(template):\n return [p[1] for p in string.Formatter().parse(template)\n if p[1] is not None and len(p[1]) > 0]","def tokens(self, format_string):\n if format_string not in self.format_string_cache:\n tokens = list(re.finditer(self.reg_ex, format_string))\n self.format_string_cache[format_string] = tokens\n return self.format_string_cache[format_string]","def formatLookup(format_str):\n pat = '(\\d+)([A-Z])'\n match = re.search(pat, format_str)\n #print match.group()\n \n data_len = int(match.group(1))\n data_fmt = str(match.group(2))\n np_fmt = fitsFormatLookup(data_fmt)\n np_dtype = '%i%s'%(data_len, np_fmt)\n \n return np_dtype, data_len, np_fmt","def parse_name_and_type_from_fmt_str(\n formatted_str: str,\n allowed_types: Optional[Dict[str, Component]] = None\n) -> Generator[Tuple[str, Type[Field]], None, None]:\n for _, arg_name, _type_name, _ in Formatter().parse(formatted_str):\n if arg_name is not None:\n try:\n assert _type_name is not None\n _type = (\n allowed_types[_type_name] if allowed_types is not None\n and _type_name in allowed_types\n else getattr(pyopenapi3.data_types, _type_name)\n )\n yield arg_name, _type\n except AttributeError:\n raise ValueError(\n \"A non-`Field` or `OpenApiObject` type was found. \"\n f\"Can't use `{_type_name}` as a type in {formatted_str}. \"\n f\"Must be a stringified pyopenapi3 `data_type`, such \"\n f\"as `pyopenapi3.data_types.String`, or a reference to a \"\n f\"Component.\"\n ) from None","def __init__(self, format_string):\r\n if not isinstance(format_string, Compatibility.string):\r\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\r\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\r\n self._re = re.compile(self._re_pattern)","def extract_pattern(fmt):\n class FakeDict(object):\n def __init__(self):\n self.seen_keys = set()\n\n def __getitem__(self, key):\n self.seen_keys.add(key)\n return ''\n\n def keys(self):\n return self.seen_keys\n\n fake = FakeDict()\n try:\n fmt % fake\n except TypeError:\n # Formatting error\n pass\n return set(fake.keys())","def parse(self, s):\n\n segments = self.compiled.split(self._whitespace.sub(\" \", s))\n literals = segments[::2]\n raw = segments[1::2]\n\n if not raw:\n return []\n\n case = list(map(str.casefold, raw))\n prefixes = [{}] + [dict(self.locale_set.prefixes.get(match, ())) for match in case[:-1]]\n suffixes = [dict(self.locale_set.suffixes.get(match, ())) for match in case[1:]] + [{}]\n\n groups = _DateTime(**{ field: [] for field in _DateTime._fields })\n choices_per_position = {}\n always_literal = set()\n numeric = set()\n for idx, (prefix, suffix) in enumerate(zip(prefixes, suffixes)):\n keyword = self._lookup_keyword(raw[idx])\n if \"y\" in prefix:\n prefix[\"C\"] = tuple(set(prefix[\"y\"] + prefix.get(\"C\", ())))\n if not keyword:\n always_literal.add(idx)\n else:\n if raw[idx].isdigit():\n numeric.add(idx)\n choices_per_position[idx] = len(keyword)\n for fmt, value, locales in keyword:\n category = fmt[-1]\n if category == \"b\":\n # Month-names should be treated like numeric months.\n category = \"m\"\n elif category == \"z\":\n category = \"Z\"\n getattr(groups, category).append(_Assignment(\n fmt=fmt,\n pos=idx,\n value=value,\n locales=locales,\n prefix=prefix.get(fmt[-1]),\n suffix=suffix.get(fmt[-1]),\n ))\n numeric = frozenset(numeric)\n\n # If a required date field is unsatisfiable, this is not a date.\n if not all(getattr(groups, category) for category in _State._min_date_formats):\n for category in _State._all_date_formats:\n getattr(groups, category).clear()\n\n # If a required time field is unsatisfiable, this is not a time.\n if not all(getattr(groups, category) for category in _State._min_time_formats):\n for category in _State._all_time_formats:\n getattr(groups, category).clear()\n\n for group in groups:\n group.sort(key=lambda assignment: (\n -self._optimistic_score(assignment),\n choices_per_position[assignment.pos],\n ))\n\n required_formats = _State._min_date_formats + _State._min_time_formats\n groups = OrderedDict(sorted(\n (\n (\n category,\n (\n group,\n tuple(\n (f, required)\n for f, required in _position_constraints\n if category in required\n ),\n tuple(\n (f, required)\n for f, required, revisit in _value_constraints\n if category in required or category in revisit\n ),\n )\n )\n for category, group in zip(groups._fields, groups)\n if group\n ),\n key=lambda i: (i[0] not in required_formats, len(i[1][0]))\n ))\n\n # We've already filtered out all possibilities; there's nothing here.\n if not groups:\n return []\n\n constrained_groups = []\n while groups:\n category, (group, position, value) = groups.popitem(last=False)\n constrained_groups.append((category, group, position, value))\n required = frozenset(itertools.chain.from_iterable(required for f, required in itertools.chain(position, value)))\n if required:\n required = [\n category\n for category in reversed(groups.keys())\n if category in required\n ]\n for category in required:\n groups.move_to_end(category, last=False)\n groups = constrained_groups\n\n best_quality = 0\n best_candidates = []\n\n partials = [\n _State.empty._replace(\n unconverted=frozenset(always_literal),\n remaining_groups=tuple(groups),\n ).children(numeric=numeric)\n ]\n while partials:\n try:\n quality, locales, state = next(partials[-1])\n except StopIteration:\n partials.pop()\n continue\n\n if state.remaining_groups:\n # Admissable heuristic: compute the best score each group\n # could possibly achieve. Don't count conversion specifiers\n # that we've already used, but don't worry about conflicts\n # in the groups we haven't assigned yet. Any such conflicts\n # can only reduce the resulting score, and we only need to\n # make sure that the heuristic is at least as large as the\n # true value of the best leaf in this subtree. However, the\n # more precise we can be here, the fewer nodes we have to\n # search, so we can spend some CPU time on precision and\n # still come out ahead.\n assigned = state.unconverted.union(state.pos).difference((None,))\n heuristic = len(state.pending_hints) + sum(\n next((\n self._optimistic_score(assignment)\n for assignment in group[1]\n if assignment.pos not in assigned\n ), 0)\n for group in state.remaining_groups\n )\n\n if quality + heuristic < best_quality:\n # Even assuming the remaining groups get the highest\n # possible score, this state is still not good enough.\n continue\n\n partials.append(state.children(numeric=numeric))\n continue\n\n value = state.valid()\n if value is None:\n continue\n\n quality, locales, state = state.final_score()\n\n if best_quality is not None and quality < best_quality:\n # We've seen better, so skip this one.\n continue\n\n if quality != best_quality:\n best_quality = quality\n best_candidates = []\n\n conversions = dict(zip(state.pos, state.fmts))\n fmts = [ conversions.get(idx) or literal for idx, literal in enumerate(raw) ]\n\n pattern = ''.join(lit + fmt for lit, fmt in zip(literals, fmts + [''])).replace(\"%C%y\", \"%Y\")\n best_candidates.append((pattern, value, locales))\n return best_candidates","def find_time(string, format):\n re_format = format\n for key, value in six.iteritems(REGEX):\n re_format = re_format.replace(key, value)\n matches = re.finditer(re_format, string)\n for match in matches:\n try:\n matchstr = string[slice(*match.span())]\n dt = datetime.strptime(matchstr, format)\n except ValueError:\n continue\n else:\n yield dt","def initFormat(self):\n self.formatList = self.splitText(self.format)","def parse_format(var_sample):\n # ugh\n ret = []\n # Parsing format information\n # Need to see what all these could be...\n if None in var_sample[\"GT\"]:\n ret.append(3)\n elif var_sample[\"GT\"] == (0, 0):\n ret.append(0)\n elif var_sample[\"GT\"] == (0, 1):\n ret.append(1)\n elif var_sample[\"GT\"] == (1, 1):\n ret.append(2)\n \n ret.extend([var_sample[\"GQ\"] if var_sample[\"GQ\"] is not None else 0,\n var_sample[\"OV\"],\n var_sample[\"DP\"], # be careful these aren't '.'\n #split where _r is ref-allele and _a is alt-allele\n var_sample[\"AD\"][0],\n var_sample[\"AD\"][1],\n var_sample[\"PDP\"],\n var_sample[\"PAD\"][0],\n var_sample[\"PAD\"][1],\n var_sample[\"US\"][0],\n var_sample[\"US\"][1],\n var_sample[\"DS\"][0],\n var_sample[\"DS\"][1],\n var_sample[\"UC\"][0],\n var_sample[\"UC\"][1],\n var_sample[\"DC\"][0],\n var_sample[\"DC\"][1],\n var_sample[\"UDC\"][0],\n var_sample[\"UDC\"][1],\n var_sample[\"UCC\"][0],\n var_sample[\"UCC\"][1],\n var_sample[\"DDC\"][0],\n var_sample[\"DDC\"][1],\n var_sample[\"DCC\"][0],\n var_sample[\"DCC\"][1],\n var_sample[\"UMO\"][0],\n var_sample[\"UMO\"][1],\n var_sample[\"DMO\"][0],\n var_sample[\"DMO\"][1],\n var_sample[\"UXO\"][0],\n var_sample[\"UXO\"][1],\n var_sample[\"DXO\"][0],\n var_sample[\"DXO\"][1],\n var_sample[\"NR\"][0],\n var_sample[\"NR\"][1],\n var_sample[\"MO\"][0],\n var_sample[\"MO\"][1],\n var_sample[\"XO\"][0],\n var_sample[\"XO\"][1],\n var_sample[\"XC\"][0],\n var_sample[\"XC\"][1],\n var_sample[\"AC\"][0],\n var_sample[\"AC\"][1],\n var_sample[\"MC\"][0],\n var_sample[\"MC\"][1],\n var_sample[\"EC\"][0],\n var_sample[\"EC\"][1],\n var_sample[\"PL\"][0] if var_sample[\"PL\"][0] is not None else 0,\n var_sample[\"PL\"][1] if var_sample[\"PL\"][0] is not None else 0,\n var_sample[\"PL\"][2] if var_sample[\"PL\"][0] is not None else 0])\n return ret\n #END","def guess_format(string):\n format_regexps = _compiled_format_regexps(_date_formats, _time_formats)\n for format, regexp in format_regexps:\n if regexp.search(string):\n return format\n # Nothing matched\n raise CannotParse(\"Could not guess date/time format in: %s\" % string)","def parse(string, format):\n # Count the number of spaces in the format string (N), and\n # truncate everything after the (N+1)th space\n spaces = format.count(' ') + 1\n string = ' '.join(string.split()[:spaces])\n\n try:\n result = dt.datetime.strptime(string, format)\n except ValueError, err:\n raise CannotParse(str(err))\n else:\n return result","def change_format_var_parser(text, tracker):\n param_names = format_var_parser(text)\n param_vars = {}\n for param_name in param_names:\n try:\n param_vars[param_name] = tracker.get_slot(param_name)\n except Exception as e:\n PYTHON_LOGGER.error(\"Error to get var name {}: {}\".format(param_name, e))\n return text.format(**param_vars)","def parseSettings (formatStr):\n # split string\n fmt = formatStr.split ('.')\n if len (fmt) < 0:\n return (None, None)\n \n # find encoder\n encoderInstance = None\n for e in _registeredEncoders:\n if len (fmt) > 0:\n if e.name () == fmt[0]:\n encoderInstance = e\n break\n else:\n encoderInstance = _registeredEncoders[0] if len (_registeredEncoders) > 0 else None\n\n # return tuple with parsed settings\n presetName = '.'.join (fmt[1:])\n if presetName in (None, \"\"):\n if encoderInstance != None:\n presetName = encoderInstance.defaultPreset ()\n return (encoderInstance, presetName)","def parse(timestring):\n for parser in _PARSERS:\n match = parser['pattern'].match(timestring)\n if match:\n groups = match.groups()\n ints = tuple(map(int, groups))\n time = parser['factory'](ints)\n return time\n\n raise TimeError('Unsupported time format {}'.format(timestring))","def extract_fields(entry_string):\n for field, value in re.findall(\"(.*?)=(.*?)\\}\", entry_string):\n yield field.strip(\",\").strip(\" \"), value.strip(\"{\").strip(\"}\")","def parse_template(template):\n field_name = None\n field_value = []\n\n for line in template.strip().split('\\n') + ['end:']:\n if line.startswith('#'):\n continue\n match = RE_TEMPLATE_FIELD_LINE.match(line)\n if match:\n if field_name is not None:\n yield (field_name, '\\n'.join(field_value).strip())\n elif len(field_value) > 0:\n logging.warning('Ignoring lines: %r', field_value)\n\n field_name = match.group(1)\n field_value = [match.group(2)]\n else:\n field_value.append(line)","def strptime(date_string, format):\n i = 0\n format_len = len(format)\n # Iterate through the format string, applying parsers and matching literal\n # chars as appropriate.\n struct_time_d = {}\n while i < format_len:\n c = format[i]\n # If the character is not the start of a directive, attempt to match a\n # literal character.\n if c != '%':\n if date_string[0] != c:\n return None\n date_string = date_string[1:]\n else:\n # Read the next character of the directive, letting an IndexError\n # raise if format is exhausted/malformed.\n i += 1\n directive = format[i]\n # Raise a ValueError just like the built-in datetime.strptime()\n # if the directive is invalid.\n if directive not in DIRECTIVE_PARSER_MAP:\n raise ValueError(\"{} is a bad directive in format {}\".format(\n repr(directive[1]), repr(directive)))\n # Get the parser.\n parser = DIRECTIVE_PARSER_MAP[directive]\n # Check whether the parser is yet to be implemented.\n if parser is NOT_IMPLEMENTED:\n raise NotImplementedError(\n 'parser not defined for directive: {}'.format(directive)\n )\n # Do the parsing.\n result = parser(date_string)\n # Return None on any parsing failure.\n if result is False:\n return None\n value, date_string = result\n # Convert the directive value to a struct_time item.\n struct_time_item = directive_to_struct_time_item(directive, value)\n if struct_time_item is not None:\n k, v = struct_time_item\n # If the key already exists, accumulate, otherwise set.\n if k in struct_time_d:\n struct_time_d[k] += v\n else:\n struct_time_d[k] = v\n i += 1\n\n # Return None if the date string has not been completely consumed.\n if len(date_string) > 0:\n return None\n\n # Return None if a +12 hour AM_PM = 'PM' accumulation overflowed a parsed\n # HOUR_24 value.\n if not (0 <= struct_time_d.get(STRUCT_TIME.TM_HOUR, 0) <= 23):\n return None\n\n # Attempt to get year/month/day for date ops.\n year = struct_time_d.get(STRUCT_TIME.TM_YEAR)\n month = struct_time_d.get(STRUCT_TIME.TM_MON)\n day = struct_time_d.get(STRUCT_TIME.TM_MDAY)\n has_date = year is not None and month is not None and day is not None\n\n # Return None if the specified day is not valid for the month.\n if has_date and not is_valid_month_day(year, month, day):\n return None\n\n # Create an initial struct_time object.\n _struct_time = struct_time(\n *[struct_time_d.get(k, 0) for k in STRUCT_TIME_FIELDS]\n )\n\n if has_date:\n # Check whether accumulated minute value exceeds its max as a result of\n # accumulating a time zone offset, requiring some calendar day math.\n if not 0 <= struct_time_d.get(STRUCT_TIME.TM_MIN, 0) <= 59:\n # Pass _struct_time along with an empty time_delta to\n # add_struct_time_time_delta() to take advantage of its\n # over/underflow logic. Note that add_struct_time_time_delta() will\n # take care of setting the final day of week / year.\n _struct_time = add_struct_time_time_delta(\n _struct_time, time_delta())\n else:\n # Calculate the final day of week / year.\n _struct_time = struct_time_replace(\n _struct_time,\n tm_wday=date_to_day_of_week(year, month, day),\n tm_yday=date_to_day_of_year(year, month, day)\n )\n\n return _struct_time","def parse_place_notation(input_string: str) -> Tuple[int, str]:\n\n # Looking for a string that matches <stage>:<place notation> where the\n # place notation is a series of bell numbers and 'x' characters\n parts = input_string.split(\":\")\n if len(parts) == 2:\n stage_part = parts[0]\n if len(stage_part) == 0 or not stage_part.isnumeric():\n raise PlaceNotationError(input_string, \"Stage must be a number\")\n stage = int(stage_part)\n place_notation = parts[1]\n if not valid_pn(place_notation):\n raise PlaceNotationError(input_string, \"Place notation is invalid\")\n else:\n raise PlaceNotationError(input_string, \"<stage>:<place notation> required\")\n\n return stage, place_notation","def _parse_kvfmt(self, fmtlist):\n t_fmt = self.__class__._T_FMT\n t_prefix = self.__class__._T_PREFIX\n parsed_list = []\n field_id = 1\n\n for entry in fmtlist:\n name = entry[0]\n fmt = entry[1]\n parsed_field = {}\n parsed_field['name'] = name\n if isinstance(fmt, str):\n ptr = 0\n m_prefix = t_prefix.match(fmt)\n if m_prefix:\n ptr += _get_length_of_match(m_prefix)\n parsed_field['prefix'] = m_prefix.group(1)\n # check for optional nested structure start (required if the field is also repeated)\n if m_prefix.group(2) and len(entry) > 2:\n parsed_field['field_id'] = field_id\n parsed_field['field_type'] = 'a'\n parsed_field['subcontent'] = self._parse_kvfmt(entry[2])\n field_id += 1\n parsed_list.append(parsed_field)\n continue\n elif m_prefix.group(2):\n raise BadFormatString('Nested field type used without specifying field format.')\n m_fmt = t_fmt.match(fmt[ptr:])\n if m_fmt:\n ptr += _get_length_of_match(m_fmt)\n resolved_fmt_char = None\n # fmt is an alias\n if m_fmt.group(2):\n resolved_fmt_char = m_fmt.group(2)\n parsed_field['field_type'] = self.__class__\\\n .FIELD_ALIAS[m_fmt.group(2)]\n # fmt is an actual field type\n elif m_fmt.group(1):\n resolved_fmt_char = m_fmt.group(1)\n parsed_field['field_type'] = m_fmt.group(1)\n parsed_field['field_id'] = field_id\n # only skip type (`x') is allowed for copying in key-value mode\n if m_fmt.group(3) and resolved_fmt_char == 'x':\n repeats = int(m_fmt.group(3))\n parsed_field['repeat'] = repeats\n field_id += repeats\n elif m_fmt.group(3):\n raise BadFormatString('Field copying is not allowed in key-value format list.')\n else:\n field_id += 1\n else:\n raise BadFormatString('Invalid type for field \"{0}\"'.format(name))\n if len(fmt) != ptr:\n self.logger.warning('Extra content found after the type string of %s.', name)\n else:\n # Hard-code the empty prefix because we don't support copying\n parsed_field['prefix'] = ''\n parsed_field['field_id'] = field_id\n parsed_field['field_type'] = 'a'\n parsed_field['subcontent'] = self._parse_kvfmt(fmt)\n field_id += 1\n parsed_list.append(parsed_field)\n return parsed_list","def build_block(self, format_string):\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\n block = first_block\n\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n value = token.group(0)\n if token.group(\"block_start\"):\n # Create new block\n block = block.new_block()\n elif token.group(\"block_end\"):\n # Close block setting any valid state as needed\n # and return to parent block to continue\n if not block.parent:\n raise Exception(\"Too many `]`\")\n block = block.parent\n elif token.group(\"switch\"):\n # a new option has been created\n block = block.switch()\n elif token.group(\"placeholder\"):\n # Found a {placeholder}\n key = token.group(\"key\")\n format = token.group(\"format\")\n block.add(Placeholder(key, format))\n elif token.group(\"literal\"):\n block.add(Literal(value))\n elif token.group(\"lost_brace\"):\n # due to how parsing happens we can get a lonesome }\n # eg in format_string '{{something}' this fixes that issue\n block.add(Literal(value))\n elif token.group(\"command\"):\n # a block command has been found\n block.set_commands(token.group(\"command\"))\n elif token.group(\"escaped\"):\n # escaped characters add unescaped values\n if value[0] in [\"\\\\\", \"{\", \"}\"]:\n value = value[1:]\n block.add(Literal(value))\n\n if block.parent:\n raise Exception(\"Block not closed\")\n # add to the cache\n self.block_cache[format_string] = first_block","def _parse_date_format( fmp_database ):\n\tdef build_one( stamp ):\n\t\treturn stamp.\\\n\t\t replace( 'yyyy', '%Y' ).\\\n\t\t replace( 'MM', '%m' ).\\\n\t\t replace( 'dd', '%d' ).\\\n\t\t replace( 'HH', '%H' ).\\\n\t\t replace( 'mm', '%M' ).\\\n\t\t replace( 'ss', '%S' )\n\n\treturn {\n\t\t'date': build_one( fmp_database.get('date-format', '') ),\n\t\t'timestamp': build_one( fmp_database.get('timestamp-format', '') ),\n\t\t'time': build_one( fmp_database.get('time-format', '') ),\n\t}","def _slice_template(cls, in_str: str) -> Iterator[RawFileSlice]:\n fmt = Formatter()\n in_idx = 0\n for literal_text, field_name, format_spec, conversion in fmt.parse(in_str):\n if literal_text:\n escape_chars = cls._sorted_occurrence_tuples(\n cls._substring_occurrences(literal_text, [\"}\", \"{\"])\n )\n idx = 0\n while escape_chars:\n first_char = escape_chars.pop()\n # Is there a literal first?\n if first_char[1] > idx:\n yield RawFileSlice(\n literal_text[idx : first_char[1]], \"literal\", in_idx\n )\n in_idx += first_char[1] - idx\n # Add the escaped\n idx = first_char[1] + len(first_char[0])\n # We double them here to make the raw\n yield RawFileSlice(\n literal_text[first_char[1] : idx] * 2, \"escaped\", in_idx\n )\n # Will always be 2 in this case.\n # This is because ALL escape sequences in the python formatter\n # are two characters which reduce to one.\n in_idx += 2\n # Deal with last one (if present)\n if literal_text[idx:]:\n yield RawFileSlice(literal_text[idx:], \"literal\", in_idx)\n in_idx += len(literal_text) - idx\n # Deal with fields\n if field_name:\n constructed_token = \"{{{field_name}{conv}{spec}}}\".format(\n field_name=field_name,\n conv=f\"!{conversion}\" if conversion else \"\",\n spec=f\":{format_spec}\" if format_spec else \"\",\n )\n yield RawFileSlice(constructed_token, \"templated\", in_idx)\n in_idx += len(constructed_token)","def read_atom_data(atom_format, line):\n if atom_format is None:\n _format = [guess_string_format(i.strip()) for i in line.split()]\n else:\n _format = atom_format\n formatted = []\n for i, (val, fmti) in enumerate(zip(line.split(), _format)):\n istrip = val.strip()\n try:\n formatted.append(fmti(istrip))\n except ValueError:\n fmt = guess_string_format(istrip)\n _format[i] = fmt\n formatted.append(fmt(istrip))\n return formatted, _format","def formatted(s):\n matches = re.findall(_format_re, normalize(s))\n if len(matches) == 1 and matches[0][0] != '':\n return matches[0][0]\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\n if txt_none != '':\n return FORMAT_NONE, txt_none\n elif txt_sw != '':\n return FORMAT_SW, txt_sw\n elif txt_rem != '':\n return FORMAT_REM, txt_rem\n elif txt_em != '':\n return FORMAT_EM, txt_em\n elif txt_a != '':\n return FORMAT_A, txt_a\n return [to_fmt(*m) for m in matches]","def parse(cls, value: str) -> Tuple[str, Dict[str, str]]:\n raw_value = read_value_from_path(value)\n args: Dict[str, str] = {}\n\n if \"@\" in raw_value:\n args[\"region\"], raw_value = raw_value.split(\"@\", 1)\n\n # now find any other arguments that can be filters\n matches = re.findall(r\"([0-9a-zA-z_-]+:[^\\s$]+)\", raw_value)\n for match in matches:\n k, v = match.split(\":\", 1)\n args[k] = v\n\n return args.pop(\"name_regex\"), args","def get_placeholders(self):\n\n # Define regex\n regex = f'\\{self.marker_string}([^$]+)\\{self.marker_string}'\n\n found_placeholders = [match.group(1) for match in re.finditer(regex, self.raw_sequence)]\n\n # Check for duplicates\n for found_placeholder in found_placeholders:\n if found_placeholders.count(found_placeholder) != 1:\n\n error_msg = f\"Placeholder {found_placeholder} found multiple times in sequence.\"\n self.hd.log.info(error_msg)\n\n # Remove duplicates from list\n found_placeholders = list(set(found_placeholders))\n\n return found_placeholders","def parse_template(string):\n count = 0\n list1 = []\n for character in string:\n count = count + 1\n if character == \"{\":\n end = string.find(\"}\", count)\n s_strg = string[count:end]\n list1.append(s_strg)\n string = string.replace(s_strg, \"\", 1)\n count = count - len(s_strg)\n\n subs = tuple(list1)\n\n return(string, subs)\n print(subs)","def _parseAttributeScanf(self, line, formatting):\n\n # multiple entrys\n if isinstance(formatting, list):\n for scanf_format in formatting:\n try:\n #print \"<<<----\", scanf_format, line\n return sscanf(line, scanf_format)\n except IncompleteCaptureError, e:\n pass\n\n # single entry\n else:\n return sscanf(line, formatting)\n\n # problem if none of the formats worked\n raise IncompleteCaptureError(\"Format error for %s\" % line)","def regex_findall_variables(raw_string: Text) -> List[Text]:\n try:\n match_start_position = raw_string.index(\"$\", 0)\n except ValueError:\n return []\n\n vars_list = []\n while match_start_position < len(raw_string):\n\n # Notice: notation priority\n # $$ > $var\n\n # search $$\n dollar_match = dolloar_regex_compile.match(raw_string, match_start_position)\n if dollar_match:\n match_start_position = dollar_match.end()\n continue\n\n # search variable like ${var} or $var\n var_match = variable_regex_compile.match(raw_string, match_start_position)\n if var_match:\n var_name = var_match.group(1) or var_match.group(2)\n vars_list.append(var_name)\n match_start_position = var_match.end()\n continue\n\n curr_position = match_start_position\n try:\n # find next $ location\n match_start_position = raw_string.index(\"$\", curr_position + 1)\n except ValueError:\n # break while loop\n break\n\n return vars_list","def _parse_parameters(self, parameters_text):\n for mo in re.finditer(self._PARAMETERS_RE, parameters_text):\n self._parameters.append(Parameter(mo.group(\"param_name\"), mo.group(\"default_value\")))","def format_regexp(simple_format):\n format, regexp = ('', '')\n for char in simple_format:\n if char in _regexps:\n format += '%' + char\n regexp += _regexps[char]\n else:\n format += char\n regexp += char\n return (format, regexp)","def parsePercentExpression(literal, format):\n\tmat = _getREForPercentExpression(format).match(literal)\n\tif not mat:\n\t\traise ValueError(\"'%s' cannot be parsed using format '%s'\"%(\n\t\t\tliteral, format))\n\treturn mat.groupdict()","def _parse_param_line(regex, line):\n out = []\n for r in regex.findall(line):\n converter, variable = r[0] or 'default', r[1]\n out.append((_CONVERTERS[converter], variable))\n return out","def __new__(cls, format):\n self = super(SF_Pattern, cls).__new__(cls)\n\n if isinstance(format, bytes):\n uni_str = format.decode('ISO-8859-1') # decode to unicode\n trans_str = translate(uni_str) # translate only works with unicode\n re_fmt = trans_str.encode('ISO-8859-1') # encode back to bytes\n self._spec = _gbspec\n else:\n re_fmt = translate(format)\n self._spec = _gspec\n\n self._format = format\n self._re = cre = re.compile(re_fmt)\n\n if cre.groupindex and len(cre.groupindex) != cre.groups:\n raise RuntimeError('cannot mix mapped and unmapped specifiers')\n elif not cre.groupindex:\n self._retfunc = self._return_tuple\n self._type = tuple\n else:\n self._retfunc = self._return_dict\n self._type = dict\n\n self._casts = self._get_types()\n\n return self","def scanf(format, string):\n re_fmt = compile(format)\n result = re_fmt.scanf(string)\n _log.debug('%r <- %r = %r', format, string, result)\n return result","def parse_from_regex(string,pattern,fields):\n\n string = string.replace('\\\\','/') # USE POSIX PLEASE\n num_groups = flat_paren_counter(pattern)\n if isinstance(fields,str):\n fields = [fields]\n num_fields = len(fields)\n if not num_fields == num_groups:\n return {}\n match = re.search(pattern,string)\n if not num_groups == len(match.groups()):\n return {}\n \n l = []\n \n for field,value in zip(fields,list(match.groups())):\n d = nested_notation_to_tree(field,value)\n l.append(d)\n return deep_merge_N(l)","def parse_params(txt):\n res = list()\n # First, slipt with stuff looking like \\TYPE:\n splitted = re.split(r'\\s*\\\\(\\w+)\\s*:', txt)\n # We now have a list looking like:\n # ['', 'flag', '....', 'param', '...']\n i = 1\n while i < len(splitted) - 1:\n type = splitted[i]\n rest = splitted[i+1]\n if type == \"argn\":\n name = \"remaining args\"\n desc = rest\n else:\n # first word is the name, the rest is the description:\n match = re.match(r'\\s*(\\w+)\\s*(.*)', rest, re.DOTALL)\n if not match:\n print(\"warning, failed to parse parameters\")\n print(\"near\", rest)\n break\n (name, desc) = match.groups()\n desc = clean_indent(desc)\n res.append((type, name, desc))\n i += 2\n return res","def _translate_fmts(self):\n fmt_info = []\n fmt_append = fmt_info.append\n \n isvalid = self._is_valid_fmt\n typlist = self._typlist\n isstrvar = self._isstrvar\n default_fmts = self._default_fmts\n \n for i, fmt in enumerate(self._fmtlist):\n fmt = fmt.strip()\n \n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\n \n if iscalendar or not isvalid(fmt):\n if isstrvar(i):\n wid = min(typlist[i], 10)\n fmt_append(('s', \"{{:>{}s}}\".format(wid), wid))\n continue\n else:\n fmt = default_fmts[typlist[i]]\n \n last_char = fmt[-1]\n if last_char == 's': # string\n m = STR_FMT_RE.match(fmt)\n align, _, wid = m.group(1), m.group(2), m.group(3)\n new_align = (\"<\" if align == \"-\" \n else \"^\" if align == \"~\" else \">\")\n new = \"\".join((\"{:\", new_align, wid, \"s}\"))\n fmt_append(('s', new, int(wid)))\n elif last_char == 'H' or last_char == 'L': # binary\n fmt_append((last_char, fmt, int(fmt[1:-1])))\n elif last_char == 'x': # hexadecimal\n fmt_append(('x', fmt, 21))\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\n m = NUM_FMT_RE.match(fmt)\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \n m.group(3), m.group(4),\n m.group(5), m.group(6),\n m.group(7))\n aln = \"<\" if align == \"-\" else \">\"\n sep = \",\" if com is not None else \"\"\n if type == \"g\" and int(prec) == 0:\n new = \"\".join((\"{:\", aln, wid, sep, type, \"}\"))\n else:\n new = \"\".join((\"{:\", aln, wid, sep, \".\", prec, type, \"}\"))\n fmt_append((type, new, int(wid), delim, com))\n \n return fmt_info","def input_parser(input_string: str) -> str: \n if is_int(input_string):\n return input_string\n #he is int, give back plz.\n else:\n try:\n modified_input: str = input_string.strip()\n\n evaluatable_pairs: str = regex_splitter(modified_input)\n\n while not (is_int(evaluatable_pairs)):\n evaluatable_pairs = regex_splitter(evaluatable_pairs)\n\n return (evaluatable_pairs)\n\n except:\n raise Exception(\"Invalid Input\")","def parse_pattern(pattern: NumberPattern | str) -> NumberPattern:\n if isinstance(pattern, NumberPattern):\n return pattern\n\n def _match_number(pattern):\n rv = number_re.search(pattern)\n if rv is None:\n raise ValueError(f\"Invalid number pattern {pattern!r}\")\n return rv.groups()\n\n pos_pattern = pattern\n\n # Do we have a negative subpattern?\n if ';' in pattern:\n pos_pattern, neg_pattern = pattern.split(';', 1)\n pos_prefix, number, pos_suffix = _match_number(pos_pattern)\n neg_prefix, _, neg_suffix = _match_number(neg_pattern)\n else:\n pos_prefix, number, pos_suffix = _match_number(pos_pattern)\n neg_prefix = f\"-{pos_prefix}\"\n neg_suffix = pos_suffix\n if 'E' in number:\n number, exp = number.split('E', 1)\n else:\n exp = None\n if '@' in number and '.' in number and '0' in number:\n raise ValueError('Significant digit patterns can not contain \"@\" or \"0\"')\n if '.' in number:\n integer, fraction = number.rsplit('.', 1)\n else:\n integer = number\n fraction = ''\n\n def parse_precision(p):\n \"\"\"Calculate the min and max allowed digits\"\"\"\n min = max = 0\n for c in p:\n if c in '@0':\n min += 1\n max += 1\n elif c == '#':\n max += 1\n elif c == ',':\n continue\n else:\n break\n return min, max\n\n int_prec = parse_precision(integer)\n frac_prec = parse_precision(fraction)\n if exp:\n exp_plus = exp.startswith('+')\n exp = exp.lstrip('+')\n exp_prec = parse_precision(exp)\n else:\n exp_plus = None\n exp_prec = None\n grouping = parse_grouping(integer)\n return NumberPattern(pattern, (pos_prefix, neg_prefix),\n (pos_suffix, neg_suffix), grouping,\n int_prec, frac_prec,\n exp_prec, exp_plus, number)","def getAllPlaceholders(self, template_list):\n placeholders = []\n for line in template_list:\n found = re.findall(self.pattern, line)\n placeholders.extend(found)\n placeholders.reverse()\n #place the cursor placeholder at the begin\n placeholders = self._placeCursors(placeholders)\n return placeholders","def parse_styles(text: str) -> List[dict]:\n styles = []\n regex = r'(\\d{3})=(\".*?\"),(\\d+\\.?\\d+),(\\(.*?\\))'\n\n for line in text.split(\"\\r\\n\"):\n if line == \"\":\n continue\n\n n, font, font_size, color = re.match(regex, line).groups()\n styles.append(\n {\n \"id\": int(n),\n \"f\": font.replace('\"', \"\"),\n \"fs\": float(font_size),\n \"rgb\": [\n int(i)\n for i in color.replace(\"(\", \"\")\n .replace(\")\", \"\").split(\",\")]\n }\n )\n\n return styles","def parse_isdcf_string(str):\n fields_dict = {}\n error_list = []\n\n if not isinstance(str, six.string_types):\n error_list.append(\"ContentTitle invalid type\")\n return fields_dict, error_list\n\n # Sort the fields to respect DCNC order\n # Note : in python3 we can declare an OrderedDict({...}) and the field\n # order is preserved so this is not needed, but not in python 2.7\n dcnc_version = DCP_SETTINGS['naming_convention']\n rules = OrderedDict(sorted(\n six.iteritems(RULES[dcnc_version]),\n key=lambda f: RULES_ORDER.index(f[0])))\n\n fields_dict = init_dict_isdcf(rules)\n fields_list = str.split('_')\n\n if len(fields_list) != 12:\n error_list.append(\n \"ContentTitle should have 12 parts to be fully compliant with\"\n \" ISDCF naming convention version {}, {} part(s) found\"\n .format(dcnc_version, len(fields_list)))\n\n # Parsing title with some robustness to missing / additionals fields\n # Find a match in nearby fields only\n max_field_shift = 3\n\n fields_matched = []\n\n for idx_field, field in enumerate(fields_list):\n matched = False\n\n for idx_rule, (name, regex) in enumerate(six.iteritems(rules)):\n pattern = re.compile(regex)\n match = re.match(pattern, field)\n\n if idx_field == 0 and not match:\n error_list.append(\n \"ContentTitle Film Name does not respect naming convention\"\n \" rules : {}\".format(field))\n elif match and idx_rule < max_field_shift:\n fields_dict[name].update(match.groupdict(DEFAULT))\n else:\n continue\n\n fields_dict[name]['Value'] = field\n fields_matched.append(name)\n sliced = islice(six.iteritems(rules), idx_rule + 1, None)\n rules = OrderedDict(sliced)\n matched = True\n break\n\n if not matched:\n error_list.append(\n \"ContentTitle Part {} not matching any naming convention field\"\n .format(field))\n\n for name, _ in six.iteritems(RULES[dcnc_version]):\n if name not in fields_matched:\n error_list.append(\n \"Field {} not found in ContentTitle\".format(name))\n\n fields_dict = post_parse_isdcf(fields_dict)\n return fields_dict, error_list","def extract(self, optimized_str):\n\n logger.debug('START optimized_str ========================')\n logger.debug(optimized_str)\n logger.debug('END optimized_str ==========================')\n logger.debug(\n 'Date parsing: languages=%s date_formats=%s',\n self.options['languages'], self.options['date_formats'])\n logger.debug('Float parsing: decimal separator=%s', self.options['decimal_separator'])\n logger.debug(\"keywords=%s\", self['keywords'])\n logger.debug(self.options)\n\n # Try to find data for each field.\n output = {}\n for k, v in self['fields'].items():\n if k.startswith('static_'):\n logger.debug(\"field=%s | static value=%s\", k, v)\n output[k.replace('static_', '')] = v\n else:\n logger.debug(\"field=%s | regexp=%s\", k, v)\n\n # Fields can have multiple expressions\n if type(v) is list:\n for v_option in v:\n res_find = re.findall(v_option, optimized_str)\n if res_find:\n break\n else:\n res_find = re.findall(v, optimized_str)\n if res_find:\n logger.debug(\"res_find=%s\", res_find)\n if k.startswith('date'):\n raw_date = res_find[0]\n output[k] = dateparser.parse(\n raw_date, date_formats=self.options['date_formats'],\n languages=self.options['languages'])\n logger.debug(\"result of date parsing=%s\", output[k])\n if not output[k]:\n logger.error(\n \"Date parsing failed on date '%s'\", raw_date)\n return None\n elif k.startswith('amount'):\n assert res_find[0].count(self.options['decimal_separator']) < 2,\\\n 'Decimal separator cannot be present several times'\n # replace decimal separator by a |\n amount_pipe = res_find[0].replace(self.options['decimal_separator'], '|')\n # remove all possible thousands separators\n amount_pipe_no_thousand_sep = re.sub(\n '[.,\\s]', '', amount_pipe)\n # put dot as decimal sep\n amount_regular = amount_pipe_no_thousand_sep.replace('|', '.')\n # it is now safe to convert to float\n output[k] = float(amount_regular)\n else:\n output[k] = res_find[0]\n else:\n logger.warning(\"regexp for field %s didn't match\", k)\n\n output['currency'] = self.options['currency']\n\n if len(output.keys()) >= 4:\n output['desc'] = 'Invoice %s from %s' % (\n output['invoice_number'], self['issuer'])\n logger.debug(output)\n return output\n else:\n logger.error(output)\n return None","def select_stylestrs(cfgstr):\n stylestrs = []\n for s in cfgstr.split():\n if s in vars(fmt):\n stylestrs.append(s)\n return stylestrs","def format_data(data_string):\n lines = data_string.split('\\\"\\n\\\"')\n split_data = [re.split(r\"\\\"\\s*,\\s*\\\"\", line) for line in lines]\n\n return split_data","def load(fmt: str, stream: BytesIO, _unpack=unpack):\n values = []\n bitcount = bits = 0\n for char in fmt:\n if char == '?':\n if not bitcount:\n bits = _unpack('>B', _read(stream, 1))[0]\n bitcount = 8\n value = (bits & 1) == 1\n bits >>= 1\n bitcount -= 1\n else:\n bitcount = bits = 0\n if char == 'B':\n value = _unpack('>B', _read(stream, 1))[0]\n elif char == 'H':\n value = _unpack('>H', _read(stream, 2))[0]\n elif char == 'L':\n value = _unpack('>L', _read(stream, 4))[0]\n elif char == 'Q':\n value = _unpack('>Q', _read(stream, 8))[0]\n elif char == 's':\n length = _unpack('>B', _read(stream, 1))[0]\n value = _unpack('>%ss' % length, _read(stream, length))[0]\n value = value.decode('utf-8', 'surrogatepass')\n elif char == 'S':\n length = _unpack('>L', _read(stream, 4))[0]\n value = _unpack('>%ss' % length, _read(stream, length))[0]\n value = value.decode('utf-8', 'surrogatepass')\n elif char == 't':\n timestamp = _unpack('>Q', _read(stream, 8))[0]\n value = datetime.utcfromtimestamp(timestamp)\n elif char == 'T':\n value = {}\n length = _unpack('>L', _read(stream, 4))[0]\n stream2 = BytesIO(_read(stream, length))\n while stream2.tell() < length:\n key = load('s', stream2)[0]\n value[key] = _load_item(stream2)\n elif char != '?':\n raise ValueError('wrong format char', char)\n values.append(value)\n return values","def get_parameter(pstring):\n parameters = pstring.replace(',', ' ').split()\n if len(parameters) == 1:\n init_value = float(parameters[0])\n return (init_value, None, None)\n elif len(parameters) == 3:\n init_value = float(parameters[0])\n if parameters[1].upper() == 'NONE':\n lower_value = None\n else:\n lower_value = float(parameters[1])\n if parameters[2].upper() == 'NONE':\n upper_value = None\n else:\n upper_value = float(parameters[2])\n return (init_value, lower_value, upper_value)\n else:\n raise ValueError('Invalid parameter format: %s' % pstring)","def parse_known_date_formats(dt_string):\n for fmt in ('%Y%m%d', '%Y%m%d %H:%M', '%m/%d/%Y', '%m/%d/%Y %H:%M'):\n try:\n return datetime.strptime(dt_string, fmt)\n except ValueError:\n pass\n raise ValueError(\"No valid date format found.\"\n \"See https://tidesandcurrents.noaa.gov/api/ \"\n \"for list of accepted date formats.\")","def parseStructuredData( raw_data, format ):\n\tparsed_data = {}\n\n\tBEGIN = 0\n\tEND = 1\n\tCONV = 2\n\n\tfor key in format.keys():\n\t\tkey_format = format[key]\n\n\t\tif key_format[END] == \"\":\n\t\t\tkey_format[END] = key_format[BEGIN] + len(raw_data)\n\n\t\ttxt = raw_data[key_format[BEGIN]:key_format[END]]\n\n\t\tif len(key_format[CONV]) > 0:\n\t\t\tparsed_data[key] = struct.unpack(key_format[CONV], txt)[0]\n\t\telse:\n\t\t\tparsed_data[key] = txt\n\n\treturn parsed_data","def get_color_names(self, format_string):\n names = set()\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"command\"):\n name = dict(parse_qsl(token.group(\"command\"))).get(\"color\")\n if (\n not name\n or name in COLOR_NAMES_EXCLUDED\n or name in COLOR_NAMES\n or name[0] == \"#\"\n ):\n continue\n names.add(name)\n return names","def _validate_pattern_fields(self):\n # TO ADD:\n ## check pattern is dict ??\n ## A1 ! check if all vars used in sprintf are declared\n ## check for quoted '%s' in sprintf text (not allowed).\n ## check that only all subs are %s and that the number of %s matches the length of the var list.\n ## re.search(r\"\\%(.)\", , ) => from this get list to check all %s and length to check against var list.\n ## Given these checks - makes more sense to hardwire sprintf subfield names than use config approach.\n \n for field, field_content in self.pattern.items():\n if field not in self.pkey_dict:\n warnings.warn(\"Pattern has unknown field: %s !\" % field)\n \n # The following is quote ugly and hard to follow. Should probably be refactored\n oneOf = False\n oneOf_list = []\n for field, field_spec in self.pkey_dict.items():\n if field_spec['compulsory']:\n if field not in self.pattern:\n warnings.warn(\"Pattern is missing compulsory field: %s !\" % field)\n elif field_spec['OneOf']:\n oneOf_list.append(field)\n if field in self.pattern:\n oneOf = True \n if field_spec['sprintf']:\n if field in self.pattern:\n for subfield in self.pattern[field]:\n if subfield not in self.sprintf_keys:\n warnings.warn(\"The field %s has an unknown subfield %s.\" % (field, subfield))\n for subfield in self.sprintf_keys:\n if subfield not in self.pattern[field]:\n warnings.warn(\"The field %s lacks the compulsory subfield %s.\" % (field, subfield))\n # Check that number of vars matches number %s in text field\n if not len(re.findall('%s', self.pattern[field]['text'])) == len(self.pattern[field]['vars']):\n warnings.warn(\"Wrong number of vars in field '%s' of %s\" % (field, self.pattern['pattern_name']))\n for v in self.pattern[field]['vars']:\n if v not in self.pattern['vars']:\n warnings.warn(\"%s not in varlist %s\" % (v, str(self.pattern['vars'])))\n# Move spec checks down: \n# if field_spec['msExpression']:\n# self._validate_quoted(field['text'])\n# self._validate_ms\n \n if not oneOf:\n warnings.warn(\"Pattern must have at least one of: \" + str(oneOf_list))\n\n # Poss to add: validate number of vars for sprintf subs","def init_from_net(self, inputstr):\n offset = 0\n input_len = len(inputstr)\n used_len = 0\n\n try:\n (used_len, self.bpq_kind, self.matching_rule,\n self.creation_ts, self.creation_seq,\n self.src_eid_len) = unpack_from(\"!BBvvv\", inputstr,\n offset = offset)\n offset = used_len\n if ((offset + self.src_eid_len) > input_len):\n raise struct_error(\"Input string too short at src_eid\")\n\n self.src_eid = inputstr[offset : (offset + self.src_eid_len)]\n\n offset += self.src_eid_len\n (used_len, self.bpq_id_len) = unpack_from(\"!v\", inputstr,\n offset = offset)\n offset += used_len\n if ((offset + self.bpq_id_len) > input_len):\n raise struct_error(\"Input string too short at bpq_id\")\n\n self.bpq_id = inputstr[offset : (offset + self.bpq_id_len)]\n\n offset += self.bpq_id_len\n (used_len, self.bpq_val_len) = unpack_from(\"!v\", inputstr,\n offset = offset)\n \n offset += used_len\n if ((offset + self.bpq_val_len) > input_len):\n raise struct_error(\"Input string too short at bpq_val\")\n\n self.bpq_val = inputstr[offset : (offset + self.bpq_val_len)]\n\n offset += self.bpq_val_len\n (used_len, self.frag_cnt) = unpack_from(\"!v\", inputstr,\n offset = offset)\n offset += used_len\n\n self.frag_desc = []\n\n if self.frag_cnt > 0:\n fmt_str = \"!\" + (\"vv\" * self.frag_cnt)\n frag_tuple = unpack_from(fmt_str, inputstr, offset = offset)\n offset += frag_tuple[0]\n i = 0\n j = 1\n while (i < self.frag_cnt):\n d = {}\n d[\"frag_offset\"] = frag_tuple[j]\n j += 1\n d[\"frag_len\"] = frag_tuple[j]\n j += 1\n self.frag_desc.append(d)\n i += 1\n if (offset != input_len):\n raise struct_error(\"Input string is wrong length\")\n except Exception, e:\n return False\n\n return self.validate()","def placeholder_to_regex(placeholder,encloser='%',matcher='(.+)'):\n pattern = placeholder\n pattern = pattern.replace('\\\\','/')\n if pattern.count('%') == 0 or pattern.count('%') % 2 != 0:\n return '',[]\n else:\n borders = pattern.split(encloser)[::2]\n fields = pattern.split(encloser)[1::2]\n for field in fields:\n pattern = pattern.replace(encloser+field+encloser, matcher, 1)\n pattern = pattern.replace('/','\\\\/')\n return pattern,fields","def parse_template(self):\n for line in self.raw_template.split(\"\\n\"):\n line = line.strip()\n if line.startswith('#m3'):\n key, val = line[3:].strip().split('=', 1)\n key = key.strip()\n val = val.strip()\n self.variables[key] = val\n\n for fitem in self.finditem.finditer(self.raw_template):\n fgrp = fitem.groups()\n categ = fgrp[0]\n name = fgrp[1]\n rest_str = fgrp[2]\n rest = {} # type: dict\n for item in rest_str.split('|'):\n item = item.strip()\n if item:\n key, val = item.split('=')\n rest[key] = val\n\n self.data[name] = (categ, rest)","def reformat_placeholders(content: str) -> str:\n return content.replace(\"<MM>\", \"[[\").replace(\"</MM>\", \"]]\")","def _decode_block_string(self, block_string: str):\n\n arg_strings = block_string.split('_')\n args = {}\n for arg_string in arg_strings:\n splits = re.split(r'(\\d.*)', arg_string)\n if len(splits) >= 2:\n key, value = splits[:2]\n args[key] = value\n num_repeat = int(args['r'])\n block_args = {\n 'kernel_size': int(args['k']),\n 'stride': int(args['s']),\n 'expand_ratio': int(args['e']),\n 'in_channels': int(args['i']),\n 'out_channels': int(args['o']),\n 'se_ratio': float(args['se']) if 'se' in args else None,\n }\n return block_args, num_repeat","def _check_tokens_are_valid(format_string, message):\n named_tokens = re.findall(r\"{(\\w*)}\", format_string)\n invalid_tokens = [x for x in named_tokens if x.lower() not in _valid_tokens]\n if invalid_tokens:\n msg = message\n msg += \" [{0}]. \".format(\", \".join(invalid_tokens))\n msg += 'Did you check your \"modules.yaml\" configuration?'\n raise RuntimeError(msg)","def parse_pattern_str(pattern: str, parent_layer: nn.Layer) -> Union[None, List[Dict[str, Union[nn.Layer, str, None]]]]:\n\n pattern_list = pattern.split(\".\")\n if not pattern_list:\n msg = f\"The pattern('{pattern}') is illegal. Please check and retry.\"\n return None\n\n layer_list = []\n while len(pattern_list) > 0:\n if '[' in pattern_list[0]:\n target_layer_name = pattern_list[0].split('[')[0]\n target_layer_index = pattern_list[0].split('[')[1].split(']')[0]\n else:\n target_layer_name = pattern_list[0]\n target_layer_index = None\n\n target_layer = getattr(parent_layer, target_layer_name, None)\n\n if target_layer is None:\n msg = f\"Not found layer named('{target_layer_name}') specifed in pattern('{pattern}').\"\n return None\n\n if target_layer_index and target_layer:\n if int(target_layer_index) < 0 or int(target_layer_index) >= len(target_layer):\n msg = f\"Not found layer by index('{target_layer_index}') specifed in pattern('{pattern}'). The index should < {len(target_layer)} and > 0.\"\n return None\n\n target_layer = target_layer[target_layer_index]\n\n layer_list.append({\"layer\": target_layer, \"name\": target_layer_name, \"index\": target_layer_index})\n\n pattern_list = pattern_list[1:]\n parent_layer = target_layer\n return layer_list","def parseConfig(f):\n config = {\"formats\":{}}\n \n for line in f:\n if line.startswith(\"//\"): \n continue\n \n sline = re.split(\"[=\\s]\", line)\n if sline[0] is \"\":\n continue\n \n if sline[0]==\"format\":\n #Puts the format as a key in the dict pointed to by \"formats\"\n config[\"formats\"][sline[1]] = sline[3] \n else:\n config[sline[0]] = sline[1]\n \n return config","def format(self, varnames, fmts):\n varnames = self._find_vars(varnames, empty_ok=False)\n indexes = list(map(self._varlist.index, varnames))\n \n # check that fmts are specified properly\n if isinstance(fmts, str):\n fmts = fmts.split()\n else:\n if ( not isinstance(fmts, collections.Iterable) \n or not all(isinstance(f, str) for f in fmts) ):\n raise TypeError(\"given fmts must be str or iterable of str\")\n fmts = [x for s in fmts for x in s.split()]\n if len(fmts) == 0:\n raise ValueError(\"no formats specified\")\n \n # check fmts for validity\n is_valid = self._is_valid_fmt\n if not all(is_valid(fmt) for fmt in fmts):\n bad_fmts = \" \".join(fmt for fmt in fmts if not is_valid(fmt))\n raise ValueError(\"invalid formats: \" + bad_fmts)\n \n # pad fmts if necessary \n nvarnames = len(varnames)\n nfmts = len(fmts)\n if nfmts < nvarnames:\n fmts = list(fmts) + [fmts[-1]]*(nvarnames - nfmts)\n \n # check that formats match Stata types\n #typlist = self._typlist\n isstrvar = self._isstrvar\n if not all(isstrvar(i) == bool(STR_FMT_RE.match(fmt))\n for i, fmt in zip(indexes, fmts)):\n raise ValueError(\"format does not match Stata variable type\")\n \n # replace fmts (extras, if any, don't get used)\n for i, fmt in zip(indexes, fmts):\n self._fmtlist[i] = fmt\n \n # assume there are changes\n self._changed = True","def initFormat(self):\n self.formatList = []","def _search_and_replace(parser, section):\n INTERPOLATION_RE = re.compile(r\"\\$\\{(?:(?P<section>[^:]+):)?(?P<key>[^}]+)\\}\")\n result = []\n def interpolate_func(match):\n d = match.groupdict()\n s = d.get('section')\n if s is None:\n s = section\n key = d.get('key')\n return parser.get(s, key)\n\n for key, value in parser.items(section):\n value = re.sub(INTERPOLATION_RE, interpolate_func, value)\n result.append(\n (key,value)\n )\n return result","def parse_string(self, in_str):\n match = MAIN_REGEX.search(in_str)\n if not match:\n err_str = \"Unable to parse string: %s\" % in_str\n raise ValueError(err_str)\n self.parse_completed(match.group(1))\n self.parse_priority(match.group(2))\n if match.group(3) and match.group(4):\n self.parse_completion_date(match.group(3))\n self.parse_creation_date(match.group(4))\n else:\n self.parse_creation_date(match.group(3))\n self.parse_description(match.group(5))","def format(self):\n groups = [g + \".\" for g in self.groups]\n params = [\";\" + p.format() for p in self.params]\n groups_name_params = \"\".join(groups) + self.name + \"\".join(params)\n return groups_name_params + \":\" + self.format_value() + CRLF","def func2(string:str):\n with open(string,\"r\") as file:\n data = file.read()\n data = data.split(\"bandwidths [1]:\")[0]\n\n final = {}\n for i in range(1,3):\n final[\"formants [{}]\".format(i)] = []\n my_list = data.split(\"formants\")\n for i in range(2,4):\n final[\"formants [{}]\".format(i-1)].extend(list(map(pars_points,my_list[i].split(\"points \")[1:])))\n return final","def fmt_capture(kwargs: Any, *patterns: Any) -> Any: # type: ignore\n results = [copy_annotations(pattern, _fmt_capture(kwargs, pattern)) for pattern in each_string(*patterns)]\n if len(patterns) == 1 and isinstance(patterns[0], str):\n assert len(results) == 1\n return results[0]\n return results","def formatter(text):\n repl_map = {\n \"degC\": \"$^o$C\",\n \"K\": \"$^o$C\",\n \"month-1\": \"month$^{{-1}}$\",\n \"day-1\": \"day$^{{-1}}$\",\n \"d-1\": \"day$^{{-1}}$\",\n \"decade-1\": \"decade$^{{-1}}$\",\n \"year-1\": \"year$^{{-1}}$\",\n \"rcp85\": \"RCP8.5\",\n \"rcp45\": \"RCP4.5\",\n \"rcp26\": \"RCP2.6\",\n \"RCP85\": \"RCP8.5\",\n \"RCP45\": \"RCP4.5\",\n \"RCP26\": \"RCP2.6\",\n \"cmip5-85\": \"RCP8.5\",\n \"cmip5-60\": \"RCP6.0\",\n \"cmip5-45\": \"RCP4.5\",\n \"cmip5-26\": \"RCP2.6\",\n \"ssp585\": \"SSP5-8.5\",\n \"ssp245\": \"SSP2-4.5\",\n \"ssp126\": \"SSP1-2.6\",\n \"SSP585\": \"SSP5-8.5\",\n \"SSP245\": \"SSP2-4.5\",\n \"SSP126\": \"SSP1-2.6\",\n \"cmip6-85\": \"SSP5-8.5\",\n \"cmip6-70\": \"SSP3-7.0\",\n \"cmip6-60\": \"SSP4-6.0\",\n \"cmip6-34\": \"SSP4-3.4\",\n \"cmip6-45\": \"SSP2-4.5\",\n \"cmip6-26\": \"SSP1-2.6\",\n \"cmip6-19\": \"SSP1-1.9\",\n \"1\": \"%\",\n \"era5\": \"ERA5\",\n \"gpcc025x025_v8\": \"GPCC\",\n \"cru\": \"CRU\",\n \"jra55\": \"JRA55\",\n \"HIGHRESMIP\": \"HighResMIP\",\n \" \": \"\",\n }\n for key, val in repl_map.items():\n if key in text:\n text = text.replace(key, val)\n break\n return text","def findall(pattern, text):\r\n\tspl = re.compile(pattern).split(text)\r\n\tresult = []\r\n\tbeginTag = \"\"\r\n\tendTag = None\r\n\tbeginFormat = \"\"\r\n\tendFormat = \"\"\r\n\tinitText = text\r\n\tfor s in spl:\r\n\t\ttext = text[len(s)+2:]\r\n\t\tend = text.find(\")s\")\r\n\t\tvar = \"\"\r\n\t\tif len(text) > 0:\r\n\t\t\tvar = text[:end]\r\n\t\t\tresult.append(var)\r\n\t\tif var == \"content\":\r\n\t\t\tbeginTag += s\r\n\t\t\tendTag = \"\"\r\n\t\telif endTag != None:\r\n\t\t\tendTag += s\r\n\t\t\tif var != \"\":\r\n\t\t\t\tif var in [\"disabled\",\"checked\",\"active\",\"selected\"]:\r\n\t\t\t\t\tendFormat += \" b'%s' if self.%s else b'',\"%(var, var)\r\n\t\t\t\telse:\r\n\t\t\t\t\tendFormat += \"self.%s,\"%var\r\n\t\t\t\tendTag += \"\\x25s\"\r\n\t\telse:\r\n\t\t\tbeginTag += s\r\n\t\t\tif var != \"\":\r\n\t\t\t\tif var in [\"disabled\",\"checked\",\"active\",\"selected\"]:\r\n\t\t\t\t\tbeginFormat += \" b'%s' if self.%s else b'',\"%(var, var)\r\n\t\t\t\telse:\r\n\t\t\t\t\tbeginFormat += \"self.%s,\"%var\r\n\t\t\t\tbeginTag += \"\\x25s\"\r\n\t\ttext = text[end+2:]\r\n\tif endTag == None:\r\n\t\tendTag = \"\"\r\n\t\tendFormat = \"\"\r\n\treturn result, beginTag, endTag, beginFormat, endFormat","def get_source_file_string_placeholders(file):\n placeholders = {}\n root = ET.parse(file).getroot()\n for element in root.findall('string'):\n name = element.get('name')\n value = ''.join(element.itertext())\n placeholder = get_placeholders(value)\n if placeholder:\n placeholders[name] = placeholder\n return placeholders","def parse_variables(self, text, separator=None):\n\n def splitter(x, separator=None):\n if len(x) > 1:\n y = x.split(separator)\n return (y[0], y[-1])\n return (None, None)\n\n return dict(splitter(x, separator=separator) for x in text.split(\"\\n\"))","def from_string(cls, string):\n m = re.match(r\"([0-9- :]+)\" # Timestamp (group 1)\n r\",[0-9]+\\s\" # Timestamp ms (ignored)\n r\"([A-Z]+)\\s+\" # Debug level (group 2)\n r\"(\\d+)\\s+\" # PID (group 3)\n r\"\\[\"\n r\"([^]]+)\\s*\" # Module name (group 4)\n r\"\\]:\\s+\"\n r\"(.*)\", # Debug message (group 5)\n string)\n if not m:\n raise DebugFormatError(\n \"Failed to match {} against the expected format\".format(\n string))\n ts = datetime.datetime.strptime(m.group(1), TS_FORMAT)\n return DebugStmt(ts, m.group(2), int(m.group(3)),\n m.group(4).strip(),\n m.group(5))","def parse_spans(span_string):\n spans = []\n for span in span_string.split(';'):\n start, end = span.split(' ')\n spans.append((int(start), int(end)))\n return spans","def parse_spans(span_string):\n spans = []\n for span in span_string.split(';'):\n start, end = span.split(' ')\n spans.append((int(start), int(end)))\n return spans","def get_parameters_from_input_string(string):\n parameter_array = []\n start_found = False\n item = str(\"\")\n for i in range(len(string)): \n if start_found == True and string[i] != \",\" and string[i] !=\")\":\n item += string[i]\n elif start_found == True and string[i] == \",\":\n if item not in parameter_array:\n parameter_array.append(item)\n item = str(\"\")\n elif start_found == True and string[i] == \")\":\n start_found = False\n if item not in parameter_array:\n parameter_array.append(item)\n item = str(\"\")\n # Start here and set start_found to True\n elif string[i] == \"(\":\n start_found = True\n return parameter_array","def check_placeholders(value):\n if isinstance(value, six.string_types):\n if TOKEN_REGEX.search(value):\n raise ValueError('{0:s} must be replaced in dictionary'.format(value))\n elif isinstance(value, list):\n return [check_placeholders(item) for item in value]\n elif isinstance(value, dict):\n return {key: check_placeholders(val) for key, val in value.items()}\n elif isinstance(value, tuple):\n return tuple(check_placeholders(val) for val in value)\n return value","def populate_fields(self):\n self.group_name = self._extract_group_name()\n self.services = self._extract_services()\n\n self._logger.debug(\"Parsed value: {}\".format([\n self.group_name,\n self.services]))","def _parameterize_string(raw):\n\n parts = []\n s_index = 0\n\n for match in _PARAMETER_PATTERN.finditer(raw):\n parts.append(raw[s_index:match.start()])\n parts.append({u\"Ref\": match.group(1)})\n s_index = match.end()\n\n if not parts:\n return GenericHelperFn(raw)\n\n parts.append(raw[s_index:])\n return GenericHelperFn({u\"Fn::Join\": [u\"\", parts]})","def field_values(s):\n if s: \n for f in s.split(','):\n if f.find('=') > 0:\n (field, value) = f.split('=')\n else:\n field = f\n value = None\n yield (field, value)","def get_formatted_string(self, input_string):\n if isinstance(input_string, str):\n try:\n return self.get_processed_string(input_string)\n except KeyError as err:\n # Wrapping the KeyError into a less cryptic error for end-user\n # friendliness\n missing_key = err.args[0]\n raise KeyNotInContextError(\n f'Unable to format \\'{input_string}\\' with '\n f'{{{missing_key}}}, because '\n f'context[\\'{missing_key}\\'] doesn\\'t exist') from err\n else:\n raise TypeError(f\"can only format on strings. {input_string} is a \"\n f\"{type(input_string)} instead.\")","def _parse_format(mode=2, rc_kw=None, **kwargs):\n kw = {}\n rc_kw = rc_kw or {}\n for key, value in kwargs.items():\n key_fixed = _rc_nodots.get(key, None)\n if key_fixed is None:\n kw[key] = value\n else:\n rc_kw[key_fixed] = value\n return rc_kw, mode, kw","def get_params(string_in, separator=' ', defaultmissing='-', params_to_get=3):\r\n rtr = str(string_in).split(separator)\r\n if len(rtr) > params_to_get:\r\n rtr = []\r\n rtr.append(str(string_in))\r\n for x in range(0, (params_to_get - len(rtr))):\r\n rtr.append(defaultmissing)\r\n return rtr[0],rtr[1],rtr[2]","def readOpt(self, String0):\n Name = re.match(r\"NAME : (.*)\", String0)[1]\n COMMENT = re.search(r\"COMMENT : (.*)\", String0)[1]\n TYPE = re.search(r\"TYPE : (.*)\", String0)[1]\n DIMENSION = re.search(r\"DIMENSION : (.*)\", String0)[1]\n split = String0.split(\"\\n\")\n Tour = []\n for s0 in split:\n if (s0 and s0[0] <= '9' and s0[0] >= '0'):\n Tour.append(int(s0))\n return Name, COMMENT, TYPE, DIMENSION, Tour","async def parse(self, raw: str) -> dict:","def _build_parsed_values(self):\n match = SAMPLE_REGEX.match(self.raw_data)\n \n if not match:\n raise SampleException(\"No regex match of parsed sample data: [%s]\" %\n self.decoded_raw)\n \n log.trace(\"Matching sample [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s]\",\n match.group(1),match.group(2),match.group(3),match.group(4),match.group(5),\n match.group(6),match.group(7),match.group(8),match.group(9),match.group(10),\n match.group(11),match.group(12))\n res_5 = float(match.group(1))\n res_x1 = float(match.group(2))\n res_x5 = float(match.group(3))\n h_5 = float(match.group(4))\n h_x1 = float(match.group(5))\n h_x5 = float(match.group(6))\n eh = float(match.group(7))\n ref_temp_v = float(match.group(8))\n ref_temp_c = float(match.group(9))\n res_temp_v = float(match.group(10))\n res_temp_c = float(match.group(11))\n batt_v = float(match.group(12))\n \n \n result = [{DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_5,\n DataParticleKey.VALUE: res_5},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_X1,\n DataParticleKey.VALUE: res_x1},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_X5,\n DataParticleKey.VALUE: res_x5},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.HYDROGEN_5,\n DataParticleKey.VALUE: h_5},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.HYDROGEN_X1,\n DataParticleKey.VALUE: h_x1},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.HYDROGEN_X5,\n DataParticleKey.VALUE: h_x5},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.EH_SENSOR,\n DataParticleKey.VALUE: eh},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.REFERENCE_TEMP_VOLTS,\n DataParticleKey.VALUE: ref_temp_v},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.REFERENCE_TEMP_DEG_C,\n DataParticleKey.VALUE: ref_temp_c},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_TEMP_VOLTS,\n DataParticleKey.VALUE: res_temp_v},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_TEMP_DEG_C,\n DataParticleKey.VALUE: res_temp_c},\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.BATTERY_VOLTAGE,\n DataParticleKey.VALUE: batt_v}\n ]\n \n return result","def split_text(text: str) -> List[Dict[str, str]]:\n # split into paragraphs\n lines = text.splitlines()\n groups = common.group_list(lines, lambda a, _: a.strip() == '')\n paras = ['\\n'.join(item) for empty_line, item in groups if not empty_line]\n\n def _fallback(p, type):\n logging.warn(f'Wrong {type} format:\\n' + p)\n cells.append({'type': 'text', 'source': p})\n\n cells = []\n for p in paras:\n lines = p.splitlines() + ['']\n p += '\\n'\n if p.startswith('#'):\n # parse title\n if not _is_mark(lines[1:]):\n _fallback(p, 'title')\n else:\n m = re.match(r'#+ *', lines[0])\n cells.append({\n 'type': 'title',\n 'prefix': m[0],\n 'source': lines[0][m.span()[1]:],\n 'mark': '\\n'.join(lines[1:])})\n elif p.startswith('$$'):\n # parse equations\n m = re.findall(r'\\$\\$', p)\n if len(m) != 2:\n _fallback(p, 'equation')\n else:\n cells.append({'type': 'equation', 'source': p})\n elif p.startswith('!['):\n # parse images\n if not lines[0].strip().endswith(')') or not _is_mark(lines[1:]):\n _fallback(p, 'image')\n else:\n cells.append({'type': 'image', 'source': p})\n elif p.startswith('|'):\n # parse table\n for i, l in enumerate(lines):\n if not l.startswith('|'):\n break\n if not _is_mark(lines[i:]):\n _fallback(p, 'equation')\n else:\n cells.append({'type': 'table', 'source': p})\n else:\n groups = common.group_list(lines, _list)\n for prefix, item in groups:\n if len(prefix.split('__')) == 2:\n prefix = prefix.split('__')[0]\n source = '\\n'.join(item)[len(prefix):]\n if prefix == '':\n cells.append({'type': 'text', 'source': source})\n else:\n cells.append({\n 'type': 'list',\n 'prefix': prefix,\n 'source': source})\n return cells","def format_input(self, args):\n\n new_list = []\n if args[1].find('{') != -1:\n new_list = self.format_dicti(args)\n return new_list\n else:\n new_list = []\n new_list.append(args[0])\n new_str = args[1][ args[1].find('(') + 2 : args[1].find(',') - 1]\n new_str += args[1][ args[1].find(',') : args[1].find(')') - 0]\n new_list.append(\" \".join(new_str.split(\", \") ) )\n\n return \" \".join(i for i in new_list)","def parse_line(self, line):\n line = line.strip()\n log.debug(\"Parsing line: '{}'\".format(line))\n if len(line) == 0:\n log.warning(\"Zero length line detected\")\n return\n split = line.split(DELIMETER)\n key = split[0]\n if key in FORMATS:\n log.debug(\"Using formatter for key: {}\".format(key))\n formatter = FORMATS[key]\n for (name, parser), value in zip(formatter,split[1:]):\n self._params[name] = parser(value)\n log.info(\"Parameters: {}\".format(self._params))\n self.notify_watchers()\n else:\n log.debug(\"Invalid key: {}\".format(key))","def _parse_date(date_string: str) -> Union[datetime.datetime, str]:\n for date_format in KNOWN_DATE_FORMATS:\n try:\n date = datetime.datetime.strptime(date_string, date_format)\n return date\n except ValueError:\n continue\n return date_string","def p_parse(toks):\n return p_question_group.parseString(toks[0])","def placeholders(self):\n x = [i.placeholder for i in self._input_desc]\n return x[0] if len(x) == 1 else x","def FillForm(string_for_substitution, dictionary_of_vars):\n return_string = string_for_substitution\n for i in re.findall(\"//%%(.*)%%//\", string_for_substitution):\n return_string = re.sub(\"//%%\" + i + \"%%//\", dictionary_of_vars[i],\n return_string)\n return return_string","def getModelParameters(parameterstring):\n \n def getFormattedValue(strval):\n if '\\'' in strval:\n return strval.replace('\\'', '')\n elif '\"' in strval:\n return strval.replace('\"', '')\n elif '.' in strval:\n return float(strval)\n elif strval == 'True':\n return True\n elif strval == 'False':\n return False\n else:\n return int(strval)\n \n ((25,),)\n def parseTuple(strval):\n idx = strval.find(\"(\")+1\n values = []\n i = idx\n while i < len(strval):\n if strval[i] == '(':\n nested, lnested = parseTuple(strval[i:])\n print(i)\n i += lnested\n idx = i+1\n print(i)\n values.append(nested)\n elif strval[i] == ')':\n newval = strval[idx:i].strip()\n if newval != '':\n values.append(getFormattedValue(newval))\n return tuple(values), i\n elif strval[i] == ',':\n newval = strval[idx:i].strip()\n if newval != '':\n values.append(getFormattedValue(newval))\n idx = i+1\n i += 1\n \n rv = dict()\n if parameterstring is None:\n return rv\n params = parameterstring.strip().split(\"=\")\n nextkey = params[0]\n for pi in range(1,len(params)):\n cur = params[pi]\n if '(' in cur:\n if cur.count(\"(\") != cur.count(\")\"):\n raise InvalidParameters(\"Unequal number of paranthesis.\")\n value, _ = parseTuple(cur)\n rv[nextkey] = value\n nextkey = cur[cur.rfind(',')].strip()\n else:\n commasplit = cur.split(\",\")\n value = commasplit[0].strip()\n rv[nextkey] = getFormattedValue(value)\n nextkey = commasplit[1].strip()\n \n return rv"],"string":"[\n \"def get_placeholder_formats_list(self, format_string):\\n placeholders = []\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"placeholder\\\"):\\n placeholders.append((token.group(\\\"key\\\"), token.group(\\\"format\\\")))\\n return placeholders\",\n \"def update_placeholder_formats(self, format_string, placeholder_formats):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if (\\n token.group(\\\"placeholder\\\")\\n and (not token.group(\\\"format\\\"))\\n and token.group(\\\"key\\\") in placeholder_formats\\n ):\\n output.append(f\\\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\\\")\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def update_placeholders(self, format_string, placeholders):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if token.group(\\\"key\\\") in placeholders:\\n output.append(\\n \\\"{{{}{}}}\\\".format(placeholders[token.group(\\\"key\\\")], token.group(\\\"format\\\"))\\n )\\n continue\\n elif token.group(\\\"command\\\"):\\n # update any placeholders used in commands\\n commands = parse_qsl(token.group(\\\"command\\\"), keep_blank_values=True)\\n # placeholders only used in `if`\\n if \\\"if\\\" in [x[0] for x in commands]:\\n items = []\\n for key, value in commands:\\n if key == \\\"if\\\":\\n # we have to rebuild from the parts we have\\n condition = Condition(value)\\n variable = condition.variable\\n if variable in placeholders:\\n variable = placeholders[variable]\\n # negation via `!`\\n not_ = \\\"!\\\" if not condition.default else \\\"\\\"\\n condition_ = condition.condition or \\\"\\\"\\n # if there is no condition then there is no\\n # value\\n if condition_:\\n value_ = condition.value\\n else:\\n value_ = \\\"\\\"\\n value = \\\"{}{}{}{}\\\".format(not_, variable, condition_, value_)\\n if value:\\n items.append(f\\\"{key}={value}\\\")\\n else:\\n items.append(key)\\n\\n # we cannot use urlencode because it will escape things\\n # like `!`\\n output.append(r\\\"\\\\?{} \\\".format(\\\"&\\\".join(items)))\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def parse_from_placeholder(string,pattern,encloser='%',matcher='(.+)'):\\n pattern,fields = placeholder_to_regex(pattern,encloser,matcher)\\n return parse_from_regex(string,pattern,fields)\",\n \"def _interpolate(format):\\n from tokenize import tokenprog\\n\\n def matchorfail(text, pos):\\n match = tokenprog.match(text, pos)\\n if match is None:\\n raise _ItplError(text, pos)\\n return match, match.end()\\n\\n namechars = \\\"abcdefghijklmnopqrstuvwxyz\\\" \\\\\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\\\";\\n chunks = []\\n pos = 0\\n\\n while 1:\\n dollar = format.find(\\\"$\\\", pos)\\n if dollar < 0: \\n break\\n nextchar = format[dollar + 1]\\n\\n if nextchar == \\\"{\\\":\\n chunks.append((0, format[pos:dollar]))\\n pos, level = dollar + 2, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token == \\\"{\\\": \\n level = level + 1\\n elif token == \\\"}\\\": \\n level = level - 1\\n chunks.append((1, format[dollar + 2:pos - 1]))\\n\\n elif nextchar in namechars:\\n chunks.append((0, format[pos:dollar]))\\n match, pos = matchorfail(format, dollar + 1)\\n while pos < len(format):\\n if format[pos] == \\\".\\\" and \\\\\\n pos + 1 < len(format) and format[pos + 1] in namechars:\\n match, pos = matchorfail(format, pos + 1)\\n elif format[pos] in \\\"([\\\":\\n pos, level = pos + 1, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token[0] in \\\"([\\\": \\n level = level + 1\\n elif token[0] in \\\")]\\\": \\n level = level - 1\\n else: \\n break\\n chunks.append((1, format[dollar + 1:pos]))\\n else:\\n chunks.append((0, format[pos:dollar + 1]))\\n pos = dollar + 1 + (nextchar == \\\"$\\\")\\n\\n if pos < len(format): \\n chunks.append((0, format[pos:]))\\n return chunks\",\n \"def _parse(self, fmtstr):\\n def _match_brace(string, start_pos, pair='[]'):\\n \\\"\\\"\\\"Pairing brackets (used internally in _parse method)\\\"\\\"\\\"\\n depth = 1\\n if string[start_pos] != pair[0]:\\n return None\\n for index, char in enumerate(string[start_pos + 1:]):\\n if char == pair[0]:\\n depth += 1\\n elif char == pair[1]:\\n depth -= 1\\n if depth == 0:\\n return start_pos + index + 1\\n return None\\n\\n #----------------------------------------------------------------------\\n\\n t_fmt = self.__class__._T_FMT\\n t_prefix = self.__class__._T_PREFIX\\n\\n ptr = 0\\n # it seems that field id 0 is invalid\\n field_id = 1\\n length = len(fmtstr)\\n parsed_list = []\\n\\n while ptr < length:\\n parsed = {}\\n m_prefix = t_prefix.match(fmtstr[ptr:])\\n if m_prefix:\\n ptr += _get_length_of_match(m_prefix)\\n parsed['prefix'] = m_prefix.group(1)\\n\\n # check if we have a nested structure\\n if m_prefix.group(2):\\n brace_offset = _match_brace(fmtstr, ptr - 1)\\n\\n # bracket not match\\n if not brace_offset:\\n raise BadFormatString(\\n 'Unmatched brace on position {0}'.format(ptr)\\n )\\n parsed['field_id'] = field_id\\n parsed['field_type'] = 'a'\\n parsed['subcontent'] = self._parse(\\n fmtstr[ptr:brace_offset]\\n )\\n ptr = brace_offset + 1\\n field_id += 1\\n\\n parsed_list.append(parsed)\\n continue\\n m_fmt = t_fmt.match(fmtstr[ptr:])\\n if m_fmt:\\n ptr += _get_length_of_match(m_fmt)\\n\\n # fmt is an alias\\n if m_fmt.group(2):\\n parsed['field_type'] = self.__class__\\\\\\n .FIELD_ALIAS[m_fmt.group(2)]\\n # fmt is an actual field type\\n elif m_fmt.group(1):\\n parsed['field_type'] = m_fmt.group(1)\\n\\n # save field id\\n parsed['field_id'] = field_id\\n\\n # check for type clones (e.g. `v3')\\n if m_fmt.group(3):\\n parsed['repeat'] = int(m_fmt.group(3))\\n field_id += int(m_fmt.group(3))\\n else:\\n parsed['repeat'] = 1\\n field_id += 1\\n\\n parsed_list.append(parsed)\\n\\n else:\\n raise BadFormatString(\\n 'Invalid token on position {0}'.format(ptr)\\n )\\n\\n # all set\\n return parsed_list\",\n \"def _get_placeholders(template):\\n return [p[1] for p in string.Formatter().parse(template)\\n if p[1] is not None and len(p[1]) > 0]\",\n \"def tokens(self, format_string):\\n if format_string not in self.format_string_cache:\\n tokens = list(re.finditer(self.reg_ex, format_string))\\n self.format_string_cache[format_string] = tokens\\n return self.format_string_cache[format_string]\",\n \"def formatLookup(format_str):\\n pat = '(\\\\d+)([A-Z])'\\n match = re.search(pat, format_str)\\n #print match.group()\\n \\n data_len = int(match.group(1))\\n data_fmt = str(match.group(2))\\n np_fmt = fitsFormatLookup(data_fmt)\\n np_dtype = '%i%s'%(data_len, np_fmt)\\n \\n return np_dtype, data_len, np_fmt\",\n \"def parse_name_and_type_from_fmt_str(\\n formatted_str: str,\\n allowed_types: Optional[Dict[str, Component]] = None\\n) -> Generator[Tuple[str, Type[Field]], None, None]:\\n for _, arg_name, _type_name, _ in Formatter().parse(formatted_str):\\n if arg_name is not None:\\n try:\\n assert _type_name is not None\\n _type = (\\n allowed_types[_type_name] if allowed_types is not None\\n and _type_name in allowed_types\\n else getattr(pyopenapi3.data_types, _type_name)\\n )\\n yield arg_name, _type\\n except AttributeError:\\n raise ValueError(\\n \\\"A non-`Field` or `OpenApiObject` type was found. \\\"\\n f\\\"Can't use `{_type_name}` as a type in {formatted_str}. \\\"\\n f\\\"Must be a stringified pyopenapi3 `data_type`, such \\\"\\n f\\\"as `pyopenapi3.data_types.String`, or a reference to a \\\"\\n f\\\"Component.\\\"\\n ) from None\",\n \"def __init__(self, format_string):\\r\\n if not isinstance(format_string, Compatibility.string):\\r\\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\\r\\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\\r\\n self._re = re.compile(self._re_pattern)\",\n \"def extract_pattern(fmt):\\n class FakeDict(object):\\n def __init__(self):\\n self.seen_keys = set()\\n\\n def __getitem__(self, key):\\n self.seen_keys.add(key)\\n return ''\\n\\n def keys(self):\\n return self.seen_keys\\n\\n fake = FakeDict()\\n try:\\n fmt % fake\\n except TypeError:\\n # Formatting error\\n pass\\n return set(fake.keys())\",\n \"def parse(self, s):\\n\\n segments = self.compiled.split(self._whitespace.sub(\\\" \\\", s))\\n literals = segments[::2]\\n raw = segments[1::2]\\n\\n if not raw:\\n return []\\n\\n case = list(map(str.casefold, raw))\\n prefixes = [{}] + [dict(self.locale_set.prefixes.get(match, ())) for match in case[:-1]]\\n suffixes = [dict(self.locale_set.suffixes.get(match, ())) for match in case[1:]] + [{}]\\n\\n groups = _DateTime(**{ field: [] for field in _DateTime._fields })\\n choices_per_position = {}\\n always_literal = set()\\n numeric = set()\\n for idx, (prefix, suffix) in enumerate(zip(prefixes, suffixes)):\\n keyword = self._lookup_keyword(raw[idx])\\n if \\\"y\\\" in prefix:\\n prefix[\\\"C\\\"] = tuple(set(prefix[\\\"y\\\"] + prefix.get(\\\"C\\\", ())))\\n if not keyword:\\n always_literal.add(idx)\\n else:\\n if raw[idx].isdigit():\\n numeric.add(idx)\\n choices_per_position[idx] = len(keyword)\\n for fmt, value, locales in keyword:\\n category = fmt[-1]\\n if category == \\\"b\\\":\\n # Month-names should be treated like numeric months.\\n category = \\\"m\\\"\\n elif category == \\\"z\\\":\\n category = \\\"Z\\\"\\n getattr(groups, category).append(_Assignment(\\n fmt=fmt,\\n pos=idx,\\n value=value,\\n locales=locales,\\n prefix=prefix.get(fmt[-1]),\\n suffix=suffix.get(fmt[-1]),\\n ))\\n numeric = frozenset(numeric)\\n\\n # If a required date field is unsatisfiable, this is not a date.\\n if not all(getattr(groups, category) for category in _State._min_date_formats):\\n for category in _State._all_date_formats:\\n getattr(groups, category).clear()\\n\\n # If a required time field is unsatisfiable, this is not a time.\\n if not all(getattr(groups, category) for category in _State._min_time_formats):\\n for category in _State._all_time_formats:\\n getattr(groups, category).clear()\\n\\n for group in groups:\\n group.sort(key=lambda assignment: (\\n -self._optimistic_score(assignment),\\n choices_per_position[assignment.pos],\\n ))\\n\\n required_formats = _State._min_date_formats + _State._min_time_formats\\n groups = OrderedDict(sorted(\\n (\\n (\\n category,\\n (\\n group,\\n tuple(\\n (f, required)\\n for f, required in _position_constraints\\n if category in required\\n ),\\n tuple(\\n (f, required)\\n for f, required, revisit in _value_constraints\\n if category in required or category in revisit\\n ),\\n )\\n )\\n for category, group in zip(groups._fields, groups)\\n if group\\n ),\\n key=lambda i: (i[0] not in required_formats, len(i[1][0]))\\n ))\\n\\n # We've already filtered out all possibilities; there's nothing here.\\n if not groups:\\n return []\\n\\n constrained_groups = []\\n while groups:\\n category, (group, position, value) = groups.popitem(last=False)\\n constrained_groups.append((category, group, position, value))\\n required = frozenset(itertools.chain.from_iterable(required for f, required in itertools.chain(position, value)))\\n if required:\\n required = [\\n category\\n for category in reversed(groups.keys())\\n if category in required\\n ]\\n for category in required:\\n groups.move_to_end(category, last=False)\\n groups = constrained_groups\\n\\n best_quality = 0\\n best_candidates = []\\n\\n partials = [\\n _State.empty._replace(\\n unconverted=frozenset(always_literal),\\n remaining_groups=tuple(groups),\\n ).children(numeric=numeric)\\n ]\\n while partials:\\n try:\\n quality, locales, state = next(partials[-1])\\n except StopIteration:\\n partials.pop()\\n continue\\n\\n if state.remaining_groups:\\n # Admissable heuristic: compute the best score each group\\n # could possibly achieve. Don't count conversion specifiers\\n # that we've already used, but don't worry about conflicts\\n # in the groups we haven't assigned yet. Any such conflicts\\n # can only reduce the resulting score, and we only need to\\n # make sure that the heuristic is at least as large as the\\n # true value of the best leaf in this subtree. However, the\\n # more precise we can be here, the fewer nodes we have to\\n # search, so we can spend some CPU time on precision and\\n # still come out ahead.\\n assigned = state.unconverted.union(state.pos).difference((None,))\\n heuristic = len(state.pending_hints) + sum(\\n next((\\n self._optimistic_score(assignment)\\n for assignment in group[1]\\n if assignment.pos not in assigned\\n ), 0)\\n for group in state.remaining_groups\\n )\\n\\n if quality + heuristic < best_quality:\\n # Even assuming the remaining groups get the highest\\n # possible score, this state is still not good enough.\\n continue\\n\\n partials.append(state.children(numeric=numeric))\\n continue\\n\\n value = state.valid()\\n if value is None:\\n continue\\n\\n quality, locales, state = state.final_score()\\n\\n if best_quality is not None and quality < best_quality:\\n # We've seen better, so skip this one.\\n continue\\n\\n if quality != best_quality:\\n best_quality = quality\\n best_candidates = []\\n\\n conversions = dict(zip(state.pos, state.fmts))\\n fmts = [ conversions.get(idx) or literal for idx, literal in enumerate(raw) ]\\n\\n pattern = ''.join(lit + fmt for lit, fmt in zip(literals, fmts + [''])).replace(\\\"%C%y\\\", \\\"%Y\\\")\\n best_candidates.append((pattern, value, locales))\\n return best_candidates\",\n \"def find_time(string, format):\\n re_format = format\\n for key, value in six.iteritems(REGEX):\\n re_format = re_format.replace(key, value)\\n matches = re.finditer(re_format, string)\\n for match in matches:\\n try:\\n matchstr = string[slice(*match.span())]\\n dt = datetime.strptime(matchstr, format)\\n except ValueError:\\n continue\\n else:\\n yield dt\",\n \"def initFormat(self):\\n self.formatList = self.splitText(self.format)\",\n \"def parse_format(var_sample):\\n # ugh\\n ret = []\\n # Parsing format information\\n # Need to see what all these could be...\\n if None in var_sample[\\\"GT\\\"]:\\n ret.append(3)\\n elif var_sample[\\\"GT\\\"] == (0, 0):\\n ret.append(0)\\n elif var_sample[\\\"GT\\\"] == (0, 1):\\n ret.append(1)\\n elif var_sample[\\\"GT\\\"] == (1, 1):\\n ret.append(2)\\n \\n ret.extend([var_sample[\\\"GQ\\\"] if var_sample[\\\"GQ\\\"] is not None else 0,\\n var_sample[\\\"OV\\\"],\\n var_sample[\\\"DP\\\"], # be careful these aren't '.'\\n #split where _r is ref-allele and _a is alt-allele\\n var_sample[\\\"AD\\\"][0],\\n var_sample[\\\"AD\\\"][1],\\n var_sample[\\\"PDP\\\"],\\n var_sample[\\\"PAD\\\"][0],\\n var_sample[\\\"PAD\\\"][1],\\n var_sample[\\\"US\\\"][0],\\n var_sample[\\\"US\\\"][1],\\n var_sample[\\\"DS\\\"][0],\\n var_sample[\\\"DS\\\"][1],\\n var_sample[\\\"UC\\\"][0],\\n var_sample[\\\"UC\\\"][1],\\n var_sample[\\\"DC\\\"][0],\\n var_sample[\\\"DC\\\"][1],\\n var_sample[\\\"UDC\\\"][0],\\n var_sample[\\\"UDC\\\"][1],\\n var_sample[\\\"UCC\\\"][0],\\n var_sample[\\\"UCC\\\"][1],\\n var_sample[\\\"DDC\\\"][0],\\n var_sample[\\\"DDC\\\"][1],\\n var_sample[\\\"DCC\\\"][0],\\n var_sample[\\\"DCC\\\"][1],\\n var_sample[\\\"UMO\\\"][0],\\n var_sample[\\\"UMO\\\"][1],\\n var_sample[\\\"DMO\\\"][0],\\n var_sample[\\\"DMO\\\"][1],\\n var_sample[\\\"UXO\\\"][0],\\n var_sample[\\\"UXO\\\"][1],\\n var_sample[\\\"DXO\\\"][0],\\n var_sample[\\\"DXO\\\"][1],\\n var_sample[\\\"NR\\\"][0],\\n var_sample[\\\"NR\\\"][1],\\n var_sample[\\\"MO\\\"][0],\\n var_sample[\\\"MO\\\"][1],\\n var_sample[\\\"XO\\\"][0],\\n var_sample[\\\"XO\\\"][1],\\n var_sample[\\\"XC\\\"][0],\\n var_sample[\\\"XC\\\"][1],\\n var_sample[\\\"AC\\\"][0],\\n var_sample[\\\"AC\\\"][1],\\n var_sample[\\\"MC\\\"][0],\\n var_sample[\\\"MC\\\"][1],\\n var_sample[\\\"EC\\\"][0],\\n var_sample[\\\"EC\\\"][1],\\n var_sample[\\\"PL\\\"][0] if var_sample[\\\"PL\\\"][0] is not None else 0,\\n var_sample[\\\"PL\\\"][1] if var_sample[\\\"PL\\\"][0] is not None else 0,\\n var_sample[\\\"PL\\\"][2] if var_sample[\\\"PL\\\"][0] is not None else 0])\\n return ret\\n #END\",\n \"def guess_format(string):\\n format_regexps = _compiled_format_regexps(_date_formats, _time_formats)\\n for format, regexp in format_regexps:\\n if regexp.search(string):\\n return format\\n # Nothing matched\\n raise CannotParse(\\\"Could not guess date/time format in: %s\\\" % string)\",\n \"def parse(string, format):\\n # Count the number of spaces in the format string (N), and\\n # truncate everything after the (N+1)th space\\n spaces = format.count(' ') + 1\\n string = ' '.join(string.split()[:spaces])\\n\\n try:\\n result = dt.datetime.strptime(string, format)\\n except ValueError, err:\\n raise CannotParse(str(err))\\n else:\\n return result\",\n \"def change_format_var_parser(text, tracker):\\n param_names = format_var_parser(text)\\n param_vars = {}\\n for param_name in param_names:\\n try:\\n param_vars[param_name] = tracker.get_slot(param_name)\\n except Exception as e:\\n PYTHON_LOGGER.error(\\\"Error to get var name {}: {}\\\".format(param_name, e))\\n return text.format(**param_vars)\",\n \"def parseSettings (formatStr):\\n # split string\\n fmt = formatStr.split ('.')\\n if len (fmt) < 0:\\n return (None, None)\\n \\n # find encoder\\n encoderInstance = None\\n for e in _registeredEncoders:\\n if len (fmt) > 0:\\n if e.name () == fmt[0]:\\n encoderInstance = e\\n break\\n else:\\n encoderInstance = _registeredEncoders[0] if len (_registeredEncoders) > 0 else None\\n\\n # return tuple with parsed settings\\n presetName = '.'.join (fmt[1:])\\n if presetName in (None, \\\"\\\"):\\n if encoderInstance != None:\\n presetName = encoderInstance.defaultPreset ()\\n return (encoderInstance, presetName)\",\n \"def parse(timestring):\\n for parser in _PARSERS:\\n match = parser['pattern'].match(timestring)\\n if match:\\n groups = match.groups()\\n ints = tuple(map(int, groups))\\n time = parser['factory'](ints)\\n return time\\n\\n raise TimeError('Unsupported time format {}'.format(timestring))\",\n \"def extract_fields(entry_string):\\n for field, value in re.findall(\\\"(.*?)=(.*?)\\\\}\\\", entry_string):\\n yield field.strip(\\\",\\\").strip(\\\" \\\"), value.strip(\\\"{\\\").strip(\\\"}\\\")\",\n \"def parse_template(template):\\n field_name = None\\n field_value = []\\n\\n for line in template.strip().split('\\\\n') + ['end:']:\\n if line.startswith('#'):\\n continue\\n match = RE_TEMPLATE_FIELD_LINE.match(line)\\n if match:\\n if field_name is not None:\\n yield (field_name, '\\\\n'.join(field_value).strip())\\n elif len(field_value) > 0:\\n logging.warning('Ignoring lines: %r', field_value)\\n\\n field_name = match.group(1)\\n field_value = [match.group(2)]\\n else:\\n field_value.append(line)\",\n \"def strptime(date_string, format):\\n i = 0\\n format_len = len(format)\\n # Iterate through the format string, applying parsers and matching literal\\n # chars as appropriate.\\n struct_time_d = {}\\n while i < format_len:\\n c = format[i]\\n # If the character is not the start of a directive, attempt to match a\\n # literal character.\\n if c != '%':\\n if date_string[0] != c:\\n return None\\n date_string = date_string[1:]\\n else:\\n # Read the next character of the directive, letting an IndexError\\n # raise if format is exhausted/malformed.\\n i += 1\\n directive = format[i]\\n # Raise a ValueError just like the built-in datetime.strptime()\\n # if the directive is invalid.\\n if directive not in DIRECTIVE_PARSER_MAP:\\n raise ValueError(\\\"{} is a bad directive in format {}\\\".format(\\n repr(directive[1]), repr(directive)))\\n # Get the parser.\\n parser = DIRECTIVE_PARSER_MAP[directive]\\n # Check whether the parser is yet to be implemented.\\n if parser is NOT_IMPLEMENTED:\\n raise NotImplementedError(\\n 'parser not defined for directive: {}'.format(directive)\\n )\\n # Do the parsing.\\n result = parser(date_string)\\n # Return None on any parsing failure.\\n if result is False:\\n return None\\n value, date_string = result\\n # Convert the directive value to a struct_time item.\\n struct_time_item = directive_to_struct_time_item(directive, value)\\n if struct_time_item is not None:\\n k, v = struct_time_item\\n # If the key already exists, accumulate, otherwise set.\\n if k in struct_time_d:\\n struct_time_d[k] += v\\n else:\\n struct_time_d[k] = v\\n i += 1\\n\\n # Return None if the date string has not been completely consumed.\\n if len(date_string) > 0:\\n return None\\n\\n # Return None if a +12 hour AM_PM = 'PM' accumulation overflowed a parsed\\n # HOUR_24 value.\\n if not (0 <= struct_time_d.get(STRUCT_TIME.TM_HOUR, 0) <= 23):\\n return None\\n\\n # Attempt to get year/month/day for date ops.\\n year = struct_time_d.get(STRUCT_TIME.TM_YEAR)\\n month = struct_time_d.get(STRUCT_TIME.TM_MON)\\n day = struct_time_d.get(STRUCT_TIME.TM_MDAY)\\n has_date = year is not None and month is not None and day is not None\\n\\n # Return None if the specified day is not valid for the month.\\n if has_date and not is_valid_month_day(year, month, day):\\n return None\\n\\n # Create an initial struct_time object.\\n _struct_time = struct_time(\\n *[struct_time_d.get(k, 0) for k in STRUCT_TIME_FIELDS]\\n )\\n\\n if has_date:\\n # Check whether accumulated minute value exceeds its max as a result of\\n # accumulating a time zone offset, requiring some calendar day math.\\n if not 0 <= struct_time_d.get(STRUCT_TIME.TM_MIN, 0) <= 59:\\n # Pass _struct_time along with an empty time_delta to\\n # add_struct_time_time_delta() to take advantage of its\\n # over/underflow logic. Note that add_struct_time_time_delta() will\\n # take care of setting the final day of week / year.\\n _struct_time = add_struct_time_time_delta(\\n _struct_time, time_delta())\\n else:\\n # Calculate the final day of week / year.\\n _struct_time = struct_time_replace(\\n _struct_time,\\n tm_wday=date_to_day_of_week(year, month, day),\\n tm_yday=date_to_day_of_year(year, month, day)\\n )\\n\\n return _struct_time\",\n \"def parse_place_notation(input_string: str) -> Tuple[int, str]:\\n\\n # Looking for a string that matches <stage>:<place notation> where the\\n # place notation is a series of bell numbers and 'x' characters\\n parts = input_string.split(\\\":\\\")\\n if len(parts) == 2:\\n stage_part = parts[0]\\n if len(stage_part) == 0 or not stage_part.isnumeric():\\n raise PlaceNotationError(input_string, \\\"Stage must be a number\\\")\\n stage = int(stage_part)\\n place_notation = parts[1]\\n if not valid_pn(place_notation):\\n raise PlaceNotationError(input_string, \\\"Place notation is invalid\\\")\\n else:\\n raise PlaceNotationError(input_string, \\\"<stage>:<place notation> required\\\")\\n\\n return stage, place_notation\",\n \"def _parse_kvfmt(self, fmtlist):\\n t_fmt = self.__class__._T_FMT\\n t_prefix = self.__class__._T_PREFIX\\n parsed_list = []\\n field_id = 1\\n\\n for entry in fmtlist:\\n name = entry[0]\\n fmt = entry[1]\\n parsed_field = {}\\n parsed_field['name'] = name\\n if isinstance(fmt, str):\\n ptr = 0\\n m_prefix = t_prefix.match(fmt)\\n if m_prefix:\\n ptr += _get_length_of_match(m_prefix)\\n parsed_field['prefix'] = m_prefix.group(1)\\n # check for optional nested structure start (required if the field is also repeated)\\n if m_prefix.group(2) and len(entry) > 2:\\n parsed_field['field_id'] = field_id\\n parsed_field['field_type'] = 'a'\\n parsed_field['subcontent'] = self._parse_kvfmt(entry[2])\\n field_id += 1\\n parsed_list.append(parsed_field)\\n continue\\n elif m_prefix.group(2):\\n raise BadFormatString('Nested field type used without specifying field format.')\\n m_fmt = t_fmt.match(fmt[ptr:])\\n if m_fmt:\\n ptr += _get_length_of_match(m_fmt)\\n resolved_fmt_char = None\\n # fmt is an alias\\n if m_fmt.group(2):\\n resolved_fmt_char = m_fmt.group(2)\\n parsed_field['field_type'] = self.__class__\\\\\\n .FIELD_ALIAS[m_fmt.group(2)]\\n # fmt is an actual field type\\n elif m_fmt.group(1):\\n resolved_fmt_char = m_fmt.group(1)\\n parsed_field['field_type'] = m_fmt.group(1)\\n parsed_field['field_id'] = field_id\\n # only skip type (`x') is allowed for copying in key-value mode\\n if m_fmt.group(3) and resolved_fmt_char == 'x':\\n repeats = int(m_fmt.group(3))\\n parsed_field['repeat'] = repeats\\n field_id += repeats\\n elif m_fmt.group(3):\\n raise BadFormatString('Field copying is not allowed in key-value format list.')\\n else:\\n field_id += 1\\n else:\\n raise BadFormatString('Invalid type for field \\\"{0}\\\"'.format(name))\\n if len(fmt) != ptr:\\n self.logger.warning('Extra content found after the type string of %s.', name)\\n else:\\n # Hard-code the empty prefix because we don't support copying\\n parsed_field['prefix'] = ''\\n parsed_field['field_id'] = field_id\\n parsed_field['field_type'] = 'a'\\n parsed_field['subcontent'] = self._parse_kvfmt(fmt)\\n field_id += 1\\n parsed_list.append(parsed_field)\\n return parsed_list\",\n \"def build_block(self, format_string):\\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\\n block = first_block\\n\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n value = token.group(0)\\n if token.group(\\\"block_start\\\"):\\n # Create new block\\n block = block.new_block()\\n elif token.group(\\\"block_end\\\"):\\n # Close block setting any valid state as needed\\n # and return to parent block to continue\\n if not block.parent:\\n raise Exception(\\\"Too many `]`\\\")\\n block = block.parent\\n elif token.group(\\\"switch\\\"):\\n # a new option has been created\\n block = block.switch()\\n elif token.group(\\\"placeholder\\\"):\\n # Found a {placeholder}\\n key = token.group(\\\"key\\\")\\n format = token.group(\\\"format\\\")\\n block.add(Placeholder(key, format))\\n elif token.group(\\\"literal\\\"):\\n block.add(Literal(value))\\n elif token.group(\\\"lost_brace\\\"):\\n # due to how parsing happens we can get a lonesome }\\n # eg in format_string '{{something}' this fixes that issue\\n block.add(Literal(value))\\n elif token.group(\\\"command\\\"):\\n # a block command has been found\\n block.set_commands(token.group(\\\"command\\\"))\\n elif token.group(\\\"escaped\\\"):\\n # escaped characters add unescaped values\\n if value[0] in [\\\"\\\\\\\\\\\", \\\"{\\\", \\\"}\\\"]:\\n value = value[1:]\\n block.add(Literal(value))\\n\\n if block.parent:\\n raise Exception(\\\"Block not closed\\\")\\n # add to the cache\\n self.block_cache[format_string] = first_block\",\n \"def _parse_date_format( fmp_database ):\\n\\tdef build_one( stamp ):\\n\\t\\treturn stamp.\\\\\\n\\t\\t replace( 'yyyy', '%Y' ).\\\\\\n\\t\\t replace( 'MM', '%m' ).\\\\\\n\\t\\t replace( 'dd', '%d' ).\\\\\\n\\t\\t replace( 'HH', '%H' ).\\\\\\n\\t\\t replace( 'mm', '%M' ).\\\\\\n\\t\\t replace( 'ss', '%S' )\\n\\n\\treturn {\\n\\t\\t'date': build_one( fmp_database.get('date-format', '') ),\\n\\t\\t'timestamp': build_one( fmp_database.get('timestamp-format', '') ),\\n\\t\\t'time': build_one( fmp_database.get('time-format', '') ),\\n\\t}\",\n \"def _slice_template(cls, in_str: str) -> Iterator[RawFileSlice]:\\n fmt = Formatter()\\n in_idx = 0\\n for literal_text, field_name, format_spec, conversion in fmt.parse(in_str):\\n if literal_text:\\n escape_chars = cls._sorted_occurrence_tuples(\\n cls._substring_occurrences(literal_text, [\\\"}\\\", \\\"{\\\"])\\n )\\n idx = 0\\n while escape_chars:\\n first_char = escape_chars.pop()\\n # Is there a literal first?\\n if first_char[1] > idx:\\n yield RawFileSlice(\\n literal_text[idx : first_char[1]], \\\"literal\\\", in_idx\\n )\\n in_idx += first_char[1] - idx\\n # Add the escaped\\n idx = first_char[1] + len(first_char[0])\\n # We double them here to make the raw\\n yield RawFileSlice(\\n literal_text[first_char[1] : idx] * 2, \\\"escaped\\\", in_idx\\n )\\n # Will always be 2 in this case.\\n # This is because ALL escape sequences in the python formatter\\n # are two characters which reduce to one.\\n in_idx += 2\\n # Deal with last one (if present)\\n if literal_text[idx:]:\\n yield RawFileSlice(literal_text[idx:], \\\"literal\\\", in_idx)\\n in_idx += len(literal_text) - idx\\n # Deal with fields\\n if field_name:\\n constructed_token = \\\"{{{field_name}{conv}{spec}}}\\\".format(\\n field_name=field_name,\\n conv=f\\\"!{conversion}\\\" if conversion else \\\"\\\",\\n spec=f\\\":{format_spec}\\\" if format_spec else \\\"\\\",\\n )\\n yield RawFileSlice(constructed_token, \\\"templated\\\", in_idx)\\n in_idx += len(constructed_token)\",\n \"def read_atom_data(atom_format, line):\\n if atom_format is None:\\n _format = [guess_string_format(i.strip()) for i in line.split()]\\n else:\\n _format = atom_format\\n formatted = []\\n for i, (val, fmti) in enumerate(zip(line.split(), _format)):\\n istrip = val.strip()\\n try:\\n formatted.append(fmti(istrip))\\n except ValueError:\\n fmt = guess_string_format(istrip)\\n _format[i] = fmt\\n formatted.append(fmt(istrip))\\n return formatted, _format\",\n \"def formatted(s):\\n matches = re.findall(_format_re, normalize(s))\\n if len(matches) == 1 and matches[0][0] != '':\\n return matches[0][0]\\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\\n if txt_none != '':\\n return FORMAT_NONE, txt_none\\n elif txt_sw != '':\\n return FORMAT_SW, txt_sw\\n elif txt_rem != '':\\n return FORMAT_REM, txt_rem\\n elif txt_em != '':\\n return FORMAT_EM, txt_em\\n elif txt_a != '':\\n return FORMAT_A, txt_a\\n return [to_fmt(*m) for m in matches]\",\n \"def parse(cls, value: str) -> Tuple[str, Dict[str, str]]:\\n raw_value = read_value_from_path(value)\\n args: Dict[str, str] = {}\\n\\n if \\\"@\\\" in raw_value:\\n args[\\\"region\\\"], raw_value = raw_value.split(\\\"@\\\", 1)\\n\\n # now find any other arguments that can be filters\\n matches = re.findall(r\\\"([0-9a-zA-z_-]+:[^\\\\s$]+)\\\", raw_value)\\n for match in matches:\\n k, v = match.split(\\\":\\\", 1)\\n args[k] = v\\n\\n return args.pop(\\\"name_regex\\\"), args\",\n \"def get_placeholders(self):\\n\\n # Define regex\\n regex = f'\\\\{self.marker_string}([^$]+)\\\\{self.marker_string}'\\n\\n found_placeholders = [match.group(1) for match in re.finditer(regex, self.raw_sequence)]\\n\\n # Check for duplicates\\n for found_placeholder in found_placeholders:\\n if found_placeholders.count(found_placeholder) != 1:\\n\\n error_msg = f\\\"Placeholder {found_placeholder} found multiple times in sequence.\\\"\\n self.hd.log.info(error_msg)\\n\\n # Remove duplicates from list\\n found_placeholders = list(set(found_placeholders))\\n\\n return found_placeholders\",\n \"def parse_template(string):\\n count = 0\\n list1 = []\\n for character in string:\\n count = count + 1\\n if character == \\\"{\\\":\\n end = string.find(\\\"}\\\", count)\\n s_strg = string[count:end]\\n list1.append(s_strg)\\n string = string.replace(s_strg, \\\"\\\", 1)\\n count = count - len(s_strg)\\n\\n subs = tuple(list1)\\n\\n return(string, subs)\\n print(subs)\",\n \"def _parseAttributeScanf(self, line, formatting):\\n\\n # multiple entrys\\n if isinstance(formatting, list):\\n for scanf_format in formatting:\\n try:\\n #print \\\"<<<----\\\", scanf_format, line\\n return sscanf(line, scanf_format)\\n except IncompleteCaptureError, e:\\n pass\\n\\n # single entry\\n else:\\n return sscanf(line, formatting)\\n\\n # problem if none of the formats worked\\n raise IncompleteCaptureError(\\\"Format error for %s\\\" % line)\",\n \"def regex_findall_variables(raw_string: Text) -> List[Text]:\\n try:\\n match_start_position = raw_string.index(\\\"$\\\", 0)\\n except ValueError:\\n return []\\n\\n vars_list = []\\n while match_start_position < len(raw_string):\\n\\n # Notice: notation priority\\n # $$ > $var\\n\\n # search $$\\n dollar_match = dolloar_regex_compile.match(raw_string, match_start_position)\\n if dollar_match:\\n match_start_position = dollar_match.end()\\n continue\\n\\n # search variable like ${var} or $var\\n var_match = variable_regex_compile.match(raw_string, match_start_position)\\n if var_match:\\n var_name = var_match.group(1) or var_match.group(2)\\n vars_list.append(var_name)\\n match_start_position = var_match.end()\\n continue\\n\\n curr_position = match_start_position\\n try:\\n # find next $ location\\n match_start_position = raw_string.index(\\\"$\\\", curr_position + 1)\\n except ValueError:\\n # break while loop\\n break\\n\\n return vars_list\",\n \"def _parse_parameters(self, parameters_text):\\n for mo in re.finditer(self._PARAMETERS_RE, parameters_text):\\n self._parameters.append(Parameter(mo.group(\\\"param_name\\\"), mo.group(\\\"default_value\\\")))\",\n \"def format_regexp(simple_format):\\n format, regexp = ('', '')\\n for char in simple_format:\\n if char in _regexps:\\n format += '%' + char\\n regexp += _regexps[char]\\n else:\\n format += char\\n regexp += char\\n return (format, regexp)\",\n \"def parsePercentExpression(literal, format):\\n\\tmat = _getREForPercentExpression(format).match(literal)\\n\\tif not mat:\\n\\t\\traise ValueError(\\\"'%s' cannot be parsed using format '%s'\\\"%(\\n\\t\\t\\tliteral, format))\\n\\treturn mat.groupdict()\",\n \"def _parse_param_line(regex, line):\\n out = []\\n for r in regex.findall(line):\\n converter, variable = r[0] or 'default', r[1]\\n out.append((_CONVERTERS[converter], variable))\\n return out\",\n \"def __new__(cls, format):\\n self = super(SF_Pattern, cls).__new__(cls)\\n\\n if isinstance(format, bytes):\\n uni_str = format.decode('ISO-8859-1') # decode to unicode\\n trans_str = translate(uni_str) # translate only works with unicode\\n re_fmt = trans_str.encode('ISO-8859-1') # encode back to bytes\\n self._spec = _gbspec\\n else:\\n re_fmt = translate(format)\\n self._spec = _gspec\\n\\n self._format = format\\n self._re = cre = re.compile(re_fmt)\\n\\n if cre.groupindex and len(cre.groupindex) != cre.groups:\\n raise RuntimeError('cannot mix mapped and unmapped specifiers')\\n elif not cre.groupindex:\\n self._retfunc = self._return_tuple\\n self._type = tuple\\n else:\\n self._retfunc = self._return_dict\\n self._type = dict\\n\\n self._casts = self._get_types()\\n\\n return self\",\n \"def scanf(format, string):\\n re_fmt = compile(format)\\n result = re_fmt.scanf(string)\\n _log.debug('%r <- %r = %r', format, string, result)\\n return result\",\n \"def parse_from_regex(string,pattern,fields):\\n\\n string = string.replace('\\\\\\\\','/') # USE POSIX PLEASE\\n num_groups = flat_paren_counter(pattern)\\n if isinstance(fields,str):\\n fields = [fields]\\n num_fields = len(fields)\\n if not num_fields == num_groups:\\n return {}\\n match = re.search(pattern,string)\\n if not num_groups == len(match.groups()):\\n return {}\\n \\n l = []\\n \\n for field,value in zip(fields,list(match.groups())):\\n d = nested_notation_to_tree(field,value)\\n l.append(d)\\n return deep_merge_N(l)\",\n \"def parse_params(txt):\\n res = list()\\n # First, slipt with stuff looking like \\\\TYPE:\\n splitted = re.split(r'\\\\s*\\\\\\\\(\\\\w+)\\\\s*:', txt)\\n # We now have a list looking like:\\n # ['', 'flag', '....', 'param', '...']\\n i = 1\\n while i < len(splitted) - 1:\\n type = splitted[i]\\n rest = splitted[i+1]\\n if type == \\\"argn\\\":\\n name = \\\"remaining args\\\"\\n desc = rest\\n else:\\n # first word is the name, the rest is the description:\\n match = re.match(r'\\\\s*(\\\\w+)\\\\s*(.*)', rest, re.DOTALL)\\n if not match:\\n print(\\\"warning, failed to parse parameters\\\")\\n print(\\\"near\\\", rest)\\n break\\n (name, desc) = match.groups()\\n desc = clean_indent(desc)\\n res.append((type, name, desc))\\n i += 2\\n return res\",\n \"def _translate_fmts(self):\\n fmt_info = []\\n fmt_append = fmt_info.append\\n \\n isvalid = self._is_valid_fmt\\n typlist = self._typlist\\n isstrvar = self._isstrvar\\n default_fmts = self._default_fmts\\n \\n for i, fmt in enumerate(self._fmtlist):\\n fmt = fmt.strip()\\n \\n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\\n \\n if iscalendar or not isvalid(fmt):\\n if isstrvar(i):\\n wid = min(typlist[i], 10)\\n fmt_append(('s', \\\"{{:>{}s}}\\\".format(wid), wid))\\n continue\\n else:\\n fmt = default_fmts[typlist[i]]\\n \\n last_char = fmt[-1]\\n if last_char == 's': # string\\n m = STR_FMT_RE.match(fmt)\\n align, _, wid = m.group(1), m.group(2), m.group(3)\\n new_align = (\\\"<\\\" if align == \\\"-\\\" \\n else \\\"^\\\" if align == \\\"~\\\" else \\\">\\\")\\n new = \\\"\\\".join((\\\"{:\\\", new_align, wid, \\\"s}\\\"))\\n fmt_append(('s', new, int(wid)))\\n elif last_char == 'H' or last_char == 'L': # binary\\n fmt_append((last_char, fmt, int(fmt[1:-1])))\\n elif last_char == 'x': # hexadecimal\\n fmt_append(('x', fmt, 21))\\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\\n m = NUM_FMT_RE.match(fmt)\\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \\n m.group(3), m.group(4),\\n m.group(5), m.group(6),\\n m.group(7))\\n aln = \\\"<\\\" if align == \\\"-\\\" else \\\">\\\"\\n sep = \\\",\\\" if com is not None else \\\"\\\"\\n if type == \\\"g\\\" and int(prec) == 0:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, type, \\\"}\\\"))\\n else:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, \\\".\\\", prec, type, \\\"}\\\"))\\n fmt_append((type, new, int(wid), delim, com))\\n \\n return fmt_info\",\n \"def input_parser(input_string: str) -> str: \\n if is_int(input_string):\\n return input_string\\n #he is int, give back plz.\\n else:\\n try:\\n modified_input: str = input_string.strip()\\n\\n evaluatable_pairs: str = regex_splitter(modified_input)\\n\\n while not (is_int(evaluatable_pairs)):\\n evaluatable_pairs = regex_splitter(evaluatable_pairs)\\n\\n return (evaluatable_pairs)\\n\\n except:\\n raise Exception(\\\"Invalid Input\\\")\",\n \"def parse_pattern(pattern: NumberPattern | str) -> NumberPattern:\\n if isinstance(pattern, NumberPattern):\\n return pattern\\n\\n def _match_number(pattern):\\n rv = number_re.search(pattern)\\n if rv is None:\\n raise ValueError(f\\\"Invalid number pattern {pattern!r}\\\")\\n return rv.groups()\\n\\n pos_pattern = pattern\\n\\n # Do we have a negative subpattern?\\n if ';' in pattern:\\n pos_pattern, neg_pattern = pattern.split(';', 1)\\n pos_prefix, number, pos_suffix = _match_number(pos_pattern)\\n neg_prefix, _, neg_suffix = _match_number(neg_pattern)\\n else:\\n pos_prefix, number, pos_suffix = _match_number(pos_pattern)\\n neg_prefix = f\\\"-{pos_prefix}\\\"\\n neg_suffix = pos_suffix\\n if 'E' in number:\\n number, exp = number.split('E', 1)\\n else:\\n exp = None\\n if '@' in number and '.' in number and '0' in number:\\n raise ValueError('Significant digit patterns can not contain \\\"@\\\" or \\\"0\\\"')\\n if '.' in number:\\n integer, fraction = number.rsplit('.', 1)\\n else:\\n integer = number\\n fraction = ''\\n\\n def parse_precision(p):\\n \\\"\\\"\\\"Calculate the min and max allowed digits\\\"\\\"\\\"\\n min = max = 0\\n for c in p:\\n if c in '@0':\\n min += 1\\n max += 1\\n elif c == '#':\\n max += 1\\n elif c == ',':\\n continue\\n else:\\n break\\n return min, max\\n\\n int_prec = parse_precision(integer)\\n frac_prec = parse_precision(fraction)\\n if exp:\\n exp_plus = exp.startswith('+')\\n exp = exp.lstrip('+')\\n exp_prec = parse_precision(exp)\\n else:\\n exp_plus = None\\n exp_prec = None\\n grouping = parse_grouping(integer)\\n return NumberPattern(pattern, (pos_prefix, neg_prefix),\\n (pos_suffix, neg_suffix), grouping,\\n int_prec, frac_prec,\\n exp_prec, exp_plus, number)\",\n \"def getAllPlaceholders(self, template_list):\\n placeholders = []\\n for line in template_list:\\n found = re.findall(self.pattern, line)\\n placeholders.extend(found)\\n placeholders.reverse()\\n #place the cursor placeholder at the begin\\n placeholders = self._placeCursors(placeholders)\\n return placeholders\",\n \"def parse_styles(text: str) -> List[dict]:\\n styles = []\\n regex = r'(\\\\d{3})=(\\\".*?\\\"),(\\\\d+\\\\.?\\\\d+),(\\\\(.*?\\\\))'\\n\\n for line in text.split(\\\"\\\\r\\\\n\\\"):\\n if line == \\\"\\\":\\n continue\\n\\n n, font, font_size, color = re.match(regex, line).groups()\\n styles.append(\\n {\\n \\\"id\\\": int(n),\\n \\\"f\\\": font.replace('\\\"', \\\"\\\"),\\n \\\"fs\\\": float(font_size),\\n \\\"rgb\\\": [\\n int(i)\\n for i in color.replace(\\\"(\\\", \\\"\\\")\\n .replace(\\\")\\\", \\\"\\\").split(\\\",\\\")]\\n }\\n )\\n\\n return styles\",\n \"def parse_isdcf_string(str):\\n fields_dict = {}\\n error_list = []\\n\\n if not isinstance(str, six.string_types):\\n error_list.append(\\\"ContentTitle invalid type\\\")\\n return fields_dict, error_list\\n\\n # Sort the fields to respect DCNC order\\n # Note : in python3 we can declare an OrderedDict({...}) and the field\\n # order is preserved so this is not needed, but not in python 2.7\\n dcnc_version = DCP_SETTINGS['naming_convention']\\n rules = OrderedDict(sorted(\\n six.iteritems(RULES[dcnc_version]),\\n key=lambda f: RULES_ORDER.index(f[0])))\\n\\n fields_dict = init_dict_isdcf(rules)\\n fields_list = str.split('_')\\n\\n if len(fields_list) != 12:\\n error_list.append(\\n \\\"ContentTitle should have 12 parts to be fully compliant with\\\"\\n \\\" ISDCF naming convention version {}, {} part(s) found\\\"\\n .format(dcnc_version, len(fields_list)))\\n\\n # Parsing title with some robustness to missing / additionals fields\\n # Find a match in nearby fields only\\n max_field_shift = 3\\n\\n fields_matched = []\\n\\n for idx_field, field in enumerate(fields_list):\\n matched = False\\n\\n for idx_rule, (name, regex) in enumerate(six.iteritems(rules)):\\n pattern = re.compile(regex)\\n match = re.match(pattern, field)\\n\\n if idx_field == 0 and not match:\\n error_list.append(\\n \\\"ContentTitle Film Name does not respect naming convention\\\"\\n \\\" rules : {}\\\".format(field))\\n elif match and idx_rule < max_field_shift:\\n fields_dict[name].update(match.groupdict(DEFAULT))\\n else:\\n continue\\n\\n fields_dict[name]['Value'] = field\\n fields_matched.append(name)\\n sliced = islice(six.iteritems(rules), idx_rule + 1, None)\\n rules = OrderedDict(sliced)\\n matched = True\\n break\\n\\n if not matched:\\n error_list.append(\\n \\\"ContentTitle Part {} not matching any naming convention field\\\"\\n .format(field))\\n\\n for name, _ in six.iteritems(RULES[dcnc_version]):\\n if name not in fields_matched:\\n error_list.append(\\n \\\"Field {} not found in ContentTitle\\\".format(name))\\n\\n fields_dict = post_parse_isdcf(fields_dict)\\n return fields_dict, error_list\",\n \"def extract(self, optimized_str):\\n\\n logger.debug('START optimized_str ========================')\\n logger.debug(optimized_str)\\n logger.debug('END optimized_str ==========================')\\n logger.debug(\\n 'Date parsing: languages=%s date_formats=%s',\\n self.options['languages'], self.options['date_formats'])\\n logger.debug('Float parsing: decimal separator=%s', self.options['decimal_separator'])\\n logger.debug(\\\"keywords=%s\\\", self['keywords'])\\n logger.debug(self.options)\\n\\n # Try to find data for each field.\\n output = {}\\n for k, v in self['fields'].items():\\n if k.startswith('static_'):\\n logger.debug(\\\"field=%s | static value=%s\\\", k, v)\\n output[k.replace('static_', '')] = v\\n else:\\n logger.debug(\\\"field=%s | regexp=%s\\\", k, v)\\n\\n # Fields can have multiple expressions\\n if type(v) is list:\\n for v_option in v:\\n res_find = re.findall(v_option, optimized_str)\\n if res_find:\\n break\\n else:\\n res_find = re.findall(v, optimized_str)\\n if res_find:\\n logger.debug(\\\"res_find=%s\\\", res_find)\\n if k.startswith('date'):\\n raw_date = res_find[0]\\n output[k] = dateparser.parse(\\n raw_date, date_formats=self.options['date_formats'],\\n languages=self.options['languages'])\\n logger.debug(\\\"result of date parsing=%s\\\", output[k])\\n if not output[k]:\\n logger.error(\\n \\\"Date parsing failed on date '%s'\\\", raw_date)\\n return None\\n elif k.startswith('amount'):\\n assert res_find[0].count(self.options['decimal_separator']) < 2,\\\\\\n 'Decimal separator cannot be present several times'\\n # replace decimal separator by a |\\n amount_pipe = res_find[0].replace(self.options['decimal_separator'], '|')\\n # remove all possible thousands separators\\n amount_pipe_no_thousand_sep = re.sub(\\n '[.,\\\\s]', '', amount_pipe)\\n # put dot as decimal sep\\n amount_regular = amount_pipe_no_thousand_sep.replace('|', '.')\\n # it is now safe to convert to float\\n output[k] = float(amount_regular)\\n else:\\n output[k] = res_find[0]\\n else:\\n logger.warning(\\\"regexp for field %s didn't match\\\", k)\\n\\n output['currency'] = self.options['currency']\\n\\n if len(output.keys()) >= 4:\\n output['desc'] = 'Invoice %s from %s' % (\\n output['invoice_number'], self['issuer'])\\n logger.debug(output)\\n return output\\n else:\\n logger.error(output)\\n return None\",\n \"def select_stylestrs(cfgstr):\\n stylestrs = []\\n for s in cfgstr.split():\\n if s in vars(fmt):\\n stylestrs.append(s)\\n return stylestrs\",\n \"def format_data(data_string):\\n lines = data_string.split('\\\\\\\"\\\\n\\\\\\\"')\\n split_data = [re.split(r\\\"\\\\\\\"\\\\s*,\\\\s*\\\\\\\"\\\", line) for line in lines]\\n\\n return split_data\",\n \"def load(fmt: str, stream: BytesIO, _unpack=unpack):\\n values = []\\n bitcount = bits = 0\\n for char in fmt:\\n if char == '?':\\n if not bitcount:\\n bits = _unpack('>B', _read(stream, 1))[0]\\n bitcount = 8\\n value = (bits & 1) == 1\\n bits >>= 1\\n bitcount -= 1\\n else:\\n bitcount = bits = 0\\n if char == 'B':\\n value = _unpack('>B', _read(stream, 1))[0]\\n elif char == 'H':\\n value = _unpack('>H', _read(stream, 2))[0]\\n elif char == 'L':\\n value = _unpack('>L', _read(stream, 4))[0]\\n elif char == 'Q':\\n value = _unpack('>Q', _read(stream, 8))[0]\\n elif char == 's':\\n length = _unpack('>B', _read(stream, 1))[0]\\n value = _unpack('>%ss' % length, _read(stream, length))[0]\\n value = value.decode('utf-8', 'surrogatepass')\\n elif char == 'S':\\n length = _unpack('>L', _read(stream, 4))[0]\\n value = _unpack('>%ss' % length, _read(stream, length))[0]\\n value = value.decode('utf-8', 'surrogatepass')\\n elif char == 't':\\n timestamp = _unpack('>Q', _read(stream, 8))[0]\\n value = datetime.utcfromtimestamp(timestamp)\\n elif char == 'T':\\n value = {}\\n length = _unpack('>L', _read(stream, 4))[0]\\n stream2 = BytesIO(_read(stream, length))\\n while stream2.tell() < length:\\n key = load('s', stream2)[0]\\n value[key] = _load_item(stream2)\\n elif char != '?':\\n raise ValueError('wrong format char', char)\\n values.append(value)\\n return values\",\n \"def get_parameter(pstring):\\n parameters = pstring.replace(',', ' ').split()\\n if len(parameters) == 1:\\n init_value = float(parameters[0])\\n return (init_value, None, None)\\n elif len(parameters) == 3:\\n init_value = float(parameters[0])\\n if parameters[1].upper() == 'NONE':\\n lower_value = None\\n else:\\n lower_value = float(parameters[1])\\n if parameters[2].upper() == 'NONE':\\n upper_value = None\\n else:\\n upper_value = float(parameters[2])\\n return (init_value, lower_value, upper_value)\\n else:\\n raise ValueError('Invalid parameter format: %s' % pstring)\",\n \"def parse_known_date_formats(dt_string):\\n for fmt in ('%Y%m%d', '%Y%m%d %H:%M', '%m/%d/%Y', '%m/%d/%Y %H:%M'):\\n try:\\n return datetime.strptime(dt_string, fmt)\\n except ValueError:\\n pass\\n raise ValueError(\\\"No valid date format found.\\\"\\n \\\"See https://tidesandcurrents.noaa.gov/api/ \\\"\\n \\\"for list of accepted date formats.\\\")\",\n \"def parseStructuredData( raw_data, format ):\\n\\tparsed_data = {}\\n\\n\\tBEGIN = 0\\n\\tEND = 1\\n\\tCONV = 2\\n\\n\\tfor key in format.keys():\\n\\t\\tkey_format = format[key]\\n\\n\\t\\tif key_format[END] == \\\"\\\":\\n\\t\\t\\tkey_format[END] = key_format[BEGIN] + len(raw_data)\\n\\n\\t\\ttxt = raw_data[key_format[BEGIN]:key_format[END]]\\n\\n\\t\\tif len(key_format[CONV]) > 0:\\n\\t\\t\\tparsed_data[key] = struct.unpack(key_format[CONV], txt)[0]\\n\\t\\telse:\\n\\t\\t\\tparsed_data[key] = txt\\n\\n\\treturn parsed_data\",\n \"def get_color_names(self, format_string):\\n names = set()\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"command\\\"):\\n name = dict(parse_qsl(token.group(\\\"command\\\"))).get(\\\"color\\\")\\n if (\\n not name\\n or name in COLOR_NAMES_EXCLUDED\\n or name in COLOR_NAMES\\n or name[0] == \\\"#\\\"\\n ):\\n continue\\n names.add(name)\\n return names\",\n \"def _validate_pattern_fields(self):\\n # TO ADD:\\n ## check pattern is dict ??\\n ## A1 ! check if all vars used in sprintf are declared\\n ## check for quoted '%s' in sprintf text (not allowed).\\n ## check that only all subs are %s and that the number of %s matches the length of the var list.\\n ## re.search(r\\\"\\\\%(.)\\\", , ) => from this get list to check all %s and length to check against var list.\\n ## Given these checks - makes more sense to hardwire sprintf subfield names than use config approach.\\n \\n for field, field_content in self.pattern.items():\\n if field not in self.pkey_dict:\\n warnings.warn(\\\"Pattern has unknown field: %s !\\\" % field)\\n \\n # The following is quote ugly and hard to follow. Should probably be refactored\\n oneOf = False\\n oneOf_list = []\\n for field, field_spec in self.pkey_dict.items():\\n if field_spec['compulsory']:\\n if field not in self.pattern:\\n warnings.warn(\\\"Pattern is missing compulsory field: %s !\\\" % field)\\n elif field_spec['OneOf']:\\n oneOf_list.append(field)\\n if field in self.pattern:\\n oneOf = True \\n if field_spec['sprintf']:\\n if field in self.pattern:\\n for subfield in self.pattern[field]:\\n if subfield not in self.sprintf_keys:\\n warnings.warn(\\\"The field %s has an unknown subfield %s.\\\" % (field, subfield))\\n for subfield in self.sprintf_keys:\\n if subfield not in self.pattern[field]:\\n warnings.warn(\\\"The field %s lacks the compulsory subfield %s.\\\" % (field, subfield))\\n # Check that number of vars matches number %s in text field\\n if not len(re.findall('%s', self.pattern[field]['text'])) == len(self.pattern[field]['vars']):\\n warnings.warn(\\\"Wrong number of vars in field '%s' of %s\\\" % (field, self.pattern['pattern_name']))\\n for v in self.pattern[field]['vars']:\\n if v not in self.pattern['vars']:\\n warnings.warn(\\\"%s not in varlist %s\\\" % (v, str(self.pattern['vars'])))\\n# Move spec checks down: \\n# if field_spec['msExpression']:\\n# self._validate_quoted(field['text'])\\n# self._validate_ms\\n \\n if not oneOf:\\n warnings.warn(\\\"Pattern must have at least one of: \\\" + str(oneOf_list))\\n\\n # Poss to add: validate number of vars for sprintf subs\",\n \"def init_from_net(self, inputstr):\\n offset = 0\\n input_len = len(inputstr)\\n used_len = 0\\n\\n try:\\n (used_len, self.bpq_kind, self.matching_rule,\\n self.creation_ts, self.creation_seq,\\n self.src_eid_len) = unpack_from(\\\"!BBvvv\\\", inputstr,\\n offset = offset)\\n offset = used_len\\n if ((offset + self.src_eid_len) > input_len):\\n raise struct_error(\\\"Input string too short at src_eid\\\")\\n\\n self.src_eid = inputstr[offset : (offset + self.src_eid_len)]\\n\\n offset += self.src_eid_len\\n (used_len, self.bpq_id_len) = unpack_from(\\\"!v\\\", inputstr,\\n offset = offset)\\n offset += used_len\\n if ((offset + self.bpq_id_len) > input_len):\\n raise struct_error(\\\"Input string too short at bpq_id\\\")\\n\\n self.bpq_id = inputstr[offset : (offset + self.bpq_id_len)]\\n\\n offset += self.bpq_id_len\\n (used_len, self.bpq_val_len) = unpack_from(\\\"!v\\\", inputstr,\\n offset = offset)\\n \\n offset += used_len\\n if ((offset + self.bpq_val_len) > input_len):\\n raise struct_error(\\\"Input string too short at bpq_val\\\")\\n\\n self.bpq_val = inputstr[offset : (offset + self.bpq_val_len)]\\n\\n offset += self.bpq_val_len\\n (used_len, self.frag_cnt) = unpack_from(\\\"!v\\\", inputstr,\\n offset = offset)\\n offset += used_len\\n\\n self.frag_desc = []\\n\\n if self.frag_cnt > 0:\\n fmt_str = \\\"!\\\" + (\\\"vv\\\" * self.frag_cnt)\\n frag_tuple = unpack_from(fmt_str, inputstr, offset = offset)\\n offset += frag_tuple[0]\\n i = 0\\n j = 1\\n while (i < self.frag_cnt):\\n d = {}\\n d[\\\"frag_offset\\\"] = frag_tuple[j]\\n j += 1\\n d[\\\"frag_len\\\"] = frag_tuple[j]\\n j += 1\\n self.frag_desc.append(d)\\n i += 1\\n if (offset != input_len):\\n raise struct_error(\\\"Input string is wrong length\\\")\\n except Exception, e:\\n return False\\n\\n return self.validate()\",\n \"def placeholder_to_regex(placeholder,encloser='%',matcher='(.+)'):\\n pattern = placeholder\\n pattern = pattern.replace('\\\\\\\\','/')\\n if pattern.count('%') == 0 or pattern.count('%') % 2 != 0:\\n return '',[]\\n else:\\n borders = pattern.split(encloser)[::2]\\n fields = pattern.split(encloser)[1::2]\\n for field in fields:\\n pattern = pattern.replace(encloser+field+encloser, matcher, 1)\\n pattern = pattern.replace('/','\\\\\\\\/')\\n return pattern,fields\",\n \"def parse_template(self):\\n for line in self.raw_template.split(\\\"\\\\n\\\"):\\n line = line.strip()\\n if line.startswith('#m3'):\\n key, val = line[3:].strip().split('=', 1)\\n key = key.strip()\\n val = val.strip()\\n self.variables[key] = val\\n\\n for fitem in self.finditem.finditer(self.raw_template):\\n fgrp = fitem.groups()\\n categ = fgrp[0]\\n name = fgrp[1]\\n rest_str = fgrp[2]\\n rest = {} # type: dict\\n for item in rest_str.split('|'):\\n item = item.strip()\\n if item:\\n key, val = item.split('=')\\n rest[key] = val\\n\\n self.data[name] = (categ, rest)\",\n \"def reformat_placeholders(content: str) -> str:\\n return content.replace(\\\"<MM>\\\", \\\"[[\\\").replace(\\\"</MM>\\\", \\\"]]\\\")\",\n \"def _decode_block_string(self, block_string: str):\\n\\n arg_strings = block_string.split('_')\\n args = {}\\n for arg_string in arg_strings:\\n splits = re.split(r'(\\\\d.*)', arg_string)\\n if len(splits) >= 2:\\n key, value = splits[:2]\\n args[key] = value\\n num_repeat = int(args['r'])\\n block_args = {\\n 'kernel_size': int(args['k']),\\n 'stride': int(args['s']),\\n 'expand_ratio': int(args['e']),\\n 'in_channels': int(args['i']),\\n 'out_channels': int(args['o']),\\n 'se_ratio': float(args['se']) if 'se' in args else None,\\n }\\n return block_args, num_repeat\",\n \"def _check_tokens_are_valid(format_string, message):\\n named_tokens = re.findall(r\\\"{(\\\\w*)}\\\", format_string)\\n invalid_tokens = [x for x in named_tokens if x.lower() not in _valid_tokens]\\n if invalid_tokens:\\n msg = message\\n msg += \\\" [{0}]. \\\".format(\\\", \\\".join(invalid_tokens))\\n msg += 'Did you check your \\\"modules.yaml\\\" configuration?'\\n raise RuntimeError(msg)\",\n \"def parse_pattern_str(pattern: str, parent_layer: nn.Layer) -> Union[None, List[Dict[str, Union[nn.Layer, str, None]]]]:\\n\\n pattern_list = pattern.split(\\\".\\\")\\n if not pattern_list:\\n msg = f\\\"The pattern('{pattern}') is illegal. Please check and retry.\\\"\\n return None\\n\\n layer_list = []\\n while len(pattern_list) > 0:\\n if '[' in pattern_list[0]:\\n target_layer_name = pattern_list[0].split('[')[0]\\n target_layer_index = pattern_list[0].split('[')[1].split(']')[0]\\n else:\\n target_layer_name = pattern_list[0]\\n target_layer_index = None\\n\\n target_layer = getattr(parent_layer, target_layer_name, None)\\n\\n if target_layer is None:\\n msg = f\\\"Not found layer named('{target_layer_name}') specifed in pattern('{pattern}').\\\"\\n return None\\n\\n if target_layer_index and target_layer:\\n if int(target_layer_index) < 0 or int(target_layer_index) >= len(target_layer):\\n msg = f\\\"Not found layer by index('{target_layer_index}') specifed in pattern('{pattern}'). The index should < {len(target_layer)} and > 0.\\\"\\n return None\\n\\n target_layer = target_layer[target_layer_index]\\n\\n layer_list.append({\\\"layer\\\": target_layer, \\\"name\\\": target_layer_name, \\\"index\\\": target_layer_index})\\n\\n pattern_list = pattern_list[1:]\\n parent_layer = target_layer\\n return layer_list\",\n \"def parseConfig(f):\\n config = {\\\"formats\\\":{}}\\n \\n for line in f:\\n if line.startswith(\\\"//\\\"): \\n continue\\n \\n sline = re.split(\\\"[=\\\\s]\\\", line)\\n if sline[0] is \\\"\\\":\\n continue\\n \\n if sline[0]==\\\"format\\\":\\n #Puts the format as a key in the dict pointed to by \\\"formats\\\"\\n config[\\\"formats\\\"][sline[1]] = sline[3] \\n else:\\n config[sline[0]] = sline[1]\\n \\n return config\",\n \"def format(self, varnames, fmts):\\n varnames = self._find_vars(varnames, empty_ok=False)\\n indexes = list(map(self._varlist.index, varnames))\\n \\n # check that fmts are specified properly\\n if isinstance(fmts, str):\\n fmts = fmts.split()\\n else:\\n if ( not isinstance(fmts, collections.Iterable) \\n or not all(isinstance(f, str) for f in fmts) ):\\n raise TypeError(\\\"given fmts must be str or iterable of str\\\")\\n fmts = [x for s in fmts for x in s.split()]\\n if len(fmts) == 0:\\n raise ValueError(\\\"no formats specified\\\")\\n \\n # check fmts for validity\\n is_valid = self._is_valid_fmt\\n if not all(is_valid(fmt) for fmt in fmts):\\n bad_fmts = \\\" \\\".join(fmt for fmt in fmts if not is_valid(fmt))\\n raise ValueError(\\\"invalid formats: \\\" + bad_fmts)\\n \\n # pad fmts if necessary \\n nvarnames = len(varnames)\\n nfmts = len(fmts)\\n if nfmts < nvarnames:\\n fmts = list(fmts) + [fmts[-1]]*(nvarnames - nfmts)\\n \\n # check that formats match Stata types\\n #typlist = self._typlist\\n isstrvar = self._isstrvar\\n if not all(isstrvar(i) == bool(STR_FMT_RE.match(fmt))\\n for i, fmt in zip(indexes, fmts)):\\n raise ValueError(\\\"format does not match Stata variable type\\\")\\n \\n # replace fmts (extras, if any, don't get used)\\n for i, fmt in zip(indexes, fmts):\\n self._fmtlist[i] = fmt\\n \\n # assume there are changes\\n self._changed = True\",\n \"def initFormat(self):\\n self.formatList = []\",\n \"def _search_and_replace(parser, section):\\n INTERPOLATION_RE = re.compile(r\\\"\\\\$\\\\{(?:(?P<section>[^:]+):)?(?P<key>[^}]+)\\\\}\\\")\\n result = []\\n def interpolate_func(match):\\n d = match.groupdict()\\n s = d.get('section')\\n if s is None:\\n s = section\\n key = d.get('key')\\n return parser.get(s, key)\\n\\n for key, value in parser.items(section):\\n value = re.sub(INTERPOLATION_RE, interpolate_func, value)\\n result.append(\\n (key,value)\\n )\\n return result\",\n \"def parse_string(self, in_str):\\n match = MAIN_REGEX.search(in_str)\\n if not match:\\n err_str = \\\"Unable to parse string: %s\\\" % in_str\\n raise ValueError(err_str)\\n self.parse_completed(match.group(1))\\n self.parse_priority(match.group(2))\\n if match.group(3) and match.group(4):\\n self.parse_completion_date(match.group(3))\\n self.parse_creation_date(match.group(4))\\n else:\\n self.parse_creation_date(match.group(3))\\n self.parse_description(match.group(5))\",\n \"def format(self):\\n groups = [g + \\\".\\\" for g in self.groups]\\n params = [\\\";\\\" + p.format() for p in self.params]\\n groups_name_params = \\\"\\\".join(groups) + self.name + \\\"\\\".join(params)\\n return groups_name_params + \\\":\\\" + self.format_value() + CRLF\",\n \"def func2(string:str):\\n with open(string,\\\"r\\\") as file:\\n data = file.read()\\n data = data.split(\\\"bandwidths [1]:\\\")[0]\\n\\n final = {}\\n for i in range(1,3):\\n final[\\\"formants [{}]\\\".format(i)] = []\\n my_list = data.split(\\\"formants\\\")\\n for i in range(2,4):\\n final[\\\"formants [{}]\\\".format(i-1)].extend(list(map(pars_points,my_list[i].split(\\\"points \\\")[1:])))\\n return final\",\n \"def fmt_capture(kwargs: Any, *patterns: Any) -> Any: # type: ignore\\n results = [copy_annotations(pattern, _fmt_capture(kwargs, pattern)) for pattern in each_string(*patterns)]\\n if len(patterns) == 1 and isinstance(patterns[0], str):\\n assert len(results) == 1\\n return results[0]\\n return results\",\n \"def formatter(text):\\n repl_map = {\\n \\\"degC\\\": \\\"$^o$C\\\",\\n \\\"K\\\": \\\"$^o$C\\\",\\n \\\"month-1\\\": \\\"month$^{{-1}}$\\\",\\n \\\"day-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"d-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"decade-1\\\": \\\"decade$^{{-1}}$\\\",\\n \\\"year-1\\\": \\\"year$^{{-1}}$\\\",\\n \\\"rcp85\\\": \\\"RCP8.5\\\",\\n \\\"rcp45\\\": \\\"RCP4.5\\\",\\n \\\"rcp26\\\": \\\"RCP2.6\\\",\\n \\\"RCP85\\\": \\\"RCP8.5\\\",\\n \\\"RCP45\\\": \\\"RCP4.5\\\",\\n \\\"RCP26\\\": \\\"RCP2.6\\\",\\n \\\"cmip5-85\\\": \\\"RCP8.5\\\",\\n \\\"cmip5-60\\\": \\\"RCP6.0\\\",\\n \\\"cmip5-45\\\": \\\"RCP4.5\\\",\\n \\\"cmip5-26\\\": \\\"RCP2.6\\\",\\n \\\"ssp585\\\": \\\"SSP5-8.5\\\",\\n \\\"ssp245\\\": \\\"SSP2-4.5\\\",\\n \\\"ssp126\\\": \\\"SSP1-2.6\\\",\\n \\\"SSP585\\\": \\\"SSP5-8.5\\\",\\n \\\"SSP245\\\": \\\"SSP2-4.5\\\",\\n \\\"SSP126\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-85\\\": \\\"SSP5-8.5\\\",\\n \\\"cmip6-70\\\": \\\"SSP3-7.0\\\",\\n \\\"cmip6-60\\\": \\\"SSP4-6.0\\\",\\n \\\"cmip6-34\\\": \\\"SSP4-3.4\\\",\\n \\\"cmip6-45\\\": \\\"SSP2-4.5\\\",\\n \\\"cmip6-26\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-19\\\": \\\"SSP1-1.9\\\",\\n \\\"1\\\": \\\"%\\\",\\n \\\"era5\\\": \\\"ERA5\\\",\\n \\\"gpcc025x025_v8\\\": \\\"GPCC\\\",\\n \\\"cru\\\": \\\"CRU\\\",\\n \\\"jra55\\\": \\\"JRA55\\\",\\n \\\"HIGHRESMIP\\\": \\\"HighResMIP\\\",\\n \\\" \\\": \\\"\\\",\\n }\\n for key, val in repl_map.items():\\n if key in text:\\n text = text.replace(key, val)\\n break\\n return text\",\n \"def findall(pattern, text):\\r\\n\\tspl = re.compile(pattern).split(text)\\r\\n\\tresult = []\\r\\n\\tbeginTag = \\\"\\\"\\r\\n\\tendTag = None\\r\\n\\tbeginFormat = \\\"\\\"\\r\\n\\tendFormat = \\\"\\\"\\r\\n\\tinitText = text\\r\\n\\tfor s in spl:\\r\\n\\t\\ttext = text[len(s)+2:]\\r\\n\\t\\tend = text.find(\\\")s\\\")\\r\\n\\t\\tvar = \\\"\\\"\\r\\n\\t\\tif len(text) > 0:\\r\\n\\t\\t\\tvar = text[:end]\\r\\n\\t\\t\\tresult.append(var)\\r\\n\\t\\tif var == \\\"content\\\":\\r\\n\\t\\t\\tbeginTag += s\\r\\n\\t\\t\\tendTag = \\\"\\\"\\r\\n\\t\\telif endTag != None:\\r\\n\\t\\t\\tendTag += s\\r\\n\\t\\t\\tif var != \\\"\\\":\\r\\n\\t\\t\\t\\tif var in [\\\"disabled\\\",\\\"checked\\\",\\\"active\\\",\\\"selected\\\"]:\\r\\n\\t\\t\\t\\t\\tendFormat += \\\" b'%s' if self.%s else b'',\\\"%(var, var)\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\tendFormat += \\\"self.%s,\\\"%var\\r\\n\\t\\t\\t\\tendTag += \\\"\\\\x25s\\\"\\r\\n\\t\\telse:\\r\\n\\t\\t\\tbeginTag += s\\r\\n\\t\\t\\tif var != \\\"\\\":\\r\\n\\t\\t\\t\\tif var in [\\\"disabled\\\",\\\"checked\\\",\\\"active\\\",\\\"selected\\\"]:\\r\\n\\t\\t\\t\\t\\tbeginFormat += \\\" b'%s' if self.%s else b'',\\\"%(var, var)\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\tbeginFormat += \\\"self.%s,\\\"%var\\r\\n\\t\\t\\t\\tbeginTag += \\\"\\\\x25s\\\"\\r\\n\\t\\ttext = text[end+2:]\\r\\n\\tif endTag == None:\\r\\n\\t\\tendTag = \\\"\\\"\\r\\n\\t\\tendFormat = \\\"\\\"\\r\\n\\treturn result, beginTag, endTag, beginFormat, endFormat\",\n \"def get_source_file_string_placeholders(file):\\n placeholders = {}\\n root = ET.parse(file).getroot()\\n for element in root.findall('string'):\\n name = element.get('name')\\n value = ''.join(element.itertext())\\n placeholder = get_placeholders(value)\\n if placeholder:\\n placeholders[name] = placeholder\\n return placeholders\",\n \"def parse_variables(self, text, separator=None):\\n\\n def splitter(x, separator=None):\\n if len(x) > 1:\\n y = x.split(separator)\\n return (y[0], y[-1])\\n return (None, None)\\n\\n return dict(splitter(x, separator=separator) for x in text.split(\\\"\\\\n\\\"))\",\n \"def from_string(cls, string):\\n m = re.match(r\\\"([0-9- :]+)\\\" # Timestamp (group 1)\\n r\\\",[0-9]+\\\\s\\\" # Timestamp ms (ignored)\\n r\\\"([A-Z]+)\\\\s+\\\" # Debug level (group 2)\\n r\\\"(\\\\d+)\\\\s+\\\" # PID (group 3)\\n r\\\"\\\\[\\\"\\n r\\\"([^]]+)\\\\s*\\\" # Module name (group 4)\\n r\\\"\\\\]:\\\\s+\\\"\\n r\\\"(.*)\\\", # Debug message (group 5)\\n string)\\n if not m:\\n raise DebugFormatError(\\n \\\"Failed to match {} against the expected format\\\".format(\\n string))\\n ts = datetime.datetime.strptime(m.group(1), TS_FORMAT)\\n return DebugStmt(ts, m.group(2), int(m.group(3)),\\n m.group(4).strip(),\\n m.group(5))\",\n \"def parse_spans(span_string):\\n spans = []\\n for span in span_string.split(';'):\\n start, end = span.split(' ')\\n spans.append((int(start), int(end)))\\n return spans\",\n \"def parse_spans(span_string):\\n spans = []\\n for span in span_string.split(';'):\\n start, end = span.split(' ')\\n spans.append((int(start), int(end)))\\n return spans\",\n \"def get_parameters_from_input_string(string):\\n parameter_array = []\\n start_found = False\\n item = str(\\\"\\\")\\n for i in range(len(string)): \\n if start_found == True and string[i] != \\\",\\\" and string[i] !=\\\")\\\":\\n item += string[i]\\n elif start_found == True and string[i] == \\\",\\\":\\n if item not in parameter_array:\\n parameter_array.append(item)\\n item = str(\\\"\\\")\\n elif start_found == True and string[i] == \\\")\\\":\\n start_found = False\\n if item not in parameter_array:\\n parameter_array.append(item)\\n item = str(\\\"\\\")\\n # Start here and set start_found to True\\n elif string[i] == \\\"(\\\":\\n start_found = True\\n return parameter_array\",\n \"def check_placeholders(value):\\n if isinstance(value, six.string_types):\\n if TOKEN_REGEX.search(value):\\n raise ValueError('{0:s} must be replaced in dictionary'.format(value))\\n elif isinstance(value, list):\\n return [check_placeholders(item) for item in value]\\n elif isinstance(value, dict):\\n return {key: check_placeholders(val) for key, val in value.items()}\\n elif isinstance(value, tuple):\\n return tuple(check_placeholders(val) for val in value)\\n return value\",\n \"def populate_fields(self):\\n self.group_name = self._extract_group_name()\\n self.services = self._extract_services()\\n\\n self._logger.debug(\\\"Parsed value: {}\\\".format([\\n self.group_name,\\n self.services]))\",\n \"def _parameterize_string(raw):\\n\\n parts = []\\n s_index = 0\\n\\n for match in _PARAMETER_PATTERN.finditer(raw):\\n parts.append(raw[s_index:match.start()])\\n parts.append({u\\\"Ref\\\": match.group(1)})\\n s_index = match.end()\\n\\n if not parts:\\n return GenericHelperFn(raw)\\n\\n parts.append(raw[s_index:])\\n return GenericHelperFn({u\\\"Fn::Join\\\": [u\\\"\\\", parts]})\",\n \"def field_values(s):\\n if s: \\n for f in s.split(','):\\n if f.find('=') > 0:\\n (field, value) = f.split('=')\\n else:\\n field = f\\n value = None\\n yield (field, value)\",\n \"def get_formatted_string(self, input_string):\\n if isinstance(input_string, str):\\n try:\\n return self.get_processed_string(input_string)\\n except KeyError as err:\\n # Wrapping the KeyError into a less cryptic error for end-user\\n # friendliness\\n missing_key = err.args[0]\\n raise KeyNotInContextError(\\n f'Unable to format \\\\'{input_string}\\\\' with '\\n f'{{{missing_key}}}, because '\\n f'context[\\\\'{missing_key}\\\\'] doesn\\\\'t exist') from err\\n else:\\n raise TypeError(f\\\"can only format on strings. {input_string} is a \\\"\\n f\\\"{type(input_string)} instead.\\\")\",\n \"def _parse_format(mode=2, rc_kw=None, **kwargs):\\n kw = {}\\n rc_kw = rc_kw or {}\\n for key, value in kwargs.items():\\n key_fixed = _rc_nodots.get(key, None)\\n if key_fixed is None:\\n kw[key] = value\\n else:\\n rc_kw[key_fixed] = value\\n return rc_kw, mode, kw\",\n \"def get_params(string_in, separator=' ', defaultmissing='-', params_to_get=3):\\r\\n rtr = str(string_in).split(separator)\\r\\n if len(rtr) > params_to_get:\\r\\n rtr = []\\r\\n rtr.append(str(string_in))\\r\\n for x in range(0, (params_to_get - len(rtr))):\\r\\n rtr.append(defaultmissing)\\r\\n return rtr[0],rtr[1],rtr[2]\",\n \"def readOpt(self, String0):\\n Name = re.match(r\\\"NAME : (.*)\\\", String0)[1]\\n COMMENT = re.search(r\\\"COMMENT : (.*)\\\", String0)[1]\\n TYPE = re.search(r\\\"TYPE : (.*)\\\", String0)[1]\\n DIMENSION = re.search(r\\\"DIMENSION : (.*)\\\", String0)[1]\\n split = String0.split(\\\"\\\\n\\\")\\n Tour = []\\n for s0 in split:\\n if (s0 and s0[0] <= '9' and s0[0] >= '0'):\\n Tour.append(int(s0))\\n return Name, COMMENT, TYPE, DIMENSION, Tour\",\n \"async def parse(self, raw: str) -> dict:\",\n \"def _build_parsed_values(self):\\n match = SAMPLE_REGEX.match(self.raw_data)\\n \\n if not match:\\n raise SampleException(\\\"No regex match of parsed sample data: [%s]\\\" %\\n self.decoded_raw)\\n \\n log.trace(\\\"Matching sample [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s], [%s]\\\",\\n match.group(1),match.group(2),match.group(3),match.group(4),match.group(5),\\n match.group(6),match.group(7),match.group(8),match.group(9),match.group(10),\\n match.group(11),match.group(12))\\n res_5 = float(match.group(1))\\n res_x1 = float(match.group(2))\\n res_x5 = float(match.group(3))\\n h_5 = float(match.group(4))\\n h_x1 = float(match.group(5))\\n h_x5 = float(match.group(6))\\n eh = float(match.group(7))\\n ref_temp_v = float(match.group(8))\\n ref_temp_c = float(match.group(9))\\n res_temp_v = float(match.group(10))\\n res_temp_c = float(match.group(11))\\n batt_v = float(match.group(12))\\n \\n \\n result = [{DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_5,\\n DataParticleKey.VALUE: res_5},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_X1,\\n DataParticleKey.VALUE: res_x1},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_X5,\\n DataParticleKey.VALUE: res_x5},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.HYDROGEN_5,\\n DataParticleKey.VALUE: h_5},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.HYDROGEN_X1,\\n DataParticleKey.VALUE: h_x1},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.HYDROGEN_X5,\\n DataParticleKey.VALUE: h_x5},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.EH_SENSOR,\\n DataParticleKey.VALUE: eh},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.REFERENCE_TEMP_VOLTS,\\n DataParticleKey.VALUE: ref_temp_v},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.REFERENCE_TEMP_DEG_C,\\n DataParticleKey.VALUE: ref_temp_c},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_TEMP_VOLTS,\\n DataParticleKey.VALUE: res_temp_v},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.RESISTIVITY_TEMP_DEG_C,\\n DataParticleKey.VALUE: res_temp_c},\\n {DataParticleKey.VALUE_ID: BarsDataParticleKey.BATTERY_VOLTAGE,\\n DataParticleKey.VALUE: batt_v}\\n ]\\n \\n return result\",\n \"def split_text(text: str) -> List[Dict[str, str]]:\\n # split into paragraphs\\n lines = text.splitlines()\\n groups = common.group_list(lines, lambda a, _: a.strip() == '')\\n paras = ['\\\\n'.join(item) for empty_line, item in groups if not empty_line]\\n\\n def _fallback(p, type):\\n logging.warn(f'Wrong {type} format:\\\\n' + p)\\n cells.append({'type': 'text', 'source': p})\\n\\n cells = []\\n for p in paras:\\n lines = p.splitlines() + ['']\\n p += '\\\\n'\\n if p.startswith('#'):\\n # parse title\\n if not _is_mark(lines[1:]):\\n _fallback(p, 'title')\\n else:\\n m = re.match(r'#+ *', lines[0])\\n cells.append({\\n 'type': 'title',\\n 'prefix': m[0],\\n 'source': lines[0][m.span()[1]:],\\n 'mark': '\\\\n'.join(lines[1:])})\\n elif p.startswith('$$'):\\n # parse equations\\n m = re.findall(r'\\\\$\\\\$', p)\\n if len(m) != 2:\\n _fallback(p, 'equation')\\n else:\\n cells.append({'type': 'equation', 'source': p})\\n elif p.startswith('!['):\\n # parse images\\n if not lines[0].strip().endswith(')') or not _is_mark(lines[1:]):\\n _fallback(p, 'image')\\n else:\\n cells.append({'type': 'image', 'source': p})\\n elif p.startswith('|'):\\n # parse table\\n for i, l in enumerate(lines):\\n if not l.startswith('|'):\\n break\\n if not _is_mark(lines[i:]):\\n _fallback(p, 'equation')\\n else:\\n cells.append({'type': 'table', 'source': p})\\n else:\\n groups = common.group_list(lines, _list)\\n for prefix, item in groups:\\n if len(prefix.split('__')) == 2:\\n prefix = prefix.split('__')[0]\\n source = '\\\\n'.join(item)[len(prefix):]\\n if prefix == '':\\n cells.append({'type': 'text', 'source': source})\\n else:\\n cells.append({\\n 'type': 'list',\\n 'prefix': prefix,\\n 'source': source})\\n return cells\",\n \"def format_input(self, args):\\n\\n new_list = []\\n if args[1].find('{') != -1:\\n new_list = self.format_dicti(args)\\n return new_list\\n else:\\n new_list = []\\n new_list.append(args[0])\\n new_str = args[1][ args[1].find('(') + 2 : args[1].find(',') - 1]\\n new_str += args[1][ args[1].find(',') : args[1].find(')') - 0]\\n new_list.append(\\\" \\\".join(new_str.split(\\\", \\\") ) )\\n\\n return \\\" \\\".join(i for i in new_list)\",\n \"def parse_line(self, line):\\n line = line.strip()\\n log.debug(\\\"Parsing line: '{}'\\\".format(line))\\n if len(line) == 0:\\n log.warning(\\\"Zero length line detected\\\")\\n return\\n split = line.split(DELIMETER)\\n key = split[0]\\n if key in FORMATS:\\n log.debug(\\\"Using formatter for key: {}\\\".format(key))\\n formatter = FORMATS[key]\\n for (name, parser), value in zip(formatter,split[1:]):\\n self._params[name] = parser(value)\\n log.info(\\\"Parameters: {}\\\".format(self._params))\\n self.notify_watchers()\\n else:\\n log.debug(\\\"Invalid key: {}\\\".format(key))\",\n \"def _parse_date(date_string: str) -> Union[datetime.datetime, str]:\\n for date_format in KNOWN_DATE_FORMATS:\\n try:\\n date = datetime.datetime.strptime(date_string, date_format)\\n return date\\n except ValueError:\\n continue\\n return date_string\",\n \"def p_parse(toks):\\n return p_question_group.parseString(toks[0])\",\n \"def placeholders(self):\\n x = [i.placeholder for i in self._input_desc]\\n return x[0] if len(x) == 1 else x\",\n \"def FillForm(string_for_substitution, dictionary_of_vars):\\n return_string = string_for_substitution\\n for i in re.findall(\\\"//%%(.*)%%//\\\", string_for_substitution):\\n return_string = re.sub(\\\"//%%\\\" + i + \\\"%%//\\\", dictionary_of_vars[i],\\n return_string)\\n return return_string\",\n \"def getModelParameters(parameterstring):\\n \\n def getFormattedValue(strval):\\n if '\\\\'' in strval:\\n return strval.replace('\\\\'', '')\\n elif '\\\"' in strval:\\n return strval.replace('\\\"', '')\\n elif '.' in strval:\\n return float(strval)\\n elif strval == 'True':\\n return True\\n elif strval == 'False':\\n return False\\n else:\\n return int(strval)\\n \\n ((25,),)\\n def parseTuple(strval):\\n idx = strval.find(\\\"(\\\")+1\\n values = []\\n i = idx\\n while i < len(strval):\\n if strval[i] == '(':\\n nested, lnested = parseTuple(strval[i:])\\n print(i)\\n i += lnested\\n idx = i+1\\n print(i)\\n values.append(nested)\\n elif strval[i] == ')':\\n newval = strval[idx:i].strip()\\n if newval != '':\\n values.append(getFormattedValue(newval))\\n return tuple(values), i\\n elif strval[i] == ',':\\n newval = strval[idx:i].strip()\\n if newval != '':\\n values.append(getFormattedValue(newval))\\n idx = i+1\\n i += 1\\n \\n rv = dict()\\n if parameterstring is None:\\n return rv\\n params = parameterstring.strip().split(\\\"=\\\")\\n nextkey = params[0]\\n for pi in range(1,len(params)):\\n cur = params[pi]\\n if '(' in cur:\\n if cur.count(\\\"(\\\") != cur.count(\\\")\\\"):\\n raise InvalidParameters(\\\"Unequal number of paranthesis.\\\")\\n value, _ = parseTuple(cur)\\n rv[nextkey] = value\\n nextkey = cur[cur.rfind(',')].strip()\\n else:\\n commasplit = cur.split(\\\",\\\")\\n value = commasplit[0].strip()\\n rv[nextkey] = getFormattedValue(value)\\n nextkey = commasplit[1].strip()\\n \\n return rv\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7910855","0.694886","0.64524835","0.6108374","0.60248744","0.601687","0.60016334","0.5864088","0.57037616","0.55861354","0.55645305","0.554253","0.5510738","0.55103034","0.5497989","0.5479562","0.5358258","0.5325262","0.5298705","0.5236709","0.5222342","0.51827663","0.51105356","0.50851625","0.50643116","0.5060817","0.50543","0.504011","0.50389504","0.50320303","0.5023713","0.49628156","0.49474","0.4932526","0.49250206","0.4920185","0.48929116","0.488577","0.48788518","0.4871326","0.48706472","0.4867422","0.4859408","0.48556447","0.48346376","0.48269424","0.48231214","0.4800975","0.4784804","0.47704986","0.47641996","0.47560325","0.47526085","0.4747038","0.47439802","0.47433746","0.47348925","0.47204137","0.47143885","0.47011897","0.46814787","0.46608815","0.46500766","0.46480286","0.4647152","0.46470582","0.4639534","0.46385488","0.46313027","0.46297532","0.46193704","0.46148014","0.46126005","0.46121374","0.46111414","0.46067926","0.45950744","0.45924458","0.4592238","0.45918962","0.45918962","0.45899415","0.4579904","0.45788056","0.45658273","0.45550698","0.4546244","0.45430353","0.45407522","0.4539369","0.45362082","0.45324203","0.45311207","0.45287028","0.45187566","0.4516464","0.45095298","0.45090404","0.4503912","0.449647"],"string":"[\n \"0.7910855\",\n \"0.694886\",\n \"0.64524835\",\n \"0.6108374\",\n \"0.60248744\",\n \"0.601687\",\n \"0.60016334\",\n \"0.5864088\",\n \"0.57037616\",\n \"0.55861354\",\n \"0.55645305\",\n \"0.554253\",\n \"0.5510738\",\n \"0.55103034\",\n \"0.5497989\",\n \"0.5479562\",\n \"0.5358258\",\n \"0.5325262\",\n \"0.5298705\",\n \"0.5236709\",\n \"0.5222342\",\n \"0.51827663\",\n \"0.51105356\",\n \"0.50851625\",\n \"0.50643116\",\n \"0.5060817\",\n \"0.50543\",\n \"0.504011\",\n \"0.50389504\",\n \"0.50320303\",\n \"0.5023713\",\n \"0.49628156\",\n \"0.49474\",\n \"0.4932526\",\n \"0.49250206\",\n \"0.4920185\",\n \"0.48929116\",\n \"0.488577\",\n \"0.48788518\",\n \"0.4871326\",\n \"0.48706472\",\n \"0.4867422\",\n \"0.4859408\",\n \"0.48556447\",\n \"0.48346376\",\n \"0.48269424\",\n \"0.48231214\",\n \"0.4800975\",\n \"0.4784804\",\n \"0.47704986\",\n \"0.47641996\",\n \"0.47560325\",\n \"0.47526085\",\n \"0.4747038\",\n \"0.47439802\",\n \"0.47433746\",\n \"0.47348925\",\n \"0.47204137\",\n \"0.47143885\",\n \"0.47011897\",\n \"0.46814787\",\n \"0.46608815\",\n \"0.46500766\",\n \"0.46480286\",\n \"0.4647152\",\n \"0.46470582\",\n \"0.4639534\",\n \"0.46385488\",\n \"0.46313027\",\n \"0.46297532\",\n \"0.46193704\",\n \"0.46148014\",\n \"0.46126005\",\n \"0.46121374\",\n \"0.46111414\",\n \"0.46067926\",\n \"0.45950744\",\n \"0.45924458\",\n \"0.4592238\",\n \"0.45918962\",\n \"0.45918962\",\n \"0.45899415\",\n \"0.4579904\",\n \"0.45788056\",\n \"0.45658273\",\n \"0.45550698\",\n \"0.4546244\",\n \"0.45430353\",\n \"0.45407522\",\n \"0.4539369\",\n \"0.45362082\",\n \"0.45324203\",\n \"0.45311207\",\n \"0.45287028\",\n \"0.45187566\",\n \"0.4516464\",\n \"0.45095298\",\n \"0.45090404\",\n \"0.4503912\",\n \"0.449647\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7691594"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":94765,"cells":{"query":{"kind":"string","value":"Parses the format_string and returns a list of tuples (placeholder, format)."},"document":{"kind":"string","value":"def get_placeholder_formats_list(self, format_string):\n placeholders = []\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.append((token.group(\"key\"), token.group(\"format\")))\n return placeholders"},"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 update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\n and token.group(\"key\") in placeholder_formats\n ):\n output.append(f\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\")\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def read_atom_data(atom_format, line):\n if atom_format is None:\n _format = [guess_string_format(i.strip()) for i in line.split()]\n else:\n _format = atom_format\n formatted = []\n for i, (val, fmti) in enumerate(zip(line.split(), _format)):\n istrip = val.strip()\n try:\n formatted.append(fmti(istrip))\n except ValueError:\n fmt = guess_string_format(istrip)\n _format[i] = fmt\n formatted.append(fmt(istrip))\n return formatted, _format","def _parse(self, fmtstr):\n def _match_brace(string, start_pos, pair='[]'):\n \"\"\"Pairing brackets (used internally in _parse method)\"\"\"\n depth = 1\n if string[start_pos] != pair[0]:\n return None\n for index, char in enumerate(string[start_pos + 1:]):\n if char == pair[0]:\n depth += 1\n elif char == pair[1]:\n depth -= 1\n if depth == 0:\n return start_pos + index + 1\n return None\n\n #----------------------------------------------------------------------\n\n t_fmt = self.__class__._T_FMT\n t_prefix = self.__class__._T_PREFIX\n\n ptr = 0\n # it seems that field id 0 is invalid\n field_id = 1\n length = len(fmtstr)\n parsed_list = []\n\n while ptr < length:\n parsed = {}\n m_prefix = t_prefix.match(fmtstr[ptr:])\n if m_prefix:\n ptr += _get_length_of_match(m_prefix)\n parsed['prefix'] = m_prefix.group(1)\n\n # check if we have a nested structure\n if m_prefix.group(2):\n brace_offset = _match_brace(fmtstr, ptr - 1)\n\n # bracket not match\n if not brace_offset:\n raise BadFormatString(\n 'Unmatched brace on position {0}'.format(ptr)\n )\n parsed['field_id'] = field_id\n parsed['field_type'] = 'a'\n parsed['subcontent'] = self._parse(\n fmtstr[ptr:brace_offset]\n )\n ptr = brace_offset + 1\n field_id += 1\n\n parsed_list.append(parsed)\n continue\n m_fmt = t_fmt.match(fmtstr[ptr:])\n if m_fmt:\n ptr += _get_length_of_match(m_fmt)\n\n # fmt is an alias\n if m_fmt.group(2):\n parsed['field_type'] = self.__class__\\\n .FIELD_ALIAS[m_fmt.group(2)]\n # fmt is an actual field type\n elif m_fmt.group(1):\n parsed['field_type'] = m_fmt.group(1)\n\n # save field id\n parsed['field_id'] = field_id\n\n # check for type clones (e.g. `v3')\n if m_fmt.group(3):\n parsed['repeat'] = int(m_fmt.group(3))\n field_id += int(m_fmt.group(3))\n else:\n parsed['repeat'] = 1\n field_id += 1\n\n parsed_list.append(parsed)\n\n else:\n raise BadFormatString(\n 'Invalid token on position {0}'.format(ptr)\n )\n\n # all set\n return parsed_list","def get_placeholders(self, format_string):\n placeholders = set()\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.add(token.group(\"key\"))\n elif token.group(\"command\"):\n # get any placeholders used in commands\n commands = dict(parse_qsl(token.group(\"command\")))\n # placeholders only used in `if`\n if_ = commands.get(\"if\")\n if if_:\n placeholders.add(Condition(if_).variable)\n return placeholders","def tokens(self, format_string):\n if format_string not in self.format_string_cache:\n tokens = list(re.finditer(self.reg_ex, format_string))\n self.format_string_cache[format_string] = tokens\n return self.format_string_cache[format_string]","def parse_name_and_type_from_fmt_str(\n formatted_str: str,\n allowed_types: Optional[Dict[str, Component]] = None\n) -> Generator[Tuple[str, Type[Field]], None, None]:\n for _, arg_name, _type_name, _ in Formatter().parse(formatted_str):\n if arg_name is not None:\n try:\n assert _type_name is not None\n _type = (\n allowed_types[_type_name] if allowed_types is not None\n and _type_name in allowed_types\n else getattr(pyopenapi3.data_types, _type_name)\n )\n yield arg_name, _type\n except AttributeError:\n raise ValueError(\n \"A non-`Field` or `OpenApiObject` type was found. \"\n f\"Can't use `{_type_name}` as a type in {formatted_str}. \"\n f\"Must be a stringified pyopenapi3 `data_type`, such \"\n f\"as `pyopenapi3.data_types.String`, or a reference to a \"\n f\"Component.\"\n ) from None","def parse(string, format):\n # Count the number of spaces in the format string (N), and\n # truncate everything after the (N+1)th space\n spaces = format.count(' ') + 1\n string = ' '.join(string.split()[:spaces])\n\n try:\n result = dt.datetime.strptime(string, format)\n except ValueError, err:\n raise CannotParse(str(err))\n else:\n return result","def formatted(s):\n matches = re.findall(_format_re, normalize(s))\n if len(matches) == 1 and matches[0][0] != '':\n return matches[0][0]\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\n if txt_none != '':\n return FORMAT_NONE, txt_none\n elif txt_sw != '':\n return FORMAT_SW, txt_sw\n elif txt_rem != '':\n return FORMAT_REM, txt_rem\n elif txt_em != '':\n return FORMAT_EM, txt_em\n elif txt_a != '':\n return FORMAT_A, txt_a\n return [to_fmt(*m) for m in matches]","def parse_format(var_sample):\n # ugh\n ret = []\n # Parsing format information\n # Need to see what all these could be...\n if None in var_sample[\"GT\"]:\n ret.append(3)\n elif var_sample[\"GT\"] == (0, 0):\n ret.append(0)\n elif var_sample[\"GT\"] == (0, 1):\n ret.append(1)\n elif var_sample[\"GT\"] == (1, 1):\n ret.append(2)\n \n ret.extend([var_sample[\"GQ\"] if var_sample[\"GQ\"] is not None else 0,\n var_sample[\"OV\"],\n var_sample[\"DP\"], # be careful these aren't '.'\n #split where _r is ref-allele and _a is alt-allele\n var_sample[\"AD\"][0],\n var_sample[\"AD\"][1],\n var_sample[\"PDP\"],\n var_sample[\"PAD\"][0],\n var_sample[\"PAD\"][1],\n var_sample[\"US\"][0],\n var_sample[\"US\"][1],\n var_sample[\"DS\"][0],\n var_sample[\"DS\"][1],\n var_sample[\"UC\"][0],\n var_sample[\"UC\"][1],\n var_sample[\"DC\"][0],\n var_sample[\"DC\"][1],\n var_sample[\"UDC\"][0],\n var_sample[\"UDC\"][1],\n var_sample[\"UCC\"][0],\n var_sample[\"UCC\"][1],\n var_sample[\"DDC\"][0],\n var_sample[\"DDC\"][1],\n var_sample[\"DCC\"][0],\n var_sample[\"DCC\"][1],\n var_sample[\"UMO\"][0],\n var_sample[\"UMO\"][1],\n var_sample[\"DMO\"][0],\n var_sample[\"DMO\"][1],\n var_sample[\"UXO\"][0],\n var_sample[\"UXO\"][1],\n var_sample[\"DXO\"][0],\n var_sample[\"DXO\"][1],\n var_sample[\"NR\"][0],\n var_sample[\"NR\"][1],\n var_sample[\"MO\"][0],\n var_sample[\"MO\"][1],\n var_sample[\"XO\"][0],\n var_sample[\"XO\"][1],\n var_sample[\"XC\"][0],\n var_sample[\"XC\"][1],\n var_sample[\"AC\"][0],\n var_sample[\"AC\"][1],\n var_sample[\"MC\"][0],\n var_sample[\"MC\"][1],\n var_sample[\"EC\"][0],\n var_sample[\"EC\"][1],\n var_sample[\"PL\"][0] if var_sample[\"PL\"][0] is not None else 0,\n var_sample[\"PL\"][1] if var_sample[\"PL\"][0] is not None else 0,\n var_sample[\"PL\"][2] if var_sample[\"PL\"][0] is not None else 0])\n return ret\n #END","def convert_raw_tuple(value_tuple, format_string):\n values = []\n for v, c in zip(value_tuple, format_string):\n if v is None:\n # append None\n values.append(v)\n elif c == u\"s\":\n # string\n values.append(v)\n elif c == u\"S\":\n # string, split using space as delimiter\n values.append([s for s in v.split(u\" \") if len(s) > 0])\n elif c == u\"i\":\n # int\n values.append(int(v))\n elif c == u\"U\":\n # Unicode\n values.append(convert_unicode_field(v))\n elif c == u\"A\":\n # ASCII\n values.append(convert_ascii_field(v))\n #elif c == u\"x\":\n # # ignore\n # pass\n return tuple(values)","def guess_format(string):\n format_regexps = _compiled_format_regexps(_date_formats, _time_formats)\n for format, regexp in format_regexps:\n if regexp.search(string):\n return format\n # Nothing matched\n raise CannotParse(\"Could not guess date/time format in: %s\" % string)","def _translate_fmts(self):\n fmt_info = []\n fmt_append = fmt_info.append\n \n isvalid = self._is_valid_fmt\n typlist = self._typlist\n isstrvar = self._isstrvar\n default_fmts = self._default_fmts\n \n for i, fmt in enumerate(self._fmtlist):\n fmt = fmt.strip()\n \n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\n \n if iscalendar or not isvalid(fmt):\n if isstrvar(i):\n wid = min(typlist[i], 10)\n fmt_append(('s', \"{{:>{}s}}\".format(wid), wid))\n continue\n else:\n fmt = default_fmts[typlist[i]]\n \n last_char = fmt[-1]\n if last_char == 's': # string\n m = STR_FMT_RE.match(fmt)\n align, _, wid = m.group(1), m.group(2), m.group(3)\n new_align = (\"<\" if align == \"-\" \n else \"^\" if align == \"~\" else \">\")\n new = \"\".join((\"{:\", new_align, wid, \"s}\"))\n fmt_append(('s', new, int(wid)))\n elif last_char == 'H' or last_char == 'L': # binary\n fmt_append((last_char, fmt, int(fmt[1:-1])))\n elif last_char == 'x': # hexadecimal\n fmt_append(('x', fmt, 21))\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\n m = NUM_FMT_RE.match(fmt)\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \n m.group(3), m.group(4),\n m.group(5), m.group(6),\n m.group(7))\n aln = \"<\" if align == \"-\" else \">\"\n sep = \",\" if com is not None else \"\"\n if type == \"g\" and int(prec) == 0:\n new = \"\".join((\"{:\", aln, wid, sep, type, \"}\"))\n else:\n new = \"\".join((\"{:\", aln, wid, sep, \".\", prec, type, \"}\"))\n fmt_append((type, new, int(wid), delim, com))\n \n return fmt_info","def _parse_date_format( fmp_database ):\n\tdef build_one( stamp ):\n\t\treturn stamp.\\\n\t\t replace( 'yyyy', '%Y' ).\\\n\t\t replace( 'MM', '%m' ).\\\n\t\t replace( 'dd', '%d' ).\\\n\t\t replace( 'HH', '%H' ).\\\n\t\t replace( 'mm', '%M' ).\\\n\t\t replace( 'ss', '%S' )\n\n\treturn {\n\t\t'date': build_one( fmp_database.get('date-format', '') ),\n\t\t'timestamp': build_one( fmp_database.get('timestamp-format', '') ),\n\t\t'time': build_one( fmp_database.get('time-format', '') ),\n\t}","def initFormat(self):\n self.formatList = self.splitText(self.format)","def formatLookup(format_str):\n pat = '(\\d+)([A-Z])'\n match = re.search(pat, format_str)\n #print match.group()\n \n data_len = int(match.group(1))\n data_fmt = str(match.group(2))\n np_fmt = fitsFormatLookup(data_fmt)\n np_dtype = '%i%s'%(data_len, np_fmt)\n \n return np_dtype, data_len, np_fmt","def find_time(string, format):\n re_format = format\n for key, value in six.iteritems(REGEX):\n re_format = re_format.replace(key, value)\n matches = re.finditer(re_format, string)\n for match in matches:\n try:\n matchstr = string[slice(*match.span())]\n dt = datetime.strptime(matchstr, format)\n except ValueError:\n continue\n else:\n yield dt","def parse(timestring):\n for parser in _PARSERS:\n match = parser['pattern'].match(timestring)\n if match:\n groups = match.groups()\n ints = tuple(map(int, groups))\n time = parser['factory'](ints)\n return time\n\n raise TimeError('Unsupported time format {}'.format(timestring))","def load(fmt: str, stream: BytesIO, _unpack=unpack):\n values = []\n bitcount = bits = 0\n for char in fmt:\n if char == '?':\n if not bitcount:\n bits = _unpack('>B', _read(stream, 1))[0]\n bitcount = 8\n value = (bits & 1) == 1\n bits >>= 1\n bitcount -= 1\n else:\n bitcount = bits = 0\n if char == 'B':\n value = _unpack('>B', _read(stream, 1))[0]\n elif char == 'H':\n value = _unpack('>H', _read(stream, 2))[0]\n elif char == 'L':\n value = _unpack('>L', _read(stream, 4))[0]\n elif char == 'Q':\n value = _unpack('>Q', _read(stream, 8))[0]\n elif char == 's':\n length = _unpack('>B', _read(stream, 1))[0]\n value = _unpack('>%ss' % length, _read(stream, length))[0]\n value = value.decode('utf-8', 'surrogatepass')\n elif char == 'S':\n length = _unpack('>L', _read(stream, 4))[0]\n value = _unpack('>%ss' % length, _read(stream, length))[0]\n value = value.decode('utf-8', 'surrogatepass')\n elif char == 't':\n timestamp = _unpack('>Q', _read(stream, 8))[0]\n value = datetime.utcfromtimestamp(timestamp)\n elif char == 'T':\n value = {}\n length = _unpack('>L', _read(stream, 4))[0]\n stream2 = BytesIO(_read(stream, length))\n while stream2.tell() < length:\n key = load('s', stream2)[0]\n value[key] = _load_item(stream2)\n elif char != '?':\n raise ValueError('wrong format char', char)\n values.append(value)\n return values","def parseSettings (formatStr):\n # split string\n fmt = formatStr.split ('.')\n if len (fmt) < 0:\n return (None, None)\n \n # find encoder\n encoderInstance = None\n for e in _registeredEncoders:\n if len (fmt) > 0:\n if e.name () == fmt[0]:\n encoderInstance = e\n break\n else:\n encoderInstance = _registeredEncoders[0] if len (_registeredEncoders) > 0 else None\n\n # return tuple with parsed settings\n presetName = '.'.join (fmt[1:])\n if presetName in (None, \"\"):\n if encoderInstance != None:\n presetName = encoderInstance.defaultPreset ()\n return (encoderInstance, presetName)","def parse(self, s):\n\n segments = self.compiled.split(self._whitespace.sub(\" \", s))\n literals = segments[::2]\n raw = segments[1::2]\n\n if not raw:\n return []\n\n case = list(map(str.casefold, raw))\n prefixes = [{}] + [dict(self.locale_set.prefixes.get(match, ())) for match in case[:-1]]\n suffixes = [dict(self.locale_set.suffixes.get(match, ())) for match in case[1:]] + [{}]\n\n groups = _DateTime(**{ field: [] for field in _DateTime._fields })\n choices_per_position = {}\n always_literal = set()\n numeric = set()\n for idx, (prefix, suffix) in enumerate(zip(prefixes, suffixes)):\n keyword = self._lookup_keyword(raw[idx])\n if \"y\" in prefix:\n prefix[\"C\"] = tuple(set(prefix[\"y\"] + prefix.get(\"C\", ())))\n if not keyword:\n always_literal.add(idx)\n else:\n if raw[idx].isdigit():\n numeric.add(idx)\n choices_per_position[idx] = len(keyword)\n for fmt, value, locales in keyword:\n category = fmt[-1]\n if category == \"b\":\n # Month-names should be treated like numeric months.\n category = \"m\"\n elif category == \"z\":\n category = \"Z\"\n getattr(groups, category).append(_Assignment(\n fmt=fmt,\n pos=idx,\n value=value,\n locales=locales,\n prefix=prefix.get(fmt[-1]),\n suffix=suffix.get(fmt[-1]),\n ))\n numeric = frozenset(numeric)\n\n # If a required date field is unsatisfiable, this is not a date.\n if not all(getattr(groups, category) for category in _State._min_date_formats):\n for category in _State._all_date_formats:\n getattr(groups, category).clear()\n\n # If a required time field is unsatisfiable, this is not a time.\n if not all(getattr(groups, category) for category in _State._min_time_formats):\n for category in _State._all_time_formats:\n getattr(groups, category).clear()\n\n for group in groups:\n group.sort(key=lambda assignment: (\n -self._optimistic_score(assignment),\n choices_per_position[assignment.pos],\n ))\n\n required_formats = _State._min_date_formats + _State._min_time_formats\n groups = OrderedDict(sorted(\n (\n (\n category,\n (\n group,\n tuple(\n (f, required)\n for f, required in _position_constraints\n if category in required\n ),\n tuple(\n (f, required)\n for f, required, revisit in _value_constraints\n if category in required or category in revisit\n ),\n )\n )\n for category, group in zip(groups._fields, groups)\n if group\n ),\n key=lambda i: (i[0] not in required_formats, len(i[1][0]))\n ))\n\n # We've already filtered out all possibilities; there's nothing here.\n if not groups:\n return []\n\n constrained_groups = []\n while groups:\n category, (group, position, value) = groups.popitem(last=False)\n constrained_groups.append((category, group, position, value))\n required = frozenset(itertools.chain.from_iterable(required for f, required in itertools.chain(position, value)))\n if required:\n required = [\n category\n for category in reversed(groups.keys())\n if category in required\n ]\n for category in required:\n groups.move_to_end(category, last=False)\n groups = constrained_groups\n\n best_quality = 0\n best_candidates = []\n\n partials = [\n _State.empty._replace(\n unconverted=frozenset(always_literal),\n remaining_groups=tuple(groups),\n ).children(numeric=numeric)\n ]\n while partials:\n try:\n quality, locales, state = next(partials[-1])\n except StopIteration:\n partials.pop()\n continue\n\n if state.remaining_groups:\n # Admissable heuristic: compute the best score each group\n # could possibly achieve. Don't count conversion specifiers\n # that we've already used, but don't worry about conflicts\n # in the groups we haven't assigned yet. Any such conflicts\n # can only reduce the resulting score, and we only need to\n # make sure that the heuristic is at least as large as the\n # true value of the best leaf in this subtree. However, the\n # more precise we can be here, the fewer nodes we have to\n # search, so we can spend some CPU time on precision and\n # still come out ahead.\n assigned = state.unconverted.union(state.pos).difference((None,))\n heuristic = len(state.pending_hints) + sum(\n next((\n self._optimistic_score(assignment)\n for assignment in group[1]\n if assignment.pos not in assigned\n ), 0)\n for group in state.remaining_groups\n )\n\n if quality + heuristic < best_quality:\n # Even assuming the remaining groups get the highest\n # possible score, this state is still not good enough.\n continue\n\n partials.append(state.children(numeric=numeric))\n continue\n\n value = state.valid()\n if value is None:\n continue\n\n quality, locales, state = state.final_score()\n\n if best_quality is not None and quality < best_quality:\n # We've seen better, so skip this one.\n continue\n\n if quality != best_quality:\n best_quality = quality\n best_candidates = []\n\n conversions = dict(zip(state.pos, state.fmts))\n fmts = [ conversions.get(idx) or literal for idx, literal in enumerate(raw) ]\n\n pattern = ''.join(lit + fmt for lit, fmt in zip(literals, fmts + [''])).replace(\"%C%y\", \"%Y\")\n best_candidates.append((pattern, value, locales))\n return best_candidates","def _interpolate(format):\n from tokenize import tokenprog\n\n def matchorfail(text, pos):\n match = tokenprog.match(text, pos)\n if match is None:\n raise _ItplError(text, pos)\n return match, match.end()\n\n namechars = \"abcdefghijklmnopqrstuvwxyz\" \\\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\";\n chunks = []\n pos = 0\n\n while 1:\n dollar = format.find(\"$\", pos)\n if dollar < 0: \n break\n nextchar = format[dollar + 1]\n\n if nextchar == \"{\":\n chunks.append((0, format[pos:dollar]))\n pos, level = dollar + 2, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token == \"{\": \n level = level + 1\n elif token == \"}\": \n level = level - 1\n chunks.append((1, format[dollar + 2:pos - 1]))\n\n elif nextchar in namechars:\n chunks.append((0, format[pos:dollar]))\n match, pos = matchorfail(format, dollar + 1)\n while pos < len(format):\n if format[pos] == \".\" and \\\n pos + 1 < len(format) and format[pos + 1] in namechars:\n match, pos = matchorfail(format, pos + 1)\n elif format[pos] in \"([\":\n pos, level = pos + 1, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token[0] in \"([\": \n level = level + 1\n elif token[0] in \")]\": \n level = level - 1\n else: \n break\n chunks.append((1, format[dollar + 1:pos]))\n else:\n chunks.append((0, format[pos:dollar + 1]))\n pos = dollar + 1 + (nextchar == \"$\")\n\n if pos < len(format): \n chunks.append((0, format[pos:]))\n return chunks","def update_placeholders(self, format_string, placeholders):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if token.group(\"key\") in placeholders:\n output.append(\n \"{{{}{}}}\".format(placeholders[token.group(\"key\")], token.group(\"format\"))\n )\n continue\n elif token.group(\"command\"):\n # update any placeholders used in commands\n commands = parse_qsl(token.group(\"command\"), keep_blank_values=True)\n # placeholders only used in `if`\n if \"if\" in [x[0] for x in commands]:\n items = []\n for key, value in commands:\n if key == \"if\":\n # we have to rebuild from the parts we have\n condition = Condition(value)\n variable = condition.variable\n if variable in placeholders:\n variable = placeholders[variable]\n # negation via `!`\n not_ = \"!\" if not condition.default else \"\"\n condition_ = condition.condition or \"\"\n # if there is no condition then there is no\n # value\n if condition_:\n value_ = condition.value\n else:\n value_ = \"\"\n value = \"{}{}{}{}\".format(not_, variable, condition_, value_)\n if value:\n items.append(f\"{key}={value}\")\n else:\n items.append(key)\n\n # we cannot use urlencode because it will escape things\n # like `!`\n output.append(r\"\\?{} \".format(\"&\".join(items)))\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def parse_template(template):\n field_name = None\n field_value = []\n\n for line in template.strip().split('\\n') + ['end:']:\n if line.startswith('#'):\n continue\n match = RE_TEMPLATE_FIELD_LINE.match(line)\n if match:\n if field_name is not None:\n yield (field_name, '\\n'.join(field_value).strip())\n elif len(field_value) > 0:\n logging.warning('Ignoring lines: %r', field_value)\n\n field_name = match.group(1)\n field_value = [match.group(2)]\n else:\n field_value.append(line)","def _parse_kvfmt(self, fmtlist):\n t_fmt = self.__class__._T_FMT\n t_prefix = self.__class__._T_PREFIX\n parsed_list = []\n field_id = 1\n\n for entry in fmtlist:\n name = entry[0]\n fmt = entry[1]\n parsed_field = {}\n parsed_field['name'] = name\n if isinstance(fmt, str):\n ptr = 0\n m_prefix = t_prefix.match(fmt)\n if m_prefix:\n ptr += _get_length_of_match(m_prefix)\n parsed_field['prefix'] = m_prefix.group(1)\n # check for optional nested structure start (required if the field is also repeated)\n if m_prefix.group(2) and len(entry) > 2:\n parsed_field['field_id'] = field_id\n parsed_field['field_type'] = 'a'\n parsed_field['subcontent'] = self._parse_kvfmt(entry[2])\n field_id += 1\n parsed_list.append(parsed_field)\n continue\n elif m_prefix.group(2):\n raise BadFormatString('Nested field type used without specifying field format.')\n m_fmt = t_fmt.match(fmt[ptr:])\n if m_fmt:\n ptr += _get_length_of_match(m_fmt)\n resolved_fmt_char = None\n # fmt is an alias\n if m_fmt.group(2):\n resolved_fmt_char = m_fmt.group(2)\n parsed_field['field_type'] = self.__class__\\\n .FIELD_ALIAS[m_fmt.group(2)]\n # fmt is an actual field type\n elif m_fmt.group(1):\n resolved_fmt_char = m_fmt.group(1)\n parsed_field['field_type'] = m_fmt.group(1)\n parsed_field['field_id'] = field_id\n # only skip type (`x') is allowed for copying in key-value mode\n if m_fmt.group(3) and resolved_fmt_char == 'x':\n repeats = int(m_fmt.group(3))\n parsed_field['repeat'] = repeats\n field_id += repeats\n elif m_fmt.group(3):\n raise BadFormatString('Field copying is not allowed in key-value format list.')\n else:\n field_id += 1\n else:\n raise BadFormatString('Invalid type for field \"{0}\"'.format(name))\n if len(fmt) != ptr:\n self.logger.warning('Extra content found after the type string of %s.', name)\n else:\n # Hard-code the empty prefix because we don't support copying\n parsed_field['prefix'] = ''\n parsed_field['field_id'] = field_id\n parsed_field['field_type'] = 'a'\n parsed_field['subcontent'] = self._parse_kvfmt(fmt)\n field_id += 1\n parsed_list.append(parsed_field)\n return parsed_list","def _parseAttributeScanf(self, line, formatting):\n\n # multiple entrys\n if isinstance(formatting, list):\n for scanf_format in formatting:\n try:\n #print \"<<<----\", scanf_format, line\n return sscanf(line, scanf_format)\n except IncompleteCaptureError, e:\n pass\n\n # single entry\n else:\n return sscanf(line, formatting)\n\n # problem if none of the formats worked\n raise IncompleteCaptureError(\"Format error for %s\" % line)","def __init__(self, format_string):\r\n if not isinstance(format_string, Compatibility.string):\r\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\r\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\r\n self._re = re.compile(self._re_pattern)","def parse_template(string):\n count = 0\n list1 = []\n for character in string:\n count = count + 1\n if character == \"{\":\n end = string.find(\"}\", count)\n s_strg = string[count:end]\n list1.append(s_strg)\n string = string.replace(s_strg, \"\", 1)\n count = count - len(s_strg)\n\n subs = tuple(list1)\n\n return(string, subs)\n print(subs)","def _get_placeholders(template):\n return [p[1] for p in string.Formatter().parse(template)\n if p[1] is not None and len(p[1]) > 0]","def parse_from_placeholder(string,pattern,encloser='%',matcher='(.+)'):\n pattern,fields = placeholder_to_regex(pattern,encloser,matcher)\n return parse_from_regex(string,pattern,fields)","def parse_known_date_formats(dt_string):\n for fmt in ('%Y%m%d', '%Y%m%d %H:%M', '%m/%d/%Y', '%m/%d/%Y %H:%M'):\n try:\n return datetime.strptime(dt_string, fmt)\n except ValueError:\n pass\n raise ValueError(\"No valid date format found.\"\n \"See https://tidesandcurrents.noaa.gov/api/ \"\n \"for list of accepted date formats.\")","def format_regexp(simple_format):\n format, regexp = ('', '')\n for char in simple_format:\n if char in _regexps:\n format += '%' + char\n regexp += _regexps[char]\n else:\n format += char\n regexp += char\n return (format, regexp)","def parse_task_time(line):\n stripret = \"\".join(line.split())\n p = re.compile(r'\\d+\\.\\d{2}-\\d+\\.\\d{2}')\n findret = p.findall(stripret) \n if findret:\n formatstr = \" \".join(line.split())\n timeregx = r'\\d+\\.\\d{2}\\s*-\\s*\\d+\\.\\d{2}'\n time = re.compile(timeregx).findall(formatstr)[0].replace(\" \", \"\").replace(\":\", \".\")\n taskcontext = re.sub(timeregx, \"\", formatstr).strip().replace(\":\", \"\")\n return [taskcontext, time]\n else:\n # log it if line can't be parse\n logging.warning(\"unparsed line: [%r]\" % line)","def _parse_param_line(regex, line):\n out = []\n for r in regex.findall(line):\n converter, variable = r[0] or 'default', r[1]\n out.append((_CONVERTERS[converter], variable))\n return out","def extract_fields(entry_string):\n for field, value in re.findall(\"(.*?)=(.*?)\\}\", entry_string):\n yield field.strip(\",\").strip(\" \"), value.strip(\"{\").strip(\"}\")","def parse_params(txt):\n res = list()\n # First, slipt with stuff looking like \\TYPE:\n splitted = re.split(r'\\s*\\\\(\\w+)\\s*:', txt)\n # We now have a list looking like:\n # ['', 'flag', '....', 'param', '...']\n i = 1\n while i < len(splitted) - 1:\n type = splitted[i]\n rest = splitted[i+1]\n if type == \"argn\":\n name = \"remaining args\"\n desc = rest\n else:\n # first word is the name, the rest is the description:\n match = re.match(r'\\s*(\\w+)\\s*(.*)', rest, re.DOTALL)\n if not match:\n print(\"warning, failed to parse parameters\")\n print(\"near\", rest)\n break\n (name, desc) = match.groups()\n desc = clean_indent(desc)\n res.append((type, name, desc))\n i += 2\n return res","def extract_pattern(fmt):\n class FakeDict(object):\n def __init__(self):\n self.seen_keys = set()\n\n def __getitem__(self, key):\n self.seen_keys.add(key)\n return ''\n\n def keys(self):\n return self.seen_keys\n\n fake = FakeDict()\n try:\n fmt % fake\n except TypeError:\n # Formatting error\n pass\n return set(fake.keys())","def parse_spec(spec: str) -> Tuple[str, str]:\n\n # Single \"*\" is treated as wildcard for date, not channel.\n if spec == \"*\":\n return \"*\", \"*\"\n\n channel_rex = r\"\"\"\n (?P<channel>\n nightly | beta | stable | \\* | (?: \\d+\\.\\d+\\.\\d+ )\n )\n \"\"\"\n\n date_rex = r\"\"\"\n (?P<date>\n \\d\\d\\d\\d-\\d\\d-\\d\\d | latest | \\*\n )\n \"\"\"\n\n m = re.match(\n r\"{} (?: - {})? $\".format(channel_rex, date_rex), spec, re.VERBOSE\n )\n if m:\n channel = m.group(\"channel\")\n date = m.group(\"date\") or \"\"\n return date, channel\n\n m = re.match(r\"{} $\".format(date_rex), spec, re.VERBOSE)\n if m:\n date = m.group(\"date\")\n return date, \"*\"\n\n raise error.UsageError(\"invalid SPEC {}\".format(repr(spec)))","def parse_place_notation(input_string: str) -> Tuple[int, str]:\n\n # Looking for a string that matches <stage>:<place notation> where the\n # place notation is a series of bell numbers and 'x' characters\n parts = input_string.split(\":\")\n if len(parts) == 2:\n stage_part = parts[0]\n if len(stage_part) == 0 or not stage_part.isnumeric():\n raise PlaceNotationError(input_string, \"Stage must be a number\")\n stage = int(stage_part)\n place_notation = parts[1]\n if not valid_pn(place_notation):\n raise PlaceNotationError(input_string, \"Place notation is invalid\")\n else:\n raise PlaceNotationError(input_string, \"<stage>:<place notation> required\")\n\n return stage, place_notation","def get_formats(self):\n return tuple(self._names.keys())","def _parse_date(date_string: str) -> Union[datetime.datetime, str]:\n for date_format in KNOWN_DATE_FORMATS:\n try:\n date = datetime.datetime.strptime(date_string, date_format)\n return date\n except ValueError:\n continue\n return date_string","def format_data(data_string):\n lines = data_string.split('\\\"\\n\\\"')\n split_data = [re.split(r\"\\\"\\s*,\\s*\\\"\", line) for line in lines]\n\n return split_data","def strptime(date_string, format):\n i = 0\n format_len = len(format)\n # Iterate through the format string, applying parsers and matching literal\n # chars as appropriate.\n struct_time_d = {}\n while i < format_len:\n c = format[i]\n # If the character is not the start of a directive, attempt to match a\n # literal character.\n if c != '%':\n if date_string[0] != c:\n return None\n date_string = date_string[1:]\n else:\n # Read the next character of the directive, letting an IndexError\n # raise if format is exhausted/malformed.\n i += 1\n directive = format[i]\n # Raise a ValueError just like the built-in datetime.strptime()\n # if the directive is invalid.\n if directive not in DIRECTIVE_PARSER_MAP:\n raise ValueError(\"{} is a bad directive in format {}\".format(\n repr(directive[1]), repr(directive)))\n # Get the parser.\n parser = DIRECTIVE_PARSER_MAP[directive]\n # Check whether the parser is yet to be implemented.\n if parser is NOT_IMPLEMENTED:\n raise NotImplementedError(\n 'parser not defined for directive: {}'.format(directive)\n )\n # Do the parsing.\n result = parser(date_string)\n # Return None on any parsing failure.\n if result is False:\n return None\n value, date_string = result\n # Convert the directive value to a struct_time item.\n struct_time_item = directive_to_struct_time_item(directive, value)\n if struct_time_item is not None:\n k, v = struct_time_item\n # If the key already exists, accumulate, otherwise set.\n if k in struct_time_d:\n struct_time_d[k] += v\n else:\n struct_time_d[k] = v\n i += 1\n\n # Return None if the date string has not been completely consumed.\n if len(date_string) > 0:\n return None\n\n # Return None if a +12 hour AM_PM = 'PM' accumulation overflowed a parsed\n # HOUR_24 value.\n if not (0 <= struct_time_d.get(STRUCT_TIME.TM_HOUR, 0) <= 23):\n return None\n\n # Attempt to get year/month/day for date ops.\n year = struct_time_d.get(STRUCT_TIME.TM_YEAR)\n month = struct_time_d.get(STRUCT_TIME.TM_MON)\n day = struct_time_d.get(STRUCT_TIME.TM_MDAY)\n has_date = year is not None and month is not None and day is not None\n\n # Return None if the specified day is not valid for the month.\n if has_date and not is_valid_month_day(year, month, day):\n return None\n\n # Create an initial struct_time object.\n _struct_time = struct_time(\n *[struct_time_d.get(k, 0) for k in STRUCT_TIME_FIELDS]\n )\n\n if has_date:\n # Check whether accumulated minute value exceeds its max as a result of\n # accumulating a time zone offset, requiring some calendar day math.\n if not 0 <= struct_time_d.get(STRUCT_TIME.TM_MIN, 0) <= 59:\n # Pass _struct_time along with an empty time_delta to\n # add_struct_time_time_delta() to take advantage of its\n # over/underflow logic. Note that add_struct_time_time_delta() will\n # take care of setting the final day of week / year.\n _struct_time = add_struct_time_time_delta(\n _struct_time, time_delta())\n else:\n # Calculate the final day of week / year.\n _struct_time = struct_time_replace(\n _struct_time,\n tm_wday=date_to_day_of_week(year, month, day),\n tm_yday=date_to_day_of_year(year, month, day)\n )\n\n return _struct_time","def _read_range(range: str) -> Tuple[str, List[Tuple[Union[int, None], Union[int, None]]]]:\n format, split_on_pairs = range.split('=', 1)\n split_on_pairs = split_on_pairs.split(',')\n pairs = []\n for pair_str in split_on_pairs:\n split_on_range = pair_str.split('-', 1)\n start = int(split_on_range[0]) if len(split_on_range[0]) > 0 else None\n stop = int(split_on_range[1]) if len(split_on_range[1]) > 0 else None\n pairs.append((start, stop))\n return format, pairs","def parse_styles(text: str) -> List[dict]:\n styles = []\n regex = r'(\\d{3})=(\".*?\"),(\\d+\\.?\\d+),(\\(.*?\\))'\n\n for line in text.split(\"\\r\\n\"):\n if line == \"\":\n continue\n\n n, font, font_size, color = re.match(regex, line).groups()\n styles.append(\n {\n \"id\": int(n),\n \"f\": font.replace('\"', \"\"),\n \"fs\": float(font_size),\n \"rgb\": [\n int(i)\n for i in color.replace(\"(\", \"\")\n .replace(\")\", \"\").split(\",\")]\n }\n )\n\n return styles","def stringTimeToTuple_NEW(st):\n st, ms = split(st, '.')\n y, m, d, h, n, s = split(st, '_')\n return y,m,d,h,n,s,ms","def initFormat(self):\n self.formatList = []","def _read_format(instream):\n format = int(le.uint32.read_from(instream))\n if format & PCF_BYTE_MASK:\n base = be\n else:\n base = le\n return format, base","def _parse_format(mode=2, rc_kw=None, **kwargs):\n kw = {}\n rc_kw = rc_kw or {}\n for key, value in kwargs.items():\n key_fixed = _rc_nodots.get(key, None)\n if key_fixed is None:\n kw[key] = value\n else:\n rc_kw[key_fixed] = value\n return rc_kw, mode, kw","def GetFormatCount(format_):\n\n if isinstance(format_, str):\n match = re.search(r'\\s*(\\d+)', format_)\n if match:\n return int(match.group(0))\n\n return 1","def get_point_list(self, string):\n a = re.findall('\\(\\d+\\.\\d+, \\d+\\.\\d+\\)', string)\n lst = []\n for tp in a:\n lst.append(self.get_tuple(tp))\n print lst","def get_tuple(self, string):\n a = re.search('\\((\\d+\\.\\d+), (\\d+\\.\\d+)\\)', string)\n if not a:\n return None\n else:\n return (float(a.group(1)), float(a.group(2)))","def display_strptime_formatters():\n data = [\n [\"%a\", \"Weekday as locale's abbreviated name.\", \"Mon\"],\n [\"%A\", \"Weekday as locale's full name.\", \"Monday\"],\n [\"%w\", \"Weekday as a decimal number, where 0 is Sunday and 6 is Saturday.\", \"1\"],\n [\"%d\", \"Day of the month as a zero-padded decimal number.\", \"30\"],\n [\"%-d\", \"Day of the month as a decimal number. (Platform specific)\", \"30\"],\n [\"%b\", \"Month as locale's abbreviated name.\", \"Sep\"],\n [\"%B\", \"Month as locale's full name.\", \"September\"],\n [\"%m\", \"Month as a zero-padded decimal number.\", \"09\"],\n [\"%-m\", \"Month as a decimal number. (Platform specific)\", \"9\"],\n [\"%y\", \"Year without century as a zero-padded decimal number.\", \"13\"],\n [\"%Y\", \"Year with century as a decimal number.\", \"2013\"],\n [\"%H\", \"Hour (24-hour clock) as a zero-padded decimal number.\", \"07\"],\n [\"%-H\", \"Hour (24-hour clock) as a decimal number. (Platform specific)\", \"7\"],\n [\"%I\", \"Hour (12-hour clock) as a zero-padded decimal number.\", \"07\"],\n [\"%-I\", \"Hour (12-hour clock) as a decimal number. (Platform specific)\", \"7\"],\n [\"%p\", \"Locale's equivalent of either AM or PM.\", \"AM\"],\n [\"%M\", \"Minute as a zero-padded decimal number.\", \"06\"],\n [\"%-M\", \"Minute as a decimal number. (Platform specific)\", \"6\"],\n [\"%S\", \"Second as a zero-padded decimal number.\", \"05\"],\n [\"%-S\", \"Second as a decimal number. (Platform specific)\", \"5\"],\n [\"%f\", \"Microsecond as a decimal number, zero-padded on the left.\", \"000000\"],\n [\"%z\", \"UTC offset in the form +HHMM or -HHMM (empty string if the the object is naive).\", \"\"],\n [\"%Z\", \"Time zone name (empty string if the object is naive).\", \"\"],\n [\"%j\", \"Day of the year as a zero-padded decimal number.\", \"273\"],\n [\"%-j\", \"Day of the year as a decimal number. (Platform specific)\", \"273\"],\n [\"%U\", \"Week number of the year (Sunday as the first day of the week) as a zero padded decimal number. All days in a new year preceding the first Sunday are considered to be in week 0.\", \"39\"],\n [\"%W\", \"Week number of the year (Monday as the first day of the week) as a decimal number. All days in a new year preceding the first Monday are considered to be in week 0.\", \"39\"],\n [\"%c\", \"Locale's appropriate date and time representation.\", \"Mon Sep 30 07:06:05 2013\"],\n [\"%x\", \"Locale's appropriate date representation.\", \"09/30/13\"],\n [\"%X\", \"Locale's appropriate time representation.\", \"07:06:05\"],\n [\"%%\", \"A literal '%' character.\", \"%\"]\n ]\n\n display(HTML(\n '<table><tr>{}</tr></table>'.format(\n '</tr><tr>'.join(\n '<td>{}</td>'.format('</td><td>'.join(str(_) for _ in row)) for row in data)\n )\n ))","def split_date_string(date_string: str):\n try:\n units,_,epoch = date_string.split(None, 2)\n except ValueError:\n raise ValueError(f'Invalid format: {date_string}')\n else:\n return (units.lower(), parse(epoch))","def split_date_string(date_string: str):\n try:\n units,_,epoch = date_string.split(None, 2)\n except ValueError:\n raise ValueError(f'Invalid format: {date_string}')\n else:\n return (units.lower(), parse(epoch))","def parse_pattern(pattern: NumberPattern | str) -> NumberPattern:\n if isinstance(pattern, NumberPattern):\n return pattern\n\n def _match_number(pattern):\n rv = number_re.search(pattern)\n if rv is None:\n raise ValueError(f\"Invalid number pattern {pattern!r}\")\n return rv.groups()\n\n pos_pattern = pattern\n\n # Do we have a negative subpattern?\n if ';' in pattern:\n pos_pattern, neg_pattern = pattern.split(';', 1)\n pos_prefix, number, pos_suffix = _match_number(pos_pattern)\n neg_prefix, _, neg_suffix = _match_number(neg_pattern)\n else:\n pos_prefix, number, pos_suffix = _match_number(pos_pattern)\n neg_prefix = f\"-{pos_prefix}\"\n neg_suffix = pos_suffix\n if 'E' in number:\n number, exp = number.split('E', 1)\n else:\n exp = None\n if '@' in number and '.' in number and '0' in number:\n raise ValueError('Significant digit patterns can not contain \"@\" or \"0\"')\n if '.' in number:\n integer, fraction = number.rsplit('.', 1)\n else:\n integer = number\n fraction = ''\n\n def parse_precision(p):\n \"\"\"Calculate the min and max allowed digits\"\"\"\n min = max = 0\n for c in p:\n if c in '@0':\n min += 1\n max += 1\n elif c == '#':\n max += 1\n elif c == ',':\n continue\n else:\n break\n return min, max\n\n int_prec = parse_precision(integer)\n frac_prec = parse_precision(fraction)\n if exp:\n exp_plus = exp.startswith('+')\n exp = exp.lstrip('+')\n exp_prec = parse_precision(exp)\n else:\n exp_plus = None\n exp_prec = None\n grouping = parse_grouping(integer)\n return NumberPattern(pattern, (pos_prefix, neg_prefix),\n (pos_suffix, neg_suffix), grouping,\n int_prec, frac_prec,\n exp_prec, exp_plus, number)","def change_format_var_parser(text, tracker):\n param_names = format_var_parser(text)\n param_vars = {}\n for param_name in param_names:\n try:\n param_vars[param_name] = tracker.get_slot(param_name)\n except Exception as e:\n PYTHON_LOGGER.error(\"Error to get var name {}: {}\".format(param_name, e))\n return text.format(**param_vars)","def parse_argument_pattern(content: str) -> (ArgumentPattern, int):\n if len(content) == 0:\n raise PatternError(\"content may not be empty\")\n\n if content[0] not in \"[<\" or content[-1] not in \"]>\":\n raise PatternError(\"argument pattern must be wrapped in '[ ]' or '< >'\")\n\n open_brace = content[0]\n\n is_required = open_brace == \"<\"\n\n offset = 1\n\n names, size = __parse_names(content[offset::])\n offset += size\n\n is_positional = len(names) == 0\n\n ident, arg_num, size = __parse_var(content[offset::], is_positional)\n offset += size\n\n delim, size = __parse_delim(content[offset::])\n offset += size\n\n if (delim is not None and not (arg_num.quantifier == Quantifier.N and arg_num.count == 1\n or arg_num.quantifier == Quantifier.OPTIONAL)):\n raise PatternError(f\"Only arguments taking 1 or optional values may specify a delimiter\")\n\n try:\n if (close_brace := content[offset]) in \"]>\":\n if open_brace == \"<\" and close_brace != \">\" or open_brace == \"[\" and close_brace != \"]\":\n raise PatternError(f\"mismatching brace types, found '{open_brace}' and '{close_brace}'\")\n\n offset += 1\n else:\n raise PatternError(f\"expected '{']' if open_brace == '[' else '>'}' but found '{content[offset]}\")\n except IndexError as err:\n raise PatternError(f\"error parsing arguments pattern: {err}\")\n\n if is_positional and not is_required:\n raise PatternError(\"a positional argument may not be optional, you may specify either '?' or '*' as quantifiers\")\n\n if ident is None and len(names) > 0:\n ident = (max(names, key=lambda l: len(l)).lstrip('-')\n .upper().replace(\"-\", \"_\"))\n\n return ArgumentPattern(ident, arg_num, names, is_positional, is_required, delim), offset","def __format_management(self, index, matched):\n\n for _, case_data in self.format_cases.items():\n if int(index) in case_data[0]:\n # The regex number is into the currently read case data.\n\n # We return a list with the formatted elements.\n # 1. We convert the day to 2 digits.\n # 2. We convert the month to the unified format.\n # 3. We return the year.\n return [\n converter.Digit2Digits(matched[case_data[1][0]]).get_converted(),\n converter.Month(matched[case_data[1][1]]).get_converted(),\n str(matched[case_data[1][2]]),\n ]\n\n return matched # pragma: no cover","def unpack(fmt, data):\n fmt = _normalize(fmt)\n formatdef, endianness, i, alignment = _getmode(fmt)\n j = 0\n num = 0\n result = []\n length = calcsize(fmt)\n if length != len (data):\n raise StructError(\"unpack str size does not match format\")\n while i < len(fmt):\n num, i = _getnum(fmt, i)\n cur = fmt[i]\n i += 1\n try:\n format = formatdef[cur]\n except KeyError:\n raise StructError(\"%s is not a valid format\" % cur)\n\n if not num :\n num = 1\n\n if cur == 'x':\n j += num\n elif cur == 's':\n result.append(data[j:j + num])\n j += num\n elif cur == 'p':\n n = data[j]\n if n >= num:\n n = num - 1\n result.append(data[j + 1:j + n + 1])\n j += num\n else:\n # skip padding bytes until we get at a multiple of size\n if j > 0 and alignment:\n padding = format['size'] - j % format['size']\n j += padding\n for n in range(num):\n result += [format['unpack'](data, j, format['size'],\n endianness)]\n j += format['size']\n\n return tuple(result)","def getFormatList(base_url):\n\n\tquery_url = base_url + \"/formats\"\n\trequest = urllib2.urlopen(query_url)\n\tresponse = request.read()\n\tresponse_xml = ET.fromstring(response)\n\n\tfmt_list = {}\n\n\tformats = response_xml.findall(\".//objectFormat\")\n\n\tfor f in formats:\n\t\tfmt_identifier = f.find(\"formatId\").text\n\t\tfmt_name = f.find(\"formatName\").text\n\t\tfmt_type = f.find(\"formatType\").text\n\t\tfmt_path = makeValidFormatPath(fmt_name)\n\n\t\tfmt_list[fmt_identifier] = { \"formatId\" : fmt_identifier, \"formatName\" : fmt_name, \"formatType\" : fmt_type, \"formatPath\" : fmt_path }\n\n\treturn fmt_list","def parseStructuredData( raw_data, format ):\n\tparsed_data = {}\n\n\tBEGIN = 0\n\tEND = 1\n\tCONV = 2\n\n\tfor key in format.keys():\n\t\tkey_format = format[key]\n\n\t\tif key_format[END] == \"\":\n\t\t\tkey_format[END] = key_format[BEGIN] + len(raw_data)\n\n\t\ttxt = raw_data[key_format[BEGIN]:key_format[END]]\n\n\t\tif len(key_format[CONV]) > 0:\n\t\t\tparsed_data[key] = struct.unpack(key_format[CONV], txt)[0]\n\t\telse:\n\t\t\tparsed_data[key] = txt\n\n\treturn parsed_data","def GetFormatType(format_):\n\n formattype = format_\n bitsize = 0\n if isinstance(format_, str):\n match = re.search(r'\\s*(\\D+)', format_)\n if match:\n formattype = match.group(0)\n bitsize = struct.calcsize(formattype) * 8\n return formattype, bitsize","def makeNamesFromFormats(formats):\n i = getIter(formats)\n if not i:\n return\n\n try:\n c = 0\n item = i.next()\n while item:\n c = c +1\n name = 'c%s' % c\n if isinstance(item, str):\n yield name\n else:\n l = []\n for a in makeNamesFromFormats(item):\n l.append(a)\n yield (name, l)\n item = i.next()\n except StopIteration:\n pass","def guess_file_date_format(filename):\n for line in open(filename):\n try:\n format = guess_format(line)\n except CannotParse:\n pass\n else:\n return format\n\n raise CannotParse(\"No date/time strings found in '%s'\" % filename)","def read_fmt(bib_name, bib_file):\n cache_name, formatted_cache_name = _cache_name(bib_name, bib_file)\n\n try:\n meta_data, formatted_entries = cache.read_global(formatted_cache_name)\n except:\n raise cache.CacheMiss()\n\n # raise a cache miss if the modification took place after the caching\n modified_time = os.path.getmtime(bib_file)\n if modified_time > meta_data[\"cache_time\"]:\n raise cache.CacheMiss()\n\n # validate the version and format strings are still valid\n if (meta_data[\"version\"] != _VERSION or\n any(meta_data[s] != get_setting(\"cite_\" + s)\n for s in [\"panel_format\", \"autocomplete_format\"])):\n print(\"Formatting string has changed, updating cache...\")\n # read the base information from the unformatted cache\n current_time, bib_entries = cache.read_global(cache_name)\n # format and cache the entries\n formatted_entries = _create_formatted_entries(formatted_cache_name,\n bib_entries,\n current_time)\n\n return formatted_entries","def split_str(str):\n \n logger = logging.getLogger(__name__)\n \n logger.debug('{0}'.format(str))\n \n match = re.match(r\"([0-9]+.?\\d{0,32}?)(d|m|s)\", str)\n \n if match:\n items = match.groups()\n \n return items[0], items[1]","def getConverter( format ):\n\n data = set(format.split(\"-\"))\n\n if \"one\" in data:\n if \"forward\" in data:\n if \"closed\" in data:\n return __one_forward_closed \n else:\n return __one_forward_open\n else:\n if \"closed\" in data:\n return __one_both_closed\n else:\n return __one_both_open\n else:\n if \"forward\" in data:\n if \"closed\" in data:\n return __zero_forward_closed\n else:\n return __zero_forward_open\n else:\n if \"closed\" in data:\n return __zero_both_closed\n else:\n return __zero_both_open","def get_formatted_messages(formats, label, context):\r\n format_templates = {}\r\n for format in formats:\r\n # conditionally turn off autoescaping for .txt extensions in format\r\n if format.endswith(\".txt\"):\r\n context.autoescape = False\r\n format_templates[format] = render_to_string((\r\n 'notification/%s/%s' % (label, format),\r\n 'notification/%s' % format), context_instance=context)\r\n return format_templates","def getFormatsFromDescr(descr):\n i = getIter(descr)\n if not i:\n return\n\n try:\n item = i.next()\n while item:\n item1 = item[1]\n if isinstance(item1, str):\n yield normalize_format(item1)\n else:\n l = []\n for j in getFormatsFromDescr(item1):\n l.append(j)\n yield l\n item = i.next()\n except StopIteration:\n pass","def generate_logformat_regex(logformat):\n headers = []\n splitters = re.split(r'(<[^<>]+>)', logformat)\n regex = ''\n for k in range(len(splitters)):\n if k % 2 == 0:\n splitter = re.sub(' +', '\\\\\\s+', splitters[k])\n regex += splitter\n else:\n header = splitters[k].strip('<').strip('>')\n regex += '(?P<%s>.*?)' % header\n headers.append(header)\n regex = re.compile('^' + regex + '$')\n return headers, regex","def resolve_date_format(year, month, day, fail_safe=True):\n\n FAIL_SAFE_DEFAULT = \"%Y-%m-%d\"\n\n def order_terms_formats(fmt_str):\n # see date (1), 'O' (not '0') is a mystery, 'E' is Buddhist calendar, '(.*)'\n # is an arbitrary suffix\n field_spec_re = re.compile(r'([-_0OE^#]*)([yYmbBde])(.*)')\n\n # see date (1)\n fmt_str = fmt_str.replace(\"%F\", \"%Y-%m-%d\")\n\n # e.g. \"%d.%m.%Y\" -> ['d.', 'm.', 'Y']\n fields = fmt_str.split(\"%\")[1:]\n\n ordered_terms = []\n ordered_formats = []\n for field in fields:\n match = field_spec_re.match(field)\n if not match:\n # ignore fields we are not interested in (like %A for weekday name, etc.)\n continue\n\n prefix, item, suffix = match.groups()\n if item in (\"d\", \"e\"):\n # \"e\" is the same as \"_d\"\n ordered_terms.append(day)\n elif item in (\"Y\", \"y\"):\n # 4-digit year, 2-digit year\n ordered_terms.append(year)\n elif item in (\"m\", \"b\", \"B\"):\n # month number, short month name, long month name\n ordered_terms.append(month)\n\n # \"%\" + prefix + item gives a format for date/time formatting functions\n ordered_formats.append(_DateFieldSpec(\"%\" + prefix + item, suffix.strip()))\n\n if len(ordered_terms) != 3 or len(ordered_formats) != 3:\n raise ValueError(\"Not all fields successfully identified in the format '%s'\" % fmt_str)\n\n return (tuple(ordered_terms), tuple(ordered_formats))\n\n fmt_str = locale_mod.nl_langinfo(locale_mod.D_FMT)\n\n if not fmt_str or \"%\" not in fmt_str:\n if fail_safe:\n # use some sane default\n fmt_str = FAIL_SAFE_DEFAULT\n else:\n raise ValueError(\"Invalid date format string for current locale: '%s'\" % fmt_str)\n\n try:\n return order_terms_formats(fmt_str)\n except ValueError:\n if not fail_safe:\n raise\n else:\n # if this call fails too, something is going terribly wrong and we\n # should be informed about it\n return order_terms_formats(FAIL_SAFE_DEFAULT)","def _check_tokens_are_valid(format_string, message):\n named_tokens = re.findall(r\"{(\\w*)}\", format_string)\n invalid_tokens = [x for x in named_tokens if x.lower() not in _valid_tokens]\n if invalid_tokens:\n msg = message\n msg += \" [{0}]. \".format(\", \".join(invalid_tokens))\n msg += 'Did you check your \"modules.yaml\" configuration?'\n raise RuntimeError(msg)","def complete_opt_format(self, text, *_):\n return [t + \" \" for t in FORMATTERS if t.startswith(text)]","def _parse_data(data: str) -> Tuple[str, str, str, int, int, int, str]:\n\n phg = None\n rng = None\n dfs = None\n course = None\n speed = None\n altitude = None\n comment = None\n\n if re.match(r'^PHG[0-9]{4}', data[:7]):\n # Packet has a PHG (power, antenna height/gain/directivity) value\n phg = data[3:7]\n logger.debug(\"PHG is {}\".format(phg))\n data = data[7:]\n\n elif re.match('^RNG[0-9]{4}', data[:7]):\n # Packet has an RNG (radio range) value\n rng = data[3:7]\n logger.debug(\"RNG is {}\".format(rng))\n data = data[7:]\n\n elif re.match('^DFS[0-9]{4}', data[:7]):\n # Packet has a DFS (DF signal strength, antenna height/gain/directivity) value\n dfs = data[3:7]\n logger.debug(\"DFS is {}\".format(dfs))\n data = data[7:]\n\n elif re.match('^[0-9]{3}/[0-9]{3}', data[:7]):\n # Packet has course and speed values\n course = int(data[:3])\n speed = int(data[4:7])\n logger.debug(\"Course is {}, speed is {}\".format(course, speed))\n data = data[7:]\n\n # TODO - parse BRG/NRQ\n\n # Check for comment\n if len(data) > 0:\n\n # Check for altitude\n # As per APRS 1.01 C6 P26, altitude as /A=nnnnnn may appear anywhere in the comment\n has_altitude = re.match('.*/A=([0-9]{6}).*', data)\n if has_altitude:\n # TODO - fix altitude format\n altitude = int(has_altitude.groups()[0])\n logger.debug(\"Altitude is {} ft\".format(altitude))\n\n # Strip out the altitude from the comment\n data = re.sub(r'/A=[0-9]{6}', \"\", data)\n\n # Set the comment as the remainder of the information field\n comment = data\n logger.debug(\"Comment is {}\".format(comment))\n\n return (phg, rng, dfs, course, speed, altitude, comment)","def valueformat(value, format_list):\n\n # print(\"\\n\", format_list, value)\n concat_key = format_list.split('.')\n # Pass in either the key of the field\n # or pass in resource.key to enable a resource lookup.\n key = \"\"\n resource = \"\"\n member_id = \"\"\n key_sequence = [key, resource, member_id]\n count = 0\n for r in reversed(concat_key):\n key_sequence[count] = r\n count += 1\n\n # print(\"Concat_key:\", concat_key)\n key = key_sequence[0]\n resource = key_sequence[1]\n member_id = key_sequence[2]\n\n # print(\"Key:\", key)\n\n if key:\n if key.lower() == \"address\":\n return dt_address(value)\n\n elif key.lower() == \"telecom\":\n return dt_telecom(value)\n\n elif key.lower() == \"name\":\n return dt_name(value)\n elif key.lower() == 'dosage':\n return dt_dosage(value)\n elif key.lower() == 'medicationreference':\n # print(\"Working on\", key, \": \", value)\n # f_value = value\n # lookup field_formats\n # concat_key should have a resource name\n # print(\"\\n\\nRESOURCE:\", resource)\n # print(\"calling dt_medicationreference with Resource:\", resource, \", value:\", value)\n return dt_medicationreference(value, member_id, resource)\n elif key.lower() == 'dataabsentreason':\n if isinstance(value, dict):\n return value['coding'][0]['display']\n else:\n return value\n elif key.lower() == 'valuequantity':\n # return str(value['value']) + \" \" + value['unit']\n return dt_valuequantity(value)\n elif key.lower() == 'valuestring':\n return value\n elif key.lower() == 'interpretation':\n return value['coding'][0]['display']\n elif key.lower() == 'referencerange':\n return dt_referencerange(value)\n elif key.lower() == 'requester':\n if 'display' in value['agent']:\n return dt_reference(value['agent'], member_id)\n elif key.lower() == 'practitioner':\n if 'display' in value:\n return dt_reference(value, member_id)\n elif key.lower() == 'organization':\n if 'display' in value:\n return dt_reference(value, member_id)\n # elif key.lower() == \"result\":\n # return dt_reference(value[0], member_id)\n elif key.lower() == 'practitioner':\n if 'display' in value:\n return dt_reference(value, member_id)\n elif key.lower() == 'organization':\n if 'display' in value:\n return dt_reference(value, member_id)\n elif key.lower() == 'participant':\n if 'display' in value[0]['individual']:\n return dt_reference(value[0]['individual'], member_id)\n elif key.lower() == 'location':\n if 'display' in value[0]['location']:\n return dt_reference(value[0]['location'], member_id)\n elif key.lower() == 'communication':\n return dt_communication(value)\n else:\n # print(\"value:\", value, \" type:\", type(value), \" for: \", key)\n return value","def is_valid_format(format_string): \n # default\n is_valid = True\n \n # list of valid formats\n valid_formats = ['hex', 'char', 'schar','uint', 'int', 'double', \n 'ascii', 'long', 'long long', 'float']\n \n # list of formats provided (may be a single format)\n format_list = format_string.split(', ')\n \n # check each item in the provided list\n for item in format_list:\n \n # if it does not match a valid format then it is invalid\n if item not in valid_formats:\n is_valid = False\n # end if\n # end for\n \n return is_valid","def build_block(self, format_string):\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\n block = first_block\n\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n value = token.group(0)\n if token.group(\"block_start\"):\n # Create new block\n block = block.new_block()\n elif token.group(\"block_end\"):\n # Close block setting any valid state as needed\n # and return to parent block to continue\n if not block.parent:\n raise Exception(\"Too many `]`\")\n block = block.parent\n elif token.group(\"switch\"):\n # a new option has been created\n block = block.switch()\n elif token.group(\"placeholder\"):\n # Found a {placeholder}\n key = token.group(\"key\")\n format = token.group(\"format\")\n block.add(Placeholder(key, format))\n elif token.group(\"literal\"):\n block.add(Literal(value))\n elif token.group(\"lost_brace\"):\n # due to how parsing happens we can get a lonesome }\n # eg in format_string '{{something}' this fixes that issue\n block.add(Literal(value))\n elif token.group(\"command\"):\n # a block command has been found\n block.set_commands(token.group(\"command\"))\n elif token.group(\"escaped\"):\n # escaped characters add unescaped values\n if value[0] in [\"\\\\\", \"{\", \"}\"]:\n value = value[1:]\n block.add(Literal(value))\n\n if block.parent:\n raise Exception(\"Block not closed\")\n # add to the cache\n self.block_cache[format_string] = first_block","def parser(string: str, token: str) -> List[float]:\n search_token = re.compile(r\"{token}: (.*?){unit}\".format(token=token,\n unit=UNIT))\n output = re.findall(search_token, string)\n if len(output) == 0:\n return []\n\n return [float(i) for i in output]","def parseConfig(f):\n config = {\"formats\":{}}\n \n for line in f:\n if line.startswith(\"//\"): \n continue\n \n sline = re.split(\"[=\\s]\", line)\n if sline[0] is \"\":\n continue\n \n if sline[0]==\"format\":\n #Puts the format as a key in the dict pointed to by \"formats\"\n config[\"formats\"][sline[1]] = sline[3] \n else:\n config[sline[0]] = sline[1]\n \n return config","def interpret_datetime(timestamp):\n formats = (\n \"%Y-%m-%d_%H:%M:%S.%f\",\n \"%Y-%m-%d_%H-%M-%S-%f\",\n DATE_FORMAT,\n )\n\n for i, fmt in enumerate(formats):\n try:\n return datetime.strptime(timestamp, fmt)\n except ValueError:\n if i == len(formats) - 1:\n raise\n continue","def select_stylestrs(cfgstr):\n stylestrs = []\n for s in cfgstr.split():\n if s in vars(fmt):\n stylestrs.append(s)\n return stylestrs","def __format_input_translator(str_to_process):\n return re.sub(r'\\([^)]*\\)', '', str_to_process).replace(' ', '').split('/')","def _prepare_to_convert(coordinates: str) -> tuple:\n degrees, minutes, seconds = True, True, True\n\n if coordinates == coordinates.replace(\"°\", \" \"): degrees = False\n if coordinates == coordinates.replace(\"′\", \" \"): minutes = False\n if coordinates == coordinates.replace(\"″\", \" \"): seconds = False\n\n coordinates = coordinates.replace(\"°\", \" \").replace(\"′\", \" \").replace(\"″\", \" \").split(\" \")\n del (coordinates[-1])\n\n if seconds is False: coordinates.append(0)\n if minutes is False: coordinates.insert(0, 1)\n if degrees is False: coordinates.insert(0, 0)\n\n for i in range(len(coordinates)):\n coordinates[i] = float(coordinates[i])\n return tuple(coordinates)","def parse_date(date_string, format):\n try:\n return datetime.strptime(date_string, format)\n except ValueError:\n return None","def get_color_names(self, format_string):\n names = set()\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"command\"):\n name = dict(parse_qsl(token.group(\"command\"))).get(\"color\")\n if (\n not name\n or name in COLOR_NAMES_EXCLUDED\n or name in COLOR_NAMES\n or name[0] == \"#\"\n ):\n continue\n names.add(name)\n return names","def parsePercentExpression(literal, format):\n\tmat = _getREForPercentExpression(format).match(literal)\n\tif not mat:\n\t\traise ValueError(\"'%s' cannot be parsed using format '%s'\"%(\n\t\t\tliteral, format))\n\treturn mat.groupdict()","def read_f(self, fmt, offset=None):\n\n if offset is not None:\n self.seek(offset)\n\n # place commas before and after each instance of S or Z\n for special in ['S', 'Z']:\n fmt = fmt.replace(special, ',' + special + ',')\n\n # split S and Z into isolated strings\n fmt = fmt.split(',')\n\n # construct a tuple of unpacked data\n data = ()\n for subfmt in fmt:\n if subfmt == 'S':\n data += (self.read_string(),)\n elif subfmt == 'Z':\n data += (self.read_bool(),)\n else:\n data += self.read_and_unpack(subfmt)\n\n if len(data) == 1:\n return data[0]\n else:\n return data","def asformat(self, format):","def format_input(self, args):\n\n new_list = []\n if args[1].find('{') != -1:\n new_list = self.format_dicti(args)\n return new_list\n else:\n new_list = []\n new_list.append(args[0])\n new_str = args[1][ args[1].find('(') + 2 : args[1].find(',') - 1]\n new_str += args[1][ args[1].find(',') : args[1].find(')') - 0]\n new_list.append(\" \".join(new_str.split(\", \") ) )\n\n return \" \".join(i for i in new_list)","def parse_spans(span_string):\n spans = []\n for span in span_string.split(';'):\n start, end = span.split(' ')\n spans.append((int(start), int(end)))\n return spans","def parse_spans(span_string):\n spans = []\n for span in span_string.split(';'):\n start, end = span.split(' ')\n spans.append((int(start), int(end)))\n return spans","def format(self, varnames, fmts):\n varnames = self._find_vars(varnames, empty_ok=False)\n indexes = list(map(self._varlist.index, varnames))\n \n # check that fmts are specified properly\n if isinstance(fmts, str):\n fmts = fmts.split()\n else:\n if ( not isinstance(fmts, collections.Iterable) \n or not all(isinstance(f, str) for f in fmts) ):\n raise TypeError(\"given fmts must be str or iterable of str\")\n fmts = [x for s in fmts for x in s.split()]\n if len(fmts) == 0:\n raise ValueError(\"no formats specified\")\n \n # check fmts for validity\n is_valid = self._is_valid_fmt\n if not all(is_valid(fmt) for fmt in fmts):\n bad_fmts = \" \".join(fmt for fmt in fmts if not is_valid(fmt))\n raise ValueError(\"invalid formats: \" + bad_fmts)\n \n # pad fmts if necessary \n nvarnames = len(varnames)\n nfmts = len(fmts)\n if nfmts < nvarnames:\n fmts = list(fmts) + [fmts[-1]]*(nvarnames - nfmts)\n \n # check that formats match Stata types\n #typlist = self._typlist\n isstrvar = self._isstrvar\n if not all(isstrvar(i) == bool(STR_FMT_RE.match(fmt))\n for i, fmt in zip(indexes, fmts)):\n raise ValueError(\"format does not match Stata variable type\")\n \n # replace fmts (extras, if any, don't get used)\n for i, fmt in zip(indexes, fmts):\n self._fmtlist[i] = fmt\n \n # assume there are changes\n self._changed = True","def _string_to_date(datestr,fmt):\n if not isinstance(datestr,str):\n raise InstrumentParameterException('Value %s is not a string.' % str(datestr))\n try:\n date_time = time.strptime(datestr,fmt)\n date = (date_time[2],date_time[1],date_time[0])\n\n except ValueError:\n raise InstrumentParameterException('Value %s could not be formatted to a date.' % str(datestr))\n \n return date","def try_parsing_date(text):\n for fmt in ('%I %p', '%I %M %p', '%I:%M %p'):\n try:\n return datetime.datetime.strptime(text, fmt)\n except ValueError:pass\n if \":\" in text:\n return datetime.datetime.strptime(text+\" \"+\n (\"AM\" if int(text.split(\":\")[0])>=8 else \"PM\"), '%I:%M %p')\n return datetime.datetime.strptime(text+\" \"+\n (\"AM\" if int(text)>=8 else \"PM\"), '%I %p')","def parseTime(string):\t\n \n if string == \"\":\n result = None\n if 'T' in string:\n string = string.replace('T', ' ')\n if 'Z' in string:\n string = string.replace('Z', '') \n\n if len(string) < 19:\n # string has some single digits\n p = \"\"\"^([0-9]{4})-([0-9]{1,2})-([0-9]{1,2}) \n ([0-9]{1,2}):([0-9]{1,2}):([0-9]{1,2}).*$\"\"\"\n s = re.findall(p, string)\n if len(s) > 0:\n string = '{0}-{1:02d}-{2:02d} {3:02d}:{4:02d}:{5:02d}'\\\n .format(*[int(x) for x in s[0]])\n\n for date_format in DATE_FORMATS:\n try:\n result = datetime.datetime.strptime(string, date_format)\n except ValueError:\n pass\n\n return result","def parseDate(date):\n formats = [\n \"D MMM YY, hh:mm a\", \n \"YYYY-MM-DDTHH:mm:ss+00:00\", \n \"ddd, D MMM YYYY HH:mm:ss +0530\", # NDTV\n \"ddd, D MMM YYYY HH:mm:ss +0100\", # skynews\n \"ddd, D MMM YYYY HH:mm:ss -0400\", # reuters\n \"D MMM, YYYY\", # espn cricket\n \"ddd, D MMM YYYY HH:mm:ss GMT\", # times of india\n \"ddd, D MMM YYYY HH:mm:ss +0200\", # lifrea\n \"ddd, D MMM YYYY HH:mm:ss +0000\", # linux, ubuntu\n \"ddd, D MMM YYYY HH:mm:ss -0700\", # iTunes\n ]\n\n for f in formats:\n try:\n parsed_date = tryDateFormat(date, f)\n return parsed_date.format(\"D MMM YY, hh:mm a\")\n except Exception as e:\n pass\n else:\n return \"Invalid date\"","def get_format_opts(cls, format_=\"value\", fields=[]):\n return \" -f {0} {1}\".format(format_, \" \".join([\"-c \" + it for it in fields]))","def get_parameter(pstring):\n parameters = pstring.replace(',', ' ').split()\n if len(parameters) == 1:\n init_value = float(parameters[0])\n return (init_value, None, None)\n elif len(parameters) == 3:\n init_value = float(parameters[0])\n if parameters[1].upper() == 'NONE':\n lower_value = None\n else:\n lower_value = float(parameters[1])\n if parameters[2].upper() == 'NONE':\n upper_value = None\n else:\n upper_value = float(parameters[2])\n return (init_value, lower_value, upper_value)\n else:\n raise ValueError('Invalid parameter format: %s' % pstring)","def register_format(recipe):\n afr = AFMFormatRecipe(recipe)\n formats_available.append(afr)\n # suffix\n if afr.suffix not in formats_by_suffix:\n formats_by_suffix[afr.suffix] = []\n formats_by_suffix[afr.suffix].append(afr)\n # mode\n if afr.mode not in formats_by_mode:\n formats_by_mode[afr.mode] = []\n formats_by_mode[afr.mode].append(afr)\n # supported extensions\n if afr.suffix not in supported_extensions: # avoid duplucates\n supported_extensions.append(afr.suffix)\n supported_extensions.sort()","def findall(pattern, text):\r\n\tspl = re.compile(pattern).split(text)\r\n\tresult = []\r\n\tbeginTag = \"\"\r\n\tendTag = None\r\n\tbeginFormat = \"\"\r\n\tendFormat = \"\"\r\n\tinitText = text\r\n\tfor s in spl:\r\n\t\ttext = text[len(s)+2:]\r\n\t\tend = text.find(\")s\")\r\n\t\tvar = \"\"\r\n\t\tif len(text) > 0:\r\n\t\t\tvar = text[:end]\r\n\t\t\tresult.append(var)\r\n\t\tif var == \"content\":\r\n\t\t\tbeginTag += s\r\n\t\t\tendTag = \"\"\r\n\t\telif endTag != None:\r\n\t\t\tendTag += s\r\n\t\t\tif var != \"\":\r\n\t\t\t\tif var in [\"disabled\",\"checked\",\"active\",\"selected\"]:\r\n\t\t\t\t\tendFormat += \" b'%s' if self.%s else b'',\"%(var, var)\r\n\t\t\t\telse:\r\n\t\t\t\t\tendFormat += \"self.%s,\"%var\r\n\t\t\t\tendTag += \"\\x25s\"\r\n\t\telse:\r\n\t\t\tbeginTag += s\r\n\t\t\tif var != \"\":\r\n\t\t\t\tif var in [\"disabled\",\"checked\",\"active\",\"selected\"]:\r\n\t\t\t\t\tbeginFormat += \" b'%s' if self.%s else b'',\"%(var, var)\r\n\t\t\t\telse:\r\n\t\t\t\t\tbeginFormat += \"self.%s,\"%var\r\n\t\t\t\tbeginTag += \"\\x25s\"\r\n\t\ttext = text[end+2:]\r\n\tif endTag == None:\r\n\t\tendTag = \"\"\r\n\t\tendFormat = \"\"\r\n\treturn result, beginTag, endTag, beginFormat, endFormat"],"string":"[\n \"def update_placeholder_formats(self, format_string, placeholder_formats):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if (\\n token.group(\\\"placeholder\\\")\\n and (not token.group(\\\"format\\\"))\\n and token.group(\\\"key\\\") in placeholder_formats\\n ):\\n output.append(f\\\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\\\")\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def read_atom_data(atom_format, line):\\n if atom_format is None:\\n _format = [guess_string_format(i.strip()) for i in line.split()]\\n else:\\n _format = atom_format\\n formatted = []\\n for i, (val, fmti) in enumerate(zip(line.split(), _format)):\\n istrip = val.strip()\\n try:\\n formatted.append(fmti(istrip))\\n except ValueError:\\n fmt = guess_string_format(istrip)\\n _format[i] = fmt\\n formatted.append(fmt(istrip))\\n return formatted, _format\",\n \"def _parse(self, fmtstr):\\n def _match_brace(string, start_pos, pair='[]'):\\n \\\"\\\"\\\"Pairing brackets (used internally in _parse method)\\\"\\\"\\\"\\n depth = 1\\n if string[start_pos] != pair[0]:\\n return None\\n for index, char in enumerate(string[start_pos + 1:]):\\n if char == pair[0]:\\n depth += 1\\n elif char == pair[1]:\\n depth -= 1\\n if depth == 0:\\n return start_pos + index + 1\\n return None\\n\\n #----------------------------------------------------------------------\\n\\n t_fmt = self.__class__._T_FMT\\n t_prefix = self.__class__._T_PREFIX\\n\\n ptr = 0\\n # it seems that field id 0 is invalid\\n field_id = 1\\n length = len(fmtstr)\\n parsed_list = []\\n\\n while ptr < length:\\n parsed = {}\\n m_prefix = t_prefix.match(fmtstr[ptr:])\\n if m_prefix:\\n ptr += _get_length_of_match(m_prefix)\\n parsed['prefix'] = m_prefix.group(1)\\n\\n # check if we have a nested structure\\n if m_prefix.group(2):\\n brace_offset = _match_brace(fmtstr, ptr - 1)\\n\\n # bracket not match\\n if not brace_offset:\\n raise BadFormatString(\\n 'Unmatched brace on position {0}'.format(ptr)\\n )\\n parsed['field_id'] = field_id\\n parsed['field_type'] = 'a'\\n parsed['subcontent'] = self._parse(\\n fmtstr[ptr:brace_offset]\\n )\\n ptr = brace_offset + 1\\n field_id += 1\\n\\n parsed_list.append(parsed)\\n continue\\n m_fmt = t_fmt.match(fmtstr[ptr:])\\n if m_fmt:\\n ptr += _get_length_of_match(m_fmt)\\n\\n # fmt is an alias\\n if m_fmt.group(2):\\n parsed['field_type'] = self.__class__\\\\\\n .FIELD_ALIAS[m_fmt.group(2)]\\n # fmt is an actual field type\\n elif m_fmt.group(1):\\n parsed['field_type'] = m_fmt.group(1)\\n\\n # save field id\\n parsed['field_id'] = field_id\\n\\n # check for type clones (e.g. `v3')\\n if m_fmt.group(3):\\n parsed['repeat'] = int(m_fmt.group(3))\\n field_id += int(m_fmt.group(3))\\n else:\\n parsed['repeat'] = 1\\n field_id += 1\\n\\n parsed_list.append(parsed)\\n\\n else:\\n raise BadFormatString(\\n 'Invalid token on position {0}'.format(ptr)\\n )\\n\\n # all set\\n return parsed_list\",\n \"def get_placeholders(self, format_string):\\n placeholders = set()\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"placeholder\\\"):\\n placeholders.add(token.group(\\\"key\\\"))\\n elif token.group(\\\"command\\\"):\\n # get any placeholders used in commands\\n commands = dict(parse_qsl(token.group(\\\"command\\\")))\\n # placeholders only used in `if`\\n if_ = commands.get(\\\"if\\\")\\n if if_:\\n placeholders.add(Condition(if_).variable)\\n return placeholders\",\n \"def tokens(self, format_string):\\n if format_string not in self.format_string_cache:\\n tokens = list(re.finditer(self.reg_ex, format_string))\\n self.format_string_cache[format_string] = tokens\\n return self.format_string_cache[format_string]\",\n \"def parse_name_and_type_from_fmt_str(\\n formatted_str: str,\\n allowed_types: Optional[Dict[str, Component]] = None\\n) -> Generator[Tuple[str, Type[Field]], None, None]:\\n for _, arg_name, _type_name, _ in Formatter().parse(formatted_str):\\n if arg_name is not None:\\n try:\\n assert _type_name is not None\\n _type = (\\n allowed_types[_type_name] if allowed_types is not None\\n and _type_name in allowed_types\\n else getattr(pyopenapi3.data_types, _type_name)\\n )\\n yield arg_name, _type\\n except AttributeError:\\n raise ValueError(\\n \\\"A non-`Field` or `OpenApiObject` type was found. \\\"\\n f\\\"Can't use `{_type_name}` as a type in {formatted_str}. \\\"\\n f\\\"Must be a stringified pyopenapi3 `data_type`, such \\\"\\n f\\\"as `pyopenapi3.data_types.String`, or a reference to a \\\"\\n f\\\"Component.\\\"\\n ) from None\",\n \"def parse(string, format):\\n # Count the number of spaces in the format string (N), and\\n # truncate everything after the (N+1)th space\\n spaces = format.count(' ') + 1\\n string = ' '.join(string.split()[:spaces])\\n\\n try:\\n result = dt.datetime.strptime(string, format)\\n except ValueError, err:\\n raise CannotParse(str(err))\\n else:\\n return result\",\n \"def formatted(s):\\n matches = re.findall(_format_re, normalize(s))\\n if len(matches) == 1 and matches[0][0] != '':\\n return matches[0][0]\\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\\n if txt_none != '':\\n return FORMAT_NONE, txt_none\\n elif txt_sw != '':\\n return FORMAT_SW, txt_sw\\n elif txt_rem != '':\\n return FORMAT_REM, txt_rem\\n elif txt_em != '':\\n return FORMAT_EM, txt_em\\n elif txt_a != '':\\n return FORMAT_A, txt_a\\n return [to_fmt(*m) for m in matches]\",\n \"def parse_format(var_sample):\\n # ugh\\n ret = []\\n # Parsing format information\\n # Need to see what all these could be...\\n if None in var_sample[\\\"GT\\\"]:\\n ret.append(3)\\n elif var_sample[\\\"GT\\\"] == (0, 0):\\n ret.append(0)\\n elif var_sample[\\\"GT\\\"] == (0, 1):\\n ret.append(1)\\n elif var_sample[\\\"GT\\\"] == (1, 1):\\n ret.append(2)\\n \\n ret.extend([var_sample[\\\"GQ\\\"] if var_sample[\\\"GQ\\\"] is not None else 0,\\n var_sample[\\\"OV\\\"],\\n var_sample[\\\"DP\\\"], # be careful these aren't '.'\\n #split where _r is ref-allele and _a is alt-allele\\n var_sample[\\\"AD\\\"][0],\\n var_sample[\\\"AD\\\"][1],\\n var_sample[\\\"PDP\\\"],\\n var_sample[\\\"PAD\\\"][0],\\n var_sample[\\\"PAD\\\"][1],\\n var_sample[\\\"US\\\"][0],\\n var_sample[\\\"US\\\"][1],\\n var_sample[\\\"DS\\\"][0],\\n var_sample[\\\"DS\\\"][1],\\n var_sample[\\\"UC\\\"][0],\\n var_sample[\\\"UC\\\"][1],\\n var_sample[\\\"DC\\\"][0],\\n var_sample[\\\"DC\\\"][1],\\n var_sample[\\\"UDC\\\"][0],\\n var_sample[\\\"UDC\\\"][1],\\n var_sample[\\\"UCC\\\"][0],\\n var_sample[\\\"UCC\\\"][1],\\n var_sample[\\\"DDC\\\"][0],\\n var_sample[\\\"DDC\\\"][1],\\n var_sample[\\\"DCC\\\"][0],\\n var_sample[\\\"DCC\\\"][1],\\n var_sample[\\\"UMO\\\"][0],\\n var_sample[\\\"UMO\\\"][1],\\n var_sample[\\\"DMO\\\"][0],\\n var_sample[\\\"DMO\\\"][1],\\n var_sample[\\\"UXO\\\"][0],\\n var_sample[\\\"UXO\\\"][1],\\n var_sample[\\\"DXO\\\"][0],\\n var_sample[\\\"DXO\\\"][1],\\n var_sample[\\\"NR\\\"][0],\\n var_sample[\\\"NR\\\"][1],\\n var_sample[\\\"MO\\\"][0],\\n var_sample[\\\"MO\\\"][1],\\n var_sample[\\\"XO\\\"][0],\\n var_sample[\\\"XO\\\"][1],\\n var_sample[\\\"XC\\\"][0],\\n var_sample[\\\"XC\\\"][1],\\n var_sample[\\\"AC\\\"][0],\\n var_sample[\\\"AC\\\"][1],\\n var_sample[\\\"MC\\\"][0],\\n var_sample[\\\"MC\\\"][1],\\n var_sample[\\\"EC\\\"][0],\\n var_sample[\\\"EC\\\"][1],\\n var_sample[\\\"PL\\\"][0] if var_sample[\\\"PL\\\"][0] is not None else 0,\\n var_sample[\\\"PL\\\"][1] if var_sample[\\\"PL\\\"][0] is not None else 0,\\n var_sample[\\\"PL\\\"][2] if var_sample[\\\"PL\\\"][0] is not None else 0])\\n return ret\\n #END\",\n \"def convert_raw_tuple(value_tuple, format_string):\\n values = []\\n for v, c in zip(value_tuple, format_string):\\n if v is None:\\n # append None\\n values.append(v)\\n elif c == u\\\"s\\\":\\n # string\\n values.append(v)\\n elif c == u\\\"S\\\":\\n # string, split using space as delimiter\\n values.append([s for s in v.split(u\\\" \\\") if len(s) > 0])\\n elif c == u\\\"i\\\":\\n # int\\n values.append(int(v))\\n elif c == u\\\"U\\\":\\n # Unicode\\n values.append(convert_unicode_field(v))\\n elif c == u\\\"A\\\":\\n # ASCII\\n values.append(convert_ascii_field(v))\\n #elif c == u\\\"x\\\":\\n # # ignore\\n # pass\\n return tuple(values)\",\n \"def guess_format(string):\\n format_regexps = _compiled_format_regexps(_date_formats, _time_formats)\\n for format, regexp in format_regexps:\\n if regexp.search(string):\\n return format\\n # Nothing matched\\n raise CannotParse(\\\"Could not guess date/time format in: %s\\\" % string)\",\n \"def _translate_fmts(self):\\n fmt_info = []\\n fmt_append = fmt_info.append\\n \\n isvalid = self._is_valid_fmt\\n typlist = self._typlist\\n isstrvar = self._isstrvar\\n default_fmts = self._default_fmts\\n \\n for i, fmt in enumerate(self._fmtlist):\\n fmt = fmt.strip()\\n \\n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\\n \\n if iscalendar or not isvalid(fmt):\\n if isstrvar(i):\\n wid = min(typlist[i], 10)\\n fmt_append(('s', \\\"{{:>{}s}}\\\".format(wid), wid))\\n continue\\n else:\\n fmt = default_fmts[typlist[i]]\\n \\n last_char = fmt[-1]\\n if last_char == 's': # string\\n m = STR_FMT_RE.match(fmt)\\n align, _, wid = m.group(1), m.group(2), m.group(3)\\n new_align = (\\\"<\\\" if align == \\\"-\\\" \\n else \\\"^\\\" if align == \\\"~\\\" else \\\">\\\")\\n new = \\\"\\\".join((\\\"{:\\\", new_align, wid, \\\"s}\\\"))\\n fmt_append(('s', new, int(wid)))\\n elif last_char == 'H' or last_char == 'L': # binary\\n fmt_append((last_char, fmt, int(fmt[1:-1])))\\n elif last_char == 'x': # hexadecimal\\n fmt_append(('x', fmt, 21))\\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\\n m = NUM_FMT_RE.match(fmt)\\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \\n m.group(3), m.group(4),\\n m.group(5), m.group(6),\\n m.group(7))\\n aln = \\\"<\\\" if align == \\\"-\\\" else \\\">\\\"\\n sep = \\\",\\\" if com is not None else \\\"\\\"\\n if type == \\\"g\\\" and int(prec) == 0:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, type, \\\"}\\\"))\\n else:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, \\\".\\\", prec, type, \\\"}\\\"))\\n fmt_append((type, new, int(wid), delim, com))\\n \\n return fmt_info\",\n \"def _parse_date_format( fmp_database ):\\n\\tdef build_one( stamp ):\\n\\t\\treturn stamp.\\\\\\n\\t\\t replace( 'yyyy', '%Y' ).\\\\\\n\\t\\t replace( 'MM', '%m' ).\\\\\\n\\t\\t replace( 'dd', '%d' ).\\\\\\n\\t\\t replace( 'HH', '%H' ).\\\\\\n\\t\\t replace( 'mm', '%M' ).\\\\\\n\\t\\t replace( 'ss', '%S' )\\n\\n\\treturn {\\n\\t\\t'date': build_one( fmp_database.get('date-format', '') ),\\n\\t\\t'timestamp': build_one( fmp_database.get('timestamp-format', '') ),\\n\\t\\t'time': build_one( fmp_database.get('time-format', '') ),\\n\\t}\",\n \"def initFormat(self):\\n self.formatList = self.splitText(self.format)\",\n \"def formatLookup(format_str):\\n pat = '(\\\\d+)([A-Z])'\\n match = re.search(pat, format_str)\\n #print match.group()\\n \\n data_len = int(match.group(1))\\n data_fmt = str(match.group(2))\\n np_fmt = fitsFormatLookup(data_fmt)\\n np_dtype = '%i%s'%(data_len, np_fmt)\\n \\n return np_dtype, data_len, np_fmt\",\n \"def find_time(string, format):\\n re_format = format\\n for key, value in six.iteritems(REGEX):\\n re_format = re_format.replace(key, value)\\n matches = re.finditer(re_format, string)\\n for match in matches:\\n try:\\n matchstr = string[slice(*match.span())]\\n dt = datetime.strptime(matchstr, format)\\n except ValueError:\\n continue\\n else:\\n yield dt\",\n \"def parse(timestring):\\n for parser in _PARSERS:\\n match = parser['pattern'].match(timestring)\\n if match:\\n groups = match.groups()\\n ints = tuple(map(int, groups))\\n time = parser['factory'](ints)\\n return time\\n\\n raise TimeError('Unsupported time format {}'.format(timestring))\",\n \"def load(fmt: str, stream: BytesIO, _unpack=unpack):\\n values = []\\n bitcount = bits = 0\\n for char in fmt:\\n if char == '?':\\n if not bitcount:\\n bits = _unpack('>B', _read(stream, 1))[0]\\n bitcount = 8\\n value = (bits & 1) == 1\\n bits >>= 1\\n bitcount -= 1\\n else:\\n bitcount = bits = 0\\n if char == 'B':\\n value = _unpack('>B', _read(stream, 1))[0]\\n elif char == 'H':\\n value = _unpack('>H', _read(stream, 2))[0]\\n elif char == 'L':\\n value = _unpack('>L', _read(stream, 4))[0]\\n elif char == 'Q':\\n value = _unpack('>Q', _read(stream, 8))[0]\\n elif char == 's':\\n length = _unpack('>B', _read(stream, 1))[0]\\n value = _unpack('>%ss' % length, _read(stream, length))[0]\\n value = value.decode('utf-8', 'surrogatepass')\\n elif char == 'S':\\n length = _unpack('>L', _read(stream, 4))[0]\\n value = _unpack('>%ss' % length, _read(stream, length))[0]\\n value = value.decode('utf-8', 'surrogatepass')\\n elif char == 't':\\n timestamp = _unpack('>Q', _read(stream, 8))[0]\\n value = datetime.utcfromtimestamp(timestamp)\\n elif char == 'T':\\n value = {}\\n length = _unpack('>L', _read(stream, 4))[0]\\n stream2 = BytesIO(_read(stream, length))\\n while stream2.tell() < length:\\n key = load('s', stream2)[0]\\n value[key] = _load_item(stream2)\\n elif char != '?':\\n raise ValueError('wrong format char', char)\\n values.append(value)\\n return values\",\n \"def parseSettings (formatStr):\\n # split string\\n fmt = formatStr.split ('.')\\n if len (fmt) < 0:\\n return (None, None)\\n \\n # find encoder\\n encoderInstance = None\\n for e in _registeredEncoders:\\n if len (fmt) > 0:\\n if e.name () == fmt[0]:\\n encoderInstance = e\\n break\\n else:\\n encoderInstance = _registeredEncoders[0] if len (_registeredEncoders) > 0 else None\\n\\n # return tuple with parsed settings\\n presetName = '.'.join (fmt[1:])\\n if presetName in (None, \\\"\\\"):\\n if encoderInstance != None:\\n presetName = encoderInstance.defaultPreset ()\\n return (encoderInstance, presetName)\",\n \"def parse(self, s):\\n\\n segments = self.compiled.split(self._whitespace.sub(\\\" \\\", s))\\n literals = segments[::2]\\n raw = segments[1::2]\\n\\n if not raw:\\n return []\\n\\n case = list(map(str.casefold, raw))\\n prefixes = [{}] + [dict(self.locale_set.prefixes.get(match, ())) for match in case[:-1]]\\n suffixes = [dict(self.locale_set.suffixes.get(match, ())) for match in case[1:]] + [{}]\\n\\n groups = _DateTime(**{ field: [] for field in _DateTime._fields })\\n choices_per_position = {}\\n always_literal = set()\\n numeric = set()\\n for idx, (prefix, suffix) in enumerate(zip(prefixes, suffixes)):\\n keyword = self._lookup_keyword(raw[idx])\\n if \\\"y\\\" in prefix:\\n prefix[\\\"C\\\"] = tuple(set(prefix[\\\"y\\\"] + prefix.get(\\\"C\\\", ())))\\n if not keyword:\\n always_literal.add(idx)\\n else:\\n if raw[idx].isdigit():\\n numeric.add(idx)\\n choices_per_position[idx] = len(keyword)\\n for fmt, value, locales in keyword:\\n category = fmt[-1]\\n if category == \\\"b\\\":\\n # Month-names should be treated like numeric months.\\n category = \\\"m\\\"\\n elif category == \\\"z\\\":\\n category = \\\"Z\\\"\\n getattr(groups, category).append(_Assignment(\\n fmt=fmt,\\n pos=idx,\\n value=value,\\n locales=locales,\\n prefix=prefix.get(fmt[-1]),\\n suffix=suffix.get(fmt[-1]),\\n ))\\n numeric = frozenset(numeric)\\n\\n # If a required date field is unsatisfiable, this is not a date.\\n if not all(getattr(groups, category) for category in _State._min_date_formats):\\n for category in _State._all_date_formats:\\n getattr(groups, category).clear()\\n\\n # If a required time field is unsatisfiable, this is not a time.\\n if not all(getattr(groups, category) for category in _State._min_time_formats):\\n for category in _State._all_time_formats:\\n getattr(groups, category).clear()\\n\\n for group in groups:\\n group.sort(key=lambda assignment: (\\n -self._optimistic_score(assignment),\\n choices_per_position[assignment.pos],\\n ))\\n\\n required_formats = _State._min_date_formats + _State._min_time_formats\\n groups = OrderedDict(sorted(\\n (\\n (\\n category,\\n (\\n group,\\n tuple(\\n (f, required)\\n for f, required in _position_constraints\\n if category in required\\n ),\\n tuple(\\n (f, required)\\n for f, required, revisit in _value_constraints\\n if category in required or category in revisit\\n ),\\n )\\n )\\n for category, group in zip(groups._fields, groups)\\n if group\\n ),\\n key=lambda i: (i[0] not in required_formats, len(i[1][0]))\\n ))\\n\\n # We've already filtered out all possibilities; there's nothing here.\\n if not groups:\\n return []\\n\\n constrained_groups = []\\n while groups:\\n category, (group, position, value) = groups.popitem(last=False)\\n constrained_groups.append((category, group, position, value))\\n required = frozenset(itertools.chain.from_iterable(required for f, required in itertools.chain(position, value)))\\n if required:\\n required = [\\n category\\n for category in reversed(groups.keys())\\n if category in required\\n ]\\n for category in required:\\n groups.move_to_end(category, last=False)\\n groups = constrained_groups\\n\\n best_quality = 0\\n best_candidates = []\\n\\n partials = [\\n _State.empty._replace(\\n unconverted=frozenset(always_literal),\\n remaining_groups=tuple(groups),\\n ).children(numeric=numeric)\\n ]\\n while partials:\\n try:\\n quality, locales, state = next(partials[-1])\\n except StopIteration:\\n partials.pop()\\n continue\\n\\n if state.remaining_groups:\\n # Admissable heuristic: compute the best score each group\\n # could possibly achieve. Don't count conversion specifiers\\n # that we've already used, but don't worry about conflicts\\n # in the groups we haven't assigned yet. Any such conflicts\\n # can only reduce the resulting score, and we only need to\\n # make sure that the heuristic is at least as large as the\\n # true value of the best leaf in this subtree. However, the\\n # more precise we can be here, the fewer nodes we have to\\n # search, so we can spend some CPU time on precision and\\n # still come out ahead.\\n assigned = state.unconverted.union(state.pos).difference((None,))\\n heuristic = len(state.pending_hints) + sum(\\n next((\\n self._optimistic_score(assignment)\\n for assignment in group[1]\\n if assignment.pos not in assigned\\n ), 0)\\n for group in state.remaining_groups\\n )\\n\\n if quality + heuristic < best_quality:\\n # Even assuming the remaining groups get the highest\\n # possible score, this state is still not good enough.\\n continue\\n\\n partials.append(state.children(numeric=numeric))\\n continue\\n\\n value = state.valid()\\n if value is None:\\n continue\\n\\n quality, locales, state = state.final_score()\\n\\n if best_quality is not None and quality < best_quality:\\n # We've seen better, so skip this one.\\n continue\\n\\n if quality != best_quality:\\n best_quality = quality\\n best_candidates = []\\n\\n conversions = dict(zip(state.pos, state.fmts))\\n fmts = [ conversions.get(idx) or literal for idx, literal in enumerate(raw) ]\\n\\n pattern = ''.join(lit + fmt for lit, fmt in zip(literals, fmts + [''])).replace(\\\"%C%y\\\", \\\"%Y\\\")\\n best_candidates.append((pattern, value, locales))\\n return best_candidates\",\n \"def _interpolate(format):\\n from tokenize import tokenprog\\n\\n def matchorfail(text, pos):\\n match = tokenprog.match(text, pos)\\n if match is None:\\n raise _ItplError(text, pos)\\n return match, match.end()\\n\\n namechars = \\\"abcdefghijklmnopqrstuvwxyz\\\" \\\\\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\\\";\\n chunks = []\\n pos = 0\\n\\n while 1:\\n dollar = format.find(\\\"$\\\", pos)\\n if dollar < 0: \\n break\\n nextchar = format[dollar + 1]\\n\\n if nextchar == \\\"{\\\":\\n chunks.append((0, format[pos:dollar]))\\n pos, level = dollar + 2, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token == \\\"{\\\": \\n level = level + 1\\n elif token == \\\"}\\\": \\n level = level - 1\\n chunks.append((1, format[dollar + 2:pos - 1]))\\n\\n elif nextchar in namechars:\\n chunks.append((0, format[pos:dollar]))\\n match, pos = matchorfail(format, dollar + 1)\\n while pos < len(format):\\n if format[pos] == \\\".\\\" and \\\\\\n pos + 1 < len(format) and format[pos + 1] in namechars:\\n match, pos = matchorfail(format, pos + 1)\\n elif format[pos] in \\\"([\\\":\\n pos, level = pos + 1, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token[0] in \\\"([\\\": \\n level = level + 1\\n elif token[0] in \\\")]\\\": \\n level = level - 1\\n else: \\n break\\n chunks.append((1, format[dollar + 1:pos]))\\n else:\\n chunks.append((0, format[pos:dollar + 1]))\\n pos = dollar + 1 + (nextchar == \\\"$\\\")\\n\\n if pos < len(format): \\n chunks.append((0, format[pos:]))\\n return chunks\",\n \"def update_placeholders(self, format_string, placeholders):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if token.group(\\\"key\\\") in placeholders:\\n output.append(\\n \\\"{{{}{}}}\\\".format(placeholders[token.group(\\\"key\\\")], token.group(\\\"format\\\"))\\n )\\n continue\\n elif token.group(\\\"command\\\"):\\n # update any placeholders used in commands\\n commands = parse_qsl(token.group(\\\"command\\\"), keep_blank_values=True)\\n # placeholders only used in `if`\\n if \\\"if\\\" in [x[0] for x in commands]:\\n items = []\\n for key, value in commands:\\n if key == \\\"if\\\":\\n # we have to rebuild from the parts we have\\n condition = Condition(value)\\n variable = condition.variable\\n if variable in placeholders:\\n variable = placeholders[variable]\\n # negation via `!`\\n not_ = \\\"!\\\" if not condition.default else \\\"\\\"\\n condition_ = condition.condition or \\\"\\\"\\n # if there is no condition then there is no\\n # value\\n if condition_:\\n value_ = condition.value\\n else:\\n value_ = \\\"\\\"\\n value = \\\"{}{}{}{}\\\".format(not_, variable, condition_, value_)\\n if value:\\n items.append(f\\\"{key}={value}\\\")\\n else:\\n items.append(key)\\n\\n # we cannot use urlencode because it will escape things\\n # like `!`\\n output.append(r\\\"\\\\?{} \\\".format(\\\"&\\\".join(items)))\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def parse_template(template):\\n field_name = None\\n field_value = []\\n\\n for line in template.strip().split('\\\\n') + ['end:']:\\n if line.startswith('#'):\\n continue\\n match = RE_TEMPLATE_FIELD_LINE.match(line)\\n if match:\\n if field_name is not None:\\n yield (field_name, '\\\\n'.join(field_value).strip())\\n elif len(field_value) > 0:\\n logging.warning('Ignoring lines: %r', field_value)\\n\\n field_name = match.group(1)\\n field_value = [match.group(2)]\\n else:\\n field_value.append(line)\",\n \"def _parse_kvfmt(self, fmtlist):\\n t_fmt = self.__class__._T_FMT\\n t_prefix = self.__class__._T_PREFIX\\n parsed_list = []\\n field_id = 1\\n\\n for entry in fmtlist:\\n name = entry[0]\\n fmt = entry[1]\\n parsed_field = {}\\n parsed_field['name'] = name\\n if isinstance(fmt, str):\\n ptr = 0\\n m_prefix = t_prefix.match(fmt)\\n if m_prefix:\\n ptr += _get_length_of_match(m_prefix)\\n parsed_field['prefix'] = m_prefix.group(1)\\n # check for optional nested structure start (required if the field is also repeated)\\n if m_prefix.group(2) and len(entry) > 2:\\n parsed_field['field_id'] = field_id\\n parsed_field['field_type'] = 'a'\\n parsed_field['subcontent'] = self._parse_kvfmt(entry[2])\\n field_id += 1\\n parsed_list.append(parsed_field)\\n continue\\n elif m_prefix.group(2):\\n raise BadFormatString('Nested field type used without specifying field format.')\\n m_fmt = t_fmt.match(fmt[ptr:])\\n if m_fmt:\\n ptr += _get_length_of_match(m_fmt)\\n resolved_fmt_char = None\\n # fmt is an alias\\n if m_fmt.group(2):\\n resolved_fmt_char = m_fmt.group(2)\\n parsed_field['field_type'] = self.__class__\\\\\\n .FIELD_ALIAS[m_fmt.group(2)]\\n # fmt is an actual field type\\n elif m_fmt.group(1):\\n resolved_fmt_char = m_fmt.group(1)\\n parsed_field['field_type'] = m_fmt.group(1)\\n parsed_field['field_id'] = field_id\\n # only skip type (`x') is allowed for copying in key-value mode\\n if m_fmt.group(3) and resolved_fmt_char == 'x':\\n repeats = int(m_fmt.group(3))\\n parsed_field['repeat'] = repeats\\n field_id += repeats\\n elif m_fmt.group(3):\\n raise BadFormatString('Field copying is not allowed in key-value format list.')\\n else:\\n field_id += 1\\n else:\\n raise BadFormatString('Invalid type for field \\\"{0}\\\"'.format(name))\\n if len(fmt) != ptr:\\n self.logger.warning('Extra content found after the type string of %s.', name)\\n else:\\n # Hard-code the empty prefix because we don't support copying\\n parsed_field['prefix'] = ''\\n parsed_field['field_id'] = field_id\\n parsed_field['field_type'] = 'a'\\n parsed_field['subcontent'] = self._parse_kvfmt(fmt)\\n field_id += 1\\n parsed_list.append(parsed_field)\\n return parsed_list\",\n \"def _parseAttributeScanf(self, line, formatting):\\n\\n # multiple entrys\\n if isinstance(formatting, list):\\n for scanf_format in formatting:\\n try:\\n #print \\\"<<<----\\\", scanf_format, line\\n return sscanf(line, scanf_format)\\n except IncompleteCaptureError, e:\\n pass\\n\\n # single entry\\n else:\\n return sscanf(line, formatting)\\n\\n # problem if none of the formats worked\\n raise IncompleteCaptureError(\\\"Format error for %s\\\" % line)\",\n \"def __init__(self, format_string):\\r\\n if not isinstance(format_string, Compatibility.string):\\r\\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\\r\\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\\r\\n self._re = re.compile(self._re_pattern)\",\n \"def parse_template(string):\\n count = 0\\n list1 = []\\n for character in string:\\n count = count + 1\\n if character == \\\"{\\\":\\n end = string.find(\\\"}\\\", count)\\n s_strg = string[count:end]\\n list1.append(s_strg)\\n string = string.replace(s_strg, \\\"\\\", 1)\\n count = count - len(s_strg)\\n\\n subs = tuple(list1)\\n\\n return(string, subs)\\n print(subs)\",\n \"def _get_placeholders(template):\\n return [p[1] for p in string.Formatter().parse(template)\\n if p[1] is not None and len(p[1]) > 0]\",\n \"def parse_from_placeholder(string,pattern,encloser='%',matcher='(.+)'):\\n pattern,fields = placeholder_to_regex(pattern,encloser,matcher)\\n return parse_from_regex(string,pattern,fields)\",\n \"def parse_known_date_formats(dt_string):\\n for fmt in ('%Y%m%d', '%Y%m%d %H:%M', '%m/%d/%Y', '%m/%d/%Y %H:%M'):\\n try:\\n return datetime.strptime(dt_string, fmt)\\n except ValueError:\\n pass\\n raise ValueError(\\\"No valid date format found.\\\"\\n \\\"See https://tidesandcurrents.noaa.gov/api/ \\\"\\n \\\"for list of accepted date formats.\\\")\",\n \"def format_regexp(simple_format):\\n format, regexp = ('', '')\\n for char in simple_format:\\n if char in _regexps:\\n format += '%' + char\\n regexp += _regexps[char]\\n else:\\n format += char\\n regexp += char\\n return (format, regexp)\",\n \"def parse_task_time(line):\\n stripret = \\\"\\\".join(line.split())\\n p = re.compile(r'\\\\d+\\\\.\\\\d{2}-\\\\d+\\\\.\\\\d{2}')\\n findret = p.findall(stripret) \\n if findret:\\n formatstr = \\\" \\\".join(line.split())\\n timeregx = r'\\\\d+\\\\.\\\\d{2}\\\\s*-\\\\s*\\\\d+\\\\.\\\\d{2}'\\n time = re.compile(timeregx).findall(formatstr)[0].replace(\\\" \\\", \\\"\\\").replace(\\\":\\\", \\\".\\\")\\n taskcontext = re.sub(timeregx, \\\"\\\", formatstr).strip().replace(\\\":\\\", \\\"\\\")\\n return [taskcontext, time]\\n else:\\n # log it if line can't be parse\\n logging.warning(\\\"unparsed line: [%r]\\\" % line)\",\n \"def _parse_param_line(regex, line):\\n out = []\\n for r in regex.findall(line):\\n converter, variable = r[0] or 'default', r[1]\\n out.append((_CONVERTERS[converter], variable))\\n return out\",\n \"def extract_fields(entry_string):\\n for field, value in re.findall(\\\"(.*?)=(.*?)\\\\}\\\", entry_string):\\n yield field.strip(\\\",\\\").strip(\\\" \\\"), value.strip(\\\"{\\\").strip(\\\"}\\\")\",\n \"def parse_params(txt):\\n res = list()\\n # First, slipt with stuff looking like \\\\TYPE:\\n splitted = re.split(r'\\\\s*\\\\\\\\(\\\\w+)\\\\s*:', txt)\\n # We now have a list looking like:\\n # ['', 'flag', '....', 'param', '...']\\n i = 1\\n while i < len(splitted) - 1:\\n type = splitted[i]\\n rest = splitted[i+1]\\n if type == \\\"argn\\\":\\n name = \\\"remaining args\\\"\\n desc = rest\\n else:\\n # first word is the name, the rest is the description:\\n match = re.match(r'\\\\s*(\\\\w+)\\\\s*(.*)', rest, re.DOTALL)\\n if not match:\\n print(\\\"warning, failed to parse parameters\\\")\\n print(\\\"near\\\", rest)\\n break\\n (name, desc) = match.groups()\\n desc = clean_indent(desc)\\n res.append((type, name, desc))\\n i += 2\\n return res\",\n \"def extract_pattern(fmt):\\n class FakeDict(object):\\n def __init__(self):\\n self.seen_keys = set()\\n\\n def __getitem__(self, key):\\n self.seen_keys.add(key)\\n return ''\\n\\n def keys(self):\\n return self.seen_keys\\n\\n fake = FakeDict()\\n try:\\n fmt % fake\\n except TypeError:\\n # Formatting error\\n pass\\n return set(fake.keys())\",\n \"def parse_spec(spec: str) -> Tuple[str, str]:\\n\\n # Single \\\"*\\\" is treated as wildcard for date, not channel.\\n if spec == \\\"*\\\":\\n return \\\"*\\\", \\\"*\\\"\\n\\n channel_rex = r\\\"\\\"\\\"\\n (?P<channel>\\n nightly | beta | stable | \\\\* | (?: \\\\d+\\\\.\\\\d+\\\\.\\\\d+ )\\n )\\n \\\"\\\"\\\"\\n\\n date_rex = r\\\"\\\"\\\"\\n (?P<date>\\n \\\\d\\\\d\\\\d\\\\d-\\\\d\\\\d-\\\\d\\\\d | latest | \\\\*\\n )\\n \\\"\\\"\\\"\\n\\n m = re.match(\\n r\\\"{} (?: - {})? $\\\".format(channel_rex, date_rex), spec, re.VERBOSE\\n )\\n if m:\\n channel = m.group(\\\"channel\\\")\\n date = m.group(\\\"date\\\") or \\\"\\\"\\n return date, channel\\n\\n m = re.match(r\\\"{} $\\\".format(date_rex), spec, re.VERBOSE)\\n if m:\\n date = m.group(\\\"date\\\")\\n return date, \\\"*\\\"\\n\\n raise error.UsageError(\\\"invalid SPEC {}\\\".format(repr(spec)))\",\n \"def parse_place_notation(input_string: str) -> Tuple[int, str]:\\n\\n # Looking for a string that matches <stage>:<place notation> where the\\n # place notation is a series of bell numbers and 'x' characters\\n parts = input_string.split(\\\":\\\")\\n if len(parts) == 2:\\n stage_part = parts[0]\\n if len(stage_part) == 0 or not stage_part.isnumeric():\\n raise PlaceNotationError(input_string, \\\"Stage must be a number\\\")\\n stage = int(stage_part)\\n place_notation = parts[1]\\n if not valid_pn(place_notation):\\n raise PlaceNotationError(input_string, \\\"Place notation is invalid\\\")\\n else:\\n raise PlaceNotationError(input_string, \\\"<stage>:<place notation> required\\\")\\n\\n return stage, place_notation\",\n \"def get_formats(self):\\n return tuple(self._names.keys())\",\n \"def _parse_date(date_string: str) -> Union[datetime.datetime, str]:\\n for date_format in KNOWN_DATE_FORMATS:\\n try:\\n date = datetime.datetime.strptime(date_string, date_format)\\n return date\\n except ValueError:\\n continue\\n return date_string\",\n \"def format_data(data_string):\\n lines = data_string.split('\\\\\\\"\\\\n\\\\\\\"')\\n split_data = [re.split(r\\\"\\\\\\\"\\\\s*,\\\\s*\\\\\\\"\\\", line) for line in lines]\\n\\n return split_data\",\n \"def strptime(date_string, format):\\n i = 0\\n format_len = len(format)\\n # Iterate through the format string, applying parsers and matching literal\\n # chars as appropriate.\\n struct_time_d = {}\\n while i < format_len:\\n c = format[i]\\n # If the character is not the start of a directive, attempt to match a\\n # literal character.\\n if c != '%':\\n if date_string[0] != c:\\n return None\\n date_string = date_string[1:]\\n else:\\n # Read the next character of the directive, letting an IndexError\\n # raise if format is exhausted/malformed.\\n i += 1\\n directive = format[i]\\n # Raise a ValueError just like the built-in datetime.strptime()\\n # if the directive is invalid.\\n if directive not in DIRECTIVE_PARSER_MAP:\\n raise ValueError(\\\"{} is a bad directive in format {}\\\".format(\\n repr(directive[1]), repr(directive)))\\n # Get the parser.\\n parser = DIRECTIVE_PARSER_MAP[directive]\\n # Check whether the parser is yet to be implemented.\\n if parser is NOT_IMPLEMENTED:\\n raise NotImplementedError(\\n 'parser not defined for directive: {}'.format(directive)\\n )\\n # Do the parsing.\\n result = parser(date_string)\\n # Return None on any parsing failure.\\n if result is False:\\n return None\\n value, date_string = result\\n # Convert the directive value to a struct_time item.\\n struct_time_item = directive_to_struct_time_item(directive, value)\\n if struct_time_item is not None:\\n k, v = struct_time_item\\n # If the key already exists, accumulate, otherwise set.\\n if k in struct_time_d:\\n struct_time_d[k] += v\\n else:\\n struct_time_d[k] = v\\n i += 1\\n\\n # Return None if the date string has not been completely consumed.\\n if len(date_string) > 0:\\n return None\\n\\n # Return None if a +12 hour AM_PM = 'PM' accumulation overflowed a parsed\\n # HOUR_24 value.\\n if not (0 <= struct_time_d.get(STRUCT_TIME.TM_HOUR, 0) <= 23):\\n return None\\n\\n # Attempt to get year/month/day for date ops.\\n year = struct_time_d.get(STRUCT_TIME.TM_YEAR)\\n month = struct_time_d.get(STRUCT_TIME.TM_MON)\\n day = struct_time_d.get(STRUCT_TIME.TM_MDAY)\\n has_date = year is not None and month is not None and day is not None\\n\\n # Return None if the specified day is not valid for the month.\\n if has_date and not is_valid_month_day(year, month, day):\\n return None\\n\\n # Create an initial struct_time object.\\n _struct_time = struct_time(\\n *[struct_time_d.get(k, 0) for k in STRUCT_TIME_FIELDS]\\n )\\n\\n if has_date:\\n # Check whether accumulated minute value exceeds its max as a result of\\n # accumulating a time zone offset, requiring some calendar day math.\\n if not 0 <= struct_time_d.get(STRUCT_TIME.TM_MIN, 0) <= 59:\\n # Pass _struct_time along with an empty time_delta to\\n # add_struct_time_time_delta() to take advantage of its\\n # over/underflow logic. Note that add_struct_time_time_delta() will\\n # take care of setting the final day of week / year.\\n _struct_time = add_struct_time_time_delta(\\n _struct_time, time_delta())\\n else:\\n # Calculate the final day of week / year.\\n _struct_time = struct_time_replace(\\n _struct_time,\\n tm_wday=date_to_day_of_week(year, month, day),\\n tm_yday=date_to_day_of_year(year, month, day)\\n )\\n\\n return _struct_time\",\n \"def _read_range(range: str) -> Tuple[str, List[Tuple[Union[int, None], Union[int, None]]]]:\\n format, split_on_pairs = range.split('=', 1)\\n split_on_pairs = split_on_pairs.split(',')\\n pairs = []\\n for pair_str in split_on_pairs:\\n split_on_range = pair_str.split('-', 1)\\n start = int(split_on_range[0]) if len(split_on_range[0]) > 0 else None\\n stop = int(split_on_range[1]) if len(split_on_range[1]) > 0 else None\\n pairs.append((start, stop))\\n return format, pairs\",\n \"def parse_styles(text: str) -> List[dict]:\\n styles = []\\n regex = r'(\\\\d{3})=(\\\".*?\\\"),(\\\\d+\\\\.?\\\\d+),(\\\\(.*?\\\\))'\\n\\n for line in text.split(\\\"\\\\r\\\\n\\\"):\\n if line == \\\"\\\":\\n continue\\n\\n n, font, font_size, color = re.match(regex, line).groups()\\n styles.append(\\n {\\n \\\"id\\\": int(n),\\n \\\"f\\\": font.replace('\\\"', \\\"\\\"),\\n \\\"fs\\\": float(font_size),\\n \\\"rgb\\\": [\\n int(i)\\n for i in color.replace(\\\"(\\\", \\\"\\\")\\n .replace(\\\")\\\", \\\"\\\").split(\\\",\\\")]\\n }\\n )\\n\\n return styles\",\n \"def stringTimeToTuple_NEW(st):\\n st, ms = split(st, '.')\\n y, m, d, h, n, s = split(st, '_')\\n return y,m,d,h,n,s,ms\",\n \"def initFormat(self):\\n self.formatList = []\",\n \"def _read_format(instream):\\n format = int(le.uint32.read_from(instream))\\n if format & PCF_BYTE_MASK:\\n base = be\\n else:\\n base = le\\n return format, base\",\n \"def _parse_format(mode=2, rc_kw=None, **kwargs):\\n kw = {}\\n rc_kw = rc_kw or {}\\n for key, value in kwargs.items():\\n key_fixed = _rc_nodots.get(key, None)\\n if key_fixed is None:\\n kw[key] = value\\n else:\\n rc_kw[key_fixed] = value\\n return rc_kw, mode, kw\",\n \"def GetFormatCount(format_):\\n\\n if isinstance(format_, str):\\n match = re.search(r'\\\\s*(\\\\d+)', format_)\\n if match:\\n return int(match.group(0))\\n\\n return 1\",\n \"def get_point_list(self, string):\\n a = re.findall('\\\\(\\\\d+\\\\.\\\\d+, \\\\d+\\\\.\\\\d+\\\\)', string)\\n lst = []\\n for tp in a:\\n lst.append(self.get_tuple(tp))\\n print lst\",\n \"def get_tuple(self, string):\\n a = re.search('\\\\((\\\\d+\\\\.\\\\d+), (\\\\d+\\\\.\\\\d+)\\\\)', string)\\n if not a:\\n return None\\n else:\\n return (float(a.group(1)), float(a.group(2)))\",\n \"def display_strptime_formatters():\\n data = [\\n [\\\"%a\\\", \\\"Weekday as locale's abbreviated name.\\\", \\\"Mon\\\"],\\n [\\\"%A\\\", \\\"Weekday as locale's full name.\\\", \\\"Monday\\\"],\\n [\\\"%w\\\", \\\"Weekday as a decimal number, where 0 is Sunday and 6 is Saturday.\\\", \\\"1\\\"],\\n [\\\"%d\\\", \\\"Day of the month as a zero-padded decimal number.\\\", \\\"30\\\"],\\n [\\\"%-d\\\", \\\"Day of the month as a decimal number. (Platform specific)\\\", \\\"30\\\"],\\n [\\\"%b\\\", \\\"Month as locale's abbreviated name.\\\", \\\"Sep\\\"],\\n [\\\"%B\\\", \\\"Month as locale's full name.\\\", \\\"September\\\"],\\n [\\\"%m\\\", \\\"Month as a zero-padded decimal number.\\\", \\\"09\\\"],\\n [\\\"%-m\\\", \\\"Month as a decimal number. (Platform specific)\\\", \\\"9\\\"],\\n [\\\"%y\\\", \\\"Year without century as a zero-padded decimal number.\\\", \\\"13\\\"],\\n [\\\"%Y\\\", \\\"Year with century as a decimal number.\\\", \\\"2013\\\"],\\n [\\\"%H\\\", \\\"Hour (24-hour clock) as a zero-padded decimal number.\\\", \\\"07\\\"],\\n [\\\"%-H\\\", \\\"Hour (24-hour clock) as a decimal number. (Platform specific)\\\", \\\"7\\\"],\\n [\\\"%I\\\", \\\"Hour (12-hour clock) as a zero-padded decimal number.\\\", \\\"07\\\"],\\n [\\\"%-I\\\", \\\"Hour (12-hour clock) as a decimal number. (Platform specific)\\\", \\\"7\\\"],\\n [\\\"%p\\\", \\\"Locale's equivalent of either AM or PM.\\\", \\\"AM\\\"],\\n [\\\"%M\\\", \\\"Minute as a zero-padded decimal number.\\\", \\\"06\\\"],\\n [\\\"%-M\\\", \\\"Minute as a decimal number. (Platform specific)\\\", \\\"6\\\"],\\n [\\\"%S\\\", \\\"Second as a zero-padded decimal number.\\\", \\\"05\\\"],\\n [\\\"%-S\\\", \\\"Second as a decimal number. (Platform specific)\\\", \\\"5\\\"],\\n [\\\"%f\\\", \\\"Microsecond as a decimal number, zero-padded on the left.\\\", \\\"000000\\\"],\\n [\\\"%z\\\", \\\"UTC offset in the form +HHMM or -HHMM (empty string if the the object is naive).\\\", \\\"\\\"],\\n [\\\"%Z\\\", \\\"Time zone name (empty string if the object is naive).\\\", \\\"\\\"],\\n [\\\"%j\\\", \\\"Day of the year as a zero-padded decimal number.\\\", \\\"273\\\"],\\n [\\\"%-j\\\", \\\"Day of the year as a decimal number. (Platform specific)\\\", \\\"273\\\"],\\n [\\\"%U\\\", \\\"Week number of the year (Sunday as the first day of the week) as a zero padded decimal number. All days in a new year preceding the first Sunday are considered to be in week 0.\\\", \\\"39\\\"],\\n [\\\"%W\\\", \\\"Week number of the year (Monday as the first day of the week) as a decimal number. All days in a new year preceding the first Monday are considered to be in week 0.\\\", \\\"39\\\"],\\n [\\\"%c\\\", \\\"Locale's appropriate date and time representation.\\\", \\\"Mon Sep 30 07:06:05 2013\\\"],\\n [\\\"%x\\\", \\\"Locale's appropriate date representation.\\\", \\\"09/30/13\\\"],\\n [\\\"%X\\\", \\\"Locale's appropriate time representation.\\\", \\\"07:06:05\\\"],\\n [\\\"%%\\\", \\\"A literal '%' character.\\\", \\\"%\\\"]\\n ]\\n\\n display(HTML(\\n '<table><tr>{}</tr></table>'.format(\\n '</tr><tr>'.join(\\n '<td>{}</td>'.format('</td><td>'.join(str(_) for _ in row)) for row in data)\\n )\\n ))\",\n \"def split_date_string(date_string: str):\\n try:\\n units,_,epoch = date_string.split(None, 2)\\n except ValueError:\\n raise ValueError(f'Invalid format: {date_string}')\\n else:\\n return (units.lower(), parse(epoch))\",\n \"def split_date_string(date_string: str):\\n try:\\n units,_,epoch = date_string.split(None, 2)\\n except ValueError:\\n raise ValueError(f'Invalid format: {date_string}')\\n else:\\n return (units.lower(), parse(epoch))\",\n \"def parse_pattern(pattern: NumberPattern | str) -> NumberPattern:\\n if isinstance(pattern, NumberPattern):\\n return pattern\\n\\n def _match_number(pattern):\\n rv = number_re.search(pattern)\\n if rv is None:\\n raise ValueError(f\\\"Invalid number pattern {pattern!r}\\\")\\n return rv.groups()\\n\\n pos_pattern = pattern\\n\\n # Do we have a negative subpattern?\\n if ';' in pattern:\\n pos_pattern, neg_pattern = pattern.split(';', 1)\\n pos_prefix, number, pos_suffix = _match_number(pos_pattern)\\n neg_prefix, _, neg_suffix = _match_number(neg_pattern)\\n else:\\n pos_prefix, number, pos_suffix = _match_number(pos_pattern)\\n neg_prefix = f\\\"-{pos_prefix}\\\"\\n neg_suffix = pos_suffix\\n if 'E' in number:\\n number, exp = number.split('E', 1)\\n else:\\n exp = None\\n if '@' in number and '.' in number and '0' in number:\\n raise ValueError('Significant digit patterns can not contain \\\"@\\\" or \\\"0\\\"')\\n if '.' in number:\\n integer, fraction = number.rsplit('.', 1)\\n else:\\n integer = number\\n fraction = ''\\n\\n def parse_precision(p):\\n \\\"\\\"\\\"Calculate the min and max allowed digits\\\"\\\"\\\"\\n min = max = 0\\n for c in p:\\n if c in '@0':\\n min += 1\\n max += 1\\n elif c == '#':\\n max += 1\\n elif c == ',':\\n continue\\n else:\\n break\\n return min, max\\n\\n int_prec = parse_precision(integer)\\n frac_prec = parse_precision(fraction)\\n if exp:\\n exp_plus = exp.startswith('+')\\n exp = exp.lstrip('+')\\n exp_prec = parse_precision(exp)\\n else:\\n exp_plus = None\\n exp_prec = None\\n grouping = parse_grouping(integer)\\n return NumberPattern(pattern, (pos_prefix, neg_prefix),\\n (pos_suffix, neg_suffix), grouping,\\n int_prec, frac_prec,\\n exp_prec, exp_plus, number)\",\n \"def change_format_var_parser(text, tracker):\\n param_names = format_var_parser(text)\\n param_vars = {}\\n for param_name in param_names:\\n try:\\n param_vars[param_name] = tracker.get_slot(param_name)\\n except Exception as e:\\n PYTHON_LOGGER.error(\\\"Error to get var name {}: {}\\\".format(param_name, e))\\n return text.format(**param_vars)\",\n \"def parse_argument_pattern(content: str) -> (ArgumentPattern, int):\\n if len(content) == 0:\\n raise PatternError(\\\"content may not be empty\\\")\\n\\n if content[0] not in \\\"[<\\\" or content[-1] not in \\\"]>\\\":\\n raise PatternError(\\\"argument pattern must be wrapped in '[ ]' or '< >'\\\")\\n\\n open_brace = content[0]\\n\\n is_required = open_brace == \\\"<\\\"\\n\\n offset = 1\\n\\n names, size = __parse_names(content[offset::])\\n offset += size\\n\\n is_positional = len(names) == 0\\n\\n ident, arg_num, size = __parse_var(content[offset::], is_positional)\\n offset += size\\n\\n delim, size = __parse_delim(content[offset::])\\n offset += size\\n\\n if (delim is not None and not (arg_num.quantifier == Quantifier.N and arg_num.count == 1\\n or arg_num.quantifier == Quantifier.OPTIONAL)):\\n raise PatternError(f\\\"Only arguments taking 1 or optional values may specify a delimiter\\\")\\n\\n try:\\n if (close_brace := content[offset]) in \\\"]>\\\":\\n if open_brace == \\\"<\\\" and close_brace != \\\">\\\" or open_brace == \\\"[\\\" and close_brace != \\\"]\\\":\\n raise PatternError(f\\\"mismatching brace types, found '{open_brace}' and '{close_brace}'\\\")\\n\\n offset += 1\\n else:\\n raise PatternError(f\\\"expected '{']' if open_brace == '[' else '>'}' but found '{content[offset]}\\\")\\n except IndexError as err:\\n raise PatternError(f\\\"error parsing arguments pattern: {err}\\\")\\n\\n if is_positional and not is_required:\\n raise PatternError(\\\"a positional argument may not be optional, you may specify either '?' or '*' as quantifiers\\\")\\n\\n if ident is None and len(names) > 0:\\n ident = (max(names, key=lambda l: len(l)).lstrip('-')\\n .upper().replace(\\\"-\\\", \\\"_\\\"))\\n\\n return ArgumentPattern(ident, arg_num, names, is_positional, is_required, delim), offset\",\n \"def __format_management(self, index, matched):\\n\\n for _, case_data in self.format_cases.items():\\n if int(index) in case_data[0]:\\n # The regex number is into the currently read case data.\\n\\n # We return a list with the formatted elements.\\n # 1. We convert the day to 2 digits.\\n # 2. We convert the month to the unified format.\\n # 3. We return the year.\\n return [\\n converter.Digit2Digits(matched[case_data[1][0]]).get_converted(),\\n converter.Month(matched[case_data[1][1]]).get_converted(),\\n str(matched[case_data[1][2]]),\\n ]\\n\\n return matched # pragma: no cover\",\n \"def unpack(fmt, data):\\n fmt = _normalize(fmt)\\n formatdef, endianness, i, alignment = _getmode(fmt)\\n j = 0\\n num = 0\\n result = []\\n length = calcsize(fmt)\\n if length != len (data):\\n raise StructError(\\\"unpack str size does not match format\\\")\\n while i < len(fmt):\\n num, i = _getnum(fmt, i)\\n cur = fmt[i]\\n i += 1\\n try:\\n format = formatdef[cur]\\n except KeyError:\\n raise StructError(\\\"%s is not a valid format\\\" % cur)\\n\\n if not num :\\n num = 1\\n\\n if cur == 'x':\\n j += num\\n elif cur == 's':\\n result.append(data[j:j + num])\\n j += num\\n elif cur == 'p':\\n n = data[j]\\n if n >= num:\\n n = num - 1\\n result.append(data[j + 1:j + n + 1])\\n j += num\\n else:\\n # skip padding bytes until we get at a multiple of size\\n if j > 0 and alignment:\\n padding = format['size'] - j % format['size']\\n j += padding\\n for n in range(num):\\n result += [format['unpack'](data, j, format['size'],\\n endianness)]\\n j += format['size']\\n\\n return tuple(result)\",\n \"def getFormatList(base_url):\\n\\n\\tquery_url = base_url + \\\"/formats\\\"\\n\\trequest = urllib2.urlopen(query_url)\\n\\tresponse = request.read()\\n\\tresponse_xml = ET.fromstring(response)\\n\\n\\tfmt_list = {}\\n\\n\\tformats = response_xml.findall(\\\".//objectFormat\\\")\\n\\n\\tfor f in formats:\\n\\t\\tfmt_identifier = f.find(\\\"formatId\\\").text\\n\\t\\tfmt_name = f.find(\\\"formatName\\\").text\\n\\t\\tfmt_type = f.find(\\\"formatType\\\").text\\n\\t\\tfmt_path = makeValidFormatPath(fmt_name)\\n\\n\\t\\tfmt_list[fmt_identifier] = { \\\"formatId\\\" : fmt_identifier, \\\"formatName\\\" : fmt_name, \\\"formatType\\\" : fmt_type, \\\"formatPath\\\" : fmt_path }\\n\\n\\treturn fmt_list\",\n \"def parseStructuredData( raw_data, format ):\\n\\tparsed_data = {}\\n\\n\\tBEGIN = 0\\n\\tEND = 1\\n\\tCONV = 2\\n\\n\\tfor key in format.keys():\\n\\t\\tkey_format = format[key]\\n\\n\\t\\tif key_format[END] == \\\"\\\":\\n\\t\\t\\tkey_format[END] = key_format[BEGIN] + len(raw_data)\\n\\n\\t\\ttxt = raw_data[key_format[BEGIN]:key_format[END]]\\n\\n\\t\\tif len(key_format[CONV]) > 0:\\n\\t\\t\\tparsed_data[key] = struct.unpack(key_format[CONV], txt)[0]\\n\\t\\telse:\\n\\t\\t\\tparsed_data[key] = txt\\n\\n\\treturn parsed_data\",\n \"def GetFormatType(format_):\\n\\n formattype = format_\\n bitsize = 0\\n if isinstance(format_, str):\\n match = re.search(r'\\\\s*(\\\\D+)', format_)\\n if match:\\n formattype = match.group(0)\\n bitsize = struct.calcsize(formattype) * 8\\n return formattype, bitsize\",\n \"def makeNamesFromFormats(formats):\\n i = getIter(formats)\\n if not i:\\n return\\n\\n try:\\n c = 0\\n item = i.next()\\n while item:\\n c = c +1\\n name = 'c%s' % c\\n if isinstance(item, str):\\n yield name\\n else:\\n l = []\\n for a in makeNamesFromFormats(item):\\n l.append(a)\\n yield (name, l)\\n item = i.next()\\n except StopIteration:\\n pass\",\n \"def guess_file_date_format(filename):\\n for line in open(filename):\\n try:\\n format = guess_format(line)\\n except CannotParse:\\n pass\\n else:\\n return format\\n\\n raise CannotParse(\\\"No date/time strings found in '%s'\\\" % filename)\",\n \"def read_fmt(bib_name, bib_file):\\n cache_name, formatted_cache_name = _cache_name(bib_name, bib_file)\\n\\n try:\\n meta_data, formatted_entries = cache.read_global(formatted_cache_name)\\n except:\\n raise cache.CacheMiss()\\n\\n # raise a cache miss if the modification took place after the caching\\n modified_time = os.path.getmtime(bib_file)\\n if modified_time > meta_data[\\\"cache_time\\\"]:\\n raise cache.CacheMiss()\\n\\n # validate the version and format strings are still valid\\n if (meta_data[\\\"version\\\"] != _VERSION or\\n any(meta_data[s] != get_setting(\\\"cite_\\\" + s)\\n for s in [\\\"panel_format\\\", \\\"autocomplete_format\\\"])):\\n print(\\\"Formatting string has changed, updating cache...\\\")\\n # read the base information from the unformatted cache\\n current_time, bib_entries = cache.read_global(cache_name)\\n # format and cache the entries\\n formatted_entries = _create_formatted_entries(formatted_cache_name,\\n bib_entries,\\n current_time)\\n\\n return formatted_entries\",\n \"def split_str(str):\\n \\n logger = logging.getLogger(__name__)\\n \\n logger.debug('{0}'.format(str))\\n \\n match = re.match(r\\\"([0-9]+.?\\\\d{0,32}?)(d|m|s)\\\", str)\\n \\n if match:\\n items = match.groups()\\n \\n return items[0], items[1]\",\n \"def getConverter( format ):\\n\\n data = set(format.split(\\\"-\\\"))\\n\\n if \\\"one\\\" in data:\\n if \\\"forward\\\" in data:\\n if \\\"closed\\\" in data:\\n return __one_forward_closed \\n else:\\n return __one_forward_open\\n else:\\n if \\\"closed\\\" in data:\\n return __one_both_closed\\n else:\\n return __one_both_open\\n else:\\n if \\\"forward\\\" in data:\\n if \\\"closed\\\" in data:\\n return __zero_forward_closed\\n else:\\n return __zero_forward_open\\n else:\\n if \\\"closed\\\" in data:\\n return __zero_both_closed\\n else:\\n return __zero_both_open\",\n \"def get_formatted_messages(formats, label, context):\\r\\n format_templates = {}\\r\\n for format in formats:\\r\\n # conditionally turn off autoescaping for .txt extensions in format\\r\\n if format.endswith(\\\".txt\\\"):\\r\\n context.autoescape = False\\r\\n format_templates[format] = render_to_string((\\r\\n 'notification/%s/%s' % (label, format),\\r\\n 'notification/%s' % format), context_instance=context)\\r\\n return format_templates\",\n \"def getFormatsFromDescr(descr):\\n i = getIter(descr)\\n if not i:\\n return\\n\\n try:\\n item = i.next()\\n while item:\\n item1 = item[1]\\n if isinstance(item1, str):\\n yield normalize_format(item1)\\n else:\\n l = []\\n for j in getFormatsFromDescr(item1):\\n l.append(j)\\n yield l\\n item = i.next()\\n except StopIteration:\\n pass\",\n \"def generate_logformat_regex(logformat):\\n headers = []\\n splitters = re.split(r'(<[^<>]+>)', logformat)\\n regex = ''\\n for k in range(len(splitters)):\\n if k % 2 == 0:\\n splitter = re.sub(' +', '\\\\\\\\\\\\s+', splitters[k])\\n regex += splitter\\n else:\\n header = splitters[k].strip('<').strip('>')\\n regex += '(?P<%s>.*?)' % header\\n headers.append(header)\\n regex = re.compile('^' + regex + '$')\\n return headers, regex\",\n \"def resolve_date_format(year, month, day, fail_safe=True):\\n\\n FAIL_SAFE_DEFAULT = \\\"%Y-%m-%d\\\"\\n\\n def order_terms_formats(fmt_str):\\n # see date (1), 'O' (not '0') is a mystery, 'E' is Buddhist calendar, '(.*)'\\n # is an arbitrary suffix\\n field_spec_re = re.compile(r'([-_0OE^#]*)([yYmbBde])(.*)')\\n\\n # see date (1)\\n fmt_str = fmt_str.replace(\\\"%F\\\", \\\"%Y-%m-%d\\\")\\n\\n # e.g. \\\"%d.%m.%Y\\\" -> ['d.', 'm.', 'Y']\\n fields = fmt_str.split(\\\"%\\\")[1:]\\n\\n ordered_terms = []\\n ordered_formats = []\\n for field in fields:\\n match = field_spec_re.match(field)\\n if not match:\\n # ignore fields we are not interested in (like %A for weekday name, etc.)\\n continue\\n\\n prefix, item, suffix = match.groups()\\n if item in (\\\"d\\\", \\\"e\\\"):\\n # \\\"e\\\" is the same as \\\"_d\\\"\\n ordered_terms.append(day)\\n elif item in (\\\"Y\\\", \\\"y\\\"):\\n # 4-digit year, 2-digit year\\n ordered_terms.append(year)\\n elif item in (\\\"m\\\", \\\"b\\\", \\\"B\\\"):\\n # month number, short month name, long month name\\n ordered_terms.append(month)\\n\\n # \\\"%\\\" + prefix + item gives a format for date/time formatting functions\\n ordered_formats.append(_DateFieldSpec(\\\"%\\\" + prefix + item, suffix.strip()))\\n\\n if len(ordered_terms) != 3 or len(ordered_formats) != 3:\\n raise ValueError(\\\"Not all fields successfully identified in the format '%s'\\\" % fmt_str)\\n\\n return (tuple(ordered_terms), tuple(ordered_formats))\\n\\n fmt_str = locale_mod.nl_langinfo(locale_mod.D_FMT)\\n\\n if not fmt_str or \\\"%\\\" not in fmt_str:\\n if fail_safe:\\n # use some sane default\\n fmt_str = FAIL_SAFE_DEFAULT\\n else:\\n raise ValueError(\\\"Invalid date format string for current locale: '%s'\\\" % fmt_str)\\n\\n try:\\n return order_terms_formats(fmt_str)\\n except ValueError:\\n if not fail_safe:\\n raise\\n else:\\n # if this call fails too, something is going terribly wrong and we\\n # should be informed about it\\n return order_terms_formats(FAIL_SAFE_DEFAULT)\",\n \"def _check_tokens_are_valid(format_string, message):\\n named_tokens = re.findall(r\\\"{(\\\\w*)}\\\", format_string)\\n invalid_tokens = [x for x in named_tokens if x.lower() not in _valid_tokens]\\n if invalid_tokens:\\n msg = message\\n msg += \\\" [{0}]. \\\".format(\\\", \\\".join(invalid_tokens))\\n msg += 'Did you check your \\\"modules.yaml\\\" configuration?'\\n raise RuntimeError(msg)\",\n \"def complete_opt_format(self, text, *_):\\n return [t + \\\" \\\" for t in FORMATTERS if t.startswith(text)]\",\n \"def _parse_data(data: str) -> Tuple[str, str, str, int, int, int, str]:\\n\\n phg = None\\n rng = None\\n dfs = None\\n course = None\\n speed = None\\n altitude = None\\n comment = None\\n\\n if re.match(r'^PHG[0-9]{4}', data[:7]):\\n # Packet has a PHG (power, antenna height/gain/directivity) value\\n phg = data[3:7]\\n logger.debug(\\\"PHG is {}\\\".format(phg))\\n data = data[7:]\\n\\n elif re.match('^RNG[0-9]{4}', data[:7]):\\n # Packet has an RNG (radio range) value\\n rng = data[3:7]\\n logger.debug(\\\"RNG is {}\\\".format(rng))\\n data = data[7:]\\n\\n elif re.match('^DFS[0-9]{4}', data[:7]):\\n # Packet has a DFS (DF signal strength, antenna height/gain/directivity) value\\n dfs = data[3:7]\\n logger.debug(\\\"DFS is {}\\\".format(dfs))\\n data = data[7:]\\n\\n elif re.match('^[0-9]{3}/[0-9]{3}', data[:7]):\\n # Packet has course and speed values\\n course = int(data[:3])\\n speed = int(data[4:7])\\n logger.debug(\\\"Course is {}, speed is {}\\\".format(course, speed))\\n data = data[7:]\\n\\n # TODO - parse BRG/NRQ\\n\\n # Check for comment\\n if len(data) > 0:\\n\\n # Check for altitude\\n # As per APRS 1.01 C6 P26, altitude as /A=nnnnnn may appear anywhere in the comment\\n has_altitude = re.match('.*/A=([0-9]{6}).*', data)\\n if has_altitude:\\n # TODO - fix altitude format\\n altitude = int(has_altitude.groups()[0])\\n logger.debug(\\\"Altitude is {} ft\\\".format(altitude))\\n\\n # Strip out the altitude from the comment\\n data = re.sub(r'/A=[0-9]{6}', \\\"\\\", data)\\n\\n # Set the comment as the remainder of the information field\\n comment = data\\n logger.debug(\\\"Comment is {}\\\".format(comment))\\n\\n return (phg, rng, dfs, course, speed, altitude, comment)\",\n \"def valueformat(value, format_list):\\n\\n # print(\\\"\\\\n\\\", format_list, value)\\n concat_key = format_list.split('.')\\n # Pass in either the key of the field\\n # or pass in resource.key to enable a resource lookup.\\n key = \\\"\\\"\\n resource = \\\"\\\"\\n member_id = \\\"\\\"\\n key_sequence = [key, resource, member_id]\\n count = 0\\n for r in reversed(concat_key):\\n key_sequence[count] = r\\n count += 1\\n\\n # print(\\\"Concat_key:\\\", concat_key)\\n key = key_sequence[0]\\n resource = key_sequence[1]\\n member_id = key_sequence[2]\\n\\n # print(\\\"Key:\\\", key)\\n\\n if key:\\n if key.lower() == \\\"address\\\":\\n return dt_address(value)\\n\\n elif key.lower() == \\\"telecom\\\":\\n return dt_telecom(value)\\n\\n elif key.lower() == \\\"name\\\":\\n return dt_name(value)\\n elif key.lower() == 'dosage':\\n return dt_dosage(value)\\n elif key.lower() == 'medicationreference':\\n # print(\\\"Working on\\\", key, \\\": \\\", value)\\n # f_value = value\\n # lookup field_formats\\n # concat_key should have a resource name\\n # print(\\\"\\\\n\\\\nRESOURCE:\\\", resource)\\n # print(\\\"calling dt_medicationreference with Resource:\\\", resource, \\\", value:\\\", value)\\n return dt_medicationreference(value, member_id, resource)\\n elif key.lower() == 'dataabsentreason':\\n if isinstance(value, dict):\\n return value['coding'][0]['display']\\n else:\\n return value\\n elif key.lower() == 'valuequantity':\\n # return str(value['value']) + \\\" \\\" + value['unit']\\n return dt_valuequantity(value)\\n elif key.lower() == 'valuestring':\\n return value\\n elif key.lower() == 'interpretation':\\n return value['coding'][0]['display']\\n elif key.lower() == 'referencerange':\\n return dt_referencerange(value)\\n elif key.lower() == 'requester':\\n if 'display' in value['agent']:\\n return dt_reference(value['agent'], member_id)\\n elif key.lower() == 'practitioner':\\n if 'display' in value:\\n return dt_reference(value, member_id)\\n elif key.lower() == 'organization':\\n if 'display' in value:\\n return dt_reference(value, member_id)\\n # elif key.lower() == \\\"result\\\":\\n # return dt_reference(value[0], member_id)\\n elif key.lower() == 'practitioner':\\n if 'display' in value:\\n return dt_reference(value, member_id)\\n elif key.lower() == 'organization':\\n if 'display' in value:\\n return dt_reference(value, member_id)\\n elif key.lower() == 'participant':\\n if 'display' in value[0]['individual']:\\n return dt_reference(value[0]['individual'], member_id)\\n elif key.lower() == 'location':\\n if 'display' in value[0]['location']:\\n return dt_reference(value[0]['location'], member_id)\\n elif key.lower() == 'communication':\\n return dt_communication(value)\\n else:\\n # print(\\\"value:\\\", value, \\\" type:\\\", type(value), \\\" for: \\\", key)\\n return value\",\n \"def is_valid_format(format_string): \\n # default\\n is_valid = True\\n \\n # list of valid formats\\n valid_formats = ['hex', 'char', 'schar','uint', 'int', 'double', \\n 'ascii', 'long', 'long long', 'float']\\n \\n # list of formats provided (may be a single format)\\n format_list = format_string.split(', ')\\n \\n # check each item in the provided list\\n for item in format_list:\\n \\n # if it does not match a valid format then it is invalid\\n if item not in valid_formats:\\n is_valid = False\\n # end if\\n # end for\\n \\n return is_valid\",\n \"def build_block(self, format_string):\\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\\n block = first_block\\n\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n value = token.group(0)\\n if token.group(\\\"block_start\\\"):\\n # Create new block\\n block = block.new_block()\\n elif token.group(\\\"block_end\\\"):\\n # Close block setting any valid state as needed\\n # and return to parent block to continue\\n if not block.parent:\\n raise Exception(\\\"Too many `]`\\\")\\n block = block.parent\\n elif token.group(\\\"switch\\\"):\\n # a new option has been created\\n block = block.switch()\\n elif token.group(\\\"placeholder\\\"):\\n # Found a {placeholder}\\n key = token.group(\\\"key\\\")\\n format = token.group(\\\"format\\\")\\n block.add(Placeholder(key, format))\\n elif token.group(\\\"literal\\\"):\\n block.add(Literal(value))\\n elif token.group(\\\"lost_brace\\\"):\\n # due to how parsing happens we can get a lonesome }\\n # eg in format_string '{{something}' this fixes that issue\\n block.add(Literal(value))\\n elif token.group(\\\"command\\\"):\\n # a block command has been found\\n block.set_commands(token.group(\\\"command\\\"))\\n elif token.group(\\\"escaped\\\"):\\n # escaped characters add unescaped values\\n if value[0] in [\\\"\\\\\\\\\\\", \\\"{\\\", \\\"}\\\"]:\\n value = value[1:]\\n block.add(Literal(value))\\n\\n if block.parent:\\n raise Exception(\\\"Block not closed\\\")\\n # add to the cache\\n self.block_cache[format_string] = first_block\",\n \"def parser(string: str, token: str) -> List[float]:\\n search_token = re.compile(r\\\"{token}: (.*?){unit}\\\".format(token=token,\\n unit=UNIT))\\n output = re.findall(search_token, string)\\n if len(output) == 0:\\n return []\\n\\n return [float(i) for i in output]\",\n \"def parseConfig(f):\\n config = {\\\"formats\\\":{}}\\n \\n for line in f:\\n if line.startswith(\\\"//\\\"): \\n continue\\n \\n sline = re.split(\\\"[=\\\\s]\\\", line)\\n if sline[0] is \\\"\\\":\\n continue\\n \\n if sline[0]==\\\"format\\\":\\n #Puts the format as a key in the dict pointed to by \\\"formats\\\"\\n config[\\\"formats\\\"][sline[1]] = sline[3] \\n else:\\n config[sline[0]] = sline[1]\\n \\n return config\",\n \"def interpret_datetime(timestamp):\\n formats = (\\n \\\"%Y-%m-%d_%H:%M:%S.%f\\\",\\n \\\"%Y-%m-%d_%H-%M-%S-%f\\\",\\n DATE_FORMAT,\\n )\\n\\n for i, fmt in enumerate(formats):\\n try:\\n return datetime.strptime(timestamp, fmt)\\n except ValueError:\\n if i == len(formats) - 1:\\n raise\\n continue\",\n \"def select_stylestrs(cfgstr):\\n stylestrs = []\\n for s in cfgstr.split():\\n if s in vars(fmt):\\n stylestrs.append(s)\\n return stylestrs\",\n \"def __format_input_translator(str_to_process):\\n return re.sub(r'\\\\([^)]*\\\\)', '', str_to_process).replace(' ', '').split('/')\",\n \"def _prepare_to_convert(coordinates: str) -> tuple:\\n degrees, minutes, seconds = True, True, True\\n\\n if coordinates == coordinates.replace(\\\"°\\\", \\\" \\\"): degrees = False\\n if coordinates == coordinates.replace(\\\"′\\\", \\\" \\\"): minutes = False\\n if coordinates == coordinates.replace(\\\"″\\\", \\\" \\\"): seconds = False\\n\\n coordinates = coordinates.replace(\\\"°\\\", \\\" \\\").replace(\\\"′\\\", \\\" \\\").replace(\\\"″\\\", \\\" \\\").split(\\\" \\\")\\n del (coordinates[-1])\\n\\n if seconds is False: coordinates.append(0)\\n if minutes is False: coordinates.insert(0, 1)\\n if degrees is False: coordinates.insert(0, 0)\\n\\n for i in range(len(coordinates)):\\n coordinates[i] = float(coordinates[i])\\n return tuple(coordinates)\",\n \"def parse_date(date_string, format):\\n try:\\n return datetime.strptime(date_string, format)\\n except ValueError:\\n return None\",\n \"def get_color_names(self, format_string):\\n names = set()\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"command\\\"):\\n name = dict(parse_qsl(token.group(\\\"command\\\"))).get(\\\"color\\\")\\n if (\\n not name\\n or name in COLOR_NAMES_EXCLUDED\\n or name in COLOR_NAMES\\n or name[0] == \\\"#\\\"\\n ):\\n continue\\n names.add(name)\\n return names\",\n \"def parsePercentExpression(literal, format):\\n\\tmat = _getREForPercentExpression(format).match(literal)\\n\\tif not mat:\\n\\t\\traise ValueError(\\\"'%s' cannot be parsed using format '%s'\\\"%(\\n\\t\\t\\tliteral, format))\\n\\treturn mat.groupdict()\",\n \"def read_f(self, fmt, offset=None):\\n\\n if offset is not None:\\n self.seek(offset)\\n\\n # place commas before and after each instance of S or Z\\n for special in ['S', 'Z']:\\n fmt = fmt.replace(special, ',' + special + ',')\\n\\n # split S and Z into isolated strings\\n fmt = fmt.split(',')\\n\\n # construct a tuple of unpacked data\\n data = ()\\n for subfmt in fmt:\\n if subfmt == 'S':\\n data += (self.read_string(),)\\n elif subfmt == 'Z':\\n data += (self.read_bool(),)\\n else:\\n data += self.read_and_unpack(subfmt)\\n\\n if len(data) == 1:\\n return data[0]\\n else:\\n return data\",\n \"def asformat(self, format):\",\n \"def format_input(self, args):\\n\\n new_list = []\\n if args[1].find('{') != -1:\\n new_list = self.format_dicti(args)\\n return new_list\\n else:\\n new_list = []\\n new_list.append(args[0])\\n new_str = args[1][ args[1].find('(') + 2 : args[1].find(',') - 1]\\n new_str += args[1][ args[1].find(',') : args[1].find(')') - 0]\\n new_list.append(\\\" \\\".join(new_str.split(\\\", \\\") ) )\\n\\n return \\\" \\\".join(i for i in new_list)\",\n \"def parse_spans(span_string):\\n spans = []\\n for span in span_string.split(';'):\\n start, end = span.split(' ')\\n spans.append((int(start), int(end)))\\n return spans\",\n \"def parse_spans(span_string):\\n spans = []\\n for span in span_string.split(';'):\\n start, end = span.split(' ')\\n spans.append((int(start), int(end)))\\n return spans\",\n \"def format(self, varnames, fmts):\\n varnames = self._find_vars(varnames, empty_ok=False)\\n indexes = list(map(self._varlist.index, varnames))\\n \\n # check that fmts are specified properly\\n if isinstance(fmts, str):\\n fmts = fmts.split()\\n else:\\n if ( not isinstance(fmts, collections.Iterable) \\n or not all(isinstance(f, str) for f in fmts) ):\\n raise TypeError(\\\"given fmts must be str or iterable of str\\\")\\n fmts = [x for s in fmts for x in s.split()]\\n if len(fmts) == 0:\\n raise ValueError(\\\"no formats specified\\\")\\n \\n # check fmts for validity\\n is_valid = self._is_valid_fmt\\n if not all(is_valid(fmt) for fmt in fmts):\\n bad_fmts = \\\" \\\".join(fmt for fmt in fmts if not is_valid(fmt))\\n raise ValueError(\\\"invalid formats: \\\" + bad_fmts)\\n \\n # pad fmts if necessary \\n nvarnames = len(varnames)\\n nfmts = len(fmts)\\n if nfmts < nvarnames:\\n fmts = list(fmts) + [fmts[-1]]*(nvarnames - nfmts)\\n \\n # check that formats match Stata types\\n #typlist = self._typlist\\n isstrvar = self._isstrvar\\n if not all(isstrvar(i) == bool(STR_FMT_RE.match(fmt))\\n for i, fmt in zip(indexes, fmts)):\\n raise ValueError(\\\"format does not match Stata variable type\\\")\\n \\n # replace fmts (extras, if any, don't get used)\\n for i, fmt in zip(indexes, fmts):\\n self._fmtlist[i] = fmt\\n \\n # assume there are changes\\n self._changed = True\",\n \"def _string_to_date(datestr,fmt):\\n if not isinstance(datestr,str):\\n raise InstrumentParameterException('Value %s is not a string.' % str(datestr))\\n try:\\n date_time = time.strptime(datestr,fmt)\\n date = (date_time[2],date_time[1],date_time[0])\\n\\n except ValueError:\\n raise InstrumentParameterException('Value %s could not be formatted to a date.' % str(datestr))\\n \\n return date\",\n \"def try_parsing_date(text):\\n for fmt in ('%I %p', '%I %M %p', '%I:%M %p'):\\n try:\\n return datetime.datetime.strptime(text, fmt)\\n except ValueError:pass\\n if \\\":\\\" in text:\\n return datetime.datetime.strptime(text+\\\" \\\"+\\n (\\\"AM\\\" if int(text.split(\\\":\\\")[0])>=8 else \\\"PM\\\"), '%I:%M %p')\\n return datetime.datetime.strptime(text+\\\" \\\"+\\n (\\\"AM\\\" if int(text)>=8 else \\\"PM\\\"), '%I %p')\",\n \"def parseTime(string):\\t\\n \\n if string == \\\"\\\":\\n result = None\\n if 'T' in string:\\n string = string.replace('T', ' ')\\n if 'Z' in string:\\n string = string.replace('Z', '') \\n\\n if len(string) < 19:\\n # string has some single digits\\n p = \\\"\\\"\\\"^([0-9]{4})-([0-9]{1,2})-([0-9]{1,2}) \\n ([0-9]{1,2}):([0-9]{1,2}):([0-9]{1,2}).*$\\\"\\\"\\\"\\n s = re.findall(p, string)\\n if len(s) > 0:\\n string = '{0}-{1:02d}-{2:02d} {3:02d}:{4:02d}:{5:02d}'\\\\\\n .format(*[int(x) for x in s[0]])\\n\\n for date_format in DATE_FORMATS:\\n try:\\n result = datetime.datetime.strptime(string, date_format)\\n except ValueError:\\n pass\\n\\n return result\",\n \"def parseDate(date):\\n formats = [\\n \\\"D MMM YY, hh:mm a\\\", \\n \\\"YYYY-MM-DDTHH:mm:ss+00:00\\\", \\n \\\"ddd, D MMM YYYY HH:mm:ss +0530\\\", # NDTV\\n \\\"ddd, D MMM YYYY HH:mm:ss +0100\\\", # skynews\\n \\\"ddd, D MMM YYYY HH:mm:ss -0400\\\", # reuters\\n \\\"D MMM, YYYY\\\", # espn cricket\\n \\\"ddd, D MMM YYYY HH:mm:ss GMT\\\", # times of india\\n \\\"ddd, D MMM YYYY HH:mm:ss +0200\\\", # lifrea\\n \\\"ddd, D MMM YYYY HH:mm:ss +0000\\\", # linux, ubuntu\\n \\\"ddd, D MMM YYYY HH:mm:ss -0700\\\", # iTunes\\n ]\\n\\n for f in formats:\\n try:\\n parsed_date = tryDateFormat(date, f)\\n return parsed_date.format(\\\"D MMM YY, hh:mm a\\\")\\n except Exception as e:\\n pass\\n else:\\n return \\\"Invalid date\\\"\",\n \"def get_format_opts(cls, format_=\\\"value\\\", fields=[]):\\n return \\\" -f {0} {1}\\\".format(format_, \\\" \\\".join([\\\"-c \\\" + it for it in fields]))\",\n \"def get_parameter(pstring):\\n parameters = pstring.replace(',', ' ').split()\\n if len(parameters) == 1:\\n init_value = float(parameters[0])\\n return (init_value, None, None)\\n elif len(parameters) == 3:\\n init_value = float(parameters[0])\\n if parameters[1].upper() == 'NONE':\\n lower_value = None\\n else:\\n lower_value = float(parameters[1])\\n if parameters[2].upper() == 'NONE':\\n upper_value = None\\n else:\\n upper_value = float(parameters[2])\\n return (init_value, lower_value, upper_value)\\n else:\\n raise ValueError('Invalid parameter format: %s' % pstring)\",\n \"def register_format(recipe):\\n afr = AFMFormatRecipe(recipe)\\n formats_available.append(afr)\\n # suffix\\n if afr.suffix not in formats_by_suffix:\\n formats_by_suffix[afr.suffix] = []\\n formats_by_suffix[afr.suffix].append(afr)\\n # mode\\n if afr.mode not in formats_by_mode:\\n formats_by_mode[afr.mode] = []\\n formats_by_mode[afr.mode].append(afr)\\n # supported extensions\\n if afr.suffix not in supported_extensions: # avoid duplucates\\n supported_extensions.append(afr.suffix)\\n supported_extensions.sort()\",\n \"def findall(pattern, text):\\r\\n\\tspl = re.compile(pattern).split(text)\\r\\n\\tresult = []\\r\\n\\tbeginTag = \\\"\\\"\\r\\n\\tendTag = None\\r\\n\\tbeginFormat = \\\"\\\"\\r\\n\\tendFormat = \\\"\\\"\\r\\n\\tinitText = text\\r\\n\\tfor s in spl:\\r\\n\\t\\ttext = text[len(s)+2:]\\r\\n\\t\\tend = text.find(\\\")s\\\")\\r\\n\\t\\tvar = \\\"\\\"\\r\\n\\t\\tif len(text) > 0:\\r\\n\\t\\t\\tvar = text[:end]\\r\\n\\t\\t\\tresult.append(var)\\r\\n\\t\\tif var == \\\"content\\\":\\r\\n\\t\\t\\tbeginTag += s\\r\\n\\t\\t\\tendTag = \\\"\\\"\\r\\n\\t\\telif endTag != None:\\r\\n\\t\\t\\tendTag += s\\r\\n\\t\\t\\tif var != \\\"\\\":\\r\\n\\t\\t\\t\\tif var in [\\\"disabled\\\",\\\"checked\\\",\\\"active\\\",\\\"selected\\\"]:\\r\\n\\t\\t\\t\\t\\tendFormat += \\\" b'%s' if self.%s else b'',\\\"%(var, var)\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\tendFormat += \\\"self.%s,\\\"%var\\r\\n\\t\\t\\t\\tendTag += \\\"\\\\x25s\\\"\\r\\n\\t\\telse:\\r\\n\\t\\t\\tbeginTag += s\\r\\n\\t\\t\\tif var != \\\"\\\":\\r\\n\\t\\t\\t\\tif var in [\\\"disabled\\\",\\\"checked\\\",\\\"active\\\",\\\"selected\\\"]:\\r\\n\\t\\t\\t\\t\\tbeginFormat += \\\" b'%s' if self.%s else b'',\\\"%(var, var)\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\tbeginFormat += \\\"self.%s,\\\"%var\\r\\n\\t\\t\\t\\tbeginTag += \\\"\\\\x25s\\\"\\r\\n\\t\\ttext = text[end+2:]\\r\\n\\tif endTag == None:\\r\\n\\t\\tendTag = \\\"\\\"\\r\\n\\t\\tendFormat = \\\"\\\"\\r\\n\\treturn result, beginTag, endTag, beginFormat, endFormat\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.65669346","0.62842053","0.6130616","0.61288065","0.60436875","0.5937322","0.5901326","0.58831894","0.5852524","0.57953036","0.5765644","0.57541496","0.57023305","0.56520545","0.56048083","0.5603498","0.5459637","0.5429871","0.5376852","0.53540975","0.5352906","0.5329984","0.53212583","0.52624923","0.5258512","0.5246587","0.5198944","0.51661754","0.513486","0.51218945","0.51000667","0.5083689","0.50711507","0.50639105","0.5063032","0.5026774","0.502133","0.5018339","0.5011537","0.49798977","0.49584708","0.49565127","0.49387592","0.49334702","0.49329984","0.49299213","0.4894328","0.48817024","0.48789778","0.4875315","0.48703697","0.48524705","0.4851324","0.4851324","0.48367384","0.48213378","0.48147085","0.48093012","0.4807934","0.48026043","0.48013297","0.47994635","0.47959974","0.47884703","0.47848812","0.4783625","0.47507963","0.47454315","0.47452757","0.4744936","0.4740796","0.47353637","0.47226292","0.47182122","0.47135818","0.4702489","0.46980354","0.4692607","0.46920088","0.46756324","0.46708277","0.46681905","0.46606493","0.4650407","0.46467695","0.46439475","0.46402755","0.46391624","0.4634674","0.4632874","0.4632874","0.46311998","0.4623561","0.46231136","0.46132636","0.46086472","0.46049073","0.45984036","0.4596587","0.45883885"],"string":"[\n \"0.65669346\",\n \"0.62842053\",\n \"0.6130616\",\n \"0.61288065\",\n \"0.60436875\",\n \"0.5937322\",\n \"0.5901326\",\n \"0.58831894\",\n \"0.5852524\",\n \"0.57953036\",\n \"0.5765644\",\n \"0.57541496\",\n \"0.57023305\",\n \"0.56520545\",\n \"0.56048083\",\n \"0.5603498\",\n \"0.5459637\",\n \"0.5429871\",\n \"0.5376852\",\n \"0.53540975\",\n \"0.5352906\",\n \"0.5329984\",\n \"0.53212583\",\n \"0.52624923\",\n \"0.5258512\",\n \"0.5246587\",\n \"0.5198944\",\n \"0.51661754\",\n \"0.513486\",\n \"0.51218945\",\n \"0.51000667\",\n \"0.5083689\",\n \"0.50711507\",\n \"0.50639105\",\n \"0.5063032\",\n \"0.5026774\",\n \"0.502133\",\n \"0.5018339\",\n \"0.5011537\",\n \"0.49798977\",\n \"0.49584708\",\n \"0.49565127\",\n \"0.49387592\",\n \"0.49334702\",\n \"0.49329984\",\n \"0.49299213\",\n \"0.4894328\",\n \"0.48817024\",\n \"0.48789778\",\n \"0.4875315\",\n \"0.48703697\",\n \"0.48524705\",\n \"0.4851324\",\n \"0.4851324\",\n \"0.48367384\",\n \"0.48213378\",\n \"0.48147085\",\n \"0.48093012\",\n \"0.4807934\",\n \"0.48026043\",\n \"0.48013297\",\n \"0.47994635\",\n \"0.47959974\",\n \"0.47884703\",\n \"0.47848812\",\n \"0.4783625\",\n \"0.47507963\",\n \"0.47454315\",\n \"0.47452757\",\n \"0.4744936\",\n \"0.4740796\",\n \"0.47353637\",\n \"0.47226292\",\n \"0.47182122\",\n \"0.47135818\",\n \"0.4702489\",\n \"0.46980354\",\n \"0.4692607\",\n \"0.46920088\",\n \"0.46756324\",\n \"0.46708277\",\n \"0.46681905\",\n \"0.46606493\",\n \"0.4650407\",\n \"0.46467695\",\n \"0.46439475\",\n \"0.46402755\",\n \"0.46391624\",\n \"0.4634674\",\n \"0.4632874\",\n \"0.4632874\",\n \"0.46311998\",\n \"0.4623561\",\n \"0.46231136\",\n \"0.46132636\",\n \"0.46086472\",\n \"0.46049073\",\n \"0.45984036\",\n \"0.4596587\",\n \"0.45883885\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.784211"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94766,"cells":{"query":{"kind":"string","value":"Update a format string renaming placeholders."},"document":{"kind":"string","value":"def update_placeholders(self, format_string, placeholders):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if token.group(\"key\") in placeholders:\n output.append(\n \"{{{}{}}}\".format(placeholders[token.group(\"key\")], token.group(\"format\"))\n )\n continue\n elif token.group(\"command\"):\n # update any placeholders used in commands\n commands = parse_qsl(token.group(\"command\"), keep_blank_values=True)\n # placeholders only used in `if`\n if \"if\" in [x[0] for x in commands]:\n items = []\n for key, value in commands:\n if key == \"if\":\n # we have to rebuild from the parts we have\n condition = Condition(value)\n variable = condition.variable\n if variable in placeholders:\n variable = placeholders[variable]\n # negation via `!`\n not_ = \"!\" if not condition.default else \"\"\n condition_ = condition.condition or \"\"\n # if there is no condition then there is no\n # value\n if condition_:\n value_ = condition.value\n else:\n value_ = \"\"\n value = \"{}{}{}{}\".format(not_, variable, condition_, value_)\n if value:\n items.append(f\"{key}={value}\")\n else:\n items.append(key)\n\n # we cannot use urlencode because it will escape things\n # like `!`\n output.append(r\"\\?{} \".format(\"&\".join(items)))\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)"},"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 update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\n and token.group(\"key\") in placeholder_formats\n ):\n output.append(f\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\")\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def renameFormats(self, nameDict):\n for item in globalref.docRef.root.descendantGen():\n item.formatName = nameDict.get(item.formatName, item.formatName)","def _fix_fmts(self, labname, mapping):\n default_fmt_widths = self._default_fmt_widths\n \n indexes = [i for i in range(self._nvar) if self._lbllist[i] == labname]\n if indexes == []: return\n lab_size = max([len(v) for k, v in mapping.items()])\n fmtlist = self._fmtlist\n typlist = self._typlist\n isstrvar = self._isstrvar\n for i in indexes:\n if isstrvar(i):\n continue # string values should not be labeled\n old_fmt = fmtlist[i]\n # check match agains numerical format\n match = NUM_FMT_RE.match(old_fmt)\n if match:\n fmt_width = int(match.group(3))\n if fmt_width < lab_size:\n prefix = ('%' + (match.group(1) or '') + \n (match.group(2) or ''))\n suffix = (match.group(4) + match.group(5) + \n match.group(6) + (match.group(7) or ''))\n new_fmt = prefix + str(lab_size) + suffix\n fmtlist[i] = new_fmt\n self._changed = True\n elif TIME_FMT_RE.match(old_fmt) or TB_FMT_RE.match(old_fmt):\n continue\n else: \n # Here, some garbled format must have been entered. \n # More effort could be made to identify intended format, \n # but instead we'll just paint over it.\n fmt_width = default_fmt_widths[typlist[i]]\n fmtlist[i] = '%' + str(max((lab_size,fmt_width))) + '.0g'\n self._changed = True","def wrap_columns_name(self, format_string):\n self._data_frame = self._data_frame.rename(\n columns=lambda column: format_string.format(column)\n )","def change_format_var_parser(text, tracker):\n param_names = format_var_parser(text)\n param_vars = {}\n for param_name in param_names:\n try:\n param_vars[param_name] = tracker.get_slot(param_name)\n except Exception as e:\n PYTHON_LOGGER.error(\"Error to get var name {}: {}\".format(param_name, e))\n return text.format(**param_vars)","def sformatf(cls, msg, *args):\n #formats = {\"%t\": \"%d\", \"%0t\": \"%0d\"}\n #for s in formats:\n # msg = msg.replace(s, formats[s])\n #return sformatf(msg, *args)\n # TODO substitute old types %s/%d etc with {}\n #new_msg = cls.STR_RE.sub(r'{:\\1}', msg)\n #print(\"new_msg is \" + new_msg)\n for s in cls.formats:\n if s == \"%h\" or s == \"%0h\":\n msg = msg.replace(s, \"{:X}\")\n else:\n msg = msg.replace(s, \"{}\")\n return msg.format(*args)","def update_name(name, mapping):\n m = street_type_re.search(name)\n if m:\n street_type = m.group()\n for key, value in mapping.iteritems():\n if street_type == key:\n name = name.replace(key,value)\n\n return name","def formatNames(string_from):\n return re.sub('/', '-', string_from)","def replace_param(string, param, value, param_format=None):\n\n if param_format == \"json\":\n return sub(r\"(?P<json_replacement>\\\"%s\\\"\\s*:\\s*)\\\"\\s*\\\"\" %\n escape(str(param)), \"\\\\1\\\"%s\\\"\" % value, string)\n elif param_format == \"header\":\n return sub(r\"%s=[^\\\\n]*\" % escape(str(param)), r\"%s=%s\" %\n (str(param).encode('string-escape'),\n str(value).encode('string-escape')), string)\n else:\n return sub(r\"%s=[^&]*\" % escape(str(param)), r\"%s=%s\" %\n (str(param).encode('string-escape'),\n str(value).encode('string-escape')), string)","def updatePreview(self, baseName, *args):\n\n prefix = str(self.prefix.text())\n suffix = str(self.suffix.text())\n\n string = \"\"\n if len(prefix) > 0:\n string += prefix + \"_\"\n\n string += baseName\n\n if len(suffix) > 0:\n string += \"_\" + suffix\n\n self.previewName.setText(string)","def update_weight_name(repl_patterns: Dict[str, str], weight_name: str) -> str:\n # Create a regular expression from all of the dictionary keys\n regex = re.compile('|'.join(map(re.escape, repl_patterns.keys())))\n\n # For each match, look up the corresponding value in the repl_patterns dict.\n return regex.sub(lambda match: repl_patterns[match.group(0)], weight_name)","def rename_bindnames(tqry, li_adjust):\n for bindname, attrname in li_adjust:\n from_ = \"%(\" + bindname + \")s\"\n to_ = \"%(\" + attrname + \")s\"\n tqry = tqry.replace(from_, to_)\n return tqry","def FillForm(string_for_substitution, dictionary_of_vars):\n return_string = string_for_substitution\n for i in re.findall(\"//%%(.*)%%//\", string_for_substitution):\n return_string = re.sub(\"//%%\" + i + \"%%//\", dictionary_of_vars[i],\n return_string)\n return return_string","def format(self, varnames, fmts):\n varnames = self._find_vars(varnames, empty_ok=False)\n indexes = list(map(self._varlist.index, varnames))\n \n # check that fmts are specified properly\n if isinstance(fmts, str):\n fmts = fmts.split()\n else:\n if ( not isinstance(fmts, collections.Iterable) \n or not all(isinstance(f, str) for f in fmts) ):\n raise TypeError(\"given fmts must be str or iterable of str\")\n fmts = [x for s in fmts for x in s.split()]\n if len(fmts) == 0:\n raise ValueError(\"no formats specified\")\n \n # check fmts for validity\n is_valid = self._is_valid_fmt\n if not all(is_valid(fmt) for fmt in fmts):\n bad_fmts = \" \".join(fmt for fmt in fmts if not is_valid(fmt))\n raise ValueError(\"invalid formats: \" + bad_fmts)\n \n # pad fmts if necessary \n nvarnames = len(varnames)\n nfmts = len(fmts)\n if nfmts < nvarnames:\n fmts = list(fmts) + [fmts[-1]]*(nvarnames - nfmts)\n \n # check that formats match Stata types\n #typlist = self._typlist\n isstrvar = self._isstrvar\n if not all(isstrvar(i) == bool(STR_FMT_RE.match(fmt))\n for i, fmt in zip(indexes, fmts)):\n raise ValueError(\"format does not match Stata variable type\")\n \n # replace fmts (extras, if any, don't get used)\n for i, fmt in zip(indexes, fmts):\n self._fmtlist[i] = fmt\n \n # assume there are changes\n self._changed = True","def reformat(ctx):\n pass","def updateName(g):\n try:\n n = int(g.group(2))\n except TypeError:\n n = 0\n\n return \"%s-%d\" % (g.group(1), n + 1)","def update_street_name(name, mapping):\r\n m = street_type_re.search(name)\r\n if m:\r\n street_type = m.group()\r\n if street_type in list(mapping.keys()):\r\n better_street_type = mapping[street_type]\r\n name = street_type_re.sub(better_street_type, name)\r\n return name","def fix_label(label):\n\n replace_dict = {'_': ' ',\n 'degE': '$^{\\circ}$E',\n 'ms-1': '$m s^{-1}$',\n 'm.s-1': '$m s^{-1}$',\n 'Wm-2': '$W m^{-2}$',\n '1000000 m2.s-1': '$10^6$m$^2$s$^{-1}$'\n } \n\n for value, replacement in list(replace_dict.items()):\n label = label.replace(value, replacement)\n\n return label","def renameFields(self, nameDict):\n for format in self.values():\n if format.genericType in nameDict:\n nameDict[format.name] = nameDict[format.genericType]\n for item in globalref.docRef.root.descendantGen():\n for oldName, newName in nameDict.get(item.formatName, []):\n if oldName in item.data:\n item.data[newName] = item.data[oldName]\n del item.data[oldName]","def _assign_label(self, format):\n cht_tmpl = self.out_label_tmpl\n return cht_tmpl.substitute(format)","def dt_format_translate(pyfmt):\n\n translate = {\"%a\": \"ddd\",\n \"%A\": \"dddd\",\n \"%b\": \"mmm\",\n \"%B\": \"mmmm\",\n \"%c\": \"\",\n \"%d\": \"dd\",\n \"%f\": \"\",\n \"%H\": \"hh\",\n \"%I\": \"hh\",\n \"%j\": \"\",\n \"%m\": \"mm\",\n \"%M\": \"mm\",\n \"%p\": \"AM/PM\",\n \"%S\": \"ss\",\n \"%U\": \"\",\n \"%w\": \"\",\n \"%W\": \"\",\n \"%x\": \"\",\n \"%X\": \"\",\n \"%y\": \"yy\",\n \"%Y\": \"yyyy\",\n \"%z\": \"\",\n \"%Z\": \"\",\n \"%%\": \"%\"}\n\n xlfmt = str(pyfmt)\n\n for item in translate:\n if item in xlfmt:\n xlfmt = xlfmt.replace(item, translate[item])\n return xlfmt","def update(name):\n strRet = mapping(name)\n return strRet","def replace(self, string):\n for i, j in self.defs.items():\n string = string.replace(i, j)\n return string","def reformat_placeholders(content: str) -> str:\n return content.replace(\"<MM>\", \"[[\").replace(\"</MM>\", \"]]\")","def format_map(self, format_string, mapping):\n return self.vformat(format_string, args=None, kwargs=mapping)","def VarNameReplace(old, new, *vars):\n\t#syntax = [ \"rename variables\" ]\n\tsyntax = []\n\tif not vars or \"*\" in vars:\n\t\tvars = None\n\tvd = spssaux.VariableDict(vars)\n\tfor v in vd:\n\t\toldname = v.VariableName\n\t\tnewname = oldname.replace(old,new).strip()\n\t\tif newname.lower() != oldname.lower():\n\t\t\tsyntax += [ \"(%s=%s)\" % (oldname, newname) ]\n\tif syntax:\n\t\tsyntax.insert(0, \"rename variables\")\n\t\tsyntax += [ spssterm ]\n\t\tif __debug__:\n\t\t\tprint \" \".join(syntax)\n\t\tspss.Submit(syntax)","def reformat(self):\n\t\told_path = os.path.join( self.path, self.init_str )\n\t\tnew_path = os.path.join( self.path, self.reorder() )\n\t\tos.rename(old_path,new_path)","def format_name(self):\n\t\tself.full_name = self.first + \" \" + self.last","def format_name(f_name, l_name): #docstring (documentation)\n if f_name == \"\" or l_name == \"\":\n return \"You didn't provide valid inputs.\"\n formated_f_name = f_name.title()\n formated_l_name = l_name.title()\n return f\"Result: {formated_f_name} {formated_l_name}\"","def transform_table_name(f):\n @wraps(f)\n def wrapper(*args, **kwargs):\n largs = list(args)\n if \"%\" in args[1]:\n if 'transform_time' in kwargs \\\n and isinstance(kwargs['transform_time'], datetime.datetime):\n t = kwargs['transform_time']\n else:\n t = datetime.datetime.utcnow()\n largs[1] = t.strftime(args[1])\n largs = tuple(largs)\n return f(*largs, **kwargs)\n return wrapper","def replace_placeholders(self, placeholder_dict):\n\n for placeholder, value in placeholder_dict.items():\n placeholder_wrapped = f\"{self.marker_string}{placeholder}{self.marker_string}\"\n\n if placeholder not in self.unresolved_placeholders:\n self.hd.log.warn(f\"Placeholder {placeholder} not found in sequence.\")\n else:\n self.sequence = self.sequence.replace(f\"{placeholder_wrapped}\", str(value))\n self.unresolved_placeholders.discard(placeholder)","def __makeFormatString(self):\n self.__formatString = \"\"\n for f in self.__columns:\n self.__formatString += \"%(\"+ f + \")-\" + str(self.__widths[f]) + \\\n \"s \"","def reformat(self, seq_name, *, prefix=\"s\"):\n\t\treturn \"%s_%012u\" % (prefix, self.get_sid(seq_name))","def format_fss_name(original):\n sections = original.split('_')\n direction = sections[-1]\n\n code = sections[0]\n\n left, right = ' '.join(sections[1:-1]).split('VS')\n if sections[-1] == \"DN\":\n direction = '<FONT COLOR=\"#943126\">downregulated</FONT>'\n else:\n direction = '<FONT COLOR=\"#196f3d\">upregulated</FONT>'\n\n result = f\"< {code}<BR/>{left}vs{right}<BR/>{direction} >\"\n return(result)","def update_format_string(self):\n if self._show_units:\n units = \" {}\".format(self._unit)\n else:\n units = \"\"\n\n if self._show_step_exponent:\n self.setSuffix(\"{0} Step: 1E{1}\".format(units, self.step_exponent))\n self.lineEdit().setToolTip(\"\")\n else:\n self.setSuffix(units)\n self.lineEdit().setToolTip('Step: 1E{0:+d}'.format(self.step_exponent))","def update_name(name, mapping):\n words_name = name.split(\" \")\n if words_name not in expected:\n for word in words_name:\n if word in mapping:\n name = name.replace(word, mapping[word])\n \n if word == word.lower():\n if word not in allowed_lowercase:\n name = name.replace(word, word.capitalize())\n \n if words_name[0] not in expected:\n if words_name[0] not in mapping:\n if words_name[0] == \"Fernando\":\n name = \"Avenida \" + name\n elif words_name[0] == \"rua\":\n pass\n else:\n name = \"Rua \" + name\n\n return name","async def edit_names(message):\n split_message = message.content.split()\n\n try:\n target_number = int(split_message[1])\n correct_name = ' '.join(split_message[2:])\n old_name = char_name_dict[message.author.id][target_number]\n temp_name_bucket[message.author.id] = [target_number, correct_name]\n\n message_state[message.author.id] = 'EDIT'\n await message.channel.send(f\"You would like to replace `{old_name}` with `{correct_name}`. If that is correct, please type `confirm` otherwise type `cancel`.\")\n except:\n print(traceback.format_exc())","def register_string_format(name: str, strategy: st.SearchStrategy) -> None:\n if not isinstance(name, str):\n raise TypeError(f\"name must be of type {str}, not {type(name)}\")\n if not isinstance(strategy, st.SearchStrategy):\n raise TypeError(f\"strategy must be of type {st.SearchStrategy}, not {type(strategy)}\")\n\n STRING_FORMATS[name] = strategy","def convert_format(self, new_format):\n if new_format not in [0, 1, 2, 3]:\n raise ValueError(\"Unknown format specified\")\n\n inp_format = new_format\n if inp_format == 3:\n new_format = 2\n\n for block in self.frd.blocks:\n if hasattr(block, 'format'):\n block.format = new_format\n\n self.frd.node_block.format = inp_format","def doEdit(var, value, target):\n currentValue = target.get(var, \"\")\n newValue = Simplifier.simplify(str(value).replace(f\"{{{var}}}\", str(currentValue)))\n target[var] = newValue","def _interpolate(string):\n return string % env.project","def update(self, database_vals):\n # TODO : handle evaluation delimited by $. Imply a try except\n vals = {d: database_vals[d] for d in self.depend_on}\n new_val = self.formatting.format(**vals)\n deferred_call(setattr, self, 'value', new_val)","def formatter(text):\n repl_map = {\n \"degC\": \"$^o$C\",\n \"K\": \"$^o$C\",\n \"month-1\": \"month$^{{-1}}$\",\n \"day-1\": \"day$^{{-1}}$\",\n \"d-1\": \"day$^{{-1}}$\",\n \"decade-1\": \"decade$^{{-1}}$\",\n \"year-1\": \"year$^{{-1}}$\",\n \"rcp85\": \"RCP8.5\",\n \"rcp45\": \"RCP4.5\",\n \"rcp26\": \"RCP2.6\",\n \"RCP85\": \"RCP8.5\",\n \"RCP45\": \"RCP4.5\",\n \"RCP26\": \"RCP2.6\",\n \"cmip5-85\": \"RCP8.5\",\n \"cmip5-60\": \"RCP6.0\",\n \"cmip5-45\": \"RCP4.5\",\n \"cmip5-26\": \"RCP2.6\",\n \"ssp585\": \"SSP5-8.5\",\n \"ssp245\": \"SSP2-4.5\",\n \"ssp126\": \"SSP1-2.6\",\n \"SSP585\": \"SSP5-8.5\",\n \"SSP245\": \"SSP2-4.5\",\n \"SSP126\": \"SSP1-2.6\",\n \"cmip6-85\": \"SSP5-8.5\",\n \"cmip6-70\": \"SSP3-7.0\",\n \"cmip6-60\": \"SSP4-6.0\",\n \"cmip6-34\": \"SSP4-3.4\",\n \"cmip6-45\": \"SSP2-4.5\",\n \"cmip6-26\": \"SSP1-2.6\",\n \"cmip6-19\": \"SSP1-1.9\",\n \"1\": \"%\",\n \"era5\": \"ERA5\",\n \"gpcc025x025_v8\": \"GPCC\",\n \"cru\": \"CRU\",\n \"jra55\": \"JRA55\",\n \"HIGHRESMIP\": \"HighResMIP\",\n \" \": \"\",\n }\n for key, val in repl_map.items():\n if key in text:\n text = text.replace(key, val)\n break\n return text","def update_short_name(name):\n # First verify that the common errors have been fixed\n name = update_street_name(name)\n\n # Find the abbreviation to replace\n m = over_abbr_re.search(name)\n if m:\n if m.group() in abbreviations:\n name = over_abbr_re.sub(abbreviations[m.group()], name)\n\n return name","def fmt(competitor_name: str) -> str:\n name = competitor_name.replace(\"_a\", r\" $\\alpha$ \")\n name = name.replace(\"_b\", r\" $\\beta$ \")\n return name","def custom_strftime(format, t): \n return t.strftime(format).replace(\"{S}\", str(t.day) + suffix(t.day))","def str_replace(data):\n for key, value in data.items():\n if isinstance(value, (str, unicode)):\n data[key] = value.format(**data)","def format_name(f_name, l_name):\n #Using an early return if inputs aren't valid\n if f_name == \"\" or l_name == \"\":\n return \"You didn't provide valid inputs.\"\n\n formatted_f_name = f_name.title()\n formatted_l_name = l_name.title()\n\n #Returning a formatted string when inputs are valid\n return f\"{formatted_f_name} {formatted_l_name}\"","def _interpolate(format):\n from tokenize import tokenprog\n\n def matchorfail(text, pos):\n match = tokenprog.match(text, pos)\n if match is None:\n raise _ItplError(text, pos)\n return match, match.end()\n\n namechars = \"abcdefghijklmnopqrstuvwxyz\" \\\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\";\n chunks = []\n pos = 0\n\n while 1:\n dollar = format.find(\"$\", pos)\n if dollar < 0: \n break\n nextchar = format[dollar + 1]\n\n if nextchar == \"{\":\n chunks.append((0, format[pos:dollar]))\n pos, level = dollar + 2, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token == \"{\": \n level = level + 1\n elif token == \"}\": \n level = level - 1\n chunks.append((1, format[dollar + 2:pos - 1]))\n\n elif nextchar in namechars:\n chunks.append((0, format[pos:dollar]))\n match, pos = matchorfail(format, dollar + 1)\n while pos < len(format):\n if format[pos] == \".\" and \\\n pos + 1 < len(format) and format[pos + 1] in namechars:\n match, pos = matchorfail(format, pos + 1)\n elif format[pos] in \"([\":\n pos, level = pos + 1, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token[0] in \"([\": \n level = level + 1\n elif token[0] in \")]\": \n level = level - 1\n else: \n break\n chunks.append((1, format[dollar + 1:pos]))\n else:\n chunks.append((0, format[pos:dollar + 1]))\n pos = dollar + 1 + (nextchar == \"$\")\n\n if pos < len(format): \n chunks.append((0, format[pos:]))\n return chunks","def markup_text(self, text):\n for moniker, name in S['names'].items():\n text = text.replace('${0}'.format(moniker.split('_')[1]), name)\n return text","def update_column_format(self):\n pass","def update_named_font(self, *a, **kw):\n return update_named_font(*a, **kw)","def date_string_to_strftime_format(date_string):\n for data in STRF_DATA:\n for pattern in data.get('patterns', []):\n if pattern in date_string:\n date_string = date_string.replace(pattern, data['replacement'])\n break\n else:\n if data.get('regex'):\n date_string = re.sub(data['regex'], data['replacement'], date_string)\n # matches = find()\n # if any(matches):\n # date_string = date_string.replace(matches[0], data['replacement'])\n\n return date_string","def undo_format_field_name(field_name):\n if json_api_settings.FORMAT_FIELD_NAMES:\n return format_value(field_name, \"underscore\")\n\n return field_name","def fileRename(current_file,num,digits):\n # Key, value pairs of what to replace.\n dictobj = {\n '<num>': get_numbering_format(digits, num),\n '<datetaken>': date_to_string(get_date_taken(current_file),'%Y%m%d__%H_%M'),\n '<dname>': dirname\n }\n # Rename\n new_filename = multi_replace(filename_pattern, dictobj)\n shutil.move(current_file, new_filename)","def format_string_2(file_num, float_num1, int_num, float_num2):\n\n result = f\"file_{file_num:0>3d} :{float_num1:9.2f}, {int_num:.2e}, {float_num2:.3g}\"\n print(result)\n return result","def set_format(cls,format):\n import __main__\n IP = __main__.__dict__['__IP']\n prompt = getattr(IP.outputcache,cls._prompt)\n prompt.p_template = format\n prompt.set_p_str()\n cls._format = format","def replace_in_string(s, args_dict):\n for key, value in args_dict.items():\n s = s.replace(key, value)\n for key, value in args_dict.items():\n s = s.replace(key, value)\n for key, value in args_dict.items():\n s = s.replace(key, value)\n return s","def setFormattedStrings(object, event):\n entry = interfaces.IBiblatexEntry(object) # assert a biblatex entry object\n generator = interfaces.IFormattedEntryGenerator(entry)\n writer = interfaces.IWriteFormatted(entry)\n config = zope.component.queryUtility(\n interfaces.IBiblatexConfiguration, \n context = object)\n if config:\n languages = config.languages\n styles = config.styles\n else:\n languages = styles = (None,)\n for language in languages:\n for style in styles:\n #raise Exception(u\"language: %s, style: %s\" % (language, style))\n generator.setUp(language = language, style = style)\n generator.generate()\n writer.setBibliographicEntry(generator.getBibliographicEntry(), language, style)\n writer.setCitation(generator.getCitation(), language, style)\n writer.setCitationAgain(generator.getCitationAgain(), language, style)\n generator.tearDown()\n del generator\n del writer","def strfdate(self, fmt):\n pattern = r'%({})'.format(reduce(lambda x, y: '{}|{}'.format(x, y), FORMAT_MAP.keys()))\n for f in re.findall(pattern, fmt):\n fmt = fmt.replace('%{}'.format(f), FORMAT_MAP[f](self))\n return fmt","def set_text_f(self, format, *args):\n self._text.set(format % args)\n self.change_bg(\"green\")\n self._label.update_idletasks()","def edit_format(sample, **kwargs):\n n_call_data = vcf.model.make_calldata_tuple(sample.data._fields + tuple(kwargs.keys()))\n n_data = tuple(kwargs.values())\n sample.data += n_data\n sample.data = n_call_data(*sample.data)","def format_color_name(string, frame_name):\n if frame_name == \"primary\":\n color = \"red\"\n else:\n color = \"green\"\n return format_color(string, color)","def line_replacer(config,change_this_line,key):\n for arg in config['HyperParameter'][key]: \n pattern=r'{}[ ]*=.*,'.format(arg)\n replace_value=config['HyperParameter'][key][arg][counter]\n if type(replace_value) is str:\n replace_value=\"'\"+replace_value+\"'\"\n change_this_line=re.sub(pattern,\"{}= {},\".format(arg,replace_value),change_this_line)\n return change_this_line","def adjust_name_for_printing(name):\n if name is not None:\n name2 = name\n name = name.replace(\" \", \"_\").replace(\".\", \"_\").replace(\"-\", \"_m_\")\n name = name.replace(\"+\", \"_p_\").replace(\"!\", \"_I_\")\n name = name.replace(\"**\", \"_xx_\").replace(\"*\", \"_x_\")\n name = name.replace(\"/\", \"_l_\").replace(\"@\", '_at_')\n name = name.replace(\"(\", \"_of_\").replace(\")\", \"\")\n if re.match(r'^[a-zA-Z_][a-zA-Z0-9-_]*$', name) is None:\n raise NameError(\"name {} converted to {} cannot be further converted to valid python variable name!\".format(name2, name))\n return name\n return ''","def format_like(s: str, escape='\\\\') -> str:\n return '%{}%'.format(s.replace('%', escape+'%').replace('_', escape+'_'))","def replace_with(*, replacement, f=DECORATED):\n return replacement","def adjust_date_format(date, format_in, format_out):\n return datetime.strptime(date, format_in).strftime(format_out)","def format(self, fmt):\n if fmt not in [\".jpg\", \"jpg\", \".png\", \"png\"]:\n raise ValueError(f\"Invalid format: {fmt}\")\n if fmt.find(\".\") != 0:\n fmt = \".\" + fmt\n self._format = fmt","def format_name(field_name):\r\n if field_name == \"celebration_tier\":\r\n return \"{wLargesse{n\"\r\n return \"{w%s{n\" % field_name.capitalize()","def format(self, *args, **kwargs) -> String:\n pass","def format_string_1(file_num, float_num1, int_num, float_num2):\n\n text = \"file_{:0>3d} :{:9.2f}, {:.2e}, {:.3g}\"\n result = text.format(file_num, float_num1, int_num, float_num2)\n print(result)\n return result","def register_code_name(code_name,format_name):\n if format_name not in data_format_parser:\n raise ValueError(\"unknown format_name: {:s}\".format(format_name))\n code_name_map[code_name] = format_name","def replace_params(self):\n raw_sql = self.raw_sql\n for placeholder in self.to_replace:\n newreg = re.compile(placeholder)\n repl = self.get_replacement_value(placeholder)\n if repl:\n raw_sql = newreg.sub(str(repl), raw_sql)\n self.sql = raw_sql","def username_format(self, username_format):\n\n self._username_format = username_format","def reformat():\n toolkit.reformat()","def update_format(self, record):\n prefix = \"\\u001b[\"\n color = f\"{prefix}{self.color_map[record.levelno]}m\"\n bold = f\"{prefix}1m\"\n gray = f\"{prefix}1m{prefix}30m\"\n reset = f\"{prefix}0m\"\n self._style._fmt = (\n f\"%(asctime)s\"\n f\" {gray}│{reset} {color}%(levelname)-8s{reset} {gray}│{reset} \"\n )\n if hasattr(record, \"function\"):\n self._style._fmt += (\n f\"{gray}%(indent)s{reset}\"\n f\"{bold}%(function)s{reset}{gray}:{reset}\"\n \" %(message)s\"\n )\n else:\n self._style._fmt += \"%(indent)s%(message)s\"","def w__format(self, string):\n s = ''\n for i in range(0, len(string) - 1, 2):\n s = s + \"%03s\" % string[i:i + 2]\n return s[1:]","def replace_with(*, replacement='hello', f=DECORATED):\n return replacement","def register_filename_format(format_name,parser):\n if format_name == \"ALL\":\n raise ValueError(\"filename format code ALL is reserved\")\n\n filename_format_parser[format_name] = parser","def vformat(self, format_string, args, kwargs):\n self._used_kwargs = {}\n self._unused_kwargs = {}\n return super(MemorizeFormatter, self).vformat(format_string, args, kwargs)","def test_update_multiecho_name():\n # Standard name update\n fn = 'sub-X_ses-Y_task-Z_run-01_bold'\n metadata = {'EchoTime': 0.01,\n 'EchoNumber': 1}\n echo_times = [0.01, 0.02, 0.03]\n out_fn_true = 'sub-X_ses-Y_task-Z_run-01_echo-1_bold'\n out_fn_test = update_multiecho_name(metadata, fn, echo_times)\n assert out_fn_test == out_fn_true\n # EchoNumber field is missing from metadata, so use echo_times\n metadata = {'EchoTime': 0.01}\n out_fn_test = update_multiecho_name(metadata, fn, echo_times)\n assert out_fn_test == out_fn_true\n # Catch an unsupported type and *do not* update\n fn = 'sub-X_ses-Y_task-Z_run-01_phasediff'\n out_fn_test = update_multiecho_name(metadata, fn, echo_times)\n assert out_fn_test == fn","def substitute_names(tmpl_string, dct):\n return Template(tmpl_string).substitute(dct)","def OnRenameTimer(self):\r\n\r\n self.EditLabel(self._current, self._curColumn)","def format_colname(name):\n colnames = [\n \"AV\",\n \"RV\",\n \"EBV\",\n \"CAV1\",\n \"CAV2\",\n \"CAV3\",\n \"CAV4\",\n \"C1\",\n \"C2\",\n \"C3\",\n \"C4\",\n \"x_o\",\n \"gamma\",\n \"bump_area\",\n \"fh2\",\n \"nhtot\",\n \"nh2\",\n \"nhi\",\n \"NH_AV\",\n \"NH_EBV\",\n ]\n plotnames = [\n \"$A(V)$\",\n \"$R(V)$\",\n \"$E(B-V)$\",\n \"$C^{A(V)}_1$\",\n \"$C^{A(V)}_2$\",\n \"$C^{A(V)}_3$\",\n \"$C^{A(V)}_4$\",\n \"$C_1$\",\n \"$C_2$\",\n \"$C_3$\",\n \"$C_4$\",\n \"$x_o$\",\n r\"$\\gamma$\",\n r\"$\\pi C^{A(V)}_3 / 2 \\gamma$\",\n \"$f(H_2)$\",\n \"$N(H)$\",\n \"$N(H_2)$\",\n \"$N(HI)$\",\n \"$N(H)/A(V)$\",\n \"$N(H)/E(B-V)$\",\n ]\n dic_pairs = dict(zip(colnames, plotnames))\n\n out_name = name\n if name[:3] == \"log\":\n out_name = r\"$\\log (\" + name[3:].upper() + \")$\"\n elif name in dic_pairs.keys():\n out_name = dic_pairs[name]\n\n return out_name","def fix_name(row, index, name_map):\n # print(\"Input row: {}\".format(row))\n name = row[index].strip()\n # print(\"Name entry is {}\".format(name))\n if name.endswith(\" (yourself)\"):\n name = name[:-len(\" (yourself)\")]\n # print(\"Shortening to |{}|\".format(name))\n if name not in name_map:\n name_map[name] = name # Initially the identity transform\n row[index] = name_map[name]","def _format_label(self, lbl, plot_src):\n lbl.text = \"{0:}\".format(plot_src.name)","def update_name(name, mapping): \n words = name.split()\n for w in range(len(words)):\n if words[w] in mapping:\n #print words[w]\n words[w] = mapping[words[w]]\n name = \" \".join(words)\n return name","def asformat(self, format):","def _substitute(template, fuzzer, benchmark):\n return template.format(fuzzer=fuzzer, benchmark=benchmark)","def TransformNames(self) -> _n_2_t_0[str]:","def _format(self):\n min_value = self.replacements.get(str(self.min), str(self.min))\n max_value = self.replacements.get(str(self.max), str(self.max))\n l_brace = '(' if min_value.find('inf') != -1 else '['\n r_brace = ')' if max_value.find('inf') != -1 else ']'\n\n return '{l_brace}{min_value}, {max_value}{r_brace}'.format(\n l_brace=l_brace, r_brace=r_brace,\n min_value=min_value, max_value=max_value)","def _substitute(template, files, user_values):\n # Get all placeholder names\n placeholders = _get_placeholders(template)\n\n # Pre-fill placeholders based on existing file aliases\n placeholder_values = _prefill_placeholders(placeholders, files,\n user_values)\n\n # Add user specified values for the placeholders\n placeholder_values.update(**user_values)\n\n # Check whether all placeholder values are now properly provided.\n provided = set(placeholder_values.keys())\n needed = set(placeholders)\n missing = needed - provided\n if len(missing) > 0:\n raise ValueError('Cannot construct filename, because the following '\n 'parameters are missing: %s' % missing)\n\n # Do the substitution\n return template.format(**placeholder_values)","def renameUI(*args, **kwargs)->AnyStr:\n pass","def _replace_config_variables(self, string, node_id, cluster_name, region):\n\n if node_id:\n string = string.replace(\"{instance_id}\", node_id)\n if cluster_name:\n string = string.replace(\"{cluster_name}\", cluster_name)\n if region:\n string = string.replace(\"{region}\", region)\n return string","def rename_cmip6_raw(ds, dim_name_di, printing=False, debug=False, verbose=False):\n ds = ds.copy()\n source_id = ds.attrs['source_id']\n \n # Check if there is an entry in the dict matching the source id\n if debug:\n print(dim_name_di.keys())\n # rename variables\n if len(dim_name_di) == 0:\n warnings.warn('input dictionary empty for source_id: `%s`. Please add values to https://github.com/jbusecke/cmip6_preprocessing/blob/master/cmip6_preprocessing/preprocessing.py' %ds.attrs['source_id'])\n else:\n \n for di in dim_name_di.keys():\n \n if debug or printing or verbose:\n print(di)\n print(dim_name_di[di])\n \n # make sure the input is a list\n if isinstance(dim_name_di[di], str):\n dim_name_di[di] = [dim_name_di[di]]\n \n \n if di in ds.variables:\n # if the desired key is already present do nothing\n if printing:\n print(\"Skipped renaming for [%s]. Name already correct.\" % di)\n \n else:\n \n # Track if the dimension was renamed already...\n # For some source ids (e.g. CNRM-ESM2-1) the key 'x':['x', 'lon'], leads to problems\n # because it renames the 2d lon in the gr grid into x. Ill try to fix this, below.\n # But longterm its probably better to go and put out another rename dict for gn and \n # go back to not support lists of dim names. \n \n # For now just stop in the list if the dimension is already there, or one 'hit'\n # was already encountered.\n trigger = False\n for wrong in dim_name_di[di]:\n if printing:\n print('Processing %s. Trying to replace %s' %(di, wrong))\n if wrong in ds.variables or wrong in ds.dims:\n if not trigger:\n if debug:\n print('Changing %s to %s' %(wrong, di))\n ds = ds.rename({wrong: di})\n trigger = True\n if printing:\n print('Renamed.')\n else:\n if wrong is None:\n if printing:\n print(\"No variable available for [%s]\" % di)\n return ds","def strftime_localized(dtime, format): # pylint: disable=redefined-builtin\r\n\r\n if format == \"SHORT_DATE\":\r\n format = \"%x\"\r\n elif format == \"LONG_DATE\":\r\n # Translators: the translation for \"LONG_DATE_FORMAT\" must be a format\r\n # string for formatting dates in a long form. For example, the\r\n # American English form is \"%A, %B %d %Y\".\r\n # See http://strftime.org for details.\r\n format = ugettext(\"LONG_DATE_FORMAT\")\r\n if format == \"LONG_DATE_FORMAT\":\r\n format = DEFAULT_LONG_DATE_FORMAT\r\n elif format == \"DATE_TIME\":\r\n # Translators: the translation for \"DATE_TIME_FORMAT\" must be a format\r\n # string for formatting dates with times. For example, the American\r\n # English form is \"%b %d, %Y at %H:%M\".\r\n # See http://strftime.org for details.\r\n format = ugettext(\"DATE_TIME_FORMAT\")\r\n if format == \"DATE_TIME_FORMAT\":\r\n format = DEFAULT_DATE_TIME_FORMAT\r\n elif format == \"TIME\":\r\n format = \"%X\"\r\n\r\n def process_percent_code(match):\r\n \"\"\"\r\n Convert one percent-prefixed code in the format string.\r\n\r\n Called by re.sub just below.\r\n\r\n \"\"\"\r\n code = match.group()\r\n if code == \"%\":\r\n # This only happens if the string ends with a %, which is not legal.\r\n raise ValueError(\"strftime format ends with raw %\")\r\n\r\n if code == \"%a\":\r\n part = pgettext('abbreviated weekday name', WEEKDAYS_ABBREVIATED[dtime.weekday()])\r\n elif code == \"%A\":\r\n part = pgettext('weekday name', WEEKDAYS[dtime.weekday()])\r\n elif code == \"%b\":\r\n part = pgettext('abbreviated month name', MONTHS_ABBREVIATED[dtime.month])\r\n elif code == \"%B\":\r\n part = pgettext('month name', MONTHS[dtime.month])\r\n elif code == \"%p\":\r\n part = pgettext('am/pm indicator', AM_PM[dtime.hour // 12])\r\n elif code == \"%x\":\r\n # Get the localized short date format, and recurse.\r\n # Translators: the translation for \"SHORT_DATE_FORMAT\" must be a\r\n # format string for formatting dates in a brief form. For example,\r\n # the American English form is \"%b %d %Y\".\r\n # See http://strftime.org for details.\r\n actual_format = ugettext(\"SHORT_DATE_FORMAT\")\r\n if actual_format == \"SHORT_DATE_FORMAT\":\r\n actual_format = DEFAULT_SHORT_DATE_FORMAT\r\n if \"%x\" in actual_format:\r\n # Prevent infinite accidental recursion.\r\n actual_format = DEFAULT_SHORT_DATE_FORMAT\r\n part = strftime_localized(dtime, actual_format)\r\n elif code == \"%X\":\r\n # Get the localized time format, and recurse.\r\n # Translators: the translation for \"TIME_FORMAT\" must be a format\r\n # string for formatting times. For example, the American English\r\n # form is \"%H:%M:%S\". See http://strftime.org for details.\r\n actual_format = ugettext(\"TIME_FORMAT\")\r\n if actual_format == \"TIME_FORMAT\":\r\n actual_format = DEFAULT_TIME_FORMAT\r\n if \"%X\" in actual_format:\r\n # Prevent infinite accidental recursion.\r\n actual_format = DEFAULT_TIME_FORMAT\r\n part = strftime_localized(dtime, actual_format)\r\n else:\r\n # All the other format codes: just let built-in strftime take\r\n # care of them.\r\n part = dtime.strftime(code)\r\n\r\n return part\r\n\r\n formatted_date = re.sub(r\"%.|%\", process_percent_code, format)\r\n return formatted_date","def format(fmt, st):\n ret = \"\"\n if not st: return ret\n if fmt not in valid_combos:\n return st\n cm = charmap[fmt]\n for c in st:\n ret += cm.get(c, c)\n return ret","def normalize_format(fmt):\n # Remove shape '()' at the forefront which is equivalent to an scalar\n if fmt[:2] == '()':\n fmt = fmt[2:]\n # Accept 'S' as a synonym of 'a'\n if fmt.find('S') >= 0:\n fmt = fmt.replace('S', 'a')\n return fmt","def updateParameters(self, parameters):\n if parameters[0].value and parameters[3].value:\n if (parameters[0].altered or paramaters[3].altered) and not parameters[4].altered:\n layer = parameters[0].valueAsText;\n desc = arcpy.Describe(layer)\n name = desc.file;\n type = parameters[3].valueAsText;\n char = type[:1];\n if (char != 'U'):\n if (char != 'C'):\n char = 'C' + char; #Output _C + first letter of type unless it is U\n else:\n char = 'CT'; # Unless it is C, then it is CT... \n #Update name accordingly\n resulttmp = \"%WORKSPACE%\\\\\" + name + \"_\" + char; \n parameters[4].value = resulttmp.replace(\".\",\"\"); #Remove illegal characters\n return"],"string":"[\n \"def update_placeholder_formats(self, format_string, placeholder_formats):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if (\\n token.group(\\\"placeholder\\\")\\n and (not token.group(\\\"format\\\"))\\n and token.group(\\\"key\\\") in placeholder_formats\\n ):\\n output.append(f\\\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\\\")\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def renameFormats(self, nameDict):\\n for item in globalref.docRef.root.descendantGen():\\n item.formatName = nameDict.get(item.formatName, item.formatName)\",\n \"def _fix_fmts(self, labname, mapping):\\n default_fmt_widths = self._default_fmt_widths\\n \\n indexes = [i for i in range(self._nvar) if self._lbllist[i] == labname]\\n if indexes == []: return\\n lab_size = max([len(v) for k, v in mapping.items()])\\n fmtlist = self._fmtlist\\n typlist = self._typlist\\n isstrvar = self._isstrvar\\n for i in indexes:\\n if isstrvar(i):\\n continue # string values should not be labeled\\n old_fmt = fmtlist[i]\\n # check match agains numerical format\\n match = NUM_FMT_RE.match(old_fmt)\\n if match:\\n fmt_width = int(match.group(3))\\n if fmt_width < lab_size:\\n prefix = ('%' + (match.group(1) or '') + \\n (match.group(2) or ''))\\n suffix = (match.group(4) + match.group(5) + \\n match.group(6) + (match.group(7) or ''))\\n new_fmt = prefix + str(lab_size) + suffix\\n fmtlist[i] = new_fmt\\n self._changed = True\\n elif TIME_FMT_RE.match(old_fmt) or TB_FMT_RE.match(old_fmt):\\n continue\\n else: \\n # Here, some garbled format must have been entered. \\n # More effort could be made to identify intended format, \\n # but instead we'll just paint over it.\\n fmt_width = default_fmt_widths[typlist[i]]\\n fmtlist[i] = '%' + str(max((lab_size,fmt_width))) + '.0g'\\n self._changed = True\",\n \"def wrap_columns_name(self, format_string):\\n self._data_frame = self._data_frame.rename(\\n columns=lambda column: format_string.format(column)\\n )\",\n \"def change_format_var_parser(text, tracker):\\n param_names = format_var_parser(text)\\n param_vars = {}\\n for param_name in param_names:\\n try:\\n param_vars[param_name] = tracker.get_slot(param_name)\\n except Exception as e:\\n PYTHON_LOGGER.error(\\\"Error to get var name {}: {}\\\".format(param_name, e))\\n return text.format(**param_vars)\",\n \"def sformatf(cls, msg, *args):\\n #formats = {\\\"%t\\\": \\\"%d\\\", \\\"%0t\\\": \\\"%0d\\\"}\\n #for s in formats:\\n # msg = msg.replace(s, formats[s])\\n #return sformatf(msg, *args)\\n # TODO substitute old types %s/%d etc with {}\\n #new_msg = cls.STR_RE.sub(r'{:\\\\1}', msg)\\n #print(\\\"new_msg is \\\" + new_msg)\\n for s in cls.formats:\\n if s == \\\"%h\\\" or s == \\\"%0h\\\":\\n msg = msg.replace(s, \\\"{:X}\\\")\\n else:\\n msg = msg.replace(s, \\\"{}\\\")\\n return msg.format(*args)\",\n \"def update_name(name, mapping):\\n m = street_type_re.search(name)\\n if m:\\n street_type = m.group()\\n for key, value in mapping.iteritems():\\n if street_type == key:\\n name = name.replace(key,value)\\n\\n return name\",\n \"def formatNames(string_from):\\n return re.sub('/', '-', string_from)\",\n \"def replace_param(string, param, value, param_format=None):\\n\\n if param_format == \\\"json\\\":\\n return sub(r\\\"(?P<json_replacement>\\\\\\\"%s\\\\\\\"\\\\s*:\\\\s*)\\\\\\\"\\\\s*\\\\\\\"\\\" %\\n escape(str(param)), \\\"\\\\\\\\1\\\\\\\"%s\\\\\\\"\\\" % value, string)\\n elif param_format == \\\"header\\\":\\n return sub(r\\\"%s=[^\\\\\\\\n]*\\\" % escape(str(param)), r\\\"%s=%s\\\" %\\n (str(param).encode('string-escape'),\\n str(value).encode('string-escape')), string)\\n else:\\n return sub(r\\\"%s=[^&]*\\\" % escape(str(param)), r\\\"%s=%s\\\" %\\n (str(param).encode('string-escape'),\\n str(value).encode('string-escape')), string)\",\n \"def updatePreview(self, baseName, *args):\\n\\n prefix = str(self.prefix.text())\\n suffix = str(self.suffix.text())\\n\\n string = \\\"\\\"\\n if len(prefix) > 0:\\n string += prefix + \\\"_\\\"\\n\\n string += baseName\\n\\n if len(suffix) > 0:\\n string += \\\"_\\\" + suffix\\n\\n self.previewName.setText(string)\",\n \"def update_weight_name(repl_patterns: Dict[str, str], weight_name: str) -> str:\\n # Create a regular expression from all of the dictionary keys\\n regex = re.compile('|'.join(map(re.escape, repl_patterns.keys())))\\n\\n # For each match, look up the corresponding value in the repl_patterns dict.\\n return regex.sub(lambda match: repl_patterns[match.group(0)], weight_name)\",\n \"def rename_bindnames(tqry, li_adjust):\\n for bindname, attrname in li_adjust:\\n from_ = \\\"%(\\\" + bindname + \\\")s\\\"\\n to_ = \\\"%(\\\" + attrname + \\\")s\\\"\\n tqry = tqry.replace(from_, to_)\\n return tqry\",\n \"def FillForm(string_for_substitution, dictionary_of_vars):\\n return_string = string_for_substitution\\n for i in re.findall(\\\"//%%(.*)%%//\\\", string_for_substitution):\\n return_string = re.sub(\\\"//%%\\\" + i + \\\"%%//\\\", dictionary_of_vars[i],\\n return_string)\\n return return_string\",\n \"def format(self, varnames, fmts):\\n varnames = self._find_vars(varnames, empty_ok=False)\\n indexes = list(map(self._varlist.index, varnames))\\n \\n # check that fmts are specified properly\\n if isinstance(fmts, str):\\n fmts = fmts.split()\\n else:\\n if ( not isinstance(fmts, collections.Iterable) \\n or not all(isinstance(f, str) for f in fmts) ):\\n raise TypeError(\\\"given fmts must be str or iterable of str\\\")\\n fmts = [x for s in fmts for x in s.split()]\\n if len(fmts) == 0:\\n raise ValueError(\\\"no formats specified\\\")\\n \\n # check fmts for validity\\n is_valid = self._is_valid_fmt\\n if not all(is_valid(fmt) for fmt in fmts):\\n bad_fmts = \\\" \\\".join(fmt for fmt in fmts if not is_valid(fmt))\\n raise ValueError(\\\"invalid formats: \\\" + bad_fmts)\\n \\n # pad fmts if necessary \\n nvarnames = len(varnames)\\n nfmts = len(fmts)\\n if nfmts < nvarnames:\\n fmts = list(fmts) + [fmts[-1]]*(nvarnames - nfmts)\\n \\n # check that formats match Stata types\\n #typlist = self._typlist\\n isstrvar = self._isstrvar\\n if not all(isstrvar(i) == bool(STR_FMT_RE.match(fmt))\\n for i, fmt in zip(indexes, fmts)):\\n raise ValueError(\\\"format does not match Stata variable type\\\")\\n \\n # replace fmts (extras, if any, don't get used)\\n for i, fmt in zip(indexes, fmts):\\n self._fmtlist[i] = fmt\\n \\n # assume there are changes\\n self._changed = True\",\n \"def reformat(ctx):\\n pass\",\n \"def updateName(g):\\n try:\\n n = int(g.group(2))\\n except TypeError:\\n n = 0\\n\\n return \\\"%s-%d\\\" % (g.group(1), n + 1)\",\n \"def update_street_name(name, mapping):\\r\\n m = street_type_re.search(name)\\r\\n if m:\\r\\n street_type = m.group()\\r\\n if street_type in list(mapping.keys()):\\r\\n better_street_type = mapping[street_type]\\r\\n name = street_type_re.sub(better_street_type, name)\\r\\n return name\",\n \"def fix_label(label):\\n\\n replace_dict = {'_': ' ',\\n 'degE': '$^{\\\\circ}$E',\\n 'ms-1': '$m s^{-1}$',\\n 'm.s-1': '$m s^{-1}$',\\n 'Wm-2': '$W m^{-2}$',\\n '1000000 m2.s-1': '$10^6$m$^2$s$^{-1}$'\\n } \\n\\n for value, replacement in list(replace_dict.items()):\\n label = label.replace(value, replacement)\\n\\n return label\",\n \"def renameFields(self, nameDict):\\n for format in self.values():\\n if format.genericType in nameDict:\\n nameDict[format.name] = nameDict[format.genericType]\\n for item in globalref.docRef.root.descendantGen():\\n for oldName, newName in nameDict.get(item.formatName, []):\\n if oldName in item.data:\\n item.data[newName] = item.data[oldName]\\n del item.data[oldName]\",\n \"def _assign_label(self, format):\\n cht_tmpl = self.out_label_tmpl\\n return cht_tmpl.substitute(format)\",\n \"def dt_format_translate(pyfmt):\\n\\n translate = {\\\"%a\\\": \\\"ddd\\\",\\n \\\"%A\\\": \\\"dddd\\\",\\n \\\"%b\\\": \\\"mmm\\\",\\n \\\"%B\\\": \\\"mmmm\\\",\\n \\\"%c\\\": \\\"\\\",\\n \\\"%d\\\": \\\"dd\\\",\\n \\\"%f\\\": \\\"\\\",\\n \\\"%H\\\": \\\"hh\\\",\\n \\\"%I\\\": \\\"hh\\\",\\n \\\"%j\\\": \\\"\\\",\\n \\\"%m\\\": \\\"mm\\\",\\n \\\"%M\\\": \\\"mm\\\",\\n \\\"%p\\\": \\\"AM/PM\\\",\\n \\\"%S\\\": \\\"ss\\\",\\n \\\"%U\\\": \\\"\\\",\\n \\\"%w\\\": \\\"\\\",\\n \\\"%W\\\": \\\"\\\",\\n \\\"%x\\\": \\\"\\\",\\n \\\"%X\\\": \\\"\\\",\\n \\\"%y\\\": \\\"yy\\\",\\n \\\"%Y\\\": \\\"yyyy\\\",\\n \\\"%z\\\": \\\"\\\",\\n \\\"%Z\\\": \\\"\\\",\\n \\\"%%\\\": \\\"%\\\"}\\n\\n xlfmt = str(pyfmt)\\n\\n for item in translate:\\n if item in xlfmt:\\n xlfmt = xlfmt.replace(item, translate[item])\\n return xlfmt\",\n \"def update(name):\\n strRet = mapping(name)\\n return strRet\",\n \"def replace(self, string):\\n for i, j in self.defs.items():\\n string = string.replace(i, j)\\n return string\",\n \"def reformat_placeholders(content: str) -> str:\\n return content.replace(\\\"<MM>\\\", \\\"[[\\\").replace(\\\"</MM>\\\", \\\"]]\\\")\",\n \"def format_map(self, format_string, mapping):\\n return self.vformat(format_string, args=None, kwargs=mapping)\",\n \"def VarNameReplace(old, new, *vars):\\n\\t#syntax = [ \\\"rename variables\\\" ]\\n\\tsyntax = []\\n\\tif not vars or \\\"*\\\" in vars:\\n\\t\\tvars = None\\n\\tvd = spssaux.VariableDict(vars)\\n\\tfor v in vd:\\n\\t\\toldname = v.VariableName\\n\\t\\tnewname = oldname.replace(old,new).strip()\\n\\t\\tif newname.lower() != oldname.lower():\\n\\t\\t\\tsyntax += [ \\\"(%s=%s)\\\" % (oldname, newname) ]\\n\\tif syntax:\\n\\t\\tsyntax.insert(0, \\\"rename variables\\\")\\n\\t\\tsyntax += [ spssterm ]\\n\\t\\tif __debug__:\\n\\t\\t\\tprint \\\" \\\".join(syntax)\\n\\t\\tspss.Submit(syntax)\",\n \"def reformat(self):\\n\\t\\told_path = os.path.join( self.path, self.init_str )\\n\\t\\tnew_path = os.path.join( self.path, self.reorder() )\\n\\t\\tos.rename(old_path,new_path)\",\n \"def format_name(self):\\n\\t\\tself.full_name = self.first + \\\" \\\" + self.last\",\n \"def format_name(f_name, l_name): #docstring (documentation)\\n if f_name == \\\"\\\" or l_name == \\\"\\\":\\n return \\\"You didn't provide valid inputs.\\\"\\n formated_f_name = f_name.title()\\n formated_l_name = l_name.title()\\n return f\\\"Result: {formated_f_name} {formated_l_name}\\\"\",\n \"def transform_table_name(f):\\n @wraps(f)\\n def wrapper(*args, **kwargs):\\n largs = list(args)\\n if \\\"%\\\" in args[1]:\\n if 'transform_time' in kwargs \\\\\\n and isinstance(kwargs['transform_time'], datetime.datetime):\\n t = kwargs['transform_time']\\n else:\\n t = datetime.datetime.utcnow()\\n largs[1] = t.strftime(args[1])\\n largs = tuple(largs)\\n return f(*largs, **kwargs)\\n return wrapper\",\n \"def replace_placeholders(self, placeholder_dict):\\n\\n for placeholder, value in placeholder_dict.items():\\n placeholder_wrapped = f\\\"{self.marker_string}{placeholder}{self.marker_string}\\\"\\n\\n if placeholder not in self.unresolved_placeholders:\\n self.hd.log.warn(f\\\"Placeholder {placeholder} not found in sequence.\\\")\\n else:\\n self.sequence = self.sequence.replace(f\\\"{placeholder_wrapped}\\\", str(value))\\n self.unresolved_placeholders.discard(placeholder)\",\n \"def __makeFormatString(self):\\n self.__formatString = \\\"\\\"\\n for f in self.__columns:\\n self.__formatString += \\\"%(\\\"+ f + \\\")-\\\" + str(self.__widths[f]) + \\\\\\n \\\"s \\\"\",\n \"def reformat(self, seq_name, *, prefix=\\\"s\\\"):\\n\\t\\treturn \\\"%s_%012u\\\" % (prefix, self.get_sid(seq_name))\",\n \"def format_fss_name(original):\\n sections = original.split('_')\\n direction = sections[-1]\\n\\n code = sections[0]\\n\\n left, right = ' '.join(sections[1:-1]).split('VS')\\n if sections[-1] == \\\"DN\\\":\\n direction = '<FONT COLOR=\\\"#943126\\\">downregulated</FONT>'\\n else:\\n direction = '<FONT COLOR=\\\"#196f3d\\\">upregulated</FONT>'\\n\\n result = f\\\"< {code}<BR/>{left}vs{right}<BR/>{direction} >\\\"\\n return(result)\",\n \"def update_format_string(self):\\n if self._show_units:\\n units = \\\" {}\\\".format(self._unit)\\n else:\\n units = \\\"\\\"\\n\\n if self._show_step_exponent:\\n self.setSuffix(\\\"{0} Step: 1E{1}\\\".format(units, self.step_exponent))\\n self.lineEdit().setToolTip(\\\"\\\")\\n else:\\n self.setSuffix(units)\\n self.lineEdit().setToolTip('Step: 1E{0:+d}'.format(self.step_exponent))\",\n \"def update_name(name, mapping):\\n words_name = name.split(\\\" \\\")\\n if words_name not in expected:\\n for word in words_name:\\n if word in mapping:\\n name = name.replace(word, mapping[word])\\n \\n if word == word.lower():\\n if word not in allowed_lowercase:\\n name = name.replace(word, word.capitalize())\\n \\n if words_name[0] not in expected:\\n if words_name[0] not in mapping:\\n if words_name[0] == \\\"Fernando\\\":\\n name = \\\"Avenida \\\" + name\\n elif words_name[0] == \\\"rua\\\":\\n pass\\n else:\\n name = \\\"Rua \\\" + name\\n\\n return name\",\n \"async def edit_names(message):\\n split_message = message.content.split()\\n\\n try:\\n target_number = int(split_message[1])\\n correct_name = ' '.join(split_message[2:])\\n old_name = char_name_dict[message.author.id][target_number]\\n temp_name_bucket[message.author.id] = [target_number, correct_name]\\n\\n message_state[message.author.id] = 'EDIT'\\n await message.channel.send(f\\\"You would like to replace `{old_name}` with `{correct_name}`. If that is correct, please type `confirm` otherwise type `cancel`.\\\")\\n except:\\n print(traceback.format_exc())\",\n \"def register_string_format(name: str, strategy: st.SearchStrategy) -> None:\\n if not isinstance(name, str):\\n raise TypeError(f\\\"name must be of type {str}, not {type(name)}\\\")\\n if not isinstance(strategy, st.SearchStrategy):\\n raise TypeError(f\\\"strategy must be of type {st.SearchStrategy}, not {type(strategy)}\\\")\\n\\n STRING_FORMATS[name] = strategy\",\n \"def convert_format(self, new_format):\\n if new_format not in [0, 1, 2, 3]:\\n raise ValueError(\\\"Unknown format specified\\\")\\n\\n inp_format = new_format\\n if inp_format == 3:\\n new_format = 2\\n\\n for block in self.frd.blocks:\\n if hasattr(block, 'format'):\\n block.format = new_format\\n\\n self.frd.node_block.format = inp_format\",\n \"def doEdit(var, value, target):\\n currentValue = target.get(var, \\\"\\\")\\n newValue = Simplifier.simplify(str(value).replace(f\\\"{{{var}}}\\\", str(currentValue)))\\n target[var] = newValue\",\n \"def _interpolate(string):\\n return string % env.project\",\n \"def update(self, database_vals):\\n # TODO : handle evaluation delimited by $. Imply a try except\\n vals = {d: database_vals[d] for d in self.depend_on}\\n new_val = self.formatting.format(**vals)\\n deferred_call(setattr, self, 'value', new_val)\",\n \"def formatter(text):\\n repl_map = {\\n \\\"degC\\\": \\\"$^o$C\\\",\\n \\\"K\\\": \\\"$^o$C\\\",\\n \\\"month-1\\\": \\\"month$^{{-1}}$\\\",\\n \\\"day-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"d-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"decade-1\\\": \\\"decade$^{{-1}}$\\\",\\n \\\"year-1\\\": \\\"year$^{{-1}}$\\\",\\n \\\"rcp85\\\": \\\"RCP8.5\\\",\\n \\\"rcp45\\\": \\\"RCP4.5\\\",\\n \\\"rcp26\\\": \\\"RCP2.6\\\",\\n \\\"RCP85\\\": \\\"RCP8.5\\\",\\n \\\"RCP45\\\": \\\"RCP4.5\\\",\\n \\\"RCP26\\\": \\\"RCP2.6\\\",\\n \\\"cmip5-85\\\": \\\"RCP8.5\\\",\\n \\\"cmip5-60\\\": \\\"RCP6.0\\\",\\n \\\"cmip5-45\\\": \\\"RCP4.5\\\",\\n \\\"cmip5-26\\\": \\\"RCP2.6\\\",\\n \\\"ssp585\\\": \\\"SSP5-8.5\\\",\\n \\\"ssp245\\\": \\\"SSP2-4.5\\\",\\n \\\"ssp126\\\": \\\"SSP1-2.6\\\",\\n \\\"SSP585\\\": \\\"SSP5-8.5\\\",\\n \\\"SSP245\\\": \\\"SSP2-4.5\\\",\\n \\\"SSP126\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-85\\\": \\\"SSP5-8.5\\\",\\n \\\"cmip6-70\\\": \\\"SSP3-7.0\\\",\\n \\\"cmip6-60\\\": \\\"SSP4-6.0\\\",\\n \\\"cmip6-34\\\": \\\"SSP4-3.4\\\",\\n \\\"cmip6-45\\\": \\\"SSP2-4.5\\\",\\n \\\"cmip6-26\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-19\\\": \\\"SSP1-1.9\\\",\\n \\\"1\\\": \\\"%\\\",\\n \\\"era5\\\": \\\"ERA5\\\",\\n \\\"gpcc025x025_v8\\\": \\\"GPCC\\\",\\n \\\"cru\\\": \\\"CRU\\\",\\n \\\"jra55\\\": \\\"JRA55\\\",\\n \\\"HIGHRESMIP\\\": \\\"HighResMIP\\\",\\n \\\" \\\": \\\"\\\",\\n }\\n for key, val in repl_map.items():\\n if key in text:\\n text = text.replace(key, val)\\n break\\n return text\",\n \"def update_short_name(name):\\n # First verify that the common errors have been fixed\\n name = update_street_name(name)\\n\\n # Find the abbreviation to replace\\n m = over_abbr_re.search(name)\\n if m:\\n if m.group() in abbreviations:\\n name = over_abbr_re.sub(abbreviations[m.group()], name)\\n\\n return name\",\n \"def fmt(competitor_name: str) -> str:\\n name = competitor_name.replace(\\\"_a\\\", r\\\" $\\\\alpha$ \\\")\\n name = name.replace(\\\"_b\\\", r\\\" $\\\\beta$ \\\")\\n return name\",\n \"def custom_strftime(format, t): \\n return t.strftime(format).replace(\\\"{S}\\\", str(t.day) + suffix(t.day))\",\n \"def str_replace(data):\\n for key, value in data.items():\\n if isinstance(value, (str, unicode)):\\n data[key] = value.format(**data)\",\n \"def format_name(f_name, l_name):\\n #Using an early return if inputs aren't valid\\n if f_name == \\\"\\\" or l_name == \\\"\\\":\\n return \\\"You didn't provide valid inputs.\\\"\\n\\n formatted_f_name = f_name.title()\\n formatted_l_name = l_name.title()\\n\\n #Returning a formatted string when inputs are valid\\n return f\\\"{formatted_f_name} {formatted_l_name}\\\"\",\n \"def _interpolate(format):\\n from tokenize import tokenprog\\n\\n def matchorfail(text, pos):\\n match = tokenprog.match(text, pos)\\n if match is None:\\n raise _ItplError(text, pos)\\n return match, match.end()\\n\\n namechars = \\\"abcdefghijklmnopqrstuvwxyz\\\" \\\\\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\\\";\\n chunks = []\\n pos = 0\\n\\n while 1:\\n dollar = format.find(\\\"$\\\", pos)\\n if dollar < 0: \\n break\\n nextchar = format[dollar + 1]\\n\\n if nextchar == \\\"{\\\":\\n chunks.append((0, format[pos:dollar]))\\n pos, level = dollar + 2, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token == \\\"{\\\": \\n level = level + 1\\n elif token == \\\"}\\\": \\n level = level - 1\\n chunks.append((1, format[dollar + 2:pos - 1]))\\n\\n elif nextchar in namechars:\\n chunks.append((0, format[pos:dollar]))\\n match, pos = matchorfail(format, dollar + 1)\\n while pos < len(format):\\n if format[pos] == \\\".\\\" and \\\\\\n pos + 1 < len(format) and format[pos + 1] in namechars:\\n match, pos = matchorfail(format, pos + 1)\\n elif format[pos] in \\\"([\\\":\\n pos, level = pos + 1, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token[0] in \\\"([\\\": \\n level = level + 1\\n elif token[0] in \\\")]\\\": \\n level = level - 1\\n else: \\n break\\n chunks.append((1, format[dollar + 1:pos]))\\n else:\\n chunks.append((0, format[pos:dollar + 1]))\\n pos = dollar + 1 + (nextchar == \\\"$\\\")\\n\\n if pos < len(format): \\n chunks.append((0, format[pos:]))\\n return chunks\",\n \"def markup_text(self, text):\\n for moniker, name in S['names'].items():\\n text = text.replace('${0}'.format(moniker.split('_')[1]), name)\\n return text\",\n \"def update_column_format(self):\\n pass\",\n \"def update_named_font(self, *a, **kw):\\n return update_named_font(*a, **kw)\",\n \"def date_string_to_strftime_format(date_string):\\n for data in STRF_DATA:\\n for pattern in data.get('patterns', []):\\n if pattern in date_string:\\n date_string = date_string.replace(pattern, data['replacement'])\\n break\\n else:\\n if data.get('regex'):\\n date_string = re.sub(data['regex'], data['replacement'], date_string)\\n # matches = find()\\n # if any(matches):\\n # date_string = date_string.replace(matches[0], data['replacement'])\\n\\n return date_string\",\n \"def undo_format_field_name(field_name):\\n if json_api_settings.FORMAT_FIELD_NAMES:\\n return format_value(field_name, \\\"underscore\\\")\\n\\n return field_name\",\n \"def fileRename(current_file,num,digits):\\n # Key, value pairs of what to replace.\\n dictobj = {\\n '<num>': get_numbering_format(digits, num),\\n '<datetaken>': date_to_string(get_date_taken(current_file),'%Y%m%d__%H_%M'),\\n '<dname>': dirname\\n }\\n # Rename\\n new_filename = multi_replace(filename_pattern, dictobj)\\n shutil.move(current_file, new_filename)\",\n \"def format_string_2(file_num, float_num1, int_num, float_num2):\\n\\n result = f\\\"file_{file_num:0>3d} :{float_num1:9.2f}, {int_num:.2e}, {float_num2:.3g}\\\"\\n print(result)\\n return result\",\n \"def set_format(cls,format):\\n import __main__\\n IP = __main__.__dict__['__IP']\\n prompt = getattr(IP.outputcache,cls._prompt)\\n prompt.p_template = format\\n prompt.set_p_str()\\n cls._format = format\",\n \"def replace_in_string(s, args_dict):\\n for key, value in args_dict.items():\\n s = s.replace(key, value)\\n for key, value in args_dict.items():\\n s = s.replace(key, value)\\n for key, value in args_dict.items():\\n s = s.replace(key, value)\\n return s\",\n \"def setFormattedStrings(object, event):\\n entry = interfaces.IBiblatexEntry(object) # assert a biblatex entry object\\n generator = interfaces.IFormattedEntryGenerator(entry)\\n writer = interfaces.IWriteFormatted(entry)\\n config = zope.component.queryUtility(\\n interfaces.IBiblatexConfiguration, \\n context = object)\\n if config:\\n languages = config.languages\\n styles = config.styles\\n else:\\n languages = styles = (None,)\\n for language in languages:\\n for style in styles:\\n #raise Exception(u\\\"language: %s, style: %s\\\" % (language, style))\\n generator.setUp(language = language, style = style)\\n generator.generate()\\n writer.setBibliographicEntry(generator.getBibliographicEntry(), language, style)\\n writer.setCitation(generator.getCitation(), language, style)\\n writer.setCitationAgain(generator.getCitationAgain(), language, style)\\n generator.tearDown()\\n del generator\\n del writer\",\n \"def strfdate(self, fmt):\\n pattern = r'%({})'.format(reduce(lambda x, y: '{}|{}'.format(x, y), FORMAT_MAP.keys()))\\n for f in re.findall(pattern, fmt):\\n fmt = fmt.replace('%{}'.format(f), FORMAT_MAP[f](self))\\n return fmt\",\n \"def set_text_f(self, format, *args):\\n self._text.set(format % args)\\n self.change_bg(\\\"green\\\")\\n self._label.update_idletasks()\",\n \"def edit_format(sample, **kwargs):\\n n_call_data = vcf.model.make_calldata_tuple(sample.data._fields + tuple(kwargs.keys()))\\n n_data = tuple(kwargs.values())\\n sample.data += n_data\\n sample.data = n_call_data(*sample.data)\",\n \"def format_color_name(string, frame_name):\\n if frame_name == \\\"primary\\\":\\n color = \\\"red\\\"\\n else:\\n color = \\\"green\\\"\\n return format_color(string, color)\",\n \"def line_replacer(config,change_this_line,key):\\n for arg in config['HyperParameter'][key]: \\n pattern=r'{}[ ]*=.*,'.format(arg)\\n replace_value=config['HyperParameter'][key][arg][counter]\\n if type(replace_value) is str:\\n replace_value=\\\"'\\\"+replace_value+\\\"'\\\"\\n change_this_line=re.sub(pattern,\\\"{}= {},\\\".format(arg,replace_value),change_this_line)\\n return change_this_line\",\n \"def adjust_name_for_printing(name):\\n if name is not None:\\n name2 = name\\n name = name.replace(\\\" \\\", \\\"_\\\").replace(\\\".\\\", \\\"_\\\").replace(\\\"-\\\", \\\"_m_\\\")\\n name = name.replace(\\\"+\\\", \\\"_p_\\\").replace(\\\"!\\\", \\\"_I_\\\")\\n name = name.replace(\\\"**\\\", \\\"_xx_\\\").replace(\\\"*\\\", \\\"_x_\\\")\\n name = name.replace(\\\"/\\\", \\\"_l_\\\").replace(\\\"@\\\", '_at_')\\n name = name.replace(\\\"(\\\", \\\"_of_\\\").replace(\\\")\\\", \\\"\\\")\\n if re.match(r'^[a-zA-Z_][a-zA-Z0-9-_]*$', name) is None:\\n raise NameError(\\\"name {} converted to {} cannot be further converted to valid python variable name!\\\".format(name2, name))\\n return name\\n return ''\",\n \"def format_like(s: str, escape='\\\\\\\\') -> str:\\n return '%{}%'.format(s.replace('%', escape+'%').replace('_', escape+'_'))\",\n \"def replace_with(*, replacement, f=DECORATED):\\n return replacement\",\n \"def adjust_date_format(date, format_in, format_out):\\n return datetime.strptime(date, format_in).strftime(format_out)\",\n \"def format(self, fmt):\\n if fmt not in [\\\".jpg\\\", \\\"jpg\\\", \\\".png\\\", \\\"png\\\"]:\\n raise ValueError(f\\\"Invalid format: {fmt}\\\")\\n if fmt.find(\\\".\\\") != 0:\\n fmt = \\\".\\\" + fmt\\n self._format = fmt\",\n \"def format_name(field_name):\\r\\n if field_name == \\\"celebration_tier\\\":\\r\\n return \\\"{wLargesse{n\\\"\\r\\n return \\\"{w%s{n\\\" % field_name.capitalize()\",\n \"def format(self, *args, **kwargs) -> String:\\n pass\",\n \"def format_string_1(file_num, float_num1, int_num, float_num2):\\n\\n text = \\\"file_{:0>3d} :{:9.2f}, {:.2e}, {:.3g}\\\"\\n result = text.format(file_num, float_num1, int_num, float_num2)\\n print(result)\\n return result\",\n \"def register_code_name(code_name,format_name):\\n if format_name not in data_format_parser:\\n raise ValueError(\\\"unknown format_name: {:s}\\\".format(format_name))\\n code_name_map[code_name] = format_name\",\n \"def replace_params(self):\\n raw_sql = self.raw_sql\\n for placeholder in self.to_replace:\\n newreg = re.compile(placeholder)\\n repl = self.get_replacement_value(placeholder)\\n if repl:\\n raw_sql = newreg.sub(str(repl), raw_sql)\\n self.sql = raw_sql\",\n \"def username_format(self, username_format):\\n\\n self._username_format = username_format\",\n \"def reformat():\\n toolkit.reformat()\",\n \"def update_format(self, record):\\n prefix = \\\"\\\\u001b[\\\"\\n color = f\\\"{prefix}{self.color_map[record.levelno]}m\\\"\\n bold = f\\\"{prefix}1m\\\"\\n gray = f\\\"{prefix}1m{prefix}30m\\\"\\n reset = f\\\"{prefix}0m\\\"\\n self._style._fmt = (\\n f\\\"%(asctime)s\\\"\\n f\\\" {gray}│{reset} {color}%(levelname)-8s{reset} {gray}│{reset} \\\"\\n )\\n if hasattr(record, \\\"function\\\"):\\n self._style._fmt += (\\n f\\\"{gray}%(indent)s{reset}\\\"\\n f\\\"{bold}%(function)s{reset}{gray}:{reset}\\\"\\n \\\" %(message)s\\\"\\n )\\n else:\\n self._style._fmt += \\\"%(indent)s%(message)s\\\"\",\n \"def w__format(self, string):\\n s = ''\\n for i in range(0, len(string) - 1, 2):\\n s = s + \\\"%03s\\\" % string[i:i + 2]\\n return s[1:]\",\n \"def replace_with(*, replacement='hello', f=DECORATED):\\n return replacement\",\n \"def register_filename_format(format_name,parser):\\n if format_name == \\\"ALL\\\":\\n raise ValueError(\\\"filename format code ALL is reserved\\\")\\n\\n filename_format_parser[format_name] = parser\",\n \"def vformat(self, format_string, args, kwargs):\\n self._used_kwargs = {}\\n self._unused_kwargs = {}\\n return super(MemorizeFormatter, self).vformat(format_string, args, kwargs)\",\n \"def test_update_multiecho_name():\\n # Standard name update\\n fn = 'sub-X_ses-Y_task-Z_run-01_bold'\\n metadata = {'EchoTime': 0.01,\\n 'EchoNumber': 1}\\n echo_times = [0.01, 0.02, 0.03]\\n out_fn_true = 'sub-X_ses-Y_task-Z_run-01_echo-1_bold'\\n out_fn_test = update_multiecho_name(metadata, fn, echo_times)\\n assert out_fn_test == out_fn_true\\n # EchoNumber field is missing from metadata, so use echo_times\\n metadata = {'EchoTime': 0.01}\\n out_fn_test = update_multiecho_name(metadata, fn, echo_times)\\n assert out_fn_test == out_fn_true\\n # Catch an unsupported type and *do not* update\\n fn = 'sub-X_ses-Y_task-Z_run-01_phasediff'\\n out_fn_test = update_multiecho_name(metadata, fn, echo_times)\\n assert out_fn_test == fn\",\n \"def substitute_names(tmpl_string, dct):\\n return Template(tmpl_string).substitute(dct)\",\n \"def OnRenameTimer(self):\\r\\n\\r\\n self.EditLabel(self._current, self._curColumn)\",\n \"def format_colname(name):\\n colnames = [\\n \\\"AV\\\",\\n \\\"RV\\\",\\n \\\"EBV\\\",\\n \\\"CAV1\\\",\\n \\\"CAV2\\\",\\n \\\"CAV3\\\",\\n \\\"CAV4\\\",\\n \\\"C1\\\",\\n \\\"C2\\\",\\n \\\"C3\\\",\\n \\\"C4\\\",\\n \\\"x_o\\\",\\n \\\"gamma\\\",\\n \\\"bump_area\\\",\\n \\\"fh2\\\",\\n \\\"nhtot\\\",\\n \\\"nh2\\\",\\n \\\"nhi\\\",\\n \\\"NH_AV\\\",\\n \\\"NH_EBV\\\",\\n ]\\n plotnames = [\\n \\\"$A(V)$\\\",\\n \\\"$R(V)$\\\",\\n \\\"$E(B-V)$\\\",\\n \\\"$C^{A(V)}_1$\\\",\\n \\\"$C^{A(V)}_2$\\\",\\n \\\"$C^{A(V)}_3$\\\",\\n \\\"$C^{A(V)}_4$\\\",\\n \\\"$C_1$\\\",\\n \\\"$C_2$\\\",\\n \\\"$C_3$\\\",\\n \\\"$C_4$\\\",\\n \\\"$x_o$\\\",\\n r\\\"$\\\\gamma$\\\",\\n r\\\"$\\\\pi C^{A(V)}_3 / 2 \\\\gamma$\\\",\\n \\\"$f(H_2)$\\\",\\n \\\"$N(H)$\\\",\\n \\\"$N(H_2)$\\\",\\n \\\"$N(HI)$\\\",\\n \\\"$N(H)/A(V)$\\\",\\n \\\"$N(H)/E(B-V)$\\\",\\n ]\\n dic_pairs = dict(zip(colnames, plotnames))\\n\\n out_name = name\\n if name[:3] == \\\"log\\\":\\n out_name = r\\\"$\\\\log (\\\" + name[3:].upper() + \\\")$\\\"\\n elif name in dic_pairs.keys():\\n out_name = dic_pairs[name]\\n\\n return out_name\",\n \"def fix_name(row, index, name_map):\\n # print(\\\"Input row: {}\\\".format(row))\\n name = row[index].strip()\\n # print(\\\"Name entry is {}\\\".format(name))\\n if name.endswith(\\\" (yourself)\\\"):\\n name = name[:-len(\\\" (yourself)\\\")]\\n # print(\\\"Shortening to |{}|\\\".format(name))\\n if name not in name_map:\\n name_map[name] = name # Initially the identity transform\\n row[index] = name_map[name]\",\n \"def _format_label(self, lbl, plot_src):\\n lbl.text = \\\"{0:}\\\".format(plot_src.name)\",\n \"def update_name(name, mapping): \\n words = name.split()\\n for w in range(len(words)):\\n if words[w] in mapping:\\n #print words[w]\\n words[w] = mapping[words[w]]\\n name = \\\" \\\".join(words)\\n return name\",\n \"def asformat(self, format):\",\n \"def _substitute(template, fuzzer, benchmark):\\n return template.format(fuzzer=fuzzer, benchmark=benchmark)\",\n \"def TransformNames(self) -> _n_2_t_0[str]:\",\n \"def _format(self):\\n min_value = self.replacements.get(str(self.min), str(self.min))\\n max_value = self.replacements.get(str(self.max), str(self.max))\\n l_brace = '(' if min_value.find('inf') != -1 else '['\\n r_brace = ')' if max_value.find('inf') != -1 else ']'\\n\\n return '{l_brace}{min_value}, {max_value}{r_brace}'.format(\\n l_brace=l_brace, r_brace=r_brace,\\n min_value=min_value, max_value=max_value)\",\n \"def _substitute(template, files, user_values):\\n # Get all placeholder names\\n placeholders = _get_placeholders(template)\\n\\n # Pre-fill placeholders based on existing file aliases\\n placeholder_values = _prefill_placeholders(placeholders, files,\\n user_values)\\n\\n # Add user specified values for the placeholders\\n placeholder_values.update(**user_values)\\n\\n # Check whether all placeholder values are now properly provided.\\n provided = set(placeholder_values.keys())\\n needed = set(placeholders)\\n missing = needed - provided\\n if len(missing) > 0:\\n raise ValueError('Cannot construct filename, because the following '\\n 'parameters are missing: %s' % missing)\\n\\n # Do the substitution\\n return template.format(**placeholder_values)\",\n \"def renameUI(*args, **kwargs)->AnyStr:\\n pass\",\n \"def _replace_config_variables(self, string, node_id, cluster_name, region):\\n\\n if node_id:\\n string = string.replace(\\\"{instance_id}\\\", node_id)\\n if cluster_name:\\n string = string.replace(\\\"{cluster_name}\\\", cluster_name)\\n if region:\\n string = string.replace(\\\"{region}\\\", region)\\n return string\",\n \"def rename_cmip6_raw(ds, dim_name_di, printing=False, debug=False, verbose=False):\\n ds = ds.copy()\\n source_id = ds.attrs['source_id']\\n \\n # Check if there is an entry in the dict matching the source id\\n if debug:\\n print(dim_name_di.keys())\\n # rename variables\\n if len(dim_name_di) == 0:\\n warnings.warn('input dictionary empty for source_id: `%s`. Please add values to https://github.com/jbusecke/cmip6_preprocessing/blob/master/cmip6_preprocessing/preprocessing.py' %ds.attrs['source_id'])\\n else:\\n \\n for di in dim_name_di.keys():\\n \\n if debug or printing or verbose:\\n print(di)\\n print(dim_name_di[di])\\n \\n # make sure the input is a list\\n if isinstance(dim_name_di[di], str):\\n dim_name_di[di] = [dim_name_di[di]]\\n \\n \\n if di in ds.variables:\\n # if the desired key is already present do nothing\\n if printing:\\n print(\\\"Skipped renaming for [%s]. Name already correct.\\\" % di)\\n \\n else:\\n \\n # Track if the dimension was renamed already...\\n # For some source ids (e.g. CNRM-ESM2-1) the key 'x':['x', 'lon'], leads to problems\\n # because it renames the 2d lon in the gr grid into x. Ill try to fix this, below.\\n # But longterm its probably better to go and put out another rename dict for gn and \\n # go back to not support lists of dim names. \\n \\n # For now just stop in the list if the dimension is already there, or one 'hit'\\n # was already encountered.\\n trigger = False\\n for wrong in dim_name_di[di]:\\n if printing:\\n print('Processing %s. Trying to replace %s' %(di, wrong))\\n if wrong in ds.variables or wrong in ds.dims:\\n if not trigger:\\n if debug:\\n print('Changing %s to %s' %(wrong, di))\\n ds = ds.rename({wrong: di})\\n trigger = True\\n if printing:\\n print('Renamed.')\\n else:\\n if wrong is None:\\n if printing:\\n print(\\\"No variable available for [%s]\\\" % di)\\n return ds\",\n \"def strftime_localized(dtime, format): # pylint: disable=redefined-builtin\\r\\n\\r\\n if format == \\\"SHORT_DATE\\\":\\r\\n format = \\\"%x\\\"\\r\\n elif format == \\\"LONG_DATE\\\":\\r\\n # Translators: the translation for \\\"LONG_DATE_FORMAT\\\" must be a format\\r\\n # string for formatting dates in a long form. For example, the\\r\\n # American English form is \\\"%A, %B %d %Y\\\".\\r\\n # See http://strftime.org for details.\\r\\n format = ugettext(\\\"LONG_DATE_FORMAT\\\")\\r\\n if format == \\\"LONG_DATE_FORMAT\\\":\\r\\n format = DEFAULT_LONG_DATE_FORMAT\\r\\n elif format == \\\"DATE_TIME\\\":\\r\\n # Translators: the translation for \\\"DATE_TIME_FORMAT\\\" must be a format\\r\\n # string for formatting dates with times. For example, the American\\r\\n # English form is \\\"%b %d, %Y at %H:%M\\\".\\r\\n # See http://strftime.org for details.\\r\\n format = ugettext(\\\"DATE_TIME_FORMAT\\\")\\r\\n if format == \\\"DATE_TIME_FORMAT\\\":\\r\\n format = DEFAULT_DATE_TIME_FORMAT\\r\\n elif format == \\\"TIME\\\":\\r\\n format = \\\"%X\\\"\\r\\n\\r\\n def process_percent_code(match):\\r\\n \\\"\\\"\\\"\\r\\n Convert one percent-prefixed code in the format string.\\r\\n\\r\\n Called by re.sub just below.\\r\\n\\r\\n \\\"\\\"\\\"\\r\\n code = match.group()\\r\\n if code == \\\"%\\\":\\r\\n # This only happens if the string ends with a %, which is not legal.\\r\\n raise ValueError(\\\"strftime format ends with raw %\\\")\\r\\n\\r\\n if code == \\\"%a\\\":\\r\\n part = pgettext('abbreviated weekday name', WEEKDAYS_ABBREVIATED[dtime.weekday()])\\r\\n elif code == \\\"%A\\\":\\r\\n part = pgettext('weekday name', WEEKDAYS[dtime.weekday()])\\r\\n elif code == \\\"%b\\\":\\r\\n part = pgettext('abbreviated month name', MONTHS_ABBREVIATED[dtime.month])\\r\\n elif code == \\\"%B\\\":\\r\\n part = pgettext('month name', MONTHS[dtime.month])\\r\\n elif code == \\\"%p\\\":\\r\\n part = pgettext('am/pm indicator', AM_PM[dtime.hour // 12])\\r\\n elif code == \\\"%x\\\":\\r\\n # Get the localized short date format, and recurse.\\r\\n # Translators: the translation for \\\"SHORT_DATE_FORMAT\\\" must be a\\r\\n # format string for formatting dates in a brief form. For example,\\r\\n # the American English form is \\\"%b %d %Y\\\".\\r\\n # See http://strftime.org for details.\\r\\n actual_format = ugettext(\\\"SHORT_DATE_FORMAT\\\")\\r\\n if actual_format == \\\"SHORT_DATE_FORMAT\\\":\\r\\n actual_format = DEFAULT_SHORT_DATE_FORMAT\\r\\n if \\\"%x\\\" in actual_format:\\r\\n # Prevent infinite accidental recursion.\\r\\n actual_format = DEFAULT_SHORT_DATE_FORMAT\\r\\n part = strftime_localized(dtime, actual_format)\\r\\n elif code == \\\"%X\\\":\\r\\n # Get the localized time format, and recurse.\\r\\n # Translators: the translation for \\\"TIME_FORMAT\\\" must be a format\\r\\n # string for formatting times. For example, the American English\\r\\n # form is \\\"%H:%M:%S\\\". See http://strftime.org for details.\\r\\n actual_format = ugettext(\\\"TIME_FORMAT\\\")\\r\\n if actual_format == \\\"TIME_FORMAT\\\":\\r\\n actual_format = DEFAULT_TIME_FORMAT\\r\\n if \\\"%X\\\" in actual_format:\\r\\n # Prevent infinite accidental recursion.\\r\\n actual_format = DEFAULT_TIME_FORMAT\\r\\n part = strftime_localized(dtime, actual_format)\\r\\n else:\\r\\n # All the other format codes: just let built-in strftime take\\r\\n # care of them.\\r\\n part = dtime.strftime(code)\\r\\n\\r\\n return part\\r\\n\\r\\n formatted_date = re.sub(r\\\"%.|%\\\", process_percent_code, format)\\r\\n return formatted_date\",\n \"def format(fmt, st):\\n ret = \\\"\\\"\\n if not st: return ret\\n if fmt not in valid_combos:\\n return st\\n cm = charmap[fmt]\\n for c in st:\\n ret += cm.get(c, c)\\n return ret\",\n \"def normalize_format(fmt):\\n # Remove shape '()' at the forefront which is equivalent to an scalar\\n if fmt[:2] == '()':\\n fmt = fmt[2:]\\n # Accept 'S' as a synonym of 'a'\\n if fmt.find('S') >= 0:\\n fmt = fmt.replace('S', 'a')\\n return fmt\",\n \"def updateParameters(self, parameters):\\n if parameters[0].value and parameters[3].value:\\n if (parameters[0].altered or paramaters[3].altered) and not parameters[4].altered:\\n layer = parameters[0].valueAsText;\\n desc = arcpy.Describe(layer)\\n name = desc.file;\\n type = parameters[3].valueAsText;\\n char = type[:1];\\n if (char != 'U'):\\n if (char != 'C'):\\n char = 'C' + char; #Output _C + first letter of type unless it is U\\n else:\\n char = 'CT'; # Unless it is C, then it is CT... \\n #Update name accordingly\\n resulttmp = \\\"%WORKSPACE%\\\\\\\\\\\" + name + \\\"_\\\" + char; \\n parameters[4].value = resulttmp.replace(\\\".\\\",\\\"\\\"); #Remove illegal characters\\n return\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7112868","0.6138306","0.60262024","0.60064745","0.5947875","0.5682744","0.5643566","0.5574067","0.5571616","0.5536187","0.5533459","0.545436","0.5446608","0.5419904","0.539936","0.53418016","0.5337642","0.5330448","0.53120375","0.5303506","0.5267097","0.52625644","0.52379227","0.5234319","0.52196205","0.5217962","0.5208606","0.5203752","0.52023137","0.51803064","0.5175924","0.5151957","0.5139591","0.51289487","0.512607","0.5120324","0.51127154","0.5107696","0.51042634","0.5104196","0.5090387","0.50823325","0.5080351","0.50786734","0.5078603","0.50722677","0.50703067","0.50697726","0.50691885","0.50682545","0.5064103","0.50395876","0.50289315","0.5018929","0.5005409","0.4994267","0.4992165","0.49861625","0.49825096","0.49760148","0.49713245","0.4967435","0.49671316","0.49574465","0.49536112","0.49519706","0.4949248","0.49451312","0.49450988","0.49409023","0.49384296","0.49287224","0.49277726","0.4924541","0.4913871","0.49107614","0.49094462","0.49032193","0.4890608","0.4882596","0.48779368","0.48692435","0.4867755","0.48598078","0.4855166","0.48498067","0.48481545","0.4839047","0.48306677","0.48281664","0.48144346","0.48131162","0.48094463","0.48085898","0.47987106","0.4798335","0.479736","0.47936144","0.4781583","0.47755322"],"string":"[\n \"0.7112868\",\n \"0.6138306\",\n \"0.60262024\",\n \"0.60064745\",\n \"0.5947875\",\n \"0.5682744\",\n \"0.5643566\",\n \"0.5574067\",\n \"0.5571616\",\n \"0.5536187\",\n \"0.5533459\",\n \"0.545436\",\n \"0.5446608\",\n \"0.5419904\",\n \"0.539936\",\n \"0.53418016\",\n \"0.5337642\",\n \"0.5330448\",\n \"0.53120375\",\n \"0.5303506\",\n \"0.5267097\",\n \"0.52625644\",\n \"0.52379227\",\n \"0.5234319\",\n \"0.52196205\",\n \"0.5217962\",\n \"0.5208606\",\n \"0.5203752\",\n \"0.52023137\",\n \"0.51803064\",\n \"0.5175924\",\n \"0.5151957\",\n \"0.5139591\",\n \"0.51289487\",\n \"0.512607\",\n \"0.5120324\",\n \"0.51127154\",\n \"0.5107696\",\n \"0.51042634\",\n \"0.5104196\",\n \"0.5090387\",\n \"0.50823325\",\n \"0.5080351\",\n \"0.50786734\",\n \"0.5078603\",\n \"0.50722677\",\n \"0.50703067\",\n \"0.50697726\",\n \"0.50691885\",\n \"0.50682545\",\n \"0.5064103\",\n \"0.50395876\",\n \"0.50289315\",\n \"0.5018929\",\n \"0.5005409\",\n \"0.4994267\",\n \"0.4992165\",\n \"0.49861625\",\n \"0.49825096\",\n \"0.49760148\",\n \"0.49713245\",\n \"0.4967435\",\n \"0.49671316\",\n \"0.49574465\",\n \"0.49536112\",\n \"0.49519706\",\n \"0.4949248\",\n \"0.49451312\",\n \"0.49450988\",\n \"0.49409023\",\n \"0.49384296\",\n \"0.49287224\",\n \"0.49277726\",\n \"0.4924541\",\n \"0.4913871\",\n \"0.49107614\",\n \"0.49094462\",\n \"0.49032193\",\n \"0.4890608\",\n \"0.4882596\",\n \"0.48779368\",\n \"0.48692435\",\n \"0.4867755\",\n \"0.48598078\",\n \"0.4855166\",\n \"0.48498067\",\n \"0.48481545\",\n \"0.4839047\",\n \"0.48306677\",\n \"0.48281664\",\n \"0.48144346\",\n \"0.48131162\",\n \"0.48094463\",\n \"0.48085898\",\n \"0.47987106\",\n \"0.4798335\",\n \"0.479736\",\n \"0.47936144\",\n \"0.4781583\",\n \"0.47755322\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6070207"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":94767,"cells":{"query":{"kind":"string","value":"Update a format string adding formats if they are not already present."},"document":{"kind":"string","value":"def update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\n and token.group(\"key\") in placeholder_formats\n ):\n output.append(f\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\")\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)"},"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 AddFormat(self, format):\n self._legacy = False\n if format:\n self._format = format","def addIfMissing(self, format):\n self.setdefault(format.name, format)","def _translate_fmts(self):\n fmt_info = []\n fmt_append = fmt_info.append\n \n isvalid = self._is_valid_fmt\n typlist = self._typlist\n isstrvar = self._isstrvar\n default_fmts = self._default_fmts\n \n for i, fmt in enumerate(self._fmtlist):\n fmt = fmt.strip()\n \n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\n \n if iscalendar or not isvalid(fmt):\n if isstrvar(i):\n wid = min(typlist[i], 10)\n fmt_append(('s', \"{{:>{}s}}\".format(wid), wid))\n continue\n else:\n fmt = default_fmts[typlist[i]]\n \n last_char = fmt[-1]\n if last_char == 's': # string\n m = STR_FMT_RE.match(fmt)\n align, _, wid = m.group(1), m.group(2), m.group(3)\n new_align = (\"<\" if align == \"-\" \n else \"^\" if align == \"~\" else \">\")\n new = \"\".join((\"{:\", new_align, wid, \"s}\"))\n fmt_append(('s', new, int(wid)))\n elif last_char == 'H' or last_char == 'L': # binary\n fmt_append((last_char, fmt, int(fmt[1:-1])))\n elif last_char == 'x': # hexadecimal\n fmt_append(('x', fmt, 21))\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\n m = NUM_FMT_RE.match(fmt)\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \n m.group(3), m.group(4),\n m.group(5), m.group(6),\n m.group(7))\n aln = \"<\" if align == \"-\" else \">\"\n sep = \",\" if com is not None else \"\"\n if type == \"g\" and int(prec) == 0:\n new = \"\".join((\"{:\", aln, wid, sep, type, \"}\"))\n else:\n new = \"\".join((\"{:\", aln, wid, sep, \".\", prec, type, \"}\"))\n fmt_append((type, new, int(wid), delim, com))\n \n return fmt_info","def sformatf(cls, msg, *args):\n #formats = {\"%t\": \"%d\", \"%0t\": \"%0d\"}\n #for s in formats:\n # msg = msg.replace(s, formats[s])\n #return sformatf(msg, *args)\n # TODO substitute old types %s/%d etc with {}\n #new_msg = cls.STR_RE.sub(r'{:\\1}', msg)\n #print(\"new_msg is \" + new_msg)\n for s in cls.formats:\n if s == \"%h\" or s == \"%0h\":\n msg = msg.replace(s, \"{:X}\")\n else:\n msg = msg.replace(s, \"{}\")\n return msg.format(*args)","def add_to_format(existing_format, dict_of_properties, workbook):\n new_dict={}\n for key, value in existing_format.__dict__.iteritems():\n if (value != 0) and (value != {}) and (value != None):\n new_dict[key]=value\n del new_dict['escapes']\n\n return(workbook.add_format(dict(new_dict.items() + dict_of_properties.items())))","def add_format(self, key, value=None):\n if key in self.FORMAT:\n return\n self.FORMAT.append(key)\n if value is not None:\n for call in self:\n call.data.setdefault(key, value)","def strfdate(self, fmt):\n pattern = r'%({})'.format(reduce(lambda x, y: '{}|{}'.format(x, y), FORMAT_MAP.keys()))\n for f in re.findall(pattern, fmt):\n fmt = fmt.replace('%{}'.format(f), FORMAT_MAP[f](self))\n return fmt","def asformat(self, format):","def initFormat(self):\n self.formatList = self.splitText(self.format)","def convert_format(self, new_format):\n if new_format not in [0, 1, 2, 3]:\n raise ValueError(\"Unknown format specified\")\n\n inp_format = new_format\n if inp_format == 3:\n new_format = 2\n\n for block in self.frd.blocks:\n if hasattr(block, 'format'):\n block.format = new_format\n\n self.frd.node_block.format = inp_format","def _add_format_spec(self, fmt_name_key: str, fmt_spec : gsfmt.CellFormat):\n if not len(fmt_name_key) or not isinstance(fmt_spec, gsfmt.CellFormat):\n raise (ValueError, \"Invalid format specification data\")\n else:\n self.format_specs[fmt_name_key] = fmt_spec","def reset_format(self):\n ## Formatters\n self._format_setters(*self.format_set_info)\n self._format_getters(*self.format_get_info)\n self._format_joining_functions()","def set_format(self, fmt):\n\n if \"{message}\" not in fmt:\n raise ValueError(\"Defining a log format (%s) that doesn't contain '{message}'\" % fmt)\n\n self._fmt = fmt","def initFormat(self):\n self.formatList = []","def register_format(recipe):\n afr = AFMFormatRecipe(recipe)\n formats_available.append(afr)\n # suffix\n if afr.suffix not in formats_by_suffix:\n formats_by_suffix[afr.suffix] = []\n formats_by_suffix[afr.suffix].append(afr)\n # mode\n if afr.mode not in formats_by_mode:\n formats_by_mode[afr.mode] = []\n formats_by_mode[afr.mode].append(afr)\n # supported extensions\n if afr.suffix not in supported_extensions: # avoid duplucates\n supported_extensions.append(afr.suffix)\n supported_extensions.sort()","def _fix_fmts(self, labname, mapping):\n default_fmt_widths = self._default_fmt_widths\n \n indexes = [i for i in range(self._nvar) if self._lbllist[i] == labname]\n if indexes == []: return\n lab_size = max([len(v) for k, v in mapping.items()])\n fmtlist = self._fmtlist\n typlist = self._typlist\n isstrvar = self._isstrvar\n for i in indexes:\n if isstrvar(i):\n continue # string values should not be labeled\n old_fmt = fmtlist[i]\n # check match agains numerical format\n match = NUM_FMT_RE.match(old_fmt)\n if match:\n fmt_width = int(match.group(3))\n if fmt_width < lab_size:\n prefix = ('%' + (match.group(1) or '') + \n (match.group(2) or ''))\n suffix = (match.group(4) + match.group(5) + \n match.group(6) + (match.group(7) or ''))\n new_fmt = prefix + str(lab_size) + suffix\n fmtlist[i] = new_fmt\n self._changed = True\n elif TIME_FMT_RE.match(old_fmt) or TB_FMT_RE.match(old_fmt):\n continue\n else: \n # Here, some garbled format must have been entered. \n # More effort could be made to identify intended format, \n # but instead we'll just paint over it.\n fmt_width = default_fmt_widths[typlist[i]]\n fmtlist[i] = '%' + str(max((lab_size,fmt_width))) + '.0g'\n self._changed = True","def format(self, varnames, fmts):\n varnames = self._find_vars(varnames, empty_ok=False)\n indexes = list(map(self._varlist.index, varnames))\n \n # check that fmts are specified properly\n if isinstance(fmts, str):\n fmts = fmts.split()\n else:\n if ( not isinstance(fmts, collections.Iterable) \n or not all(isinstance(f, str) for f in fmts) ):\n raise TypeError(\"given fmts must be str or iterable of str\")\n fmts = [x for s in fmts for x in s.split()]\n if len(fmts) == 0:\n raise ValueError(\"no formats specified\")\n \n # check fmts for validity\n is_valid = self._is_valid_fmt\n if not all(is_valid(fmt) for fmt in fmts):\n bad_fmts = \" \".join(fmt for fmt in fmts if not is_valid(fmt))\n raise ValueError(\"invalid formats: \" + bad_fmts)\n \n # pad fmts if necessary \n nvarnames = len(varnames)\n nfmts = len(fmts)\n if nfmts < nvarnames:\n fmts = list(fmts) + [fmts[-1]]*(nvarnames - nfmts)\n \n # check that formats match Stata types\n #typlist = self._typlist\n isstrvar = self._isstrvar\n if not all(isstrvar(i) == bool(STR_FMT_RE.match(fmt))\n for i, fmt in zip(indexes, fmts)):\n raise ValueError(\"format does not match Stata variable type\")\n \n # replace fmts (extras, if any, don't get used)\n for i, fmt in zip(indexes, fmts):\n self._fmtlist[i] = fmt\n \n # assume there are changes\n self._changed = True","def update_placeholders(self, format_string, placeholders):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if token.group(\"key\") in placeholders:\n output.append(\n \"{{{}{}}}\".format(placeholders[token.group(\"key\")], token.group(\"format\"))\n )\n continue\n elif token.group(\"command\"):\n # update any placeholders used in commands\n commands = parse_qsl(token.group(\"command\"), keep_blank_values=True)\n # placeholders only used in `if`\n if \"if\" in [x[0] for x in commands]:\n items = []\n for key, value in commands:\n if key == \"if\":\n # we have to rebuild from the parts we have\n condition = Condition(value)\n variable = condition.variable\n if variable in placeholders:\n variable = placeholders[variable]\n # negation via `!`\n not_ = \"!\" if not condition.default else \"\"\n condition_ = condition.condition or \"\"\n # if there is no condition then there is no\n # value\n if condition_:\n value_ = condition.value\n else:\n value_ = \"\"\n value = \"{}{}{}{}\".format(not_, variable, condition_, value_)\n if value:\n items.append(f\"{key}={value}\")\n else:\n items.append(key)\n\n # we cannot use urlencode because it will escape things\n # like `!`\n output.append(r\"\\?{} \".format(\"&\".join(items)))\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def update_column_format(self):\n pass","def format(fmt, st):\n ret = \"\"\n if not st: return ret\n if fmt not in valid_combos:\n return st\n cm = charmap[fmt]\n for c in st:\n ret += cm.get(c, c)\n return ret","def format(self, fmt):\n if fmt not in [\".jpg\", \"jpg\", \".png\", \"png\"]:\n raise ValueError(f\"Invalid format: {fmt}\")\n if fmt.find(\".\") != 0:\n fmt = \".\" + fmt\n self._format = fmt","def update_format(self, record):\n prefix = \"\\u001b[\"\n color = f\"{prefix}{self.color_map[record.levelno]}m\"\n bold = f\"{prefix}1m\"\n gray = f\"{prefix}1m{prefix}30m\"\n reset = f\"{prefix}0m\"\n self._style._fmt = (\n f\"%(asctime)s\"\n f\" {gray}│{reset} {color}%(levelname)-8s{reset} {gray}│{reset} \"\n )\n if hasattr(record, \"function\"):\n self._style._fmt += (\n f\"{gray}%(indent)s{reset}\"\n f\"{bold}%(function)s{reset}{gray}:{reset}\"\n \" %(message)s\"\n )\n else:\n self._style._fmt += \"%(indent)s%(message)s\"","def opt_format(self, fmt):\n key = get_enum_key(fmt, FORMATTERS)\n if key is not None:\n self.conf[\"format\"] = key\n print(\"Set format %r\" % key)\n else:\n print(\"Unknown format %r\" % fmt)","def set_formatstring(self, formatstring):\n self._logger_formatstring = formatstring\n\n # 각 핸들러에 포매터를 지정한다.\n self._logger_file_handler.setFormatter(self._Logger_formatstring)\n self._logger_stream_handler.setFormatter(self._Logger_formatstring)","def reformat(self, newformat):\n # check whether the column is defined\n if self._defined:\n # get the appropriate null-format\n nullformat = self._get_nullformat(newformat)\n # set the new formats\n self._format = [newformat, nullformat]\n else:\n # first the column type must be defined\n raise Exception('The data type of this column is not yet defined!')","def __format__(self, formatstr):\n if formatstr.strip() == '': # Defualt behaviour mirrors self.__str__()\n formatstr = '+.3f'\n\n string = \\\n \"{:\" + formatstr +\"} \" + \\\n \"{:\" + formatstr +\"}i \" + \\\n \"{:\" + formatstr +\"}j \" + \\\n \"{:\" + formatstr +\"}k\"\n return string.format(self.q[0], self.q[1], self.q[2], self.q[3])","def __format__(self, fmt):\n if not isinstance(fmt, str):\n raise TypeError(\"must be str, not %s\" % type(fmt).__name__)\n if len(fmt) != 0:\n return self.strftime(fmt)\n return str(self)","def to_format(self, format_string: str) -> str:\n return self.strftime(format_string)","def __init__(self, format_string):\r\n if not isinstance(format_string, Compatibility.string):\r\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\r\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\r\n self._re = re.compile(self._re_pattern)","def extension (formatStr):\n assert False, \"TODO:\"","def _process_str(self, fmt, *args, **kwargs):\n log_str = fmt\n if len(args) > 0 or len(kwargs) > 0:\n log_str = fmt.format(*args, **kwargs)\n\n return log_str","def register_string_format(name: str, strategy: st.SearchStrategy) -> None:\n if not isinstance(name, str):\n raise TypeError(f\"name must be of type {str}, not {type(name)}\")\n if not isinstance(strategy, st.SearchStrategy):\n raise TypeError(f\"strategy must be of type {st.SearchStrategy}, not {type(strategy)}\")\n\n STRING_FORMATS[name] = strategy","def newFormatter(*args, **kw):\n originalResult = originalFormatter(*args, **kw)\n if all():\n originalResult += ' %r' % all()\n return originalResult","def add_formats(self, formats):\n self._formats = []\n layout = self.file_formats_container.layout()\n for i in range(layout.count()):\n layout.itemAt(i).widget().close()\n\n self._formats_as_string = \"\"\n for format in formats:\n self._formats_as_string += \" \" + format\n cb = QCheckBox(format, self)\n cb.setMinimumWidth(100)\n cb.setStyleSheet(\"color: white\")\n\n if format == \"MP3\":\n cb.setChecked(True)\n\n self._formats.append(cb)\n self.file_formats_container.layout().addWidget(cb)","def w__format(self, string):\n s = ''\n for i in range(0, len(string) - 1, 2):\n s = s + \"%03s\" % string[i:i + 2]\n return s[1:]","def __format__(self, format_spec):\n # Reject anything that isn't an s\n if format_spec[-1] != 's':\n raise ValueError('{} format specifier not understood for this object',\n format_spec[:-1])\n # Output in this example will be (<a>,<b>,<c>)\n raw = \"(\" + \",\".join([str(self.a), str(self.b), str(self.c)]) + \")\"\n # Honor the format language by using the inbuilt string format\n # Since we know the original format_spec ends in an 's'\n # we can take advantage of the str.format method with a\n # string argument we constructed above\n return \"{r:{f}}\".format( r=raw, f=format_spec )","def format_to_extension(self, format):","def format(self, format):\n\n self._format = format","def format(self, format):\n\n self._format = format","def adjust_date_format(date, format_in, format_out):\n return datetime.strptime(date, format_in).strftime(format_out)","def format(\n self,\n format_string,\n module=None,\n param_dict=None,\n force_composite=False,\n attr_getter=None,\n ):\n if param_dict is None:\n param_dict = {}\n\n # if the processed format string is not in the cache then create it.\n if format_string not in self.block_cache:\n self.build_block(format_string)\n\n first_block = self.block_cache[format_string]\n\n def get_parameter(key):\n \"\"\"\n function that finds and returns the value for a placeholder.\n \"\"\"\n if key in param_dict:\n # was a supplied parameter\n param = param_dict.get(key)\n elif module and hasattr(module, key):\n param = getattr(module, key)\n if hasattr(param, \"__call__\"):\n # we don't allow module methods\n raise Exception()\n elif attr_getter:\n # get value from attr_getter function\n try:\n param = attr_getter(key)\n except: # noqa e722\n raise Exception()\n else:\n raise Exception()\n if isinstance(param, Composite):\n if param.text():\n param = param.copy()\n else:\n param = \"\"\n return param\n\n # render our processed format\n valid, output = first_block.render(get_parameter, module)\n\n # clean things up a little\n if isinstance(output, list):\n output = Composite(output)\n if not output:\n if force_composite:\n output = Composite()\n else:\n output = \"\"\n\n return output","def _format(val, valtype, floatfmt, intfmt, missingval=\"\", has_invisible=True): # noqa\n if val is None:\n return missingval\n\n if valtype is str:\n return f\"{val}\"\n elif valtype is int:\n return format(val, intfmt)\n elif valtype is bytes:\n try:\n return str(val, \"ascii\")\n except (TypeError, UnicodeDecodeError):\n return str(val)\n elif valtype is float:\n is_a_colored_number = has_invisible and isinstance(val, (str, bytes))\n if is_a_colored_number:\n raw_val = _strip_ansi(val)\n formatted_val = format(float(raw_val), floatfmt)\n return val.replace(raw_val, formatted_val)\n else:\n return format(float(val), floatfmt)\n else:\n return f\"{val}\"","def after_init(self):\n if self.options.format.appended:\n self.error_format = self.options.format.appended[0]","def setInputFormats(self, value):\n return self._set(inputFormats=value)","def read_fmt(bib_name, bib_file):\n cache_name, formatted_cache_name = _cache_name(bib_name, bib_file)\n\n try:\n meta_data, formatted_entries = cache.read_global(formatted_cache_name)\n except:\n raise cache.CacheMiss()\n\n # raise a cache miss if the modification took place after the caching\n modified_time = os.path.getmtime(bib_file)\n if modified_time > meta_data[\"cache_time\"]:\n raise cache.CacheMiss()\n\n # validate the version and format strings are still valid\n if (meta_data[\"version\"] != _VERSION or\n any(meta_data[s] != get_setting(\"cite_\" + s)\n for s in [\"panel_format\", \"autocomplete_format\"])):\n print(\"Formatting string has changed, updating cache...\")\n # read the base information from the unformatted cache\n current_time, bib_entries = cache.read_global(cache_name)\n # format and cache the entries\n formatted_entries = _create_formatted_entries(formatted_cache_name,\n bib_entries,\n current_time)\n\n return formatted_entries","def reformat(ctx):\n pass","def _get_nullformat(self, newformat):\n if self._type == int:\n length = len(str(newformat % 1))\n return '%'+str(length)+'s'\n elif self._type == float:\n length = len(str(newformat % 1.0))\n return '%'+str(length)+'s'\n else:\n return newformat","def formatted(s):\n matches = re.findall(_format_re, normalize(s))\n if len(matches) == 1 and matches[0][0] != '':\n return matches[0][0]\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\n if txt_none != '':\n return FORMAT_NONE, txt_none\n elif txt_sw != '':\n return FORMAT_SW, txt_sw\n elif txt_rem != '':\n return FORMAT_REM, txt_rem\n elif txt_em != '':\n return FORMAT_EM, txt_em\n elif txt_a != '':\n return FORMAT_A, txt_a\n return [to_fmt(*m) for m in matches]","def guess_format(string):\n format_regexps = _compiled_format_regexps(_date_formats, _time_formats)\n for format, regexp in format_regexps:\n if regexp.search(string):\n return format\n # Nothing matched\n raise CannotParse(\"Could not guess date/time format in: %s\" % string)","def set_format_by_type(self, value, format):\n self.set_render_func_by_type(value, format.format)","def format(*args, stringArg: Union[AnyStr, List[AnyStr]]=\"\", **kwargs)->AnyStr:\n pass","def date_string_to_strftime_format(date_string):\n for data in STRF_DATA:\n for pattern in data.get('patterns', []):\n if pattern in date_string:\n date_string = date_string.replace(pattern, data['replacement'])\n break\n else:\n if data.get('regex'):\n date_string = re.sub(data['regex'], data['replacement'], date_string)\n # matches = find()\n # if any(matches):\n # date_string = date_string.replace(matches[0], data['replacement'])\n\n return date_string","def _set_real_format(self, fmt):\n # try to use the _nomax variant if available\n if not self._max and fmt + '_nomax' in self.formats:\n self._format = self.formats[fmt + '_nomax']\n elif fmt in self.formats:\n self._format = self.formats[fmt]\n else:\n self._format = fmt\n\n self._format_line_count = self._format.count('\\n')","def setFormat( self, fmt, style = '{' ):\n formatter = logging.Formatter( fmt, style = style )\n for handler in self.logger.handlers:\n handler.setFormatter( formatter )","def format_cell_updated(self, cell, value=None):\n self.is_not_used()\n if value is not None:\n cell.value = value\n\n cell.fill = PatternFill(start_color='7fffd4', end_color='7fffd4', fill_type='solid')\n cell.font = Font(name='Ubuntu', size=11, color='555555', bold=False, italic=False)","def change_file_format(filename, old_format_extension, new_format_extension, append = ''):\r\n filename = unmake_file_format(filename, old_format_extension)\r\n filename += append + new_format_extension\r\n \r\n return(filename)","def formatter(self, formatString=\"{old} {new}\"):\n lines = []\n for url in self.redirects.keys():\n for match in self.redirects[url]:\n parsed = urlparse(url)\n\n netloc = parsed.netloc\n if self.subdomain:\n netloc = netloc[(netloc.find(\".\")+1):]\n\n prefix = \"{0}://{1}\".format(parsed.scheme, netloc)\n\n lines.append(formatString.format(old=url, oldPath=parsed.path,\n prefix=prefix, new=match))\n return \"\\n\".join([line for line in lines])","def initFormat(self):\n ChoiceFormat.initFormat(self)\n fullFormat = ''.join(self.formatList)\n try:\n self.sep = [sep for sep in CombinationFormat.outputSepList\n if sep not in fullFormat][0] + ' '\n except IndexError:\n self.sep = CombinationFormat.outputSepList[0] + ' '","def format(self, extra=None, *args, **kwargs):\n if extra is not None:\n for key, value in extra.items():\n if key not in kwargs:\n kwargs[key] = value\n return super(Format, self).format(self.format_string, *args, **kwargs)","def strpdate(cls, string, fmt=\"%Y/%m/%d\", lang='eng'):\n pattern = r'%({})'.format(reduce(lambda x, y: '{}|{}'.format(x, y), FORMAT_MAP.keys()))\n params = re.findall(pattern, fmt)\n if len(params) != len(set(params)):\n raise ValueError(\"Duplicate format specifier not allowed.\")\n for f in params:\n if f == 'Y':\n fmt = fmt.replace('%{}'.format(f), r'(?P<year>\\d{4})')\n elif f == 'y':\n fmt = fmt.replace('%{}'.format(f), r'(?P<year>\\d{2})')\n elif f == 'm':\n fmt = fmt.replace('%{}'.format(f), r'(?P<month>\\d{1,2})')\n elif f == 'd':\n fmt = fmt.replace('%{}'.format(f), r'(?P<day>\\d{1,2})')\n fmt = '^{}$'.format(fmt)\n if re.match(fmt, string) is None:\n raise ValueError('Mismatch in \"string\" and \"fmt\".')\n _ = {**MIN_DATE, 'lang': lang}\n _.update(re.match(fmt, string).groupdict())\n return cls(**_)","def initFormat(self):\n pass","def setFormattedStrings(object, event):\n entry = interfaces.IBiblatexEntry(object) # assert a biblatex entry object\n generator = interfaces.IFormattedEntryGenerator(entry)\n writer = interfaces.IWriteFormatted(entry)\n config = zope.component.queryUtility(\n interfaces.IBiblatexConfiguration, \n context = object)\n if config:\n languages = config.languages\n styles = config.styles\n else:\n languages = styles = (None,)\n for language in languages:\n for style in styles:\n #raise Exception(u\"language: %s, style: %s\" % (language, style))\n generator.setUp(language = language, style = style)\n generator.generate()\n writer.setBibliographicEntry(generator.getBibliographicEntry(), language, style)\n writer.setCitation(generator.getCitation(), language, style)\n writer.setCitationAgain(generator.getCitationAgain(), language, style)\n generator.tearDown()\n del generator\n del writer","def replace_param(string, param, value, param_format=None):\n\n if param_format == \"json\":\n return sub(r\"(?P<json_replacement>\\\"%s\\\"\\s*:\\s*)\\\"\\s*\\\"\" %\n escape(str(param)), \"\\\\1\\\"%s\\\"\" % value, string)\n elif param_format == \"header\":\n return sub(r\"%s=[^\\\\n]*\" % escape(str(param)), r\"%s=%s\" %\n (str(param).encode('string-escape'),\n str(value).encode('string-escape')), string)\n else:\n return sub(r\"%s=[^&]*\" % escape(str(param)), r\"%s=%s\" %\n (str(param).encode('string-escape'),\n str(value).encode('string-escape')), string)","def format(self, *args, **kwargs) -> String:\n pass","def edit_format(sample, **kwargs):\n n_call_data = vcf.model.make_calldata_tuple(sample.data._fields + tuple(kwargs.keys()))\n n_data = tuple(kwargs.values())\n sample.data += n_data\n sample.data = n_call_data(*sample.data)","def add_format(vcf_file, nid, num, ntype, desc):\n # pylint: disable=protected-access\n vcf_file.formats[nid] = vcf.parser._Format(id=nid, num=num, type=ntype, desc=desc)","def formatter(text):\n repl_map = {\n \"degC\": \"$^o$C\",\n \"K\": \"$^o$C\",\n \"month-1\": \"month$^{{-1}}$\",\n \"day-1\": \"day$^{{-1}}$\",\n \"d-1\": \"day$^{{-1}}$\",\n \"decade-1\": \"decade$^{{-1}}$\",\n \"year-1\": \"year$^{{-1}}$\",\n \"rcp85\": \"RCP8.5\",\n \"rcp45\": \"RCP4.5\",\n \"rcp26\": \"RCP2.6\",\n \"RCP85\": \"RCP8.5\",\n \"RCP45\": \"RCP4.5\",\n \"RCP26\": \"RCP2.6\",\n \"cmip5-85\": \"RCP8.5\",\n \"cmip5-60\": \"RCP6.0\",\n \"cmip5-45\": \"RCP4.5\",\n \"cmip5-26\": \"RCP2.6\",\n \"ssp585\": \"SSP5-8.5\",\n \"ssp245\": \"SSP2-4.5\",\n \"ssp126\": \"SSP1-2.6\",\n \"SSP585\": \"SSP5-8.5\",\n \"SSP245\": \"SSP2-4.5\",\n \"SSP126\": \"SSP1-2.6\",\n \"cmip6-85\": \"SSP5-8.5\",\n \"cmip6-70\": \"SSP3-7.0\",\n \"cmip6-60\": \"SSP4-6.0\",\n \"cmip6-34\": \"SSP4-3.4\",\n \"cmip6-45\": \"SSP2-4.5\",\n \"cmip6-26\": \"SSP1-2.6\",\n \"cmip6-19\": \"SSP1-1.9\",\n \"1\": \"%\",\n \"era5\": \"ERA5\",\n \"gpcc025x025_v8\": \"GPCC\",\n \"cru\": \"CRU\",\n \"jra55\": \"JRA55\",\n \"HIGHRESMIP\": \"HighResMIP\",\n \" \": \"\",\n }\n for key, val in repl_map.items():\n if key in text:\n text = text.replace(key, val)\n break\n return text","def _raise_format_error(self, name: str, format_str: str, source_format: str):\n\n raise ValueError(f\"The '{ name }' should be { format_str }, rather than { source_format }\")","def apply_formatting_dict(obj: Any, formatting: Dict[str, Any]) -> Any:\n # logger.debug(\"Processing object of type {}\".format(type(obj)))\n new_obj = obj\n\n if isinstance(obj, str):\n # Apply the formatting options to the string.\n # We explicitly allow for missing keys. They will be kept so they can be filled later.\n # see: https://stackoverflow.com/a/17215533\n # If a more sophisticated solution is needed,\n # see: https://ashwch.github.io/handling-missing-keys-in-str-format-map.html\n # Note that we can't use format_map because it is python 3.2+ only.\n # The solution below works in py 2/3\n if \"$\" not in obj:\n new_obj = string.Formatter().vformat(obj, (), formatting_dict(**formatting))\n # else:\n # logger.debug(\"Skipping str {} since it appears to be a latex string, which may break the formatting.\".format(obj))\n elif isinstance(obj, dict):\n new_obj = {}\n for k, v in obj.items():\n # Using indirect access to ensure that the original object is updated.\n new_obj[k] = apply_formatting_dict(v, formatting)\n elif isinstance(obj, list):\n new_obj = []\n for i, el in enumerate(obj):\n # Using indirect access to ensure that the original object is updated.\n new_obj.append(apply_formatting_dict(el, formatting))\n elif isinstance(obj, int) or isinstance(obj, float) or obj is None:\n # Skip over this, as there is nothing to be done - we just keep the value.\n pass\n elif isinstance(obj, enum.Enum):\n # Skip over this, as there is nothing to be done - we just keep the value.\n # This only occurs when a formatting value has already been transformed\n # into an enumeration.\n pass\n else:\n # This may or may not be expected, depending on the particular value.\n logger.debug(f\"Unrecognized obj '{obj}' of type '{type(obj)}'\")\n\n return new_obj","def update_format_string(self):\n if self._show_units:\n units = \" {}\".format(self._unit)\n else:\n units = \"\"\n\n if self._show_step_exponent:\n self.setSuffix(\"{0} Step: 1E{1}\".format(units, self.step_exponent))\n self.lineEdit().setToolTip(\"\")\n else:\n self.setSuffix(units)\n self.lineEdit().setToolTip('Step: 1E{0:+d}'.format(self.step_exponent))","def format_field(self, value, spec):\n cache = Cache()\n if spec == \"co\":\n # if cache(re.match(\"(.*)co$\", spec)):\n value = co_join(value)\n spec = \"s\"\n # cache.output.group(1) + \"s\"\n elif cache(re.match(r\"^sub(\\d?)_?(.*)$\", spec)):\n depth = (1 if cache.output.group(1) == \"\" else\n int(cache.output.group(1)))\n value = \"\\n\".join([\n \"{0}{1} = {2}\".format(depth * \" \", key, val)\n for key, val in value.items()])\n if cache.output.group(2) != \"\":\n value = (\n depth * \"[\" + cache.output.group(2) + depth * \"]\" + \"\\n\" +\n value)\n spec = \"s\"\n return super(Format, self).format_field(value, spec)","def filter_formatdate(val, format_str):\n if not isinstance(val, (datetime, date, time)):\n return val\n return val.strftime(format_str)","def __makeFormatString(self):\n self.__formatString = \"\"\n for f in self.__columns:\n self.__formatString += \"%(\"+ f + \")-\" + str(self.__widths[f]) + \\\n \"s \"","def add_formatter(self, fmt):\n if fmt and not isfunction(fmt):\n raise TypeError(\"custom format function must be a type of function\")\n\n if fmt and fmt.__code__.co_argcount < 2:\n raise TypeError(\"custom format function requires at least 2 arguments\")\n\n self.formatter = fmt","def _resolve_sse_format(self, sse_format, **kwargs):\n sse_format_int = [x[-1] for x in pytan.constants.SSE_FORMAT_MAP if sse_format.lower() in x]\n\n if not sse_format_int:\n m = \"Unsupport export format {!r}, must be one of:\\n{}\".format\n ef_map_txt = '\\n'.join(\n [', '.join(['{!r}'.format(x) for x in y]) for y in pytan.constants.SSE_FORMAT_MAP]\n )\n raise pytan.exceptions.HandlerError(m(sse_format, ef_map_txt))\n\n sse_format_int = sse_format_int[0]\n\n m = \"'sse_format resolved from '{}' to '{}'\".format\n self.mylog.debug(m(sse_format, sse_format_int))\n\n self._check_sse_format_support(\n sse_format=sse_format, sse_format_int=sse_format_int, **kwargs\n )\n\n return sse_format_int","def format(self, record):\n\n\n if not hasattr(record, 'filename_'):\n record.file_indicator = '-'\n else:\n record.file_indicator = os.path.relpath(record.filename_.strip(),\n self.study_dir)\n record.line_indicator = self.format_aggregated(\n record,\n 'line_number',\n ' line %d:',\n ' lines [%s]:',\n optional=True)\n record.column_indicator = self.format_aggregated(\n record,\n 'column_number',\n ' column %d:',\n ' columns [%s]:',\n optional=True)\n record.cause_indicator = self.format_aggregated(\n record,\n 'cause',\n \"; value encountered: '%s'\",\n \"; values encountered: ['%s']\",\n join_string=\"', '\",\n optional=True)\n\n # format the string based on these fields\n formatted_result = super(LogfileStyleFormatter, self).format(record)\n\n # prepend an empty line if the filename is different than before\n current_filename = getattr(record, 'filename_', '')\n if (self.previous_filename is not None and\n current_filename != self.previous_filename):\n formatted_result = '\\n' + formatted_result\n self.previous_filename = current_filename\n\n return formatted_result","def valueformat(value, format_list):\n\n # print(\"\\n\", format_list, value)\n concat_key = format_list.split('.')\n # Pass in either the key of the field\n # or pass in resource.key to enable a resource lookup.\n key = \"\"\n resource = \"\"\n member_id = \"\"\n key_sequence = [key, resource, member_id]\n count = 0\n for r in reversed(concat_key):\n key_sequence[count] = r\n count += 1\n\n # print(\"Concat_key:\", concat_key)\n key = key_sequence[0]\n resource = key_sequence[1]\n member_id = key_sequence[2]\n\n # print(\"Key:\", key)\n\n if key:\n if key.lower() == \"address\":\n return dt_address(value)\n\n elif key.lower() == \"telecom\":\n return dt_telecom(value)\n\n elif key.lower() == \"name\":\n return dt_name(value)\n elif key.lower() == 'dosage':\n return dt_dosage(value)\n elif key.lower() == 'medicationreference':\n # print(\"Working on\", key, \": \", value)\n # f_value = value\n # lookup field_formats\n # concat_key should have a resource name\n # print(\"\\n\\nRESOURCE:\", resource)\n # print(\"calling dt_medicationreference with Resource:\", resource, \", value:\", value)\n return dt_medicationreference(value, member_id, resource)\n elif key.lower() == 'dataabsentreason':\n if isinstance(value, dict):\n return value['coding'][0]['display']\n else:\n return value\n elif key.lower() == 'valuequantity':\n # return str(value['value']) + \" \" + value['unit']\n return dt_valuequantity(value)\n elif key.lower() == 'valuestring':\n return value\n elif key.lower() == 'interpretation':\n return value['coding'][0]['display']\n elif key.lower() == 'referencerange':\n return dt_referencerange(value)\n elif key.lower() == 'requester':\n if 'display' in value['agent']:\n return dt_reference(value['agent'], member_id)\n elif key.lower() == 'practitioner':\n if 'display' in value:\n return dt_reference(value, member_id)\n elif key.lower() == 'organization':\n if 'display' in value:\n return dt_reference(value, member_id)\n # elif key.lower() == \"result\":\n # return dt_reference(value[0], member_id)\n elif key.lower() == 'practitioner':\n if 'display' in value:\n return dt_reference(value, member_id)\n elif key.lower() == 'organization':\n if 'display' in value:\n return dt_reference(value, member_id)\n elif key.lower() == 'participant':\n if 'display' in value[0]['individual']:\n return dt_reference(value[0]['individual'], member_id)\n elif key.lower() == 'location':\n if 'display' in value[0]['location']:\n return dt_reference(value[0]['location'], member_id)\n elif key.lower() == 'communication':\n return dt_communication(value)\n else:\n # print(\"value:\", value, \" type:\", type(value), \" for: \", key)\n return value","def _printAttributePrintf(self, formatting, value):\n\n # multiple entrys\n if isinstance(formatting, list):\n\n for scanf_format in formatting:\n try:\n #print \"-->>\", scanf_format, value\n return scanf_format % value\n except TypeError, e:\n pass\n\n # single entry\n else:\n return formatting % value\n\n # problem if none of the formats worked\n raise TypeError(\"Valid format not found for values.\")","def assign_format(self):\n if self.is_output or self.is_req_output:\n if self.pname in self.tool_data[self.tool_name]['output_fmt']:\n return self.tool_data[self.tool_name]['output_fmt'][self.pname]\n elif self.pname in self.gen_out_fmt:\n return self.gen_out_fmt[self.pname]\n elif self.is_input:\n if self.pname in self.tool_data[self.tool_name]['input_fmt']:\n print(self.tool_data[self.tool_name])\n return self.tool_data[self.tool_name]['input_fmt'][self.pname]\n elif self.pname in self.gen_in_fmt:\n return self.gen_in_fmt[self.pname]\n else:\n # Not sure yet what this will be used for, but I think we need it.\n return ''","def _add_report_formatting(self, cell_range: str, fmt_spec: gsfmt.CellFormat):\n self.report_formatting.append((cell_range, fmt_spec))","def vformat(self, format_string, args, kwargs):\n self._used_kwargs = {}\n self._unused_kwargs = {}\n return super(MemorizeFormatter, self).vformat(format_string, args, kwargs)","def _format(path, arformat):\n if isinstance(path, unicode):\n path = path.encode('utf-8')\n\n if path.startswith('#1/'):\n if not arformat:\n arformat = AR_FORMAT_BSD\n elif arformat is AR_FORMAT_SIMPLE:\n raise IOError('File name starts with special for format!')\n\n if len(path) >= 16:\n if arformat is None:\n arformat = AR_FORMAT_BSD\n elif arformat is AR_FORMAT_SIMPLE:\n raise IOError('File name too long for format!')\n\n if ' ' in path:\n if not arformat:\n arformat = AR_FORMAT_BSD\n elif arformat is AR_FORMAT_SIMPLE:\n raise IOError('File name contains forbidden character for format!')\n\n if arformat is None:\n arformat = AR_FORMAT_SIMPLE\n\n return arformat","def merge(string: str, user_input: tuple) -> str:\n merged_string = string.format(*user_input)\n return merged_string","def register_filename_format(format_name,parser):\n if format_name == \"ALL\":\n raise ValueError(\"filename format code ALL is reserved\")\n\n filename_format_parser[format_name] = parser","def _format_msg(self, format_str, *args):\n if not args:\n format_str = six.moves.urllib.parse.unquote(format_str)\n return \"{} - - [{}] {}\\n\".format(\n self.client_address[0],\n self.log_date_time_string(),\n format_str % args\n )","def set_format(cls,format):\n import __main__\n IP = __main__.__dict__['__IP']\n prompt = getattr(IP.outputcache,cls._prompt)\n prompt.p_template = format\n prompt.set_p_str()\n cls._format = format","def format_string(s, formatter='minimal'):\n if not callable(formatter):\n formatter = get_formatter_for_name(formatter)\n if formatter is None:\n output = s\n else:\n output = formatter(s)\n return output","def register_str_format(\n tag: Tag, conformer: Optional[Conformer] = None\n) -> Callable[[ValidatorFn], ValidatorFn]:\n\n def create_str_format(f: ValidatorFn) -> ValidatorFn:\n with _STR_FORMAT_LOCK:\n _STR_FORMATS[tag] = StrFormat(f, conformer=conformer)\n return f\n\n return create_str_format","def complete_opt_format(self, text, *_):\n return [t + \" \" for t in FORMATTERS if t.startswith(text)]","def get_format_opts(cls, format_=\"value\", fields=[]):\n return \" -f {0} {1}\".format(format_, \" \".join([\"-c \" + it for it in fields]))","def setup(self, formats):\n for f in formats:\n try:\n self.counters[f] += 1\n except KeyError:\n self.counters[f] = 1\n self.vim.command(f\"set efm+={f}\")","def dt_format_translate(pyfmt):\n\n translate = {\"%a\": \"ddd\",\n \"%A\": \"dddd\",\n \"%b\": \"mmm\",\n \"%B\": \"mmmm\",\n \"%c\": \"\",\n \"%d\": \"dd\",\n \"%f\": \"\",\n \"%H\": \"hh\",\n \"%I\": \"hh\",\n \"%j\": \"\",\n \"%m\": \"mm\",\n \"%M\": \"mm\",\n \"%p\": \"AM/PM\",\n \"%S\": \"ss\",\n \"%U\": \"\",\n \"%w\": \"\",\n \"%W\": \"\",\n \"%x\": \"\",\n \"%X\": \"\",\n \"%y\": \"yy\",\n \"%Y\": \"yyyy\",\n \"%z\": \"\",\n \"%Z\": \"\",\n \"%%\": \"%\"}\n\n xlfmt = str(pyfmt)\n\n for item in translate:\n if item in xlfmt:\n xlfmt = xlfmt.replace(item, translate[item])\n return xlfmt","def __normalize(self, ctx: commands.Context, format: str) -> str:\n\t\t# convert to lowercase\n\t\tlower_format = format.lower()\n\t\t# check if inputted format is recognized\n\t\tif lower_format in self.formats:\n\t\t\treturn lower_format\n\t\t# check for aliases\n\t\telif lower_format in self.aliases:\n\t\t\treturn self.aliases[lower_format]\n\t\t# format is not recognized\n\t\telse:\n\t\t\traise FriendlyError(\n\t\t\t\tf\"'{format}' is not a recognized format.\", ctx.channel, ctx.author\n\t\t\t)","def get_formatted_string(self, input_string):\n if isinstance(input_string, str):\n try:\n return self.get_processed_string(input_string)\n except KeyError as err:\n # Wrapping the KeyError into a less cryptic error for end-user\n # friendliness\n missing_key = err.args[0]\n raise KeyNotInContextError(\n f'Unable to format \\'{input_string}\\' with '\n f'{{{missing_key}}}, because '\n f'context[\\'{missing_key}\\'] doesn\\'t exist') from err\n else:\n raise TypeError(f\"can only format on strings. {input_string} is a \"\n f\"{type(input_string)} instead.\")","def reformat():\n toolkit.reformat()","def __format__(self, format_spec):\n if format_spec == \"polite\":\n return self.polite\n elif format_spec == \"casual\":\n return self.casual\n else:\n # Using string addition here to avoid triggering flake8-sfs\n # while still giving a meaningful self-contained example:\n raise ValueError(format_spec + \" not a format defined by Client object\")","def format_(self):\n return self.set_format or self.default_format or self.FALLBACK_FORMAT","def format(self, message):","def format_string(self, pat=None, pat_args={}):\n if pat is None:\n pat = self.parent.pat\n if pat_args == {}:\n pat_args = self.parent.pat_args\n return entry_format.output(self, pat, pat_args)","def formats():\n return _FORMATS"],"string":"[\n \"def AddFormat(self, format):\\n self._legacy = False\\n if format:\\n self._format = format\",\n \"def addIfMissing(self, format):\\n self.setdefault(format.name, format)\",\n \"def _translate_fmts(self):\\n fmt_info = []\\n fmt_append = fmt_info.append\\n \\n isvalid = self._is_valid_fmt\\n typlist = self._typlist\\n isstrvar = self._isstrvar\\n default_fmts = self._default_fmts\\n \\n for i, fmt in enumerate(self._fmtlist):\\n fmt = fmt.strip()\\n \\n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\\n \\n if iscalendar or not isvalid(fmt):\\n if isstrvar(i):\\n wid = min(typlist[i], 10)\\n fmt_append(('s', \\\"{{:>{}s}}\\\".format(wid), wid))\\n continue\\n else:\\n fmt = default_fmts[typlist[i]]\\n \\n last_char = fmt[-1]\\n if last_char == 's': # string\\n m = STR_FMT_RE.match(fmt)\\n align, _, wid = m.group(1), m.group(2), m.group(3)\\n new_align = (\\\"<\\\" if align == \\\"-\\\" \\n else \\\"^\\\" if align == \\\"~\\\" else \\\">\\\")\\n new = \\\"\\\".join((\\\"{:\\\", new_align, wid, \\\"s}\\\"))\\n fmt_append(('s', new, int(wid)))\\n elif last_char == 'H' or last_char == 'L': # binary\\n fmt_append((last_char, fmt, int(fmt[1:-1])))\\n elif last_char == 'x': # hexadecimal\\n fmt_append(('x', fmt, 21))\\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\\n m = NUM_FMT_RE.match(fmt)\\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \\n m.group(3), m.group(4),\\n m.group(5), m.group(6),\\n m.group(7))\\n aln = \\\"<\\\" if align == \\\"-\\\" else \\\">\\\"\\n sep = \\\",\\\" if com is not None else \\\"\\\"\\n if type == \\\"g\\\" and int(prec) == 0:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, type, \\\"}\\\"))\\n else:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, \\\".\\\", prec, type, \\\"}\\\"))\\n fmt_append((type, new, int(wid), delim, com))\\n \\n return fmt_info\",\n \"def sformatf(cls, msg, *args):\\n #formats = {\\\"%t\\\": \\\"%d\\\", \\\"%0t\\\": \\\"%0d\\\"}\\n #for s in formats:\\n # msg = msg.replace(s, formats[s])\\n #return sformatf(msg, *args)\\n # TODO substitute old types %s/%d etc with {}\\n #new_msg = cls.STR_RE.sub(r'{:\\\\1}', msg)\\n #print(\\\"new_msg is \\\" + new_msg)\\n for s in cls.formats:\\n if s == \\\"%h\\\" or s == \\\"%0h\\\":\\n msg = msg.replace(s, \\\"{:X}\\\")\\n else:\\n msg = msg.replace(s, \\\"{}\\\")\\n return msg.format(*args)\",\n \"def add_to_format(existing_format, dict_of_properties, workbook):\\n new_dict={}\\n for key, value in existing_format.__dict__.iteritems():\\n if (value != 0) and (value != {}) and (value != None):\\n new_dict[key]=value\\n del new_dict['escapes']\\n\\n return(workbook.add_format(dict(new_dict.items() + dict_of_properties.items())))\",\n \"def add_format(self, key, value=None):\\n if key in self.FORMAT:\\n return\\n self.FORMAT.append(key)\\n if value is not None:\\n for call in self:\\n call.data.setdefault(key, value)\",\n \"def strfdate(self, fmt):\\n pattern = r'%({})'.format(reduce(lambda x, y: '{}|{}'.format(x, y), FORMAT_MAP.keys()))\\n for f in re.findall(pattern, fmt):\\n fmt = fmt.replace('%{}'.format(f), FORMAT_MAP[f](self))\\n return fmt\",\n \"def asformat(self, format):\",\n \"def initFormat(self):\\n self.formatList = self.splitText(self.format)\",\n \"def convert_format(self, new_format):\\n if new_format not in [0, 1, 2, 3]:\\n raise ValueError(\\\"Unknown format specified\\\")\\n\\n inp_format = new_format\\n if inp_format == 3:\\n new_format = 2\\n\\n for block in self.frd.blocks:\\n if hasattr(block, 'format'):\\n block.format = new_format\\n\\n self.frd.node_block.format = inp_format\",\n \"def _add_format_spec(self, fmt_name_key: str, fmt_spec : gsfmt.CellFormat):\\n if not len(fmt_name_key) or not isinstance(fmt_spec, gsfmt.CellFormat):\\n raise (ValueError, \\\"Invalid format specification data\\\")\\n else:\\n self.format_specs[fmt_name_key] = fmt_spec\",\n \"def reset_format(self):\\n ## Formatters\\n self._format_setters(*self.format_set_info)\\n self._format_getters(*self.format_get_info)\\n self._format_joining_functions()\",\n \"def set_format(self, fmt):\\n\\n if \\\"{message}\\\" not in fmt:\\n raise ValueError(\\\"Defining a log format (%s) that doesn't contain '{message}'\\\" % fmt)\\n\\n self._fmt = fmt\",\n \"def initFormat(self):\\n self.formatList = []\",\n \"def register_format(recipe):\\n afr = AFMFormatRecipe(recipe)\\n formats_available.append(afr)\\n # suffix\\n if afr.suffix not in formats_by_suffix:\\n formats_by_suffix[afr.suffix] = []\\n formats_by_suffix[afr.suffix].append(afr)\\n # mode\\n if afr.mode not in formats_by_mode:\\n formats_by_mode[afr.mode] = []\\n formats_by_mode[afr.mode].append(afr)\\n # supported extensions\\n if afr.suffix not in supported_extensions: # avoid duplucates\\n supported_extensions.append(afr.suffix)\\n supported_extensions.sort()\",\n \"def _fix_fmts(self, labname, mapping):\\n default_fmt_widths = self._default_fmt_widths\\n \\n indexes = [i for i in range(self._nvar) if self._lbllist[i] == labname]\\n if indexes == []: return\\n lab_size = max([len(v) for k, v in mapping.items()])\\n fmtlist = self._fmtlist\\n typlist = self._typlist\\n isstrvar = self._isstrvar\\n for i in indexes:\\n if isstrvar(i):\\n continue # string values should not be labeled\\n old_fmt = fmtlist[i]\\n # check match agains numerical format\\n match = NUM_FMT_RE.match(old_fmt)\\n if match:\\n fmt_width = int(match.group(3))\\n if fmt_width < lab_size:\\n prefix = ('%' + (match.group(1) or '') + \\n (match.group(2) or ''))\\n suffix = (match.group(4) + match.group(5) + \\n match.group(6) + (match.group(7) or ''))\\n new_fmt = prefix + str(lab_size) + suffix\\n fmtlist[i] = new_fmt\\n self._changed = True\\n elif TIME_FMT_RE.match(old_fmt) or TB_FMT_RE.match(old_fmt):\\n continue\\n else: \\n # Here, some garbled format must have been entered. \\n # More effort could be made to identify intended format, \\n # but instead we'll just paint over it.\\n fmt_width = default_fmt_widths[typlist[i]]\\n fmtlist[i] = '%' + str(max((lab_size,fmt_width))) + '.0g'\\n self._changed = True\",\n \"def format(self, varnames, fmts):\\n varnames = self._find_vars(varnames, empty_ok=False)\\n indexes = list(map(self._varlist.index, varnames))\\n \\n # check that fmts are specified properly\\n if isinstance(fmts, str):\\n fmts = fmts.split()\\n else:\\n if ( not isinstance(fmts, collections.Iterable) \\n or not all(isinstance(f, str) for f in fmts) ):\\n raise TypeError(\\\"given fmts must be str or iterable of str\\\")\\n fmts = [x for s in fmts for x in s.split()]\\n if len(fmts) == 0:\\n raise ValueError(\\\"no formats specified\\\")\\n \\n # check fmts for validity\\n is_valid = self._is_valid_fmt\\n if not all(is_valid(fmt) for fmt in fmts):\\n bad_fmts = \\\" \\\".join(fmt for fmt in fmts if not is_valid(fmt))\\n raise ValueError(\\\"invalid formats: \\\" + bad_fmts)\\n \\n # pad fmts if necessary \\n nvarnames = len(varnames)\\n nfmts = len(fmts)\\n if nfmts < nvarnames:\\n fmts = list(fmts) + [fmts[-1]]*(nvarnames - nfmts)\\n \\n # check that formats match Stata types\\n #typlist = self._typlist\\n isstrvar = self._isstrvar\\n if not all(isstrvar(i) == bool(STR_FMT_RE.match(fmt))\\n for i, fmt in zip(indexes, fmts)):\\n raise ValueError(\\\"format does not match Stata variable type\\\")\\n \\n # replace fmts (extras, if any, don't get used)\\n for i, fmt in zip(indexes, fmts):\\n self._fmtlist[i] = fmt\\n \\n # assume there are changes\\n self._changed = True\",\n \"def update_placeholders(self, format_string, placeholders):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if token.group(\\\"key\\\") in placeholders:\\n output.append(\\n \\\"{{{}{}}}\\\".format(placeholders[token.group(\\\"key\\\")], token.group(\\\"format\\\"))\\n )\\n continue\\n elif token.group(\\\"command\\\"):\\n # update any placeholders used in commands\\n commands = parse_qsl(token.group(\\\"command\\\"), keep_blank_values=True)\\n # placeholders only used in `if`\\n if \\\"if\\\" in [x[0] for x in commands]:\\n items = []\\n for key, value in commands:\\n if key == \\\"if\\\":\\n # we have to rebuild from the parts we have\\n condition = Condition(value)\\n variable = condition.variable\\n if variable in placeholders:\\n variable = placeholders[variable]\\n # negation via `!`\\n not_ = \\\"!\\\" if not condition.default else \\\"\\\"\\n condition_ = condition.condition or \\\"\\\"\\n # if there is no condition then there is no\\n # value\\n if condition_:\\n value_ = condition.value\\n else:\\n value_ = \\\"\\\"\\n value = \\\"{}{}{}{}\\\".format(not_, variable, condition_, value_)\\n if value:\\n items.append(f\\\"{key}={value}\\\")\\n else:\\n items.append(key)\\n\\n # we cannot use urlencode because it will escape things\\n # like `!`\\n output.append(r\\\"\\\\?{} \\\".format(\\\"&\\\".join(items)))\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def update_column_format(self):\\n pass\",\n \"def format(fmt, st):\\n ret = \\\"\\\"\\n if not st: return ret\\n if fmt not in valid_combos:\\n return st\\n cm = charmap[fmt]\\n for c in st:\\n ret += cm.get(c, c)\\n return ret\",\n \"def format(self, fmt):\\n if fmt not in [\\\".jpg\\\", \\\"jpg\\\", \\\".png\\\", \\\"png\\\"]:\\n raise ValueError(f\\\"Invalid format: {fmt}\\\")\\n if fmt.find(\\\".\\\") != 0:\\n fmt = \\\".\\\" + fmt\\n self._format = fmt\",\n \"def update_format(self, record):\\n prefix = \\\"\\\\u001b[\\\"\\n color = f\\\"{prefix}{self.color_map[record.levelno]}m\\\"\\n bold = f\\\"{prefix}1m\\\"\\n gray = f\\\"{prefix}1m{prefix}30m\\\"\\n reset = f\\\"{prefix}0m\\\"\\n self._style._fmt = (\\n f\\\"%(asctime)s\\\"\\n f\\\" {gray}│{reset} {color}%(levelname)-8s{reset} {gray}│{reset} \\\"\\n )\\n if hasattr(record, \\\"function\\\"):\\n self._style._fmt += (\\n f\\\"{gray}%(indent)s{reset}\\\"\\n f\\\"{bold}%(function)s{reset}{gray}:{reset}\\\"\\n \\\" %(message)s\\\"\\n )\\n else:\\n self._style._fmt += \\\"%(indent)s%(message)s\\\"\",\n \"def opt_format(self, fmt):\\n key = get_enum_key(fmt, FORMATTERS)\\n if key is not None:\\n self.conf[\\\"format\\\"] = key\\n print(\\\"Set format %r\\\" % key)\\n else:\\n print(\\\"Unknown format %r\\\" % fmt)\",\n \"def set_formatstring(self, formatstring):\\n self._logger_formatstring = formatstring\\n\\n # 각 핸들러에 포매터를 지정한다.\\n self._logger_file_handler.setFormatter(self._Logger_formatstring)\\n self._logger_stream_handler.setFormatter(self._Logger_formatstring)\",\n \"def reformat(self, newformat):\\n # check whether the column is defined\\n if self._defined:\\n # get the appropriate null-format\\n nullformat = self._get_nullformat(newformat)\\n # set the new formats\\n self._format = [newformat, nullformat]\\n else:\\n # first the column type must be defined\\n raise Exception('The data type of this column is not yet defined!')\",\n \"def __format__(self, formatstr):\\n if formatstr.strip() == '': # Defualt behaviour mirrors self.__str__()\\n formatstr = '+.3f'\\n\\n string = \\\\\\n \\\"{:\\\" + formatstr +\\\"} \\\" + \\\\\\n \\\"{:\\\" + formatstr +\\\"}i \\\" + \\\\\\n \\\"{:\\\" + formatstr +\\\"}j \\\" + \\\\\\n \\\"{:\\\" + formatstr +\\\"}k\\\"\\n return string.format(self.q[0], self.q[1], self.q[2], self.q[3])\",\n \"def __format__(self, fmt):\\n if not isinstance(fmt, str):\\n raise TypeError(\\\"must be str, not %s\\\" % type(fmt).__name__)\\n if len(fmt) != 0:\\n return self.strftime(fmt)\\n return str(self)\",\n \"def to_format(self, format_string: str) -> str:\\n return self.strftime(format_string)\",\n \"def __init__(self, format_string):\\r\\n if not isinstance(format_string, Compatibility.string):\\r\\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\\r\\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\\r\\n self._re = re.compile(self._re_pattern)\",\n \"def extension (formatStr):\\n assert False, \\\"TODO:\\\"\",\n \"def _process_str(self, fmt, *args, **kwargs):\\n log_str = fmt\\n if len(args) > 0 or len(kwargs) > 0:\\n log_str = fmt.format(*args, **kwargs)\\n\\n return log_str\",\n \"def register_string_format(name: str, strategy: st.SearchStrategy) -> None:\\n if not isinstance(name, str):\\n raise TypeError(f\\\"name must be of type {str}, not {type(name)}\\\")\\n if not isinstance(strategy, st.SearchStrategy):\\n raise TypeError(f\\\"strategy must be of type {st.SearchStrategy}, not {type(strategy)}\\\")\\n\\n STRING_FORMATS[name] = strategy\",\n \"def newFormatter(*args, **kw):\\n originalResult = originalFormatter(*args, **kw)\\n if all():\\n originalResult += ' %r' % all()\\n return originalResult\",\n \"def add_formats(self, formats):\\n self._formats = []\\n layout = self.file_formats_container.layout()\\n for i in range(layout.count()):\\n layout.itemAt(i).widget().close()\\n\\n self._formats_as_string = \\\"\\\"\\n for format in formats:\\n self._formats_as_string += \\\" \\\" + format\\n cb = QCheckBox(format, self)\\n cb.setMinimumWidth(100)\\n cb.setStyleSheet(\\\"color: white\\\")\\n\\n if format == \\\"MP3\\\":\\n cb.setChecked(True)\\n\\n self._formats.append(cb)\\n self.file_formats_container.layout().addWidget(cb)\",\n \"def w__format(self, string):\\n s = ''\\n for i in range(0, len(string) - 1, 2):\\n s = s + \\\"%03s\\\" % string[i:i + 2]\\n return s[1:]\",\n \"def __format__(self, format_spec):\\n # Reject anything that isn't an s\\n if format_spec[-1] != 's':\\n raise ValueError('{} format specifier not understood for this object',\\n format_spec[:-1])\\n # Output in this example will be (<a>,<b>,<c>)\\n raw = \\\"(\\\" + \\\",\\\".join([str(self.a), str(self.b), str(self.c)]) + \\\")\\\"\\n # Honor the format language by using the inbuilt string format\\n # Since we know the original format_spec ends in an 's'\\n # we can take advantage of the str.format method with a\\n # string argument we constructed above\\n return \\\"{r:{f}}\\\".format( r=raw, f=format_spec )\",\n \"def format_to_extension(self, format):\",\n \"def format(self, format):\\n\\n self._format = format\",\n \"def format(self, format):\\n\\n self._format = format\",\n \"def adjust_date_format(date, format_in, format_out):\\n return datetime.strptime(date, format_in).strftime(format_out)\",\n \"def format(\\n self,\\n format_string,\\n module=None,\\n param_dict=None,\\n force_composite=False,\\n attr_getter=None,\\n ):\\n if param_dict is None:\\n param_dict = {}\\n\\n # if the processed format string is not in the cache then create it.\\n if format_string not in self.block_cache:\\n self.build_block(format_string)\\n\\n first_block = self.block_cache[format_string]\\n\\n def get_parameter(key):\\n \\\"\\\"\\\"\\n function that finds and returns the value for a placeholder.\\n \\\"\\\"\\\"\\n if key in param_dict:\\n # was a supplied parameter\\n param = param_dict.get(key)\\n elif module and hasattr(module, key):\\n param = getattr(module, key)\\n if hasattr(param, \\\"__call__\\\"):\\n # we don't allow module methods\\n raise Exception()\\n elif attr_getter:\\n # get value from attr_getter function\\n try:\\n param = attr_getter(key)\\n except: # noqa e722\\n raise Exception()\\n else:\\n raise Exception()\\n if isinstance(param, Composite):\\n if param.text():\\n param = param.copy()\\n else:\\n param = \\\"\\\"\\n return param\\n\\n # render our processed format\\n valid, output = first_block.render(get_parameter, module)\\n\\n # clean things up a little\\n if isinstance(output, list):\\n output = Composite(output)\\n if not output:\\n if force_composite:\\n output = Composite()\\n else:\\n output = \\\"\\\"\\n\\n return output\",\n \"def _format(val, valtype, floatfmt, intfmt, missingval=\\\"\\\", has_invisible=True): # noqa\\n if val is None:\\n return missingval\\n\\n if valtype is str:\\n return f\\\"{val}\\\"\\n elif valtype is int:\\n return format(val, intfmt)\\n elif valtype is bytes:\\n try:\\n return str(val, \\\"ascii\\\")\\n except (TypeError, UnicodeDecodeError):\\n return str(val)\\n elif valtype is float:\\n is_a_colored_number = has_invisible and isinstance(val, (str, bytes))\\n if is_a_colored_number:\\n raw_val = _strip_ansi(val)\\n formatted_val = format(float(raw_val), floatfmt)\\n return val.replace(raw_val, formatted_val)\\n else:\\n return format(float(val), floatfmt)\\n else:\\n return f\\\"{val}\\\"\",\n \"def after_init(self):\\n if self.options.format.appended:\\n self.error_format = self.options.format.appended[0]\",\n \"def setInputFormats(self, value):\\n return self._set(inputFormats=value)\",\n \"def read_fmt(bib_name, bib_file):\\n cache_name, formatted_cache_name = _cache_name(bib_name, bib_file)\\n\\n try:\\n meta_data, formatted_entries = cache.read_global(formatted_cache_name)\\n except:\\n raise cache.CacheMiss()\\n\\n # raise a cache miss if the modification took place after the caching\\n modified_time = os.path.getmtime(bib_file)\\n if modified_time > meta_data[\\\"cache_time\\\"]:\\n raise cache.CacheMiss()\\n\\n # validate the version and format strings are still valid\\n if (meta_data[\\\"version\\\"] != _VERSION or\\n any(meta_data[s] != get_setting(\\\"cite_\\\" + s)\\n for s in [\\\"panel_format\\\", \\\"autocomplete_format\\\"])):\\n print(\\\"Formatting string has changed, updating cache...\\\")\\n # read the base information from the unformatted cache\\n current_time, bib_entries = cache.read_global(cache_name)\\n # format and cache the entries\\n formatted_entries = _create_formatted_entries(formatted_cache_name,\\n bib_entries,\\n current_time)\\n\\n return formatted_entries\",\n \"def reformat(ctx):\\n pass\",\n \"def _get_nullformat(self, newformat):\\n if self._type == int:\\n length = len(str(newformat % 1))\\n return '%'+str(length)+'s'\\n elif self._type == float:\\n length = len(str(newformat % 1.0))\\n return '%'+str(length)+'s'\\n else:\\n return newformat\",\n \"def formatted(s):\\n matches = re.findall(_format_re, normalize(s))\\n if len(matches) == 1 and matches[0][0] != '':\\n return matches[0][0]\\n def to_fmt(txt_none, txt_sw, txt_rem, txt_em, txt_a):\\n if txt_none != '':\\n return FORMAT_NONE, txt_none\\n elif txt_sw != '':\\n return FORMAT_SW, txt_sw\\n elif txt_rem != '':\\n return FORMAT_REM, txt_rem\\n elif txt_em != '':\\n return FORMAT_EM, txt_em\\n elif txt_a != '':\\n return FORMAT_A, txt_a\\n return [to_fmt(*m) for m in matches]\",\n \"def guess_format(string):\\n format_regexps = _compiled_format_regexps(_date_formats, _time_formats)\\n for format, regexp in format_regexps:\\n if regexp.search(string):\\n return format\\n # Nothing matched\\n raise CannotParse(\\\"Could not guess date/time format in: %s\\\" % string)\",\n \"def set_format_by_type(self, value, format):\\n self.set_render_func_by_type(value, format.format)\",\n \"def format(*args, stringArg: Union[AnyStr, List[AnyStr]]=\\\"\\\", **kwargs)->AnyStr:\\n pass\",\n \"def date_string_to_strftime_format(date_string):\\n for data in STRF_DATA:\\n for pattern in data.get('patterns', []):\\n if pattern in date_string:\\n date_string = date_string.replace(pattern, data['replacement'])\\n break\\n else:\\n if data.get('regex'):\\n date_string = re.sub(data['regex'], data['replacement'], date_string)\\n # matches = find()\\n # if any(matches):\\n # date_string = date_string.replace(matches[0], data['replacement'])\\n\\n return date_string\",\n \"def _set_real_format(self, fmt):\\n # try to use the _nomax variant if available\\n if not self._max and fmt + '_nomax' in self.formats:\\n self._format = self.formats[fmt + '_nomax']\\n elif fmt in self.formats:\\n self._format = self.formats[fmt]\\n else:\\n self._format = fmt\\n\\n self._format_line_count = self._format.count('\\\\n')\",\n \"def setFormat( self, fmt, style = '{' ):\\n formatter = logging.Formatter( fmt, style = style )\\n for handler in self.logger.handlers:\\n handler.setFormatter( formatter )\",\n \"def format_cell_updated(self, cell, value=None):\\n self.is_not_used()\\n if value is not None:\\n cell.value = value\\n\\n cell.fill = PatternFill(start_color='7fffd4', end_color='7fffd4', fill_type='solid')\\n cell.font = Font(name='Ubuntu', size=11, color='555555', bold=False, italic=False)\",\n \"def change_file_format(filename, old_format_extension, new_format_extension, append = ''):\\r\\n filename = unmake_file_format(filename, old_format_extension)\\r\\n filename += append + new_format_extension\\r\\n \\r\\n return(filename)\",\n \"def formatter(self, formatString=\\\"{old} {new}\\\"):\\n lines = []\\n for url in self.redirects.keys():\\n for match in self.redirects[url]:\\n parsed = urlparse(url)\\n\\n netloc = parsed.netloc\\n if self.subdomain:\\n netloc = netloc[(netloc.find(\\\".\\\")+1):]\\n\\n prefix = \\\"{0}://{1}\\\".format(parsed.scheme, netloc)\\n\\n lines.append(formatString.format(old=url, oldPath=parsed.path,\\n prefix=prefix, new=match))\\n return \\\"\\\\n\\\".join([line for line in lines])\",\n \"def initFormat(self):\\n ChoiceFormat.initFormat(self)\\n fullFormat = ''.join(self.formatList)\\n try:\\n self.sep = [sep for sep in CombinationFormat.outputSepList\\n if sep not in fullFormat][0] + ' '\\n except IndexError:\\n self.sep = CombinationFormat.outputSepList[0] + ' '\",\n \"def format(self, extra=None, *args, **kwargs):\\n if extra is not None:\\n for key, value in extra.items():\\n if key not in kwargs:\\n kwargs[key] = value\\n return super(Format, self).format(self.format_string, *args, **kwargs)\",\n \"def strpdate(cls, string, fmt=\\\"%Y/%m/%d\\\", lang='eng'):\\n pattern = r'%({})'.format(reduce(lambda x, y: '{}|{}'.format(x, y), FORMAT_MAP.keys()))\\n params = re.findall(pattern, fmt)\\n if len(params) != len(set(params)):\\n raise ValueError(\\\"Duplicate format specifier not allowed.\\\")\\n for f in params:\\n if f == 'Y':\\n fmt = fmt.replace('%{}'.format(f), r'(?P<year>\\\\d{4})')\\n elif f == 'y':\\n fmt = fmt.replace('%{}'.format(f), r'(?P<year>\\\\d{2})')\\n elif f == 'm':\\n fmt = fmt.replace('%{}'.format(f), r'(?P<month>\\\\d{1,2})')\\n elif f == 'd':\\n fmt = fmt.replace('%{}'.format(f), r'(?P<day>\\\\d{1,2})')\\n fmt = '^{}$'.format(fmt)\\n if re.match(fmt, string) is None:\\n raise ValueError('Mismatch in \\\"string\\\" and \\\"fmt\\\".')\\n _ = {**MIN_DATE, 'lang': lang}\\n _.update(re.match(fmt, string).groupdict())\\n return cls(**_)\",\n \"def initFormat(self):\\n pass\",\n \"def setFormattedStrings(object, event):\\n entry = interfaces.IBiblatexEntry(object) # assert a biblatex entry object\\n generator = interfaces.IFormattedEntryGenerator(entry)\\n writer = interfaces.IWriteFormatted(entry)\\n config = zope.component.queryUtility(\\n interfaces.IBiblatexConfiguration, \\n context = object)\\n if config:\\n languages = config.languages\\n styles = config.styles\\n else:\\n languages = styles = (None,)\\n for language in languages:\\n for style in styles:\\n #raise Exception(u\\\"language: %s, style: %s\\\" % (language, style))\\n generator.setUp(language = language, style = style)\\n generator.generate()\\n writer.setBibliographicEntry(generator.getBibliographicEntry(), language, style)\\n writer.setCitation(generator.getCitation(), language, style)\\n writer.setCitationAgain(generator.getCitationAgain(), language, style)\\n generator.tearDown()\\n del generator\\n del writer\",\n \"def replace_param(string, param, value, param_format=None):\\n\\n if param_format == \\\"json\\\":\\n return sub(r\\\"(?P<json_replacement>\\\\\\\"%s\\\\\\\"\\\\s*:\\\\s*)\\\\\\\"\\\\s*\\\\\\\"\\\" %\\n escape(str(param)), \\\"\\\\\\\\1\\\\\\\"%s\\\\\\\"\\\" % value, string)\\n elif param_format == \\\"header\\\":\\n return sub(r\\\"%s=[^\\\\\\\\n]*\\\" % escape(str(param)), r\\\"%s=%s\\\" %\\n (str(param).encode('string-escape'),\\n str(value).encode('string-escape')), string)\\n else:\\n return sub(r\\\"%s=[^&]*\\\" % escape(str(param)), r\\\"%s=%s\\\" %\\n (str(param).encode('string-escape'),\\n str(value).encode('string-escape')), string)\",\n \"def format(self, *args, **kwargs) -> String:\\n pass\",\n \"def edit_format(sample, **kwargs):\\n n_call_data = vcf.model.make_calldata_tuple(sample.data._fields + tuple(kwargs.keys()))\\n n_data = tuple(kwargs.values())\\n sample.data += n_data\\n sample.data = n_call_data(*sample.data)\",\n \"def add_format(vcf_file, nid, num, ntype, desc):\\n # pylint: disable=protected-access\\n vcf_file.formats[nid] = vcf.parser._Format(id=nid, num=num, type=ntype, desc=desc)\",\n \"def formatter(text):\\n repl_map = {\\n \\\"degC\\\": \\\"$^o$C\\\",\\n \\\"K\\\": \\\"$^o$C\\\",\\n \\\"month-1\\\": \\\"month$^{{-1}}$\\\",\\n \\\"day-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"d-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"decade-1\\\": \\\"decade$^{{-1}}$\\\",\\n \\\"year-1\\\": \\\"year$^{{-1}}$\\\",\\n \\\"rcp85\\\": \\\"RCP8.5\\\",\\n \\\"rcp45\\\": \\\"RCP4.5\\\",\\n \\\"rcp26\\\": \\\"RCP2.6\\\",\\n \\\"RCP85\\\": \\\"RCP8.5\\\",\\n \\\"RCP45\\\": \\\"RCP4.5\\\",\\n \\\"RCP26\\\": \\\"RCP2.6\\\",\\n \\\"cmip5-85\\\": \\\"RCP8.5\\\",\\n \\\"cmip5-60\\\": \\\"RCP6.0\\\",\\n \\\"cmip5-45\\\": \\\"RCP4.5\\\",\\n \\\"cmip5-26\\\": \\\"RCP2.6\\\",\\n \\\"ssp585\\\": \\\"SSP5-8.5\\\",\\n \\\"ssp245\\\": \\\"SSP2-4.5\\\",\\n \\\"ssp126\\\": \\\"SSP1-2.6\\\",\\n \\\"SSP585\\\": \\\"SSP5-8.5\\\",\\n \\\"SSP245\\\": \\\"SSP2-4.5\\\",\\n \\\"SSP126\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-85\\\": \\\"SSP5-8.5\\\",\\n \\\"cmip6-70\\\": \\\"SSP3-7.0\\\",\\n \\\"cmip6-60\\\": \\\"SSP4-6.0\\\",\\n \\\"cmip6-34\\\": \\\"SSP4-3.4\\\",\\n \\\"cmip6-45\\\": \\\"SSP2-4.5\\\",\\n \\\"cmip6-26\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-19\\\": \\\"SSP1-1.9\\\",\\n \\\"1\\\": \\\"%\\\",\\n \\\"era5\\\": \\\"ERA5\\\",\\n \\\"gpcc025x025_v8\\\": \\\"GPCC\\\",\\n \\\"cru\\\": \\\"CRU\\\",\\n \\\"jra55\\\": \\\"JRA55\\\",\\n \\\"HIGHRESMIP\\\": \\\"HighResMIP\\\",\\n \\\" \\\": \\\"\\\",\\n }\\n for key, val in repl_map.items():\\n if key in text:\\n text = text.replace(key, val)\\n break\\n return text\",\n \"def _raise_format_error(self, name: str, format_str: str, source_format: str):\\n\\n raise ValueError(f\\\"The '{ name }' should be { format_str }, rather than { source_format }\\\")\",\n \"def apply_formatting_dict(obj: Any, formatting: Dict[str, Any]) -> Any:\\n # logger.debug(\\\"Processing object of type {}\\\".format(type(obj)))\\n new_obj = obj\\n\\n if isinstance(obj, str):\\n # Apply the formatting options to the string.\\n # We explicitly allow for missing keys. They will be kept so they can be filled later.\\n # see: https://stackoverflow.com/a/17215533\\n # If a more sophisticated solution is needed,\\n # see: https://ashwch.github.io/handling-missing-keys-in-str-format-map.html\\n # Note that we can't use format_map because it is python 3.2+ only.\\n # The solution below works in py 2/3\\n if \\\"$\\\" not in obj:\\n new_obj = string.Formatter().vformat(obj, (), formatting_dict(**formatting))\\n # else:\\n # logger.debug(\\\"Skipping str {} since it appears to be a latex string, which may break the formatting.\\\".format(obj))\\n elif isinstance(obj, dict):\\n new_obj = {}\\n for k, v in obj.items():\\n # Using indirect access to ensure that the original object is updated.\\n new_obj[k] = apply_formatting_dict(v, formatting)\\n elif isinstance(obj, list):\\n new_obj = []\\n for i, el in enumerate(obj):\\n # Using indirect access to ensure that the original object is updated.\\n new_obj.append(apply_formatting_dict(el, formatting))\\n elif isinstance(obj, int) or isinstance(obj, float) or obj is None:\\n # Skip over this, as there is nothing to be done - we just keep the value.\\n pass\\n elif isinstance(obj, enum.Enum):\\n # Skip over this, as there is nothing to be done - we just keep the value.\\n # This only occurs when a formatting value has already been transformed\\n # into an enumeration.\\n pass\\n else:\\n # This may or may not be expected, depending on the particular value.\\n logger.debug(f\\\"Unrecognized obj '{obj}' of type '{type(obj)}'\\\")\\n\\n return new_obj\",\n \"def update_format_string(self):\\n if self._show_units:\\n units = \\\" {}\\\".format(self._unit)\\n else:\\n units = \\\"\\\"\\n\\n if self._show_step_exponent:\\n self.setSuffix(\\\"{0} Step: 1E{1}\\\".format(units, self.step_exponent))\\n self.lineEdit().setToolTip(\\\"\\\")\\n else:\\n self.setSuffix(units)\\n self.lineEdit().setToolTip('Step: 1E{0:+d}'.format(self.step_exponent))\",\n \"def format_field(self, value, spec):\\n cache = Cache()\\n if spec == \\\"co\\\":\\n # if cache(re.match(\\\"(.*)co$\\\", spec)):\\n value = co_join(value)\\n spec = \\\"s\\\"\\n # cache.output.group(1) + \\\"s\\\"\\n elif cache(re.match(r\\\"^sub(\\\\d?)_?(.*)$\\\", spec)):\\n depth = (1 if cache.output.group(1) == \\\"\\\" else\\n int(cache.output.group(1)))\\n value = \\\"\\\\n\\\".join([\\n \\\"{0}{1} = {2}\\\".format(depth * \\\" \\\", key, val)\\n for key, val in value.items()])\\n if cache.output.group(2) != \\\"\\\":\\n value = (\\n depth * \\\"[\\\" + cache.output.group(2) + depth * \\\"]\\\" + \\\"\\\\n\\\" +\\n value)\\n spec = \\\"s\\\"\\n return super(Format, self).format_field(value, spec)\",\n \"def filter_formatdate(val, format_str):\\n if not isinstance(val, (datetime, date, time)):\\n return val\\n return val.strftime(format_str)\",\n \"def __makeFormatString(self):\\n self.__formatString = \\\"\\\"\\n for f in self.__columns:\\n self.__formatString += \\\"%(\\\"+ f + \\\")-\\\" + str(self.__widths[f]) + \\\\\\n \\\"s \\\"\",\n \"def add_formatter(self, fmt):\\n if fmt and not isfunction(fmt):\\n raise TypeError(\\\"custom format function must be a type of function\\\")\\n\\n if fmt and fmt.__code__.co_argcount < 2:\\n raise TypeError(\\\"custom format function requires at least 2 arguments\\\")\\n\\n self.formatter = fmt\",\n \"def _resolve_sse_format(self, sse_format, **kwargs):\\n sse_format_int = [x[-1] for x in pytan.constants.SSE_FORMAT_MAP if sse_format.lower() in x]\\n\\n if not sse_format_int:\\n m = \\\"Unsupport export format {!r}, must be one of:\\\\n{}\\\".format\\n ef_map_txt = '\\\\n'.join(\\n [', '.join(['{!r}'.format(x) for x in y]) for y in pytan.constants.SSE_FORMAT_MAP]\\n )\\n raise pytan.exceptions.HandlerError(m(sse_format, ef_map_txt))\\n\\n sse_format_int = sse_format_int[0]\\n\\n m = \\\"'sse_format resolved from '{}' to '{}'\\\".format\\n self.mylog.debug(m(sse_format, sse_format_int))\\n\\n self._check_sse_format_support(\\n sse_format=sse_format, sse_format_int=sse_format_int, **kwargs\\n )\\n\\n return sse_format_int\",\n \"def format(self, record):\\n\\n\\n if not hasattr(record, 'filename_'):\\n record.file_indicator = '-'\\n else:\\n record.file_indicator = os.path.relpath(record.filename_.strip(),\\n self.study_dir)\\n record.line_indicator = self.format_aggregated(\\n record,\\n 'line_number',\\n ' line %d:',\\n ' lines [%s]:',\\n optional=True)\\n record.column_indicator = self.format_aggregated(\\n record,\\n 'column_number',\\n ' column %d:',\\n ' columns [%s]:',\\n optional=True)\\n record.cause_indicator = self.format_aggregated(\\n record,\\n 'cause',\\n \\\"; value encountered: '%s'\\\",\\n \\\"; values encountered: ['%s']\\\",\\n join_string=\\\"', '\\\",\\n optional=True)\\n\\n # format the string based on these fields\\n formatted_result = super(LogfileStyleFormatter, self).format(record)\\n\\n # prepend an empty line if the filename is different than before\\n current_filename = getattr(record, 'filename_', '')\\n if (self.previous_filename is not None and\\n current_filename != self.previous_filename):\\n formatted_result = '\\\\n' + formatted_result\\n self.previous_filename = current_filename\\n\\n return formatted_result\",\n \"def valueformat(value, format_list):\\n\\n # print(\\\"\\\\n\\\", format_list, value)\\n concat_key = format_list.split('.')\\n # Pass in either the key of the field\\n # or pass in resource.key to enable a resource lookup.\\n key = \\\"\\\"\\n resource = \\\"\\\"\\n member_id = \\\"\\\"\\n key_sequence = [key, resource, member_id]\\n count = 0\\n for r in reversed(concat_key):\\n key_sequence[count] = r\\n count += 1\\n\\n # print(\\\"Concat_key:\\\", concat_key)\\n key = key_sequence[0]\\n resource = key_sequence[1]\\n member_id = key_sequence[2]\\n\\n # print(\\\"Key:\\\", key)\\n\\n if key:\\n if key.lower() == \\\"address\\\":\\n return dt_address(value)\\n\\n elif key.lower() == \\\"telecom\\\":\\n return dt_telecom(value)\\n\\n elif key.lower() == \\\"name\\\":\\n return dt_name(value)\\n elif key.lower() == 'dosage':\\n return dt_dosage(value)\\n elif key.lower() == 'medicationreference':\\n # print(\\\"Working on\\\", key, \\\": \\\", value)\\n # f_value = value\\n # lookup field_formats\\n # concat_key should have a resource name\\n # print(\\\"\\\\n\\\\nRESOURCE:\\\", resource)\\n # print(\\\"calling dt_medicationreference with Resource:\\\", resource, \\\", value:\\\", value)\\n return dt_medicationreference(value, member_id, resource)\\n elif key.lower() == 'dataabsentreason':\\n if isinstance(value, dict):\\n return value['coding'][0]['display']\\n else:\\n return value\\n elif key.lower() == 'valuequantity':\\n # return str(value['value']) + \\\" \\\" + value['unit']\\n return dt_valuequantity(value)\\n elif key.lower() == 'valuestring':\\n return value\\n elif key.lower() == 'interpretation':\\n return value['coding'][0]['display']\\n elif key.lower() == 'referencerange':\\n return dt_referencerange(value)\\n elif key.lower() == 'requester':\\n if 'display' in value['agent']:\\n return dt_reference(value['agent'], member_id)\\n elif key.lower() == 'practitioner':\\n if 'display' in value:\\n return dt_reference(value, member_id)\\n elif key.lower() == 'organization':\\n if 'display' in value:\\n return dt_reference(value, member_id)\\n # elif key.lower() == \\\"result\\\":\\n # return dt_reference(value[0], member_id)\\n elif key.lower() == 'practitioner':\\n if 'display' in value:\\n return dt_reference(value, member_id)\\n elif key.lower() == 'organization':\\n if 'display' in value:\\n return dt_reference(value, member_id)\\n elif key.lower() == 'participant':\\n if 'display' in value[0]['individual']:\\n return dt_reference(value[0]['individual'], member_id)\\n elif key.lower() == 'location':\\n if 'display' in value[0]['location']:\\n return dt_reference(value[0]['location'], member_id)\\n elif key.lower() == 'communication':\\n return dt_communication(value)\\n else:\\n # print(\\\"value:\\\", value, \\\" type:\\\", type(value), \\\" for: \\\", key)\\n return value\",\n \"def _printAttributePrintf(self, formatting, value):\\n\\n # multiple entrys\\n if isinstance(formatting, list):\\n\\n for scanf_format in formatting:\\n try:\\n #print \\\"-->>\\\", scanf_format, value\\n return scanf_format % value\\n except TypeError, e:\\n pass\\n\\n # single entry\\n else:\\n return formatting % value\\n\\n # problem if none of the formats worked\\n raise TypeError(\\\"Valid format not found for values.\\\")\",\n \"def assign_format(self):\\n if self.is_output or self.is_req_output:\\n if self.pname in self.tool_data[self.tool_name]['output_fmt']:\\n return self.tool_data[self.tool_name]['output_fmt'][self.pname]\\n elif self.pname in self.gen_out_fmt:\\n return self.gen_out_fmt[self.pname]\\n elif self.is_input:\\n if self.pname in self.tool_data[self.tool_name]['input_fmt']:\\n print(self.tool_data[self.tool_name])\\n return self.tool_data[self.tool_name]['input_fmt'][self.pname]\\n elif self.pname in self.gen_in_fmt:\\n return self.gen_in_fmt[self.pname]\\n else:\\n # Not sure yet what this will be used for, but I think we need it.\\n return ''\",\n \"def _add_report_formatting(self, cell_range: str, fmt_spec: gsfmt.CellFormat):\\n self.report_formatting.append((cell_range, fmt_spec))\",\n \"def vformat(self, format_string, args, kwargs):\\n self._used_kwargs = {}\\n self._unused_kwargs = {}\\n return super(MemorizeFormatter, self).vformat(format_string, args, kwargs)\",\n \"def _format(path, arformat):\\n if isinstance(path, unicode):\\n path = path.encode('utf-8')\\n\\n if path.startswith('#1/'):\\n if not arformat:\\n arformat = AR_FORMAT_BSD\\n elif arformat is AR_FORMAT_SIMPLE:\\n raise IOError('File name starts with special for format!')\\n\\n if len(path) >= 16:\\n if arformat is None:\\n arformat = AR_FORMAT_BSD\\n elif arformat is AR_FORMAT_SIMPLE:\\n raise IOError('File name too long for format!')\\n\\n if ' ' in path:\\n if not arformat:\\n arformat = AR_FORMAT_BSD\\n elif arformat is AR_FORMAT_SIMPLE:\\n raise IOError('File name contains forbidden character for format!')\\n\\n if arformat is None:\\n arformat = AR_FORMAT_SIMPLE\\n\\n return arformat\",\n \"def merge(string: str, user_input: tuple) -> str:\\n merged_string = string.format(*user_input)\\n return merged_string\",\n \"def register_filename_format(format_name,parser):\\n if format_name == \\\"ALL\\\":\\n raise ValueError(\\\"filename format code ALL is reserved\\\")\\n\\n filename_format_parser[format_name] = parser\",\n \"def _format_msg(self, format_str, *args):\\n if not args:\\n format_str = six.moves.urllib.parse.unquote(format_str)\\n return \\\"{} - - [{}] {}\\\\n\\\".format(\\n self.client_address[0],\\n self.log_date_time_string(),\\n format_str % args\\n )\",\n \"def set_format(cls,format):\\n import __main__\\n IP = __main__.__dict__['__IP']\\n prompt = getattr(IP.outputcache,cls._prompt)\\n prompt.p_template = format\\n prompt.set_p_str()\\n cls._format = format\",\n \"def format_string(s, formatter='minimal'):\\n if not callable(formatter):\\n formatter = get_formatter_for_name(formatter)\\n if formatter is None:\\n output = s\\n else:\\n output = formatter(s)\\n return output\",\n \"def register_str_format(\\n tag: Tag, conformer: Optional[Conformer] = None\\n) -> Callable[[ValidatorFn], ValidatorFn]:\\n\\n def create_str_format(f: ValidatorFn) -> ValidatorFn:\\n with _STR_FORMAT_LOCK:\\n _STR_FORMATS[tag] = StrFormat(f, conformer=conformer)\\n return f\\n\\n return create_str_format\",\n \"def complete_opt_format(self, text, *_):\\n return [t + \\\" \\\" for t in FORMATTERS if t.startswith(text)]\",\n \"def get_format_opts(cls, format_=\\\"value\\\", fields=[]):\\n return \\\" -f {0} {1}\\\".format(format_, \\\" \\\".join([\\\"-c \\\" + it for it in fields]))\",\n \"def setup(self, formats):\\n for f in formats:\\n try:\\n self.counters[f] += 1\\n except KeyError:\\n self.counters[f] = 1\\n self.vim.command(f\\\"set efm+={f}\\\")\",\n \"def dt_format_translate(pyfmt):\\n\\n translate = {\\\"%a\\\": \\\"ddd\\\",\\n \\\"%A\\\": \\\"dddd\\\",\\n \\\"%b\\\": \\\"mmm\\\",\\n \\\"%B\\\": \\\"mmmm\\\",\\n \\\"%c\\\": \\\"\\\",\\n \\\"%d\\\": \\\"dd\\\",\\n \\\"%f\\\": \\\"\\\",\\n \\\"%H\\\": \\\"hh\\\",\\n \\\"%I\\\": \\\"hh\\\",\\n \\\"%j\\\": \\\"\\\",\\n \\\"%m\\\": \\\"mm\\\",\\n \\\"%M\\\": \\\"mm\\\",\\n \\\"%p\\\": \\\"AM/PM\\\",\\n \\\"%S\\\": \\\"ss\\\",\\n \\\"%U\\\": \\\"\\\",\\n \\\"%w\\\": \\\"\\\",\\n \\\"%W\\\": \\\"\\\",\\n \\\"%x\\\": \\\"\\\",\\n \\\"%X\\\": \\\"\\\",\\n \\\"%y\\\": \\\"yy\\\",\\n \\\"%Y\\\": \\\"yyyy\\\",\\n \\\"%z\\\": \\\"\\\",\\n \\\"%Z\\\": \\\"\\\",\\n \\\"%%\\\": \\\"%\\\"}\\n\\n xlfmt = str(pyfmt)\\n\\n for item in translate:\\n if item in xlfmt:\\n xlfmt = xlfmt.replace(item, translate[item])\\n return xlfmt\",\n \"def __normalize(self, ctx: commands.Context, format: str) -> str:\\n\\t\\t# convert to lowercase\\n\\t\\tlower_format = format.lower()\\n\\t\\t# check if inputted format is recognized\\n\\t\\tif lower_format in self.formats:\\n\\t\\t\\treturn lower_format\\n\\t\\t# check for aliases\\n\\t\\telif lower_format in self.aliases:\\n\\t\\t\\treturn self.aliases[lower_format]\\n\\t\\t# format is not recognized\\n\\t\\telse:\\n\\t\\t\\traise FriendlyError(\\n\\t\\t\\t\\tf\\\"'{format}' is not a recognized format.\\\", ctx.channel, ctx.author\\n\\t\\t\\t)\",\n \"def get_formatted_string(self, input_string):\\n if isinstance(input_string, str):\\n try:\\n return self.get_processed_string(input_string)\\n except KeyError as err:\\n # Wrapping the KeyError into a less cryptic error for end-user\\n # friendliness\\n missing_key = err.args[0]\\n raise KeyNotInContextError(\\n f'Unable to format \\\\'{input_string}\\\\' with '\\n f'{{{missing_key}}}, because '\\n f'context[\\\\'{missing_key}\\\\'] doesn\\\\'t exist') from err\\n else:\\n raise TypeError(f\\\"can only format on strings. {input_string} is a \\\"\\n f\\\"{type(input_string)} instead.\\\")\",\n \"def reformat():\\n toolkit.reformat()\",\n \"def __format__(self, format_spec):\\n if format_spec == \\\"polite\\\":\\n return self.polite\\n elif format_spec == \\\"casual\\\":\\n return self.casual\\n else:\\n # Using string addition here to avoid triggering flake8-sfs\\n # while still giving a meaningful self-contained example:\\n raise ValueError(format_spec + \\\" not a format defined by Client object\\\")\",\n \"def format_(self):\\n return self.set_format or self.default_format or self.FALLBACK_FORMAT\",\n \"def format(self, message):\",\n \"def format_string(self, pat=None, pat_args={}):\\n if pat is None:\\n pat = self.parent.pat\\n if pat_args == {}:\\n pat_args = self.parent.pat_args\\n return entry_format.output(self, pat, pat_args)\",\n \"def formats():\\n return _FORMATS\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.64630926","0.62091905","0.5800091","0.5796576","0.5712765","0.57114947","0.57108057","0.55900645","0.5558063","0.55575746","0.543823","0.5434389","0.5409675","0.54084057","0.5407691","0.53960705","0.5389524","0.5365024","0.536046","0.53591377","0.5347189","0.53174406","0.5299757","0.52616566","0.5260935","0.52346927","0.52232057","0.52054524","0.52024364","0.5178537","0.5174698","0.51715887","0.5169623","0.51565874","0.51419294","0.5110237","0.5106162","0.50872636","0.50872636","0.50857365","0.50797033","0.5068049","0.5047103","0.5045401","0.5042234","0.5029329","0.5019787","0.50191045","0.49938348","0.49809968","0.49774867","0.49749777","0.49488375","0.49193978","0.4911113","0.49104512","0.49016646","0.48896325","0.4888514","0.48864","0.48852763","0.48846358","0.4882669","0.48785567","0.48667544","0.4865224","0.4838269","0.48359227","0.48305956","0.48236126","0.48159927","0.47873333","0.4786662","0.47859585","0.4772103","0.47608912","0.47545344","0.47523347","0.47488862","0.4731774","0.47315702","0.47303045","0.47083676","0.47082552","0.4707627","0.4706674","0.46773958","0.46729234","0.467078","0.46677604","0.46592674","0.46567273","0.46514422","0.46440995","0.4638231","0.4636683","0.4636164","0.4630081","0.46279675","0.46245953"],"string":"[\n \"0.64630926\",\n \"0.62091905\",\n \"0.5800091\",\n \"0.5796576\",\n \"0.5712765\",\n \"0.57114947\",\n \"0.57108057\",\n \"0.55900645\",\n \"0.5558063\",\n \"0.55575746\",\n \"0.543823\",\n \"0.5434389\",\n \"0.5409675\",\n \"0.54084057\",\n \"0.5407691\",\n \"0.53960705\",\n \"0.5389524\",\n \"0.5365024\",\n \"0.536046\",\n \"0.53591377\",\n \"0.5347189\",\n \"0.53174406\",\n \"0.5299757\",\n \"0.52616566\",\n \"0.5260935\",\n \"0.52346927\",\n \"0.52232057\",\n \"0.52054524\",\n \"0.52024364\",\n \"0.5178537\",\n \"0.5174698\",\n \"0.51715887\",\n \"0.5169623\",\n \"0.51565874\",\n \"0.51419294\",\n \"0.5110237\",\n \"0.5106162\",\n \"0.50872636\",\n \"0.50872636\",\n \"0.50857365\",\n \"0.50797033\",\n \"0.5068049\",\n \"0.5047103\",\n \"0.5045401\",\n \"0.5042234\",\n \"0.5029329\",\n \"0.5019787\",\n \"0.50191045\",\n \"0.49938348\",\n \"0.49809968\",\n \"0.49774867\",\n \"0.49749777\",\n \"0.49488375\",\n \"0.49193978\",\n \"0.4911113\",\n \"0.49104512\",\n \"0.49016646\",\n \"0.48896325\",\n \"0.4888514\",\n \"0.48864\",\n \"0.48852763\",\n \"0.48846358\",\n \"0.4882669\",\n \"0.48785567\",\n \"0.48667544\",\n \"0.4865224\",\n \"0.4838269\",\n \"0.48359227\",\n \"0.48305956\",\n \"0.48236126\",\n \"0.48159927\",\n \"0.47873333\",\n \"0.4786662\",\n \"0.47859585\",\n \"0.4772103\",\n \"0.47608912\",\n \"0.47545344\",\n \"0.47523347\",\n \"0.47488862\",\n \"0.4731774\",\n \"0.47315702\",\n \"0.47303045\",\n \"0.47083676\",\n \"0.47082552\",\n \"0.4707627\",\n \"0.4706674\",\n \"0.46773958\",\n \"0.46729234\",\n \"0.467078\",\n \"0.46677604\",\n \"0.46592674\",\n \"0.46567273\",\n \"0.46514422\",\n \"0.46440995\",\n \"0.4638231\",\n \"0.4636683\",\n \"0.4636164\",\n \"0.4630081\",\n \"0.46279675\",\n \"0.46245953\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6789656"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94768,"cells":{"query":{"kind":"string","value":"Parse the format string into blocks containing Literals, Placeholders etc that we can cache and reuse."},"document":{"kind":"string","value":"def build_block(self, format_string):\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\n block = first_block\n\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n value = token.group(0)\n if token.group(\"block_start\"):\n # Create new block\n block = block.new_block()\n elif token.group(\"block_end\"):\n # Close block setting any valid state as needed\n # and return to parent block to continue\n if not block.parent:\n raise Exception(\"Too many `]`\")\n block = block.parent\n elif token.group(\"switch\"):\n # a new option has been created\n block = block.switch()\n elif token.group(\"placeholder\"):\n # Found a {placeholder}\n key = token.group(\"key\")\n format = token.group(\"format\")\n block.add(Placeholder(key, format))\n elif token.group(\"literal\"):\n block.add(Literal(value))\n elif token.group(\"lost_brace\"):\n # due to how parsing happens we can get a lonesome }\n # eg in format_string '{{something}' this fixes that issue\n block.add(Literal(value))\n elif token.group(\"command\"):\n # a block command has been found\n block.set_commands(token.group(\"command\"))\n elif token.group(\"escaped\"):\n # escaped characters add unescaped values\n if value[0] in [\"\\\\\", \"{\", \"}\"]:\n value = value[1:]\n block.add(Literal(value))\n\n if block.parent:\n raise Exception(\"Block not closed\")\n # add to the cache\n self.block_cache[format_string] = first_block"},"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 _parse(self, fmtstr):\n def _match_brace(string, start_pos, pair='[]'):\n \"\"\"Pairing brackets (used internally in _parse method)\"\"\"\n depth = 1\n if string[start_pos] != pair[0]:\n return None\n for index, char in enumerate(string[start_pos + 1:]):\n if char == pair[0]:\n depth += 1\n elif char == pair[1]:\n depth -= 1\n if depth == 0:\n return start_pos + index + 1\n return None\n\n #----------------------------------------------------------------------\n\n t_fmt = self.__class__._T_FMT\n t_prefix = self.__class__._T_PREFIX\n\n ptr = 0\n # it seems that field id 0 is invalid\n field_id = 1\n length = len(fmtstr)\n parsed_list = []\n\n while ptr < length:\n parsed = {}\n m_prefix = t_prefix.match(fmtstr[ptr:])\n if m_prefix:\n ptr += _get_length_of_match(m_prefix)\n parsed['prefix'] = m_prefix.group(1)\n\n # check if we have a nested structure\n if m_prefix.group(2):\n brace_offset = _match_brace(fmtstr, ptr - 1)\n\n # bracket not match\n if not brace_offset:\n raise BadFormatString(\n 'Unmatched brace on position {0}'.format(ptr)\n )\n parsed['field_id'] = field_id\n parsed['field_type'] = 'a'\n parsed['subcontent'] = self._parse(\n fmtstr[ptr:brace_offset]\n )\n ptr = brace_offset + 1\n field_id += 1\n\n parsed_list.append(parsed)\n continue\n m_fmt = t_fmt.match(fmtstr[ptr:])\n if m_fmt:\n ptr += _get_length_of_match(m_fmt)\n\n # fmt is an alias\n if m_fmt.group(2):\n parsed['field_type'] = self.__class__\\\n .FIELD_ALIAS[m_fmt.group(2)]\n # fmt is an actual field type\n elif m_fmt.group(1):\n parsed['field_type'] = m_fmt.group(1)\n\n # save field id\n parsed['field_id'] = field_id\n\n # check for type clones (e.g. `v3')\n if m_fmt.group(3):\n parsed['repeat'] = int(m_fmt.group(3))\n field_id += int(m_fmt.group(3))\n else:\n parsed['repeat'] = 1\n field_id += 1\n\n parsed_list.append(parsed)\n\n else:\n raise BadFormatString(\n 'Invalid token on position {0}'.format(ptr)\n )\n\n # all set\n return parsed_list","def parse_blocks(fblocks):\n print('Parse blocks: ', end='')\n result = []\n\n for line in fblocks:\n stripped = line.strip()\n if len(stripped) > 0 and stripped[0] != '#':\n match = re.match(r\"([0-9A-F]+)\\.{2}([0-9A-F]+);\\s+(.+)\", stripped)\n result.append({\n 'begin': int(match.group(1), 16),\n 'end': int(match.group(2), 16),\n 'name': match.group(3)\n })\n\n print('done')\n return result","def _interpolate(format):\n from tokenize import tokenprog\n\n def matchorfail(text, pos):\n match = tokenprog.match(text, pos)\n if match is None:\n raise _ItplError(text, pos)\n return match, match.end()\n\n namechars = \"abcdefghijklmnopqrstuvwxyz\" \\\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\";\n chunks = []\n pos = 0\n\n while 1:\n dollar = format.find(\"$\", pos)\n if dollar < 0: \n break\n nextchar = format[dollar + 1]\n\n if nextchar == \"{\":\n chunks.append((0, format[pos:dollar]))\n pos, level = dollar + 2, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token == \"{\": \n level = level + 1\n elif token == \"}\": \n level = level - 1\n chunks.append((1, format[dollar + 2:pos - 1]))\n\n elif nextchar in namechars:\n chunks.append((0, format[pos:dollar]))\n match, pos = matchorfail(format, dollar + 1)\n while pos < len(format):\n if format[pos] == \".\" and \\\n pos + 1 < len(format) and format[pos + 1] in namechars:\n match, pos = matchorfail(format, pos + 1)\n elif format[pos] in \"([\":\n pos, level = pos + 1, 1\n while level:\n match, pos = matchorfail(format, pos)\n tstart, tend = match.regs[3]\n token = format[tstart:tend]\n if token[0] in \"([\": \n level = level + 1\n elif token[0] in \")]\": \n level = level - 1\n else: \n break\n chunks.append((1, format[dollar + 1:pos]))\n else:\n chunks.append((0, format[pos:dollar + 1]))\n pos = dollar + 1 + (nextchar == \"$\")\n\n if pos < len(format): \n chunks.append((0, format[pos:]))\n return chunks","def update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\n and token.group(\"key\") in placeholder_formats\n ):\n output.append(f\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\")\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def _parse(self, template, fpos=0):\r\n # blank out comments\r\n # (So that its content does not collide with other syntax, and\r\n # because removing them completely would falsify the character-\r\n # position (\"match.start()\") of error-messages)\r\n template = self._reComment.sub(lambda match: self._comment_start+\" \"*len(match.group(1))+match.group(2), template)\r\n\r\n # init parser\r\n parsetree = []\r\n curr = 0 # current position (= end of previous block)\r\n block_type = None # block type: if,for,macro,raw,...\r\n block_indent = None # None: single-line, >=0: multi-line\r\n\r\n # find blocks\r\n for match in self._reBlock.finditer(template):\r\n start = match.start()\r\n # process template-part before this block\r\n if start > curr:\r\n self._parse_sub(parsetree, template[curr:start], fpos)\r\n\r\n # analyze block syntax (incl. error-checking and -messages)\r\n keyword = None\r\n block = match.groupdict()\r\n pos__ = fpos + start # shortcut\r\n if block[\"sKeyw\"] is not None: # single-line block tag\r\n block_indent = None\r\n keyword = block[\"sKeyw\"]\r\n param = block[\"sParam\"]\r\n content = block[\"sContent\"]\r\n if block[\"sSpace\"]: # restore spaces before start-tag\r\n if len(parsetree) > 0 and parsetree[-1][0] == \"str\":\r\n parsetree[-1] = (\"str\", parsetree[-1][1] + block[\"sSpace\"])\r\n else:\r\n parsetree.append((\"str\", block[\"sSpace\"]))\r\n pos_p = fpos + match.start(\"sParam\") # shortcuts\r\n pos_c = fpos + match.start(\"sContent\")\r\n elif block[\"mKeyw\"] is not None: # multi-line block tag\r\n block_indent = len(block[\"indent\"])\r\n keyword = block[\"mKeyw\"]\r\n param = block[\"mParam\"]\r\n content = block[\"mContent\"]\r\n pos_p = fpos + match.start(\"mParam\")\r\n pos_c = fpos + match.start(\"mContent\")\r\n ignored = block[\"mIgnored\"].strip()\r\n if ignored and ignored != self._comment_start:\r\n raise TemplateSyntaxError(\"No code allowed after block-tag.\", self._errpos(fpos+match.start(\"mIgnored\")))\r\n elif block[\"mEnd\"] is not None: # multi-line block end\r\n if block_type is None:\r\n raise TemplateSyntaxError(\"No block to end here/invalid indent.\", self._errpos(pos__) )\r\n if block_indent != len(block[\"mEnd\"]):\r\n raise TemplateSyntaxError(\"Invalid indent for end-tag.\", self._errpos(pos__) )\r\n ignored = block[\"meIgnored\"].strip()\r\n if ignored and ignored != self._comment_start:\r\n raise TemplateSyntaxError(\"No code allowed after end-tag.\", self._errpos(fpos+match.start(\"meIgnored\")))\r\n block_type = None\r\n elif block[\"sEnd\"] is not None: # single-line block end\r\n if block_type is None:\r\n raise TemplateSyntaxError(\"No block to end here/invalid indent.\", self._errpos(pos__))\r\n if block_indent is not None:\r\n raise TemplateSyntaxError(\"Invalid indent for end-tag.\", self._errpos(pos__))\r\n block_type = None\r\n else:\r\n raise TemplateException(\"FATAL: Block regexp error. Please contact the author. (%s)\" % match.group())\r\n\r\n # analyze block content (mainly error-checking and -messages)\r\n if keyword:\r\n keyword = keyword.lower()\r\n if 'for' == keyword:\r\n if block_type is not None:\r\n raise TemplateSyntaxError(\"Missing block-end-tag before new block at '%s'.\" %(match.group()), self._errpos(pos__))\r\n block_type = 'for'\r\n cond = self._reForParam.match(param)\r\n if cond is None:\r\n raise TemplateSyntaxError(\"Invalid 'for ...' at '%s'.\" %(param), self._errpos(pos_p))\r\n names = tuple(n.strip() for n in cond.group(\"names\").split(\",\"))\r\n self._testexpr(cond.group(\"iter\"), pos_p+cond.start(\"iter\"))\r\n parsetree.append((\"for\", names, cond.group(\"iter\"), self._parse(content, pos_c)))\r\n elif 'if' == keyword:\r\n if block_type is not None:\r\n raise TemplateSyntaxError(\"Missing block-end-tag before new block at '%s'.\" %(match.group()), self._errpos(pos__))\r\n if not param:\r\n raise TemplateSyntaxError(\"Missing condition for 'if' at '%s'.\" %(match.group()), self._errpos(pos__))\r\n block_type = 'if'\r\n self._testexpr(param, pos_p)\r\n parsetree.append((\"if\", param, self._parse(content, pos_c)))\r\n elif 'elif' == keyword:\r\n if block_type != 'if':\r\n raise TemplateSyntaxError(\"'elif' may only appear after 'if' at '%s'.\" %(match.group()), self._errpos(pos__))\r\n if not param:\r\n raise TemplateSyntaxError(\"Missing condition for 'elif' at '%s'.\" %(match.group()), self._errpos(pos__))\r\n self._testexpr(param, pos_p)\r\n parsetree.append((\"elif\", param, self._parse(content, pos_c)))\r\n elif 'else' == keyword:\r\n if block_type not in ('if', 'for'):\r\n raise TemplateSyntaxError(\"'else' may only appear after 'if' of 'for' at '%s'.\" %(match.group()), self._errpos(pos__))\r\n if param:\r\n raise TemplateSyntaxError(\"'else' may not have parameters at '%s'.\" %(match.group()), self._errpos(pos__))\r\n parsetree.append((\"else\", self._parse(content, pos_c)))\r\n elif 'macro' == keyword:\r\n if block_type is not None:\r\n raise TemplateSyntaxError(\"Missing block-end-tag before new block '%s'.\" %(match.group()), self._errpos(pos__))\r\n block_type = 'macro'\r\n # make sure param is \"\\w+\" (instead of \".+\")\r\n if not param:\r\n raise TemplateSyntaxError(\"Missing name for 'macro' at '%s'.\" %(match.group()), self._errpos(pos__))\r\n if not self._reMacroParam.match(param):\r\n raise TemplateSyntaxError(\"Invalid name for 'macro' at '%s'.\" %(match.group()), self._errpos(pos__))\r\n #remove last newline\r\n if len(content) > 0 and content[-1] == '\\n':\r\n content = content[:-1]\r\n if len(content) > 0 and content[-1] == '\\r':\r\n content = content[:-1]\r\n parsetree.append((\"macro\", param, self._parse(content, pos_c)))\r\n\r\n # parser-commands\r\n elif 'raw' == keyword:\r\n if block_type is not None:\r\n raise TemplateSyntaxError(\"Missing block-end-tag before new block '%s'.\" %(match.group()), self._errpos(pos__))\r\n if param:\r\n raise TemplateSyntaxError(\"'raw' may not have parameters at '%s'.\" %(match.group()), self._errpos(pos__))\r\n block_type = 'raw'\r\n parsetree.append((\"str\", content))\r\n elif 'include' == keyword:\r\n if block_type is not None:\r\n raise TemplateSyntaxError(\"Missing block-end-tag before new block '%s'.\" %(match.group()), self._errpos(pos__))\r\n if param:\r\n raise TemplateSyntaxError(\"'include' may not have parameters at '%s'.\" %(match.group()), self._errpos(pos__))\r\n block_type = 'include'\r\n try:\r\n u = self._load(content.strip())\r\n except Exception,err:\r\n raise TemplateIncludeError(err, self._errpos(pos__))\r\n self._includestack.append((content.strip(), u)) # current filename/template for error-msg.\r\n p = self._parse(u)\r\n self._includestack.pop()\r\n parsetree.extend(p)\r\n elif 'set_escape' == keyword:\r\n if block_type is not None:\r\n raise TemplateSyntaxError(\"Missing block-end-tag before new block '%s'.\" %(match.group()), self._errpos(pos__))\r\n if param:\r\n raise TemplateSyntaxError(\"'set_escape' may not have parameters at '%s'.\" %(match.group()), self._errpos(pos__))\r\n block_type = 'set_escape'\r\n esc = content.strip().upper()\r\n if esc not in ESCAPE_SUPPORTED:\r\n raise TemplateSyntaxError(\"Unsupported escape '%s'.\" %(esc), self._errpos(pos__))\r\n self.escape = ESCAPE_SUPPORTED[esc]\r\n else:\r\n raise TemplateSyntaxError(\"Invalid keyword '%s'.\" %(keyword), self._errpos(pos__))\r\n curr = match.end()\r\n\r\n if block_type is not None:\r\n raise TemplateSyntaxError(\"Missing end-tag.\", self._errpos(pos__))\r\n\r\n if len(template) > curr: # process template-part after last block\r\n self._parse_sub(parsetree, template[curr:], fpos)\r\n\r\n return parsetree","def parse_block(\n string: str,\n vars: Dict,\n neg: bool = False,\n min_: int = 1,\n max_: int = 1,\n label: Optional[str] = None,\n start: int = -1,\n) -> Block:\n it: BlockIterator = BlockIterator(string, start=start)\n members: List[Union[Block, Unit, Ref]] = []\n block = Block(members, vars, neg=neg, min_=min_, max_=max_, label=label)\n for content, neg, min_, max_, label, type_, line_num in it:\n if type_ == Types.BLOCK:\n members.append(parse_block(content, vars, neg, min_, max_, label, line_num))\n elif type_ == Types.UNIT:\n members.append(parse_unit(content, neg, min_, max_, label))\n elif type_ == Types.VAR_REF:\n members.append(Ref(content, neg, min_, max_, label))\n # use this after the iteration is complete\n block.union = it.is_union\n if not block.members and not EMPTY_BLOCK_RE.match(string):\n raise ValueError(\n f\"Cannot parse block contents: {string} \" f\"starting at {start}\"\n )\n return block","def get_placeholder_formats_list(self, format_string):\n placeholders = []\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.append((token.group(\"key\"), token.group(\"format\")))\n return placeholders","def parse(self, s):\n\n segments = self.compiled.split(self._whitespace.sub(\" \", s))\n literals = segments[::2]\n raw = segments[1::2]\n\n if not raw:\n return []\n\n case = list(map(str.casefold, raw))\n prefixes = [{}] + [dict(self.locale_set.prefixes.get(match, ())) for match in case[:-1]]\n suffixes = [dict(self.locale_set.suffixes.get(match, ())) for match in case[1:]] + [{}]\n\n groups = _DateTime(**{ field: [] for field in _DateTime._fields })\n choices_per_position = {}\n always_literal = set()\n numeric = set()\n for idx, (prefix, suffix) in enumerate(zip(prefixes, suffixes)):\n keyword = self._lookup_keyword(raw[idx])\n if \"y\" in prefix:\n prefix[\"C\"] = tuple(set(prefix[\"y\"] + prefix.get(\"C\", ())))\n if not keyword:\n always_literal.add(idx)\n else:\n if raw[idx].isdigit():\n numeric.add(idx)\n choices_per_position[idx] = len(keyword)\n for fmt, value, locales in keyword:\n category = fmt[-1]\n if category == \"b\":\n # Month-names should be treated like numeric months.\n category = \"m\"\n elif category == \"z\":\n category = \"Z\"\n getattr(groups, category).append(_Assignment(\n fmt=fmt,\n pos=idx,\n value=value,\n locales=locales,\n prefix=prefix.get(fmt[-1]),\n suffix=suffix.get(fmt[-1]),\n ))\n numeric = frozenset(numeric)\n\n # If a required date field is unsatisfiable, this is not a date.\n if not all(getattr(groups, category) for category in _State._min_date_formats):\n for category in _State._all_date_formats:\n getattr(groups, category).clear()\n\n # If a required time field is unsatisfiable, this is not a time.\n if not all(getattr(groups, category) for category in _State._min_time_formats):\n for category in _State._all_time_formats:\n getattr(groups, category).clear()\n\n for group in groups:\n group.sort(key=lambda assignment: (\n -self._optimistic_score(assignment),\n choices_per_position[assignment.pos],\n ))\n\n required_formats = _State._min_date_formats + _State._min_time_formats\n groups = OrderedDict(sorted(\n (\n (\n category,\n (\n group,\n tuple(\n (f, required)\n for f, required in _position_constraints\n if category in required\n ),\n tuple(\n (f, required)\n for f, required, revisit in _value_constraints\n if category in required or category in revisit\n ),\n )\n )\n for category, group in zip(groups._fields, groups)\n if group\n ),\n key=lambda i: (i[0] not in required_formats, len(i[1][0]))\n ))\n\n # We've already filtered out all possibilities; there's nothing here.\n if not groups:\n return []\n\n constrained_groups = []\n while groups:\n category, (group, position, value) = groups.popitem(last=False)\n constrained_groups.append((category, group, position, value))\n required = frozenset(itertools.chain.from_iterable(required for f, required in itertools.chain(position, value)))\n if required:\n required = [\n category\n for category in reversed(groups.keys())\n if category in required\n ]\n for category in required:\n groups.move_to_end(category, last=False)\n groups = constrained_groups\n\n best_quality = 0\n best_candidates = []\n\n partials = [\n _State.empty._replace(\n unconverted=frozenset(always_literal),\n remaining_groups=tuple(groups),\n ).children(numeric=numeric)\n ]\n while partials:\n try:\n quality, locales, state = next(partials[-1])\n except StopIteration:\n partials.pop()\n continue\n\n if state.remaining_groups:\n # Admissable heuristic: compute the best score each group\n # could possibly achieve. Don't count conversion specifiers\n # that we've already used, but don't worry about conflicts\n # in the groups we haven't assigned yet. Any such conflicts\n # can only reduce the resulting score, and we only need to\n # make sure that the heuristic is at least as large as the\n # true value of the best leaf in this subtree. However, the\n # more precise we can be here, the fewer nodes we have to\n # search, so we can spend some CPU time on precision and\n # still come out ahead.\n assigned = state.unconverted.union(state.pos).difference((None,))\n heuristic = len(state.pending_hints) + sum(\n next((\n self._optimistic_score(assignment)\n for assignment in group[1]\n if assignment.pos not in assigned\n ), 0)\n for group in state.remaining_groups\n )\n\n if quality + heuristic < best_quality:\n # Even assuming the remaining groups get the highest\n # possible score, this state is still not good enough.\n continue\n\n partials.append(state.children(numeric=numeric))\n continue\n\n value = state.valid()\n if value is None:\n continue\n\n quality, locales, state = state.final_score()\n\n if best_quality is not None and quality < best_quality:\n # We've seen better, so skip this one.\n continue\n\n if quality != best_quality:\n best_quality = quality\n best_candidates = []\n\n conversions = dict(zip(state.pos, state.fmts))\n fmts = [ conversions.get(idx) or literal for idx, literal in enumerate(raw) ]\n\n pattern = ''.join(lit + fmt for lit, fmt in zip(literals, fmts + [''])).replace(\"%C%y\", \"%Y\")\n best_candidates.append((pattern, value, locales))\n return best_candidates","def initFormat(self):\n self.formatList = self.splitText(self.format)","def blockParser(block):\n struct = []\n first = True\n record = False\n for line in block:\n if line.startswith('Structure #'):\n record = True\n if not first:\n yield struct\n struct = []\n first = False\n if record:\n struct.append(line)\n yield struct","def parse_block_layout(raw_block_layout):\n\n validate_raw_block_layout(raw_block_layout)\n\n block_layout = []\n for raw_layer_layout in raw_block_layout:\n raw_block_specs = raw_layer_layout.split('-')\n layer = [raw_block_spec.split(',') for raw_block_spec in raw_block_specs]\n layer = [(block_name, int(num_repeats)) for block_name, num_repeats in layer]\n block_layout.append(layer)\n\n return block_layout","def __init__(self, format_string):\r\n if not isinstance(format_string, Compatibility.string):\r\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\r\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\r\n self._re = re.compile(self._re_pattern)","def update_placeholders(self, format_string, placeholders):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if token.group(\"key\") in placeholders:\n output.append(\n \"{{{}{}}}\".format(placeholders[token.group(\"key\")], token.group(\"format\"))\n )\n continue\n elif token.group(\"command\"):\n # update any placeholders used in commands\n commands = parse_qsl(token.group(\"command\"), keep_blank_values=True)\n # placeholders only used in `if`\n if \"if\" in [x[0] for x in commands]:\n items = []\n for key, value in commands:\n if key == \"if\":\n # we have to rebuild from the parts we have\n condition = Condition(value)\n variable = condition.variable\n if variable in placeholders:\n variable = placeholders[variable]\n # negation via `!`\n not_ = \"!\" if not condition.default else \"\"\n condition_ = condition.condition or \"\"\n # if there is no condition then there is no\n # value\n if condition_:\n value_ = condition.value\n else:\n value_ = \"\"\n value = \"{}{}{}{}\".format(not_, variable, condition_, value_)\n if value:\n items.append(f\"{key}={value}\")\n else:\n items.append(key)\n\n # we cannot use urlencode because it will escape things\n # like `!`\n output.append(r\"\\?{} \".format(\"&\".join(items)))\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def _decode_block_string(self, block_string: str):\n\n arg_strings = block_string.split('_')\n args = {}\n for arg_string in arg_strings:\n splits = re.split(r'(\\d.*)', arg_string)\n if len(splits) >= 2:\n key, value = splits[:2]\n args[key] = value\n num_repeat = int(args['r'])\n block_args = {\n 'kernel_size': int(args['k']),\n 'stride': int(args['s']),\n 'expand_ratio': int(args['e']),\n 'in_channels': int(args['i']),\n 'out_channels': int(args['o']),\n 'se_ratio': float(args['se']) if 'se' in args else None,\n }\n return block_args, num_repeat","def parse_from_placeholder(string,pattern,encloser='%',matcher='(.+)'):\n pattern,fields = placeholder_to_regex(pattern,encloser,matcher)\n return parse_from_regex(string,pattern,fields)","def parse_blocks(self):\n if not self.options.blocks:\n return\n block_identifiers, block_aliases = [list(b) for b in zip(*self.options.blocks)]\n while block_identifiers:\n nodelist = self.parser.parse(block_identifiers)\n token = self.parser.next_token()\n current_identifier = block_identifiers.pop(0)\n current_alias = block_aliases.pop(0)\n while token.contents != current_identifier:\n current_identifier = block_identifiers.pop(0)\n self.blocks[block_aliases.pop(0)] = template.NodeList() \n self.blocks[current_alias] = nodelist\n assert len(self.blocks) == len(self.options.blocks), \"%s block parsing failed: %r => %r\" % (self.tagname, self.options.blocks, self.blocks)","def get_placeholders(self, format_string):\n placeholders = set()\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.add(token.group(\"key\"))\n elif token.group(\"command\"):\n # get any placeholders used in commands\n commands = dict(parse_qsl(token.group(\"command\")))\n # placeholders only used in `if`\n if_ = commands.get(\"if\")\n if if_:\n placeholders.add(Condition(if_).variable)\n return placeholders","def _slice_template(cls, in_str: str) -> Iterator[RawFileSlice]:\n fmt = Formatter()\n in_idx = 0\n for literal_text, field_name, format_spec, conversion in fmt.parse(in_str):\n if literal_text:\n escape_chars = cls._sorted_occurrence_tuples(\n cls._substring_occurrences(literal_text, [\"}\", \"{\"])\n )\n idx = 0\n while escape_chars:\n first_char = escape_chars.pop()\n # Is there a literal first?\n if first_char[1] > idx:\n yield RawFileSlice(\n literal_text[idx : first_char[1]], \"literal\", in_idx\n )\n in_idx += first_char[1] - idx\n # Add the escaped\n idx = first_char[1] + len(first_char[0])\n # We double them here to make the raw\n yield RawFileSlice(\n literal_text[first_char[1] : idx] * 2, \"escaped\", in_idx\n )\n # Will always be 2 in this case.\n # This is because ALL escape sequences in the python formatter\n # are two characters which reduce to one.\n in_idx += 2\n # Deal with last one (if present)\n if literal_text[idx:]:\n yield RawFileSlice(literal_text[idx:], \"literal\", in_idx)\n in_idx += len(literal_text) - idx\n # Deal with fields\n if field_name:\n constructed_token = \"{{{field_name}{conv}{spec}}}\".format(\n field_name=field_name,\n conv=f\"!{conversion}\" if conversion else \"\",\n spec=f\":{format_spec}\" if format_spec else \"\",\n )\n yield RawFileSlice(constructed_token, \"templated\", in_idx)\n in_idx += len(constructed_token)","def reformat(ctx):\n pass","def format(\n self,\n format_string,\n module=None,\n param_dict=None,\n force_composite=False,\n attr_getter=None,\n ):\n if param_dict is None:\n param_dict = {}\n\n # if the processed format string is not in the cache then create it.\n if format_string not in self.block_cache:\n self.build_block(format_string)\n\n first_block = self.block_cache[format_string]\n\n def get_parameter(key):\n \"\"\"\n function that finds and returns the value for a placeholder.\n \"\"\"\n if key in param_dict:\n # was a supplied parameter\n param = param_dict.get(key)\n elif module and hasattr(module, key):\n param = getattr(module, key)\n if hasattr(param, \"__call__\"):\n # we don't allow module methods\n raise Exception()\n elif attr_getter:\n # get value from attr_getter function\n try:\n param = attr_getter(key)\n except: # noqa e722\n raise Exception()\n else:\n raise Exception()\n if isinstance(param, Composite):\n if param.text():\n param = param.copy()\n else:\n param = \"\"\n return param\n\n # render our processed format\n valid, output = first_block.render(get_parameter, module)\n\n # clean things up a little\n if isinstance(output, list):\n output = Composite(output)\n if not output:\n if force_composite:\n output = Composite()\n else:\n output = \"\"\n\n return output","def parse(message):\n if not isinstance(message, str):\n raise TypeError(\"Block.from_network_format: expected message to be of type str\")\n if not message[0] == 'd':\n raise ValueError()\n block_number = int(message[1:7], 16)\n timestamp = int(message[7:15], 16)\n difficulty = int(message[15:17], 16)\n nonce = int(message[17:81], 16)\n previous_block_hash = message[81:145]\n merkle_root_hash = message[145:209]\n transaction_count = int(message[209:211], 16)\n message = message[211:]\n block_transactions = []\n for x in range(transaction_count):\n transaction_length = int(message[:5], 16)\n transaction = message[5:transaction_length + 5]\n block_transactions.append(transaction)\n message = message[transaction_length + 5:]\n str_block_transactions = \"\"\n for t in block_transactions:\n str_block_transactions += t + \",\"\n str_block_transactions = str_block_transactions[:-1]\n self_hash = calculate_hash(previous_block_hash, merkle_root_hash, nonce)\n block = (\n 0, block_number, timestamp, difficulty, nonce, previous_block_hash, merkle_root_hash,\n str_block_transactions,\n self_hash)\n return Block(block)","def parseBlock(self, text, prevLineData):\n return self.parser.parseBlock(text, prevLineData)","def block_parser(part, rgxin, rgxout, fmtin, fmtout):\r\n\r\n block = []\r\n lines = part.split('\\n')\r\n N = len(lines)\r\n i = 0\r\n decorator = None\r\n while 1:\r\n\r\n if i==N:\r\n # nothing left to parse -- the last line\r\n break\r\n\r\n line = lines[i]\r\n i += 1\r\n line_stripped = line.strip()\r\n if line_stripped.startswith('#'):\r\n block.append((COMMENT, line))\r\n continue\r\n\r\n if line_stripped.startswith('@'):\r\n # we're assuming at most one decorator -- may need to\r\n # rethink\r\n decorator = line_stripped\r\n continue\r\n\r\n # does this look like an input line?\r\n matchin = rgxin.match(line)\r\n if matchin:\r\n lineno, inputline = int(matchin.group(1)), matchin.group(2)\r\n\r\n # the ....: continuation string\r\n continuation = ' %s:'%''.join(['.']*(len(str(lineno))+2))\r\n Nc = len(continuation)\r\n # input lines can continue on for more than one line, if\r\n # we have a '\\' line continuation char or a function call\r\n # echo line 'print'. The input line can only be\r\n # terminated by the end of the block or an output line, so\r\n # we parse out the rest of the input line if it is\r\n # multiline as well as any echo text\r\n\r\n rest = []\r\n while i<N:\r\n\r\n # look ahead; if the next line is blank, or a comment, or\r\n # an output line, we're done\r\n\r\n nextline = lines[i]\r\n matchout = rgxout.match(nextline)\r\n #print \"nextline=%s, continuation=%s, starts=%s\"%(nextline, continuation, nextline.startswith(continuation))\r\n if matchout or nextline.startswith('#'):\r\n break\r\n elif nextline.startswith(continuation):\r\n inputline += '\\n' + nextline[Nc:]\r\n else:\r\n rest.append(nextline)\r\n i+= 1\r\n\r\n block.append((INPUT, (decorator, inputline, '\\n'.join(rest))))\r\n continue\r\n\r\n # if it looks like an output line grab all the text to the end\r\n # of the block\r\n matchout = rgxout.match(line)\r\n if matchout:\r\n lineno, output = int(matchout.group(1)), matchout.group(2)\r\n if i<N-1:\r\n output = '\\n'.join([output] + lines[i:])\r\n\r\n block.append((OUTPUT, output))\r\n break\r\n\r\n return block","def __init__(self, text, *contexts):\n\n self.context = {}\n for context in contexts:\n self.context.update(context)\n\n buffered = ''\n\n tokens = re.split(r\"(?s)({{.*?}})\", text)\n for token in tokens:\n if token.startswith(\"{{\"):\n # An expression to evaluate.\n buffered += self.context[token[2:-2].strip()]\n else:\n # Literal content, if not empty, output it.\n if token:\n buffered += token\n\n self.buffered = buffered","def update(blockstring):\n with BLOCK_LOCK:\n for block in blockstring.split('|'):\n name, values = parse(block)\n BLOCKS[name] = values","async def parse(self, raw: str) -> dict:","def structure_parse(source):\r\n return structure_grammar().parseString(source)","def _parse_kvfmt(self, fmtlist):\n t_fmt = self.__class__._T_FMT\n t_prefix = self.__class__._T_PREFIX\n parsed_list = []\n field_id = 1\n\n for entry in fmtlist:\n name = entry[0]\n fmt = entry[1]\n parsed_field = {}\n parsed_field['name'] = name\n if isinstance(fmt, str):\n ptr = 0\n m_prefix = t_prefix.match(fmt)\n if m_prefix:\n ptr += _get_length_of_match(m_prefix)\n parsed_field['prefix'] = m_prefix.group(1)\n # check for optional nested structure start (required if the field is also repeated)\n if m_prefix.group(2) and len(entry) > 2:\n parsed_field['field_id'] = field_id\n parsed_field['field_type'] = 'a'\n parsed_field['subcontent'] = self._parse_kvfmt(entry[2])\n field_id += 1\n parsed_list.append(parsed_field)\n continue\n elif m_prefix.group(2):\n raise BadFormatString('Nested field type used without specifying field format.')\n m_fmt = t_fmt.match(fmt[ptr:])\n if m_fmt:\n ptr += _get_length_of_match(m_fmt)\n resolved_fmt_char = None\n # fmt is an alias\n if m_fmt.group(2):\n resolved_fmt_char = m_fmt.group(2)\n parsed_field['field_type'] = self.__class__\\\n .FIELD_ALIAS[m_fmt.group(2)]\n # fmt is an actual field type\n elif m_fmt.group(1):\n resolved_fmt_char = m_fmt.group(1)\n parsed_field['field_type'] = m_fmt.group(1)\n parsed_field['field_id'] = field_id\n # only skip type (`x') is allowed for copying in key-value mode\n if m_fmt.group(3) and resolved_fmt_char == 'x':\n repeats = int(m_fmt.group(3))\n parsed_field['repeat'] = repeats\n field_id += repeats\n elif m_fmt.group(3):\n raise BadFormatString('Field copying is not allowed in key-value format list.')\n else:\n field_id += 1\n else:\n raise BadFormatString('Invalid type for field \"{0}\"'.format(name))\n if len(fmt) != ptr:\n self.logger.warning('Extra content found after the type string of %s.', name)\n else:\n # Hard-code the empty prefix because we don't support copying\n parsed_field['prefix'] = ''\n parsed_field['field_id'] = field_id\n parsed_field['field_type'] = 'a'\n parsed_field['subcontent'] = self._parse_kvfmt(fmt)\n field_id += 1\n parsed_list.append(parsed_field)\n return parsed_list","def htmlFormat(self, text):\n txt_blocks = self._parser_block(lex_block(text))\n\n #XXX: Maybe there is a better solution, but I doubt\n #The problem is nested escapestyles\n escape_d = {}\n escapes = re.compile('\\[escapestyle\\] \\s* (?P<inner>(.|\\s)*?) \\s* \\[/escapestyle\\]', re.VERBOSE)\n def rem(mo):\n h_code = hash(mo.group(0))\n escape_d[h_code] = mo.group('inner')\n return '(<!%s!>)' % h_code\n txt_blocks = escapes.sub(rem, txt_blocks)\n\n txt_style = parser_style(lex_style(txt_blocks))\n\n eess = re.compile('\\(<!(-?\\d+)!>\\)')\n def back(mo):\n val = int(mo.group(1))\n if escape_d.has_key(val):\n return escape_d[val]\n return mo.group(0)\n txt_style = eess.sub(back, txt_style)\n\n return txt_style","def parse_template(string):\n count = 0\n list1 = []\n for character in string:\n count = count + 1\n if character == \"{\":\n end = string.find(\"}\", count)\n s_strg = string[count:end]\n list1.append(s_strg)\n string = string.replace(s_strg, \"\", 1)\n count = count - len(s_strg)\n\n subs = tuple(list1)\n\n return(string, subs)\n print(subs)","def format_blocks(self):\n\n block_text = []\n for el, text in self._block_text.items():\n self.soft_break(el, text)\n content = ''.join(text)\n if content:\n block_text.append((content, self.additional_context + self.construct_selector(el)))\n return block_text","def parser(block):\n def unwrap(result):\n tupe, value = result\n if tupe & ParserResult.DONE:\n value, chunk, last = value\n return (ParserResult.from_done(value.value, chunk, last) if value.error is None else\n ParserResult.from_error(value.error))\n elif tupe & ParserResult.PARTIAL:\n return ParserResult.from_partial(Parser(lambda chunk, last: unwrap(value(chunk, last))))\n else:\n return result\n do_block = do(Parser)(block)\n return F.wraps(block)(\n lambda *args, **kwargs: Parser(\n lambda chunk, last: unwrap(do_block(*args, **kwargs)(chunk, last))))","def parse_template(self):\n for line in self.raw_template.split(\"\\n\"):\n line = line.strip()\n if line.startswith('#m3'):\n key, val = line[3:].strip().split('=', 1)\n key = key.strip()\n val = val.strip()\n self.variables[key] = val\n\n for fitem in self.finditem.finditer(self.raw_template):\n fgrp = fitem.groups()\n categ = fgrp[0]\n name = fgrp[1]\n rest_str = fgrp[2]\n rest = {} # type: dict\n for item in rest_str.split('|'):\n item = item.strip()\n if item:\n key, val = item.split('=')\n rest[key] = val\n\n self.data[name] = (categ, rest)","def _chunk(self, string):\n #~ a = r'\\**\\s*(?:a\\.?|\\(?a\\))' #SMA option dot now required\n a = r'\\**\\s*(?:a\\.|\\(?a\\))'\n b = r'\\**\\s*(?:b\\.|\\(?b\\))'\n c = r'\\**\\s*(?:c\\.|\\(?c\\))'\n d = r'\\**\\s*(?:d\\.|\\(?d\\))'\n e = r'\\**\\s*(?:e\\.|\\(?e\\))'\n l = r'\\s+.+?\\s+'\n # last option trucated here \\/\n regex = r\"({a}{line}{b}{line}{c}{line}(?:{d}{line})(?:{e}.*?)?)\\n?\".format(\n a=a, b=b, c=c, d=d, e=e, line=l, \n )\n p = re.compile(regex, re.IGNORECASE | re.DOTALL)\n\n self._tokens = p.split(string)","def parseString(self, s):\n\n t0 = time.time()\n lines = self.getline(s)\n lineno = 0\n for l in lines:\n lineno += 1\n logging.log(10, \"raw line %05d: %s\" % (lineno, l))\n if len(l) == 0 or l[0] == '#':\n continue\n \n if l.startswith('typedef'):\n lidx = self.parseTypedef(l, lines)\n lineno += lidx\n else:\n # Not a typedef -- see if the 1st token matches a known\n # structure name. If not, create a new variable.\n sidx = l.find(' ')\n if sidx > 0:\n name = l[0:sidx]\n struct = self.structs.get(name.upper(), None)\n if struct:\n struct.parseOne(l)\n else:\n v = YPFVar(l, debug=0)\n if v.name in self.vars:\n newValue = v.value\n oldValue = self.vars[v.name].value\n if newValue != oldValue:\n print(\"Variable %s is being defined with a new value, overwriting it. old=%s, new=%s\" \n % (v.name, oldValue, newValue))\n self.vars[v.name] = v","def parse_template(template):\n field_name = None\n field_value = []\n\n for line in template.strip().split('\\n') + ['end:']:\n if line.startswith('#'):\n continue\n match = RE_TEMPLATE_FIELD_LINE.match(line)\n if match:\n if field_name is not None:\n yield (field_name, '\\n'.join(field_value).strip())\n elif len(field_value) > 0:\n logging.warning('Ignoring lines: %r', field_value)\n\n field_name = match.group(1)\n field_value = [match.group(2)]\n else:\n field_value.append(line)","def reformat(refstr, listed=False):\n \n formatted = ' '.join(refstr.split()).replace(r'\\newblock', '\\n\\\\newblock').splitlines()\n if listed:\n return formatted\n else:\n return '\\n'.join(formatted)","def _split_by_block(self, path=None,category='meminfo'):\n \n with open(path, \"r\") as f: \n text = f.read()\n \n lst = re.split('zzz', text, flags=re.DOTALL) # to list based on time\n lst = [x for x in lst if x] # remove empty strings\n \"\"\"\n Python 2.x\n lst = map(lambda v: re.split('(\\s\\W{1,}\\w{3}\\s\\w{3}\\s\\w{2,3}\\s\\d{2}:\\d{2}:\\d{2}\\s\\w{3}\\s\\d{4})', v), lst)\n \"\"\"\n lst = [re.split('(\\s\\W{1,}\\w{3}\\s\\w{3}\\s\\w{2,3}\\s\\d{2}:\\d{2}:\\d{2}\\s\\w{3}\\s\\d{4})', v) for v in lst]\n block_dict = []\n for v in lst:\n timestamp=v[1]\n value=v[2]\n _d = [{'timestamp':timestamp, \n 'category': category, \n 'sub_category': '',\n 'key': 'raw_block',\n 'value': value}]\n block_dict.extend(_d)\n \n return block_dict","def reformat_block(specline, values):\n data = reformat_spec_line(specline)\n desc = '\\n'.join(values)\n data.append(desc)\n return data","def build_block_parser(md_instance, **kwargs):\r\n parser = BlockParser(md_instance)\r\n parser.blockprocessors['empty'] = EmptyBlockProcessor(parser)\r\n parser.blockprocessors['indent'] = ListIndentProcessor(parser)\r\n parser.blockprocessors['code'] = CodeBlockProcessor(parser)\r\n parser.blockprocessors['hashheader'] = HashHeaderProcessor(parser)\r\n parser.blockprocessors['setextheader'] = SetextHeaderProcessor(parser)\r\n parser.blockprocessors['hr'] = HRProcessor(parser)\r\n parser.blockprocessors['olist'] = OListProcessor(parser)\r\n parser.blockprocessors['ulist'] = UListProcessor(parser)\r\n parser.blockprocessors['quote'] = BlockQuoteProcessor(parser)\r\n parser.blockprocessors['paragraph'] = ParagraphProcessor(parser)\r\n return parser","def parse(intLanguageName, content, formatDetails, threadstop):\r\n\r\n if len(content) == 0:\r\n return buildSyntaxNode([], 0, \"text\")\r\n\r\n if formatDetails.noFormat:\r\n return buildSyntaxNode([buildSyntaxNode(content, 0, \"plainText\")],\r\n 0, \"text\")\r\n\r\n baseDict = _buildBaseDict(formatDetails=formatDetails)\r\n\r\n## _prof.start()\r\n try:\r\n print content\r\n print baseDict\r\n t = text.parseString(content, parseAll=True, baseDict=baseDict,\r\n threadstop=threadstop)\r\n print t\r\n t = buildSyntaxNode(t, 0, \"text\")\r\n print t\r\n\r\n finally:\r\n## _prof.stop()\r\n pass\r\n\r\n return t","def __ParseBlock(self, ast):\n for node in ast:\n node_name = node[0]\n node_value = node[1]\n if node_name == 'statement':\n self.__ParseStatement(node_value)\n else:\n logging.info('Unknown AST node in message block: %s' % (node_name))","def makeBlock(tag):\n return {\"t\":\"RawBlock\",\"c\":[\"html\",tag]}","def read_fmt(bib_name, bib_file):\n cache_name, formatted_cache_name = _cache_name(bib_name, bib_file)\n\n try:\n meta_data, formatted_entries = cache.read_global(formatted_cache_name)\n except:\n raise cache.CacheMiss()\n\n # raise a cache miss if the modification took place after the caching\n modified_time = os.path.getmtime(bib_file)\n if modified_time > meta_data[\"cache_time\"]:\n raise cache.CacheMiss()\n\n # validate the version and format strings are still valid\n if (meta_data[\"version\"] != _VERSION or\n any(meta_data[s] != get_setting(\"cite_\" + s)\n for s in [\"panel_format\", \"autocomplete_format\"])):\n print(\"Formatting string has changed, updating cache...\")\n # read the base information from the unformatted cache\n current_time, bib_entries = cache.read_global(cache_name)\n # format and cache the entries\n formatted_entries = _create_formatted_entries(formatted_cache_name,\n bib_entries,\n current_time)\n\n return formatted_entries","def _parse_data(self):\n current_block = []\n current_section = \"docstring\"\n\n # if we get a line that starts with #, this is a new comment or\n # part of a block comment. Otherwise, it means the current block\n # comment has ended.\n\n for this in self.data:\n # Beginning of a new section at top level\n if self.regex_section.findall(this):\n name = self.regex_section.findall(this)[0]\n current_section = name.strip(\":\")\n self.sections[current_section] = \"\".join(current_block)\n current_block = []\n current_section = None\n elif this.startswith(\"#\"): # a comment at top level\n current_block.append(this)\n elif this.strip() == \"\": # an empty line\n # this was the main comment, or an isolated comment\n current_block = []\n else: # a non-empty line to skip\n current_block = []\n\n for key in self._get_expected_sections():\n if key not in self.sections.keys():\n logger.warning(\"section %s not dealt by the parsing function\" % key)","def tokens(self, format_string):\n if format_string not in self.format_string_cache:\n tokens = list(re.finditer(self.reg_ex, format_string))\n self.format_string_cache[format_string] = tokens\n return self.format_string_cache[format_string]","def parse(source):\n\n def blockify(source):\n\n \"\"\"This is the first step, where the source is broken into paragraphs,\n based on blank lines in the source. The output is a list of strings.\n Each string is a paragraph. Newlines (with any trailing whitespace)\n inside paragraphs are converted to single spaces.\"\"\"\n\n paragraphs = [\"\"]\n for line in source.strip().split(\"\\n\"):\n line = line.strip()\n if line: paragraphs[-1] += line + \" \"\n elif paragraphs[-1]: paragraphs.append(\"\")\n\n return paragraphs\n\n def subparse(block):\n\n \"\"\"This function parses a single paragraph of source, as returned by\n the `blockify` function. This finds the individual verses within the\n given paragraph. It returns an AST for the paragraph, as previously\n described.\n\n TODO: Validate the input based on the AST.\n \"\"\"\n\n verses = []\n context = None\n for char in block:\n\n if char == \"[\":\n if verses: verses[-1][\"quran\"] = verses[-1][\"quran\"].strip()\n verses.append({\"surah\": \"\", \"verse\": \"\", \"quran\": \"\"})\n context = \"surah\"\n elif char == \":\" and context == \"surah\":\n verses[-1][\"surah\"] = int(verses[-1][\"surah\"])\n context = \"verse\"\n elif char == \"]\":\n verses[-1][\"verse\"] = int(verses[-1][\"verse\"])\n context = \"quran\"\n else: verses[-1][context] += char\n\n verses[-1][\"quran\"] = verses[-1][\"quran\"].strip()\n return verses\n\n return [ subparse(block) for block in blockify(source) ]","def _parse(self, content):\n os.environ['ASTER_VERSION_DIR'] = self.dirn\n cfg = {}\n self._content = content\n for l in split_endlines(self._content):\n if not re.search('^[ ]*#', l):\n try:\n typ, nam, ver, val = l.split('|')\n #print '========>', typ, '//', nam, '//', ver, '//', val\n typ = re.sub('^[ ]*', '', re.sub('[ ]*$', '', typ)).strip()\n val = re.sub('^[ ]*', '', re.sub('[ ]*$', '', val)).strip()\n if val != '':\n val = osp.expandvars(val)\n if cfg.has_key(typ):\n cfg[typ].append(val)\n else:\n cfg[typ] = [val]\n except ValueError:\n pass\n return cfg","def highlightBlock(self, text):\n for format_, expression in self.rules:\n # get first match\n index = expression.indexIn(text)\n while index >= 0:\n length = expression.matchedLength()\n self.setFormat(index, length, format_)\n # jump to next match\n index = expression.indexIn(text, index + length)\n self.setCurrentBlockState(0)","def parse_format(var_sample):\n # ugh\n ret = []\n # Parsing format information\n # Need to see what all these could be...\n if None in var_sample[\"GT\"]:\n ret.append(3)\n elif var_sample[\"GT\"] == (0, 0):\n ret.append(0)\n elif var_sample[\"GT\"] == (0, 1):\n ret.append(1)\n elif var_sample[\"GT\"] == (1, 1):\n ret.append(2)\n \n ret.extend([var_sample[\"GQ\"] if var_sample[\"GQ\"] is not None else 0,\n var_sample[\"OV\"],\n var_sample[\"DP\"], # be careful these aren't '.'\n #split where _r is ref-allele and _a is alt-allele\n var_sample[\"AD\"][0],\n var_sample[\"AD\"][1],\n var_sample[\"PDP\"],\n var_sample[\"PAD\"][0],\n var_sample[\"PAD\"][1],\n var_sample[\"US\"][0],\n var_sample[\"US\"][1],\n var_sample[\"DS\"][0],\n var_sample[\"DS\"][1],\n var_sample[\"UC\"][0],\n var_sample[\"UC\"][1],\n var_sample[\"DC\"][0],\n var_sample[\"DC\"][1],\n var_sample[\"UDC\"][0],\n var_sample[\"UDC\"][1],\n var_sample[\"UCC\"][0],\n var_sample[\"UCC\"][1],\n var_sample[\"DDC\"][0],\n var_sample[\"DDC\"][1],\n var_sample[\"DCC\"][0],\n var_sample[\"DCC\"][1],\n var_sample[\"UMO\"][0],\n var_sample[\"UMO\"][1],\n var_sample[\"DMO\"][0],\n var_sample[\"DMO\"][1],\n var_sample[\"UXO\"][0],\n var_sample[\"UXO\"][1],\n var_sample[\"DXO\"][0],\n var_sample[\"DXO\"][1],\n var_sample[\"NR\"][0],\n var_sample[\"NR\"][1],\n var_sample[\"MO\"][0],\n var_sample[\"MO\"][1],\n var_sample[\"XO\"][0],\n var_sample[\"XO\"][1],\n var_sample[\"XC\"][0],\n var_sample[\"XC\"][1],\n var_sample[\"AC\"][0],\n var_sample[\"AC\"][1],\n var_sample[\"MC\"][0],\n var_sample[\"MC\"][1],\n var_sample[\"EC\"][0],\n var_sample[\"EC\"][1],\n var_sample[\"PL\"][0] if var_sample[\"PL\"][0] is not None else 0,\n var_sample[\"PL\"][1] if var_sample[\"PL\"][0] is not None else 0,\n var_sample[\"PL\"][2] if var_sample[\"PL\"][0] is not None else 0])\n return ret\n #END","def parse(cls, source):\n lines = list(cls._strip_lines(source.splitlines()))\n offset = 0\n blocks = {}\n while offset < len(lines):\n # Scan until we find a block.\n while offset < len(lines):\n header_match = re.match(r\"---+ (.*) ---+\", lines[offset])\n offset += 1\n if header_match:\n header = header_match.group(1)\n break\n config = {}\n while offset < len(lines):\n config_match = re.match(r\"^%\\s*([\\w_]+)\\s*:(.*)$\", lines[offset])\n if not config_match:\n break\n config[config_match.group(1).strip()] = config_match.group(2).strip()\n offset += 1\n block_lines = []\n while offset < len(lines) and (re.match(r\"---+ (.*) ---+\", lines[offset]) == None):\n block_lines.append(lines[offset])\n offset += 1\n if not header in blocks:\n blocks[header] = []\n blocks[header].append(SpecTestBlock.parse(header, config, block_lines))\n return ParsedSpecTest(blocks)","def highlightBlock(self, text):\n # Do other syntax formatting\n for expression, nth, format in self.rules:\n index = expression.indexIn(text, 0)\n format = self.styles[format]\n\n while index >= 0:\n # We actually want the index of the nth match\n index = expression.pos(nth)\n length = len(expression.cap(nth))\n self.setFormat(index, length, format)\n index = expression.indexIn(text, index + length)\n\n self.setCurrentBlockState(0)\n\n # Do multi-line strings\n in_multiline = self.match_multiline(text, *self.tri_single)\n if not in_multiline:\n in_multiline = self.match_multiline(text, *self.tri_double)","def stringToBlock(strBlock):\r\n blocksplit = strBlock.split(';')\r\n block = Blockchain(int(blocksplit[0]), blocksplit[1], int(blocksplit[2]), int(blocksplit[3]) ,blocksplit[4])\r\n return block","def highlightBlock(self, string):\n prev_data = self.currentBlock().previous().userData()\n if prev_data is not None:\n self._lexer._saved_state_stack = prev_data.syntax_stack\n elif hasattr(self._lexer, '_saved_state_stack'):\n del self._lexer._saved_state_stack\n\n # Lex the text using Pygments\n index = 0\n for token, text in self._lexer.get_tokens(string):\n length = len(text)\n self.setFormat(index, length, self._get_format(token))\n index += length\n\n if hasattr(self._lexer, '_saved_state_stack'):\n data = PygmentsBlockUserData(\n syntax_stack=self._lexer._saved_state_stack)\n self.currentBlock().setUserData(data)\n # Clean up for the next go-round.\n del self._lexer._saved_state_stack","def _hash_html_blocks(self, text, raw=False):\r\n if '<' not in text:\r\n return text\r\n\r\n # Pass `raw` value into our calls to self._hash_html_block_sub.\r\n hash_html_block_sub = _curry(self._hash_html_block_sub, raw=raw)\r\n\r\n # First, look for nested blocks, e.g.:\r\n # <div>\r\n # <div>\r\n # tags for inner block must be indented.\r\n # </div>\r\n # </div>\r\n #\r\n # The outermost tags must start at the left margin for this to match, and\r\n # the inner nested divs must be indented.\r\n # We need to do this before the next, more liberal match, because the next\r\n # match will start at the first `<div>` and stop at the first `</div>`.\r\n text = self._strict_tag_block_re.sub(hash_html_block_sub, text)\r\n\r\n # Now match more liberally, simply from `\\n<tag>` to `</tag>\\n`\r\n text = self._liberal_tag_block_re.sub(hash_html_block_sub, text)\r\n\r\n # Special case just for <hr />. It was easier to make a special\r\n # case than to make the other regex more complicated.\r\n if \"<hr\" in text:\r\n _hr_tag_re = _hr_tag_re_from_tab_width(self.tab_width)\r\n text = _hr_tag_re.sub(hash_html_block_sub, text)\r\n\r\n # Special case for standalone HTML comments:\r\n if \"<!--\" in text:\r\n start = 0\r\n while True:\r\n # Delimiters for next comment block.\r\n try:\r\n start_idx = text.index(\"<!--\", start)\r\n except ValueError:\r\n break\r\n try:\r\n end_idx = text.index(\"-->\", start_idx) + 3\r\n except ValueError:\r\n break\r\n\r\n # Start position for next comment block search.\r\n start = end_idx\r\n\r\n # Validate whitespace before comment.\r\n if start_idx:\r\n # - Up to `tab_width - 1` spaces before start_idx.\r\n for i in range(self.tab_width - 1):\r\n if text[start_idx - 1] != ' ':\r\n break\r\n start_idx -= 1\r\n if start_idx == 0:\r\n break\r\n # - Must be preceded by 2 newlines or hit the start of\r\n # the document.\r\n if start_idx == 0:\r\n pass\r\n elif start_idx == 1 and text[0] == '\\n':\r\n start_idx = 0 # to match minute detail of Markdown.pl regex\r\n elif text[start_idx-2:start_idx] == '\\n\\n':\r\n pass\r\n else:\r\n break\r\n\r\n # Validate whitespace after comment.\r\n # - Any number of spaces and tabs.\r\n while end_idx < len(text):\r\n if text[end_idx] not in ' \\t':\r\n break\r\n end_idx += 1\r\n # - Must be following by 2 newlines or hit end of text.\r\n if text[end_idx:end_idx+2] not in ('', '\\n', '\\n\\n'):\r\n continue\r\n\r\n # Escape and hash (must match `_hash_html_block_sub`).\r\n html = text[start_idx:end_idx]\r\n if raw and self.safe_mode:\r\n html = self._sanitize_html(html)\r\n key = _hash_text(html)\r\n self.html_blocks[key] = html\r\n text = text[:start_idx] + \"\\n\\n\" + key + \"\\n\\n\" + text[end_idx:]\r\n\r\n if \"xml\" in self.extras:\r\n # Treat XML processing instructions and namespaced one-liner\r\n # tags as if they were block HTML tags. E.g., if standalone\r\n # (i.e. are their own paragraph), the following do not get\r\n # wrapped in a <p> tag:\r\n # <?foo bar?>\r\n #\r\n # <xi:include xmlns:xi=\"http://www.w3.org/2001/XInclude\" href=\"chapter_1.md\"/>\r\n _xml_oneliner_re = _xml_oneliner_re_from_tab_width(self.tab_width)\r\n text = _xml_oneliner_re.sub(hash_html_block_sub, text)\r\n\r\n return text","def parsePercentExpression(literal, format):\n\tmat = _getREForPercentExpression(format).match(literal)\n\tif not mat:\n\t\traise ValueError(\"'%s' cannot be parsed using format '%s'\"%(\n\t\t\tliteral, format))\n\treturn mat.groupdict()","def _decode_block_string(block_string):\n assert isinstance(block_string, str)\n\n ops = block_string.split('_')\n options = {}\n for op in ops:\n splits = re.split(r'(\\d.*)', op)\n if len(splits) >= 2:\n key, value = splits[:2]\n options[key] = value\n\n # Check stride\n assert (('s' in options and len(options['s']) == 1) or\n (len(options['s']) == 2 and options['s'][0] == options['s'][1]))\n\n return BlockArgs(\n kernel_size=int(options['k']),\n num_repeat=int(options['r']),\n input_filters=int(options['i']),\n output_filters=int(options['o']),\n expand_ratio=int(options['e']),\n id_skip=('noskip' not in block_string),\n se_ratio=float(options['se']) if 'se' in options else None,\n stride=[int(options['s'][0])])","def _decode_block_string(block_string):\n assert isinstance(block_string, str)\n\n ops = block_string.split('_')\n options = {}\n for op in ops:\n splits = re.split(r'(\\d.*)', op)\n if len(splits) >= 2:\n key, value = splits[:2]\n options[key] = value\n\n # Check stride\n assert (('s' in options and len(options['s']) == 1) or\n (len(options['s']) == 2 and options['s'][0] == options['s'][1]))\n\n return BlockArgs(\n kernel_size=int(options['k']),\n num_repeat=int(options['r']),\n input_filters=int(options['i']),\n output_filters=int(options['o']),\n expand_ratio=int(options['e']),\n id_skip=('noskip' not in block_string),\n se_ratio=float(options['se']) if 'se' in options else None,\n stride=[int(options['s'][0])])","def structParser(lines):\n blc = 0 #blank line counter\n bc = 0 #block counter\n struct = []\n record = False\n for line in lines:\n if len(line) == 1:\n blc +=1\n record = False\n if blc == 2:\n blc = 0\n bc +=1\n record = True\n if record and bc < 3:\n struct.append(line)\n\n yield struct","def parse(s):\n return s","def split_blocks(strings):\n blocks = [StringList()]\n for item in strings.xitems(): # (source, offset, value)\n if item[2].strip():\n blocks[-1].append(item[2], source=item[0], offset=item[1])\n elif len(blocks[-1]):\n blocks.append(StringList())\n # remove the last block if empty\n if len(blocks[-1]) == 0:\n del blocks[-1]\n return blocks","def __parse_blocks_pass(self):\n\n self.stack = [DocumentStackToken()]\n\n self.tokenized_document = []\n token_to_use = self.source_provider.get_next_line()\n did_start_close = False\n did_started_close = False\n requeue = []\n ignore_link_definition_start = False\n POGGER.debug(\"---$---\", token_to_use)\n POGGER.debug(\"---\")\n self.__parse_properties.pragma_lines = {}\n line_number = 1\n try:\n (\n token_to_use,\n line_number,\n requeue,\n ) = self.__process_front_matter_header_if_present(\n token_to_use, line_number, requeue\n )\n did_start_close = token_to_use is None\n keep_on_going = True\n while keep_on_going:\n POGGER.debug(\"next-line>>$\", token_to_use)\n POGGER.debug(\"stack>>$\", self.stack)\n POGGER.debug(\"current_block>>$\", self.stack[-1])\n POGGER.debug(\"line_number>>$\", line_number)\n POGGER.debug(\"---\")\n\n position_marker = PositionMarker(line_number, 0, token_to_use)\n parser_state = ParserState(\n self.stack,\n self.tokenized_document,\n TokenizedMarkdown.__close_open_blocks,\n self.__handle_blank_line,\n )\n if did_start_close:\n POGGER.debug(\"\\n\\ncleanup\")\n\n was_link_definition_started_before_close = self.stack[\n -1\n ].was_link_definition_started\n\n did_started_close = True\n (\n tokens_from_line,\n requeue_line_info,\n ) = TokenizedMarkdown.__close_open_blocks(\n parser_state,\n self.tokenized_document,\n include_block_quotes=True,\n include_lists=True,\n caller_can_handle_requeue=True,\n was_forced=True,\n )\n if tokens_from_line and not self.tokenized_document:\n self.tokenized_document.extend(tokens_from_line)\n\n if not (requeue_line_info and requeue_line_info.lines_to_requeue):\n keep_on_going = False\n else:\n assert was_link_definition_started_before_close\n assert not requeue_line_info.lines_to_requeue[0]\n\n del requeue_line_info.lines_to_requeue[0]\n line_number -= 1\n\n did_start_close = False\n tokens_from_line = None\n else:\n POGGER.debug(\">>>>$\", self.tokenized_document)\n\n if not token_to_use or not token_to_use.strip():\n POGGER.debug(\"call __parse_blocks_pass>>handle_blank_line\")\n (\n tokens_from_line,\n requeue_line_info,\n ) = self.__handle_blank_line(\n parser_state,\n token_to_use,\n from_main_transform=True,\n position_marker=position_marker,\n )\n else:\n POGGER.debug(\"\\n\\nnormal lines\")\n (\n tokens_from_line,\n _,\n _,\n requeue_line_info,\n _,\n ) = ContainerBlockProcessor.parse_line_for_container_blocks(\n parser_state,\n position_marker,\n ignore_link_definition_start,\n self.__parse_properties,\n None,\n )\n\n POGGER.debug(\"<<<<$\", self.tokenized_document)\n\n if keep_on_going:\n line_number, ignore_link_definition_start = TokenizedMarkdown.__xx(\n line_number, requeue_line_info, requeue\n )\n\n POGGER.debug(\n \"---\\nbefore>>$\",\n self.tokenized_document,\n )\n POGGER.debug(\"before>>$\", tokens_from_line)\n if tokens_from_line:\n self.tokenized_document.extend(tokens_from_line)\n POGGER.debug(\n \"after>>$\",\n self.tokenized_document,\n )\n if requeue:\n POGGER.debug(\"requeue>>$\", requeue)\n POGGER.debug(\"---\")\n\n (\n token_to_use,\n did_start_close,\n did_started_close,\n ) = self.__determine_next_token_process(\n requeue, did_start_close, did_started_close\n )\n except AssertionError as this_exception:\n error_message = f\"A project assertion failed on line {line_number} of the current document.\"\n raise BadTokenizationError(error_message) from this_exception\n\n if self.__parse_properties.pragma_lines:\n self.tokenized_document.append(\n PragmaToken(self.__parse_properties.pragma_lines)\n )\n return self.tokenized_document","def parse_block(lines):\n term = {\"alt_id\": [], \"relationship\": []}\n splitkv = re.compile(r\"(^[a-zA-Z_]+): (.+)\")\n for line in lines:\n m = re.search(splitkv, line)\n # assert m, f\"unexpected line: {line}\"\n key = m.group(1)\n value = m.group(2)\n if key in [\"id\", \"name\", \"namespace\", \"is_obsolete\"]:\n term[key] = value\n elif key == \"alt_id\":\n term[\"alt_id\"].append(value)\n elif key == \"is_a\":\n goid = value.split(\"!\")[0].strip()\n term[\"relationship\"].append({\"type\": \"is_a\", \"id\": goid})\n elif key == \"relationship\":\n typedef, goid = value.split(\"!\")[0].strip().split(\" \")\n term[\"relationship\"].append({\"type\": typedef, \"id\": goid})\n return term","def parseChunk(self, parent, text):\r\n self.parseBlocks(parent, text.split('\\n\\n'))","def __new__(cls, format):\n self = super(SF_Pattern, cls).__new__(cls)\n\n if isinstance(format, bytes):\n uni_str = format.decode('ISO-8859-1') # decode to unicode\n trans_str = translate(uni_str) # translate only works with unicode\n re_fmt = trans_str.encode('ISO-8859-1') # encode back to bytes\n self._spec = _gbspec\n else:\n re_fmt = translate(format)\n self._spec = _gspec\n\n self._format = format\n self._re = cre = re.compile(re_fmt)\n\n if cre.groupindex and len(cre.groupindex) != cre.groups:\n raise RuntimeError('cannot mix mapped and unmapped specifiers')\n elif not cre.groupindex:\n self._retfunc = self._return_tuple\n self._type = tuple\n else:\n self._retfunc = self._return_dict\n self._type = dict\n\n self._casts = self._get_types()\n\n return self","def _decode_block_str(block_str, depth_multiplier=1.0):\n assert isinstance(block_str, str)\n ops = block_str.split('_')\n block_type = ops[0] # take the block type off the front\n ops = ops[1:]\n options = {}\n noskip = False\n for op in ops:\n # string options being checked on individual basis, combine if they grow\n if op == 'noskip':\n noskip = True\n elif op.startswith('n'):\n # activation fn\n key = op[0]\n v = op[1:]\n if v == 're':\n value = F.relu\n elif v == 'r6':\n value = F.relu6\n elif v == 'hs':\n value = hard_swish\n elif v == 'sw':\n value = swish\n else:\n continue\n options[key] = value\n else:\n # all numeric options\n splits = re.split(r'(\\d.*)', op)\n if len(splits) >= 2:\n key, value = splits[:2]\n options[key] = value\n\n # if act_fn is None, the model default (passed to model init) will be used\n act_fn = options['n'] if 'n' in options else None\n exp_kernel_size = _parse_ksize(options['a']) if 'a' in options else 1\n pw_kernel_size = _parse_ksize(options['p']) if 'p' in options else 1\n fake_in_chs = int(options['fc']) if 'fc' in options else 0 # FIXME hack to deal with in_chs issue in TPU def\n\n num_repeat = int(options['r'])\n # each type of block has different valid arguments, fill accordingly\n if block_type == 'ir':\n block_args = dict(\n block_type=block_type,\n dw_kernel_size=_parse_ksize(options['k']),\n exp_kernel_size=exp_kernel_size,\n pw_kernel_size=pw_kernel_size,\n out_chs=int(options['c']),\n exp_ratio=float(options['e']),\n se_ratio=float(options['se']) if 'se' in options else None,\n stride=int(options['s']),\n act_fn=act_fn,\n noskip=noskip,\n )\n elif block_type == 'ds' or block_type == 'dsa':\n block_args = dict(\n block_type=block_type,\n dw_kernel_size=_parse_ksize(options['k']),\n pw_kernel_size=pw_kernel_size,\n out_chs=int(options['c']),\n se_ratio=float(options['se']) if 'se' in options else None,\n stride=int(options['s']),\n act_fn=act_fn,\n pw_act=block_type == 'dsa',\n noskip=block_type == 'dsa' or noskip,\n )\n elif block_type == 'er':\n block_args = dict(\n block_type=block_type,\n exp_kernel_size=_parse_ksize(options['k']),\n pw_kernel_size=pw_kernel_size,\n out_chs=int(options['c']),\n exp_ratio=float(options['e']),\n fake_in_chs=fake_in_chs,\n se_ratio=float(options['se']) if 'se' in options else None,\n stride=int(options['s']),\n act_fn=act_fn,\n noskip=noskip,\n )\n elif block_type == 'cn':\n block_args = dict(\n block_type=block_type,\n kernel_size=int(options['k']),\n out_chs=int(options['c']),\n stride=int(options['s']),\n act_fn=act_fn,\n )\n else:\n assert False, 'Unknown block type (%s)' % block_type\n\n return block_args, num_repeat","def find_time(string, format):\n re_format = format\n for key, value in six.iteritems(REGEX):\n re_format = re_format.replace(key, value)\n matches = re.finditer(re_format, string)\n for match in matches:\n try:\n matchstr = string[slice(*match.span())]\n dt = datetime.strptime(matchstr, format)\n except ValueError:\n continue\n else:\n yield dt","def change_format_var_parser(text, tracker):\n param_names = format_var_parser(text)\n param_vars = {}\n for param_name in param_names:\n try:\n param_vars[param_name] = tracker.get_slot(param_name)\n except Exception as e:\n PYTHON_LOGGER.error(\"Error to get var name {}: {}\".format(param_name, e))\n return text.format(**param_vars)","def _consume(self, block: str) -> None:\n self.buffer = []\n self.level = 0\n last_char = \"START\"\n for ch in char_iter(block):\n if ch in \"\\n\\r\":\n self._check_body_level()\n self.line_number += 1\n if self.in_comment:\n if ch == \"\\n\":\n self.in_comment = False\n elif ch in \" \\n\\t\\r\" and last_char in \" \\n\\t\\r\":\n pass\n elif ch == \"#\" and not self.in_value and not self.in_var_ref:\n self.in_comment = True\n elif not self.in_value and ch == \"(\":\n self._open_bracket(ch)\n elif not self.in_value and ch == \")\":\n self._close_bracket(ch)\n elif ch == '\"':\n self.in_value = not self.in_value\n self.buffer.append(ch)\n elif self.level == 1:\n if (\n ch == \"r\"\n and last_char == \"o\"\n and \"\".join(self.buffer).strip() == \"o\"\n ):\n self.n_ors += 1\n self.buffer = []\n elif ch == \"$\":\n self.param_buffer = self._parse_operator()\n self.in_var_ref = True\n self.buffer = [ch]\n elif self.in_var_ref and ch in \" \\n\\r\\t\":\n self._parse_var()\n elif ch == \">\" and last_char == \"-\":\n self._parse_label()\n else:\n self.buffer.append(ch)\n else:\n self.buffer.append(ch)\n last_char = ch\n if self.opened:\n raise ValueError(\n f\"Unmatched opening bracket \" f\"at line {self.line_number}\"\n )\n if self.n_ors and not self.is_union:\n raise ValueError(f'Missing \"or\" operator ' f\"at line {self.line_number}\")","def subparse(block):\n\n verses = []\n context = None\n for char in block:\n\n if char == \"[\":\n if verses: verses[-1][\"quran\"] = verses[-1][\"quran\"].strip()\n verses.append({\"surah\": \"\", \"verse\": \"\", \"quran\": \"\"})\n context = \"surah\"\n elif char == \":\" and context == \"surah\":\n verses[-1][\"surah\"] = int(verses[-1][\"surah\"])\n context = \"verse\"\n elif char == \"]\":\n verses[-1][\"verse\"] = int(verses[-1][\"verse\"])\n context = \"quran\"\n else: verses[-1][context] += char\n\n verses[-1][\"quran\"] = verses[-1][\"quran\"].strip()\n return verses","def __parse_next(self, buffer):\n\t\ttoken = buffer.read(1)\n\t\t\n\t\t_tell = buffer.tell()\n\t\t# Is it an operator?\n\t\tif token == \"/\":\n\t\t\tnum, var = self.__parse_operator(buffer)\n\t\t\tif num is None:\n\t\t\t\tbuffer.seek(_tell - 1)\n\t\t\t\treturn \"$\"\n\t\t\t\n\t\t\tif isinstance(var, str):\n\t\t\t\treturn var\n\t\t\t\n\t\t\tret = (var / num)\n\t\t\tif isinstance(ret, Range):\n\t\t\t\tret = ret.min # XXX is this right?\n\t\t\tif int(ret) != ret:\n\t\t\t\treturn \"%.1f\" % ret\n\t\t\treturn str(int(ret))\n\t\t\n\t\tif token == \"*\":\n\t\t\tnum, var = self.__parse_operator(buffer)\n\t\t\tret = var * num\n\t\t\tif isinstance(ret, float):\n\t\t\t\tret = int(round(ret))\n\t\t\treturn str(ret)\n\t\t\n\t\t# Is it a conditional?\n\t\tif token == \"?\":\n\t\t\tbuffer.seek(-1, SEEK_CUR)\n\t\t\tblocks = self.__parse_conditional(buffer)\n\t\t\t\n\t\t\t# Prepare the condition cache\n\t\t\t# This shouldn't be done here, but anyway...\n\t\t\tfor condition, value in blocks:\n\t\t\t\tcondition.evaluate({})\n\t\t\t\tself.conditions.extend(condition.identifiers)\n\t\t\t\n\t\t\t# blocks is a list of (condition, value) tuples\n\t\t\t# We evaluate the paperdoll against each of them\n\t\t\t# and return when we get a hit\n\t\t\t\n\t\t\tfor condition, value in blocks:\n\t\t\t\tif condition.evaluate(self.paperdoll):\n\t\t\t\t\treturn value\n\t\t\t\n\t\t\treturn\n\t\t\n\t\tif token == \"<\":\n\t\t\tbuffer.seek(-1, SEEK_CUR)\n\t\t\tidentifier = self.__read_block(buffer, startchr=\"<\", endchr=\">\")\n\t\t\ttry:\n\t\t\t\tvalue = self.get_variable(identifier)\n\t\t\t\treturn SpellString(value).format(self.obj, proxy=self.proxy)\n\t\t\texcept VariableNotFound:\n\t\t\t\treturn \"<%s>\" % (identifier)\n\t\t\n\t\tif token == \"{\":\n\t\t\tbuffer.seek(-1, SEEK_CUR)\n\t\t\tblock = self.__read_block(buffer, startchr=\"{\", endchr=\"}\")\n\t\t\t\n\t\t\t# Attempt to read decimals formatting\n\t\t\tdecimals = 0\n\t\t\ttoken = buffer.read(1)\n\t\t\tif token == \".\":\n\t\t\t\tdecimals = self.__read_number(buffer)\n\t\t\telif token:\n\t\t\t\t# Step one char back, only if we are not at the end\n\t\t\t\tbuffer.seek(-1, SEEK_CUR)\n\t\t\t\n\t\t\tblock = SpellString(block).format(self.obj, proxy=self.proxy, braced=True)\n\t\t\ttry: # FIXME\n\t\t\t\tblock = eval(block)\n\t\t\t\tif decimals:\n\t\t\t\t\tblock = round(block, decimals)\n\t\t\t\treturn \"%g\" % (block)\n\t\t\texcept Exception:\n\t\t\t\treturn \"[%s]\" % (block)\n\t\t\n\t\t# At this point, we need to check for functions and variables\n\t\t# but only if we don't already have a digit\n\t\tif not token.isdigit():\n\t\t\t_tell = buffer.tell()\n\t\t\tbuffer.seek(-1, SEEK_CUR)\n\t\t\tidentifier = self.__read_alpha(buffer)\n\t\t\t\n\t\t\tif identifier.lower() in FUNCTIONS:\n\t\t\t\targs = self.__parse_function_args(buffer)\n\t\t\t\treturn self.formatter.format_function(identifier, args)\n\t\t\t\n\t\t\tif identifier.lower() in PAPERDOLL_VALUES:\n\t\t\t\treturn self.formatter.format_paperdoll(identifier)\n\t\t\t\n\t\t\t\n\t\t\t# We didn't find any valid identifier\n\t\t\tif not identifier:\n\t\t\t\treturn \"$\"\n\t\t\t\n\t\t\t# Nothing left to check for but booleans\n\t\t\t# The values get messed with the identifier however, so we need to\n\t\t\t# look at only the first char\n\t\t\tif identifier[0] in BOOLEANS:\n\t\t\t\tidentifier = identifier[0]\n\t\t\t\tbuffer.seek(_tell)\n\t\t\t\tvalues = self.__parse_boolean(buffer)\n\t\t\t\treturn self.formatter.format_boolean(token, values)\n\t\t\n\t\t# It's probably a variable then\n\t\tbuffer.seek(-1, SEEK_CUR)\n\t\tspell, identifier, effect = self.__parse_macro(buffer)\n\t\t\n\t\tif identifier:\n\t\t\tspell = int(spell or 0)\n\t\t\teffect = int(effect or 1)\n\t\t\t\n\t\t\tvalue = self.formatter.format_macro(spell, identifier, effect)\n\t\t\tself.formatter.last_value = value\n\t\t\treturn str(value)\n\t\telse:\n\t\t\treturn \"$\"\n\t\t\n\t\tif not token or token.isspace():\n\t\t\treturn token\n\t\t\n\t\treturn token","def _parseAttributeScanf(self, line, formatting):\n\n # multiple entrys\n if isinstance(formatting, list):\n for scanf_format in formatting:\n try:\n #print \"<<<----\", scanf_format, line\n return sscanf(line, scanf_format)\n except IncompleteCaptureError, e:\n pass\n\n # single entry\n else:\n return sscanf(line, formatting)\n\n # problem if none of the formats worked\n raise IncompleteCaptureError(\"Format error for %s\" % line)","def eval_python_blocks(req, body):\n localsdict = {\"request\": req}\n globalsdict = {}\n\n old_stdout = sys.stdout\n old_stderr = sys.stderr\n\n try:\n start = 0\n while body.find(\"<%\", start) != -1:\n start = body.find(\"<%\")\n end = body.find(\"%>\", start) \n\n if start != -1 and end != -1:\n codeblock = body[start+2:end].lstrip()\n\n sys.stdout = StringIO.StringIO()\n sys.stderr = StringIO.StringIO()\n\n try:\n exec codeblock in localsdict, globalsdict\n\n except Exception, e:\n print \"ERROR in processing: %s\" % e\n\n output = sys.stdout.getvalue() + sys.stderr.getvalue()\n body = body[:start] + output + body[end+2:]\n\n finally:\n sys.stdout = old_stdout\n sys.stderr = old_stderr\n\n return body","def _parse(self, line):\n\n while True:\n sign, before, after = _splitbycharset(line, self._checkstr)\n\n # End of line\n if not sign:\n if self._inside_quote:\n self._buffer.append(before)\n elif self._after_equal_sign:\n self._text(\"\".join(self._buffer) + before.strip())\n self._closetag()\n self._after_equal_sign = False\n elif not self._inside_attrib:\n self._buffer.append(before)\n elif before.strip():\n self._error(SYNTAX_ERROR, (self._currline, self._currline))\n break\n\n # Special character is escaped\n elif before.endswith(\"\\\\\") and not before.endswith(\"\\\\\\\\\"):\n self._buffer.append(before + sign)\n\n # Equal sign\n elif sign == \"=\":\n # Ignore if followed by \"{\" (DFTB+ compatibility)\n if after.lstrip().startswith(\"{\"): # _oldbefore may already contain the tagname, if the # tagname was followed by an attribute -> append\n self._oldbefore += before\n else:\n self._hsdattrib[common.HSD_ATTRIB_EQUAL] = True\n self._starttag(before, False)\n self._after_equal_sign = True\n\n # Opening tag by curly brace\n elif sign == \"{\":\n #self._has_child = True\n self._hsdattrib[common.HSD_ATTRIB_EQUAL] = False\n self._starttag(before, self._after_equal_sign)\n self._buffer = []\n self._after_equal_sign = False\n\n # Closing tag by curly brace\n elif sign == \"}\":\n self._text(\"\".join(self._buffer) + before)\n self._buffer = []\n # If 'test { a = 12 }' occurs, curly brace closes two tags\n if self._after_equal_sign:\n self._after_equal_sign = False\n self._closetag()\n self._closetag()\n\n # Closing tag by semicolon\n elif sign == \";\" and self._after_equal_sign:\n self._after_equal_sign = False\n self._text(before)\n self._closetag()\n\n # Comment line\n elif sign == \"#\":\n self._buffer.append(before)\n after = \"\"\n\n # Opening attribute specification\n elif sign == \"[\":\n if \"\".join(self._buffer).strip():\n self._error(SYNTAX_ERROR, (self._currline, self._currline))\n self._oldbefore = before\n self._buffer = []\n self._inside_attrib = True\n self._opened_tags.append((\"[\", self._currline, None, None, None))\n self._checkstr = _ATTRIB_SPECIALS\n\n # Closing attribute specification\n elif sign == \"]\":\n value = \"\".join(self._buffer) + before\n self._attrib = value.strip()\n self._inside_attrib = False\n self._buffer = []\n self._opened_tags.pop()\n self._checkstr = _GENERAL_SPECIALS\n\n # Quoting strings\n elif sign in (\"'\", '\"'):\n if self._inside_quote:\n self._checkstr = self._oldcheckstr\n self._inside_quote = False\n self._buffer.append(before + sign)\n self._opened_tags.pop()\n else:\n self._oldcheckstr = self._checkstr\n self._checkstr = sign\n self._inside_quote = True\n self._buffer.append(before + sign)\n self._opened_tags.append(('\"', self._currline, None, None, None))\n\n # Interrupt\n elif sign == \"<\" and not self._after_equal_sign:\n txtinc = after.startswith(\"<<\")\n hsdinc = after.startswith(\"<+\")\n if txtinc:\n self._text(\"\".join(self._buffer) + before)\n self._buffer = []\n self._eventhandler.add_text(self._include_txt(after[2:]))\n break\n if hsdinc:\n self._include_hsd(after[2:])\n break\n self._buffer.append(before + sign)\n\n else:\n self._error(SYNTAX_ERROR, (self._currline, self._currline))\n\n line = after","def parse_template(self, template, **context):\n required_blocks = [\"subject\", \"body\"]\n optional_blocks = [\"text_body\", \"html_body\", \"return_path\", \"format\"]\n\n if self.template_context:\n context = dict(self.template_context.items() + context.items())\n blocks = self.template.render_blocks(template, **context)\n\n for rb in required_blocks:\n if rb not in blocks:\n raise AttributeError(\"Template error: block '%s' is missing from '%s'\" % (rb, template))\n\n mail_params = {\n \"subject\": blocks[\"subject\"].strip(),\n \"body\": blocks[\"body\"]\n }\n for ob in optional_blocks:\n if ob in blocks:\n if ob == \"format\" and mail_params[ob].lower() not in [\"html\", \"text\"]:\n continue\n mail_params[ob] = blocks[ob]\n return mail_params","def parse_blocks(self, text):\n code_matches = [m for m in self.code_pattern.finditer(text)]\n\n # determine where the limits of the non code bits are\n # based on the code block edges\n text_starts = [0] + [m.end() for m in code_matches]\n text_stops = [m.start() for m in code_matches] + [len(text)]\n text_limits = list(zip(text_starts, text_stops))\n\n # list of the groups from the code blocks\n code_blocks = [self.new_code_block(**m.groupdict())\n for m in code_matches]\n\n text_blocks = [self.new_text_block(content=text[i:j])\n for i, j in text_limits]\n\n # remove indents\n list(map(self.pre_process_code_block, code_blocks))\n # remove blank line at start and end of markdown\n list(map(self.pre_process_text_block, text_blocks))\n\n # create a list of the right length\n all_blocks = list(range(len(text_blocks) + len(code_blocks)))\n\n # NOTE: the behaviour here is a bit fragile in that we\n # assume that cells must alternate between code and\n # markdown. This isn't the case, as we could have\n # consecutive code cells, and we get around this by\n # stripping out empty cells. i.e. two consecutive code cells\n # have an empty markdown cell between them which is stripped\n # out because it is empty.\n\n # cells must alternate in order\n all_blocks[::2] = text_blocks\n all_blocks[1::2] = code_blocks\n\n # remove possible empty text cells\n all_blocks = [cell for cell in all_blocks if cell['content']]\n\n return all_blocks","def formatter(text):\n repl_map = {\n \"degC\": \"$^o$C\",\n \"K\": \"$^o$C\",\n \"month-1\": \"month$^{{-1}}$\",\n \"day-1\": \"day$^{{-1}}$\",\n \"d-1\": \"day$^{{-1}}$\",\n \"decade-1\": \"decade$^{{-1}}$\",\n \"year-1\": \"year$^{{-1}}$\",\n \"rcp85\": \"RCP8.5\",\n \"rcp45\": \"RCP4.5\",\n \"rcp26\": \"RCP2.6\",\n \"RCP85\": \"RCP8.5\",\n \"RCP45\": \"RCP4.5\",\n \"RCP26\": \"RCP2.6\",\n \"cmip5-85\": \"RCP8.5\",\n \"cmip5-60\": \"RCP6.0\",\n \"cmip5-45\": \"RCP4.5\",\n \"cmip5-26\": \"RCP2.6\",\n \"ssp585\": \"SSP5-8.5\",\n \"ssp245\": \"SSP2-4.5\",\n \"ssp126\": \"SSP1-2.6\",\n \"SSP585\": \"SSP5-8.5\",\n \"SSP245\": \"SSP2-4.5\",\n \"SSP126\": \"SSP1-2.6\",\n \"cmip6-85\": \"SSP5-8.5\",\n \"cmip6-70\": \"SSP3-7.0\",\n \"cmip6-60\": \"SSP4-6.0\",\n \"cmip6-34\": \"SSP4-3.4\",\n \"cmip6-45\": \"SSP2-4.5\",\n \"cmip6-26\": \"SSP1-2.6\",\n \"cmip6-19\": \"SSP1-1.9\",\n \"1\": \"%\",\n \"era5\": \"ERA5\",\n \"gpcc025x025_v8\": \"GPCC\",\n \"cru\": \"CRU\",\n \"jra55\": \"JRA55\",\n \"HIGHRESMIP\": \"HighResMIP\",\n \" \": \"\",\n }\n for key, val in repl_map.items():\n if key in text:\n text = text.replace(key, val)\n break\n return text","def _translate_fmts(self):\n fmt_info = []\n fmt_append = fmt_info.append\n \n isvalid = self._is_valid_fmt\n typlist = self._typlist\n isstrvar = self._isstrvar\n default_fmts = self._default_fmts\n \n for i, fmt in enumerate(self._fmtlist):\n fmt = fmt.strip()\n \n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\n \n if iscalendar or not isvalid(fmt):\n if isstrvar(i):\n wid = min(typlist[i], 10)\n fmt_append(('s', \"{{:>{}s}}\".format(wid), wid))\n continue\n else:\n fmt = default_fmts[typlist[i]]\n \n last_char = fmt[-1]\n if last_char == 's': # string\n m = STR_FMT_RE.match(fmt)\n align, _, wid = m.group(1), m.group(2), m.group(3)\n new_align = (\"<\" if align == \"-\" \n else \"^\" if align == \"~\" else \">\")\n new = \"\".join((\"{:\", new_align, wid, \"s}\"))\n fmt_append(('s', new, int(wid)))\n elif last_char == 'H' or last_char == 'L': # binary\n fmt_append((last_char, fmt, int(fmt[1:-1])))\n elif last_char == 'x': # hexadecimal\n fmt_append(('x', fmt, 21))\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\n m = NUM_FMT_RE.match(fmt)\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \n m.group(3), m.group(4),\n m.group(5), m.group(6),\n m.group(7))\n aln = \"<\" if align == \"-\" else \">\"\n sep = \",\" if com is not None else \"\"\n if type == \"g\" and int(prec) == 0:\n new = \"\".join((\"{:\", aln, wid, sep, type, \"}\"))\n else:\n new = \"\".join((\"{:\", aln, wid, sep, \".\", prec, type, \"}\"))\n fmt_append((type, new, int(wid), delim, com))\n \n return fmt_info","def parse_cfg(cfgfile):\n file = open(cfgfile, 'r')\n lines = file.read().split('\\n') # store the lines in a list\n lines = [x for x in lines if len(x) > 0] # skip empty lines\n lines = [x for x in lines if x[0] != '#'] # skip comment\n lines = [x.rstrip().lstrip() for x in lines]\n file.close()\n\n block = {}\n blocks = []\n\n for line in lines:\n if line[0] == \"[\": # This marks the start of a new block\n if len(block) != 0:\n blocks.append(block)\n block = {}\n block['type'] = line[1:-1].rstrip()\n else:\n key, value = line.split(\"=\")\n block[key.rstrip()] = value.lstrip()\n blocks.append(block)\n\n return blocks","def parse(\n data: str,\n raw: bool = False,\n quiet: bool = False\n) -> Dict:\n jc.utils.compatibility(__name__, info.compatible, quiet)\n jc.utils.input_type_check(data)\n\n raw_output: Dict = {}\n split_me = {'it_value:', 'it_interval:'}\n\n if jc.utils.has_data(data):\n\n for line in filter(None, data.splitlines()):\n\n # epoll files\n if line.startswith('tfd:'):\n line_match = re.findall(r'(?P<key>\\S+):(?:\\s+)?(?P<val>\\S+s*)', line)\n if line_match:\n raw_output.update({'epoll': {k.strip(): v.strip() for k, v in line_match}})\n continue\n\n # inotify files\n if line.startswith('inotify'):\n split_line = line[8:].split()\n raw_output['inotify'] = {}\n for item in split_line:\n k, v = item.split(':', maxsplit=1)\n raw_output['inotify'][k] = v\n continue\n\n # fanotify files\n if line.startswith('fanotify'):\n split_line = line[9:].split()\n\n if not 'fanotify' in raw_output:\n raw_output['fanotify'] = {}\n\n for item in split_line:\n k, v = item.split(':', maxsplit=1)\n raw_output['fanotify'][k] = v\n continue\n\n # timerfd files\n if line.split()[0] in split_me:\n split_line = line.replace(':', '').replace('(', '').replace(')', '').replace(',', '').split()\n raw_output[split_line[0]] = [int(x) for x in split_line[1:]]\n continue\n\n key, val = line.split(':', maxsplit=1)\n raw_output[key.strip()] = val.strip()\n continue\n\n return raw_output if raw else _process(raw_output)","def parseConfig(f):\n config = {\"formats\":{}}\n \n for line in f:\n if line.startswith(\"//\"): \n continue\n \n sline = re.split(\"[=\\s]\", line)\n if sline[0] is \"\":\n continue\n \n if sline[0]==\"format\":\n #Puts the format as a key in the dict pointed to by \"formats\"\n config[\"formats\"][sline[1]] = sline[3] \n else:\n config[sline[0]] = sline[1]\n \n return config","def parse_graph(self, graph_str, use_bs=True):\n blocks = graph_str.strip().split('BasicBlock ')\n \n # 1st iteration: collect block labels and node's bvars\n for block in blocks:\n if len(block) == 0: # skip empty lines\n continue\n\n block_var, instructions = block.split(':', 1)\n\n if instructions.find('<label>:') != -1:\n #raise Exception(\"Not supported\") # NOTE: legacy error, need to check when it happens though\n label = instructions.split('<label>:')[1].split(' ')[0]\n else:\n label = instructions.split('\\n', 1)[1].split(':')[0]\n\n if \"bd_\" in block_var: # only bd_ blocks can be start/end nodes\n # 'b' stands for block, 'd' for dominant\n if self._start_var is not None:\n self._end_var = block_var\n else:\n self._start_var = block_var\n\n self._label2var[label] = block_var\n self._var2label[block_var] = label\n\n # 2nd iteration: collect nodes and edges\n for block in blocks:\n if len(block) == 0: # skip empty lines\n continue\n\n # collect node\n block_var, instructions = block.split(':', 1)\n block_label = self._var2label[block_var]\n block_cost = int(instructions.split(' ')[1])\n block_dominator = instructions.split('Dominator = ', 1)[1].split('\\n', 1)[0]\n if block_dominator == 'NULL':\n block_dominator = \"-1\"\n else:\n block_dominator = block_dominator.split('_')[1]\n\n if block_var == self._start_var and use_bs:\n block_var = block_var.replace(\"bd_\", \"bs_\")\n\n b = Node(block_var, block_label, block_cost, block_dominator, self)\n\n self._nodes[b.get_uid()] = b\n self._label2uid[block_label] = b.get_uid()\n\n # collect edges\n if instructions.find('br ') != -1:\n for succ in instructions.split('br ')[1].strip().split('label'):\n succ = succ.strip()\n if len(succ) >= 2 and succ[0] == '%':\n dst_label = succ[1:] if succ[-1] != ',' else succ[1:-1]\n dst_var = self._label2var[dst_label]\n e = Edge(block_var, dst_var, 0, self)\n self._edges[e.get_uid()] = e\n\n if self._end_var is None:\n # single-block graph\n assert(len(self._nodes.keys()) <= 1)\n assert(len(self._edges.keys()) <= 0)\n self._end_var = self._start_var\n\n # update start/end uids\n self._start_uid = self._label2uid[self._var2label[self._start_var]]\n self._end_uid = self._label2uid[self._var2label[self._end_var]]\n\n # update nodes with ingoing/outgoing edges\n for edge_uid in self._edges.keys():\n edge = self._edges[edge_uid]\n src_block_uid = edge.get_src_uid()\n dst_block_uid = edge.get_dst_uid()\n self._nodes[src_block_uid].add_successor(dst_block_uid)\n self._nodes[dst_block_uid].add_predecessor(src_block_uid)\n return","def highlightBlock(self, text):\n\n for expression, nth, format in self.rules:\n index = expression.indexIn(text, 0)\n while index >= 0:\n # We actually want the index of the nth match\n index = expression.pos(nth)\n length = expression.cap(nth).length()\n self.setFormat(index, length, format)\n index = expression.indexIn(text, index + length)\n self.setCurrentBlockState(0)","def _parse_format(mode=2, rc_kw=None, **kwargs):\n kw = {}\n rc_kw = rc_kw or {}\n for key, value in kwargs.items():\n key_fixed = _rc_nodots.get(key, None)\n if key_fixed is None:\n kw[key] = value\n else:\n rc_kw[key_fixed] = value\n return rc_kw, mode, kw","def initFormat(self):\n self.formatList = []","def build_format(i, ex, args, meta_args):\n formatter = string.Formatter()\n format_string = meta_args.format_string\n fields = list(formatter.parse(format_string))\n\n kwarg_fields = []\n indexed_fields = []\n\n i.result = hive.variable('str')\n i.result_out = hive.pull_out(i.result)\n\n for index, field in enumerate(fields):\n literal_text = field[1]\n\n if literal_text is None:\n continue\n\n if not literal_text.isidentifier():\n field_name = \"field_{}\".format(index)\n indexed_fields.append(field_name)\n\n else:\n field_name = literal_text\n kwarg_fields.append(field_name)\n\n # Create IO\n attr = hive.variable()\n setattr(i, field_name, attr)\n\n in_attr = hive.pull_in(attr)\n setattr(i, \"{}_in\".format(field_name), in_attr)\n\n setattr(ex, field_name, hive.antenna(in_attr))\n hive.trigger(i.result_out, in_attr, pretrigger=True)\n\n ex.result = hive.output(i.result_out)\n\n def do_format(self):\n args = [getattr(self, \"_{}\".format(attr_name)) for attr_name in indexed_fields]\n kwargs = {attr_name: getattr(self, \"_{}\".format(attr_name)) for attr_name in kwarg_fields}\n self._result = formatter.format(format_string, *args, **kwargs)\n\n i.func = hive.modifier(do_format)\n hive.trigger(i.result_out, i.func, pretrigger=True)","def parse(input):\n\t\n\toutput = []\n\t\n\t# Comment delimiter of the docstring\n\tcommentDelim = '\"\"\"'\n\t\n\t# Some regexes\n\ttriggerRe = re.compile(\"^(\\s*)(def .+:|class .+:)\")\n\tcommentStartRe = re.compile('^\\s*(%s)' % commentDelim)\n\tcommentEndRe = re.compile('(%s)\\s*$' % commentDelim)\n\temptyRe = re.compile(\"^\\s*$\")\n\thashLineRe = re.compile(\"^\\s*#.*$\")\n\timportLineRe = re.compile(\"^\\s*(import |from .+ import)\")\n\t\n\t# split input into lines\n\tlines = input.split(\"\\n\")\n\t\n\t# flags, buffers, ...\n\tfileHeadFlag = True\n\ttriggerWordFlag = False\n\tcommentFlag = False\n\tcomment = []\n\ttriggerWs = \"\"\n\ttriggerLines = None\n\t\n\t# process each line\n\tfor line in enumerate(lines):\n\n\t\tmatch = re.search(triggerRe, line[1])\n\t\tif match:\n\t\t\tif triggerWordFlag and triggerLines:\n\t\t\t\toutput.append(\"\\n\".join(triggerLines))\n\t\t\t\n\t\t\ttriggerWordFlag = True\n\t\t\ttriggerWs = match.group(1)\n\t\t\tfileHeadFlag = False\n\t\t\ttriggerLines = [line[1]]\n\t\t\tcontinue\n\n\t\t# file header or active keyword trigger?\n\t\tif fileHeadFlag or triggerWordFlag:\n\t\t\t# comment end of multiline comment found\n\t\t\tif re.search(commentEndRe, line[1]) and commentFlag:\n\t\t\t\tcomment.append( line[1][ : line[1].rfind(commentDelim) ] )\n\t\t\t\toutput.append(makeCommentBlock(comment, triggerWs, (triggerLines is None)))\n\t\t\t\tif triggerLines:\n\t\t\t\t\toutput.append(\"\\n\".join(triggerLines))\n\t\t\t\tcomment = []\n\t\t\t\tcommentFlag = False\n\t\t\t\ttriggerWs = \"\"\n\t\t\t\ttriggerLines = None\n\t\t\t\ttriggerWordFlag = False\n\t\t\t\t\n\t\t\t# comment start found\n\t\t\telif re.search(commentStartRe, line[1]):\n\t\n\t\t\t\tif re.search(commentEndRe, line[1][line[1].find(commentDelim)+len(commentDelim) :]):\n\t\t\t\t\t# singleline comment\n\t\t\t\t\tcomment.append(line[1][line[1].find(commentDelim)+len(commentDelim) : line[1].rfind(commentDelim)])\n\t\t\t\t\toutput.append(makeCommentBlock(comment, triggerWs))\n\t\t\t\t\t\n\t\t\t\t\tif triggerLines:\n\t\t\t\t\t\toutput.append(\"\\n\".join(triggerLines))\n\t\t\t\t\t\t\n\t\t\t\t\tcomment = []\n\t\t\t\t\tcommentFlag = False\n\t\t\t\t\ttriggerWs = \"\"\n\t\t\t\t\ttriggerLines = None\n\t\t\t\t\ttriggerWordFlag = False\n\t\t\t\t\t\n\t\t\t\telse:\n\t\t\t\t\t# multiline comment begin\n\t\t\t\t\tcommentFlag = True\n\t\t\t\t\tcomment.append(\n\t\t\t\t\t\tline[1][line[1].find(commentDelim)+len(commentDelim):]\n\t\t\t\t\t)\n\t\n\t\t\t# active multiline comment -> append comment\n\t\t\telif commentFlag:\n\t\t\t\tcomment.append(line[1])\n\t\t\t\n\t\t\t# still searching for comment\n\t\t\telif re.search(emptyRe, line[1]):\n\t\t\t\tif triggerLines:\n\t\t\t\t\ttriggerLines.append(line[1])\n\t\t\t\telse:\n\t\t\t\t\toutput.append(line[1])\n\t\t\t\n\t\t\t# searching for file header\n\t\t\telif fileHeadFlag:\n\t\t\t\tif not (re.search(hashLineRe, line[1]) or re.search(emptyRe, line[1]) or re.search(importLineRe, line[1])):\n\t\t\t\t\t# fileheader over -> disable search\n\t\t\t\t\tfileHeadFlag = False\n\t\t\t\toutput.append(line[1])\n\t\t\t\n\t\t\t# no comment, disable comment search mode\n\t\t\telse:\n\t\t\t\ttriggerWordFlag = False\n\t\t\t\tif triggerLines:\n\t\t\t\t\toutput.append(\"\\n\".join(triggerLines))\n\t\t\t\ttriggerLines = None\n\t\t\t\toutput.append(line[1])\n\t\t\n\t\t# just append the line\n\t\telse:\n\t\t\toutput.append(line[1])\n\t\n\t# return output\n\treturn \"\\n\".join(output)","def parse_name_and_type_from_fmt_str(\n formatted_str: str,\n allowed_types: Optional[Dict[str, Component]] = None\n) -> Generator[Tuple[str, Type[Field]], None, None]:\n for _, arg_name, _type_name, _ in Formatter().parse(formatted_str):\n if arg_name is not None:\n try:\n assert _type_name is not None\n _type = (\n allowed_types[_type_name] if allowed_types is not None\n and _type_name in allowed_types\n else getattr(pyopenapi3.data_types, _type_name)\n )\n yield arg_name, _type\n except AttributeError:\n raise ValueError(\n \"A non-`Field` or `OpenApiObject` type was found. \"\n f\"Can't use `{_type_name}` as a type in {formatted_str}. \"\n f\"Must be a stringified pyopenapi3 `data_type`, such \"\n f\"as `pyopenapi3.data_types.String`, or a reference to a \"\n f\"Component.\"\n ) from None","def from_string(block_string: str):\n ops = block_string.split(\"_\")\n options = {}\n for op in ops:\n splits = re.split(r\"(\\d.*)\", op)\n if len(splits) >= 2:\n key, value = splits[:2]\n options[key] = value\n\n # check stride\n stride_check = (\n (\"s\" in options and len(options[\"s\"]) == 1)\n or (len(options[\"s\"]) == 2 and options[\"s\"][0] == options[\"s\"][1])\n or (len(options[\"s\"]) == 3 and options[\"s\"][0] == options[\"s\"][1] and options[\"s\"][0] == options[\"s\"][2])\n )\n if not stride_check:\n raise ValueError(\"invalid stride option received\")\n\n return BlockArgs(\n num_repeat=int(options[\"r\"]),\n kernel_size=int(options[\"k\"]),\n stride=int(options[\"s\"][0]),\n expand_ratio=int(options[\"e\"]),\n input_filters=int(options[\"i\"]),\n output_filters=int(options[\"o\"]),\n id_skip=(\"noskip\" not in block_string),\n se_ratio=float(options[\"se\"]) if \"se\" in options else None,\n )","def format(self, formatter, form, title):\n # store line offsets in self.lines\n self.lines = [0, 0]\n pos = 0\n while 1:\n pos = self.raw.find('\\n', pos) + 1\n if not pos: break\n self.lines.append(pos)\n self.lines.append(len(self.raw))\n\n # parse the source and write it\n self.pos = 0\n text = io.StringIO(self.raw)\n self.out.write('<html><body bgcolor=\"#e0e0e0\"><head><title>%s</title></head><pre><font face=\"Lucida,Courier New\">'%title)\n try:\n if (sys.version_info > (3, 0)):\n tokens = tokenize.generate_tokens(text.readline)\n for toktype,toktext,tok_start,tok_end,line in tokens:\n self.__call__(toktype,toktext,tok_start,tok_end,line)\n else:\n tokenize.tokenize(text.readline,self)\n except tokenize.TokenError as ex:\n msg = ex.args[0]\n line = ex.args[1][0]\n self.out.write(\"<h3>ERROR: %s</h3>%s\\n\" % (\n msg, self.raw[self.lines[line]:]))\n self.out.write('</font></pre></body></html>')","def format(self, formatter):\n WikiParser.format(self, formatter)\n # reset those states every time format is done\n self.break_next = False\n self.prev_list = False","def read_atom_data(atom_format, line):\n if atom_format is None:\n _format = [guess_string_format(i.strip()) for i in line.split()]\n else:\n _format = atom_format\n formatted = []\n for i, (val, fmti) in enumerate(zip(line.split(), _format)):\n istrip = val.strip()\n try:\n formatted.append(fmti(istrip))\n except ValueError:\n fmt = guess_string_format(istrip)\n _format[i] = fmt\n formatted.append(fmt(istrip))\n return formatted, _format","def test_regexp_chunk_parser():","def parse_shortform_block_annotation(description):\n if not description:\n return {}\n # TODO: Test encoded string formatting using regexp\n\n ref_version, chrom, scaffold, ori, gpos, _, coords = description.split('_')\n coords = [slice(int(start) - 1, int(stop))\n for start, stop in [c.split(':') for c in coords.split(';')]]\n\n return {\n 'ref_version': ref_version,\n 'chromosome': chrom,\n 'chromosome_scaffold': int(scaffold),\n 'genome_pos': int(gpos) - 1,\n 'orientation': ori,\n 'blocks': coords,\n }","def parse_block_math(self, m):\n self.tokens.append({\n 'type': 'block_math',\n 'text': m.group(1)\n })","def reparseText(parsed):\n out = []\n buffer = ''\n for type, data in parsed:\n if type is RAW:\n buffer += data\n else:\n if buffer:\n b = re.sub(r'\\s+', ' ' , buffer)\n out.append((RAW, b))\n buffer = ''\n out.append((type,data))\n if buffer:\n b = re.sub(r'\\s+', ' ' , buffer)\n out.append((RAW, b))\n return out","def commonmark(text, format=\"html\"):\n parser = Parser()\n ast = parser.parse(text)\n if format not in [\"html\", \"json\", \"ast\"]:\n raise ValueError(\"format must be 'html', 'json' or 'ast'\")\n if format == \"html\":\n renderer = HTMLRenderer()\n return renderer.render(ast)\n if format == \"json\":\n return ASTtoJSON(ast)\n if format == \"ast\":\n return dumpAST(ast)","def highlightBlock(self, text):\n # Do other syntax formatting\n for expression, nth, format in self.rules:\n index = expression.indexIn(text, 0)\n\n while index >= 0:\n # We actually want the index of the nth match\n index = expression.pos(nth)\n length = len(expression.cap(nth))\n self.setFormat(index, length, format)\n index = expression.indexIn(text, index + length)\n\n self.setCurrentBlockState(0)","def parse(self, input):\n pass","def register_data_format(format_name,parser):\n\n data_format_parser[format_name] = parser"],"string":"[\n \"def _parse(self, fmtstr):\\n def _match_brace(string, start_pos, pair='[]'):\\n \\\"\\\"\\\"Pairing brackets (used internally in _parse method)\\\"\\\"\\\"\\n depth = 1\\n if string[start_pos] != pair[0]:\\n return None\\n for index, char in enumerate(string[start_pos + 1:]):\\n if char == pair[0]:\\n depth += 1\\n elif char == pair[1]:\\n depth -= 1\\n if depth == 0:\\n return start_pos + index + 1\\n return None\\n\\n #----------------------------------------------------------------------\\n\\n t_fmt = self.__class__._T_FMT\\n t_prefix = self.__class__._T_PREFIX\\n\\n ptr = 0\\n # it seems that field id 0 is invalid\\n field_id = 1\\n length = len(fmtstr)\\n parsed_list = []\\n\\n while ptr < length:\\n parsed = {}\\n m_prefix = t_prefix.match(fmtstr[ptr:])\\n if m_prefix:\\n ptr += _get_length_of_match(m_prefix)\\n parsed['prefix'] = m_prefix.group(1)\\n\\n # check if we have a nested structure\\n if m_prefix.group(2):\\n brace_offset = _match_brace(fmtstr, ptr - 1)\\n\\n # bracket not match\\n if not brace_offset:\\n raise BadFormatString(\\n 'Unmatched brace on position {0}'.format(ptr)\\n )\\n parsed['field_id'] = field_id\\n parsed['field_type'] = 'a'\\n parsed['subcontent'] = self._parse(\\n fmtstr[ptr:brace_offset]\\n )\\n ptr = brace_offset + 1\\n field_id += 1\\n\\n parsed_list.append(parsed)\\n continue\\n m_fmt = t_fmt.match(fmtstr[ptr:])\\n if m_fmt:\\n ptr += _get_length_of_match(m_fmt)\\n\\n # fmt is an alias\\n if m_fmt.group(2):\\n parsed['field_type'] = self.__class__\\\\\\n .FIELD_ALIAS[m_fmt.group(2)]\\n # fmt is an actual field type\\n elif m_fmt.group(1):\\n parsed['field_type'] = m_fmt.group(1)\\n\\n # save field id\\n parsed['field_id'] = field_id\\n\\n # check for type clones (e.g. `v3')\\n if m_fmt.group(3):\\n parsed['repeat'] = int(m_fmt.group(3))\\n field_id += int(m_fmt.group(3))\\n else:\\n parsed['repeat'] = 1\\n field_id += 1\\n\\n parsed_list.append(parsed)\\n\\n else:\\n raise BadFormatString(\\n 'Invalid token on position {0}'.format(ptr)\\n )\\n\\n # all set\\n return parsed_list\",\n \"def parse_blocks(fblocks):\\n print('Parse blocks: ', end='')\\n result = []\\n\\n for line in fblocks:\\n stripped = line.strip()\\n if len(stripped) > 0 and stripped[0] != '#':\\n match = re.match(r\\\"([0-9A-F]+)\\\\.{2}([0-9A-F]+);\\\\s+(.+)\\\", stripped)\\n result.append({\\n 'begin': int(match.group(1), 16),\\n 'end': int(match.group(2), 16),\\n 'name': match.group(3)\\n })\\n\\n print('done')\\n return result\",\n \"def _interpolate(format):\\n from tokenize import tokenprog\\n\\n def matchorfail(text, pos):\\n match = tokenprog.match(text, pos)\\n if match is None:\\n raise _ItplError(text, pos)\\n return match, match.end()\\n\\n namechars = \\\"abcdefghijklmnopqrstuvwxyz\\\" \\\\\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\\\";\\n chunks = []\\n pos = 0\\n\\n while 1:\\n dollar = format.find(\\\"$\\\", pos)\\n if dollar < 0: \\n break\\n nextchar = format[dollar + 1]\\n\\n if nextchar == \\\"{\\\":\\n chunks.append((0, format[pos:dollar]))\\n pos, level = dollar + 2, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token == \\\"{\\\": \\n level = level + 1\\n elif token == \\\"}\\\": \\n level = level - 1\\n chunks.append((1, format[dollar + 2:pos - 1]))\\n\\n elif nextchar in namechars:\\n chunks.append((0, format[pos:dollar]))\\n match, pos = matchorfail(format, dollar + 1)\\n while pos < len(format):\\n if format[pos] == \\\".\\\" and \\\\\\n pos + 1 < len(format) and format[pos + 1] in namechars:\\n match, pos = matchorfail(format, pos + 1)\\n elif format[pos] in \\\"([\\\":\\n pos, level = pos + 1, 1\\n while level:\\n match, pos = matchorfail(format, pos)\\n tstart, tend = match.regs[3]\\n token = format[tstart:tend]\\n if token[0] in \\\"([\\\": \\n level = level + 1\\n elif token[0] in \\\")]\\\": \\n level = level - 1\\n else: \\n break\\n chunks.append((1, format[dollar + 1:pos]))\\n else:\\n chunks.append((0, format[pos:dollar + 1]))\\n pos = dollar + 1 + (nextchar == \\\"$\\\")\\n\\n if pos < len(format): \\n chunks.append((0, format[pos:]))\\n return chunks\",\n \"def update_placeholder_formats(self, format_string, placeholder_formats):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if (\\n token.group(\\\"placeholder\\\")\\n and (not token.group(\\\"format\\\"))\\n and token.group(\\\"key\\\") in placeholder_formats\\n ):\\n output.append(f\\\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\\\")\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def _parse(self, template, fpos=0):\\r\\n # blank out comments\\r\\n # (So that its content does not collide with other syntax, and\\r\\n # because removing them completely would falsify the character-\\r\\n # position (\\\"match.start()\\\") of error-messages)\\r\\n template = self._reComment.sub(lambda match: self._comment_start+\\\" \\\"*len(match.group(1))+match.group(2), template)\\r\\n\\r\\n # init parser\\r\\n parsetree = []\\r\\n curr = 0 # current position (= end of previous block)\\r\\n block_type = None # block type: if,for,macro,raw,...\\r\\n block_indent = None # None: single-line, >=0: multi-line\\r\\n\\r\\n # find blocks\\r\\n for match in self._reBlock.finditer(template):\\r\\n start = match.start()\\r\\n # process template-part before this block\\r\\n if start > curr:\\r\\n self._parse_sub(parsetree, template[curr:start], fpos)\\r\\n\\r\\n # analyze block syntax (incl. error-checking and -messages)\\r\\n keyword = None\\r\\n block = match.groupdict()\\r\\n pos__ = fpos + start # shortcut\\r\\n if block[\\\"sKeyw\\\"] is not None: # single-line block tag\\r\\n block_indent = None\\r\\n keyword = block[\\\"sKeyw\\\"]\\r\\n param = block[\\\"sParam\\\"]\\r\\n content = block[\\\"sContent\\\"]\\r\\n if block[\\\"sSpace\\\"]: # restore spaces before start-tag\\r\\n if len(parsetree) > 0 and parsetree[-1][0] == \\\"str\\\":\\r\\n parsetree[-1] = (\\\"str\\\", parsetree[-1][1] + block[\\\"sSpace\\\"])\\r\\n else:\\r\\n parsetree.append((\\\"str\\\", block[\\\"sSpace\\\"]))\\r\\n pos_p = fpos + match.start(\\\"sParam\\\") # shortcuts\\r\\n pos_c = fpos + match.start(\\\"sContent\\\")\\r\\n elif block[\\\"mKeyw\\\"] is not None: # multi-line block tag\\r\\n block_indent = len(block[\\\"indent\\\"])\\r\\n keyword = block[\\\"mKeyw\\\"]\\r\\n param = block[\\\"mParam\\\"]\\r\\n content = block[\\\"mContent\\\"]\\r\\n pos_p = fpos + match.start(\\\"mParam\\\")\\r\\n pos_c = fpos + match.start(\\\"mContent\\\")\\r\\n ignored = block[\\\"mIgnored\\\"].strip()\\r\\n if ignored and ignored != self._comment_start:\\r\\n raise TemplateSyntaxError(\\\"No code allowed after block-tag.\\\", self._errpos(fpos+match.start(\\\"mIgnored\\\")))\\r\\n elif block[\\\"mEnd\\\"] is not None: # multi-line block end\\r\\n if block_type is None:\\r\\n raise TemplateSyntaxError(\\\"No block to end here/invalid indent.\\\", self._errpos(pos__) )\\r\\n if block_indent != len(block[\\\"mEnd\\\"]):\\r\\n raise TemplateSyntaxError(\\\"Invalid indent for end-tag.\\\", self._errpos(pos__) )\\r\\n ignored = block[\\\"meIgnored\\\"].strip()\\r\\n if ignored and ignored != self._comment_start:\\r\\n raise TemplateSyntaxError(\\\"No code allowed after end-tag.\\\", self._errpos(fpos+match.start(\\\"meIgnored\\\")))\\r\\n block_type = None\\r\\n elif block[\\\"sEnd\\\"] is not None: # single-line block end\\r\\n if block_type is None:\\r\\n raise TemplateSyntaxError(\\\"No block to end here/invalid indent.\\\", self._errpos(pos__))\\r\\n if block_indent is not None:\\r\\n raise TemplateSyntaxError(\\\"Invalid indent for end-tag.\\\", self._errpos(pos__))\\r\\n block_type = None\\r\\n else:\\r\\n raise TemplateException(\\\"FATAL: Block regexp error. Please contact the author. (%s)\\\" % match.group())\\r\\n\\r\\n # analyze block content (mainly error-checking and -messages)\\r\\n if keyword:\\r\\n keyword = keyword.lower()\\r\\n if 'for' == keyword:\\r\\n if block_type is not None:\\r\\n raise TemplateSyntaxError(\\\"Missing block-end-tag before new block at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n block_type = 'for'\\r\\n cond = self._reForParam.match(param)\\r\\n if cond is None:\\r\\n raise TemplateSyntaxError(\\\"Invalid 'for ...' at '%s'.\\\" %(param), self._errpos(pos_p))\\r\\n names = tuple(n.strip() for n in cond.group(\\\"names\\\").split(\\\",\\\"))\\r\\n self._testexpr(cond.group(\\\"iter\\\"), pos_p+cond.start(\\\"iter\\\"))\\r\\n parsetree.append((\\\"for\\\", names, cond.group(\\\"iter\\\"), self._parse(content, pos_c)))\\r\\n elif 'if' == keyword:\\r\\n if block_type is not None:\\r\\n raise TemplateSyntaxError(\\\"Missing block-end-tag before new block at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n if not param:\\r\\n raise TemplateSyntaxError(\\\"Missing condition for 'if' at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n block_type = 'if'\\r\\n self._testexpr(param, pos_p)\\r\\n parsetree.append((\\\"if\\\", param, self._parse(content, pos_c)))\\r\\n elif 'elif' == keyword:\\r\\n if block_type != 'if':\\r\\n raise TemplateSyntaxError(\\\"'elif' may only appear after 'if' at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n if not param:\\r\\n raise TemplateSyntaxError(\\\"Missing condition for 'elif' at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n self._testexpr(param, pos_p)\\r\\n parsetree.append((\\\"elif\\\", param, self._parse(content, pos_c)))\\r\\n elif 'else' == keyword:\\r\\n if block_type not in ('if', 'for'):\\r\\n raise TemplateSyntaxError(\\\"'else' may only appear after 'if' of 'for' at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n if param:\\r\\n raise TemplateSyntaxError(\\\"'else' may not have parameters at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n parsetree.append((\\\"else\\\", self._parse(content, pos_c)))\\r\\n elif 'macro' == keyword:\\r\\n if block_type is not None:\\r\\n raise TemplateSyntaxError(\\\"Missing block-end-tag before new block '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n block_type = 'macro'\\r\\n # make sure param is \\\"\\\\w+\\\" (instead of \\\".+\\\")\\r\\n if not param:\\r\\n raise TemplateSyntaxError(\\\"Missing name for 'macro' at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n if not self._reMacroParam.match(param):\\r\\n raise TemplateSyntaxError(\\\"Invalid name for 'macro' at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n #remove last newline\\r\\n if len(content) > 0 and content[-1] == '\\\\n':\\r\\n content = content[:-1]\\r\\n if len(content) > 0 and content[-1] == '\\\\r':\\r\\n content = content[:-1]\\r\\n parsetree.append((\\\"macro\\\", param, self._parse(content, pos_c)))\\r\\n\\r\\n # parser-commands\\r\\n elif 'raw' == keyword:\\r\\n if block_type is not None:\\r\\n raise TemplateSyntaxError(\\\"Missing block-end-tag before new block '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n if param:\\r\\n raise TemplateSyntaxError(\\\"'raw' may not have parameters at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n block_type = 'raw'\\r\\n parsetree.append((\\\"str\\\", content))\\r\\n elif 'include' == keyword:\\r\\n if block_type is not None:\\r\\n raise TemplateSyntaxError(\\\"Missing block-end-tag before new block '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n if param:\\r\\n raise TemplateSyntaxError(\\\"'include' may not have parameters at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n block_type = 'include'\\r\\n try:\\r\\n u = self._load(content.strip())\\r\\n except Exception,err:\\r\\n raise TemplateIncludeError(err, self._errpos(pos__))\\r\\n self._includestack.append((content.strip(), u)) # current filename/template for error-msg.\\r\\n p = self._parse(u)\\r\\n self._includestack.pop()\\r\\n parsetree.extend(p)\\r\\n elif 'set_escape' == keyword:\\r\\n if block_type is not None:\\r\\n raise TemplateSyntaxError(\\\"Missing block-end-tag before new block '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n if param:\\r\\n raise TemplateSyntaxError(\\\"'set_escape' may not have parameters at '%s'.\\\" %(match.group()), self._errpos(pos__))\\r\\n block_type = 'set_escape'\\r\\n esc = content.strip().upper()\\r\\n if esc not in ESCAPE_SUPPORTED:\\r\\n raise TemplateSyntaxError(\\\"Unsupported escape '%s'.\\\" %(esc), self._errpos(pos__))\\r\\n self.escape = ESCAPE_SUPPORTED[esc]\\r\\n else:\\r\\n raise TemplateSyntaxError(\\\"Invalid keyword '%s'.\\\" %(keyword), self._errpos(pos__))\\r\\n curr = match.end()\\r\\n\\r\\n if block_type is not None:\\r\\n raise TemplateSyntaxError(\\\"Missing end-tag.\\\", self._errpos(pos__))\\r\\n\\r\\n if len(template) > curr: # process template-part after last block\\r\\n self._parse_sub(parsetree, template[curr:], fpos)\\r\\n\\r\\n return parsetree\",\n \"def parse_block(\\n string: str,\\n vars: Dict,\\n neg: bool = False,\\n min_: int = 1,\\n max_: int = 1,\\n label: Optional[str] = None,\\n start: int = -1,\\n) -> Block:\\n it: BlockIterator = BlockIterator(string, start=start)\\n members: List[Union[Block, Unit, Ref]] = []\\n block = Block(members, vars, neg=neg, min_=min_, max_=max_, label=label)\\n for content, neg, min_, max_, label, type_, line_num in it:\\n if type_ == Types.BLOCK:\\n members.append(parse_block(content, vars, neg, min_, max_, label, line_num))\\n elif type_ == Types.UNIT:\\n members.append(parse_unit(content, neg, min_, max_, label))\\n elif type_ == Types.VAR_REF:\\n members.append(Ref(content, neg, min_, max_, label))\\n # use this after the iteration is complete\\n block.union = it.is_union\\n if not block.members and not EMPTY_BLOCK_RE.match(string):\\n raise ValueError(\\n f\\\"Cannot parse block contents: {string} \\\" f\\\"starting at {start}\\\"\\n )\\n return block\",\n \"def get_placeholder_formats_list(self, format_string):\\n placeholders = []\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"placeholder\\\"):\\n placeholders.append((token.group(\\\"key\\\"), token.group(\\\"format\\\")))\\n return placeholders\",\n \"def parse(self, s):\\n\\n segments = self.compiled.split(self._whitespace.sub(\\\" \\\", s))\\n literals = segments[::2]\\n raw = segments[1::2]\\n\\n if not raw:\\n return []\\n\\n case = list(map(str.casefold, raw))\\n prefixes = [{}] + [dict(self.locale_set.prefixes.get(match, ())) for match in case[:-1]]\\n suffixes = [dict(self.locale_set.suffixes.get(match, ())) for match in case[1:]] + [{}]\\n\\n groups = _DateTime(**{ field: [] for field in _DateTime._fields })\\n choices_per_position = {}\\n always_literal = set()\\n numeric = set()\\n for idx, (prefix, suffix) in enumerate(zip(prefixes, suffixes)):\\n keyword = self._lookup_keyword(raw[idx])\\n if \\\"y\\\" in prefix:\\n prefix[\\\"C\\\"] = tuple(set(prefix[\\\"y\\\"] + prefix.get(\\\"C\\\", ())))\\n if not keyword:\\n always_literal.add(idx)\\n else:\\n if raw[idx].isdigit():\\n numeric.add(idx)\\n choices_per_position[idx] = len(keyword)\\n for fmt, value, locales in keyword:\\n category = fmt[-1]\\n if category == \\\"b\\\":\\n # Month-names should be treated like numeric months.\\n category = \\\"m\\\"\\n elif category == \\\"z\\\":\\n category = \\\"Z\\\"\\n getattr(groups, category).append(_Assignment(\\n fmt=fmt,\\n pos=idx,\\n value=value,\\n locales=locales,\\n prefix=prefix.get(fmt[-1]),\\n suffix=suffix.get(fmt[-1]),\\n ))\\n numeric = frozenset(numeric)\\n\\n # If a required date field is unsatisfiable, this is not a date.\\n if not all(getattr(groups, category) for category in _State._min_date_formats):\\n for category in _State._all_date_formats:\\n getattr(groups, category).clear()\\n\\n # If a required time field is unsatisfiable, this is not a time.\\n if not all(getattr(groups, category) for category in _State._min_time_formats):\\n for category in _State._all_time_formats:\\n getattr(groups, category).clear()\\n\\n for group in groups:\\n group.sort(key=lambda assignment: (\\n -self._optimistic_score(assignment),\\n choices_per_position[assignment.pos],\\n ))\\n\\n required_formats = _State._min_date_formats + _State._min_time_formats\\n groups = OrderedDict(sorted(\\n (\\n (\\n category,\\n (\\n group,\\n tuple(\\n (f, required)\\n for f, required in _position_constraints\\n if category in required\\n ),\\n tuple(\\n (f, required)\\n for f, required, revisit in _value_constraints\\n if category in required or category in revisit\\n ),\\n )\\n )\\n for category, group in zip(groups._fields, groups)\\n if group\\n ),\\n key=lambda i: (i[0] not in required_formats, len(i[1][0]))\\n ))\\n\\n # We've already filtered out all possibilities; there's nothing here.\\n if not groups:\\n return []\\n\\n constrained_groups = []\\n while groups:\\n category, (group, position, value) = groups.popitem(last=False)\\n constrained_groups.append((category, group, position, value))\\n required = frozenset(itertools.chain.from_iterable(required for f, required in itertools.chain(position, value)))\\n if required:\\n required = [\\n category\\n for category in reversed(groups.keys())\\n if category in required\\n ]\\n for category in required:\\n groups.move_to_end(category, last=False)\\n groups = constrained_groups\\n\\n best_quality = 0\\n best_candidates = []\\n\\n partials = [\\n _State.empty._replace(\\n unconverted=frozenset(always_literal),\\n remaining_groups=tuple(groups),\\n ).children(numeric=numeric)\\n ]\\n while partials:\\n try:\\n quality, locales, state = next(partials[-1])\\n except StopIteration:\\n partials.pop()\\n continue\\n\\n if state.remaining_groups:\\n # Admissable heuristic: compute the best score each group\\n # could possibly achieve. Don't count conversion specifiers\\n # that we've already used, but don't worry about conflicts\\n # in the groups we haven't assigned yet. Any such conflicts\\n # can only reduce the resulting score, and we only need to\\n # make sure that the heuristic is at least as large as the\\n # true value of the best leaf in this subtree. However, the\\n # more precise we can be here, the fewer nodes we have to\\n # search, so we can spend some CPU time on precision and\\n # still come out ahead.\\n assigned = state.unconverted.union(state.pos).difference((None,))\\n heuristic = len(state.pending_hints) + sum(\\n next((\\n self._optimistic_score(assignment)\\n for assignment in group[1]\\n if assignment.pos not in assigned\\n ), 0)\\n for group in state.remaining_groups\\n )\\n\\n if quality + heuristic < best_quality:\\n # Even assuming the remaining groups get the highest\\n # possible score, this state is still not good enough.\\n continue\\n\\n partials.append(state.children(numeric=numeric))\\n continue\\n\\n value = state.valid()\\n if value is None:\\n continue\\n\\n quality, locales, state = state.final_score()\\n\\n if best_quality is not None and quality < best_quality:\\n # We've seen better, so skip this one.\\n continue\\n\\n if quality != best_quality:\\n best_quality = quality\\n best_candidates = []\\n\\n conversions = dict(zip(state.pos, state.fmts))\\n fmts = [ conversions.get(idx) or literal for idx, literal in enumerate(raw) ]\\n\\n pattern = ''.join(lit + fmt for lit, fmt in zip(literals, fmts + [''])).replace(\\\"%C%y\\\", \\\"%Y\\\")\\n best_candidates.append((pattern, value, locales))\\n return best_candidates\",\n \"def initFormat(self):\\n self.formatList = self.splitText(self.format)\",\n \"def blockParser(block):\\n struct = []\\n first = True\\n record = False\\n for line in block:\\n if line.startswith('Structure #'):\\n record = True\\n if not first:\\n yield struct\\n struct = []\\n first = False\\n if record:\\n struct.append(line)\\n yield struct\",\n \"def parse_block_layout(raw_block_layout):\\n\\n validate_raw_block_layout(raw_block_layout)\\n\\n block_layout = []\\n for raw_layer_layout in raw_block_layout:\\n raw_block_specs = raw_layer_layout.split('-')\\n layer = [raw_block_spec.split(',') for raw_block_spec in raw_block_specs]\\n layer = [(block_name, int(num_repeats)) for block_name, num_repeats in layer]\\n block_layout.append(layer)\\n\\n return block_layout\",\n \"def __init__(self, format_string):\\r\\n if not isinstance(format_string, Compatibility.string):\\r\\n raise TypeError('format_string should be a string, instead got %s' % type(format_string))\\r\\n self._re_pattern, self._applicators = self._preprocess_format_string(format_string)\\r\\n self._re = re.compile(self._re_pattern)\",\n \"def update_placeholders(self, format_string, placeholders):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if token.group(\\\"key\\\") in placeholders:\\n output.append(\\n \\\"{{{}{}}}\\\".format(placeholders[token.group(\\\"key\\\")], token.group(\\\"format\\\"))\\n )\\n continue\\n elif token.group(\\\"command\\\"):\\n # update any placeholders used in commands\\n commands = parse_qsl(token.group(\\\"command\\\"), keep_blank_values=True)\\n # placeholders only used in `if`\\n if \\\"if\\\" in [x[0] for x in commands]:\\n items = []\\n for key, value in commands:\\n if key == \\\"if\\\":\\n # we have to rebuild from the parts we have\\n condition = Condition(value)\\n variable = condition.variable\\n if variable in placeholders:\\n variable = placeholders[variable]\\n # negation via `!`\\n not_ = \\\"!\\\" if not condition.default else \\\"\\\"\\n condition_ = condition.condition or \\\"\\\"\\n # if there is no condition then there is no\\n # value\\n if condition_:\\n value_ = condition.value\\n else:\\n value_ = \\\"\\\"\\n value = \\\"{}{}{}{}\\\".format(not_, variable, condition_, value_)\\n if value:\\n items.append(f\\\"{key}={value}\\\")\\n else:\\n items.append(key)\\n\\n # we cannot use urlencode because it will escape things\\n # like `!`\\n output.append(r\\\"\\\\?{} \\\".format(\\\"&\\\".join(items)))\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def _decode_block_string(self, block_string: str):\\n\\n arg_strings = block_string.split('_')\\n args = {}\\n for arg_string in arg_strings:\\n splits = re.split(r'(\\\\d.*)', arg_string)\\n if len(splits) >= 2:\\n key, value = splits[:2]\\n args[key] = value\\n num_repeat = int(args['r'])\\n block_args = {\\n 'kernel_size': int(args['k']),\\n 'stride': int(args['s']),\\n 'expand_ratio': int(args['e']),\\n 'in_channels': int(args['i']),\\n 'out_channels': int(args['o']),\\n 'se_ratio': float(args['se']) if 'se' in args else None,\\n }\\n return block_args, num_repeat\",\n \"def parse_from_placeholder(string,pattern,encloser='%',matcher='(.+)'):\\n pattern,fields = placeholder_to_regex(pattern,encloser,matcher)\\n return parse_from_regex(string,pattern,fields)\",\n \"def parse_blocks(self):\\n if not self.options.blocks:\\n return\\n block_identifiers, block_aliases = [list(b) for b in zip(*self.options.blocks)]\\n while block_identifiers:\\n nodelist = self.parser.parse(block_identifiers)\\n token = self.parser.next_token()\\n current_identifier = block_identifiers.pop(0)\\n current_alias = block_aliases.pop(0)\\n while token.contents != current_identifier:\\n current_identifier = block_identifiers.pop(0)\\n self.blocks[block_aliases.pop(0)] = template.NodeList() \\n self.blocks[current_alias] = nodelist\\n assert len(self.blocks) == len(self.options.blocks), \\\"%s block parsing failed: %r => %r\\\" % (self.tagname, self.options.blocks, self.blocks)\",\n \"def get_placeholders(self, format_string):\\n placeholders = set()\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n if token.group(\\\"placeholder\\\"):\\n placeholders.add(token.group(\\\"key\\\"))\\n elif token.group(\\\"command\\\"):\\n # get any placeholders used in commands\\n commands = dict(parse_qsl(token.group(\\\"command\\\")))\\n # placeholders only used in `if`\\n if_ = commands.get(\\\"if\\\")\\n if if_:\\n placeholders.add(Condition(if_).variable)\\n return placeholders\",\n \"def _slice_template(cls, in_str: str) -> Iterator[RawFileSlice]:\\n fmt = Formatter()\\n in_idx = 0\\n for literal_text, field_name, format_spec, conversion in fmt.parse(in_str):\\n if literal_text:\\n escape_chars = cls._sorted_occurrence_tuples(\\n cls._substring_occurrences(literal_text, [\\\"}\\\", \\\"{\\\"])\\n )\\n idx = 0\\n while escape_chars:\\n first_char = escape_chars.pop()\\n # Is there a literal first?\\n if first_char[1] > idx:\\n yield RawFileSlice(\\n literal_text[idx : first_char[1]], \\\"literal\\\", in_idx\\n )\\n in_idx += first_char[1] - idx\\n # Add the escaped\\n idx = first_char[1] + len(first_char[0])\\n # We double them here to make the raw\\n yield RawFileSlice(\\n literal_text[first_char[1] : idx] * 2, \\\"escaped\\\", in_idx\\n )\\n # Will always be 2 in this case.\\n # This is because ALL escape sequences in the python formatter\\n # are two characters which reduce to one.\\n in_idx += 2\\n # Deal with last one (if present)\\n if literal_text[idx:]:\\n yield RawFileSlice(literal_text[idx:], \\\"literal\\\", in_idx)\\n in_idx += len(literal_text) - idx\\n # Deal with fields\\n if field_name:\\n constructed_token = \\\"{{{field_name}{conv}{spec}}}\\\".format(\\n field_name=field_name,\\n conv=f\\\"!{conversion}\\\" if conversion else \\\"\\\",\\n spec=f\\\":{format_spec}\\\" if format_spec else \\\"\\\",\\n )\\n yield RawFileSlice(constructed_token, \\\"templated\\\", in_idx)\\n in_idx += len(constructed_token)\",\n \"def reformat(ctx):\\n pass\",\n \"def format(\\n self,\\n format_string,\\n module=None,\\n param_dict=None,\\n force_composite=False,\\n attr_getter=None,\\n ):\\n if param_dict is None:\\n param_dict = {}\\n\\n # if the processed format string is not in the cache then create it.\\n if format_string not in self.block_cache:\\n self.build_block(format_string)\\n\\n first_block = self.block_cache[format_string]\\n\\n def get_parameter(key):\\n \\\"\\\"\\\"\\n function that finds and returns the value for a placeholder.\\n \\\"\\\"\\\"\\n if key in param_dict:\\n # was a supplied parameter\\n param = param_dict.get(key)\\n elif module and hasattr(module, key):\\n param = getattr(module, key)\\n if hasattr(param, \\\"__call__\\\"):\\n # we don't allow module methods\\n raise Exception()\\n elif attr_getter:\\n # get value from attr_getter function\\n try:\\n param = attr_getter(key)\\n except: # noqa e722\\n raise Exception()\\n else:\\n raise Exception()\\n if isinstance(param, Composite):\\n if param.text():\\n param = param.copy()\\n else:\\n param = \\\"\\\"\\n return param\\n\\n # render our processed format\\n valid, output = first_block.render(get_parameter, module)\\n\\n # clean things up a little\\n if isinstance(output, list):\\n output = Composite(output)\\n if not output:\\n if force_composite:\\n output = Composite()\\n else:\\n output = \\\"\\\"\\n\\n return output\",\n \"def parse(message):\\n if not isinstance(message, str):\\n raise TypeError(\\\"Block.from_network_format: expected message to be of type str\\\")\\n if not message[0] == 'd':\\n raise ValueError()\\n block_number = int(message[1:7], 16)\\n timestamp = int(message[7:15], 16)\\n difficulty = int(message[15:17], 16)\\n nonce = int(message[17:81], 16)\\n previous_block_hash = message[81:145]\\n merkle_root_hash = message[145:209]\\n transaction_count = int(message[209:211], 16)\\n message = message[211:]\\n block_transactions = []\\n for x in range(transaction_count):\\n transaction_length = int(message[:5], 16)\\n transaction = message[5:transaction_length + 5]\\n block_transactions.append(transaction)\\n message = message[transaction_length + 5:]\\n str_block_transactions = \\\"\\\"\\n for t in block_transactions:\\n str_block_transactions += t + \\\",\\\"\\n str_block_transactions = str_block_transactions[:-1]\\n self_hash = calculate_hash(previous_block_hash, merkle_root_hash, nonce)\\n block = (\\n 0, block_number, timestamp, difficulty, nonce, previous_block_hash, merkle_root_hash,\\n str_block_transactions,\\n self_hash)\\n return Block(block)\",\n \"def parseBlock(self, text, prevLineData):\\n return self.parser.parseBlock(text, prevLineData)\",\n \"def block_parser(part, rgxin, rgxout, fmtin, fmtout):\\r\\n\\r\\n block = []\\r\\n lines = part.split('\\\\n')\\r\\n N = len(lines)\\r\\n i = 0\\r\\n decorator = None\\r\\n while 1:\\r\\n\\r\\n if i==N:\\r\\n # nothing left to parse -- the last line\\r\\n break\\r\\n\\r\\n line = lines[i]\\r\\n i += 1\\r\\n line_stripped = line.strip()\\r\\n if line_stripped.startswith('#'):\\r\\n block.append((COMMENT, line))\\r\\n continue\\r\\n\\r\\n if line_stripped.startswith('@'):\\r\\n # we're assuming at most one decorator -- may need to\\r\\n # rethink\\r\\n decorator = line_stripped\\r\\n continue\\r\\n\\r\\n # does this look like an input line?\\r\\n matchin = rgxin.match(line)\\r\\n if matchin:\\r\\n lineno, inputline = int(matchin.group(1)), matchin.group(2)\\r\\n\\r\\n # the ....: continuation string\\r\\n continuation = ' %s:'%''.join(['.']*(len(str(lineno))+2))\\r\\n Nc = len(continuation)\\r\\n # input lines can continue on for more than one line, if\\r\\n # we have a '\\\\' line continuation char or a function call\\r\\n # echo line 'print'. The input line can only be\\r\\n # terminated by the end of the block or an output line, so\\r\\n # we parse out the rest of the input line if it is\\r\\n # multiline as well as any echo text\\r\\n\\r\\n rest = []\\r\\n while i<N:\\r\\n\\r\\n # look ahead; if the next line is blank, or a comment, or\\r\\n # an output line, we're done\\r\\n\\r\\n nextline = lines[i]\\r\\n matchout = rgxout.match(nextline)\\r\\n #print \\\"nextline=%s, continuation=%s, starts=%s\\\"%(nextline, continuation, nextline.startswith(continuation))\\r\\n if matchout or nextline.startswith('#'):\\r\\n break\\r\\n elif nextline.startswith(continuation):\\r\\n inputline += '\\\\n' + nextline[Nc:]\\r\\n else:\\r\\n rest.append(nextline)\\r\\n i+= 1\\r\\n\\r\\n block.append((INPUT, (decorator, inputline, '\\\\n'.join(rest))))\\r\\n continue\\r\\n\\r\\n # if it looks like an output line grab all the text to the end\\r\\n # of the block\\r\\n matchout = rgxout.match(line)\\r\\n if matchout:\\r\\n lineno, output = int(matchout.group(1)), matchout.group(2)\\r\\n if i<N-1:\\r\\n output = '\\\\n'.join([output] + lines[i:])\\r\\n\\r\\n block.append((OUTPUT, output))\\r\\n break\\r\\n\\r\\n return block\",\n \"def __init__(self, text, *contexts):\\n\\n self.context = {}\\n for context in contexts:\\n self.context.update(context)\\n\\n buffered = ''\\n\\n tokens = re.split(r\\\"(?s)({{.*?}})\\\", text)\\n for token in tokens:\\n if token.startswith(\\\"{{\\\"):\\n # An expression to evaluate.\\n buffered += self.context[token[2:-2].strip()]\\n else:\\n # Literal content, if not empty, output it.\\n if token:\\n buffered += token\\n\\n self.buffered = buffered\",\n \"def update(blockstring):\\n with BLOCK_LOCK:\\n for block in blockstring.split('|'):\\n name, values = parse(block)\\n BLOCKS[name] = values\",\n \"async def parse(self, raw: str) -> dict:\",\n \"def structure_parse(source):\\r\\n return structure_grammar().parseString(source)\",\n \"def _parse_kvfmt(self, fmtlist):\\n t_fmt = self.__class__._T_FMT\\n t_prefix = self.__class__._T_PREFIX\\n parsed_list = []\\n field_id = 1\\n\\n for entry in fmtlist:\\n name = entry[0]\\n fmt = entry[1]\\n parsed_field = {}\\n parsed_field['name'] = name\\n if isinstance(fmt, str):\\n ptr = 0\\n m_prefix = t_prefix.match(fmt)\\n if m_prefix:\\n ptr += _get_length_of_match(m_prefix)\\n parsed_field['prefix'] = m_prefix.group(1)\\n # check for optional nested structure start (required if the field is also repeated)\\n if m_prefix.group(2) and len(entry) > 2:\\n parsed_field['field_id'] = field_id\\n parsed_field['field_type'] = 'a'\\n parsed_field['subcontent'] = self._parse_kvfmt(entry[2])\\n field_id += 1\\n parsed_list.append(parsed_field)\\n continue\\n elif m_prefix.group(2):\\n raise BadFormatString('Nested field type used without specifying field format.')\\n m_fmt = t_fmt.match(fmt[ptr:])\\n if m_fmt:\\n ptr += _get_length_of_match(m_fmt)\\n resolved_fmt_char = None\\n # fmt is an alias\\n if m_fmt.group(2):\\n resolved_fmt_char = m_fmt.group(2)\\n parsed_field['field_type'] = self.__class__\\\\\\n .FIELD_ALIAS[m_fmt.group(2)]\\n # fmt is an actual field type\\n elif m_fmt.group(1):\\n resolved_fmt_char = m_fmt.group(1)\\n parsed_field['field_type'] = m_fmt.group(1)\\n parsed_field['field_id'] = field_id\\n # only skip type (`x') is allowed for copying in key-value mode\\n if m_fmt.group(3) and resolved_fmt_char == 'x':\\n repeats = int(m_fmt.group(3))\\n parsed_field['repeat'] = repeats\\n field_id += repeats\\n elif m_fmt.group(3):\\n raise BadFormatString('Field copying is not allowed in key-value format list.')\\n else:\\n field_id += 1\\n else:\\n raise BadFormatString('Invalid type for field \\\"{0}\\\"'.format(name))\\n if len(fmt) != ptr:\\n self.logger.warning('Extra content found after the type string of %s.', name)\\n else:\\n # Hard-code the empty prefix because we don't support copying\\n parsed_field['prefix'] = ''\\n parsed_field['field_id'] = field_id\\n parsed_field['field_type'] = 'a'\\n parsed_field['subcontent'] = self._parse_kvfmt(fmt)\\n field_id += 1\\n parsed_list.append(parsed_field)\\n return parsed_list\",\n \"def htmlFormat(self, text):\\n txt_blocks = self._parser_block(lex_block(text))\\n\\n #XXX: Maybe there is a better solution, but I doubt\\n #The problem is nested escapestyles\\n escape_d = {}\\n escapes = re.compile('\\\\[escapestyle\\\\] \\\\s* (?P<inner>(.|\\\\s)*?) \\\\s* \\\\[/escapestyle\\\\]', re.VERBOSE)\\n def rem(mo):\\n h_code = hash(mo.group(0))\\n escape_d[h_code] = mo.group('inner')\\n return '(<!%s!>)' % h_code\\n txt_blocks = escapes.sub(rem, txt_blocks)\\n\\n txt_style = parser_style(lex_style(txt_blocks))\\n\\n eess = re.compile('\\\\(<!(-?\\\\d+)!>\\\\)')\\n def back(mo):\\n val = int(mo.group(1))\\n if escape_d.has_key(val):\\n return escape_d[val]\\n return mo.group(0)\\n txt_style = eess.sub(back, txt_style)\\n\\n return txt_style\",\n \"def parse_template(string):\\n count = 0\\n list1 = []\\n for character in string:\\n count = count + 1\\n if character == \\\"{\\\":\\n end = string.find(\\\"}\\\", count)\\n s_strg = string[count:end]\\n list1.append(s_strg)\\n string = string.replace(s_strg, \\\"\\\", 1)\\n count = count - len(s_strg)\\n\\n subs = tuple(list1)\\n\\n return(string, subs)\\n print(subs)\",\n \"def format_blocks(self):\\n\\n block_text = []\\n for el, text in self._block_text.items():\\n self.soft_break(el, text)\\n content = ''.join(text)\\n if content:\\n block_text.append((content, self.additional_context + self.construct_selector(el)))\\n return block_text\",\n \"def parser(block):\\n def unwrap(result):\\n tupe, value = result\\n if tupe & ParserResult.DONE:\\n value, chunk, last = value\\n return (ParserResult.from_done(value.value, chunk, last) if value.error is None else\\n ParserResult.from_error(value.error))\\n elif tupe & ParserResult.PARTIAL:\\n return ParserResult.from_partial(Parser(lambda chunk, last: unwrap(value(chunk, last))))\\n else:\\n return result\\n do_block = do(Parser)(block)\\n return F.wraps(block)(\\n lambda *args, **kwargs: Parser(\\n lambda chunk, last: unwrap(do_block(*args, **kwargs)(chunk, last))))\",\n \"def parse_template(self):\\n for line in self.raw_template.split(\\\"\\\\n\\\"):\\n line = line.strip()\\n if line.startswith('#m3'):\\n key, val = line[3:].strip().split('=', 1)\\n key = key.strip()\\n val = val.strip()\\n self.variables[key] = val\\n\\n for fitem in self.finditem.finditer(self.raw_template):\\n fgrp = fitem.groups()\\n categ = fgrp[0]\\n name = fgrp[1]\\n rest_str = fgrp[2]\\n rest = {} # type: dict\\n for item in rest_str.split('|'):\\n item = item.strip()\\n if item:\\n key, val = item.split('=')\\n rest[key] = val\\n\\n self.data[name] = (categ, rest)\",\n \"def _chunk(self, string):\\n #~ a = r'\\\\**\\\\s*(?:a\\\\.?|\\\\(?a\\\\))' #SMA option dot now required\\n a = r'\\\\**\\\\s*(?:a\\\\.|\\\\(?a\\\\))'\\n b = r'\\\\**\\\\s*(?:b\\\\.|\\\\(?b\\\\))'\\n c = r'\\\\**\\\\s*(?:c\\\\.|\\\\(?c\\\\))'\\n d = r'\\\\**\\\\s*(?:d\\\\.|\\\\(?d\\\\))'\\n e = r'\\\\**\\\\s*(?:e\\\\.|\\\\(?e\\\\))'\\n l = r'\\\\s+.+?\\\\s+'\\n # last option trucated here \\\\/\\n regex = r\\\"({a}{line}{b}{line}{c}{line}(?:{d}{line})(?:{e}.*?)?)\\\\n?\\\".format(\\n a=a, b=b, c=c, d=d, e=e, line=l, \\n )\\n p = re.compile(regex, re.IGNORECASE | re.DOTALL)\\n\\n self._tokens = p.split(string)\",\n \"def parseString(self, s):\\n\\n t0 = time.time()\\n lines = self.getline(s)\\n lineno = 0\\n for l in lines:\\n lineno += 1\\n logging.log(10, \\\"raw line %05d: %s\\\" % (lineno, l))\\n if len(l) == 0 or l[0] == '#':\\n continue\\n \\n if l.startswith('typedef'):\\n lidx = self.parseTypedef(l, lines)\\n lineno += lidx\\n else:\\n # Not a typedef -- see if the 1st token matches a known\\n # structure name. If not, create a new variable.\\n sidx = l.find(' ')\\n if sidx > 0:\\n name = l[0:sidx]\\n struct = self.structs.get(name.upper(), None)\\n if struct:\\n struct.parseOne(l)\\n else:\\n v = YPFVar(l, debug=0)\\n if v.name in self.vars:\\n newValue = v.value\\n oldValue = self.vars[v.name].value\\n if newValue != oldValue:\\n print(\\\"Variable %s is being defined with a new value, overwriting it. old=%s, new=%s\\\" \\n % (v.name, oldValue, newValue))\\n self.vars[v.name] = v\",\n \"def parse_template(template):\\n field_name = None\\n field_value = []\\n\\n for line in template.strip().split('\\\\n') + ['end:']:\\n if line.startswith('#'):\\n continue\\n match = RE_TEMPLATE_FIELD_LINE.match(line)\\n if match:\\n if field_name is not None:\\n yield (field_name, '\\\\n'.join(field_value).strip())\\n elif len(field_value) > 0:\\n logging.warning('Ignoring lines: %r', field_value)\\n\\n field_name = match.group(1)\\n field_value = [match.group(2)]\\n else:\\n field_value.append(line)\",\n \"def reformat(refstr, listed=False):\\n \\n formatted = ' '.join(refstr.split()).replace(r'\\\\newblock', '\\\\n\\\\\\\\newblock').splitlines()\\n if listed:\\n return formatted\\n else:\\n return '\\\\n'.join(formatted)\",\n \"def _split_by_block(self, path=None,category='meminfo'):\\n \\n with open(path, \\\"r\\\") as f: \\n text = f.read()\\n \\n lst = re.split('zzz', text, flags=re.DOTALL) # to list based on time\\n lst = [x for x in lst if x] # remove empty strings\\n \\\"\\\"\\\"\\n Python 2.x\\n lst = map(lambda v: re.split('(\\\\s\\\\W{1,}\\\\w{3}\\\\s\\\\w{3}\\\\s\\\\w{2,3}\\\\s\\\\d{2}:\\\\d{2}:\\\\d{2}\\\\s\\\\w{3}\\\\s\\\\d{4})', v), lst)\\n \\\"\\\"\\\"\\n lst = [re.split('(\\\\s\\\\W{1,}\\\\w{3}\\\\s\\\\w{3}\\\\s\\\\w{2,3}\\\\s\\\\d{2}:\\\\d{2}:\\\\d{2}\\\\s\\\\w{3}\\\\s\\\\d{4})', v) for v in lst]\\n block_dict = []\\n for v in lst:\\n timestamp=v[1]\\n value=v[2]\\n _d = [{'timestamp':timestamp, \\n 'category': category, \\n 'sub_category': '',\\n 'key': 'raw_block',\\n 'value': value}]\\n block_dict.extend(_d)\\n \\n return block_dict\",\n \"def reformat_block(specline, values):\\n data = reformat_spec_line(specline)\\n desc = '\\\\n'.join(values)\\n data.append(desc)\\n return data\",\n \"def build_block_parser(md_instance, **kwargs):\\r\\n parser = BlockParser(md_instance)\\r\\n parser.blockprocessors['empty'] = EmptyBlockProcessor(parser)\\r\\n parser.blockprocessors['indent'] = ListIndentProcessor(parser)\\r\\n parser.blockprocessors['code'] = CodeBlockProcessor(parser)\\r\\n parser.blockprocessors['hashheader'] = HashHeaderProcessor(parser)\\r\\n parser.blockprocessors['setextheader'] = SetextHeaderProcessor(parser)\\r\\n parser.blockprocessors['hr'] = HRProcessor(parser)\\r\\n parser.blockprocessors['olist'] = OListProcessor(parser)\\r\\n parser.blockprocessors['ulist'] = UListProcessor(parser)\\r\\n parser.blockprocessors['quote'] = BlockQuoteProcessor(parser)\\r\\n parser.blockprocessors['paragraph'] = ParagraphProcessor(parser)\\r\\n return parser\",\n \"def parse(intLanguageName, content, formatDetails, threadstop):\\r\\n\\r\\n if len(content) == 0:\\r\\n return buildSyntaxNode([], 0, \\\"text\\\")\\r\\n\\r\\n if formatDetails.noFormat:\\r\\n return buildSyntaxNode([buildSyntaxNode(content, 0, \\\"plainText\\\")],\\r\\n 0, \\\"text\\\")\\r\\n\\r\\n baseDict = _buildBaseDict(formatDetails=formatDetails)\\r\\n\\r\\n## _prof.start()\\r\\n try:\\r\\n print content\\r\\n print baseDict\\r\\n t = text.parseString(content, parseAll=True, baseDict=baseDict,\\r\\n threadstop=threadstop)\\r\\n print t\\r\\n t = buildSyntaxNode(t, 0, \\\"text\\\")\\r\\n print t\\r\\n\\r\\n finally:\\r\\n## _prof.stop()\\r\\n pass\\r\\n\\r\\n return t\",\n \"def __ParseBlock(self, ast):\\n for node in ast:\\n node_name = node[0]\\n node_value = node[1]\\n if node_name == 'statement':\\n self.__ParseStatement(node_value)\\n else:\\n logging.info('Unknown AST node in message block: %s' % (node_name))\",\n \"def makeBlock(tag):\\n return {\\\"t\\\":\\\"RawBlock\\\",\\\"c\\\":[\\\"html\\\",tag]}\",\n \"def read_fmt(bib_name, bib_file):\\n cache_name, formatted_cache_name = _cache_name(bib_name, bib_file)\\n\\n try:\\n meta_data, formatted_entries = cache.read_global(formatted_cache_name)\\n except:\\n raise cache.CacheMiss()\\n\\n # raise a cache miss if the modification took place after the caching\\n modified_time = os.path.getmtime(bib_file)\\n if modified_time > meta_data[\\\"cache_time\\\"]:\\n raise cache.CacheMiss()\\n\\n # validate the version and format strings are still valid\\n if (meta_data[\\\"version\\\"] != _VERSION or\\n any(meta_data[s] != get_setting(\\\"cite_\\\" + s)\\n for s in [\\\"panel_format\\\", \\\"autocomplete_format\\\"])):\\n print(\\\"Formatting string has changed, updating cache...\\\")\\n # read the base information from the unformatted cache\\n current_time, bib_entries = cache.read_global(cache_name)\\n # format and cache the entries\\n formatted_entries = _create_formatted_entries(formatted_cache_name,\\n bib_entries,\\n current_time)\\n\\n return formatted_entries\",\n \"def _parse_data(self):\\n current_block = []\\n current_section = \\\"docstring\\\"\\n\\n # if we get a line that starts with #, this is a new comment or\\n # part of a block comment. Otherwise, it means the current block\\n # comment has ended.\\n\\n for this in self.data:\\n # Beginning of a new section at top level\\n if self.regex_section.findall(this):\\n name = self.regex_section.findall(this)[0]\\n current_section = name.strip(\\\":\\\")\\n self.sections[current_section] = \\\"\\\".join(current_block)\\n current_block = []\\n current_section = None\\n elif this.startswith(\\\"#\\\"): # a comment at top level\\n current_block.append(this)\\n elif this.strip() == \\\"\\\": # an empty line\\n # this was the main comment, or an isolated comment\\n current_block = []\\n else: # a non-empty line to skip\\n current_block = []\\n\\n for key in self._get_expected_sections():\\n if key not in self.sections.keys():\\n logger.warning(\\\"section %s not dealt by the parsing function\\\" % key)\",\n \"def tokens(self, format_string):\\n if format_string not in self.format_string_cache:\\n tokens = list(re.finditer(self.reg_ex, format_string))\\n self.format_string_cache[format_string] = tokens\\n return self.format_string_cache[format_string]\",\n \"def parse(source):\\n\\n def blockify(source):\\n\\n \\\"\\\"\\\"This is the first step, where the source is broken into paragraphs,\\n based on blank lines in the source. The output is a list of strings.\\n Each string is a paragraph. Newlines (with any trailing whitespace)\\n inside paragraphs are converted to single spaces.\\\"\\\"\\\"\\n\\n paragraphs = [\\\"\\\"]\\n for line in source.strip().split(\\\"\\\\n\\\"):\\n line = line.strip()\\n if line: paragraphs[-1] += line + \\\" \\\"\\n elif paragraphs[-1]: paragraphs.append(\\\"\\\")\\n\\n return paragraphs\\n\\n def subparse(block):\\n\\n \\\"\\\"\\\"This function parses a single paragraph of source, as returned by\\n the `blockify` function. This finds the individual verses within the\\n given paragraph. It returns an AST for the paragraph, as previously\\n described.\\n\\n TODO: Validate the input based on the AST.\\n \\\"\\\"\\\"\\n\\n verses = []\\n context = None\\n for char in block:\\n\\n if char == \\\"[\\\":\\n if verses: verses[-1][\\\"quran\\\"] = verses[-1][\\\"quran\\\"].strip()\\n verses.append({\\\"surah\\\": \\\"\\\", \\\"verse\\\": \\\"\\\", \\\"quran\\\": \\\"\\\"})\\n context = \\\"surah\\\"\\n elif char == \\\":\\\" and context == \\\"surah\\\":\\n verses[-1][\\\"surah\\\"] = int(verses[-1][\\\"surah\\\"])\\n context = \\\"verse\\\"\\n elif char == \\\"]\\\":\\n verses[-1][\\\"verse\\\"] = int(verses[-1][\\\"verse\\\"])\\n context = \\\"quran\\\"\\n else: verses[-1][context] += char\\n\\n verses[-1][\\\"quran\\\"] = verses[-1][\\\"quran\\\"].strip()\\n return verses\\n\\n return [ subparse(block) for block in blockify(source) ]\",\n \"def _parse(self, content):\\n os.environ['ASTER_VERSION_DIR'] = self.dirn\\n cfg = {}\\n self._content = content\\n for l in split_endlines(self._content):\\n if not re.search('^[ ]*#', l):\\n try:\\n typ, nam, ver, val = l.split('|')\\n #print '========>', typ, '//', nam, '//', ver, '//', val\\n typ = re.sub('^[ ]*', '', re.sub('[ ]*$', '', typ)).strip()\\n val = re.sub('^[ ]*', '', re.sub('[ ]*$', '', val)).strip()\\n if val != '':\\n val = osp.expandvars(val)\\n if cfg.has_key(typ):\\n cfg[typ].append(val)\\n else:\\n cfg[typ] = [val]\\n except ValueError:\\n pass\\n return cfg\",\n \"def highlightBlock(self, text):\\n for format_, expression in self.rules:\\n # get first match\\n index = expression.indexIn(text)\\n while index >= 0:\\n length = expression.matchedLength()\\n self.setFormat(index, length, format_)\\n # jump to next match\\n index = expression.indexIn(text, index + length)\\n self.setCurrentBlockState(0)\",\n \"def parse_format(var_sample):\\n # ugh\\n ret = []\\n # Parsing format information\\n # Need to see what all these could be...\\n if None in var_sample[\\\"GT\\\"]:\\n ret.append(3)\\n elif var_sample[\\\"GT\\\"] == (0, 0):\\n ret.append(0)\\n elif var_sample[\\\"GT\\\"] == (0, 1):\\n ret.append(1)\\n elif var_sample[\\\"GT\\\"] == (1, 1):\\n ret.append(2)\\n \\n ret.extend([var_sample[\\\"GQ\\\"] if var_sample[\\\"GQ\\\"] is not None else 0,\\n var_sample[\\\"OV\\\"],\\n var_sample[\\\"DP\\\"], # be careful these aren't '.'\\n #split where _r is ref-allele and _a is alt-allele\\n var_sample[\\\"AD\\\"][0],\\n var_sample[\\\"AD\\\"][1],\\n var_sample[\\\"PDP\\\"],\\n var_sample[\\\"PAD\\\"][0],\\n var_sample[\\\"PAD\\\"][1],\\n var_sample[\\\"US\\\"][0],\\n var_sample[\\\"US\\\"][1],\\n var_sample[\\\"DS\\\"][0],\\n var_sample[\\\"DS\\\"][1],\\n var_sample[\\\"UC\\\"][0],\\n var_sample[\\\"UC\\\"][1],\\n var_sample[\\\"DC\\\"][0],\\n var_sample[\\\"DC\\\"][1],\\n var_sample[\\\"UDC\\\"][0],\\n var_sample[\\\"UDC\\\"][1],\\n var_sample[\\\"UCC\\\"][0],\\n var_sample[\\\"UCC\\\"][1],\\n var_sample[\\\"DDC\\\"][0],\\n var_sample[\\\"DDC\\\"][1],\\n var_sample[\\\"DCC\\\"][0],\\n var_sample[\\\"DCC\\\"][1],\\n var_sample[\\\"UMO\\\"][0],\\n var_sample[\\\"UMO\\\"][1],\\n var_sample[\\\"DMO\\\"][0],\\n var_sample[\\\"DMO\\\"][1],\\n var_sample[\\\"UXO\\\"][0],\\n var_sample[\\\"UXO\\\"][1],\\n var_sample[\\\"DXO\\\"][0],\\n var_sample[\\\"DXO\\\"][1],\\n var_sample[\\\"NR\\\"][0],\\n var_sample[\\\"NR\\\"][1],\\n var_sample[\\\"MO\\\"][0],\\n var_sample[\\\"MO\\\"][1],\\n var_sample[\\\"XO\\\"][0],\\n var_sample[\\\"XO\\\"][1],\\n var_sample[\\\"XC\\\"][0],\\n var_sample[\\\"XC\\\"][1],\\n var_sample[\\\"AC\\\"][0],\\n var_sample[\\\"AC\\\"][1],\\n var_sample[\\\"MC\\\"][0],\\n var_sample[\\\"MC\\\"][1],\\n var_sample[\\\"EC\\\"][0],\\n var_sample[\\\"EC\\\"][1],\\n var_sample[\\\"PL\\\"][0] if var_sample[\\\"PL\\\"][0] is not None else 0,\\n var_sample[\\\"PL\\\"][1] if var_sample[\\\"PL\\\"][0] is not None else 0,\\n var_sample[\\\"PL\\\"][2] if var_sample[\\\"PL\\\"][0] is not None else 0])\\n return ret\\n #END\",\n \"def parse(cls, source):\\n lines = list(cls._strip_lines(source.splitlines()))\\n offset = 0\\n blocks = {}\\n while offset < len(lines):\\n # Scan until we find a block.\\n while offset < len(lines):\\n header_match = re.match(r\\\"---+ (.*) ---+\\\", lines[offset])\\n offset += 1\\n if header_match:\\n header = header_match.group(1)\\n break\\n config = {}\\n while offset < len(lines):\\n config_match = re.match(r\\\"^%\\\\s*([\\\\w_]+)\\\\s*:(.*)$\\\", lines[offset])\\n if not config_match:\\n break\\n config[config_match.group(1).strip()] = config_match.group(2).strip()\\n offset += 1\\n block_lines = []\\n while offset < len(lines) and (re.match(r\\\"---+ (.*) ---+\\\", lines[offset]) == None):\\n block_lines.append(lines[offset])\\n offset += 1\\n if not header in blocks:\\n blocks[header] = []\\n blocks[header].append(SpecTestBlock.parse(header, config, block_lines))\\n return ParsedSpecTest(blocks)\",\n \"def highlightBlock(self, text):\\n # Do other syntax formatting\\n for expression, nth, format in self.rules:\\n index = expression.indexIn(text, 0)\\n format = self.styles[format]\\n\\n while index >= 0:\\n # We actually want the index of the nth match\\n index = expression.pos(nth)\\n length = len(expression.cap(nth))\\n self.setFormat(index, length, format)\\n index = expression.indexIn(text, index + length)\\n\\n self.setCurrentBlockState(0)\\n\\n # Do multi-line strings\\n in_multiline = self.match_multiline(text, *self.tri_single)\\n if not in_multiline:\\n in_multiline = self.match_multiline(text, *self.tri_double)\",\n \"def stringToBlock(strBlock):\\r\\n blocksplit = strBlock.split(';')\\r\\n block = Blockchain(int(blocksplit[0]), blocksplit[1], int(blocksplit[2]), int(blocksplit[3]) ,blocksplit[4])\\r\\n return block\",\n \"def highlightBlock(self, string):\\n prev_data = self.currentBlock().previous().userData()\\n if prev_data is not None:\\n self._lexer._saved_state_stack = prev_data.syntax_stack\\n elif hasattr(self._lexer, '_saved_state_stack'):\\n del self._lexer._saved_state_stack\\n\\n # Lex the text using Pygments\\n index = 0\\n for token, text in self._lexer.get_tokens(string):\\n length = len(text)\\n self.setFormat(index, length, self._get_format(token))\\n index += length\\n\\n if hasattr(self._lexer, '_saved_state_stack'):\\n data = PygmentsBlockUserData(\\n syntax_stack=self._lexer._saved_state_stack)\\n self.currentBlock().setUserData(data)\\n # Clean up for the next go-round.\\n del self._lexer._saved_state_stack\",\n \"def _hash_html_blocks(self, text, raw=False):\\r\\n if '<' not in text:\\r\\n return text\\r\\n\\r\\n # Pass `raw` value into our calls to self._hash_html_block_sub.\\r\\n hash_html_block_sub = _curry(self._hash_html_block_sub, raw=raw)\\r\\n\\r\\n # First, look for nested blocks, e.g.:\\r\\n # <div>\\r\\n # <div>\\r\\n # tags for inner block must be indented.\\r\\n # </div>\\r\\n # </div>\\r\\n #\\r\\n # The outermost tags must start at the left margin for this to match, and\\r\\n # the inner nested divs must be indented.\\r\\n # We need to do this before the next, more liberal match, because the next\\r\\n # match will start at the first `<div>` and stop at the first `</div>`.\\r\\n text = self._strict_tag_block_re.sub(hash_html_block_sub, text)\\r\\n\\r\\n # Now match more liberally, simply from `\\\\n<tag>` to `</tag>\\\\n`\\r\\n text = self._liberal_tag_block_re.sub(hash_html_block_sub, text)\\r\\n\\r\\n # Special case just for <hr />. It was easier to make a special\\r\\n # case than to make the other regex more complicated.\\r\\n if \\\"<hr\\\" in text:\\r\\n _hr_tag_re = _hr_tag_re_from_tab_width(self.tab_width)\\r\\n text = _hr_tag_re.sub(hash_html_block_sub, text)\\r\\n\\r\\n # Special case for standalone HTML comments:\\r\\n if \\\"<!--\\\" in text:\\r\\n start = 0\\r\\n while True:\\r\\n # Delimiters for next comment block.\\r\\n try:\\r\\n start_idx = text.index(\\\"<!--\\\", start)\\r\\n except ValueError:\\r\\n break\\r\\n try:\\r\\n end_idx = text.index(\\\"-->\\\", start_idx) + 3\\r\\n except ValueError:\\r\\n break\\r\\n\\r\\n # Start position for next comment block search.\\r\\n start = end_idx\\r\\n\\r\\n # Validate whitespace before comment.\\r\\n if start_idx:\\r\\n # - Up to `tab_width - 1` spaces before start_idx.\\r\\n for i in range(self.tab_width - 1):\\r\\n if text[start_idx - 1] != ' ':\\r\\n break\\r\\n start_idx -= 1\\r\\n if start_idx == 0:\\r\\n break\\r\\n # - Must be preceded by 2 newlines or hit the start of\\r\\n # the document.\\r\\n if start_idx == 0:\\r\\n pass\\r\\n elif start_idx == 1 and text[0] == '\\\\n':\\r\\n start_idx = 0 # to match minute detail of Markdown.pl regex\\r\\n elif text[start_idx-2:start_idx] == '\\\\n\\\\n':\\r\\n pass\\r\\n else:\\r\\n break\\r\\n\\r\\n # Validate whitespace after comment.\\r\\n # - Any number of spaces and tabs.\\r\\n while end_idx < len(text):\\r\\n if text[end_idx] not in ' \\\\t':\\r\\n break\\r\\n end_idx += 1\\r\\n # - Must be following by 2 newlines or hit end of text.\\r\\n if text[end_idx:end_idx+2] not in ('', '\\\\n', '\\\\n\\\\n'):\\r\\n continue\\r\\n\\r\\n # Escape and hash (must match `_hash_html_block_sub`).\\r\\n html = text[start_idx:end_idx]\\r\\n if raw and self.safe_mode:\\r\\n html = self._sanitize_html(html)\\r\\n key = _hash_text(html)\\r\\n self.html_blocks[key] = html\\r\\n text = text[:start_idx] + \\\"\\\\n\\\\n\\\" + key + \\\"\\\\n\\\\n\\\" + text[end_idx:]\\r\\n\\r\\n if \\\"xml\\\" in self.extras:\\r\\n # Treat XML processing instructions and namespaced one-liner\\r\\n # tags as if they were block HTML tags. E.g., if standalone\\r\\n # (i.e. are their own paragraph), the following do not get\\r\\n # wrapped in a <p> tag:\\r\\n # <?foo bar?>\\r\\n #\\r\\n # <xi:include xmlns:xi=\\\"http://www.w3.org/2001/XInclude\\\" href=\\\"chapter_1.md\\\"/>\\r\\n _xml_oneliner_re = _xml_oneliner_re_from_tab_width(self.tab_width)\\r\\n text = _xml_oneliner_re.sub(hash_html_block_sub, text)\\r\\n\\r\\n return text\",\n \"def parsePercentExpression(literal, format):\\n\\tmat = _getREForPercentExpression(format).match(literal)\\n\\tif not mat:\\n\\t\\traise ValueError(\\\"'%s' cannot be parsed using format '%s'\\\"%(\\n\\t\\t\\tliteral, format))\\n\\treturn mat.groupdict()\",\n \"def _decode_block_string(block_string):\\n assert isinstance(block_string, str)\\n\\n ops = block_string.split('_')\\n options = {}\\n for op in ops:\\n splits = re.split(r'(\\\\d.*)', op)\\n if len(splits) >= 2:\\n key, value = splits[:2]\\n options[key] = value\\n\\n # Check stride\\n assert (('s' in options and len(options['s']) == 1) or\\n (len(options['s']) == 2 and options['s'][0] == options['s'][1]))\\n\\n return BlockArgs(\\n kernel_size=int(options['k']),\\n num_repeat=int(options['r']),\\n input_filters=int(options['i']),\\n output_filters=int(options['o']),\\n expand_ratio=int(options['e']),\\n id_skip=('noskip' not in block_string),\\n se_ratio=float(options['se']) if 'se' in options else None,\\n stride=[int(options['s'][0])])\",\n \"def _decode_block_string(block_string):\\n assert isinstance(block_string, str)\\n\\n ops = block_string.split('_')\\n options = {}\\n for op in ops:\\n splits = re.split(r'(\\\\d.*)', op)\\n if len(splits) >= 2:\\n key, value = splits[:2]\\n options[key] = value\\n\\n # Check stride\\n assert (('s' in options and len(options['s']) == 1) or\\n (len(options['s']) == 2 and options['s'][0] == options['s'][1]))\\n\\n return BlockArgs(\\n kernel_size=int(options['k']),\\n num_repeat=int(options['r']),\\n input_filters=int(options['i']),\\n output_filters=int(options['o']),\\n expand_ratio=int(options['e']),\\n id_skip=('noskip' not in block_string),\\n se_ratio=float(options['se']) if 'se' in options else None,\\n stride=[int(options['s'][0])])\",\n \"def structParser(lines):\\n blc = 0 #blank line counter\\n bc = 0 #block counter\\n struct = []\\n record = False\\n for line in lines:\\n if len(line) == 1:\\n blc +=1\\n record = False\\n if blc == 2:\\n blc = 0\\n bc +=1\\n record = True\\n if record and bc < 3:\\n struct.append(line)\\n\\n yield struct\",\n \"def parse(s):\\n return s\",\n \"def split_blocks(strings):\\n blocks = [StringList()]\\n for item in strings.xitems(): # (source, offset, value)\\n if item[2].strip():\\n blocks[-1].append(item[2], source=item[0], offset=item[1])\\n elif len(blocks[-1]):\\n blocks.append(StringList())\\n # remove the last block if empty\\n if len(blocks[-1]) == 0:\\n del blocks[-1]\\n return blocks\",\n \"def __parse_blocks_pass(self):\\n\\n self.stack = [DocumentStackToken()]\\n\\n self.tokenized_document = []\\n token_to_use = self.source_provider.get_next_line()\\n did_start_close = False\\n did_started_close = False\\n requeue = []\\n ignore_link_definition_start = False\\n POGGER.debug(\\\"---$---\\\", token_to_use)\\n POGGER.debug(\\\"---\\\")\\n self.__parse_properties.pragma_lines = {}\\n line_number = 1\\n try:\\n (\\n token_to_use,\\n line_number,\\n requeue,\\n ) = self.__process_front_matter_header_if_present(\\n token_to_use, line_number, requeue\\n )\\n did_start_close = token_to_use is None\\n keep_on_going = True\\n while keep_on_going:\\n POGGER.debug(\\\"next-line>>$\\\", token_to_use)\\n POGGER.debug(\\\"stack>>$\\\", self.stack)\\n POGGER.debug(\\\"current_block>>$\\\", self.stack[-1])\\n POGGER.debug(\\\"line_number>>$\\\", line_number)\\n POGGER.debug(\\\"---\\\")\\n\\n position_marker = PositionMarker(line_number, 0, token_to_use)\\n parser_state = ParserState(\\n self.stack,\\n self.tokenized_document,\\n TokenizedMarkdown.__close_open_blocks,\\n self.__handle_blank_line,\\n )\\n if did_start_close:\\n POGGER.debug(\\\"\\\\n\\\\ncleanup\\\")\\n\\n was_link_definition_started_before_close = self.stack[\\n -1\\n ].was_link_definition_started\\n\\n did_started_close = True\\n (\\n tokens_from_line,\\n requeue_line_info,\\n ) = TokenizedMarkdown.__close_open_blocks(\\n parser_state,\\n self.tokenized_document,\\n include_block_quotes=True,\\n include_lists=True,\\n caller_can_handle_requeue=True,\\n was_forced=True,\\n )\\n if tokens_from_line and not self.tokenized_document:\\n self.tokenized_document.extend(tokens_from_line)\\n\\n if not (requeue_line_info and requeue_line_info.lines_to_requeue):\\n keep_on_going = False\\n else:\\n assert was_link_definition_started_before_close\\n assert not requeue_line_info.lines_to_requeue[0]\\n\\n del requeue_line_info.lines_to_requeue[0]\\n line_number -= 1\\n\\n did_start_close = False\\n tokens_from_line = None\\n else:\\n POGGER.debug(\\\">>>>$\\\", self.tokenized_document)\\n\\n if not token_to_use or not token_to_use.strip():\\n POGGER.debug(\\\"call __parse_blocks_pass>>handle_blank_line\\\")\\n (\\n tokens_from_line,\\n requeue_line_info,\\n ) = self.__handle_blank_line(\\n parser_state,\\n token_to_use,\\n from_main_transform=True,\\n position_marker=position_marker,\\n )\\n else:\\n POGGER.debug(\\\"\\\\n\\\\nnormal lines\\\")\\n (\\n tokens_from_line,\\n _,\\n _,\\n requeue_line_info,\\n _,\\n ) = ContainerBlockProcessor.parse_line_for_container_blocks(\\n parser_state,\\n position_marker,\\n ignore_link_definition_start,\\n self.__parse_properties,\\n None,\\n )\\n\\n POGGER.debug(\\\"<<<<$\\\", self.tokenized_document)\\n\\n if keep_on_going:\\n line_number, ignore_link_definition_start = TokenizedMarkdown.__xx(\\n line_number, requeue_line_info, requeue\\n )\\n\\n POGGER.debug(\\n \\\"---\\\\nbefore>>$\\\",\\n self.tokenized_document,\\n )\\n POGGER.debug(\\\"before>>$\\\", tokens_from_line)\\n if tokens_from_line:\\n self.tokenized_document.extend(tokens_from_line)\\n POGGER.debug(\\n \\\"after>>$\\\",\\n self.tokenized_document,\\n )\\n if requeue:\\n POGGER.debug(\\\"requeue>>$\\\", requeue)\\n POGGER.debug(\\\"---\\\")\\n\\n (\\n token_to_use,\\n did_start_close,\\n did_started_close,\\n ) = self.__determine_next_token_process(\\n requeue, did_start_close, did_started_close\\n )\\n except AssertionError as this_exception:\\n error_message = f\\\"A project assertion failed on line {line_number} of the current document.\\\"\\n raise BadTokenizationError(error_message) from this_exception\\n\\n if self.__parse_properties.pragma_lines:\\n self.tokenized_document.append(\\n PragmaToken(self.__parse_properties.pragma_lines)\\n )\\n return self.tokenized_document\",\n \"def parse_block(lines):\\n term = {\\\"alt_id\\\": [], \\\"relationship\\\": []}\\n splitkv = re.compile(r\\\"(^[a-zA-Z_]+): (.+)\\\")\\n for line in lines:\\n m = re.search(splitkv, line)\\n # assert m, f\\\"unexpected line: {line}\\\"\\n key = m.group(1)\\n value = m.group(2)\\n if key in [\\\"id\\\", \\\"name\\\", \\\"namespace\\\", \\\"is_obsolete\\\"]:\\n term[key] = value\\n elif key == \\\"alt_id\\\":\\n term[\\\"alt_id\\\"].append(value)\\n elif key == \\\"is_a\\\":\\n goid = value.split(\\\"!\\\")[0].strip()\\n term[\\\"relationship\\\"].append({\\\"type\\\": \\\"is_a\\\", \\\"id\\\": goid})\\n elif key == \\\"relationship\\\":\\n typedef, goid = value.split(\\\"!\\\")[0].strip().split(\\\" \\\")\\n term[\\\"relationship\\\"].append({\\\"type\\\": typedef, \\\"id\\\": goid})\\n return term\",\n \"def parseChunk(self, parent, text):\\r\\n self.parseBlocks(parent, text.split('\\\\n\\\\n'))\",\n \"def __new__(cls, format):\\n self = super(SF_Pattern, cls).__new__(cls)\\n\\n if isinstance(format, bytes):\\n uni_str = format.decode('ISO-8859-1') # decode to unicode\\n trans_str = translate(uni_str) # translate only works with unicode\\n re_fmt = trans_str.encode('ISO-8859-1') # encode back to bytes\\n self._spec = _gbspec\\n else:\\n re_fmt = translate(format)\\n self._spec = _gspec\\n\\n self._format = format\\n self._re = cre = re.compile(re_fmt)\\n\\n if cre.groupindex and len(cre.groupindex) != cre.groups:\\n raise RuntimeError('cannot mix mapped and unmapped specifiers')\\n elif not cre.groupindex:\\n self._retfunc = self._return_tuple\\n self._type = tuple\\n else:\\n self._retfunc = self._return_dict\\n self._type = dict\\n\\n self._casts = self._get_types()\\n\\n return self\",\n \"def _decode_block_str(block_str, depth_multiplier=1.0):\\n assert isinstance(block_str, str)\\n ops = block_str.split('_')\\n block_type = ops[0] # take the block type off the front\\n ops = ops[1:]\\n options = {}\\n noskip = False\\n for op in ops:\\n # string options being checked on individual basis, combine if they grow\\n if op == 'noskip':\\n noskip = True\\n elif op.startswith('n'):\\n # activation fn\\n key = op[0]\\n v = op[1:]\\n if v == 're':\\n value = F.relu\\n elif v == 'r6':\\n value = F.relu6\\n elif v == 'hs':\\n value = hard_swish\\n elif v == 'sw':\\n value = swish\\n else:\\n continue\\n options[key] = value\\n else:\\n # all numeric options\\n splits = re.split(r'(\\\\d.*)', op)\\n if len(splits) >= 2:\\n key, value = splits[:2]\\n options[key] = value\\n\\n # if act_fn is None, the model default (passed to model init) will be used\\n act_fn = options['n'] if 'n' in options else None\\n exp_kernel_size = _parse_ksize(options['a']) if 'a' in options else 1\\n pw_kernel_size = _parse_ksize(options['p']) if 'p' in options else 1\\n fake_in_chs = int(options['fc']) if 'fc' in options else 0 # FIXME hack to deal with in_chs issue in TPU def\\n\\n num_repeat = int(options['r'])\\n # each type of block has different valid arguments, fill accordingly\\n if block_type == 'ir':\\n block_args = dict(\\n block_type=block_type,\\n dw_kernel_size=_parse_ksize(options['k']),\\n exp_kernel_size=exp_kernel_size,\\n pw_kernel_size=pw_kernel_size,\\n out_chs=int(options['c']),\\n exp_ratio=float(options['e']),\\n se_ratio=float(options['se']) if 'se' in options else None,\\n stride=int(options['s']),\\n act_fn=act_fn,\\n noskip=noskip,\\n )\\n elif block_type == 'ds' or block_type == 'dsa':\\n block_args = dict(\\n block_type=block_type,\\n dw_kernel_size=_parse_ksize(options['k']),\\n pw_kernel_size=pw_kernel_size,\\n out_chs=int(options['c']),\\n se_ratio=float(options['se']) if 'se' in options else None,\\n stride=int(options['s']),\\n act_fn=act_fn,\\n pw_act=block_type == 'dsa',\\n noskip=block_type == 'dsa' or noskip,\\n )\\n elif block_type == 'er':\\n block_args = dict(\\n block_type=block_type,\\n exp_kernel_size=_parse_ksize(options['k']),\\n pw_kernel_size=pw_kernel_size,\\n out_chs=int(options['c']),\\n exp_ratio=float(options['e']),\\n fake_in_chs=fake_in_chs,\\n se_ratio=float(options['se']) if 'se' in options else None,\\n stride=int(options['s']),\\n act_fn=act_fn,\\n noskip=noskip,\\n )\\n elif block_type == 'cn':\\n block_args = dict(\\n block_type=block_type,\\n kernel_size=int(options['k']),\\n out_chs=int(options['c']),\\n stride=int(options['s']),\\n act_fn=act_fn,\\n )\\n else:\\n assert False, 'Unknown block type (%s)' % block_type\\n\\n return block_args, num_repeat\",\n \"def find_time(string, format):\\n re_format = format\\n for key, value in six.iteritems(REGEX):\\n re_format = re_format.replace(key, value)\\n matches = re.finditer(re_format, string)\\n for match in matches:\\n try:\\n matchstr = string[slice(*match.span())]\\n dt = datetime.strptime(matchstr, format)\\n except ValueError:\\n continue\\n else:\\n yield dt\",\n \"def change_format_var_parser(text, tracker):\\n param_names = format_var_parser(text)\\n param_vars = {}\\n for param_name in param_names:\\n try:\\n param_vars[param_name] = tracker.get_slot(param_name)\\n except Exception as e:\\n PYTHON_LOGGER.error(\\\"Error to get var name {}: {}\\\".format(param_name, e))\\n return text.format(**param_vars)\",\n \"def _consume(self, block: str) -> None:\\n self.buffer = []\\n self.level = 0\\n last_char = \\\"START\\\"\\n for ch in char_iter(block):\\n if ch in \\\"\\\\n\\\\r\\\":\\n self._check_body_level()\\n self.line_number += 1\\n if self.in_comment:\\n if ch == \\\"\\\\n\\\":\\n self.in_comment = False\\n elif ch in \\\" \\\\n\\\\t\\\\r\\\" and last_char in \\\" \\\\n\\\\t\\\\r\\\":\\n pass\\n elif ch == \\\"#\\\" and not self.in_value and not self.in_var_ref:\\n self.in_comment = True\\n elif not self.in_value and ch == \\\"(\\\":\\n self._open_bracket(ch)\\n elif not self.in_value and ch == \\\")\\\":\\n self._close_bracket(ch)\\n elif ch == '\\\"':\\n self.in_value = not self.in_value\\n self.buffer.append(ch)\\n elif self.level == 1:\\n if (\\n ch == \\\"r\\\"\\n and last_char == \\\"o\\\"\\n and \\\"\\\".join(self.buffer).strip() == \\\"o\\\"\\n ):\\n self.n_ors += 1\\n self.buffer = []\\n elif ch == \\\"$\\\":\\n self.param_buffer = self._parse_operator()\\n self.in_var_ref = True\\n self.buffer = [ch]\\n elif self.in_var_ref and ch in \\\" \\\\n\\\\r\\\\t\\\":\\n self._parse_var()\\n elif ch == \\\">\\\" and last_char == \\\"-\\\":\\n self._parse_label()\\n else:\\n self.buffer.append(ch)\\n else:\\n self.buffer.append(ch)\\n last_char = ch\\n if self.opened:\\n raise ValueError(\\n f\\\"Unmatched opening bracket \\\" f\\\"at line {self.line_number}\\\"\\n )\\n if self.n_ors and not self.is_union:\\n raise ValueError(f'Missing \\\"or\\\" operator ' f\\\"at line {self.line_number}\\\")\",\n \"def subparse(block):\\n\\n verses = []\\n context = None\\n for char in block:\\n\\n if char == \\\"[\\\":\\n if verses: verses[-1][\\\"quran\\\"] = verses[-1][\\\"quran\\\"].strip()\\n verses.append({\\\"surah\\\": \\\"\\\", \\\"verse\\\": \\\"\\\", \\\"quran\\\": \\\"\\\"})\\n context = \\\"surah\\\"\\n elif char == \\\":\\\" and context == \\\"surah\\\":\\n verses[-1][\\\"surah\\\"] = int(verses[-1][\\\"surah\\\"])\\n context = \\\"verse\\\"\\n elif char == \\\"]\\\":\\n verses[-1][\\\"verse\\\"] = int(verses[-1][\\\"verse\\\"])\\n context = \\\"quran\\\"\\n else: verses[-1][context] += char\\n\\n verses[-1][\\\"quran\\\"] = verses[-1][\\\"quran\\\"].strip()\\n return verses\",\n \"def __parse_next(self, buffer):\\n\\t\\ttoken = buffer.read(1)\\n\\t\\t\\n\\t\\t_tell = buffer.tell()\\n\\t\\t# Is it an operator?\\n\\t\\tif token == \\\"/\\\":\\n\\t\\t\\tnum, var = self.__parse_operator(buffer)\\n\\t\\t\\tif num is None:\\n\\t\\t\\t\\tbuffer.seek(_tell - 1)\\n\\t\\t\\t\\treturn \\\"$\\\"\\n\\t\\t\\t\\n\\t\\t\\tif isinstance(var, str):\\n\\t\\t\\t\\treturn var\\n\\t\\t\\t\\n\\t\\t\\tret = (var / num)\\n\\t\\t\\tif isinstance(ret, Range):\\n\\t\\t\\t\\tret = ret.min # XXX is this right?\\n\\t\\t\\tif int(ret) != ret:\\n\\t\\t\\t\\treturn \\\"%.1f\\\" % ret\\n\\t\\t\\treturn str(int(ret))\\n\\t\\t\\n\\t\\tif token == \\\"*\\\":\\n\\t\\t\\tnum, var = self.__parse_operator(buffer)\\n\\t\\t\\tret = var * num\\n\\t\\t\\tif isinstance(ret, float):\\n\\t\\t\\t\\tret = int(round(ret))\\n\\t\\t\\treturn str(ret)\\n\\t\\t\\n\\t\\t# Is it a conditional?\\n\\t\\tif token == \\\"?\\\":\\n\\t\\t\\tbuffer.seek(-1, SEEK_CUR)\\n\\t\\t\\tblocks = self.__parse_conditional(buffer)\\n\\t\\t\\t\\n\\t\\t\\t# Prepare the condition cache\\n\\t\\t\\t# This shouldn't be done here, but anyway...\\n\\t\\t\\tfor condition, value in blocks:\\n\\t\\t\\t\\tcondition.evaluate({})\\n\\t\\t\\t\\tself.conditions.extend(condition.identifiers)\\n\\t\\t\\t\\n\\t\\t\\t# blocks is a list of (condition, value) tuples\\n\\t\\t\\t# We evaluate the paperdoll against each of them\\n\\t\\t\\t# and return when we get a hit\\n\\t\\t\\t\\n\\t\\t\\tfor condition, value in blocks:\\n\\t\\t\\t\\tif condition.evaluate(self.paperdoll):\\n\\t\\t\\t\\t\\treturn value\\n\\t\\t\\t\\n\\t\\t\\treturn\\n\\t\\t\\n\\t\\tif token == \\\"<\\\":\\n\\t\\t\\tbuffer.seek(-1, SEEK_CUR)\\n\\t\\t\\tidentifier = self.__read_block(buffer, startchr=\\\"<\\\", endchr=\\\">\\\")\\n\\t\\t\\ttry:\\n\\t\\t\\t\\tvalue = self.get_variable(identifier)\\n\\t\\t\\t\\treturn SpellString(value).format(self.obj, proxy=self.proxy)\\n\\t\\t\\texcept VariableNotFound:\\n\\t\\t\\t\\treturn \\\"<%s>\\\" % (identifier)\\n\\t\\t\\n\\t\\tif token == \\\"{\\\":\\n\\t\\t\\tbuffer.seek(-1, SEEK_CUR)\\n\\t\\t\\tblock = self.__read_block(buffer, startchr=\\\"{\\\", endchr=\\\"}\\\")\\n\\t\\t\\t\\n\\t\\t\\t# Attempt to read decimals formatting\\n\\t\\t\\tdecimals = 0\\n\\t\\t\\ttoken = buffer.read(1)\\n\\t\\t\\tif token == \\\".\\\":\\n\\t\\t\\t\\tdecimals = self.__read_number(buffer)\\n\\t\\t\\telif token:\\n\\t\\t\\t\\t# Step one char back, only if we are not at the end\\n\\t\\t\\t\\tbuffer.seek(-1, SEEK_CUR)\\n\\t\\t\\t\\n\\t\\t\\tblock = SpellString(block).format(self.obj, proxy=self.proxy, braced=True)\\n\\t\\t\\ttry: # FIXME\\n\\t\\t\\t\\tblock = eval(block)\\n\\t\\t\\t\\tif decimals:\\n\\t\\t\\t\\t\\tblock = round(block, decimals)\\n\\t\\t\\t\\treturn \\\"%g\\\" % (block)\\n\\t\\t\\texcept Exception:\\n\\t\\t\\t\\treturn \\\"[%s]\\\" % (block)\\n\\t\\t\\n\\t\\t# At this point, we need to check for functions and variables\\n\\t\\t# but only if we don't already have a digit\\n\\t\\tif not token.isdigit():\\n\\t\\t\\t_tell = buffer.tell()\\n\\t\\t\\tbuffer.seek(-1, SEEK_CUR)\\n\\t\\t\\tidentifier = self.__read_alpha(buffer)\\n\\t\\t\\t\\n\\t\\t\\tif identifier.lower() in FUNCTIONS:\\n\\t\\t\\t\\targs = self.__parse_function_args(buffer)\\n\\t\\t\\t\\treturn self.formatter.format_function(identifier, args)\\n\\t\\t\\t\\n\\t\\t\\tif identifier.lower() in PAPERDOLL_VALUES:\\n\\t\\t\\t\\treturn self.formatter.format_paperdoll(identifier)\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t# We didn't find any valid identifier\\n\\t\\t\\tif not identifier:\\n\\t\\t\\t\\treturn \\\"$\\\"\\n\\t\\t\\t\\n\\t\\t\\t# Nothing left to check for but booleans\\n\\t\\t\\t# The values get messed with the identifier however, so we need to\\n\\t\\t\\t# look at only the first char\\n\\t\\t\\tif identifier[0] in BOOLEANS:\\n\\t\\t\\t\\tidentifier = identifier[0]\\n\\t\\t\\t\\tbuffer.seek(_tell)\\n\\t\\t\\t\\tvalues = self.__parse_boolean(buffer)\\n\\t\\t\\t\\treturn self.formatter.format_boolean(token, values)\\n\\t\\t\\n\\t\\t# It's probably a variable then\\n\\t\\tbuffer.seek(-1, SEEK_CUR)\\n\\t\\tspell, identifier, effect = self.__parse_macro(buffer)\\n\\t\\t\\n\\t\\tif identifier:\\n\\t\\t\\tspell = int(spell or 0)\\n\\t\\t\\teffect = int(effect or 1)\\n\\t\\t\\t\\n\\t\\t\\tvalue = self.formatter.format_macro(spell, identifier, effect)\\n\\t\\t\\tself.formatter.last_value = value\\n\\t\\t\\treturn str(value)\\n\\t\\telse:\\n\\t\\t\\treturn \\\"$\\\"\\n\\t\\t\\n\\t\\tif not token or token.isspace():\\n\\t\\t\\treturn token\\n\\t\\t\\n\\t\\treturn token\",\n \"def _parseAttributeScanf(self, line, formatting):\\n\\n # multiple entrys\\n if isinstance(formatting, list):\\n for scanf_format in formatting:\\n try:\\n #print \\\"<<<----\\\", scanf_format, line\\n return sscanf(line, scanf_format)\\n except IncompleteCaptureError, e:\\n pass\\n\\n # single entry\\n else:\\n return sscanf(line, formatting)\\n\\n # problem if none of the formats worked\\n raise IncompleteCaptureError(\\\"Format error for %s\\\" % line)\",\n \"def eval_python_blocks(req, body):\\n localsdict = {\\\"request\\\": req}\\n globalsdict = {}\\n\\n old_stdout = sys.stdout\\n old_stderr = sys.stderr\\n\\n try:\\n start = 0\\n while body.find(\\\"<%\\\", start) != -1:\\n start = body.find(\\\"<%\\\")\\n end = body.find(\\\"%>\\\", start) \\n\\n if start != -1 and end != -1:\\n codeblock = body[start+2:end].lstrip()\\n\\n sys.stdout = StringIO.StringIO()\\n sys.stderr = StringIO.StringIO()\\n\\n try:\\n exec codeblock in localsdict, globalsdict\\n\\n except Exception, e:\\n print \\\"ERROR in processing: %s\\\" % e\\n\\n output = sys.stdout.getvalue() + sys.stderr.getvalue()\\n body = body[:start] + output + body[end+2:]\\n\\n finally:\\n sys.stdout = old_stdout\\n sys.stderr = old_stderr\\n\\n return body\",\n \"def _parse(self, line):\\n\\n while True:\\n sign, before, after = _splitbycharset(line, self._checkstr)\\n\\n # End of line\\n if not sign:\\n if self._inside_quote:\\n self._buffer.append(before)\\n elif self._after_equal_sign:\\n self._text(\\\"\\\".join(self._buffer) + before.strip())\\n self._closetag()\\n self._after_equal_sign = False\\n elif not self._inside_attrib:\\n self._buffer.append(before)\\n elif before.strip():\\n self._error(SYNTAX_ERROR, (self._currline, self._currline))\\n break\\n\\n # Special character is escaped\\n elif before.endswith(\\\"\\\\\\\\\\\") and not before.endswith(\\\"\\\\\\\\\\\\\\\\\\\"):\\n self._buffer.append(before + sign)\\n\\n # Equal sign\\n elif sign == \\\"=\\\":\\n # Ignore if followed by \\\"{\\\" (DFTB+ compatibility)\\n if after.lstrip().startswith(\\\"{\\\"): # _oldbefore may already contain the tagname, if the # tagname was followed by an attribute -> append\\n self._oldbefore += before\\n else:\\n self._hsdattrib[common.HSD_ATTRIB_EQUAL] = True\\n self._starttag(before, False)\\n self._after_equal_sign = True\\n\\n # Opening tag by curly brace\\n elif sign == \\\"{\\\":\\n #self._has_child = True\\n self._hsdattrib[common.HSD_ATTRIB_EQUAL] = False\\n self._starttag(before, self._after_equal_sign)\\n self._buffer = []\\n self._after_equal_sign = False\\n\\n # Closing tag by curly brace\\n elif sign == \\\"}\\\":\\n self._text(\\\"\\\".join(self._buffer) + before)\\n self._buffer = []\\n # If 'test { a = 12 }' occurs, curly brace closes two tags\\n if self._after_equal_sign:\\n self._after_equal_sign = False\\n self._closetag()\\n self._closetag()\\n\\n # Closing tag by semicolon\\n elif sign == \\\";\\\" and self._after_equal_sign:\\n self._after_equal_sign = False\\n self._text(before)\\n self._closetag()\\n\\n # Comment line\\n elif sign == \\\"#\\\":\\n self._buffer.append(before)\\n after = \\\"\\\"\\n\\n # Opening attribute specification\\n elif sign == \\\"[\\\":\\n if \\\"\\\".join(self._buffer).strip():\\n self._error(SYNTAX_ERROR, (self._currline, self._currline))\\n self._oldbefore = before\\n self._buffer = []\\n self._inside_attrib = True\\n self._opened_tags.append((\\\"[\\\", self._currline, None, None, None))\\n self._checkstr = _ATTRIB_SPECIALS\\n\\n # Closing attribute specification\\n elif sign == \\\"]\\\":\\n value = \\\"\\\".join(self._buffer) + before\\n self._attrib = value.strip()\\n self._inside_attrib = False\\n self._buffer = []\\n self._opened_tags.pop()\\n self._checkstr = _GENERAL_SPECIALS\\n\\n # Quoting strings\\n elif sign in (\\\"'\\\", '\\\"'):\\n if self._inside_quote:\\n self._checkstr = self._oldcheckstr\\n self._inside_quote = False\\n self._buffer.append(before + sign)\\n self._opened_tags.pop()\\n else:\\n self._oldcheckstr = self._checkstr\\n self._checkstr = sign\\n self._inside_quote = True\\n self._buffer.append(before + sign)\\n self._opened_tags.append(('\\\"', self._currline, None, None, None))\\n\\n # Interrupt\\n elif sign == \\\"<\\\" and not self._after_equal_sign:\\n txtinc = after.startswith(\\\"<<\\\")\\n hsdinc = after.startswith(\\\"<+\\\")\\n if txtinc:\\n self._text(\\\"\\\".join(self._buffer) + before)\\n self._buffer = []\\n self._eventhandler.add_text(self._include_txt(after[2:]))\\n break\\n if hsdinc:\\n self._include_hsd(after[2:])\\n break\\n self._buffer.append(before + sign)\\n\\n else:\\n self._error(SYNTAX_ERROR, (self._currline, self._currline))\\n\\n line = after\",\n \"def parse_template(self, template, **context):\\n required_blocks = [\\\"subject\\\", \\\"body\\\"]\\n optional_blocks = [\\\"text_body\\\", \\\"html_body\\\", \\\"return_path\\\", \\\"format\\\"]\\n\\n if self.template_context:\\n context = dict(self.template_context.items() + context.items())\\n blocks = self.template.render_blocks(template, **context)\\n\\n for rb in required_blocks:\\n if rb not in blocks:\\n raise AttributeError(\\\"Template error: block '%s' is missing from '%s'\\\" % (rb, template))\\n\\n mail_params = {\\n \\\"subject\\\": blocks[\\\"subject\\\"].strip(),\\n \\\"body\\\": blocks[\\\"body\\\"]\\n }\\n for ob in optional_blocks:\\n if ob in blocks:\\n if ob == \\\"format\\\" and mail_params[ob].lower() not in [\\\"html\\\", \\\"text\\\"]:\\n continue\\n mail_params[ob] = blocks[ob]\\n return mail_params\",\n \"def parse_blocks(self, text):\\n code_matches = [m for m in self.code_pattern.finditer(text)]\\n\\n # determine where the limits of the non code bits are\\n # based on the code block edges\\n text_starts = [0] + [m.end() for m in code_matches]\\n text_stops = [m.start() for m in code_matches] + [len(text)]\\n text_limits = list(zip(text_starts, text_stops))\\n\\n # list of the groups from the code blocks\\n code_blocks = [self.new_code_block(**m.groupdict())\\n for m in code_matches]\\n\\n text_blocks = [self.new_text_block(content=text[i:j])\\n for i, j in text_limits]\\n\\n # remove indents\\n list(map(self.pre_process_code_block, code_blocks))\\n # remove blank line at start and end of markdown\\n list(map(self.pre_process_text_block, text_blocks))\\n\\n # create a list of the right length\\n all_blocks = list(range(len(text_blocks) + len(code_blocks)))\\n\\n # NOTE: the behaviour here is a bit fragile in that we\\n # assume that cells must alternate between code and\\n # markdown. This isn't the case, as we could have\\n # consecutive code cells, and we get around this by\\n # stripping out empty cells. i.e. two consecutive code cells\\n # have an empty markdown cell between them which is stripped\\n # out because it is empty.\\n\\n # cells must alternate in order\\n all_blocks[::2] = text_blocks\\n all_blocks[1::2] = code_blocks\\n\\n # remove possible empty text cells\\n all_blocks = [cell for cell in all_blocks if cell['content']]\\n\\n return all_blocks\",\n \"def formatter(text):\\n repl_map = {\\n \\\"degC\\\": \\\"$^o$C\\\",\\n \\\"K\\\": \\\"$^o$C\\\",\\n \\\"month-1\\\": \\\"month$^{{-1}}$\\\",\\n \\\"day-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"d-1\\\": \\\"day$^{{-1}}$\\\",\\n \\\"decade-1\\\": \\\"decade$^{{-1}}$\\\",\\n \\\"year-1\\\": \\\"year$^{{-1}}$\\\",\\n \\\"rcp85\\\": \\\"RCP8.5\\\",\\n \\\"rcp45\\\": \\\"RCP4.5\\\",\\n \\\"rcp26\\\": \\\"RCP2.6\\\",\\n \\\"RCP85\\\": \\\"RCP8.5\\\",\\n \\\"RCP45\\\": \\\"RCP4.5\\\",\\n \\\"RCP26\\\": \\\"RCP2.6\\\",\\n \\\"cmip5-85\\\": \\\"RCP8.5\\\",\\n \\\"cmip5-60\\\": \\\"RCP6.0\\\",\\n \\\"cmip5-45\\\": \\\"RCP4.5\\\",\\n \\\"cmip5-26\\\": \\\"RCP2.6\\\",\\n \\\"ssp585\\\": \\\"SSP5-8.5\\\",\\n \\\"ssp245\\\": \\\"SSP2-4.5\\\",\\n \\\"ssp126\\\": \\\"SSP1-2.6\\\",\\n \\\"SSP585\\\": \\\"SSP5-8.5\\\",\\n \\\"SSP245\\\": \\\"SSP2-4.5\\\",\\n \\\"SSP126\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-85\\\": \\\"SSP5-8.5\\\",\\n \\\"cmip6-70\\\": \\\"SSP3-7.0\\\",\\n \\\"cmip6-60\\\": \\\"SSP4-6.0\\\",\\n \\\"cmip6-34\\\": \\\"SSP4-3.4\\\",\\n \\\"cmip6-45\\\": \\\"SSP2-4.5\\\",\\n \\\"cmip6-26\\\": \\\"SSP1-2.6\\\",\\n \\\"cmip6-19\\\": \\\"SSP1-1.9\\\",\\n \\\"1\\\": \\\"%\\\",\\n \\\"era5\\\": \\\"ERA5\\\",\\n \\\"gpcc025x025_v8\\\": \\\"GPCC\\\",\\n \\\"cru\\\": \\\"CRU\\\",\\n \\\"jra55\\\": \\\"JRA55\\\",\\n \\\"HIGHRESMIP\\\": \\\"HighResMIP\\\",\\n \\\" \\\": \\\"\\\",\\n }\\n for key, val in repl_map.items():\\n if key in text:\\n text = text.replace(key, val)\\n break\\n return text\",\n \"def _translate_fmts(self):\\n fmt_info = []\\n fmt_append = fmt_info.append\\n \\n isvalid = self._is_valid_fmt\\n typlist = self._typlist\\n isstrvar = self._isstrvar\\n default_fmts = self._default_fmts\\n \\n for i, fmt in enumerate(self._fmtlist):\\n fmt = fmt.strip()\\n \\n iscalendar = (fmt[1] == 't' or fmt[1:3] == '-t')\\n \\n if iscalendar or not isvalid(fmt):\\n if isstrvar(i):\\n wid = min(typlist[i], 10)\\n fmt_append(('s', \\\"{{:>{}s}}\\\".format(wid), wid))\\n continue\\n else:\\n fmt = default_fmts[typlist[i]]\\n \\n last_char = fmt[-1]\\n if last_char == 's': # string\\n m = STR_FMT_RE.match(fmt)\\n align, _, wid = m.group(1), m.group(2), m.group(3)\\n new_align = (\\\"<\\\" if align == \\\"-\\\" \\n else \\\"^\\\" if align == \\\"~\\\" else \\\">\\\")\\n new = \\\"\\\".join((\\\"{:\\\", new_align, wid, \\\"s}\\\"))\\n fmt_append(('s', new, int(wid)))\\n elif last_char == 'H' or last_char == 'L': # binary\\n fmt_append((last_char, fmt, int(fmt[1:-1])))\\n elif last_char == 'x': # hexadecimal\\n fmt_append(('x', fmt, 21))\\n elif last_char in {'f', 'g', 'e', 'c'}: # numeric\\n m = NUM_FMT_RE.match(fmt)\\n align, _, wid, delim, prec, type, com = (m.group(1), m.group(2), \\n m.group(3), m.group(4),\\n m.group(5), m.group(6),\\n m.group(7))\\n aln = \\\"<\\\" if align == \\\"-\\\" else \\\">\\\"\\n sep = \\\",\\\" if com is not None else \\\"\\\"\\n if type == \\\"g\\\" and int(prec) == 0:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, type, \\\"}\\\"))\\n else:\\n new = \\\"\\\".join((\\\"{:\\\", aln, wid, sep, \\\".\\\", prec, type, \\\"}\\\"))\\n fmt_append((type, new, int(wid), delim, com))\\n \\n return fmt_info\",\n \"def parse_cfg(cfgfile):\\n file = open(cfgfile, 'r')\\n lines = file.read().split('\\\\n') # store the lines in a list\\n lines = [x for x in lines if len(x) > 0] # skip empty lines\\n lines = [x for x in lines if x[0] != '#'] # skip comment\\n lines = [x.rstrip().lstrip() for x in lines]\\n file.close()\\n\\n block = {}\\n blocks = []\\n\\n for line in lines:\\n if line[0] == \\\"[\\\": # This marks the start of a new block\\n if len(block) != 0:\\n blocks.append(block)\\n block = {}\\n block['type'] = line[1:-1].rstrip()\\n else:\\n key, value = line.split(\\\"=\\\")\\n block[key.rstrip()] = value.lstrip()\\n blocks.append(block)\\n\\n return blocks\",\n \"def parse(\\n data: str,\\n raw: bool = False,\\n quiet: bool = False\\n) -> Dict:\\n jc.utils.compatibility(__name__, info.compatible, quiet)\\n jc.utils.input_type_check(data)\\n\\n raw_output: Dict = {}\\n split_me = {'it_value:', 'it_interval:'}\\n\\n if jc.utils.has_data(data):\\n\\n for line in filter(None, data.splitlines()):\\n\\n # epoll files\\n if line.startswith('tfd:'):\\n line_match = re.findall(r'(?P<key>\\\\S+):(?:\\\\s+)?(?P<val>\\\\S+s*)', line)\\n if line_match:\\n raw_output.update({'epoll': {k.strip(): v.strip() for k, v in line_match}})\\n continue\\n\\n # inotify files\\n if line.startswith('inotify'):\\n split_line = line[8:].split()\\n raw_output['inotify'] = {}\\n for item in split_line:\\n k, v = item.split(':', maxsplit=1)\\n raw_output['inotify'][k] = v\\n continue\\n\\n # fanotify files\\n if line.startswith('fanotify'):\\n split_line = line[9:].split()\\n\\n if not 'fanotify' in raw_output:\\n raw_output['fanotify'] = {}\\n\\n for item in split_line:\\n k, v = item.split(':', maxsplit=1)\\n raw_output['fanotify'][k] = v\\n continue\\n\\n # timerfd files\\n if line.split()[0] in split_me:\\n split_line = line.replace(':', '').replace('(', '').replace(')', '').replace(',', '').split()\\n raw_output[split_line[0]] = [int(x) for x in split_line[1:]]\\n continue\\n\\n key, val = line.split(':', maxsplit=1)\\n raw_output[key.strip()] = val.strip()\\n continue\\n\\n return raw_output if raw else _process(raw_output)\",\n \"def parseConfig(f):\\n config = {\\\"formats\\\":{}}\\n \\n for line in f:\\n if line.startswith(\\\"//\\\"): \\n continue\\n \\n sline = re.split(\\\"[=\\\\s]\\\", line)\\n if sline[0] is \\\"\\\":\\n continue\\n \\n if sline[0]==\\\"format\\\":\\n #Puts the format as a key in the dict pointed to by \\\"formats\\\"\\n config[\\\"formats\\\"][sline[1]] = sline[3] \\n else:\\n config[sline[0]] = sline[1]\\n \\n return config\",\n \"def parse_graph(self, graph_str, use_bs=True):\\n blocks = graph_str.strip().split('BasicBlock ')\\n \\n # 1st iteration: collect block labels and node's bvars\\n for block in blocks:\\n if len(block) == 0: # skip empty lines\\n continue\\n\\n block_var, instructions = block.split(':', 1)\\n\\n if instructions.find('<label>:') != -1:\\n #raise Exception(\\\"Not supported\\\") # NOTE: legacy error, need to check when it happens though\\n label = instructions.split('<label>:')[1].split(' ')[0]\\n else:\\n label = instructions.split('\\\\n', 1)[1].split(':')[0]\\n\\n if \\\"bd_\\\" in block_var: # only bd_ blocks can be start/end nodes\\n # 'b' stands for block, 'd' for dominant\\n if self._start_var is not None:\\n self._end_var = block_var\\n else:\\n self._start_var = block_var\\n\\n self._label2var[label] = block_var\\n self._var2label[block_var] = label\\n\\n # 2nd iteration: collect nodes and edges\\n for block in blocks:\\n if len(block) == 0: # skip empty lines\\n continue\\n\\n # collect node\\n block_var, instructions = block.split(':', 1)\\n block_label = self._var2label[block_var]\\n block_cost = int(instructions.split(' ')[1])\\n block_dominator = instructions.split('Dominator = ', 1)[1].split('\\\\n', 1)[0]\\n if block_dominator == 'NULL':\\n block_dominator = \\\"-1\\\"\\n else:\\n block_dominator = block_dominator.split('_')[1]\\n\\n if block_var == self._start_var and use_bs:\\n block_var = block_var.replace(\\\"bd_\\\", \\\"bs_\\\")\\n\\n b = Node(block_var, block_label, block_cost, block_dominator, self)\\n\\n self._nodes[b.get_uid()] = b\\n self._label2uid[block_label] = b.get_uid()\\n\\n # collect edges\\n if instructions.find('br ') != -1:\\n for succ in instructions.split('br ')[1].strip().split('label'):\\n succ = succ.strip()\\n if len(succ) >= 2 and succ[0] == '%':\\n dst_label = succ[1:] if succ[-1] != ',' else succ[1:-1]\\n dst_var = self._label2var[dst_label]\\n e = Edge(block_var, dst_var, 0, self)\\n self._edges[e.get_uid()] = e\\n\\n if self._end_var is None:\\n # single-block graph\\n assert(len(self._nodes.keys()) <= 1)\\n assert(len(self._edges.keys()) <= 0)\\n self._end_var = self._start_var\\n\\n # update start/end uids\\n self._start_uid = self._label2uid[self._var2label[self._start_var]]\\n self._end_uid = self._label2uid[self._var2label[self._end_var]]\\n\\n # update nodes with ingoing/outgoing edges\\n for edge_uid in self._edges.keys():\\n edge = self._edges[edge_uid]\\n src_block_uid = edge.get_src_uid()\\n dst_block_uid = edge.get_dst_uid()\\n self._nodes[src_block_uid].add_successor(dst_block_uid)\\n self._nodes[dst_block_uid].add_predecessor(src_block_uid)\\n return\",\n \"def highlightBlock(self, text):\\n\\n for expression, nth, format in self.rules:\\n index = expression.indexIn(text, 0)\\n while index >= 0:\\n # We actually want the index of the nth match\\n index = expression.pos(nth)\\n length = expression.cap(nth).length()\\n self.setFormat(index, length, format)\\n index = expression.indexIn(text, index + length)\\n self.setCurrentBlockState(0)\",\n \"def _parse_format(mode=2, rc_kw=None, **kwargs):\\n kw = {}\\n rc_kw = rc_kw or {}\\n for key, value in kwargs.items():\\n key_fixed = _rc_nodots.get(key, None)\\n if key_fixed is None:\\n kw[key] = value\\n else:\\n rc_kw[key_fixed] = value\\n return rc_kw, mode, kw\",\n \"def initFormat(self):\\n self.formatList = []\",\n \"def build_format(i, ex, args, meta_args):\\n formatter = string.Formatter()\\n format_string = meta_args.format_string\\n fields = list(formatter.parse(format_string))\\n\\n kwarg_fields = []\\n indexed_fields = []\\n\\n i.result = hive.variable('str')\\n i.result_out = hive.pull_out(i.result)\\n\\n for index, field in enumerate(fields):\\n literal_text = field[1]\\n\\n if literal_text is None:\\n continue\\n\\n if not literal_text.isidentifier():\\n field_name = \\\"field_{}\\\".format(index)\\n indexed_fields.append(field_name)\\n\\n else:\\n field_name = literal_text\\n kwarg_fields.append(field_name)\\n\\n # Create IO\\n attr = hive.variable()\\n setattr(i, field_name, attr)\\n\\n in_attr = hive.pull_in(attr)\\n setattr(i, \\\"{}_in\\\".format(field_name), in_attr)\\n\\n setattr(ex, field_name, hive.antenna(in_attr))\\n hive.trigger(i.result_out, in_attr, pretrigger=True)\\n\\n ex.result = hive.output(i.result_out)\\n\\n def do_format(self):\\n args = [getattr(self, \\\"_{}\\\".format(attr_name)) for attr_name in indexed_fields]\\n kwargs = {attr_name: getattr(self, \\\"_{}\\\".format(attr_name)) for attr_name in kwarg_fields}\\n self._result = formatter.format(format_string, *args, **kwargs)\\n\\n i.func = hive.modifier(do_format)\\n hive.trigger(i.result_out, i.func, pretrigger=True)\",\n \"def parse(input):\\n\\t\\n\\toutput = []\\n\\t\\n\\t# Comment delimiter of the docstring\\n\\tcommentDelim = '\\\"\\\"\\\"'\\n\\t\\n\\t# Some regexes\\n\\ttriggerRe = re.compile(\\\"^(\\\\s*)(def .+:|class .+:)\\\")\\n\\tcommentStartRe = re.compile('^\\\\s*(%s)' % commentDelim)\\n\\tcommentEndRe = re.compile('(%s)\\\\s*$' % commentDelim)\\n\\temptyRe = re.compile(\\\"^\\\\s*$\\\")\\n\\thashLineRe = re.compile(\\\"^\\\\s*#.*$\\\")\\n\\timportLineRe = re.compile(\\\"^\\\\s*(import |from .+ import)\\\")\\n\\t\\n\\t# split input into lines\\n\\tlines = input.split(\\\"\\\\n\\\")\\n\\t\\n\\t# flags, buffers, ...\\n\\tfileHeadFlag = True\\n\\ttriggerWordFlag = False\\n\\tcommentFlag = False\\n\\tcomment = []\\n\\ttriggerWs = \\\"\\\"\\n\\ttriggerLines = None\\n\\t\\n\\t# process each line\\n\\tfor line in enumerate(lines):\\n\\n\\t\\tmatch = re.search(triggerRe, line[1])\\n\\t\\tif match:\\n\\t\\t\\tif triggerWordFlag and triggerLines:\\n\\t\\t\\t\\toutput.append(\\\"\\\\n\\\".join(triggerLines))\\n\\t\\t\\t\\n\\t\\t\\ttriggerWordFlag = True\\n\\t\\t\\ttriggerWs = match.group(1)\\n\\t\\t\\tfileHeadFlag = False\\n\\t\\t\\ttriggerLines = [line[1]]\\n\\t\\t\\tcontinue\\n\\n\\t\\t# file header or active keyword trigger?\\n\\t\\tif fileHeadFlag or triggerWordFlag:\\n\\t\\t\\t# comment end of multiline comment found\\n\\t\\t\\tif re.search(commentEndRe, line[1]) and commentFlag:\\n\\t\\t\\t\\tcomment.append( line[1][ : line[1].rfind(commentDelim) ] )\\n\\t\\t\\t\\toutput.append(makeCommentBlock(comment, triggerWs, (triggerLines is None)))\\n\\t\\t\\t\\tif triggerLines:\\n\\t\\t\\t\\t\\toutput.append(\\\"\\\\n\\\".join(triggerLines))\\n\\t\\t\\t\\tcomment = []\\n\\t\\t\\t\\tcommentFlag = False\\n\\t\\t\\t\\ttriggerWs = \\\"\\\"\\n\\t\\t\\t\\ttriggerLines = None\\n\\t\\t\\t\\ttriggerWordFlag = False\\n\\t\\t\\t\\t\\n\\t\\t\\t# comment start found\\n\\t\\t\\telif re.search(commentStartRe, line[1]):\\n\\t\\n\\t\\t\\t\\tif re.search(commentEndRe, line[1][line[1].find(commentDelim)+len(commentDelim) :]):\\n\\t\\t\\t\\t\\t# singleline comment\\n\\t\\t\\t\\t\\tcomment.append(line[1][line[1].find(commentDelim)+len(commentDelim) : line[1].rfind(commentDelim)])\\n\\t\\t\\t\\t\\toutput.append(makeCommentBlock(comment, triggerWs))\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif triggerLines:\\n\\t\\t\\t\\t\\t\\toutput.append(\\\"\\\\n\\\".join(triggerLines))\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tcomment = []\\n\\t\\t\\t\\t\\tcommentFlag = False\\n\\t\\t\\t\\t\\ttriggerWs = \\\"\\\"\\n\\t\\t\\t\\t\\ttriggerLines = None\\n\\t\\t\\t\\t\\ttriggerWordFlag = False\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\t# multiline comment begin\\n\\t\\t\\t\\t\\tcommentFlag = True\\n\\t\\t\\t\\t\\tcomment.append(\\n\\t\\t\\t\\t\\t\\tline[1][line[1].find(commentDelim)+len(commentDelim):]\\n\\t\\t\\t\\t\\t)\\n\\t\\n\\t\\t\\t# active multiline comment -> append comment\\n\\t\\t\\telif commentFlag:\\n\\t\\t\\t\\tcomment.append(line[1])\\n\\t\\t\\t\\n\\t\\t\\t# still searching for comment\\n\\t\\t\\telif re.search(emptyRe, line[1]):\\n\\t\\t\\t\\tif triggerLines:\\n\\t\\t\\t\\t\\ttriggerLines.append(line[1])\\n\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\toutput.append(line[1])\\n\\t\\t\\t\\n\\t\\t\\t# searching for file header\\n\\t\\t\\telif fileHeadFlag:\\n\\t\\t\\t\\tif not (re.search(hashLineRe, line[1]) or re.search(emptyRe, line[1]) or re.search(importLineRe, line[1])):\\n\\t\\t\\t\\t\\t# fileheader over -> disable search\\n\\t\\t\\t\\t\\tfileHeadFlag = False\\n\\t\\t\\t\\toutput.append(line[1])\\n\\t\\t\\t\\n\\t\\t\\t# no comment, disable comment search mode\\n\\t\\t\\telse:\\n\\t\\t\\t\\ttriggerWordFlag = False\\n\\t\\t\\t\\tif triggerLines:\\n\\t\\t\\t\\t\\toutput.append(\\\"\\\\n\\\".join(triggerLines))\\n\\t\\t\\t\\ttriggerLines = None\\n\\t\\t\\t\\toutput.append(line[1])\\n\\t\\t\\n\\t\\t# just append the line\\n\\t\\telse:\\n\\t\\t\\toutput.append(line[1])\\n\\t\\n\\t# return output\\n\\treturn \\\"\\\\n\\\".join(output)\",\n \"def parse_name_and_type_from_fmt_str(\\n formatted_str: str,\\n allowed_types: Optional[Dict[str, Component]] = None\\n) -> Generator[Tuple[str, Type[Field]], None, None]:\\n for _, arg_name, _type_name, _ in Formatter().parse(formatted_str):\\n if arg_name is not None:\\n try:\\n assert _type_name is not None\\n _type = (\\n allowed_types[_type_name] if allowed_types is not None\\n and _type_name in allowed_types\\n else getattr(pyopenapi3.data_types, _type_name)\\n )\\n yield arg_name, _type\\n except AttributeError:\\n raise ValueError(\\n \\\"A non-`Field` or `OpenApiObject` type was found. \\\"\\n f\\\"Can't use `{_type_name}` as a type in {formatted_str}. \\\"\\n f\\\"Must be a stringified pyopenapi3 `data_type`, such \\\"\\n f\\\"as `pyopenapi3.data_types.String`, or a reference to a \\\"\\n f\\\"Component.\\\"\\n ) from None\",\n \"def from_string(block_string: str):\\n ops = block_string.split(\\\"_\\\")\\n options = {}\\n for op in ops:\\n splits = re.split(r\\\"(\\\\d.*)\\\", op)\\n if len(splits) >= 2:\\n key, value = splits[:2]\\n options[key] = value\\n\\n # check stride\\n stride_check = (\\n (\\\"s\\\" in options and len(options[\\\"s\\\"]) == 1)\\n or (len(options[\\\"s\\\"]) == 2 and options[\\\"s\\\"][0] == options[\\\"s\\\"][1])\\n or (len(options[\\\"s\\\"]) == 3 and options[\\\"s\\\"][0] == options[\\\"s\\\"][1] and options[\\\"s\\\"][0] == options[\\\"s\\\"][2])\\n )\\n if not stride_check:\\n raise ValueError(\\\"invalid stride option received\\\")\\n\\n return BlockArgs(\\n num_repeat=int(options[\\\"r\\\"]),\\n kernel_size=int(options[\\\"k\\\"]),\\n stride=int(options[\\\"s\\\"][0]),\\n expand_ratio=int(options[\\\"e\\\"]),\\n input_filters=int(options[\\\"i\\\"]),\\n output_filters=int(options[\\\"o\\\"]),\\n id_skip=(\\\"noskip\\\" not in block_string),\\n se_ratio=float(options[\\\"se\\\"]) if \\\"se\\\" in options else None,\\n )\",\n \"def format(self, formatter, form, title):\\n # store line offsets in self.lines\\n self.lines = [0, 0]\\n pos = 0\\n while 1:\\n pos = self.raw.find('\\\\n', pos) + 1\\n if not pos: break\\n self.lines.append(pos)\\n self.lines.append(len(self.raw))\\n\\n # parse the source and write it\\n self.pos = 0\\n text = io.StringIO(self.raw)\\n self.out.write('<html><body bgcolor=\\\"#e0e0e0\\\"><head><title>%s</title></head><pre><font face=\\\"Lucida,Courier New\\\">'%title)\\n try:\\n if (sys.version_info > (3, 0)):\\n tokens = tokenize.generate_tokens(text.readline)\\n for toktype,toktext,tok_start,tok_end,line in tokens:\\n self.__call__(toktype,toktext,tok_start,tok_end,line)\\n else:\\n tokenize.tokenize(text.readline,self)\\n except tokenize.TokenError as ex:\\n msg = ex.args[0]\\n line = ex.args[1][0]\\n self.out.write(\\\"<h3>ERROR: %s</h3>%s\\\\n\\\" % (\\n msg, self.raw[self.lines[line]:]))\\n self.out.write('</font></pre></body></html>')\",\n \"def format(self, formatter):\\n WikiParser.format(self, formatter)\\n # reset those states every time format is done\\n self.break_next = False\\n self.prev_list = False\",\n \"def read_atom_data(atom_format, line):\\n if atom_format is None:\\n _format = [guess_string_format(i.strip()) for i in line.split()]\\n else:\\n _format = atom_format\\n formatted = []\\n for i, (val, fmti) in enumerate(zip(line.split(), _format)):\\n istrip = val.strip()\\n try:\\n formatted.append(fmti(istrip))\\n except ValueError:\\n fmt = guess_string_format(istrip)\\n _format[i] = fmt\\n formatted.append(fmt(istrip))\\n return formatted, _format\",\n \"def test_regexp_chunk_parser():\",\n \"def parse_shortform_block_annotation(description):\\n if not description:\\n return {}\\n # TODO: Test encoded string formatting using regexp\\n\\n ref_version, chrom, scaffold, ori, gpos, _, coords = description.split('_')\\n coords = [slice(int(start) - 1, int(stop))\\n for start, stop in [c.split(':') for c in coords.split(';')]]\\n\\n return {\\n 'ref_version': ref_version,\\n 'chromosome': chrom,\\n 'chromosome_scaffold': int(scaffold),\\n 'genome_pos': int(gpos) - 1,\\n 'orientation': ori,\\n 'blocks': coords,\\n }\",\n \"def parse_block_math(self, m):\\n self.tokens.append({\\n 'type': 'block_math',\\n 'text': m.group(1)\\n })\",\n \"def reparseText(parsed):\\n out = []\\n buffer = ''\\n for type, data in parsed:\\n if type is RAW:\\n buffer += data\\n else:\\n if buffer:\\n b = re.sub(r'\\\\s+', ' ' , buffer)\\n out.append((RAW, b))\\n buffer = ''\\n out.append((type,data))\\n if buffer:\\n b = re.sub(r'\\\\s+', ' ' , buffer)\\n out.append((RAW, b))\\n return out\",\n \"def commonmark(text, format=\\\"html\\\"):\\n parser = Parser()\\n ast = parser.parse(text)\\n if format not in [\\\"html\\\", \\\"json\\\", \\\"ast\\\"]:\\n raise ValueError(\\\"format must be 'html', 'json' or 'ast'\\\")\\n if format == \\\"html\\\":\\n renderer = HTMLRenderer()\\n return renderer.render(ast)\\n if format == \\\"json\\\":\\n return ASTtoJSON(ast)\\n if format == \\\"ast\\\":\\n return dumpAST(ast)\",\n \"def highlightBlock(self, text):\\n # Do other syntax formatting\\n for expression, nth, format in self.rules:\\n index = expression.indexIn(text, 0)\\n\\n while index >= 0:\\n # We actually want the index of the nth match\\n index = expression.pos(nth)\\n length = len(expression.cap(nth))\\n self.setFormat(index, length, format)\\n index = expression.indexIn(text, index + length)\\n\\n self.setCurrentBlockState(0)\",\n \"def parse(self, input):\\n pass\",\n \"def register_data_format(format_name,parser):\\n\\n data_format_parser[format_name] = parser\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.64509463","0.61767745","0.6141088","0.6093478","0.59834534","0.59391457","0.5813534","0.5672864","0.565769","0.5619488","0.5604256","0.5531012","0.5529596","0.55168927","0.54857767","0.545964","0.5454546","0.5443225","0.54375136","0.54195976","0.5334066","0.5294258","0.52878046","0.52471036","0.52260244","0.5211148","0.5207812","0.5192551","0.5192131","0.5188234","0.5181986","0.516625","0.5156391","0.5146858","0.5127734","0.51167744","0.5112718","0.5108214","0.510674","0.51062196","0.5087044","0.507185","0.5070044","0.50675386","0.504869","0.50477725","0.5043177","0.4994124","0.49899256","0.4957978","0.494674","0.49395174","0.4930837","0.49271208","0.4925568","0.4924901","0.49181744","0.49181744","0.49149057","0.49130347","0.4907486","0.4904251","0.49040323","0.4901149","0.48774403","0.48737454","0.4872731","0.48693103","0.48654395","0.48566082","0.48276517","0.4822794","0.48206964","0.48145694","0.48090145","0.48029166","0.4797748","0.4792716","0.4788952","0.4782847","0.4781099","0.4768461","0.4766974","0.47593212","0.47561","0.47545156","0.47518572","0.47505465","0.47385955","0.47381458","0.473445","0.47305465","0.47220948","0.47200245","0.47192532","0.47171953","0.47148168","0.4685674","0.46790516","0.46754774"],"string":"[\n \"0.64509463\",\n \"0.61767745\",\n \"0.6141088\",\n \"0.6093478\",\n \"0.59834534\",\n \"0.59391457\",\n \"0.5813534\",\n \"0.5672864\",\n \"0.565769\",\n \"0.5619488\",\n \"0.5604256\",\n \"0.5531012\",\n \"0.5529596\",\n \"0.55168927\",\n \"0.54857767\",\n \"0.545964\",\n \"0.5454546\",\n \"0.5443225\",\n \"0.54375136\",\n \"0.54195976\",\n \"0.5334066\",\n \"0.5294258\",\n \"0.52878046\",\n \"0.52471036\",\n \"0.52260244\",\n \"0.5211148\",\n \"0.5207812\",\n \"0.5192551\",\n \"0.5192131\",\n \"0.5188234\",\n \"0.5181986\",\n \"0.516625\",\n \"0.5156391\",\n \"0.5146858\",\n \"0.5127734\",\n \"0.51167744\",\n \"0.5112718\",\n \"0.5108214\",\n \"0.510674\",\n \"0.51062196\",\n \"0.5087044\",\n \"0.507185\",\n \"0.5070044\",\n \"0.50675386\",\n \"0.504869\",\n \"0.50477725\",\n \"0.5043177\",\n \"0.4994124\",\n \"0.49899256\",\n \"0.4957978\",\n \"0.494674\",\n \"0.49395174\",\n \"0.4930837\",\n \"0.49271208\",\n \"0.4925568\",\n \"0.4924901\",\n \"0.49181744\",\n \"0.49181744\",\n \"0.49149057\",\n \"0.49130347\",\n \"0.4907486\",\n \"0.4904251\",\n \"0.49040323\",\n \"0.4901149\",\n \"0.48774403\",\n \"0.48737454\",\n \"0.4872731\",\n \"0.48693103\",\n \"0.48654395\",\n \"0.48566082\",\n \"0.48276517\",\n \"0.4822794\",\n \"0.48206964\",\n \"0.48145694\",\n \"0.48090145\",\n \"0.48029166\",\n \"0.4797748\",\n \"0.4792716\",\n \"0.4788952\",\n \"0.4782847\",\n \"0.4781099\",\n \"0.4768461\",\n \"0.4766974\",\n \"0.47593212\",\n \"0.47561\",\n \"0.47545156\",\n \"0.47518572\",\n \"0.47505465\",\n \"0.47385955\",\n \"0.47381458\",\n \"0.473445\",\n \"0.47305465\",\n \"0.47220948\",\n \"0.47200245\",\n \"0.47192532\",\n \"0.47171953\",\n \"0.47148168\",\n \"0.4685674\",\n \"0.46790516\",\n \"0.46754774\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.73439676"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94769,"cells":{"query":{"kind":"string","value":"Format a string, substituting place holders which can be found in param_dict, attributes of the supplied module, or provided via calls to the attr_getter function."},"document":{"kind":"string","value":"def format(\n self,\n format_string,\n module=None,\n param_dict=None,\n force_composite=False,\n attr_getter=None,\n ):\n if param_dict is None:\n param_dict = {}\n\n # if the processed format string is not in the cache then create it.\n if format_string not in self.block_cache:\n self.build_block(format_string)\n\n first_block = self.block_cache[format_string]\n\n def get_parameter(key):\n \"\"\"\n function that finds and returns the value for a placeholder.\n \"\"\"\n if key in param_dict:\n # was a supplied parameter\n param = param_dict.get(key)\n elif module and hasattr(module, key):\n param = getattr(module, key)\n if hasattr(param, \"__call__\"):\n # we don't allow module methods\n raise Exception()\n elif attr_getter:\n # get value from attr_getter function\n try:\n param = attr_getter(key)\n except: # noqa e722\n raise Exception()\n else:\n raise Exception()\n if isinstance(param, Composite):\n if param.text():\n param = param.copy()\n else:\n param = \"\"\n return param\n\n # render our processed format\n valid, output = first_block.render(get_parameter, module)\n\n # clean things up a little\n if isinstance(output, list):\n output = Composite(output)\n if not output:\n if force_composite:\n output = Composite()\n else:\n output = \"\"\n\n return output"},"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 replace_param(string, param, value, param_format=None):\n\n if param_format == \"json\":\n return sub(r\"(?P<json_replacement>\\\"%s\\\"\\s*:\\s*)\\\"\\s*\\\"\" %\n escape(str(param)), \"\\\\1\\\"%s\\\"\" % value, string)\n elif param_format == \"header\":\n return sub(r\"%s=[^\\\\n]*\" % escape(str(param)), r\"%s=%s\" %\n (str(param).encode('string-escape'),\n str(value).encode('string-escape')), string)\n else:\n return sub(r\"%s=[^&]*\" % escape(str(param)), r\"%s=%s\" %\n (str(param).encode('string-escape'),\n str(value).encode('string-escape')), string)","def _params_formatter(field, description):\n heads = ['param']\n types = _or_types(field)\n if types:\n heads.append(types)\n heads.append(rst.escape(field['name']))\n tail = description\n return heads, tail","def _replace_params(self, text: str, control: cat.Control, param_dict: Dict[str, prof.SetParameter]) -> str:\n if control.params is not None:\n for param in control.params:\n # set default if no information available for text\n param_text = f'[{param.id} = no description available]'\n set_param = param_dict.get(param.id, None)\n # param value provided so just replace it\n if set_param is not None:\n values = [value.__root__ for value in set_param.values]\n param_text = values[0] if len(values) == 1 else f\"[{', '.join(values)}]\"\n else:\n # if select present, use it\n if param.select is not None:\n param_text = '['\n if param.select.how_many is not None:\n param_text += f'{param.select.how_many.value}: '\n if param.select.choice is not None:\n param_text += ', '.join(param.select.choice)\n param_text = f'{param_text}]'\n # else use the label\n if param.label is not None:\n param_text = f'[{param.label}]'\n # this needs to be a regex match to distinguish param_1 from param_10\n pattern = re.compile(f'{param.id}(?:[^0-9a-zA-Z._\\-#@])')\n text = pattern.sub(param_text, text)\n\n # strip {{ }}\n pattern = re.compile('( *{{| *}})')\n text = pattern.sub('', text)\n text = text.replace('insert: param, ', '').strip()\n\n return text","def _process_str(self, fmt, *args, **kwargs):\n log_str = fmt\n if len(args) > 0 or len(kwargs) > 0:\n log_str = fmt.format(*args, **kwargs)\n\n return log_str","def _wrap_attr(attr):\n return '={0},'.format(attr)","def format_parameter(param, required):\n\n param_string = check_param(flatten_param(param))\n if not required:\n param_string += '=None'\n return param_string","def _parameterize_string(raw):\n\n parts = []\n s_index = 0\n\n for match in _PARAMETER_PATTERN.finditer(raw):\n parts.append(raw[s_index:match.start()])\n parts.append({u\"Ref\": match.group(1)})\n s_index = match.end()\n\n if not parts:\n return GenericHelperFn(raw)\n\n parts.append(raw[s_index:])\n return GenericHelperFn({u\"Fn::Join\": [u\"\", parts]})","def _params_formatter(field):\n heads = ['param']\n types = _or_types(field)\n if types:\n heads.append(types)\n heads.append(field['name'])\n tail = field.get('description', '')\n return heads, tail","def call_str(pvs):\n s = \"'{}', '{}'\".format(pvs.get('place'), pvs.get('stat_var'))\n if pvs.get('measurement_method'):\n s += \", measurement_method='{}'\".format(\n pvs.get('measurement_method'))\n if pvs.get('observation_period'):\n s += \", observation_period='{}'\".format(\n pvs.get('observation_period'))\n if pvs.get('unit'):\n s += \", unit='{}'\".format(pvs.get('unit'))\n if pvs.get('scaling_factor'):\n s += \", scaling_factor={}\".format(pvs.get('scaling_factor'))\n return s","def change_format_var_parser(text, tracker):\n param_names = format_var_parser(text)\n param_vars = {}\n for param_name in param_names:\n try:\n param_vars[param_name] = tracker.get_slot(param_name)\n except Exception as e:\n PYTHON_LOGGER.error(\"Error to get var name {}: {}\".format(param_name, e))\n return text.format(**param_vars)","def format(self):\n groups = [g + \".\" for g in self.groups]\n params = [\";\" + p.format() for p in self.params]\n groups_name_params = \"\".join(groups) + self.name + \"\".join(params)\n return groups_name_params + \":\" + self.format_value() + CRLF","def format_arguments(data: Dict) -> str:\n\n def prep(key: str, value: Any) -> str:\n if isinstance(value, str):\n value = f'''\"{value.replace('\"', \"'\")}\"'''\n if key == \"pattern\":\n value = f\"r{value}\"\n return f\"{key}={value}\"\n\n return \",\\n\".join([prep(key, value) for key, value in data.items()])","def format(self, *args, **kwargs) -> String:\n pass","def test_mixed_manual_positional_arguments_with_attribute_access_arguments():\n '{0}{1[FOO]}'.format(123, {'FOO': 456})\n '{0}{1[FOO]}'.format(123, {'FOO': 456}, 321)\n '{0}{1[FOO]}'.format(123)","def format(value, arg):\n try:\n if value is not None:\n # return (str(arg)) % value\n return (str(value)) % arg\n else:\n return \"\"\n except (ValueError, TypeError):\n return \"\"","def format_string(self, template):\n out_str = \"\"\n search_property_name = \"\"\n in_property = False\n for char in template:\n if (in_property):\n if (char == '%'):\n if (len(search_property_name) > 0):\n prop_value = \"\"\n try:\n prop_value = str(self.get_property(search_property_name))\n except KeyError:\n pass\n out_str += prop_value\n search_property_name = \"\"\n in_property = False\n else:\n search_property_name += char\n else:\n if (char == '%'):\n in_property = True\n else:\n out_str += char\n\n # Handle unterminated property names\n if (in_property):\n out_str += '%'\n out_str += search_property_name\n\n return out_str","def pformat(class_instance):\n s = ''\n for var, val in vars(class_instance).items():\n s += var + ': ' + str(val) + '\\n'\n return s[:-1]","def format(self, value, key=None, **kwargs):\n if not isinstance(value, str):\n return value\n\n # always format strings using the root so the full path is available\n if self.root:\n return self.root.format(value, key, **kwargs)\n\n variables = CONFIG_VARIABLE_PATTERN.findall(value)\n expanded = {}\n for variable in variables:\n if variable not in kwargs:\n try:\n root_key = variable.split(\".\")[0]\n root = self.root if self.root else self\n\n expanded[root_key] = self.format(getattr(root, root_key), variable, **kwargs)\n except AttributeError:\n raise MissingConfiguration(variable, key)\n\n expanded.update(**kwargs)\n return value.format(**expanded)","def format(self, valDict):\n return self._formatStr % valDict","def replace_param_occurrences(string, params):\n for k, v in params.items():\n string = string.replace(k, str(v))\n return string","def __repr_parameter__(self, name: str, value: Any) -> str:\n return f\"{name}={value!r}\"","def param_str(self, pnames=None):\n l = self.get_params(pnames)\n s = \"\"\n for p in l:\n s += \"%s : %s\\n\" % (p.public_name, p.tostr(self))\n return s","def printParameter (a,b):\n print(a)\n print(b)\n print(\"this is formating of {} and {}\".format(a,b))","def string(self, string, values=None):\n if values:\n values = self.values(values)\n return string.format(*values)\n return string","def __str__(self):\n return self.fmt.format(*self.args, **self.kwargs)","def get_str(self, item: str, fmt: str = \"{}\") -> str:\n return fmt.format(self[item])","def format_directive(module, package=None):\n directive = '.. automodule:: %s\\n' % makename(package, module)\n for option in OPTIONS:\n directive += ' :%s:\\n' % option\n return directive","def autoformat(\n cls: Type[U] = None,\n /,\n params: Union[str, Iterable[str]] = ( # pylint: disable=unsubscriptable-object\n \"message\",\n \"msg\",\n ),\n):\n if isinstance(params, str):\n params = (params,)\n\n if cls is None:\n return functools.partial(autoformat, params=params)\n\n orig_init = cls.__init__\n signature = inspect.signature(orig_init)\n params = signature.parameters.keys() & set(params)\n\n @functools.wraps(orig_init)\n def init(*args, **kwargs):\n bounds = signature.bind(*args, **kwargs)\n bounds.apply_defaults()\n pre_formatted = {\n name: bounds.arguments.pop(name)\n for name in params\n if name in bounds.arguments\n }\n formatted = {\n name: string.format(**bounds.arguments)\n for name, string in pre_formatted.items()\n }\n for name, arg in formatted.items():\n bounds.arguments[name] = arg\n return orig_init(*bounds.args, **bounds.kwargs)\n\n # init.__signature__ = signature\n setattr(cls, \"__init__\", init)\n return cls","def __getattr__(self, name):\n if name in self:\n if (isinstance(self[name], dict)):\n return self._format_dict(self[name])\n else:\n return str(self[name])\n else:\n return \"\"","def format_string(self, pat=None, pat_args={}):\n if pat is None:\n pat = self.parent.pat\n if pat_args == {}:\n pat_args = self.parent.pat_args\n return entry_format.output(self, pat, pat_args)","def repr_str(obj, attrs, update=None):\n props = [\n (attr, value)\n for attr, value in (\n (attr, getattr(obj, attr))\n for attr in attrs\n )\n if value is not None\n ]\n\n if update is not None:\n props = update(props)\n\n props_str = ', '.join('%s=%s' % (attr, value) for attr, value in props)\n return \"<{klass}: {props_str}>\".format(\n klass=obj.__class__.__name__,\n props_str=props_str,\n )","def replace_in_string(s, args_dict):\n for key, value in args_dict.items():\n s = s.replace(key, value)\n for key, value in args_dict.items():\n s = s.replace(key, value)\n for key, value in args_dict.items():\n s = s.replace(key, value)\n return s","def _printAttributePrintf(self, formatting, value):\n\n # multiple entrys\n if isinstance(formatting, list):\n\n for scanf_format in formatting:\n try:\n #print \"-->>\", scanf_format, value\n return scanf_format % value\n except TypeError, e:\n pass\n\n # single entry\n else:\n return formatting % value\n\n # problem if none of the formats worked\n raise TypeError(\"Valid format not found for values.\")","def format_attributes(attributes):\n return ';'.join([k + '=' + v for k, v in attributes.items()])","def format(*args, **kwargs):\n if args:\n print ', '.join([str(s) for s in args])\n if kwargs:\n sub_items = []\n for k, v in kwargs.items():\n sub_items.append('{}={}'.format(k, v))\n print ', '.join(sub_items)","def _format_api_string(self):\n api_string = self.api_name\n arg_string_list = []\n if not self.api_args is None and \\\n len(self.api_args) > 0:\n for key in self.api_args:\n try:\n value = self.api_args[key]\n except TypeError:\n #assert False, f\"node: {self.api_name} key: {key} bad arg: {self.api_args}\" + \\\n # f\" type: {self.api_args.__class__.__name__}\"\n print(f\"node: {self.api_name} key: {key} bad arg: {self.api_args}\" + \\\n f\" type: {self.api_args.__class__.__name__}\")\n raise TypeError\n if isinstance(value, list):\n value_string = \"[ \" + \",\".join([self._api_value_string(x) for x in value]) + \" ]\"\n else:\n if value is None:\n assert False, f\"key={key}\"\n value_string = self._api_value_string(value)\n arg_string_list.append(f\"{key}:{value_string}\")\n api_string += \"(\" + \" \".join(arg_string_list) + \")\"\n #assert False, f\"{self.api_name}: {api_string}\"\n return api_string","def format(obj): # pylint: disable=W0622\n# print '>>', obj\n if hasattr(obj, 'format'):\n return obj.format()\n return \"%s\" % obj","def make_string_repr(instance):\n arg_list = [] if args is None else [getattr(instance, arg) for arg in args if hasattr(instance, arg)]\n\n kwarg_dict = {} if kwargs is None else {key: getattr(instance, key) for key in kwargs if hasattr(instance, key)}\n\n # Check that we could bind the args/kwargs that found matches to the __init__ method\n # Basically this is checking that any arguments we didn't find on the instance have default values\n signature(instance.__class__).bind(*arg_list, **kwarg_dict)\n\n return instance.__class__.__name__ + '(' + format_arguments(*arg_list, **kwarg_dict) + ')'","def update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\n and token.group(\"key\") in placeholder_formats\n ):\n output.append(f\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\")\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def call_spec_string():\n # pylint: disable=protected-access\n frame = sys._getframe(1)\n argvals = inspect.getargvalues(frame)\n if argvals.args[0] == 'self':\n return inspect.formatargvalues(argvals.args[1:], *argvals[1:])\n else:\n return inspect.formatargvalues(*argvals)","def string_for_attrs(attrs):\n if not attrs: return ''\n return ''.join(' %s=\"%s\"' % (attr, value) for attr, value in attrs)","def format(self, **kw):\n params = self.defaults.copy()\n params.update(kw)\n if self.filter:\n self.filter(self, params)\n msg = self.msg\n if self.key is not None:\n key = self.key.format(**params)\n msg = msg[key]\n return msg.format(**params)","def format_field(self, value, spec):\n cache = Cache()\n if spec == \"co\":\n # if cache(re.match(\"(.*)co$\", spec)):\n value = co_join(value)\n spec = \"s\"\n # cache.output.group(1) + \"s\"\n elif cache(re.match(r\"^sub(\\d?)_?(.*)$\", spec)):\n depth = (1 if cache.output.group(1) == \"\" else\n int(cache.output.group(1)))\n value = \"\\n\".join([\n \"{0}{1} = {2}\".format(depth * \" \", key, val)\n for key, val in value.items()])\n if cache.output.group(2) != \"\":\n value = (\n depth * \"[\" + cache.output.group(2) + depth * \"]\" + \"\\n\" +\n value)\n spec = \"s\"\n return super(Format, self).format_field(value, spec)","def reparam(string_, dictionary):\n dictionary = dictionary.copy() # eval mucks with it\n # disable builtins to avoid risk for remote code exection.\n dictionary['__builtins__'] = object()\n vals = []\n result = []\n for live, chunk in _interpolate(string_):\n if live:\n v = eval(chunk, dictionary)\n result.append(sqlquote(v))\n else: \n result.append(chunk)\n return SQLQuery.join(result, '')","def render_param(self, format):\n\t\tdef renderer(ctx, data):\n\t\t\tparName = ctx.tag.children[0].strip()\n\t\t\tctx.tag.clear()\n\t\t\ttry:\n\t\t\t\tval = data.getParam(parName)\n\t\t\t\tif val is None:\n\t\t\t\t\treturn ctx.tag[\"N/A\"]\n\n\t\t\t\treturn ctx.tag[format%val]\n\t\t\texcept base.NotFoundError:\n\t\t\t\treturn ctx.tag[\"N/A\"]\n\t\treturn renderer","def update_placeholders(self, format_string, placeholders):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if token.group(\"key\") in placeholders:\n output.append(\n \"{{{}{}}}\".format(placeholders[token.group(\"key\")], token.group(\"format\"))\n )\n continue\n elif token.group(\"command\"):\n # update any placeholders used in commands\n commands = parse_qsl(token.group(\"command\"), keep_blank_values=True)\n # placeholders only used in `if`\n if \"if\" in [x[0] for x in commands]:\n items = []\n for key, value in commands:\n if key == \"if\":\n # we have to rebuild from the parts we have\n condition = Condition(value)\n variable = condition.variable\n if variable in placeholders:\n variable = placeholders[variable]\n # negation via `!`\n not_ = \"!\" if not condition.default else \"\"\n condition_ = condition.condition or \"\"\n # if there is no condition then there is no\n # value\n if condition_:\n value_ = condition.value\n else:\n value_ = \"\"\n value = \"{}{}{}{}\".format(not_, variable, condition_, value_)\n if value:\n items.append(f\"{key}={value}\")\n else:\n items.append(key)\n\n # we cannot use urlencode because it will escape things\n # like `!`\n output.append(r\"\\?{} \".format(\"&\".join(items)))\n continue\n value = token.group(0)\n output.append(value)\n return \"\".join(output)","def formatargvalues(args, varargs, varkw, locals,\r\n formatarg=str,\r\n formatvarargs=lambda name: '*' + name,\r\n formatvarkw=lambda name: '**' + name,\r\n formatvalue=lambda value: '=' + repr(value),\r\n join=joinseq):\r\n def convert(name, locals=locals,\r\n formatarg=formatarg, formatvalue=formatvalue):\r\n return formatarg(name) + formatvalue(locals[name])\r\n specs = []\r\n for i in range(len(args)):\r\n specs.append(strseq(args[i], convert, join))\r\n if varargs:\r\n specs.append(formatvarargs(varargs) + formatvalue(locals[varargs]))\r\n if varkw:\r\n specs.append(formatvarkw(varkw) + formatvalue(locals[varkw]))\r\n return '(' + string.join(specs, ', ') + ')'","def _formatted_string(self, message: str, dict_values: dict) -> str:\n formatted_values = self._format_values_in_map(dict_values)\n return message.format(**formatted_values)","def format_person(adj, dict):\n name = dict['name']\n net = int(dict['net_worth (USD)'])\n return \"The {0} person is {1}. They have a net worth of ${2:,}\".format(adj, name, net)","def format_params(self, params):\n return params","def safe_format(\n format: str,\n dictionary: dict[str, Any],\n types: set[type[Any]] | None = None,\n adapt: 'Callable[[str], str] | None' = None,\n raise_on_missing: bool = False\n) -> str:\n\n types = types or {int, str, float}\n output = StringIO()\n buffer = StringIO()\n opened = 0\n\n for ix, char in enumerate(format):\n if char == '[':\n opened += 1\n\n if char == ']':\n opened -= 1\n\n if opened == 1 and char != '[' and char != ']':\n print(char, file=buffer, end='')\n continue\n\n if opened == 2 or opened == -2:\n if buffer.tell():\n raise RuntimeError(\"Unexpected bracket inside bracket found\")\n\n print(char, file=output, end='')\n opened = 0\n continue\n\n if buffer.tell():\n k = adapt(buffer.getvalue()) if adapt else buffer.getvalue()\n\n if raise_on_missing and k not in dictionary:\n raise RuntimeError(\"Key '{}' is unknown\".format(k))\n\n v = dictionary.get(k, '')\n t = type(v)\n\n if t not in types:\n raise RuntimeError(\"Invalid type for '{}': {}\".format(k, t))\n\n print(v, file=output, end='')\n buffer = StringIO()\n\n if char != '[' and char != ']':\n print(char, file=output, end='')\n\n if opened != 0:\n raise RuntimeError(\"Uneven number of brackets in '{}'\".format(format))\n\n return output.getvalue()","def format(fmt, st):\n ret = \"\"\n if not st: return ret\n if fmt not in valid_combos:\n return st\n cm = charmap[fmt]\n for c in st:\n ret += cm.get(c, c)\n return ret","def format_arg(arg_name: str, value: Any, max_length: int = 200) -> str:\n return \"{arg_name}={value}\".format(\n arg_name=arg_name, value=trim_string(repr(value), max_length=max_length)\n )","def attr(*attrs: ATTRIBUTE) -> str:\n formatted = []\n for attr_ in attrs:\n if isinstance(attr_, str):\n formatted.append(attr_)\n elif isinstance(attr_, tuple) and len(attr_) == 2:\n formatted.append(f'{attr_[0]}=\"{attr_[1]}\"')\n else:\n raise ValueError(f\"Bad attribute: {attr_}\")\n return \" \".join(formatted)","def render_attr(key, value, attr_format='{key}=\"{value}\"'):\n\n if not key or ' ' in key:\n raise InvalidAttribute('Invalid name \"{}\"'.format(key))\n\n if value:\n if type(value) is RawNode:\n value = str(value)\n else:\n value = html.escape(str(value))\n\n return attr_format.format(key=key, value=value)\n\n return key","def FillForm(string_for_substitution, dictionary_of_vars):\n return_string = string_for_substitution\n for i in re.findall(\"//%%(.*)%%//\", string_for_substitution):\n return_string = re.sub(\"//%%\" + i + \"%%//\", dictionary_of_vars[i],\n return_string)\n return return_string","def trans_format(trans_key, **kwargs):\n translated: str = _(trans_key)\n return translated.format(**kwargs)","def format_directive(self, module, package):\n if module:\n automodule = '%s.%s' % (package, module)\n else:\n automodule = package\n\n directive = '.. automodule:: %s\\n' % automodule\n for option in OPTIONS:\n directive += ' :%s:\\n' % option\n return directive","def format_str(string, dictionary):\n tokens = string.split('}')\n output = []\n for token in tokens[:-1]:\n if token.split('{')[-1] in dictionary.keys():\n output.append((token + '}').format(**dictionary))\n else:\n output.append(token + '}')\n\n return ''.join(output) + tokens[-1]","def get_formatter(self, **kwargs):\n config = dict([\n (attr, getattr(self, attr))\n for attr in [\n \"include_sign\",\n \"group_with_commas\",\n \"num_decimal_places\",\n ]\n ])\n config.update(kwargs)\n return \"\".join([\n \"{\",\n config.get(\"field_name\", \"\"),\n \":\",\n \"+\" if config[\"include_sign\"] else \"\",\n \",\" if config[\"group_with_commas\"] else \"\",\n \".\", str(config[\"num_decimal_places\"]), \"f\",\n \"}\",\n ])","def format_attr(attr: str) -> str:\r\n prefix = query_params[Toml.REMOVE_PREFIX]\r\n suffix = query_params[Toml.REMOVE_SUFFIX]\r\n prefix_len = len(prefix)\r\n suffix_len = len(suffix)\r\n stripped = attr.strip()\r\n if stripped[:prefix_len] == prefix:\r\n stripped = stripped[prefix_len:]\r\n if stripped[-suffix_len:] == suffix:\r\n stripped = stripped[:-suffix_len]\r\n return constcase(stripped).replace('__', '_')","def __format__(self, format_spec):\n # Reject anything that isn't an s\n if format_spec[-1] != 's':\n raise ValueError('{} format specifier not understood for this object',\n format_spec[:-1])\n # Output in this example will be (<a>,<b>,<c>)\n raw = \"(\" + \",\".join([str(self.a), str(self.b), str(self.c)]) + \")\"\n # Honor the format language by using the inbuilt string format\n # Since we know the original format_spec ends in an 's'\n # we can take advantage of the str.format method with a\n # string argument we constructed above\n return \"{r:{f}}\".format( r=raw, f=format_spec )","def _format_parameter_output(self, parameters: dict) -> str:\n \n output = ''\n for key, value in parameters.items():\n output = output + '\\t\\t' + str(key) + ': ' + str(value) + '\\n'\n \n return output","def format_parameter_list(parameters):\n items = sorted(dict(parameters).items())\n return \" \".join([\"=\".join([key, repr(str(value))]) for (key,value) in items])","def getString(self):\n string = self.itemType.find('format').text.strip()\n paramString = string[string.find('('):]\n string = string[:string.find('(')]\n for i in self.params.keys():\n paramString = paramString.replace(i,str(self.params[i]) if isFloat(str(self.params[i])) else '\"'+str(self.params[i]).replace('\"','\\\\\"')+'\"',1)\n return string+paramString","def get_param_htmldesc(linker, func):\r\n import inspect\r\n # XXX copy and modify formatargspec to produce html\r\n return inspect.formatargspec(*inspect.getargspec(func))","def format_param_pairs(self, params_pairs):\n out = \"\"\n for param in params_pairs:\n out += \"{} {} \".format(*param)\n return out","def _pretty_print(self,s):\n if not self.pretty_parameters:\n return s\n else:\n n = s.replace(\"_\",\" \")\n n = n.capitalize()\n return n","def __make_description(self, param_name):\n value = self._status.get_value(param_name)\n if round(value) != value:\n # Parameter is a float. Limit to three decimals.\n value = \"%.3f\" % (value)\n\n return \"%s (%s)\" % (param_name, str(value))","def format(*args, stringArg: Union[AnyStr, List[AnyStr]]=\"\", **kwargs)->AnyStr:\n pass","def get__repr__(self, params):\n\n def format_params(params1):\n if at_least_python3:\n items = params1.items()\n else:\n items = list(params1.items())\n for k, v in sorted(items, key=itemgetter(0), reverse=True):\n is_text = isinstance(v, str)\n if is_text and not at_least_python3:\n v = v.encode('utf-8')\n yield '{k}=\"{v}\"'.format(k=k, v=v) if is_text else '{k}={v}'.format(k=k, v=v)\n\n return '{class_name}({params})'.format(\n class_name=self.__class__.__name__,\n params=\", \".join(list(format_params(params)))\n )","def __format__(self, formatstr):\n if formatstr.strip() == '': # Defualt behaviour mirrors self.__str__()\n formatstr = '+.3f'\n\n string = \\\n \"{:\" + formatstr +\"} \" + \\\n \"{:\" + formatstr +\"}i \" + \\\n \"{:\" + formatstr +\"}j \" + \\\n \"{:\" + formatstr +\"}k\"\n return string.format(self.q[0], self.q[1], self.q[2], self.q[3])","def dict2argstr(d: Dict[str, Any]) -> str:\n return \",\".join(\"{!s}={!r}\".format(key, val) for (key, val) in d.items())","def docstring_format(*values):\n\n def _decorator_(function):\n function.__doc__ = function.__doc__.format(*values).replace('_', '\\_')\n return function\n\n return _decorator_","def str_replace(data):\n for key, value in data.items():\n if isinstance(value, (str, unicode)):\n data[key] = value.format(**data)","def make_attrs(self, mixed):\n if isinstance(mixed, dict):\n return ''.join('%s=\"%s\" ' % (k, v) for k, v in mixed.items())\n return str(mixed)","def line_replacer(config,change_this_line,key):\n for arg in config['HyperParameter'][key]: \n pattern=r'{}[ ]*=.*,'.format(arg)\n replace_value=config['HyperParameter'][key][arg][counter]\n if type(replace_value) is str:\n replace_value=\"'\"+replace_value+\"'\"\n change_this_line=re.sub(pattern,\"{}= {},\".format(arg,replace_value),change_this_line)\n return change_this_line","def formatted_loss_components_string(components: dict) -> str:\n total_loss = components['L_V']+components['L_beta']\n fractions = { k : v/total_loss for k, v in components.items() }\n fkey = lambda key: f'{components[key]:+.4f} ({100.*fractions[key]:.1f}%)'\n s = (\n 'L_V+L_beta = {L:.4f}'\n '\\n L_V = {L_V}'\n '\\n L_V_attractive = {L_V_attractive}'\n '\\n L_V_repulsive = {L_V_repulsive}'\n '\\n L_beta = {L_beta}'\n '\\n L_beta_noise = {L_beta_noise}'\n '\\n L_beta_sig = {L_beta_sig}'\n .format(L=total_loss,**{k : fkey(k) for k in components})\n )\n if 'L_beta_norms_term' in components:\n s += (\n '\\n L_beta_norms_term = {L_beta_norms_term}'\n '\\n L_beta_logbeta_term = {L_beta_logbeta_term}'\n .format(**{k : fkey(k) for k in components})\n )\n return s","def build_format(i, ex, args, meta_args):\n formatter = string.Formatter()\n format_string = meta_args.format_string\n fields = list(formatter.parse(format_string))\n\n kwarg_fields = []\n indexed_fields = []\n\n i.result = hive.variable('str')\n i.result_out = hive.pull_out(i.result)\n\n for index, field in enumerate(fields):\n literal_text = field[1]\n\n if literal_text is None:\n continue\n\n if not literal_text.isidentifier():\n field_name = \"field_{}\".format(index)\n indexed_fields.append(field_name)\n\n else:\n field_name = literal_text\n kwarg_fields.append(field_name)\n\n # Create IO\n attr = hive.variable()\n setattr(i, field_name, attr)\n\n in_attr = hive.pull_in(attr)\n setattr(i, \"{}_in\".format(field_name), in_attr)\n\n setattr(ex, field_name, hive.antenna(in_attr))\n hive.trigger(i.result_out, in_attr, pretrigger=True)\n\n ex.result = hive.output(i.result_out)\n\n def do_format(self):\n args = [getattr(self, \"_{}\".format(attr_name)) for attr_name in indexed_fields]\n kwargs = {attr_name: getattr(self, \"_{}\".format(attr_name)) for attr_name in kwarg_fields}\n self._result = formatter.format(format_string, *args, **kwargs)\n\n i.func = hive.modifier(do_format)\n hive.trigger(i.result_out, i.func, pretrigger=True)","def format_invocation(name='', args=(), kwargs=None, **kw):\n _repr = kw.pop('repr', bbrepr)\n if kw:\n raise TypeError('unexpected keyword args: %r' % ', '.join(kw.keys()))\n kwargs = kwargs or {}\n a_text = ', '.join([_repr(a) for a in args])\n if isinstance(kwargs, dict):\n kwarg_items = [(k, kwargs[k]) for k in sorted(kwargs)]\n else:\n kwarg_items = kwargs\n kw_text = ', '.join(['%s=%s' % (k, _repr(v)) for k, v in kwarg_items])\n\n all_args_text = a_text\n if all_args_text and kw_text:\n all_args_text += ', '\n all_args_text += kw_text\n\n return '%s(%s)' % (name, all_args_text)","def __format__(self, *args, **kwargs): # real signature unknown\r\n pass","def format(query: str) -> str:\n return query.format(**Constants.to_dict())","def field(*args, **kwargs):\n\n alias = None\n name = None\n if len(args) == 1:\n name = args[0]\n elif len(args) == 2:\n alias, name = args\n else:\n raise ValueError(\"Field name or alias and name must be provided to 'field', got '{}'\".format(args))\n\n result = \"\"\n if alias:\n result = \"{}: \".format(alias)\n\n if not kwargs:\n return result + name\n\n result += \"{}({})\".format(\n name,\n \", \".join([\"{}: {}\".format(k, params(v)) for k, v in sorted(kwargs.items())])\n )\n\n return result","def _interpolate(string):\n return string % env.project","def test_extra_with_string_format():\n tree = parse(dedent(\"\"\"\\\n import logging\n\n logging.info(\n \"Hello {world}!\",\n extra=dict(\n world=\"{}\".format(\"World\"),\n ),\n )\n \"\"\"))\n visitor = LoggingVisitor()\n visitor.visit(tree)\n\n assert_that(visitor.violations, is_(empty()))","def test_nested_format_fields():\n '{0:>{1}}'.format(42, 24)\n '{0:{a[1]}} {a}'.format(1, a=[1, 2])\n '{:>{}}'.format(42, 24)\n '{0:>{1}}'.format(42)\n '{0:>{1}}'.format(42, 24, 54)\n ##Warn: W1303\n '{0:{a[1]}}'.format(1)\n ##Warn: W1306\n '{0:{a.x}}'.format(1, a=2)","def format_parameter_value(self, param_config, precision):\n # type: (Dict[str, Any], int) -> str\n return \"\"","def docfmt(**kwargs):\n kwargs = {k: v.lstrip() for k, v in kwargs.items()}\n\n def outer(fn):\n buf = []\n if fn.__doc__ is None:\n return fn\n formatsiter = string.Formatter().parse(fn.__doc__)\n for literal, field, fmtspec, conv in formatsiter:\n assert conv is None\n assert not fmtspec\n buf.append(literal)\n if field is not None:\n # get indentation\n lines = literal.rsplit(\"\\n\", 1)\n if _only_spaces(lines[-1]):\n indent = \" \" * len(lines[-1])\n valuelines = kwargs[field].splitlines(True)\n # first line\n buf.append(valuelines[0])\n # subsequent lines are indented\n buf.extend([indent + ln for ln in valuelines[1:]])\n else:\n buf.append(kwargs[field])\n fn.__doc__ = \"\".join(buf)\n return fn\n\n return outer","def format_arg(namespace, arg, lex):\n if lex and arg[0] in ('[', '('):\n return arg[0] + namespace + arg[1:]\n try:\n return namespace + arg\n except:\n return str.encode(namespace) + arg","def __format__(self, fmt):\n if not isinstance(fmt, str):\n raise TypeError(\"must be str, not %s\" % type(fmt).__name__)\n if len(fmt) != 0:\n return self.strftime(fmt)\n return str(self)","def replace_params(template, data):\n\t# Find all variables between curly braces, potentially with some spaces\n\tmatches = re.findall(\"({{\\s*)(\\w+(-\\w+)*)(\\s*}})\", template)\n\t# Process the matches\n\tfor match in matches:\n\t\tkey = match[1]\n\t\tif key in data:\n\t\t\ttemplate = template.replace(match[0] + match[1] + match[3], data[key])\n\t\t# If no data supplied in dictionary, that was an optional parameter, just delete it\n\t\telse:\n\t\t\ttemplate = template.replace(match[0] + match[1] + match[3], \"\")\n\treturn template","def format(value):\n if isinstance(value, str):\n return '\"{}\"'.format(value)\n if isinstance(value, bool):\n return 'true' if value is True else 'false'\n elif isinstance(value, dict):\n assert False, 'Not implemented for dictionary type'\n elif hasattr(value, '__len__'): # should cover list and numpy array\n return '{{{}}}'.format(', '.join([str(v) for v in value]))\n else: # assume scalar value\n return value","def decorate(cls, attr_names=None, **kwargs):\n if attr_names is None:\n attr_names = ()\n elif not isinstance(attr_names,(list,tuple)):\n raise DecoError('type {} not accepted for list/tuple of decorated members'.format(type(attr_names)))\n # various local objects\n obj_decorator = cls._format_obj(**kwargs)#analysis:ignore\n format_decorator = cls.format(**kwargs)#analysis:ignore\n str_format = lambda s: s.format(**kwargs) if s is not None else '' \n special_members = ['__metaclass__','__module__','__weakref__','__dict__','__class__']#analysis:ignore\n def decorator(obj, obj_name=None):\n # deal with special '__doc__' member\n if obj_name=='__doc__':\n try: \n return str_format(obj)\n except: return obj or ''\n # don't consider other special members and other special members unless \n # it is explicitely to decorate them (e.g. __init__)\n elif obj_name in special_members: \\\n # or (obj_name.startswith('__') and obj_name.endswith('__') and obj_name not in attr_names):\n return obj\n # deal with properties\n elif isinstance(obj, property): \n try: \n return property(obj.__get__, obj.__set__, obj.__delattr__, str_format(obj.__doc__))\n except: return obj # e.g. property not decorated\n # deal with class members\n elif inspect.isclass(obj):\n try: \n return cls.format_class(**kwargs)(obj) \n except: return obj\n # deal with method members\n elif inspect.isroutine(obj): # inspect.ismethod(obj):\n try: \n return cls.format_method(**kwargs)(obj) \n except: return obj\n ## deal with attribute members\n else: \n try: # whenever __doc__ is writeable\n obj.__doc__ = obj_decorator(obj)\n return obj\n except: \n return obj\n return class_decorator(decorator, *attr_names)","def formatargspec(args, varargs=None, varkw=None, defaults=None,\r\n formatarg=str,\r\n formatvarargs=lambda name: '*' + name,\r\n formatvarkw=lambda name: '**' + name,\r\n formatvalue=lambda value: '=' + repr(value),\r\n join=joinseq):\r\n specs = []\r\n if defaults:\r\n firstdefault = len(args) - len(defaults)\r\n for i, arg in enumerate(args):\r\n spec = strseq(arg, formatarg, join)\r\n if defaults and i >= firstdefault:\r\n spec = spec + formatvalue(defaults[i - firstdefault])\r\n specs.append(spec)\r\n if varargs is not None:\r\n specs.append(formatvarargs(varargs))\r\n if varkw is not None:\r\n specs.append(formatvarkw(varkw))\r\n return '(' + string.join(specs, ', ') + ')'","def substitutes(string, **kwargs):\n return json.dumps(substitute(json.loads(string), **kwargs))","def test__str__and__repr__(self, kwargs, expected):\n fparam = FParameter(**kwargs)\n assert str(fparam) == expected\n assert repr(fparam) == '<FParameter \"{}\">'.format(expected)","def info(capsys, format_str, format_args=None):\n\n if format_args is not None:\n msg = (format_str % format_args)\n else:\n msg = format_str\n\n with capsys.disabled():\n print(msg)","def _safe_attr(attr, camel_killer=False, replacement_char='x'):\n allowed = string.ascii_letters + string.digits + '_'\n attr = _safe_key(attr)\n if camel_killer:\n attr = _camel_killer(attr)\n attr = attr.replace(' ', '_')\n out = ''\n for character in attr:\n out += character if character in allowed else '_'\n out = out.strip('_')\n try:\n int(out[0])\n except (ValueError, IndexError):\n pass\n else:\n out = '{0}{1}'.format(replacement_char, out)\n if out in kwlist:\n out = '{0}{1}'.format(replacement_char, out)\n return re.sub('_+', '_', out)","def dict(self, arg: SeField[Any]) -> str:\n if is_bare_dict(arg.type):\n return arg.varname\n else:\n karg = arg[0]\n karg.name = \"k\"\n varg = arg[1]\n varg.name = \"v\"\n return f\"{{{self.render(karg)}: {self.render(varg)} for k, v in {arg.varname}.items()}}\"","def sformatf(cls, msg, *args):\n #formats = {\"%t\": \"%d\", \"%0t\": \"%0d\"}\n #for s in formats:\n # msg = msg.replace(s, formats[s])\n #return sformatf(msg, *args)\n # TODO substitute old types %s/%d etc with {}\n #new_msg = cls.STR_RE.sub(r'{:\\1}', msg)\n #print(\"new_msg is \" + new_msg)\n for s in cls.formats:\n if s == \"%h\" or s == \"%0h\":\n msg = msg.replace(s, \"{:X}\")\n else:\n msg = msg.replace(s, \"{}\")\n return msg.format(*args)"],"string":"[\n \"def replace_param(string, param, value, param_format=None):\\n\\n if param_format == \\\"json\\\":\\n return sub(r\\\"(?P<json_replacement>\\\\\\\"%s\\\\\\\"\\\\s*:\\\\s*)\\\\\\\"\\\\s*\\\\\\\"\\\" %\\n escape(str(param)), \\\"\\\\\\\\1\\\\\\\"%s\\\\\\\"\\\" % value, string)\\n elif param_format == \\\"header\\\":\\n return sub(r\\\"%s=[^\\\\\\\\n]*\\\" % escape(str(param)), r\\\"%s=%s\\\" %\\n (str(param).encode('string-escape'),\\n str(value).encode('string-escape')), string)\\n else:\\n return sub(r\\\"%s=[^&]*\\\" % escape(str(param)), r\\\"%s=%s\\\" %\\n (str(param).encode('string-escape'),\\n str(value).encode('string-escape')), string)\",\n \"def _params_formatter(field, description):\\n heads = ['param']\\n types = _or_types(field)\\n if types:\\n heads.append(types)\\n heads.append(rst.escape(field['name']))\\n tail = description\\n return heads, tail\",\n \"def _replace_params(self, text: str, control: cat.Control, param_dict: Dict[str, prof.SetParameter]) -> str:\\n if control.params is not None:\\n for param in control.params:\\n # set default if no information available for text\\n param_text = f'[{param.id} = no description available]'\\n set_param = param_dict.get(param.id, None)\\n # param value provided so just replace it\\n if set_param is not None:\\n values = [value.__root__ for value in set_param.values]\\n param_text = values[0] if len(values) == 1 else f\\\"[{', '.join(values)}]\\\"\\n else:\\n # if select present, use it\\n if param.select is not None:\\n param_text = '['\\n if param.select.how_many is not None:\\n param_text += f'{param.select.how_many.value}: '\\n if param.select.choice is not None:\\n param_text += ', '.join(param.select.choice)\\n param_text = f'{param_text}]'\\n # else use the label\\n if param.label is not None:\\n param_text = f'[{param.label}]'\\n # this needs to be a regex match to distinguish param_1 from param_10\\n pattern = re.compile(f'{param.id}(?:[^0-9a-zA-Z._\\\\-#@])')\\n text = pattern.sub(param_text, text)\\n\\n # strip {{ }}\\n pattern = re.compile('( *{{| *}})')\\n text = pattern.sub('', text)\\n text = text.replace('insert: param, ', '').strip()\\n\\n return text\",\n \"def _process_str(self, fmt, *args, **kwargs):\\n log_str = fmt\\n if len(args) > 0 or len(kwargs) > 0:\\n log_str = fmt.format(*args, **kwargs)\\n\\n return log_str\",\n \"def _wrap_attr(attr):\\n return '={0},'.format(attr)\",\n \"def format_parameter(param, required):\\n\\n param_string = check_param(flatten_param(param))\\n if not required:\\n param_string += '=None'\\n return param_string\",\n \"def _parameterize_string(raw):\\n\\n parts = []\\n s_index = 0\\n\\n for match in _PARAMETER_PATTERN.finditer(raw):\\n parts.append(raw[s_index:match.start()])\\n parts.append({u\\\"Ref\\\": match.group(1)})\\n s_index = match.end()\\n\\n if not parts:\\n return GenericHelperFn(raw)\\n\\n parts.append(raw[s_index:])\\n return GenericHelperFn({u\\\"Fn::Join\\\": [u\\\"\\\", parts]})\",\n \"def _params_formatter(field):\\n heads = ['param']\\n types = _or_types(field)\\n if types:\\n heads.append(types)\\n heads.append(field['name'])\\n tail = field.get('description', '')\\n return heads, tail\",\n \"def call_str(pvs):\\n s = \\\"'{}', '{}'\\\".format(pvs.get('place'), pvs.get('stat_var'))\\n if pvs.get('measurement_method'):\\n s += \\\", measurement_method='{}'\\\".format(\\n pvs.get('measurement_method'))\\n if pvs.get('observation_period'):\\n s += \\\", observation_period='{}'\\\".format(\\n pvs.get('observation_period'))\\n if pvs.get('unit'):\\n s += \\\", unit='{}'\\\".format(pvs.get('unit'))\\n if pvs.get('scaling_factor'):\\n s += \\\", scaling_factor={}\\\".format(pvs.get('scaling_factor'))\\n return s\",\n \"def change_format_var_parser(text, tracker):\\n param_names = format_var_parser(text)\\n param_vars = {}\\n for param_name in param_names:\\n try:\\n param_vars[param_name] = tracker.get_slot(param_name)\\n except Exception as e:\\n PYTHON_LOGGER.error(\\\"Error to get var name {}: {}\\\".format(param_name, e))\\n return text.format(**param_vars)\",\n \"def format(self):\\n groups = [g + \\\".\\\" for g in self.groups]\\n params = [\\\";\\\" + p.format() for p in self.params]\\n groups_name_params = \\\"\\\".join(groups) + self.name + \\\"\\\".join(params)\\n return groups_name_params + \\\":\\\" + self.format_value() + CRLF\",\n \"def format_arguments(data: Dict) -> str:\\n\\n def prep(key: str, value: Any) -> str:\\n if isinstance(value, str):\\n value = f'''\\\"{value.replace('\\\"', \\\"'\\\")}\\\"'''\\n if key == \\\"pattern\\\":\\n value = f\\\"r{value}\\\"\\n return f\\\"{key}={value}\\\"\\n\\n return \\\",\\\\n\\\".join([prep(key, value) for key, value in data.items()])\",\n \"def format(self, *args, **kwargs) -> String:\\n pass\",\n \"def test_mixed_manual_positional_arguments_with_attribute_access_arguments():\\n '{0}{1[FOO]}'.format(123, {'FOO': 456})\\n '{0}{1[FOO]}'.format(123, {'FOO': 456}, 321)\\n '{0}{1[FOO]}'.format(123)\",\n \"def format(value, arg):\\n try:\\n if value is not None:\\n # return (str(arg)) % value\\n return (str(value)) % arg\\n else:\\n return \\\"\\\"\\n except (ValueError, TypeError):\\n return \\\"\\\"\",\n \"def format_string(self, template):\\n out_str = \\\"\\\"\\n search_property_name = \\\"\\\"\\n in_property = False\\n for char in template:\\n if (in_property):\\n if (char == '%'):\\n if (len(search_property_name) > 0):\\n prop_value = \\\"\\\"\\n try:\\n prop_value = str(self.get_property(search_property_name))\\n except KeyError:\\n pass\\n out_str += prop_value\\n search_property_name = \\\"\\\"\\n in_property = False\\n else:\\n search_property_name += char\\n else:\\n if (char == '%'):\\n in_property = True\\n else:\\n out_str += char\\n\\n # Handle unterminated property names\\n if (in_property):\\n out_str += '%'\\n out_str += search_property_name\\n\\n return out_str\",\n \"def pformat(class_instance):\\n s = ''\\n for var, val in vars(class_instance).items():\\n s += var + ': ' + str(val) + '\\\\n'\\n return s[:-1]\",\n \"def format(self, value, key=None, **kwargs):\\n if not isinstance(value, str):\\n return value\\n\\n # always format strings using the root so the full path is available\\n if self.root:\\n return self.root.format(value, key, **kwargs)\\n\\n variables = CONFIG_VARIABLE_PATTERN.findall(value)\\n expanded = {}\\n for variable in variables:\\n if variable not in kwargs:\\n try:\\n root_key = variable.split(\\\".\\\")[0]\\n root = self.root if self.root else self\\n\\n expanded[root_key] = self.format(getattr(root, root_key), variable, **kwargs)\\n except AttributeError:\\n raise MissingConfiguration(variable, key)\\n\\n expanded.update(**kwargs)\\n return value.format(**expanded)\",\n \"def format(self, valDict):\\n return self._formatStr % valDict\",\n \"def replace_param_occurrences(string, params):\\n for k, v in params.items():\\n string = string.replace(k, str(v))\\n return string\",\n \"def __repr_parameter__(self, name: str, value: Any) -> str:\\n return f\\\"{name}={value!r}\\\"\",\n \"def param_str(self, pnames=None):\\n l = self.get_params(pnames)\\n s = \\\"\\\"\\n for p in l:\\n s += \\\"%s : %s\\\\n\\\" % (p.public_name, p.tostr(self))\\n return s\",\n \"def printParameter (a,b):\\n print(a)\\n print(b)\\n print(\\\"this is formating of {} and {}\\\".format(a,b))\",\n \"def string(self, string, values=None):\\n if values:\\n values = self.values(values)\\n return string.format(*values)\\n return string\",\n \"def __str__(self):\\n return self.fmt.format(*self.args, **self.kwargs)\",\n \"def get_str(self, item: str, fmt: str = \\\"{}\\\") -> str:\\n return fmt.format(self[item])\",\n \"def format_directive(module, package=None):\\n directive = '.. automodule:: %s\\\\n' % makename(package, module)\\n for option in OPTIONS:\\n directive += ' :%s:\\\\n' % option\\n return directive\",\n \"def autoformat(\\n cls: Type[U] = None,\\n /,\\n params: Union[str, Iterable[str]] = ( # pylint: disable=unsubscriptable-object\\n \\\"message\\\",\\n \\\"msg\\\",\\n ),\\n):\\n if isinstance(params, str):\\n params = (params,)\\n\\n if cls is None:\\n return functools.partial(autoformat, params=params)\\n\\n orig_init = cls.__init__\\n signature = inspect.signature(orig_init)\\n params = signature.parameters.keys() & set(params)\\n\\n @functools.wraps(orig_init)\\n def init(*args, **kwargs):\\n bounds = signature.bind(*args, **kwargs)\\n bounds.apply_defaults()\\n pre_formatted = {\\n name: bounds.arguments.pop(name)\\n for name in params\\n if name in bounds.arguments\\n }\\n formatted = {\\n name: string.format(**bounds.arguments)\\n for name, string in pre_formatted.items()\\n }\\n for name, arg in formatted.items():\\n bounds.arguments[name] = arg\\n return orig_init(*bounds.args, **bounds.kwargs)\\n\\n # init.__signature__ = signature\\n setattr(cls, \\\"__init__\\\", init)\\n return cls\",\n \"def __getattr__(self, name):\\n if name in self:\\n if (isinstance(self[name], dict)):\\n return self._format_dict(self[name])\\n else:\\n return str(self[name])\\n else:\\n return \\\"\\\"\",\n \"def format_string(self, pat=None, pat_args={}):\\n if pat is None:\\n pat = self.parent.pat\\n if pat_args == {}:\\n pat_args = self.parent.pat_args\\n return entry_format.output(self, pat, pat_args)\",\n \"def repr_str(obj, attrs, update=None):\\n props = [\\n (attr, value)\\n for attr, value in (\\n (attr, getattr(obj, attr))\\n for attr in attrs\\n )\\n if value is not None\\n ]\\n\\n if update is not None:\\n props = update(props)\\n\\n props_str = ', '.join('%s=%s' % (attr, value) for attr, value in props)\\n return \\\"<{klass}: {props_str}>\\\".format(\\n klass=obj.__class__.__name__,\\n props_str=props_str,\\n )\",\n \"def replace_in_string(s, args_dict):\\n for key, value in args_dict.items():\\n s = s.replace(key, value)\\n for key, value in args_dict.items():\\n s = s.replace(key, value)\\n for key, value in args_dict.items():\\n s = s.replace(key, value)\\n return s\",\n \"def _printAttributePrintf(self, formatting, value):\\n\\n # multiple entrys\\n if isinstance(formatting, list):\\n\\n for scanf_format in formatting:\\n try:\\n #print \\\"-->>\\\", scanf_format, value\\n return scanf_format % value\\n except TypeError, e:\\n pass\\n\\n # single entry\\n else:\\n return formatting % value\\n\\n # problem if none of the formats worked\\n raise TypeError(\\\"Valid format not found for values.\\\")\",\n \"def format_attributes(attributes):\\n return ';'.join([k + '=' + v for k, v in attributes.items()])\",\n \"def format(*args, **kwargs):\\n if args:\\n print ', '.join([str(s) for s in args])\\n if kwargs:\\n sub_items = []\\n for k, v in kwargs.items():\\n sub_items.append('{}={}'.format(k, v))\\n print ', '.join(sub_items)\",\n \"def _format_api_string(self):\\n api_string = self.api_name\\n arg_string_list = []\\n if not self.api_args is None and \\\\\\n len(self.api_args) > 0:\\n for key in self.api_args:\\n try:\\n value = self.api_args[key]\\n except TypeError:\\n #assert False, f\\\"node: {self.api_name} key: {key} bad arg: {self.api_args}\\\" + \\\\\\n # f\\\" type: {self.api_args.__class__.__name__}\\\"\\n print(f\\\"node: {self.api_name} key: {key} bad arg: {self.api_args}\\\" + \\\\\\n f\\\" type: {self.api_args.__class__.__name__}\\\")\\n raise TypeError\\n if isinstance(value, list):\\n value_string = \\\"[ \\\" + \\\",\\\".join([self._api_value_string(x) for x in value]) + \\\" ]\\\"\\n else:\\n if value is None:\\n assert False, f\\\"key={key}\\\"\\n value_string = self._api_value_string(value)\\n arg_string_list.append(f\\\"{key}:{value_string}\\\")\\n api_string += \\\"(\\\" + \\\" \\\".join(arg_string_list) + \\\")\\\"\\n #assert False, f\\\"{self.api_name}: {api_string}\\\"\\n return api_string\",\n \"def format(obj): # pylint: disable=W0622\\n# print '>>', obj\\n if hasattr(obj, 'format'):\\n return obj.format()\\n return \\\"%s\\\" % obj\",\n \"def make_string_repr(instance):\\n arg_list = [] if args is None else [getattr(instance, arg) for arg in args if hasattr(instance, arg)]\\n\\n kwarg_dict = {} if kwargs is None else {key: getattr(instance, key) for key in kwargs if hasattr(instance, key)}\\n\\n # Check that we could bind the args/kwargs that found matches to the __init__ method\\n # Basically this is checking that any arguments we didn't find on the instance have default values\\n signature(instance.__class__).bind(*arg_list, **kwarg_dict)\\n\\n return instance.__class__.__name__ + '(' + format_arguments(*arg_list, **kwarg_dict) + ')'\",\n \"def update_placeholder_formats(self, format_string, placeholder_formats):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if (\\n token.group(\\\"placeholder\\\")\\n and (not token.group(\\\"format\\\"))\\n and token.group(\\\"key\\\") in placeholder_formats\\n ):\\n output.append(f\\\"{{{token.group('key')}{placeholder_formats[token.group('key')]}}}\\\")\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def call_spec_string():\\n # pylint: disable=protected-access\\n frame = sys._getframe(1)\\n argvals = inspect.getargvalues(frame)\\n if argvals.args[0] == 'self':\\n return inspect.formatargvalues(argvals.args[1:], *argvals[1:])\\n else:\\n return inspect.formatargvalues(*argvals)\",\n \"def string_for_attrs(attrs):\\n if not attrs: return ''\\n return ''.join(' %s=\\\"%s\\\"' % (attr, value) for attr, value in attrs)\",\n \"def format(self, **kw):\\n params = self.defaults.copy()\\n params.update(kw)\\n if self.filter:\\n self.filter(self, params)\\n msg = self.msg\\n if self.key is not None:\\n key = self.key.format(**params)\\n msg = msg[key]\\n return msg.format(**params)\",\n \"def format_field(self, value, spec):\\n cache = Cache()\\n if spec == \\\"co\\\":\\n # if cache(re.match(\\\"(.*)co$\\\", spec)):\\n value = co_join(value)\\n spec = \\\"s\\\"\\n # cache.output.group(1) + \\\"s\\\"\\n elif cache(re.match(r\\\"^sub(\\\\d?)_?(.*)$\\\", spec)):\\n depth = (1 if cache.output.group(1) == \\\"\\\" else\\n int(cache.output.group(1)))\\n value = \\\"\\\\n\\\".join([\\n \\\"{0}{1} = {2}\\\".format(depth * \\\" \\\", key, val)\\n for key, val in value.items()])\\n if cache.output.group(2) != \\\"\\\":\\n value = (\\n depth * \\\"[\\\" + cache.output.group(2) + depth * \\\"]\\\" + \\\"\\\\n\\\" +\\n value)\\n spec = \\\"s\\\"\\n return super(Format, self).format_field(value, spec)\",\n \"def reparam(string_, dictionary):\\n dictionary = dictionary.copy() # eval mucks with it\\n # disable builtins to avoid risk for remote code exection.\\n dictionary['__builtins__'] = object()\\n vals = []\\n result = []\\n for live, chunk in _interpolate(string_):\\n if live:\\n v = eval(chunk, dictionary)\\n result.append(sqlquote(v))\\n else: \\n result.append(chunk)\\n return SQLQuery.join(result, '')\",\n \"def render_param(self, format):\\n\\t\\tdef renderer(ctx, data):\\n\\t\\t\\tparName = ctx.tag.children[0].strip()\\n\\t\\t\\tctx.tag.clear()\\n\\t\\t\\ttry:\\n\\t\\t\\t\\tval = data.getParam(parName)\\n\\t\\t\\t\\tif val is None:\\n\\t\\t\\t\\t\\treturn ctx.tag[\\\"N/A\\\"]\\n\\n\\t\\t\\t\\treturn ctx.tag[format%val]\\n\\t\\t\\texcept base.NotFoundError:\\n\\t\\t\\t\\treturn ctx.tag[\\\"N/A\\\"]\\n\\t\\treturn renderer\",\n \"def update_placeholders(self, format_string, placeholders):\\n # Tokenize the format string and process them\\n output = []\\n for token in self.tokens(format_string):\\n if token.group(\\\"key\\\") in placeholders:\\n output.append(\\n \\\"{{{}{}}}\\\".format(placeholders[token.group(\\\"key\\\")], token.group(\\\"format\\\"))\\n )\\n continue\\n elif token.group(\\\"command\\\"):\\n # update any placeholders used in commands\\n commands = parse_qsl(token.group(\\\"command\\\"), keep_blank_values=True)\\n # placeholders only used in `if`\\n if \\\"if\\\" in [x[0] for x in commands]:\\n items = []\\n for key, value in commands:\\n if key == \\\"if\\\":\\n # we have to rebuild from the parts we have\\n condition = Condition(value)\\n variable = condition.variable\\n if variable in placeholders:\\n variable = placeholders[variable]\\n # negation via `!`\\n not_ = \\\"!\\\" if not condition.default else \\\"\\\"\\n condition_ = condition.condition or \\\"\\\"\\n # if there is no condition then there is no\\n # value\\n if condition_:\\n value_ = condition.value\\n else:\\n value_ = \\\"\\\"\\n value = \\\"{}{}{}{}\\\".format(not_, variable, condition_, value_)\\n if value:\\n items.append(f\\\"{key}={value}\\\")\\n else:\\n items.append(key)\\n\\n # we cannot use urlencode because it will escape things\\n # like `!`\\n output.append(r\\\"\\\\?{} \\\".format(\\\"&\\\".join(items)))\\n continue\\n value = token.group(0)\\n output.append(value)\\n return \\\"\\\".join(output)\",\n \"def formatargvalues(args, varargs, varkw, locals,\\r\\n formatarg=str,\\r\\n formatvarargs=lambda name: '*' + name,\\r\\n formatvarkw=lambda name: '**' + name,\\r\\n formatvalue=lambda value: '=' + repr(value),\\r\\n join=joinseq):\\r\\n def convert(name, locals=locals,\\r\\n formatarg=formatarg, formatvalue=formatvalue):\\r\\n return formatarg(name) + formatvalue(locals[name])\\r\\n specs = []\\r\\n for i in range(len(args)):\\r\\n specs.append(strseq(args[i], convert, join))\\r\\n if varargs:\\r\\n specs.append(formatvarargs(varargs) + formatvalue(locals[varargs]))\\r\\n if varkw:\\r\\n specs.append(formatvarkw(varkw) + formatvalue(locals[varkw]))\\r\\n return '(' + string.join(specs, ', ') + ')'\",\n \"def _formatted_string(self, message: str, dict_values: dict) -> str:\\n formatted_values = self._format_values_in_map(dict_values)\\n return message.format(**formatted_values)\",\n \"def format_person(adj, dict):\\n name = dict['name']\\n net = int(dict['net_worth (USD)'])\\n return \\\"The {0} person is {1}. They have a net worth of ${2:,}\\\".format(adj, name, net)\",\n \"def format_params(self, params):\\n return params\",\n \"def safe_format(\\n format: str,\\n dictionary: dict[str, Any],\\n types: set[type[Any]] | None = None,\\n adapt: 'Callable[[str], str] | None' = None,\\n raise_on_missing: bool = False\\n) -> str:\\n\\n types = types or {int, str, float}\\n output = StringIO()\\n buffer = StringIO()\\n opened = 0\\n\\n for ix, char in enumerate(format):\\n if char == '[':\\n opened += 1\\n\\n if char == ']':\\n opened -= 1\\n\\n if opened == 1 and char != '[' and char != ']':\\n print(char, file=buffer, end='')\\n continue\\n\\n if opened == 2 or opened == -2:\\n if buffer.tell():\\n raise RuntimeError(\\\"Unexpected bracket inside bracket found\\\")\\n\\n print(char, file=output, end='')\\n opened = 0\\n continue\\n\\n if buffer.tell():\\n k = adapt(buffer.getvalue()) if adapt else buffer.getvalue()\\n\\n if raise_on_missing and k not in dictionary:\\n raise RuntimeError(\\\"Key '{}' is unknown\\\".format(k))\\n\\n v = dictionary.get(k, '')\\n t = type(v)\\n\\n if t not in types:\\n raise RuntimeError(\\\"Invalid type for '{}': {}\\\".format(k, t))\\n\\n print(v, file=output, end='')\\n buffer = StringIO()\\n\\n if char != '[' and char != ']':\\n print(char, file=output, end='')\\n\\n if opened != 0:\\n raise RuntimeError(\\\"Uneven number of brackets in '{}'\\\".format(format))\\n\\n return output.getvalue()\",\n \"def format(fmt, st):\\n ret = \\\"\\\"\\n if not st: return ret\\n if fmt not in valid_combos:\\n return st\\n cm = charmap[fmt]\\n for c in st:\\n ret += cm.get(c, c)\\n return ret\",\n \"def format_arg(arg_name: str, value: Any, max_length: int = 200) -> str:\\n return \\\"{arg_name}={value}\\\".format(\\n arg_name=arg_name, value=trim_string(repr(value), max_length=max_length)\\n )\",\n \"def attr(*attrs: ATTRIBUTE) -> str:\\n formatted = []\\n for attr_ in attrs:\\n if isinstance(attr_, str):\\n formatted.append(attr_)\\n elif isinstance(attr_, tuple) and len(attr_) == 2:\\n formatted.append(f'{attr_[0]}=\\\"{attr_[1]}\\\"')\\n else:\\n raise ValueError(f\\\"Bad attribute: {attr_}\\\")\\n return \\\" \\\".join(formatted)\",\n \"def render_attr(key, value, attr_format='{key}=\\\"{value}\\\"'):\\n\\n if not key or ' ' in key:\\n raise InvalidAttribute('Invalid name \\\"{}\\\"'.format(key))\\n\\n if value:\\n if type(value) is RawNode:\\n value = str(value)\\n else:\\n value = html.escape(str(value))\\n\\n return attr_format.format(key=key, value=value)\\n\\n return key\",\n \"def FillForm(string_for_substitution, dictionary_of_vars):\\n return_string = string_for_substitution\\n for i in re.findall(\\\"//%%(.*)%%//\\\", string_for_substitution):\\n return_string = re.sub(\\\"//%%\\\" + i + \\\"%%//\\\", dictionary_of_vars[i],\\n return_string)\\n return return_string\",\n \"def trans_format(trans_key, **kwargs):\\n translated: str = _(trans_key)\\n return translated.format(**kwargs)\",\n \"def format_directive(self, module, package):\\n if module:\\n automodule = '%s.%s' % (package, module)\\n else:\\n automodule = package\\n\\n directive = '.. automodule:: %s\\\\n' % automodule\\n for option in OPTIONS:\\n directive += ' :%s:\\\\n' % option\\n return directive\",\n \"def format_str(string, dictionary):\\n tokens = string.split('}')\\n output = []\\n for token in tokens[:-1]:\\n if token.split('{')[-1] in dictionary.keys():\\n output.append((token + '}').format(**dictionary))\\n else:\\n output.append(token + '}')\\n\\n return ''.join(output) + tokens[-1]\",\n \"def get_formatter(self, **kwargs):\\n config = dict([\\n (attr, getattr(self, attr))\\n for attr in [\\n \\\"include_sign\\\",\\n \\\"group_with_commas\\\",\\n \\\"num_decimal_places\\\",\\n ]\\n ])\\n config.update(kwargs)\\n return \\\"\\\".join([\\n \\\"{\\\",\\n config.get(\\\"field_name\\\", \\\"\\\"),\\n \\\":\\\",\\n \\\"+\\\" if config[\\\"include_sign\\\"] else \\\"\\\",\\n \\\",\\\" if config[\\\"group_with_commas\\\"] else \\\"\\\",\\n \\\".\\\", str(config[\\\"num_decimal_places\\\"]), \\\"f\\\",\\n \\\"}\\\",\\n ])\",\n \"def format_attr(attr: str) -> str:\\r\\n prefix = query_params[Toml.REMOVE_PREFIX]\\r\\n suffix = query_params[Toml.REMOVE_SUFFIX]\\r\\n prefix_len = len(prefix)\\r\\n suffix_len = len(suffix)\\r\\n stripped = attr.strip()\\r\\n if stripped[:prefix_len] == prefix:\\r\\n stripped = stripped[prefix_len:]\\r\\n if stripped[-suffix_len:] == suffix:\\r\\n stripped = stripped[:-suffix_len]\\r\\n return constcase(stripped).replace('__', '_')\",\n \"def __format__(self, format_spec):\\n # Reject anything that isn't an s\\n if format_spec[-1] != 's':\\n raise ValueError('{} format specifier not understood for this object',\\n format_spec[:-1])\\n # Output in this example will be (<a>,<b>,<c>)\\n raw = \\\"(\\\" + \\\",\\\".join([str(self.a), str(self.b), str(self.c)]) + \\\")\\\"\\n # Honor the format language by using the inbuilt string format\\n # Since we know the original format_spec ends in an 's'\\n # we can take advantage of the str.format method with a\\n # string argument we constructed above\\n return \\\"{r:{f}}\\\".format( r=raw, f=format_spec )\",\n \"def _format_parameter_output(self, parameters: dict) -> str:\\n \\n output = ''\\n for key, value in parameters.items():\\n output = output + '\\\\t\\\\t' + str(key) + ': ' + str(value) + '\\\\n'\\n \\n return output\",\n \"def format_parameter_list(parameters):\\n items = sorted(dict(parameters).items())\\n return \\\" \\\".join([\\\"=\\\".join([key, repr(str(value))]) for (key,value) in items])\",\n \"def getString(self):\\n string = self.itemType.find('format').text.strip()\\n paramString = string[string.find('('):]\\n string = string[:string.find('(')]\\n for i in self.params.keys():\\n paramString = paramString.replace(i,str(self.params[i]) if isFloat(str(self.params[i])) else '\\\"'+str(self.params[i]).replace('\\\"','\\\\\\\\\\\"')+'\\\"',1)\\n return string+paramString\",\n \"def get_param_htmldesc(linker, func):\\r\\n import inspect\\r\\n # XXX copy and modify formatargspec to produce html\\r\\n return inspect.formatargspec(*inspect.getargspec(func))\",\n \"def format_param_pairs(self, params_pairs):\\n out = \\\"\\\"\\n for param in params_pairs:\\n out += \\\"{} {} \\\".format(*param)\\n return out\",\n \"def _pretty_print(self,s):\\n if not self.pretty_parameters:\\n return s\\n else:\\n n = s.replace(\\\"_\\\",\\\" \\\")\\n n = n.capitalize()\\n return n\",\n \"def __make_description(self, param_name):\\n value = self._status.get_value(param_name)\\n if round(value) != value:\\n # Parameter is a float. Limit to three decimals.\\n value = \\\"%.3f\\\" % (value)\\n\\n return \\\"%s (%s)\\\" % (param_name, str(value))\",\n \"def format(*args, stringArg: Union[AnyStr, List[AnyStr]]=\\\"\\\", **kwargs)->AnyStr:\\n pass\",\n \"def get__repr__(self, params):\\n\\n def format_params(params1):\\n if at_least_python3:\\n items = params1.items()\\n else:\\n items = list(params1.items())\\n for k, v in sorted(items, key=itemgetter(0), reverse=True):\\n is_text = isinstance(v, str)\\n if is_text and not at_least_python3:\\n v = v.encode('utf-8')\\n yield '{k}=\\\"{v}\\\"'.format(k=k, v=v) if is_text else '{k}={v}'.format(k=k, v=v)\\n\\n return '{class_name}({params})'.format(\\n class_name=self.__class__.__name__,\\n params=\\\", \\\".join(list(format_params(params)))\\n )\",\n \"def __format__(self, formatstr):\\n if formatstr.strip() == '': # Defualt behaviour mirrors self.__str__()\\n formatstr = '+.3f'\\n\\n string = \\\\\\n \\\"{:\\\" + formatstr +\\\"} \\\" + \\\\\\n \\\"{:\\\" + formatstr +\\\"}i \\\" + \\\\\\n \\\"{:\\\" + formatstr +\\\"}j \\\" + \\\\\\n \\\"{:\\\" + formatstr +\\\"}k\\\"\\n return string.format(self.q[0], self.q[1], self.q[2], self.q[3])\",\n \"def dict2argstr(d: Dict[str, Any]) -> str:\\n return \\\",\\\".join(\\\"{!s}={!r}\\\".format(key, val) for (key, val) in d.items())\",\n \"def docstring_format(*values):\\n\\n def _decorator_(function):\\n function.__doc__ = function.__doc__.format(*values).replace('_', '\\\\_')\\n return function\\n\\n return _decorator_\",\n \"def str_replace(data):\\n for key, value in data.items():\\n if isinstance(value, (str, unicode)):\\n data[key] = value.format(**data)\",\n \"def make_attrs(self, mixed):\\n if isinstance(mixed, dict):\\n return ''.join('%s=\\\"%s\\\" ' % (k, v) for k, v in mixed.items())\\n return str(mixed)\",\n \"def line_replacer(config,change_this_line,key):\\n for arg in config['HyperParameter'][key]: \\n pattern=r'{}[ ]*=.*,'.format(arg)\\n replace_value=config['HyperParameter'][key][arg][counter]\\n if type(replace_value) is str:\\n replace_value=\\\"'\\\"+replace_value+\\\"'\\\"\\n change_this_line=re.sub(pattern,\\\"{}= {},\\\".format(arg,replace_value),change_this_line)\\n return change_this_line\",\n \"def formatted_loss_components_string(components: dict) -> str:\\n total_loss = components['L_V']+components['L_beta']\\n fractions = { k : v/total_loss for k, v in components.items() }\\n fkey = lambda key: f'{components[key]:+.4f} ({100.*fractions[key]:.1f}%)'\\n s = (\\n 'L_V+L_beta = {L:.4f}'\\n '\\\\n L_V = {L_V}'\\n '\\\\n L_V_attractive = {L_V_attractive}'\\n '\\\\n L_V_repulsive = {L_V_repulsive}'\\n '\\\\n L_beta = {L_beta}'\\n '\\\\n L_beta_noise = {L_beta_noise}'\\n '\\\\n L_beta_sig = {L_beta_sig}'\\n .format(L=total_loss,**{k : fkey(k) for k in components})\\n )\\n if 'L_beta_norms_term' in components:\\n s += (\\n '\\\\n L_beta_norms_term = {L_beta_norms_term}'\\n '\\\\n L_beta_logbeta_term = {L_beta_logbeta_term}'\\n .format(**{k : fkey(k) for k in components})\\n )\\n return s\",\n \"def build_format(i, ex, args, meta_args):\\n formatter = string.Formatter()\\n format_string = meta_args.format_string\\n fields = list(formatter.parse(format_string))\\n\\n kwarg_fields = []\\n indexed_fields = []\\n\\n i.result = hive.variable('str')\\n i.result_out = hive.pull_out(i.result)\\n\\n for index, field in enumerate(fields):\\n literal_text = field[1]\\n\\n if literal_text is None:\\n continue\\n\\n if not literal_text.isidentifier():\\n field_name = \\\"field_{}\\\".format(index)\\n indexed_fields.append(field_name)\\n\\n else:\\n field_name = literal_text\\n kwarg_fields.append(field_name)\\n\\n # Create IO\\n attr = hive.variable()\\n setattr(i, field_name, attr)\\n\\n in_attr = hive.pull_in(attr)\\n setattr(i, \\\"{}_in\\\".format(field_name), in_attr)\\n\\n setattr(ex, field_name, hive.antenna(in_attr))\\n hive.trigger(i.result_out, in_attr, pretrigger=True)\\n\\n ex.result = hive.output(i.result_out)\\n\\n def do_format(self):\\n args = [getattr(self, \\\"_{}\\\".format(attr_name)) for attr_name in indexed_fields]\\n kwargs = {attr_name: getattr(self, \\\"_{}\\\".format(attr_name)) for attr_name in kwarg_fields}\\n self._result = formatter.format(format_string, *args, **kwargs)\\n\\n i.func = hive.modifier(do_format)\\n hive.trigger(i.result_out, i.func, pretrigger=True)\",\n \"def format_invocation(name='', args=(), kwargs=None, **kw):\\n _repr = kw.pop('repr', bbrepr)\\n if kw:\\n raise TypeError('unexpected keyword args: %r' % ', '.join(kw.keys()))\\n kwargs = kwargs or {}\\n a_text = ', '.join([_repr(a) for a in args])\\n if isinstance(kwargs, dict):\\n kwarg_items = [(k, kwargs[k]) for k in sorted(kwargs)]\\n else:\\n kwarg_items = kwargs\\n kw_text = ', '.join(['%s=%s' % (k, _repr(v)) for k, v in kwarg_items])\\n\\n all_args_text = a_text\\n if all_args_text and kw_text:\\n all_args_text += ', '\\n all_args_text += kw_text\\n\\n return '%s(%s)' % (name, all_args_text)\",\n \"def __format__(self, *args, **kwargs): # real signature unknown\\r\\n pass\",\n \"def format(query: str) -> str:\\n return query.format(**Constants.to_dict())\",\n \"def field(*args, **kwargs):\\n\\n alias = None\\n name = None\\n if len(args) == 1:\\n name = args[0]\\n elif len(args) == 2:\\n alias, name = args\\n else:\\n raise ValueError(\\\"Field name or alias and name must be provided to 'field', got '{}'\\\".format(args))\\n\\n result = \\\"\\\"\\n if alias:\\n result = \\\"{}: \\\".format(alias)\\n\\n if not kwargs:\\n return result + name\\n\\n result += \\\"{}({})\\\".format(\\n name,\\n \\\", \\\".join([\\\"{}: {}\\\".format(k, params(v)) for k, v in sorted(kwargs.items())])\\n )\\n\\n return result\",\n \"def _interpolate(string):\\n return string % env.project\",\n \"def test_extra_with_string_format():\\n tree = parse(dedent(\\\"\\\"\\\"\\\\\\n import logging\\n\\n logging.info(\\n \\\"Hello {world}!\\\",\\n extra=dict(\\n world=\\\"{}\\\".format(\\\"World\\\"),\\n ),\\n )\\n \\\"\\\"\\\"))\\n visitor = LoggingVisitor()\\n visitor.visit(tree)\\n\\n assert_that(visitor.violations, is_(empty()))\",\n \"def test_nested_format_fields():\\n '{0:>{1}}'.format(42, 24)\\n '{0:{a[1]}} {a}'.format(1, a=[1, 2])\\n '{:>{}}'.format(42, 24)\\n '{0:>{1}}'.format(42)\\n '{0:>{1}}'.format(42, 24, 54)\\n ##Warn: W1303\\n '{0:{a[1]}}'.format(1)\\n ##Warn: W1306\\n '{0:{a.x}}'.format(1, a=2)\",\n \"def format_parameter_value(self, param_config, precision):\\n # type: (Dict[str, Any], int) -> str\\n return \\\"\\\"\",\n \"def docfmt(**kwargs):\\n kwargs = {k: v.lstrip() for k, v in kwargs.items()}\\n\\n def outer(fn):\\n buf = []\\n if fn.__doc__ is None:\\n return fn\\n formatsiter = string.Formatter().parse(fn.__doc__)\\n for literal, field, fmtspec, conv in formatsiter:\\n assert conv is None\\n assert not fmtspec\\n buf.append(literal)\\n if field is not None:\\n # get indentation\\n lines = literal.rsplit(\\\"\\\\n\\\", 1)\\n if _only_spaces(lines[-1]):\\n indent = \\\" \\\" * len(lines[-1])\\n valuelines = kwargs[field].splitlines(True)\\n # first line\\n buf.append(valuelines[0])\\n # subsequent lines are indented\\n buf.extend([indent + ln for ln in valuelines[1:]])\\n else:\\n buf.append(kwargs[field])\\n fn.__doc__ = \\\"\\\".join(buf)\\n return fn\\n\\n return outer\",\n \"def format_arg(namespace, arg, lex):\\n if lex and arg[0] in ('[', '('):\\n return arg[0] + namespace + arg[1:]\\n try:\\n return namespace + arg\\n except:\\n return str.encode(namespace) + arg\",\n \"def __format__(self, fmt):\\n if not isinstance(fmt, str):\\n raise TypeError(\\\"must be str, not %s\\\" % type(fmt).__name__)\\n if len(fmt) != 0:\\n return self.strftime(fmt)\\n return str(self)\",\n \"def replace_params(template, data):\\n\\t# Find all variables between curly braces, potentially with some spaces\\n\\tmatches = re.findall(\\\"({{\\\\s*)(\\\\w+(-\\\\w+)*)(\\\\s*}})\\\", template)\\n\\t# Process the matches\\n\\tfor match in matches:\\n\\t\\tkey = match[1]\\n\\t\\tif key in data:\\n\\t\\t\\ttemplate = template.replace(match[0] + match[1] + match[3], data[key])\\n\\t\\t# If no data supplied in dictionary, that was an optional parameter, just delete it\\n\\t\\telse:\\n\\t\\t\\ttemplate = template.replace(match[0] + match[1] + match[3], \\\"\\\")\\n\\treturn template\",\n \"def format(value):\\n if isinstance(value, str):\\n return '\\\"{}\\\"'.format(value)\\n if isinstance(value, bool):\\n return 'true' if value is True else 'false'\\n elif isinstance(value, dict):\\n assert False, 'Not implemented for dictionary type'\\n elif hasattr(value, '__len__'): # should cover list and numpy array\\n return '{{{}}}'.format(', '.join([str(v) for v in value]))\\n else: # assume scalar value\\n return value\",\n \"def decorate(cls, attr_names=None, **kwargs):\\n if attr_names is None:\\n attr_names = ()\\n elif not isinstance(attr_names,(list,tuple)):\\n raise DecoError('type {} not accepted for list/tuple of decorated members'.format(type(attr_names)))\\n # various local objects\\n obj_decorator = cls._format_obj(**kwargs)#analysis:ignore\\n format_decorator = cls.format(**kwargs)#analysis:ignore\\n str_format = lambda s: s.format(**kwargs) if s is not None else '' \\n special_members = ['__metaclass__','__module__','__weakref__','__dict__','__class__']#analysis:ignore\\n def decorator(obj, obj_name=None):\\n # deal with special '__doc__' member\\n if obj_name=='__doc__':\\n try: \\n return str_format(obj)\\n except: return obj or ''\\n # don't consider other special members and other special members unless \\n # it is explicitely to decorate them (e.g. __init__)\\n elif obj_name in special_members: \\\\\\n # or (obj_name.startswith('__') and obj_name.endswith('__') and obj_name not in attr_names):\\n return obj\\n # deal with properties\\n elif isinstance(obj, property): \\n try: \\n return property(obj.__get__, obj.__set__, obj.__delattr__, str_format(obj.__doc__))\\n except: return obj # e.g. property not decorated\\n # deal with class members\\n elif inspect.isclass(obj):\\n try: \\n return cls.format_class(**kwargs)(obj) \\n except: return obj\\n # deal with method members\\n elif inspect.isroutine(obj): # inspect.ismethod(obj):\\n try: \\n return cls.format_method(**kwargs)(obj) \\n except: return obj\\n ## deal with attribute members\\n else: \\n try: # whenever __doc__ is writeable\\n obj.__doc__ = obj_decorator(obj)\\n return obj\\n except: \\n return obj\\n return class_decorator(decorator, *attr_names)\",\n \"def formatargspec(args, varargs=None, varkw=None, defaults=None,\\r\\n formatarg=str,\\r\\n formatvarargs=lambda name: '*' + name,\\r\\n formatvarkw=lambda name: '**' + name,\\r\\n formatvalue=lambda value: '=' + repr(value),\\r\\n join=joinseq):\\r\\n specs = []\\r\\n if defaults:\\r\\n firstdefault = len(args) - len(defaults)\\r\\n for i, arg in enumerate(args):\\r\\n spec = strseq(arg, formatarg, join)\\r\\n if defaults and i >= firstdefault:\\r\\n spec = spec + formatvalue(defaults[i - firstdefault])\\r\\n specs.append(spec)\\r\\n if varargs is not None:\\r\\n specs.append(formatvarargs(varargs))\\r\\n if varkw is not None:\\r\\n specs.append(formatvarkw(varkw))\\r\\n return '(' + string.join(specs, ', ') + ')'\",\n \"def substitutes(string, **kwargs):\\n return json.dumps(substitute(json.loads(string), **kwargs))\",\n \"def test__str__and__repr__(self, kwargs, expected):\\n fparam = FParameter(**kwargs)\\n assert str(fparam) == expected\\n assert repr(fparam) == '<FParameter \\\"{}\\\">'.format(expected)\",\n \"def info(capsys, format_str, format_args=None):\\n\\n if format_args is not None:\\n msg = (format_str % format_args)\\n else:\\n msg = format_str\\n\\n with capsys.disabled():\\n print(msg)\",\n \"def _safe_attr(attr, camel_killer=False, replacement_char='x'):\\n allowed = string.ascii_letters + string.digits + '_'\\n attr = _safe_key(attr)\\n if camel_killer:\\n attr = _camel_killer(attr)\\n attr = attr.replace(' ', '_')\\n out = ''\\n for character in attr:\\n out += character if character in allowed else '_'\\n out = out.strip('_')\\n try:\\n int(out[0])\\n except (ValueError, IndexError):\\n pass\\n else:\\n out = '{0}{1}'.format(replacement_char, out)\\n if out in kwlist:\\n out = '{0}{1}'.format(replacement_char, out)\\n return re.sub('_+', '_', out)\",\n \"def dict(self, arg: SeField[Any]) -> str:\\n if is_bare_dict(arg.type):\\n return arg.varname\\n else:\\n karg = arg[0]\\n karg.name = \\\"k\\\"\\n varg = arg[1]\\n varg.name = \\\"v\\\"\\n return f\\\"{{{self.render(karg)}: {self.render(varg)} for k, v in {arg.varname}.items()}}\\\"\",\n \"def sformatf(cls, msg, *args):\\n #formats = {\\\"%t\\\": \\\"%d\\\", \\\"%0t\\\": \\\"%0d\\\"}\\n #for s in formats:\\n # msg = msg.replace(s, formats[s])\\n #return sformatf(msg, *args)\\n # TODO substitute old types %s/%d etc with {}\\n #new_msg = cls.STR_RE.sub(r'{:\\\\1}', msg)\\n #print(\\\"new_msg is \\\" + new_msg)\\n for s in cls.formats:\\n if s == \\\"%h\\\" or s == \\\"%0h\\\":\\n msg = msg.replace(s, \\\"{:X}\\\")\\n else:\\n msg = msg.replace(s, \\\"{}\\\")\\n return msg.format(*args)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5990877","0.59723574","0.57197136","0.5632017","0.56243557","0.5579166","0.54825616","0.5474345","0.5385853","0.5365595","0.5335425","0.5315145","0.5266371","0.5259829","0.52348405","0.52140254","0.5195806","0.5177217","0.5099359","0.5097019","0.50952864","0.5078579","0.50761694","0.5062998","0.5062329","0.505489","0.5044439","0.50416446","0.50361025","0.50129026","0.5012273","0.5008693","0.49973017","0.49924472","0.49922407","0.49914008","0.49775755","0.4968604","0.49456397","0.49340487","0.49241576","0.49125293","0.48898837","0.48873314","0.4874479","0.4870638","0.4866174","0.48635432","0.4861874","0.48494786","0.48443127","0.48418087","0.48361883","0.48227674","0.48222896","0.4818961","0.48122936","0.48015186","0.47960576","0.47930512","0.47776666","0.477639","0.47577536","0.47574937","0.47532377","0.4751495","0.47503197","0.47495934","0.47461376","0.4742805","0.47217295","0.4710514","0.47039402","0.47039062","0.4666654","0.4666211","0.46640712","0.46558627","0.46533406","0.46518236","0.46510231","0.46493372","0.4647056","0.46444726","0.46440208","0.46428192","0.4641235","0.46402997","0.4638094","0.46352684","0.46339253","0.4630008","0.46262667","0.4611843","0.46057966","0.46048802","0.46028778","0.4599217","0.4598511","0.45887202"],"string":"[\n \"0.5990877\",\n \"0.59723574\",\n \"0.57197136\",\n \"0.5632017\",\n \"0.56243557\",\n \"0.5579166\",\n \"0.54825616\",\n \"0.5474345\",\n \"0.5385853\",\n \"0.5365595\",\n \"0.5335425\",\n \"0.5315145\",\n \"0.5266371\",\n \"0.5259829\",\n \"0.52348405\",\n \"0.52140254\",\n \"0.5195806\",\n \"0.5177217\",\n \"0.5099359\",\n \"0.5097019\",\n \"0.50952864\",\n \"0.5078579\",\n \"0.50761694\",\n \"0.5062998\",\n \"0.5062329\",\n \"0.505489\",\n \"0.5044439\",\n \"0.50416446\",\n \"0.50361025\",\n \"0.50129026\",\n \"0.5012273\",\n \"0.5008693\",\n \"0.49973017\",\n \"0.49924472\",\n \"0.49922407\",\n \"0.49914008\",\n \"0.49775755\",\n \"0.4968604\",\n \"0.49456397\",\n \"0.49340487\",\n \"0.49241576\",\n \"0.49125293\",\n \"0.48898837\",\n \"0.48873314\",\n \"0.4874479\",\n \"0.4870638\",\n \"0.4866174\",\n \"0.48635432\",\n \"0.4861874\",\n \"0.48494786\",\n \"0.48443127\",\n \"0.48418087\",\n \"0.48361883\",\n \"0.48227674\",\n \"0.48222896\",\n \"0.4818961\",\n \"0.48122936\",\n \"0.48015186\",\n \"0.47960576\",\n \"0.47930512\",\n \"0.47776666\",\n \"0.477639\",\n \"0.47577536\",\n \"0.47574937\",\n \"0.47532377\",\n \"0.4751495\",\n \"0.47503197\",\n \"0.47495934\",\n \"0.47461376\",\n \"0.4742805\",\n \"0.47217295\",\n \"0.4710514\",\n \"0.47039402\",\n \"0.47039062\",\n \"0.4666654\",\n \"0.4666211\",\n \"0.46640712\",\n \"0.46558627\",\n \"0.46533406\",\n \"0.46518236\",\n \"0.46510231\",\n \"0.46493372\",\n \"0.4647056\",\n \"0.46444726\",\n \"0.46440208\",\n \"0.46428192\",\n \"0.4641235\",\n \"0.46402997\",\n \"0.4638094\",\n \"0.46352684\",\n \"0.46339253\",\n \"0.4630008\",\n \"0.46262667\",\n \"0.4611843\",\n \"0.46057966\",\n \"0.46048802\",\n \"0.46028778\",\n \"0.4599217\",\n \"0.4598511\",\n \"0.45887202\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6764331"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94770,"cells":{"query":{"kind":"string","value":"function that finds and returns the value for a placeholder."},"document":{"kind":"string","value":"def get_parameter(key):\n if key in param_dict:\n # was a supplied parameter\n param = param_dict.get(key)\n elif module and hasattr(module, key):\n param = getattr(module, key)\n if hasattr(param, \"__call__\"):\n # we don't allow module methods\n raise Exception()\n elif attr_getter:\n # get value from attr_getter function\n try:\n param = attr_getter(key)\n except: # noqa e722\n raise Exception()\n else:\n raise Exception()\n if isinstance(param, Composite):\n if param.text():\n param = param.copy()\n else:\n param = \"\"\n return param"},"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 __findPlaceholder(self, data, index):\r\n m = self.__placeholder_re.search(data, index)\r\n if m:\r\n return m.group(1), m.end()\r\n else:\r\n return None, index + 1","def placeholder(self):\n return self._placeholder","def placeholder(self) -> str | None:\n return self._underlying.placeholder","def findPlaceholder(self, placeholder):\n start = self.row\n for lineno in xrange(start-1, len(self.buffer)):\n x = self.buffer[lineno].find(placeholder)\n if x != -1:\n return (lineno, x, len(placeholder))\n #not found after, search to start backwords!\n for lineno in xrange(start-1, 0, -1):\n x = self.buffer[lineno].find(placeholder)\n if x != -1:\n return (lineno, x, len(placeholder))\n return (0,0,0)","def find(found_item, _):\n if found_item:\n return found_item[1]\n else:\n return default","def MatchPlaceholder(string, node, placeholder):\n matched_text = placeholder.Match(node, string)\n if not matched_text:\n return string\n ValidateStart(string, matched_text)\n if not isinstance(placeholder, TextPlaceholder):\n matched_text = StripStartParens(matched_text)\n before, after = string.split(matched_text, 1)\n if StripStartParens(before):\n raise BadlySpecifiedTemplateError(\n 'string \"{}\" should have started with placeholder \"{}\"'\n .format(string, placeholder))\n return after","def find_value(code, value):\n value_pattern = re.compile(rf\"{re.escape(value)} ?= ?([^=][a-zA-Z0-9\\.'/_)(]*)\")\n\n target = None\n for line in code:\n if value_pattern.search(line):\n target = re.findall(value_pattern, line)\n break\n\n return target[0] if target is not None else value","def getValue(name, default=None):","def get_geom_placeholder(self, value, srid):\r\n if hasattr(value, 'expression'):\r\n placeholder = '%s.%s' % tuple(map(self.quote_name, value.cols[value.expression]))\r\n else:\r\n placeholder = '%s(%%s)' % self.from_text\r\n return placeholder","def get_value(name):\n\n named_value = get_named_value_raw(name)\n if named_value is not None:\n return named_value.value","def get_parameter(cur, par):\n cur.execute(\"SELECT value FROM parameters WHERE par='%s';\" % par)\n return cur.fetchone()[0]","def find_variable(self, standard_name, any_scope=True, loop_subst=False):\n if standard_name in self:\n var = self[standard_name]\n elif any_scope and (self._parent_dict is not None):\n var = self._parent_dict.find_variable(standard_name, any_scope)\n else:\n var = None\n # End if\n if (var is None) and loop_subst:\n var = self.find_loop_subst(standard_name, any_scope=any_scope)\n # End if\n return var","def resolve(self, var, context):\n if var[0] in ('\"', \"'\") and var[-1] == var[0]:\n return var[1:-1]\n else:\n return Variable(var).resolve(context)","def resolve(self, var, context):\n if var[0] in ('\"', \"'\") and var[-1] == var[0]:\n return var[1:-1]\n else:\n return Variable(var).resolve(context)","def placeholders(self):\n x = [i.placeholder for i in self._input_desc]\n return x[0] if len(x) == 1 else x","def get_match_result(self, variable):\n try:\n return self._match_result_dict[variable]\n except KeyError:\n return None","def lookup(self, val):\n vid = id(val)\n return self.values.get(vid, None)","def lookup(input_field, input_val, output_field):\n l = list(filter(lambda x : x[input_field] == input_val, data))\n if len(l) != 0:\n return l[0][output_field]\n print(\"No entry found for \" + input_field + \": \" + input_val)\n return \"\"","def find_value(dic, key):\n return dic[key]","def get_value(soup, tag, cond, default=None):\r\n ele = soup.find(tag, cond)\r\n if ele:\r\n return ele.text.strip()\r\n return default","def _get_value(self, value, context):\n try:\n var_value = template.Variable(value).resolve(context)\n except template.VariableDoesNotExist:\n try:\n var_value = self.var_value.var\n except AttributeError:\n var_value = self.var_value\n return var_value","def placeholder(self, name, type_name):\n provenance = NQExprProvenance(\n operation='placeholder', args=(type_name, name))\n value = tf.compat.v1.placeholder(\n tf.float32, shape=[None, self.get_max_id(type_name)], name=name)\n return self.as_nql(value, type_name, provenance)","def find_value(self, func_addr, instr_addr, register):\n reg_num = idaapi.ph_get_regnames().index(register)\n\n # go back from the current instruction to the start of the function\n for instr_addr in list(instructions(func_addr, instr_addr))[::-1]:\n # look for instrucations that move a value into the desired register\n mnemonic = idc.GetMnem(instr_addr)\n if mnemonic == 'mov':\n\n op1_type = idc.get_operand_type(instr_addr, 0)\n op1_value = idc.get_operand_value(instr_addr, 0)\n \n if op1_type == idc.o_reg and op1_value == reg_num:\n op2_type = idc.get_operand_type(instr_addr, 1)\n op2_value = idc.get_operand_value(instr_addr, 1)\n\n # if this instruction sets the register to an immediate value\n if op2_type == idc.o_imm:\n # return that value\n return op2_value\n else:\n # it is not an immediate value, so we say we cannot\n # resolve the value\n return None\n\n # we did not find an allocation of the register,\n # so we return None to indicate that\n return None","def read_value(where, ttype=None):\n ttype = VOID_P if ttype is None else ttype\n\n frame = gdb.selected_frame()\n if where.startswith(\"$\"):\n return frame.read_register(where[1:]).cast(ttype)\n else:\n to_parse = \"(%s) %s\" % (str(ttype), where)\n return gdb.parse_and_eval(to_parse)","def _findIdentifierValue (self, identifier : String) -> String:\n\n Logging.trace(\">>: %s\", identifier)\n cls = self.__class__\n\n if identifier not in self._keyToValueMap:\n # leave identifier as is (it might be some value name like\n # wahr or false\n Logging.traceError(\"no expansion found\")\n result = identifier\n else:\n result = self._keyToValueMap[identifier]\n\n if not isString(result):\n result = repr(result)\n else:\n result = (cls._doubleQuoteCharacter + result\n + cls._doubleQuoteCharacter)\n\n Logging.trace(\"<<: expanded %s into %r\", identifier, result)\n return result","def get_constant(v):\r\n if isinstance(v, Variable):\r\n try:\r\n return get_scalar_constant_value(v)\r\n except NotScalarConstantError:\r\n return None\r\n else:\r\n return v","def parse_from_placeholder(string,pattern,encloser='%',matcher='(.+)'):\n pattern,fields = placeholder_to_regex(pattern,encloser,matcher)\n return parse_from_regex(string,pattern,fields)","def get(name: str):\n if name not in Replacements._rep:\n return None\n return Replacements._rep[name]","def lookup(self, s, default=None):\n\t\thead, tail = s[0], s[1:]\n\t\tnode = self.root[head]\n\t\tif tail:\n\t\t\treturn node.lookup(tail)\n\t\treturn node.value or default","def get_replacement_value(self, to_be_replaced):\n name_reg = re.compile('[a-zA-z_]+')\n param_name = name_reg.search(to_be_replaced).group()\n return self.params.get(param_name)","def lookup(index,keyword):\n\tif keyword in index:\n\t\treturn index[keyword]\n\treturn None","def lookup(scopes, name):\n # type: (Scopes[T], str) -> Optional[T]\n\n for scope in scopes:\n for key, val in scope:\n if key == name:\n return val\n return None","def Variable(name):\n placeholder_node = placeholder_op()\n placeholder_node.name = name\n return placeholder_node","def lookup(what, where, default=None):\n if isinstance(what, (str, unicode)):\n res = getattr(where, what, default)\n else:\n res = what\n return res","def lookup_some_key(what, where, default=None):\n for w in what:\n try:\n return where[w]\n except KeyError:\n pass\n return default","def get_value(value):\n if value:\n return value.split('\\n')[0]\n else:\n return None","def get_embedding_placeholder(self):\n return self.embedding_layer.get_embedding_placeholder()","def extract_location(x):\n if not pd.isna(x):\n x = ast.literal_eval(x)\n location = x['name']\n return location\n else:\n return np.nan","def suggestValue(self, variable: Variable, value: int | float, /) -> None:\n ...","def var():\n def _var(quoted_name):\n name = quoted_name.subexpression.name\n if (value := get_name(name)) is not None:\n return value\n else:\n raise TypeError(f\"Binding {name} not found\")\n yield (\"(λ &[name] . any)\", _var)","def find_node(self, value):\n for (fun, node) in self.__root.__fast_find:\n if fun(value):\n return node\n return None","def is_placeholder_value(cls, value):\n return value == cls.PLACEHOLDER_VALUE","def _identity_placeholder(\n self,\n x: typing.Any,\n ) -> typing.Any:\n return x","def get(self, key, default=None):\n def find(found_item, _):\n \"\"\" This is the closer function which will be passed to find by key function , if key found than return the value \n otherwise return blanck\"\"\"\n if found_item:\n return found_item[1]\n else:\n return default\n\n return self._find_by_key(key, find)","def lookup_variable_value(var, env):\n def env_loop(environment):\n \"\"\"\n calls scan on each frame in the env list\n \"\"\"\n def scan(vars, vals):\n \"\"\"\n scans variables in a frame\n \"\"\"\n if isNull(vars):\n return env_loop(enclosing_env(environment)) # 5-4: env -> environment\n elif isEq(var, car(vars)) == TRUE:\n return car(vals)\n else:\n return scan(cdr(vars), cdr(vals))\n if environment is the_empty_environment:\n raise UnboundLocalError(\"lookup_variable\")\n frame = first_frame(environment)\n return scan(frame_variables(frame), frame_values(frame))\n return env_loop(env)","def lookup(name):","def lookup(name):","def test_find_default(self):\n mute_map = MutableMap(**VALUE)\n\n assert mute_map.find('NOT_VALID', 'default_val') == \\\n 'default_val', 'default should be used'\n assert mute_map.find('str_val', 'default_val') == \\\n VALUE['str_val'], 'default should be ignored'","def default(value, replacement):\n return value if value is not None else replacement","def get(self, node):\n if node in self.val:\n return self.val[node]\n else:\n return self.initial","def get(name, default=None):","def var_or_atomic_or_blank():\n return var_or_atomic() | next_value('_')","def find_regvar(*args):\n return _ida_frame.find_regvar(*args)","def _get_simple_null_value(simple):\n return _SIMPLE_NULL_VALUES[simple]","def get_config_value(keyword):\n if g_configs and keyword in g_configs:\n return g_configs[keyword]\n return \"\"","def _get_variable_name(param_name):\n m = re.match(\"^(.*):\\\\d+$\", param_name)\n if m is not None:\n param_name = m.group(1)\n return param_name","def get_value(self, locator: Locator) -> Optional[str]:\n element = self.ctx.get_element(locator)\n get_value_pattern = self.get_value_pattern(element)\n\n if get_value_pattern:\n func_name = get_value_pattern.__name__\n self.logger.info(\n \"Retrieving the element value with the %r method.\", func_name\n )\n value_pattern = get_value_pattern()\n return value_pattern.Value if value_pattern else None\n\n raise ActionNotPossible(\n f\"Element found with {locator!r} doesn't support value retrieval\"\n )","def lookup(self, var):\n\t\tsearched = self._search(self._root, var)\n\t\tif searched is not None:\n\t\t\treturn searched._value\n\t\telse:\n\t\t\tself._assign(var, 0)\t#creates the new variable to 0\n\t\t\treturn 0","def getfield(value, arg):\n #import pdb; pdb.set_trace()\n if hasattr(value, \"fields\"):\n fields = getattr(value, \"fields\")\n if str(arg) in fields:\n return str(fields[str(arg)])","def _find(self, val, cur_node):\n if val == cur_node.data:\n return cur_node\n elif val > cur_node.data:\n if not cur_node.right:\n return None\n return self._find(val, cur_node.right)\n elif val < cur_node.data:\n if not cur_node.left:\n return None\n return self._find(val, cur_node.left)","def __getitem__(self, v):\r\n return self.unif.get(v, (v, None))[0]","def get(self, var: str, default: Union[str, T] = '') -> Union[str, T]:\n if var[0] == '$':\n var = var[1:]\n folded_var = var.casefold()\n if folded_var in self._fixup:\n return self._fixup[folded_var].value\n else:\n return default","def find(self, number: str) -> Optional[str]:\n if number in self.data: # noqa\n return number\n else:\n return None","def get_value(cursor, address):\n for part in address.split('.'):\n try:\n cursor = cursor[part]\n except KeyError:\n LOG.warning(\"KeyError: %s (%s)\", part, address)\n return\n return cursor","def get_variable(self, col: str, name: str, default: T = None) -> T:\n if self.scope is None:\n raise ValueError(\"Can't access variables on unbound modules\")\n return self.scope.get_variable(col, name, default)","def get_value(arg):\n if arg in self.args_repository:\n return self.args_repository[arg]\n if arg in self.data_repository:\n return self.data_repository[arg]\n print_error(\"value for mandatory argument '{0}' not available in \"\n \"data_repository/args_repository\".format(args))\n return None","def lookup():","def _pick_variable(self, variable_and_offsets):\n\n if isinstance(self.operand, MemoryOperand):\n if len(variable_and_offsets) > 1:\n log.error(\"Instruction %#x has two memory operands. Please report it on GitHub.\", self.insn.addr)\n return variable_and_offsets[0]\n\n elif isinstance(self.operand, RegisterOperand):\n # there might be multiple register-type variables for an instruction. pick the right one is... not easy\n\n the_reg = self.operand.register\n if the_reg is None:\n # huh, it does not have a Register child\n return None, None\n\n reg_name = the_reg.reg\n arch = self.instance.project.arch\n\n if len(variable_and_offsets) == 1:\n # only one candidate...\n var, offset = variable_and_offsets[0]\n if arch.registers[reg_name][0] == var.reg:\n return var, offset\n return None, None\n\n if self.operand_index > 0:\n # this is the source operand\n # which variable is read here?\n for var, offset in variable_and_offsets:\n if arch.registers[reg_name][0] == var.reg:\n if self._variable_has_access(var, self.insn.addr, \"read\"):\n return var, offset\n\n log.debug(\n \"Cannot find any source variable for operand %d at instruction %#x.\",\n self.operand_index,\n self.insn.addr,\n )\n return None, None\n\n # this is the destination operand\n # which variable is written here?\n for var, offset in variable_and_offsets:\n if arch.registers[reg_name][0] == var.reg and self._variable_has_access(var, self.insn.addr, \"write\"):\n return var, offset\n\n log.debug(\n \"Cannot find any destination variable for operand %d at instruction %#x.\",\n self.operand_index,\n self.insn.addr,\n )\n # just return the first one\n return None, None\n\n else:\n # what's this type? why am I here?\n log.error(\"_pick_variable: Unsupported operand type %s.\", self.operand.__class__)\n\n return None, None","def get_parameter(self, param):\n try:\n result = self._data[\"queryResult\"][\"parameters\"][param]\n except KeyError:\n result = None\n\n return result","def find_field(browser, field, value):\r\n return find_field_by_id(browser, field, value) or \\\r\n find_field_by_name(browser, field, value) or \\\r\n find_field_by_label(browser, field, value)","def extract_placename(query_result):\n if 'name' in query_result.keys():\n return query_result['name']\n else:\n return np.float('nan')","def lookup(self, key):\n n = self.find(key)\n if n:\n return n.value\n else:\n return False","def soar_substitute(value, json_str):\n replace_dict = json.loads(json_str)\n if value in replace_dict:\n return replace_dict[value]\n\n # use a default value if specific match is missing\n if 'DEFAULT' in replace_dict:\n return replace_dict['DEFAULT']\n\n return value","def search(self, val):\n search = self.head\n while search:\n if search.val == val:\n return search\n search = search.next\n return None","def getValue(splits, featureName):\n for split in splits:\n if split.startswith(featureName):\n return split[split.find(\"=\")+1:]\n \n return None","def _get_simple_default_value(simple):\n return _SIMPLE_DEFAULT_VALUES[simple]","def find_arg(needle, haystack):\r\n for i in range(0, len(haystack)):\r\n if haystack[i] == needle:\r\n try:\r\n return haystack[i+1]\r\n except IndexError:\r\n pass\r\n return None","def _tkvar_get(self,param_name):\n tk_val = self._tkvars[param_name]._original_get()\n po_val = self.get_parameter_value(param_name)\n\n po_stringrep = self._object2string(param_name,po_val)\n\n if not self.translators[param_name].last_string2object_failed and not tk_val==po_stringrep:\n self._tkvars[param_name]._original_set(po_stringrep)\n return tk_val","def _lookup_typedef_value(typedef, name):\n assert typedef is not None\n assert name is not None\n \n # Check if the typedef has the attribute\n value = typedef.get(name)\n if value:\n return value\n \n # Otherwise, see if it's defined in the base type(s)\n base_type_name = typedef.get('base-type')\n if base_type_name:\n base_typedef = typedef_registry.get(base_type_name)\n if not base_typedef:\n raise error.CommandDescriptionError('Unknown type name: %s' % base_type_name)\n return _lookup_typedef_value(base_typedef, name)\n\n return None","def _get_variable_name(self, param_name):\n m = re.match(\"^(.*):\\\\d+$\", param_name)\n if m is not None:\n param_name = m.group(1)\n return param_name","def _get_variable_name(self, param_name):\n m = re.match(\"^(.*):\\\\d+$\", param_name)\n if m is not None:\n param_name = m.group(1)\n return param_name","def _get_variable_name(self, param_name):\n m = re.match(\"^(.*):\\\\d+$\", param_name)\n if m is not None:\n param_name = m.group(1)\n return param_name","def _get_variable_name(self, param_name):\n m = re.match(\"^(.*):\\\\d+$\", param_name)\n if m is not None:\n param_name = m.group(1)\n return param_name","def _get_variable_name(self, param_name):\n m = re.match(\"^(.*):\\\\d+$\", param_name)\n if m is not None:\n param_name = m.group(1)\n return param_name","def resolve_resolver_value(self, resolver: \"Resolver\") -> Any:\n try:\n return resolver.resolve()\n except RecursiveResolve:\n # Recursive resolve issues shouldn't be masked by a placeholder.\n raise\n except Exception:\n if are_placeholders_enabled():\n placeholder_value = create_placeholder_value(\n resolver, self.placeholder_type\n )\n\n self.logger.debug(\n \"Error encountered while resolving the resolver. This is allowed for the current \"\n f\"operation. Resolving it to a placeholder value instead: {placeholder_value}\"\n )\n return placeholder_value\n raise","def _find_first(self, ast, label):\n res = self._find_all(ast, label, max_results=1)\n if len(res):\n return res[0]\n return None","def get_val(self, name, default=None):\r\n val = cF.get_val(name, default=default)\r\n if name == \"first\":\r\n if val == \"\":\r\n val == 0\r\n elif name == \"last\":\r\n if val == \"\" or val == 0:\r\n val = 0\r\n return val","def resolve(var, context):\n try:\n return var.resolve(context)\n except template.VariableDoesNotExist:\n return var.var","def visit_Variable(self, node):\n var_name = node.value\n val = self.VARIABLES.get(var_name)\n if val is None:\n raise NameError(repr(var_name))\n else:\n return val","def placeholder():\n return ResultProxy(TaskResult())","def find_value(self, x, y):\n for cell in self.cells:\n if cell.coordinates == (x,y):\n return cell.value\n else:\n return None","def find_value(self, key):\n values = self.values\n if key not in values:\n raise AttributeError(\"Config has no value for {}\".format(key))\n\n val = values[key]\n if isinstance(val, Default):\n return val.val\n else:\n return val","def search(self, val):\n current = self.head\n # import pdb; pdb.set_trace()\n while current is not None:\n if current.data == val:\n return current\n current = current.next_node\n return None","def findFootnotesPlaceholder(self, root):\n def finder(element):\n for child in element:\n if child.text:\n if child.text.find(self.getConfig(\"PLACE_MARKER\")) > -1:\n return child, element, True\n if child.tail:\n if child.tail.find(self.getConfig(\"PLACE_MARKER\")) > -1:\n return child, element, False\n finder(child)\n return None\n \n res = finder(root)\n return res","def js_var(var, raw):\n lestr = r\"\\b{0}\\s*=\\s*\\\"([^\\\"]+)\".format(var)\n match = search(lestr, raw)\n return None if match is None else match.group(1)","def getValue(self,value):\n if value in self.header.keys():\n return self.header[value]\n if value in self.subintinfo.keys():\n return self.subintinfo[value][-1]\n if self.params is None:\n return None\n return self.params.get(value) #will return None if non-existent","def _find(self, details: CallableDetails) -> CallableArg:\n if self.name:\n return self._find_by_name(details, self.name)\n else:\n return self._get_first(details)","def _get_fact(self, fact):\n for kbfact in self.facts:\n if fact == kbfact:\n return kbfact","def _get_fact(self, fact):\n for kbfact in self.facts:\n if fact == kbfact:\n return kbfact","def _get_fact(self, fact):\n for kbfact in self.facts:\n if fact == kbfact:\n return kbfact","def _getInputValue(self, name, target = ''):\n value = self._getInputValue(name, target)\n return value.getData() if value else None"],"string":"[\n \"def __findPlaceholder(self, data, index):\\r\\n m = self.__placeholder_re.search(data, index)\\r\\n if m:\\r\\n return m.group(1), m.end()\\r\\n else:\\r\\n return None, index + 1\",\n \"def placeholder(self):\\n return self._placeholder\",\n \"def placeholder(self) -> str | None:\\n return self._underlying.placeholder\",\n \"def findPlaceholder(self, placeholder):\\n start = self.row\\n for lineno in xrange(start-1, len(self.buffer)):\\n x = self.buffer[lineno].find(placeholder)\\n if x != -1:\\n return (lineno, x, len(placeholder))\\n #not found after, search to start backwords!\\n for lineno in xrange(start-1, 0, -1):\\n x = self.buffer[lineno].find(placeholder)\\n if x != -1:\\n return (lineno, x, len(placeholder))\\n return (0,0,0)\",\n \"def find(found_item, _):\\n if found_item:\\n return found_item[1]\\n else:\\n return default\",\n \"def MatchPlaceholder(string, node, placeholder):\\n matched_text = placeholder.Match(node, string)\\n if not matched_text:\\n return string\\n ValidateStart(string, matched_text)\\n if not isinstance(placeholder, TextPlaceholder):\\n matched_text = StripStartParens(matched_text)\\n before, after = string.split(matched_text, 1)\\n if StripStartParens(before):\\n raise BadlySpecifiedTemplateError(\\n 'string \\\"{}\\\" should have started with placeholder \\\"{}\\\"'\\n .format(string, placeholder))\\n return after\",\n \"def find_value(code, value):\\n value_pattern = re.compile(rf\\\"{re.escape(value)} ?= ?([^=][a-zA-Z0-9\\\\.'/_)(]*)\\\")\\n\\n target = None\\n for line in code:\\n if value_pattern.search(line):\\n target = re.findall(value_pattern, line)\\n break\\n\\n return target[0] if target is not None else value\",\n \"def getValue(name, default=None):\",\n \"def get_geom_placeholder(self, value, srid):\\r\\n if hasattr(value, 'expression'):\\r\\n placeholder = '%s.%s' % tuple(map(self.quote_name, value.cols[value.expression]))\\r\\n else:\\r\\n placeholder = '%s(%%s)' % self.from_text\\r\\n return placeholder\",\n \"def get_value(name):\\n\\n named_value = get_named_value_raw(name)\\n if named_value is not None:\\n return named_value.value\",\n \"def get_parameter(cur, par):\\n cur.execute(\\\"SELECT value FROM parameters WHERE par='%s';\\\" % par)\\n return cur.fetchone()[0]\",\n \"def find_variable(self, standard_name, any_scope=True, loop_subst=False):\\n if standard_name in self:\\n var = self[standard_name]\\n elif any_scope and (self._parent_dict is not None):\\n var = self._parent_dict.find_variable(standard_name, any_scope)\\n else:\\n var = None\\n # End if\\n if (var is None) and loop_subst:\\n var = self.find_loop_subst(standard_name, any_scope=any_scope)\\n # End if\\n return var\",\n \"def resolve(self, var, context):\\n if var[0] in ('\\\"', \\\"'\\\") and var[-1] == var[0]:\\n return var[1:-1]\\n else:\\n return Variable(var).resolve(context)\",\n \"def resolve(self, var, context):\\n if var[0] in ('\\\"', \\\"'\\\") and var[-1] == var[0]:\\n return var[1:-1]\\n else:\\n return Variable(var).resolve(context)\",\n \"def placeholders(self):\\n x = [i.placeholder for i in self._input_desc]\\n return x[0] if len(x) == 1 else x\",\n \"def get_match_result(self, variable):\\n try:\\n return self._match_result_dict[variable]\\n except KeyError:\\n return None\",\n \"def lookup(self, val):\\n vid = id(val)\\n return self.values.get(vid, None)\",\n \"def lookup(input_field, input_val, output_field):\\n l = list(filter(lambda x : x[input_field] == input_val, data))\\n if len(l) != 0:\\n return l[0][output_field]\\n print(\\\"No entry found for \\\" + input_field + \\\": \\\" + input_val)\\n return \\\"\\\"\",\n \"def find_value(dic, key):\\n return dic[key]\",\n \"def get_value(soup, tag, cond, default=None):\\r\\n ele = soup.find(tag, cond)\\r\\n if ele:\\r\\n return ele.text.strip()\\r\\n return default\",\n \"def _get_value(self, value, context):\\n try:\\n var_value = template.Variable(value).resolve(context)\\n except template.VariableDoesNotExist:\\n try:\\n var_value = self.var_value.var\\n except AttributeError:\\n var_value = self.var_value\\n return var_value\",\n \"def placeholder(self, name, type_name):\\n provenance = NQExprProvenance(\\n operation='placeholder', args=(type_name, name))\\n value = tf.compat.v1.placeholder(\\n tf.float32, shape=[None, self.get_max_id(type_name)], name=name)\\n return self.as_nql(value, type_name, provenance)\",\n \"def find_value(self, func_addr, instr_addr, register):\\n reg_num = idaapi.ph_get_regnames().index(register)\\n\\n # go back from the current instruction to the start of the function\\n for instr_addr in list(instructions(func_addr, instr_addr))[::-1]:\\n # look for instrucations that move a value into the desired register\\n mnemonic = idc.GetMnem(instr_addr)\\n if mnemonic == 'mov':\\n\\n op1_type = idc.get_operand_type(instr_addr, 0)\\n op1_value = idc.get_operand_value(instr_addr, 0)\\n \\n if op1_type == idc.o_reg and op1_value == reg_num:\\n op2_type = idc.get_operand_type(instr_addr, 1)\\n op2_value = idc.get_operand_value(instr_addr, 1)\\n\\n # if this instruction sets the register to an immediate value\\n if op2_type == idc.o_imm:\\n # return that value\\n return op2_value\\n else:\\n # it is not an immediate value, so we say we cannot\\n # resolve the value\\n return None\\n\\n # we did not find an allocation of the register,\\n # so we return None to indicate that\\n return None\",\n \"def read_value(where, ttype=None):\\n ttype = VOID_P if ttype is None else ttype\\n\\n frame = gdb.selected_frame()\\n if where.startswith(\\\"$\\\"):\\n return frame.read_register(where[1:]).cast(ttype)\\n else:\\n to_parse = \\\"(%s) %s\\\" % (str(ttype), where)\\n return gdb.parse_and_eval(to_parse)\",\n \"def _findIdentifierValue (self, identifier : String) -> String:\\n\\n Logging.trace(\\\">>: %s\\\", identifier)\\n cls = self.__class__\\n\\n if identifier not in self._keyToValueMap:\\n # leave identifier as is (it might be some value name like\\n # wahr or false\\n Logging.traceError(\\\"no expansion found\\\")\\n result = identifier\\n else:\\n result = self._keyToValueMap[identifier]\\n\\n if not isString(result):\\n result = repr(result)\\n else:\\n result = (cls._doubleQuoteCharacter + result\\n + cls._doubleQuoteCharacter)\\n\\n Logging.trace(\\\"<<: expanded %s into %r\\\", identifier, result)\\n return result\",\n \"def get_constant(v):\\r\\n if isinstance(v, Variable):\\r\\n try:\\r\\n return get_scalar_constant_value(v)\\r\\n except NotScalarConstantError:\\r\\n return None\\r\\n else:\\r\\n return v\",\n \"def parse_from_placeholder(string,pattern,encloser='%',matcher='(.+)'):\\n pattern,fields = placeholder_to_regex(pattern,encloser,matcher)\\n return parse_from_regex(string,pattern,fields)\",\n \"def get(name: str):\\n if name not in Replacements._rep:\\n return None\\n return Replacements._rep[name]\",\n \"def lookup(self, s, default=None):\\n\\t\\thead, tail = s[0], s[1:]\\n\\t\\tnode = self.root[head]\\n\\t\\tif tail:\\n\\t\\t\\treturn node.lookup(tail)\\n\\t\\treturn node.value or default\",\n \"def get_replacement_value(self, to_be_replaced):\\n name_reg = re.compile('[a-zA-z_]+')\\n param_name = name_reg.search(to_be_replaced).group()\\n return self.params.get(param_name)\",\n \"def lookup(index,keyword):\\n\\tif keyword in index:\\n\\t\\treturn index[keyword]\\n\\treturn None\",\n \"def lookup(scopes, name):\\n # type: (Scopes[T], str) -> Optional[T]\\n\\n for scope in scopes:\\n for key, val in scope:\\n if key == name:\\n return val\\n return None\",\n \"def Variable(name):\\n placeholder_node = placeholder_op()\\n placeholder_node.name = name\\n return placeholder_node\",\n \"def lookup(what, where, default=None):\\n if isinstance(what, (str, unicode)):\\n res = getattr(where, what, default)\\n else:\\n res = what\\n return res\",\n \"def lookup_some_key(what, where, default=None):\\n for w in what:\\n try:\\n return where[w]\\n except KeyError:\\n pass\\n return default\",\n \"def get_value(value):\\n if value:\\n return value.split('\\\\n')[0]\\n else:\\n return None\",\n \"def get_embedding_placeholder(self):\\n return self.embedding_layer.get_embedding_placeholder()\",\n \"def extract_location(x):\\n if not pd.isna(x):\\n x = ast.literal_eval(x)\\n location = x['name']\\n return location\\n else:\\n return np.nan\",\n \"def suggestValue(self, variable: Variable, value: int | float, /) -> None:\\n ...\",\n \"def var():\\n def _var(quoted_name):\\n name = quoted_name.subexpression.name\\n if (value := get_name(name)) is not None:\\n return value\\n else:\\n raise TypeError(f\\\"Binding {name} not found\\\")\\n yield (\\\"(λ &[name] . any)\\\", _var)\",\n \"def find_node(self, value):\\n for (fun, node) in self.__root.__fast_find:\\n if fun(value):\\n return node\\n return None\",\n \"def is_placeholder_value(cls, value):\\n return value == cls.PLACEHOLDER_VALUE\",\n \"def _identity_placeholder(\\n self,\\n x: typing.Any,\\n ) -> typing.Any:\\n return x\",\n \"def get(self, key, default=None):\\n def find(found_item, _):\\n \\\"\\\"\\\" This is the closer function which will be passed to find by key function , if key found than return the value \\n otherwise return blanck\\\"\\\"\\\"\\n if found_item:\\n return found_item[1]\\n else:\\n return default\\n\\n return self._find_by_key(key, find)\",\n \"def lookup_variable_value(var, env):\\n def env_loop(environment):\\n \\\"\\\"\\\"\\n calls scan on each frame in the env list\\n \\\"\\\"\\\"\\n def scan(vars, vals):\\n \\\"\\\"\\\"\\n scans variables in a frame\\n \\\"\\\"\\\"\\n if isNull(vars):\\n return env_loop(enclosing_env(environment)) # 5-4: env -> environment\\n elif isEq(var, car(vars)) == TRUE:\\n return car(vals)\\n else:\\n return scan(cdr(vars), cdr(vals))\\n if environment is the_empty_environment:\\n raise UnboundLocalError(\\\"lookup_variable\\\")\\n frame = first_frame(environment)\\n return scan(frame_variables(frame), frame_values(frame))\\n return env_loop(env)\",\n \"def lookup(name):\",\n \"def lookup(name):\",\n \"def test_find_default(self):\\n mute_map = MutableMap(**VALUE)\\n\\n assert mute_map.find('NOT_VALID', 'default_val') == \\\\\\n 'default_val', 'default should be used'\\n assert mute_map.find('str_val', 'default_val') == \\\\\\n VALUE['str_val'], 'default should be ignored'\",\n \"def default(value, replacement):\\n return value if value is not None else replacement\",\n \"def get(self, node):\\n if node in self.val:\\n return self.val[node]\\n else:\\n return self.initial\",\n \"def get(name, default=None):\",\n \"def var_or_atomic_or_blank():\\n return var_or_atomic() | next_value('_')\",\n \"def find_regvar(*args):\\n return _ida_frame.find_regvar(*args)\",\n \"def _get_simple_null_value(simple):\\n return _SIMPLE_NULL_VALUES[simple]\",\n \"def get_config_value(keyword):\\n if g_configs and keyword in g_configs:\\n return g_configs[keyword]\\n return \\\"\\\"\",\n \"def _get_variable_name(param_name):\\n m = re.match(\\\"^(.*):\\\\\\\\d+$\\\", param_name)\\n if m is not None:\\n param_name = m.group(1)\\n return param_name\",\n \"def get_value(self, locator: Locator) -> Optional[str]:\\n element = self.ctx.get_element(locator)\\n get_value_pattern = self.get_value_pattern(element)\\n\\n if get_value_pattern:\\n func_name = get_value_pattern.__name__\\n self.logger.info(\\n \\\"Retrieving the element value with the %r method.\\\", func_name\\n )\\n value_pattern = get_value_pattern()\\n return value_pattern.Value if value_pattern else None\\n\\n raise ActionNotPossible(\\n f\\\"Element found with {locator!r} doesn't support value retrieval\\\"\\n )\",\n \"def lookup(self, var):\\n\\t\\tsearched = self._search(self._root, var)\\n\\t\\tif searched is not None:\\n\\t\\t\\treturn searched._value\\n\\t\\telse:\\n\\t\\t\\tself._assign(var, 0)\\t#creates the new variable to 0\\n\\t\\t\\treturn 0\",\n \"def getfield(value, arg):\\n #import pdb; pdb.set_trace()\\n if hasattr(value, \\\"fields\\\"):\\n fields = getattr(value, \\\"fields\\\")\\n if str(arg) in fields:\\n return str(fields[str(arg)])\",\n \"def _find(self, val, cur_node):\\n if val == cur_node.data:\\n return cur_node\\n elif val > cur_node.data:\\n if not cur_node.right:\\n return None\\n return self._find(val, cur_node.right)\\n elif val < cur_node.data:\\n if not cur_node.left:\\n return None\\n return self._find(val, cur_node.left)\",\n \"def __getitem__(self, v):\\r\\n return self.unif.get(v, (v, None))[0]\",\n \"def get(self, var: str, default: Union[str, T] = '') -> Union[str, T]:\\n if var[0] == '$':\\n var = var[1:]\\n folded_var = var.casefold()\\n if folded_var in self._fixup:\\n return self._fixup[folded_var].value\\n else:\\n return default\",\n \"def find(self, number: str) -> Optional[str]:\\n if number in self.data: # noqa\\n return number\\n else:\\n return None\",\n \"def get_value(cursor, address):\\n for part in address.split('.'):\\n try:\\n cursor = cursor[part]\\n except KeyError:\\n LOG.warning(\\\"KeyError: %s (%s)\\\", part, address)\\n return\\n return cursor\",\n \"def get_variable(self, col: str, name: str, default: T = None) -> T:\\n if self.scope is None:\\n raise ValueError(\\\"Can't access variables on unbound modules\\\")\\n return self.scope.get_variable(col, name, default)\",\n \"def get_value(arg):\\n if arg in self.args_repository:\\n return self.args_repository[arg]\\n if arg in self.data_repository:\\n return self.data_repository[arg]\\n print_error(\\\"value for mandatory argument '{0}' not available in \\\"\\n \\\"data_repository/args_repository\\\".format(args))\\n return None\",\n \"def lookup():\",\n \"def _pick_variable(self, variable_and_offsets):\\n\\n if isinstance(self.operand, MemoryOperand):\\n if len(variable_and_offsets) > 1:\\n log.error(\\\"Instruction %#x has two memory operands. Please report it on GitHub.\\\", self.insn.addr)\\n return variable_and_offsets[0]\\n\\n elif isinstance(self.operand, RegisterOperand):\\n # there might be multiple register-type variables for an instruction. pick the right one is... not easy\\n\\n the_reg = self.operand.register\\n if the_reg is None:\\n # huh, it does not have a Register child\\n return None, None\\n\\n reg_name = the_reg.reg\\n arch = self.instance.project.arch\\n\\n if len(variable_and_offsets) == 1:\\n # only one candidate...\\n var, offset = variable_and_offsets[0]\\n if arch.registers[reg_name][0] == var.reg:\\n return var, offset\\n return None, None\\n\\n if self.operand_index > 0:\\n # this is the source operand\\n # which variable is read here?\\n for var, offset in variable_and_offsets:\\n if arch.registers[reg_name][0] == var.reg:\\n if self._variable_has_access(var, self.insn.addr, \\\"read\\\"):\\n return var, offset\\n\\n log.debug(\\n \\\"Cannot find any source variable for operand %d at instruction %#x.\\\",\\n self.operand_index,\\n self.insn.addr,\\n )\\n return None, None\\n\\n # this is the destination operand\\n # which variable is written here?\\n for var, offset in variable_and_offsets:\\n if arch.registers[reg_name][0] == var.reg and self._variable_has_access(var, self.insn.addr, \\\"write\\\"):\\n return var, offset\\n\\n log.debug(\\n \\\"Cannot find any destination variable for operand %d at instruction %#x.\\\",\\n self.operand_index,\\n self.insn.addr,\\n )\\n # just return the first one\\n return None, None\\n\\n else:\\n # what's this type? why am I here?\\n log.error(\\\"_pick_variable: Unsupported operand type %s.\\\", self.operand.__class__)\\n\\n return None, None\",\n \"def get_parameter(self, param):\\n try:\\n result = self._data[\\\"queryResult\\\"][\\\"parameters\\\"][param]\\n except KeyError:\\n result = None\\n\\n return result\",\n \"def find_field(browser, field, value):\\r\\n return find_field_by_id(browser, field, value) or \\\\\\r\\n find_field_by_name(browser, field, value) or \\\\\\r\\n find_field_by_label(browser, field, value)\",\n \"def extract_placename(query_result):\\n if 'name' in query_result.keys():\\n return query_result['name']\\n else:\\n return np.float('nan')\",\n \"def lookup(self, key):\\n n = self.find(key)\\n if n:\\n return n.value\\n else:\\n return False\",\n \"def soar_substitute(value, json_str):\\n replace_dict = json.loads(json_str)\\n if value in replace_dict:\\n return replace_dict[value]\\n\\n # use a default value if specific match is missing\\n if 'DEFAULT' in replace_dict:\\n return replace_dict['DEFAULT']\\n\\n return value\",\n \"def search(self, val):\\n search = self.head\\n while search:\\n if search.val == val:\\n return search\\n search = search.next\\n return None\",\n \"def getValue(splits, featureName):\\n for split in splits:\\n if split.startswith(featureName):\\n return split[split.find(\\\"=\\\")+1:]\\n \\n return None\",\n \"def _get_simple_default_value(simple):\\n return _SIMPLE_DEFAULT_VALUES[simple]\",\n \"def find_arg(needle, haystack):\\r\\n for i in range(0, len(haystack)):\\r\\n if haystack[i] == needle:\\r\\n try:\\r\\n return haystack[i+1]\\r\\n except IndexError:\\r\\n pass\\r\\n return None\",\n \"def _tkvar_get(self,param_name):\\n tk_val = self._tkvars[param_name]._original_get()\\n po_val = self.get_parameter_value(param_name)\\n\\n po_stringrep = self._object2string(param_name,po_val)\\n\\n if not self.translators[param_name].last_string2object_failed and not tk_val==po_stringrep:\\n self._tkvars[param_name]._original_set(po_stringrep)\\n return tk_val\",\n \"def _lookup_typedef_value(typedef, name):\\n assert typedef is not None\\n assert name is not None\\n \\n # Check if the typedef has the attribute\\n value = typedef.get(name)\\n if value:\\n return value\\n \\n # Otherwise, see if it's defined in the base type(s)\\n base_type_name = typedef.get('base-type')\\n if base_type_name:\\n base_typedef = typedef_registry.get(base_type_name)\\n if not base_typedef:\\n raise error.CommandDescriptionError('Unknown type name: %s' % base_type_name)\\n return _lookup_typedef_value(base_typedef, name)\\n\\n return None\",\n \"def _get_variable_name(self, param_name):\\n m = re.match(\\\"^(.*):\\\\\\\\d+$\\\", param_name)\\n if m is not None:\\n param_name = m.group(1)\\n return param_name\",\n \"def _get_variable_name(self, param_name):\\n m = re.match(\\\"^(.*):\\\\\\\\d+$\\\", param_name)\\n if m is not None:\\n param_name = m.group(1)\\n return param_name\",\n \"def _get_variable_name(self, param_name):\\n m = re.match(\\\"^(.*):\\\\\\\\d+$\\\", param_name)\\n if m is not None:\\n param_name = m.group(1)\\n return param_name\",\n \"def _get_variable_name(self, param_name):\\n m = re.match(\\\"^(.*):\\\\\\\\d+$\\\", param_name)\\n if m is not None:\\n param_name = m.group(1)\\n return param_name\",\n \"def _get_variable_name(self, param_name):\\n m = re.match(\\\"^(.*):\\\\\\\\d+$\\\", param_name)\\n if m is not None:\\n param_name = m.group(1)\\n return param_name\",\n \"def resolve_resolver_value(self, resolver: \\\"Resolver\\\") -> Any:\\n try:\\n return resolver.resolve()\\n except RecursiveResolve:\\n # Recursive resolve issues shouldn't be masked by a placeholder.\\n raise\\n except Exception:\\n if are_placeholders_enabled():\\n placeholder_value = create_placeholder_value(\\n resolver, self.placeholder_type\\n )\\n\\n self.logger.debug(\\n \\\"Error encountered while resolving the resolver. This is allowed for the current \\\"\\n f\\\"operation. Resolving it to a placeholder value instead: {placeholder_value}\\\"\\n )\\n return placeholder_value\\n raise\",\n \"def _find_first(self, ast, label):\\n res = self._find_all(ast, label, max_results=1)\\n if len(res):\\n return res[0]\\n return None\",\n \"def get_val(self, name, default=None):\\r\\n val = cF.get_val(name, default=default)\\r\\n if name == \\\"first\\\":\\r\\n if val == \\\"\\\":\\r\\n val == 0\\r\\n elif name == \\\"last\\\":\\r\\n if val == \\\"\\\" or val == 0:\\r\\n val = 0\\r\\n return val\",\n \"def resolve(var, context):\\n try:\\n return var.resolve(context)\\n except template.VariableDoesNotExist:\\n return var.var\",\n \"def visit_Variable(self, node):\\n var_name = node.value\\n val = self.VARIABLES.get(var_name)\\n if val is None:\\n raise NameError(repr(var_name))\\n else:\\n return val\",\n \"def placeholder():\\n return ResultProxy(TaskResult())\",\n \"def find_value(self, x, y):\\n for cell in self.cells:\\n if cell.coordinates == (x,y):\\n return cell.value\\n else:\\n return None\",\n \"def find_value(self, key):\\n values = self.values\\n if key not in values:\\n raise AttributeError(\\\"Config has no value for {}\\\".format(key))\\n\\n val = values[key]\\n if isinstance(val, Default):\\n return val.val\\n else:\\n return val\",\n \"def search(self, val):\\n current = self.head\\n # import pdb; pdb.set_trace()\\n while current is not None:\\n if current.data == val:\\n return current\\n current = current.next_node\\n return None\",\n \"def findFootnotesPlaceholder(self, root):\\n def finder(element):\\n for child in element:\\n if child.text:\\n if child.text.find(self.getConfig(\\\"PLACE_MARKER\\\")) > -1:\\n return child, element, True\\n if child.tail:\\n if child.tail.find(self.getConfig(\\\"PLACE_MARKER\\\")) > -1:\\n return child, element, False\\n finder(child)\\n return None\\n \\n res = finder(root)\\n return res\",\n \"def js_var(var, raw):\\n lestr = r\\\"\\\\b{0}\\\\s*=\\\\s*\\\\\\\"([^\\\\\\\"]+)\\\".format(var)\\n match = search(lestr, raw)\\n return None if match is None else match.group(1)\",\n \"def getValue(self,value):\\n if value in self.header.keys():\\n return self.header[value]\\n if value in self.subintinfo.keys():\\n return self.subintinfo[value][-1]\\n if self.params is None:\\n return None\\n return self.params.get(value) #will return None if non-existent\",\n \"def _find(self, details: CallableDetails) -> CallableArg:\\n if self.name:\\n return self._find_by_name(details, self.name)\\n else:\\n return self._get_first(details)\",\n \"def _get_fact(self, fact):\\n for kbfact in self.facts:\\n if fact == kbfact:\\n return kbfact\",\n \"def _get_fact(self, fact):\\n for kbfact in self.facts:\\n if fact == kbfact:\\n return kbfact\",\n \"def _get_fact(self, fact):\\n for kbfact in self.facts:\\n if fact == kbfact:\\n return kbfact\",\n \"def _getInputValue(self, name, target = ''):\\n value = self._getInputValue(name, target)\\n return value.getData() if value else None\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.72384614","0.65259403","0.6496153","0.64682907","0.60817194","0.58944154","0.5852093","0.5762202","0.57511127","0.56862986","0.56270653","0.55724573","0.5522929","0.5522929","0.5460267","0.5454473","0.5445658","0.54357004","0.54279006","0.54072934","0.54031765","0.5377545","0.53610915","0.53523374","0.534216","0.5340468","0.53398013","0.53364336","0.5324088","0.5315964","0.5315938","0.5311586","0.5308344","0.5298594","0.5292584","0.52908075","0.5267696","0.5265393","0.52648836","0.5254388","0.52468324","0.52361566","0.5231783","0.5227554","0.5216189","0.5211533","0.5211533","0.52098745","0.5204919","0.52039826","0.5169481","0.51592124","0.51491433","0.5143561","0.5141684","0.51393497","0.51341003","0.51210153","0.5116357","0.51162255","0.51160914","0.511534","0.5114423","0.51122344","0.5107098","0.50997925","0.5099471","0.50977534","0.5094953","0.509326","0.5091725","0.5085734","0.50846124","0.50833476","0.5080354","0.50776094","0.5076754","0.5074039","0.50633365","0.5057327","0.5057327","0.5057327","0.5057327","0.5057327","0.5055252","0.5053316","0.50516766","0.50498646","0.5048661","0.50462514","0.5038646","0.5037388","0.5021009","0.50200844","0.5019467","0.5018014","0.5013128","0.5008758","0.5008758","0.5008758","0.50016594"],"string":"[\n \"0.72384614\",\n \"0.65259403\",\n \"0.6496153\",\n \"0.64682907\",\n \"0.60817194\",\n \"0.58944154\",\n \"0.5852093\",\n \"0.5762202\",\n \"0.57511127\",\n \"0.56862986\",\n \"0.56270653\",\n \"0.55724573\",\n \"0.5522929\",\n \"0.5522929\",\n \"0.5460267\",\n \"0.5454473\",\n \"0.5445658\",\n \"0.54357004\",\n \"0.54279006\",\n \"0.54072934\",\n \"0.54031765\",\n \"0.5377545\",\n \"0.53610915\",\n \"0.53523374\",\n \"0.534216\",\n \"0.5340468\",\n \"0.53398013\",\n \"0.53364336\",\n \"0.5324088\",\n \"0.5315964\",\n \"0.5315938\",\n \"0.5311586\",\n \"0.5308344\",\n \"0.5298594\",\n \"0.5292584\",\n \"0.52908075\",\n \"0.5267696\",\n \"0.5265393\",\n \"0.52648836\",\n \"0.5254388\",\n \"0.52468324\",\n \"0.52361566\",\n \"0.5231783\",\n \"0.5227554\",\n \"0.5216189\",\n \"0.5211533\",\n \"0.5211533\",\n \"0.52098745\",\n \"0.5204919\",\n \"0.52039826\",\n \"0.5169481\",\n \"0.51592124\",\n \"0.51491433\",\n \"0.5143561\",\n \"0.5141684\",\n \"0.51393497\",\n \"0.51341003\",\n \"0.51210153\",\n \"0.5116357\",\n \"0.51162255\",\n \"0.51160914\",\n \"0.511534\",\n \"0.5114423\",\n \"0.51122344\",\n \"0.5107098\",\n \"0.50997925\",\n \"0.5099471\",\n \"0.50977534\",\n \"0.5094953\",\n \"0.509326\",\n \"0.5091725\",\n \"0.5085734\",\n \"0.50846124\",\n \"0.50833476\",\n \"0.5080354\",\n \"0.50776094\",\n \"0.5076754\",\n \"0.5074039\",\n \"0.50633365\",\n \"0.5057327\",\n \"0.5057327\",\n \"0.5057327\",\n \"0.5057327\",\n \"0.5057327\",\n \"0.5055252\",\n \"0.5053316\",\n \"0.50516766\",\n \"0.50498646\",\n \"0.5048661\",\n \"0.50462514\",\n \"0.5038646\",\n \"0.5037388\",\n \"0.5021009\",\n \"0.50200844\",\n \"0.5019467\",\n \"0.5018014\",\n \"0.5013128\",\n \"0.5008758\",\n \"0.5008758\",\n \"0.5008758\",\n \"0.50016594\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94771,"cells":{"query":{"kind":"string","value":"return the correct value for the placeholder"},"document":{"kind":"string","value":"def get(self, get_params, block):\n value = f\"{{{self.key}}}\"\n try:\n value = value_ = get_params(self.key)\n if self.format.startswith(\":\"):\n # if a parameter has been set to be formatted as a numeric\n # type then we see if we can coerce it to be. This allows\n # the user to format types that normally would not be\n # allowed eg '123' it also allows {:d} to be used as a\n # shorthand for {:.0f}. Use {:g} to remove insignificant\n # trailing zeroes and the decimal point too if there are\n # no remaining digits following it. If the parameter cannot\n # be successfully converted then the format will be removed.\n try:\n if \"escape\" in self.format:\n value = escape(value)\n if \"ceil\" in self.format:\n value = ceil(float(value))\n if \"f\" in self.format:\n value = float(value)\n if \"g\" in self.format:\n value = float(value)\n if \"d\" in self.format:\n value = int(float(value))\n output = f\"{{[{self.key}]{self.format}}}\"\n value = output.format({self.key: value})\n value_ = float(value)\n except ValueError:\n pass\n elif self.format.startswith(\"!\"):\n output = f\"{{{self.key}{self.format}}}\"\n value = value_ = output.format(**{self.key: value})\n\n if block.commands.not_zero:\n valid = value_ not in [\"\", None, False, \"0\", \"0.0\", 0, 0.0]\n else:\n # '', None, and False are ignored\n # numbers like 0 and 0.0 are not.\n valid = not (value_ in [\"\", None] or value_ is False)\n enough = False\n except: # noqa e722\n # Exception raised when we don't have the param\n enough = True\n valid = False\n\n return valid, value, enough"},"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 placeholder(self):\n return self._placeholder","def placeholder(self) -> str | None:\n return self._underlying.placeholder","def get_val(self):\n return","def get_geom_placeholder(self, value, srid):\r\n if hasattr(value, 'expression'):\r\n placeholder = '%s.%s' % tuple(map(self.quote_name, value.cols[value.expression]))\r\n else:\r\n placeholder = '%s(%%s)' % self.from_text\r\n return placeholder","def get_value(self):\n return None","def __prepare_value(self, val, none_symbol=\"-\"):\n\t\t# If type is a tuple, then it is a \n\t\t# (func_unit_label, replica_id) pair. \n\t\t# Concatenate then using \"_\" symbol.\n\t\tif type(val) == type(()):\n\t\t\tval = \"_\".join(map(str, val))\n\n\t\t# Cast value to string/character type,\n\t\t# if it is not a None value\n\t\tif val is not None:\n\t\t\tval = str(val)\n\t\telse:\n\t\t\tval = none_symbol\n\n\t\t# Value processing finished\n\t\treturn val","def get_value(self):","def getValue(name, default=None):","def __findPlaceholder(self, data, index):\r\n m = self.__placeholder_re.search(data, index)\r\n if m:\r\n return m.group(1), m.end()\r\n else:\r\n return None, index + 1","def get_value(self):\n pass","def _tkvar_get(self,param_name):\n tk_val = self._tkvars[param_name]._original_get()\n po_val = self.get_parameter_value(param_name)\n\n po_stringrep = self._object2string(param_name,po_val)\n\n if not self.translators[param_name].last_string2object_failed and not tk_val==po_stringrep:\n self._tkvars[param_name]._original_set(po_stringrep)\n return tk_val","def _get_value(self):\n return self.__value","def _value(self) -> Any:\n if not self._stack:\n if self.required:\n raise PyParamValueError(\"Argument is required.\")\n return self.default\n ret = self._stack[-1][0]\n self._stack = []\n return ret","def _getDefaultValue(self):\n value = self._getDefaultValue()\n return value.getData() if value else None","def _value_if_not_fixed(o, d):\n if o.fixed:\n return ()\n return (\"value\",)","def is_placeholder_value(cls, value):\n return value == cls.PLACEHOLDER_VALUE","def _value(self):\n if self.data is None:\n return self._original_value\n elif self.get_label:\n return self.get_label(self.data)\n else:\n return unicode(self.data)","def _safe_value(self, var_name, type_formatter = None):\n var = self.device.get_variable(var_name)\n if var is not None:\n if type_formatter is not None and var.value is not None:\n return type_formatter(var.value)\n else:\n return var.value\n return None","def get_value ( self, object ):\n try:\n value = getattr( object, self.name )\n try:\n return self.format % ( value, )\n except:\n return 'Format!'\n except:\n return 'Undefined!'","def inputValue(self):\n return self.variable","def get_default_value(self):\n pass","def get_val(self, name, default=None):\r\n val = cF.get_val(name, default=default)\r\n if name == \"first\":\r\n if val == \"\":\r\n val == 0\r\n elif name == \"last\":\r\n if val == \"\" or val == 0:\r\n val = 0\r\n return val","def variable(self, val):","def _get_value(self):\n \n return self._value","def getval(self):\r\n return self.value","def getDefaultValue(self) -> Optional[int]:\n try:\n return int(self.placeholderText())\n except ValueError:\n return None","def run(self, value):\r\n return '' if value is None else value","def getvalue(self):\n ...","def getvalue(self):\n ...","def value(self) -> global___Expression:","def value(self) -> global___Expression:","def request_value(self) -> global___Expression:","def get_val(self):\n return self.value","def _getInputValue(self, name, target = ''):\n value = self._getInputValue(name, target)\n return value.getData() if value else None","def get_replacement_value(self, to_be_replaced):\n name_reg = re.compile('[a-zA-z_]+')\n param_name = name_reg.search(to_be_replaced).group()\n return self.params.get(param_name)","def lazy_value(self):\n\n if self.state == Node.State.VALID:\n return self.value\n else:\n return None","def _get_value(self, value, context):\n try:\n var_value = template.Variable(value).resolve(context)\n except template.VariableDoesNotExist:\n try:\n var_value = self.var_value.var\n except AttributeError:\n var_value = self.var_value\n return var_value","def get_value(self):\r\n return 0","def param_value(self):\n if self.string:\n return self.string\n if self.token:\n return self.token\n if self.number:\n return self.number\n if self.date:\n return self.date\n if self.quantity:\n return self.quantity\n if self.reference:\n return self.reference\n return ''","def placeholders(self):\n x = [i.placeholder for i in self._input_desc]\n return x[0] if len(x) == 1 else x","def _identity_placeholder(\n self,\n x: typing.Any,\n ) -> typing.Any:\n return x","def get_value(self):\n return self._value","def getValue(self):\n return self.initValue","def getValue(self) -> int:\n ...","def get_val(self, **kwargs):\n return self._value","def default(value, replacement):\n return value if value is not None else replacement","def default_value_scalar(source=None):\n if not default:\n return None\n if not source:\n return default\n else:\n return source","def __call__(self):\n return self.value","def get_val(self):\n if self.val_obj is None:\n return None\n else:\n return self.val_obj.val","def value(self):\n self.refresh_default_value()\n return self.default_value","def __getSafeValue(self, key, item):\n try:\n if key.value in self.local:\n value = self.local[key.value]\n else:\n value = self.system.value(key.value, item.default)\n\n if item.type is int:\n value = int(value)\n if item.limits is not None and (value > item.limits[1] or value < item.limits[0]):\n return item.default\n return value\n\n elif item.type is float:\n value = float(value)\n if item.limits is not None and (value > item.limits[1] or value < item.limits[0]):\n return item.default\n return value\n\n elif item.type is bool:\n if type(value) is bool:\n return value\n else:\n # QSetting stores boolean as string in ini file\n return (value.lower() == 'true') if type(value) is str else item.default\n\n elif item.type is list or item.type is tuple:\n if type(value) is str:\n # QSetting could return string when list contains single value\n value = [value] if value else item.default\n\n if item.sub_type is not None:\n value = item.type(map(item.sub_type, value))\n\n if item.fixed_size and item.size != len(value):\n return item.default\n\n if item.limits is not None:\n for v in value:\n if v > item.limits[1] or v < item.limits[0]:\n return item.default\n\n return value\n\n else:\n return item.type(value)\n\n except (ValueError, TypeError):\n return item.default","def __getitem__(self, item):\n if item == \"data\":\n return self.f_get()\n elif item == \"default\" or item == -1:\n return self.f_get_default()\n else:\n return super(Parameter, self).__getitem__(item)","def Value(self) -> str:","def proc_next_ph_tpl(self, ft, nul_val): # TODO change to phoneme!!\n return getattr(self, ft)[1:] + (nul_val,)","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def value(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"value\")","def _default_value(self):\n return None","def suggestValue(self, variable: Variable, value: int | float, /) -> None:\n ...","def value_constraint(self):\n return self.fixed if self.fixed is not None else self.default","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def value(self) -> Optional[pulumi.Input[str]]:\n return pulumi.get(self, \"value\")","def get(self, node):\n if node in self.val:\n return self.val[node]\n else:\n return self.initial","def get_value(self, key, args, kwargs):\n if self.default is not None:\n try:\n return string.Formatter.get_value(self, key, args, kwargs)\n except KeyError:\n return self.default\n else:\n return string.Formatter.get_value(self, key, args, kwargs)","def get_value(self, instance):\n try:\n return ParameterSetting.objects.get(\n base_parameter=instance,\n project=self.context.get(\"view\").kwargs.get(\"project\"),\n ).raw_value\n except ParameterSetting.DoesNotExist:\n return None","def _assignValue(value):\n if value == \"\":\n return None\n else:\n return value","def get_embedding_placeholder(self):\n return self.embedding_layer.get_embedding_placeholder()","def vvalue(self) -> Qval:\n return self.get(self.greedy())","def placeholder(self, name, type_name):\n provenance = NQExprProvenance(\n operation='placeholder', args=(type_name, name))\n value = tf.compat.v1.placeholder(\n tf.float32, shape=[None, self.get_max_id(type_name)], name=name)\n return self.as_nql(value, type_name, provenance)","def _get_simple_default_value(simple):\n return _SIMPLE_DEFAULT_VALUES[simple]","def get_value(self):\n raise NotImplementedError","def proc_prev_ph_tpl(self, ft, nul_val): # TODO change to phoneme!!\n return (nul_val,) + getattr(self, ft)[:-1]"],"string":"[\n \"def placeholder(self):\\n return self._placeholder\",\n \"def placeholder(self) -> str | None:\\n return self._underlying.placeholder\",\n \"def get_val(self):\\n return\",\n \"def get_geom_placeholder(self, value, srid):\\r\\n if hasattr(value, 'expression'):\\r\\n placeholder = '%s.%s' % tuple(map(self.quote_name, value.cols[value.expression]))\\r\\n else:\\r\\n placeholder = '%s(%%s)' % self.from_text\\r\\n return placeholder\",\n \"def get_value(self):\\n return None\",\n \"def __prepare_value(self, val, none_symbol=\\\"-\\\"):\\n\\t\\t# If type is a tuple, then it is a \\n\\t\\t# (func_unit_label, replica_id) pair. \\n\\t\\t# Concatenate then using \\\"_\\\" symbol.\\n\\t\\tif type(val) == type(()):\\n\\t\\t\\tval = \\\"_\\\".join(map(str, val))\\n\\n\\t\\t# Cast value to string/character type,\\n\\t\\t# if it is not a None value\\n\\t\\tif val is not None:\\n\\t\\t\\tval = str(val)\\n\\t\\telse:\\n\\t\\t\\tval = none_symbol\\n\\n\\t\\t# Value processing finished\\n\\t\\treturn val\",\n \"def get_value(self):\",\n \"def getValue(name, default=None):\",\n \"def __findPlaceholder(self, data, index):\\r\\n m = self.__placeholder_re.search(data, index)\\r\\n if m:\\r\\n return m.group(1), m.end()\\r\\n else:\\r\\n return None, index + 1\",\n \"def get_value(self):\\n pass\",\n \"def _tkvar_get(self,param_name):\\n tk_val = self._tkvars[param_name]._original_get()\\n po_val = self.get_parameter_value(param_name)\\n\\n po_stringrep = self._object2string(param_name,po_val)\\n\\n if not self.translators[param_name].last_string2object_failed and not tk_val==po_stringrep:\\n self._tkvars[param_name]._original_set(po_stringrep)\\n return tk_val\",\n \"def _get_value(self):\\n return self.__value\",\n \"def _value(self) -> Any:\\n if not self._stack:\\n if self.required:\\n raise PyParamValueError(\\\"Argument is required.\\\")\\n return self.default\\n ret = self._stack[-1][0]\\n self._stack = []\\n return ret\",\n \"def _getDefaultValue(self):\\n value = self._getDefaultValue()\\n return value.getData() if value else None\",\n \"def _value_if_not_fixed(o, d):\\n if o.fixed:\\n return ()\\n return (\\\"value\\\",)\",\n \"def is_placeholder_value(cls, value):\\n return value == cls.PLACEHOLDER_VALUE\",\n \"def _value(self):\\n if self.data is None:\\n return self._original_value\\n elif self.get_label:\\n return self.get_label(self.data)\\n else:\\n return unicode(self.data)\",\n \"def _safe_value(self, var_name, type_formatter = None):\\n var = self.device.get_variable(var_name)\\n if var is not None:\\n if type_formatter is not None and var.value is not None:\\n return type_formatter(var.value)\\n else:\\n return var.value\\n return None\",\n \"def get_value ( self, object ):\\n try:\\n value = getattr( object, self.name )\\n try:\\n return self.format % ( value, )\\n except:\\n return 'Format!'\\n except:\\n return 'Undefined!'\",\n \"def inputValue(self):\\n return self.variable\",\n \"def get_default_value(self):\\n pass\",\n \"def get_val(self, name, default=None):\\r\\n val = cF.get_val(name, default=default)\\r\\n if name == \\\"first\\\":\\r\\n if val == \\\"\\\":\\r\\n val == 0\\r\\n elif name == \\\"last\\\":\\r\\n if val == \\\"\\\" or val == 0:\\r\\n val = 0\\r\\n return val\",\n \"def variable(self, val):\",\n \"def _get_value(self):\\n \\n return self._value\",\n \"def getval(self):\\r\\n return self.value\",\n \"def getDefaultValue(self) -> Optional[int]:\\n try:\\n return int(self.placeholderText())\\n except ValueError:\\n return None\",\n \"def run(self, value):\\r\\n return '' if value is None else value\",\n \"def getvalue(self):\\n ...\",\n \"def getvalue(self):\\n ...\",\n \"def value(self) -> global___Expression:\",\n \"def value(self) -> global___Expression:\",\n \"def request_value(self) -> global___Expression:\",\n \"def get_val(self):\\n return self.value\",\n \"def _getInputValue(self, name, target = ''):\\n value = self._getInputValue(name, target)\\n return value.getData() if value else None\",\n \"def get_replacement_value(self, to_be_replaced):\\n name_reg = re.compile('[a-zA-z_]+')\\n param_name = name_reg.search(to_be_replaced).group()\\n return self.params.get(param_name)\",\n \"def lazy_value(self):\\n\\n if self.state == Node.State.VALID:\\n return self.value\\n else:\\n return None\",\n \"def _get_value(self, value, context):\\n try:\\n var_value = template.Variable(value).resolve(context)\\n except template.VariableDoesNotExist:\\n try:\\n var_value = self.var_value.var\\n except AttributeError:\\n var_value = self.var_value\\n return var_value\",\n \"def get_value(self):\\r\\n return 0\",\n \"def param_value(self):\\n if self.string:\\n return self.string\\n if self.token:\\n return self.token\\n if self.number:\\n return self.number\\n if self.date:\\n return self.date\\n if self.quantity:\\n return self.quantity\\n if self.reference:\\n return self.reference\\n return ''\",\n \"def placeholders(self):\\n x = [i.placeholder for i in self._input_desc]\\n return x[0] if len(x) == 1 else x\",\n \"def _identity_placeholder(\\n self,\\n x: typing.Any,\\n ) -> typing.Any:\\n return x\",\n \"def get_value(self):\\n return self._value\",\n \"def getValue(self):\\n return self.initValue\",\n \"def getValue(self) -> int:\\n ...\",\n \"def get_val(self, **kwargs):\\n return self._value\",\n \"def default(value, replacement):\\n return value if value is not None else replacement\",\n \"def default_value_scalar(source=None):\\n if not default:\\n return None\\n if not source:\\n return default\\n else:\\n return source\",\n \"def __call__(self):\\n return self.value\",\n \"def get_val(self):\\n if self.val_obj is None:\\n return None\\n else:\\n return self.val_obj.val\",\n \"def value(self):\\n self.refresh_default_value()\\n return self.default_value\",\n \"def __getSafeValue(self, key, item):\\n try:\\n if key.value in self.local:\\n value = self.local[key.value]\\n else:\\n value = self.system.value(key.value, item.default)\\n\\n if item.type is int:\\n value = int(value)\\n if item.limits is not None and (value > item.limits[1] or value < item.limits[0]):\\n return item.default\\n return value\\n\\n elif item.type is float:\\n value = float(value)\\n if item.limits is not None and (value > item.limits[1] or value < item.limits[0]):\\n return item.default\\n return value\\n\\n elif item.type is bool:\\n if type(value) is bool:\\n return value\\n else:\\n # QSetting stores boolean as string in ini file\\n return (value.lower() == 'true') if type(value) is str else item.default\\n\\n elif item.type is list or item.type is tuple:\\n if type(value) is str:\\n # QSetting could return string when list contains single value\\n value = [value] if value else item.default\\n\\n if item.sub_type is not None:\\n value = item.type(map(item.sub_type, value))\\n\\n if item.fixed_size and item.size != len(value):\\n return item.default\\n\\n if item.limits is not None:\\n for v in value:\\n if v > item.limits[1] or v < item.limits[0]:\\n return item.default\\n\\n return value\\n\\n else:\\n return item.type(value)\\n\\n except (ValueError, TypeError):\\n return item.default\",\n \"def __getitem__(self, item):\\n if item == \\\"data\\\":\\n return self.f_get()\\n elif item == \\\"default\\\" or item == -1:\\n return self.f_get_default()\\n else:\\n return super(Parameter, self).__getitem__(item)\",\n \"def Value(self) -> str:\",\n \"def proc_next_ph_tpl(self, ft, nul_val): # TODO change to phoneme!!\\n return getattr(self, ft)[1:] + (nul_val,)\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def _default_value(self):\\n return None\",\n \"def suggestValue(self, variable: Variable, value: int | float, /) -> None:\\n ...\",\n \"def value_constraint(self):\\n return self.fixed if self.fixed is not None else self.default\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def value(self) -> Optional[pulumi.Input[str]]:\\n return pulumi.get(self, \\\"value\\\")\",\n \"def get(self, node):\\n if node in self.val:\\n return self.val[node]\\n else:\\n return self.initial\",\n \"def get_value(self, key, args, kwargs):\\n if self.default is not None:\\n try:\\n return string.Formatter.get_value(self, key, args, kwargs)\\n except KeyError:\\n return self.default\\n else:\\n return string.Formatter.get_value(self, key, args, kwargs)\",\n \"def get_value(self, instance):\\n try:\\n return ParameterSetting.objects.get(\\n base_parameter=instance,\\n project=self.context.get(\\\"view\\\").kwargs.get(\\\"project\\\"),\\n ).raw_value\\n except ParameterSetting.DoesNotExist:\\n return None\",\n \"def _assignValue(value):\\n if value == \\\"\\\":\\n return None\\n else:\\n return value\",\n \"def get_embedding_placeholder(self):\\n return self.embedding_layer.get_embedding_placeholder()\",\n \"def vvalue(self) -> Qval:\\n return self.get(self.greedy())\",\n \"def placeholder(self, name, type_name):\\n provenance = NQExprProvenance(\\n operation='placeholder', args=(type_name, name))\\n value = tf.compat.v1.placeholder(\\n tf.float32, shape=[None, self.get_max_id(type_name)], name=name)\\n return self.as_nql(value, type_name, provenance)\",\n \"def _get_simple_default_value(simple):\\n return _SIMPLE_DEFAULT_VALUES[simple]\",\n \"def get_value(self):\\n raise NotImplementedError\",\n \"def proc_prev_ph_tpl(self, ft, nul_val): # TODO change to phoneme!!\\n return (nul_val,) + getattr(self, ft)[:-1]\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7000699","0.67986435","0.6459541","0.6312645","0.61937106","0.6171836","0.615392","0.6140465","0.61130303","0.60600764","0.59495264","0.5948369","0.5947296","0.5940576","0.59120387","0.59089774","0.5895668","0.58923846","0.58919656","0.58830136","0.58829343","0.58770293","0.58736074","0.5855019","0.58477247","0.58408934","0.5818353","0.5811792","0.5811792","0.5808128","0.5808128","0.5800015","0.57869196","0.57847804","0.5783371","0.57695687","0.576113","0.5755081","0.57480407","0.57340515","0.57300806","0.57207644","0.57090056","0.57054883","0.57040375","0.5668319","0.56625825","0.5647044","0.5640584","0.564045","0.564027","0.5638977","0.56372166","0.56358784","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5634058","0.5631929","0.5628087","0.5627616","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5627033","0.5625671","0.562472","0.56181896","0.5618089","0.5600421","0.5585819","0.5580983","0.55751526","0.5561195","0.55555034"],"string":"[\n \"0.7000699\",\n \"0.67986435\",\n \"0.6459541\",\n \"0.6312645\",\n \"0.61937106\",\n \"0.6171836\",\n \"0.615392\",\n \"0.6140465\",\n \"0.61130303\",\n \"0.60600764\",\n \"0.59495264\",\n \"0.5948369\",\n \"0.5947296\",\n \"0.5940576\",\n \"0.59120387\",\n \"0.59089774\",\n \"0.5895668\",\n \"0.58923846\",\n \"0.58919656\",\n \"0.58830136\",\n \"0.58829343\",\n \"0.58770293\",\n \"0.58736074\",\n \"0.5855019\",\n \"0.58477247\",\n \"0.58408934\",\n \"0.5818353\",\n \"0.5811792\",\n \"0.5811792\",\n \"0.5808128\",\n \"0.5808128\",\n \"0.5800015\",\n \"0.57869196\",\n \"0.57847804\",\n \"0.5783371\",\n \"0.57695687\",\n \"0.576113\",\n \"0.5755081\",\n \"0.57480407\",\n \"0.57340515\",\n \"0.57300806\",\n \"0.57207644\",\n \"0.57090056\",\n \"0.57054883\",\n \"0.57040375\",\n \"0.5668319\",\n \"0.56625825\",\n \"0.5647044\",\n \"0.5640584\",\n \"0.564045\",\n \"0.564027\",\n \"0.5638977\",\n \"0.56372166\",\n \"0.56358784\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5634058\",\n \"0.5631929\",\n \"0.5628087\",\n \"0.5627616\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5627033\",\n \"0.5625671\",\n \"0.562472\",\n \"0.56181896\",\n \"0.5618089\",\n \"0.5600421\",\n \"0.5585819\",\n \"0.5580983\",\n \"0.55751526\",\n \"0.5561195\",\n \"0.55555034\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94772,"cells":{"query":{"kind":"string","value":"Check if the condition has been met. We need to make sure that we are of the correct type."},"document":{"kind":"string","value":"def _check_valid_condition(self, get_params):\n try:\n variable = get_params(self.variable)\n except: # noqa e722\n variable = None\n value = self.value\n\n # if None, return oppositely\n if variable is None:\n return not self.default\n\n # convert the value to a correct type\n if isinstance(variable, bool):\n value = bool(self.value)\n elif isinstance(variable, Number):\n try:\n value = int(self.value)\n except: # noqa e722\n try:\n value = float(self.value)\n except: # noqa e722\n # could not parse\n return not self.default\n\n # compare and return the result\n if self.condition == \"=\":\n return (variable == value) == self.default\n elif self.condition == \">\":\n return (variable > value) == self.default\n elif self.condition == \"<\":\n return (variable < value) == self.default"},"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 condition(self):\n return True","def check_condition(self):\n\n\t\traw_context = {\n\t\t\t'folk': self.folk\n\t\t}\n\n\t\tstatus, param = self.execute(self.mission_grid, 'condition', self.pending_mission.kingdom, raw_context)\n\t\treturn status","def check_condition(self, comment):\n if comment.id in self.touched_comment_ids:\n return False, None\n # First check for keywords in comment, for now we don't care about formatting after the keyword\n has_keyword = self.check_word_in_list_in_string(self.keywords, comment.body)\n if not has_keyword:\n return False, None\n # Next we check if we have states or abbreviations\n abbrevs = self.check_comment_for_dictionary_keys_and_values(comment, self.states)\n if len(abbrevs) < 1:\n return False, None\n if str(comment.author) == self.bot_name:\n return False, None\n for reply in comment.replies:\n if str(reply.author) == self.bot_name:\n return False, None\n\n return True, abbrevs","def _truth_value(self, condition):\n if condition:\n return 'true stuff'\n else:\n return 'false stuff'","def _truth_value(self, condition):\n if condition:\n return 'true stuff'\n else:\n return 'false stuff'","def check(self):\n\n return self.variable.check(self.cval, self.conditional)","def conditional(self) -> global___Statement.Conditional:","def meets_condition(db_type: str):\n\t\t...","def condition_forward_checking(csp, var) :\n return False","def condition_forward_checking(csp, var) :\n return False","def check(self):\n return True","def check(self):\n raise NotImplementedError","def check(self, runtime):\n return True","def condition(self, device, log):\n return True","def isConditional(self) -> bool:\n ...","def CheckType(self, *args, **kwargs):\n pass","def check(self):\n pass","def check(self):\n pass","def check(self):\n pass","def check(self):\n pass","def check(self) -> None:\n\n raise NotImplementedError","def _check(self, token_type):\n if self._is_at_end():\n return False\n\n return self._peek().token_type == token_type","def check(self):\n\n if not self.target.ok():\n return False\n\n if not self.progid.ok():\n return False\n\n if not self.prinapp.ok():\n return False\n\n if not self.observers.ok():\n return False\n\n return True","def condition(self) -> global___Expression:","def condition(self) -> global___Expression:","def conditionPassed(self):\n result = Activatable(self.effects, condition=AlwaysTrueCondition()).canActivate(self.game)\n self.assertTrue(result, \"The Activatable should be activatable\")","def passed(self):\n return self.is_executed and self.is_executed_ok and self.is_equal_result","def check(self, value):\n raise NotImplementedError","def check(self):\n raise NotImplementedError('Must be implemented by subclass.')","def is_satisfied(self, item: Any) -> bool:","def ready_to_proceed(self):\n if self.current_step is None or self.step_position == StepPosition.Before:\n return False\n\n for condition, _ in self.current_step.conditions:\n if condition.satisfied():\n return True\n return False","def checkType(self, value):\n pass","def match_condition(self, event_type, rule):\n logger.debug(\"Matching rule conditions\")\n rule_event_type = rule['trigger']['event']\n \n if event_type == rule_event_type:\n logger.debug(\"Matching rule conditions: type MATCHED\")\n # Hm, might be worth adding perms, owner, status?\n return True\n return False","def _check(self, class_):\r\n\r\n if isinstance(class_, (types.FunctionType, types.LambdaType,\r\n types.ClassType, types.InstanceType)):\r\n return False\r\n if not hasattr(class_, '__dict__'):\r\n if not hasattr(class_, '__slots__'):\r\n return False\r\n return True","def check(self) -> None:","def decision(self) -> bool:\n\n while True:\n # Get's user input, makes all charactures lowercase, and removes any whitespace\n decision = input('Enter \"hit\" or \"stay\". \\n').lower().strip()\n\n if decision == 'hit' or decision == 'stay':\n return decision == 'hit'\n else:\n # Humans can be dumb. Doesn't break the while loop\n print('\\nYou must type \"hit\" or \"stay\".')","def _check_value_type(self, value):\n if value is not None and self.value_type is not None:\n valid = isinstance(value, self.value_type)\n if not valid:\n return False\n return True","def check(self, node):\n # do the necessary setup/arguments and call self.visit (node, args)\n self.visit(node, defined=set())","def self_check(self):\r\n \r\n try:\r\n #tries to get a value from each sensor\r\n \r\n sensor_1_value = self.sen.get_sensor_value()\r\n\r\n # checks if the value is a float else rase exception\r\n\r\n if type(sensor_1_value) != float:\r\n raise Exception()\r\n\r\n #if the sensors dont return a value or is in the wrong type\r\n #the code will fail before here and get caught by the catch.\r\n #otherwise its sets the pass or fail condition to true\r\n \r\n pass_or_fail = True\r\n \r\n\r\n except:\r\n #if the self check fails then it sets the pass or fail\r\n #condition to false\r\n \r\n pass_or_fail = False\r\n \r\n \r\n return(pass_or_fail)","def select(condition: Union[Callable, int], meta: Counter) -> bool:\n if condition is None:\n return True\n elif isinstance(condition, int):\n return sum(meta.values()) == condition\n elif callable(condition):\n if not isinstance(condition(meta), bool):\n raise TypeError('selection condition expected to return a boolean')\n return condition(meta)\n return False","def check(steps: Steps, error_message: str, condition) -> bool:\n if steps:\n step = steps.get_last_step()\n if not callable(condition):\n raise ValueError(\"The 'condition' argument \"\n \"must be a callable object\")\n else:\n if not condition():\n raise ValueError(error_message)\n else:\n step.set_status(Status.PASSED)\n return True\n\n return False","def check(self, value: Any) -> None:\n if not isinstance(value, self.oktype):\n raise TypeError(value)","def check_condition(self, element):\n conditional = element.getAttribute(\"conditional\")\n\n # No condition, then we execute this statement.\n #\n if len(conditional) == 0:\n return True\n\n # We have a conditional. See if it begins with a '!', which inverts\n # our test.\n #\n result = True\n oc = conditional\n if conditional[0] == '!':\n result = False\n conditional = conditional[1:]\n\n if self.settings is not None and conditional in self.settings.ids:\n if self.settings.value(conditional) is True:\n return result\n return not result\n return not result","def check():","def _if(self):\n debug.show(\"if:Stack = \" + str(self.opStack))\n if self.opStack.size() >= 2:\n ifcode = isCode(self.opStack.pop()) # Make sure it is code (a list)\n if check.isBool(self.opStack.pop()):\n debug.show(\"if:True\")\n evaluate(ifcode)\n else:\n debug.err(\"not enough items on the stack\")\n debug.show(\"if:False\")\n return None","def check(self,):\n self.is_valid_according_policy()","def test_empty_condition(self):\n assert_that(Condition.is_valid(''), equal_to(True))","def condition_check(self, tic, condition1=100, condition2=10, condition3=10, earned_animation_duration=1,\r\n defense_duration_mean=30,\r\n defense_duration_sd=5):\r\n if self.counters['1'] == condition1: # changed: added provoked negation from fulfilling any condition\r\n self.provoked = 0\r\n self.provoked_timer = 0\r\n self.points += 1\r\n self.earned_point_animation_timer = earned_animation_duration\r\n self.counters['1'] = 0\r\n if self.counters['2'] == condition2:\r\n self.provoked = 0\r\n self.provoked_timer = 0\r\n self.stole_point = 1\r\n self.counters['2'] = 0\r\n if self.counters['3'] == condition3: # changed\r\n self.provoked = 0\r\n self.provoked_timer = 0\r\n block_value = abs(np.random.normal(defense_duration_mean, defense_duration_sd, 1))\r\n self.defense_blocks = np.append(self.defense_blocks, block_value)\r\n self.defense_blocks_data = np.append(self.defense_blocks_data, block_value)\r\n self.counters['3'] = 0","def satisfied(self, tailValue, headValue):\n return False","def applies(self, *args, **kwargs) -> bool:\n return self.__guard is None or self.__guard(*args, **kwargs)","def ok(self) -> bool:\n return self._exc_type is None","def verify_type(self, obj):\n return isinstance(obj, self.type_)","def is_waitable(self):\n return self._condition is not None","def check(self, data):# ->bool:\r\n return check(self.gd, data)","def checkGoal(self):\n # -- It is not included for simplifity --#\n if self.reward_cumulative != None:\n x = round((abs(self.reward_cumulative) - abs(round(self.reward_cumulative))) * 100);\n rem_goal = x % 25\n rem_timeout = x % 20\n if rem_goal == 0 and x != 0:\n self.is_goal = True\n else:\n self.is_goal = False\n\n if rem_timeout == 0 and x != 0:\n self.is_timeout = True\n else:\n self.is_timeout = False","def check_type(self):\n return True","def check(self):\n\n try:\n if self.compare == \"eq\":\n return self._varstate == self.transform(self.compval)\n if self.compare == \"ne\":\n return self._varstate != self.transform(self.compval)\n if self.compare == \"in\":\n return self._varstate in [self.transform(x) for x in self.compval.split(\",\")]\n if self.compare == \"not in\":\n return self._varstate not in [self.transform(x) for x in self.compval.split(\",\")]\n if self.compare == \"gt\":\n return self._varstate > self.transform(self.compval)\n if self.compare == \"ge\":\n return self._varstate >= self.transform(self.compval)\n if self.compare == \"lt\":\n return self._varstate < self.transform(self.compval)\n if self.compare == \"le\":\n return self._varstate <= self.transform(self.compval)\n return False\n except Exception as e:\n emsg = \"Error: Counter variable {} : Comparison failed with value \\\"{}\\\".\\nTrace: {}\".format(\n self.name, val, e.__traceback__)\n self.sending({\"subject\": self.target,\n \"content_type\": \"event\",\n \"content\": {\"event\": \"error report\",\n \"target\": self.type + \".state variable\",\n \"value\": emsg}})\n\n return False","def sanity_check(self):\n res = True\n res = res and self.detected\n res = res and np.sum(self.diffs) < 30000 # experimental value\n return res","def IsOk(self):\r\n \r\n return True","def ok(self) -> bool:\n # pylint:disable=invalid-name\n raise NotImplementedError # pragma: no cover","def does_match(self, situation: Perception) -> bool:\n return self.condition.does_match(situation)","def _alert_condition(self, soup: BeautifulSoup) -> bool:\n raise NotImplementedError()","def Assert(condition):\n try:\n assert TestStepsTools.Eval(condition)\n except AssertionError:\n _LOGGER.error('Condition %s is not True', condition)\n raise\n\n return True","def check_criteria(self, _sender, **msg):\n msg = msg['iter_msg']\n if len(_sender.performance_history) == _sender.patience:\n # Value / threshold based methods:\n # Check the latest value of the performance history against a\n # threshold calculated based on the performance history\n msg.should_stop = \\\n check_should_stop(\n mode=_sender.mode,\n performance_history=_sender.performance_history)","def __bool__(self):\n return self.isValid()","def hit(self):\n hit = self.delegate.checkHit(100, 0, self.environment)\n assert hit, \"Should always hit\"","def check_validity(self):\n try:\n if self.type == ConstraintTypes.EQUAL:\n enforce(\n isinstance(self.value, (int, float, str, bool)),\n f\"Expected one of type in (int, float, str, bool), got {self.value}\",\n )\n elif self.type == ConstraintTypes.NOT_EQUAL:\n enforce(\n isinstance(self.value, (int, float, str, bool)),\n f\"Expected one of type in (int, float, str, bool), got {self.value}\",\n )\n elif self.type == ConstraintTypes.LESS_THAN:\n enforce(\n isinstance(self.value, (int, float, str)),\n f\"Expected one of type in (int, float, str), got {self.value}\",\n )\n elif self.type == ConstraintTypes.LESS_THAN_EQ:\n enforce(\n isinstance(self.value, (int, float, str)),\n f\"Expected one of type in (int, float, str), got {self.value}\",\n )\n elif self.type == ConstraintTypes.GREATER_THAN:\n enforce(\n isinstance(self.value, (int, float, str)),\n f\"Expected one of type in (int, float, str), got {self.value}\",\n )\n elif self.type == ConstraintTypes.GREATER_THAN_EQ:\n enforce(\n isinstance(self.value, (int, float, str)),\n f\"Expected one of type in (int, float, str), got {self.value}\",\n )\n elif self.type == ConstraintTypes.WITHIN:\n enforce(\n isinstance(self.value, (list, tuple)),\n f\"Expected one of type in (list, tuple), got {self.value}\",\n )\n enforce(\n len(self.value) == 2, f\"Expected length=2, got {len(self.value)}\"\n )\n enforce(\n isinstance(self.value[0], type(self.value[1])), \"Invalid types.\"\n )\n enforce(\n isinstance(self.value[1], type(self.value[0])), \"Invalid types.\"\n )\n elif self.type == ConstraintTypes.IN:\n enforce(\n isinstance(self.value, (list, tuple, set)),\n f\"Expected one of type in (list, tuple, set), got {self.value}\",\n )\n if len(self.value) > 0:\n _type = type(next(iter(self.value)))\n enforce(\n all(isinstance(obj, _type) for obj in self.value),\n \"Invalid types.\",\n )\n elif self.type == ConstraintTypes.NOT_IN:\n enforce(\n isinstance(self.value, (list, tuple, set)),\n f\"Expected one of type in (list, tuple, set), got {self.value}\",\n )\n if len(self.value) > 0:\n _type = type(next(iter(self.value)))\n enforce(\n all(isinstance(obj, _type) for obj in self.value),\n \"Invalid types.\",\n )\n elif self.type == ConstraintTypes.DISTANCE:\n enforce(\n isinstance(self.value, (list, tuple)),\n f\"Expected one of type in (list, tuple), got {self.value}\",\n )\n enforce(\n len(self.value) == 2, f\"Expected length=2, got {len(self.value)}\"\n )\n enforce(\n isinstance(self.value[0], Location),\n \"Invalid type, expected Location.\",\n )\n enforce(\n isinstance(self.value[1], float), \"Invalid type, expected Location.\"\n )\n else: # pragma: nocover\n raise ValueError(\"Type not recognized.\")\n except ValueError:\n return False # pragma: nocover\n\n return True","def test_variable(self, condition, undefined_paths, current_path):\n var = str(condition.find('name').text)\n if not var in self.variables.get_keys() and self.fail_on_undefined_vars:\n current_path += ((var, 'undefined variable'),)\n undefined_paths.add(current_path)\n return False\n else:\n return True","def is_arbitrary(self):\n return 'conditions' not in type(self)._fields","def verify(condition):\n global _is_in_verify_within\n if not condition:\n calling_frame = inspect.currentframe().f_back\n error_message = 'verify() failed at line {} in \"{}\"'.format(calling_frame.f_lineno,\n calling_frame.f_code.co_filename)\n if not _is_in_verify_within:\n print error_message\n return False\n return True","def _check_value(self, value):\n raise NotImplementedError","def perform(self):\n if self.format_and_eval_string(self.condition):\n raise ContinueException()","def testConditionChecking(self):\n\n state = State.from_problem(self.prob)\n \n drive = self.dom.get_action(\"drive\")\n with drive.instantiate([\"agent\", \"tru1\", \"apt1\"], self.prob):\n self.assert_(state.is_satisfied(drive.precondition))\n\n with drive.instantiate([\"agent\", \"tru1\", \"apt2\"], self.prob):\n self.assertFalse(state.is_satisfied(drive.precondition))","def check(self,item):\r\n raise AbstractError\r\n return False","def _check(self):\n assert isinstance(self._price, int)\n assert self._price >= 0\n assert isinstance(self._units, int)\n assert self._units > 0\n assert self._side == OrderSide.BUY or self._side == OrderSide.SELL\n assert self._type == OrderType.LIMIT or self._type == OrderType.CANCEL\n assert isinstance(self._market, int)\n assert self._market > 0","def __bool__(self):\n return not(self.outcome != 0 or self.filled)","def check_event_status(self):\n pass","def check(self, answer):\n return self.answer == answer","async def should_handle(self):\n local_controller = self.controller\n cavern = local_controller.caverns\n if local_controller.hives and not cavern:\n return False\n if not local_controller.can_train(HYDRALISK, local_controller.hydradens.ready):\n return False\n if local_controller.pits.ready and not local_controller.hives and not await BuildHive.morphing_lairs(self):\n return False\n if cavern.ready:\n return len(local_controller.ultralisks) * 2.75 > len(local_controller.hydras)\n return not local_controller.floating_buildings_bm","def is_met(self, *args, **kwargs):\n today = timezone.now().date()\n if self.day == today.day and (not self.last_executed or self.last_executed.date() != today):\n return True\n\n return False","def check(self, description: Description) -> bool:","def check_condition(self, query_dict):\n return all(key in self.__data and self.__data[key] == value\n for key, value in query_dict.items())","def is_satisfied_by(self, val):","def _check(self, event):\n\n if self._type is None:\n if isinstance(event, Event):\n self._type = Event\n elif isinstance(event, TimeRangeEvent):\n self._type = TimeRangeEvent\n elif isinstance(event, IndexedEvent):\n self._type = IndexedEvent\n else:\n if not isinstance(event, self._type):\n raise PipelineIOException('Homogeneous events expected')","def run_precondition(self) -> bool:\n return self._does_apply","def run_checks(self, tile_model: TileModel) -> bool:\n\n # Doge cannot fire the deck gun\n if self.player.role == PlayerRoleEnum.DOGE:\n return False\n\n if not self.player == GameStateModel.instance().players_turn:\n return False\n\n ap_deduct = 2 if self.player.role == PlayerRoleEnum.DRIVER else 4\n\n if not TurnEvent.has_required_AP(self.player.ap, ap_deduct):\n return False\n\n # If the player is not located in the\n # same space as the engine, they cannot\n # fire the deck gun.\n engine_orient = self.engine.orientation\n if engine_orient == VehicleOrientationEnum.HORIZONTAL:\n on_first_spot = self.player.row == self.engine.row and self.player.column == self.engine.column\n on_second_spot = self.player.row == self.engine.row and self.player.column == self.engine.column + 1\n if not on_first_spot and not on_second_spot:\n return False\n\n elif engine_orient == VehicleOrientationEnum.VERTICAL:\n on_first_spot = self.player.row == self.engine.row and self.player.column == self.engine.column\n on_second_spot = self.player.row == self.engine.row + 1 and self.player.column == self.engine.column\n if not on_first_spot and not on_second_spot:\n return False\n\n engine_quadrant = self._determine_quadrant(self.engine.row, self.engine.column)\n tile_input_quadrant = self._determine_quadrant(tile_model.row, tile_model.column)\n # If there are players present in the\n # quadrant, the deck gun cannot be fired.\n # tile input gotta be on quadrant adjacent to engine\n if self._are_players_in_quadrant(engine_quadrant) or tile_input_quadrant != engine_quadrant:\n return False\n\n return True","def isUnConditional(self) -> bool:\n ...","def check_status(self):","def check(self, val, compare=\"eq\"):\n try:\n if compare == \"eq\":\n return len(self.entities) == int(val)\n if compare == \"ne\":\n return len(self.entities) != int(val)\n if compare == \"in\":\n return val in self.entities\n if compare == \"not in\":\n return val not in self.entities\n if compare == \"gt\":\n return len(self.entities) > int(val)\n if compare == \"ge\":\n return len(self.entities) >= int(val)\n if compare == \"lt\":\n return len(self.entities) < int(val)\n if compare == \"le\":\n return len(self.entities) <= int(val)\n if compare == \"first in\": # trigger comparator\n return len(self.entities) == 1 and self.lastone in self.entities\n if compare == \"last out\": # trigger comparator\n return len(self.entities) == 0 and val == self.lastone\n if compare == \"got in\": # trigger comparator\n return val == self.lastone and self.lastone in self.entities\n if compare == \"got out\": # trigger comparator\n return val == self.lastone and self.lastone not in self.entities\n if compare == \"frozen\":\n return self.frozen\n if compare == \"not frozen\":\n return not self.frozen\n\n return False\n except Exception as e:\n emsg = \"Error: State variable {} : Tracker compares the number of tracked entities. Comparison value ({}) must be an integer.\\nTrace: {}\".format(\n self.name, val, e.__traceback__)\n self.sending({\"subject\": self.target,\n \"content_type\": \"event\",\n \"content\": {\"event\": \"error report\",\n \"target\": self.type + \".state variable\",\n \"value\": emsg}})\n\n return False","def test_has_exactly_type():\r\n\r\n return has_exactly_type(1, int) and not has_exactly_type(True, int) and has_exactly_type(True, bool)","def check_event_type(self, cond, center_cont=True, norm_cont=True):\n cond_mask = (self.event_table[:, 1] == cond)\n heights = self.event_table[cond_mask, 4].astype(float)\n if set(np.unique(heights)) <= {1., 0.}:\n event_type = 'dummy'\n else:\n event_type = 'continuous'\n if center_cont:\n heights -= np.mean(heights)\n if norm_cont:\n heights /= np.std(heights)\n self.event_table[cond_mask, 4] = heights\n return event_type","def _check_feedback_func(self, assessment_type):\r\n if assessment_type == 'ai':\r\n section_name = 'AI-Assessed'\r\n elif assessment_type == 'peer':\r\n section_name = self.peer_problem_name\r\n else:\r\n raise ValueError('Assessment type not recognized. Must be either \"ai\" or \"peer\"')\r\n\r\n def _inner_check():\r\n self.course_nav.go_to_sequential('Self-Assessed')\r\n self.course_nav.go_to_sequential(section_name)\r\n\r\n try:\r\n feedback = self.open_response.rubric.feedback\r\n\r\n # Unsuccessful if the rubric hasn't loaded\r\n except BrokenPromise:\r\n return False, None\r\n\r\n # Successful if `feedback` is a non-empty list\r\n else:\r\n return bool(feedback), feedback\r\n\r\n return _inner_check","def check_state(self):\n pass","def _should_run_now(self):\n # Assumes the unit/all values will have values.\n if not len(self._device_values.keys()) > 0:\n return False\n return not len(self._needed_devices) > 0","def conditions():\n pass","def available(self):\n return self.value_type in self._values","def _check_pert(self, **kwargs):\n conditions = {\n 'mode >= low' : kwargs['mode'] >= kwargs['low'],\n 'high >= mode' : kwargs['high'] >= kwargs['mode'],\n }\n for condition_name, condition_value in conditions.items():\n if condition_value == False:\n err = 'Param \"{}\" fails PERT requirement \"{}\".'.format(kwargs, condition_name)\n raise FairException(err)","def should_execute(self, context: dict) -> bool:\n\n print(f'Checking snippet: {self.name}')\n\n if 'when' not in self.metadata:\n # always execute when no when conditional is present\n print(f'No conditional present, proceeding with skillet: {self.name}')\n return True\n\n when = self.metadata['when']\n when_str = '{{%- if {0} -%}} True {{%- else -%}} False {{%- endif -%}}'.format(when)\n when_template = self._env.from_string(when_str)\n results = when_template.render(context)\n print(f' Conditional Evaluation results: {results} ')\n if str(results).strip() == 'True':\n return True\n else:\n return False","def check_value(self, value):","def is_met(self, *args, **kwargs):\n today = timezone.now().date()\n if self.weekday == today.isoweekday() and (not self.last_executed or self.last_executed.date() != today):\n return True\n\n return False"],"string":"[\n \"def condition(self):\\n return True\",\n \"def check_condition(self):\\n\\n\\t\\traw_context = {\\n\\t\\t\\t'folk': self.folk\\n\\t\\t}\\n\\n\\t\\tstatus, param = self.execute(self.mission_grid, 'condition', self.pending_mission.kingdom, raw_context)\\n\\t\\treturn status\",\n \"def check_condition(self, comment):\\n if comment.id in self.touched_comment_ids:\\n return False, None\\n # First check for keywords in comment, for now we don't care about formatting after the keyword\\n has_keyword = self.check_word_in_list_in_string(self.keywords, comment.body)\\n if not has_keyword:\\n return False, None\\n # Next we check if we have states or abbreviations\\n abbrevs = self.check_comment_for_dictionary_keys_and_values(comment, self.states)\\n if len(abbrevs) < 1:\\n return False, None\\n if str(comment.author) == self.bot_name:\\n return False, None\\n for reply in comment.replies:\\n if str(reply.author) == self.bot_name:\\n return False, None\\n\\n return True, abbrevs\",\n \"def _truth_value(self, condition):\\n if condition:\\n return 'true stuff'\\n else:\\n return 'false stuff'\",\n \"def _truth_value(self, condition):\\n if condition:\\n return 'true stuff'\\n else:\\n return 'false stuff'\",\n \"def check(self):\\n\\n return self.variable.check(self.cval, self.conditional)\",\n \"def conditional(self) -> global___Statement.Conditional:\",\n \"def meets_condition(db_type: str):\\n\\t\\t...\",\n \"def condition_forward_checking(csp, var) :\\n return False\",\n \"def condition_forward_checking(csp, var) :\\n return False\",\n \"def check(self):\\n return True\",\n \"def check(self):\\n raise NotImplementedError\",\n \"def check(self, runtime):\\n return True\",\n \"def condition(self, device, log):\\n return True\",\n \"def isConditional(self) -> bool:\\n ...\",\n \"def CheckType(self, *args, **kwargs):\\n pass\",\n \"def check(self):\\n pass\",\n \"def check(self):\\n pass\",\n \"def check(self):\\n pass\",\n \"def check(self):\\n pass\",\n \"def check(self) -> None:\\n\\n raise NotImplementedError\",\n \"def _check(self, token_type):\\n if self._is_at_end():\\n return False\\n\\n return self._peek().token_type == token_type\",\n \"def check(self):\\n\\n if not self.target.ok():\\n return False\\n\\n if not self.progid.ok():\\n return False\\n\\n if not self.prinapp.ok():\\n return False\\n\\n if not self.observers.ok():\\n return False\\n\\n return True\",\n \"def condition(self) -> global___Expression:\",\n \"def condition(self) -> global___Expression:\",\n \"def conditionPassed(self):\\n result = Activatable(self.effects, condition=AlwaysTrueCondition()).canActivate(self.game)\\n self.assertTrue(result, \\\"The Activatable should be activatable\\\")\",\n \"def passed(self):\\n return self.is_executed and self.is_executed_ok and self.is_equal_result\",\n \"def check(self, value):\\n raise NotImplementedError\",\n \"def check(self):\\n raise NotImplementedError('Must be implemented by subclass.')\",\n \"def is_satisfied(self, item: Any) -> bool:\",\n \"def ready_to_proceed(self):\\n if self.current_step is None or self.step_position == StepPosition.Before:\\n return False\\n\\n for condition, _ in self.current_step.conditions:\\n if condition.satisfied():\\n return True\\n return False\",\n \"def checkType(self, value):\\n pass\",\n \"def match_condition(self, event_type, rule):\\n logger.debug(\\\"Matching rule conditions\\\")\\n rule_event_type = rule['trigger']['event']\\n \\n if event_type == rule_event_type:\\n logger.debug(\\\"Matching rule conditions: type MATCHED\\\")\\n # Hm, might be worth adding perms, owner, status?\\n return True\\n return False\",\n \"def _check(self, class_):\\r\\n\\r\\n if isinstance(class_, (types.FunctionType, types.LambdaType,\\r\\n types.ClassType, types.InstanceType)):\\r\\n return False\\r\\n if not hasattr(class_, '__dict__'):\\r\\n if not hasattr(class_, '__slots__'):\\r\\n return False\\r\\n return True\",\n \"def check(self) -> None:\",\n \"def decision(self) -> bool:\\n\\n while True:\\n # Get's user input, makes all charactures lowercase, and removes any whitespace\\n decision = input('Enter \\\"hit\\\" or \\\"stay\\\". \\\\n').lower().strip()\\n\\n if decision == 'hit' or decision == 'stay':\\n return decision == 'hit'\\n else:\\n # Humans can be dumb. Doesn't break the while loop\\n print('\\\\nYou must type \\\"hit\\\" or \\\"stay\\\".')\",\n \"def _check_value_type(self, value):\\n if value is not None and self.value_type is not None:\\n valid = isinstance(value, self.value_type)\\n if not valid:\\n return False\\n return True\",\n \"def check(self, node):\\n # do the necessary setup/arguments and call self.visit (node, args)\\n self.visit(node, defined=set())\",\n \"def self_check(self):\\r\\n \\r\\n try:\\r\\n #tries to get a value from each sensor\\r\\n \\r\\n sensor_1_value = self.sen.get_sensor_value()\\r\\n\\r\\n # checks if the value is a float else rase exception\\r\\n\\r\\n if type(sensor_1_value) != float:\\r\\n raise Exception()\\r\\n\\r\\n #if the sensors dont return a value or is in the wrong type\\r\\n #the code will fail before here and get caught by the catch.\\r\\n #otherwise its sets the pass or fail condition to true\\r\\n \\r\\n pass_or_fail = True\\r\\n \\r\\n\\r\\n except:\\r\\n #if the self check fails then it sets the pass or fail\\r\\n #condition to false\\r\\n \\r\\n pass_or_fail = False\\r\\n \\r\\n \\r\\n return(pass_or_fail)\",\n \"def select(condition: Union[Callable, int], meta: Counter) -> bool:\\n if condition is None:\\n return True\\n elif isinstance(condition, int):\\n return sum(meta.values()) == condition\\n elif callable(condition):\\n if not isinstance(condition(meta), bool):\\n raise TypeError('selection condition expected to return a boolean')\\n return condition(meta)\\n return False\",\n \"def check(steps: Steps, error_message: str, condition) -> bool:\\n if steps:\\n step = steps.get_last_step()\\n if not callable(condition):\\n raise ValueError(\\\"The 'condition' argument \\\"\\n \\\"must be a callable object\\\")\\n else:\\n if not condition():\\n raise ValueError(error_message)\\n else:\\n step.set_status(Status.PASSED)\\n return True\\n\\n return False\",\n \"def check(self, value: Any) -> None:\\n if not isinstance(value, self.oktype):\\n raise TypeError(value)\",\n \"def check_condition(self, element):\\n conditional = element.getAttribute(\\\"conditional\\\")\\n\\n # No condition, then we execute this statement.\\n #\\n if len(conditional) == 0:\\n return True\\n\\n # We have a conditional. See if it begins with a '!', which inverts\\n # our test.\\n #\\n result = True\\n oc = conditional\\n if conditional[0] == '!':\\n result = False\\n conditional = conditional[1:]\\n\\n if self.settings is not None and conditional in self.settings.ids:\\n if self.settings.value(conditional) is True:\\n return result\\n return not result\\n return not result\",\n \"def check():\",\n \"def _if(self):\\n debug.show(\\\"if:Stack = \\\" + str(self.opStack))\\n if self.opStack.size() >= 2:\\n ifcode = isCode(self.opStack.pop()) # Make sure it is code (a list)\\n if check.isBool(self.opStack.pop()):\\n debug.show(\\\"if:True\\\")\\n evaluate(ifcode)\\n else:\\n debug.err(\\\"not enough items on the stack\\\")\\n debug.show(\\\"if:False\\\")\\n return None\",\n \"def check(self,):\\n self.is_valid_according_policy()\",\n \"def test_empty_condition(self):\\n assert_that(Condition.is_valid(''), equal_to(True))\",\n \"def condition_check(self, tic, condition1=100, condition2=10, condition3=10, earned_animation_duration=1,\\r\\n defense_duration_mean=30,\\r\\n defense_duration_sd=5):\\r\\n if self.counters['1'] == condition1: # changed: added provoked negation from fulfilling any condition\\r\\n self.provoked = 0\\r\\n self.provoked_timer = 0\\r\\n self.points += 1\\r\\n self.earned_point_animation_timer = earned_animation_duration\\r\\n self.counters['1'] = 0\\r\\n if self.counters['2'] == condition2:\\r\\n self.provoked = 0\\r\\n self.provoked_timer = 0\\r\\n self.stole_point = 1\\r\\n self.counters['2'] = 0\\r\\n if self.counters['3'] == condition3: # changed\\r\\n self.provoked = 0\\r\\n self.provoked_timer = 0\\r\\n block_value = abs(np.random.normal(defense_duration_mean, defense_duration_sd, 1))\\r\\n self.defense_blocks = np.append(self.defense_blocks, block_value)\\r\\n self.defense_blocks_data = np.append(self.defense_blocks_data, block_value)\\r\\n self.counters['3'] = 0\",\n \"def satisfied(self, tailValue, headValue):\\n return False\",\n \"def applies(self, *args, **kwargs) -> bool:\\n return self.__guard is None or self.__guard(*args, **kwargs)\",\n \"def ok(self) -> bool:\\n return self._exc_type is None\",\n \"def verify_type(self, obj):\\n return isinstance(obj, self.type_)\",\n \"def is_waitable(self):\\n return self._condition is not None\",\n \"def check(self, data):# ->bool:\\r\\n return check(self.gd, data)\",\n \"def checkGoal(self):\\n # -- It is not included for simplifity --#\\n if self.reward_cumulative != None:\\n x = round((abs(self.reward_cumulative) - abs(round(self.reward_cumulative))) * 100);\\n rem_goal = x % 25\\n rem_timeout = x % 20\\n if rem_goal == 0 and x != 0:\\n self.is_goal = True\\n else:\\n self.is_goal = False\\n\\n if rem_timeout == 0 and x != 0:\\n self.is_timeout = True\\n else:\\n self.is_timeout = False\",\n \"def check_type(self):\\n return True\",\n \"def check(self):\\n\\n try:\\n if self.compare == \\\"eq\\\":\\n return self._varstate == self.transform(self.compval)\\n if self.compare == \\\"ne\\\":\\n return self._varstate != self.transform(self.compval)\\n if self.compare == \\\"in\\\":\\n return self._varstate in [self.transform(x) for x in self.compval.split(\\\",\\\")]\\n if self.compare == \\\"not in\\\":\\n return self._varstate not in [self.transform(x) for x in self.compval.split(\\\",\\\")]\\n if self.compare == \\\"gt\\\":\\n return self._varstate > self.transform(self.compval)\\n if self.compare == \\\"ge\\\":\\n return self._varstate >= self.transform(self.compval)\\n if self.compare == \\\"lt\\\":\\n return self._varstate < self.transform(self.compval)\\n if self.compare == \\\"le\\\":\\n return self._varstate <= self.transform(self.compval)\\n return False\\n except Exception as e:\\n emsg = \\\"Error: Counter variable {} : Comparison failed with value \\\\\\\"{}\\\\\\\".\\\\nTrace: {}\\\".format(\\n self.name, val, e.__traceback__)\\n self.sending({\\\"subject\\\": self.target,\\n \\\"content_type\\\": \\\"event\\\",\\n \\\"content\\\": {\\\"event\\\": \\\"error report\\\",\\n \\\"target\\\": self.type + \\\".state variable\\\",\\n \\\"value\\\": emsg}})\\n\\n return False\",\n \"def sanity_check(self):\\n res = True\\n res = res and self.detected\\n res = res and np.sum(self.diffs) < 30000 # experimental value\\n return res\",\n \"def IsOk(self):\\r\\n \\r\\n return True\",\n \"def ok(self) -> bool:\\n # pylint:disable=invalid-name\\n raise NotImplementedError # pragma: no cover\",\n \"def does_match(self, situation: Perception) -> bool:\\n return self.condition.does_match(situation)\",\n \"def _alert_condition(self, soup: BeautifulSoup) -> bool:\\n raise NotImplementedError()\",\n \"def Assert(condition):\\n try:\\n assert TestStepsTools.Eval(condition)\\n except AssertionError:\\n _LOGGER.error('Condition %s is not True', condition)\\n raise\\n\\n return True\",\n \"def check_criteria(self, _sender, **msg):\\n msg = msg['iter_msg']\\n if len(_sender.performance_history) == _sender.patience:\\n # Value / threshold based methods:\\n # Check the latest value of the performance history against a\\n # threshold calculated based on the performance history\\n msg.should_stop = \\\\\\n check_should_stop(\\n mode=_sender.mode,\\n performance_history=_sender.performance_history)\",\n \"def __bool__(self):\\n return self.isValid()\",\n \"def hit(self):\\n hit = self.delegate.checkHit(100, 0, self.environment)\\n assert hit, \\\"Should always hit\\\"\",\n \"def check_validity(self):\\n try:\\n if self.type == ConstraintTypes.EQUAL:\\n enforce(\\n isinstance(self.value, (int, float, str, bool)),\\n f\\\"Expected one of type in (int, float, str, bool), got {self.value}\\\",\\n )\\n elif self.type == ConstraintTypes.NOT_EQUAL:\\n enforce(\\n isinstance(self.value, (int, float, str, bool)),\\n f\\\"Expected one of type in (int, float, str, bool), got {self.value}\\\",\\n )\\n elif self.type == ConstraintTypes.LESS_THAN:\\n enforce(\\n isinstance(self.value, (int, float, str)),\\n f\\\"Expected one of type in (int, float, str), got {self.value}\\\",\\n )\\n elif self.type == ConstraintTypes.LESS_THAN_EQ:\\n enforce(\\n isinstance(self.value, (int, float, str)),\\n f\\\"Expected one of type in (int, float, str), got {self.value}\\\",\\n )\\n elif self.type == ConstraintTypes.GREATER_THAN:\\n enforce(\\n isinstance(self.value, (int, float, str)),\\n f\\\"Expected one of type in (int, float, str), got {self.value}\\\",\\n )\\n elif self.type == ConstraintTypes.GREATER_THAN_EQ:\\n enforce(\\n isinstance(self.value, (int, float, str)),\\n f\\\"Expected one of type in (int, float, str), got {self.value}\\\",\\n )\\n elif self.type == ConstraintTypes.WITHIN:\\n enforce(\\n isinstance(self.value, (list, tuple)),\\n f\\\"Expected one of type in (list, tuple), got {self.value}\\\",\\n )\\n enforce(\\n len(self.value) == 2, f\\\"Expected length=2, got {len(self.value)}\\\"\\n )\\n enforce(\\n isinstance(self.value[0], type(self.value[1])), \\\"Invalid types.\\\"\\n )\\n enforce(\\n isinstance(self.value[1], type(self.value[0])), \\\"Invalid types.\\\"\\n )\\n elif self.type == ConstraintTypes.IN:\\n enforce(\\n isinstance(self.value, (list, tuple, set)),\\n f\\\"Expected one of type in (list, tuple, set), got {self.value}\\\",\\n )\\n if len(self.value) > 0:\\n _type = type(next(iter(self.value)))\\n enforce(\\n all(isinstance(obj, _type) for obj in self.value),\\n \\\"Invalid types.\\\",\\n )\\n elif self.type == ConstraintTypes.NOT_IN:\\n enforce(\\n isinstance(self.value, (list, tuple, set)),\\n f\\\"Expected one of type in (list, tuple, set), got {self.value}\\\",\\n )\\n if len(self.value) > 0:\\n _type = type(next(iter(self.value)))\\n enforce(\\n all(isinstance(obj, _type) for obj in self.value),\\n \\\"Invalid types.\\\",\\n )\\n elif self.type == ConstraintTypes.DISTANCE:\\n enforce(\\n isinstance(self.value, (list, tuple)),\\n f\\\"Expected one of type in (list, tuple), got {self.value}\\\",\\n )\\n enforce(\\n len(self.value) == 2, f\\\"Expected length=2, got {len(self.value)}\\\"\\n )\\n enforce(\\n isinstance(self.value[0], Location),\\n \\\"Invalid type, expected Location.\\\",\\n )\\n enforce(\\n isinstance(self.value[1], float), \\\"Invalid type, expected Location.\\\"\\n )\\n else: # pragma: nocover\\n raise ValueError(\\\"Type not recognized.\\\")\\n except ValueError:\\n return False # pragma: nocover\\n\\n return True\",\n \"def test_variable(self, condition, undefined_paths, current_path):\\n var = str(condition.find('name').text)\\n if not var in self.variables.get_keys() and self.fail_on_undefined_vars:\\n current_path += ((var, 'undefined variable'),)\\n undefined_paths.add(current_path)\\n return False\\n else:\\n return True\",\n \"def is_arbitrary(self):\\n return 'conditions' not in type(self)._fields\",\n \"def verify(condition):\\n global _is_in_verify_within\\n if not condition:\\n calling_frame = inspect.currentframe().f_back\\n error_message = 'verify() failed at line {} in \\\"{}\\\"'.format(calling_frame.f_lineno,\\n calling_frame.f_code.co_filename)\\n if not _is_in_verify_within:\\n print error_message\\n return False\\n return True\",\n \"def _check_value(self, value):\\n raise NotImplementedError\",\n \"def perform(self):\\n if self.format_and_eval_string(self.condition):\\n raise ContinueException()\",\n \"def testConditionChecking(self):\\n\\n state = State.from_problem(self.prob)\\n \\n drive = self.dom.get_action(\\\"drive\\\")\\n with drive.instantiate([\\\"agent\\\", \\\"tru1\\\", \\\"apt1\\\"], self.prob):\\n self.assert_(state.is_satisfied(drive.precondition))\\n\\n with drive.instantiate([\\\"agent\\\", \\\"tru1\\\", \\\"apt2\\\"], self.prob):\\n self.assertFalse(state.is_satisfied(drive.precondition))\",\n \"def check(self,item):\\r\\n raise AbstractError\\r\\n return False\",\n \"def _check(self):\\n assert isinstance(self._price, int)\\n assert self._price >= 0\\n assert isinstance(self._units, int)\\n assert self._units > 0\\n assert self._side == OrderSide.BUY or self._side == OrderSide.SELL\\n assert self._type == OrderType.LIMIT or self._type == OrderType.CANCEL\\n assert isinstance(self._market, int)\\n assert self._market > 0\",\n \"def __bool__(self):\\n return not(self.outcome != 0 or self.filled)\",\n \"def check_event_status(self):\\n pass\",\n \"def check(self, answer):\\n return self.answer == answer\",\n \"async def should_handle(self):\\n local_controller = self.controller\\n cavern = local_controller.caverns\\n if local_controller.hives and not cavern:\\n return False\\n if not local_controller.can_train(HYDRALISK, local_controller.hydradens.ready):\\n return False\\n if local_controller.pits.ready and not local_controller.hives and not await BuildHive.morphing_lairs(self):\\n return False\\n if cavern.ready:\\n return len(local_controller.ultralisks) * 2.75 > len(local_controller.hydras)\\n return not local_controller.floating_buildings_bm\",\n \"def is_met(self, *args, **kwargs):\\n today = timezone.now().date()\\n if self.day == today.day and (not self.last_executed or self.last_executed.date() != today):\\n return True\\n\\n return False\",\n \"def check(self, description: Description) -> bool:\",\n \"def check_condition(self, query_dict):\\n return all(key in self.__data and self.__data[key] == value\\n for key, value in query_dict.items())\",\n \"def is_satisfied_by(self, val):\",\n \"def _check(self, event):\\n\\n if self._type is None:\\n if isinstance(event, Event):\\n self._type = Event\\n elif isinstance(event, TimeRangeEvent):\\n self._type = TimeRangeEvent\\n elif isinstance(event, IndexedEvent):\\n self._type = IndexedEvent\\n else:\\n if not isinstance(event, self._type):\\n raise PipelineIOException('Homogeneous events expected')\",\n \"def run_precondition(self) -> bool:\\n return self._does_apply\",\n \"def run_checks(self, tile_model: TileModel) -> bool:\\n\\n # Doge cannot fire the deck gun\\n if self.player.role == PlayerRoleEnum.DOGE:\\n return False\\n\\n if not self.player == GameStateModel.instance().players_turn:\\n return False\\n\\n ap_deduct = 2 if self.player.role == PlayerRoleEnum.DRIVER else 4\\n\\n if not TurnEvent.has_required_AP(self.player.ap, ap_deduct):\\n return False\\n\\n # If the player is not located in the\\n # same space as the engine, they cannot\\n # fire the deck gun.\\n engine_orient = self.engine.orientation\\n if engine_orient == VehicleOrientationEnum.HORIZONTAL:\\n on_first_spot = self.player.row == self.engine.row and self.player.column == self.engine.column\\n on_second_spot = self.player.row == self.engine.row and self.player.column == self.engine.column + 1\\n if not on_first_spot and not on_second_spot:\\n return False\\n\\n elif engine_orient == VehicleOrientationEnum.VERTICAL:\\n on_first_spot = self.player.row == self.engine.row and self.player.column == self.engine.column\\n on_second_spot = self.player.row == self.engine.row + 1 and self.player.column == self.engine.column\\n if not on_first_spot and not on_second_spot:\\n return False\\n\\n engine_quadrant = self._determine_quadrant(self.engine.row, self.engine.column)\\n tile_input_quadrant = self._determine_quadrant(tile_model.row, tile_model.column)\\n # If there are players present in the\\n # quadrant, the deck gun cannot be fired.\\n # tile input gotta be on quadrant adjacent to engine\\n if self._are_players_in_quadrant(engine_quadrant) or tile_input_quadrant != engine_quadrant:\\n return False\\n\\n return True\",\n \"def isUnConditional(self) -> bool:\\n ...\",\n \"def check_status(self):\",\n \"def check(self, val, compare=\\\"eq\\\"):\\n try:\\n if compare == \\\"eq\\\":\\n return len(self.entities) == int(val)\\n if compare == \\\"ne\\\":\\n return len(self.entities) != int(val)\\n if compare == \\\"in\\\":\\n return val in self.entities\\n if compare == \\\"not in\\\":\\n return val not in self.entities\\n if compare == \\\"gt\\\":\\n return len(self.entities) > int(val)\\n if compare == \\\"ge\\\":\\n return len(self.entities) >= int(val)\\n if compare == \\\"lt\\\":\\n return len(self.entities) < int(val)\\n if compare == \\\"le\\\":\\n return len(self.entities) <= int(val)\\n if compare == \\\"first in\\\": # trigger comparator\\n return len(self.entities) == 1 and self.lastone in self.entities\\n if compare == \\\"last out\\\": # trigger comparator\\n return len(self.entities) == 0 and val == self.lastone\\n if compare == \\\"got in\\\": # trigger comparator\\n return val == self.lastone and self.lastone in self.entities\\n if compare == \\\"got out\\\": # trigger comparator\\n return val == self.lastone and self.lastone not in self.entities\\n if compare == \\\"frozen\\\":\\n return self.frozen\\n if compare == \\\"not frozen\\\":\\n return not self.frozen\\n\\n return False\\n except Exception as e:\\n emsg = \\\"Error: State variable {} : Tracker compares the number of tracked entities. Comparison value ({}) must be an integer.\\\\nTrace: {}\\\".format(\\n self.name, val, e.__traceback__)\\n self.sending({\\\"subject\\\": self.target,\\n \\\"content_type\\\": \\\"event\\\",\\n \\\"content\\\": {\\\"event\\\": \\\"error report\\\",\\n \\\"target\\\": self.type + \\\".state variable\\\",\\n \\\"value\\\": emsg}})\\n\\n return False\",\n \"def test_has_exactly_type():\\r\\n\\r\\n return has_exactly_type(1, int) and not has_exactly_type(True, int) and has_exactly_type(True, bool)\",\n \"def check_event_type(self, cond, center_cont=True, norm_cont=True):\\n cond_mask = (self.event_table[:, 1] == cond)\\n heights = self.event_table[cond_mask, 4].astype(float)\\n if set(np.unique(heights)) <= {1., 0.}:\\n event_type = 'dummy'\\n else:\\n event_type = 'continuous'\\n if center_cont:\\n heights -= np.mean(heights)\\n if norm_cont:\\n heights /= np.std(heights)\\n self.event_table[cond_mask, 4] = heights\\n return event_type\",\n \"def _check_feedback_func(self, assessment_type):\\r\\n if assessment_type == 'ai':\\r\\n section_name = 'AI-Assessed'\\r\\n elif assessment_type == 'peer':\\r\\n section_name = self.peer_problem_name\\r\\n else:\\r\\n raise ValueError('Assessment type not recognized. Must be either \\\"ai\\\" or \\\"peer\\\"')\\r\\n\\r\\n def _inner_check():\\r\\n self.course_nav.go_to_sequential('Self-Assessed')\\r\\n self.course_nav.go_to_sequential(section_name)\\r\\n\\r\\n try:\\r\\n feedback = self.open_response.rubric.feedback\\r\\n\\r\\n # Unsuccessful if the rubric hasn't loaded\\r\\n except BrokenPromise:\\r\\n return False, None\\r\\n\\r\\n # Successful if `feedback` is a non-empty list\\r\\n else:\\r\\n return bool(feedback), feedback\\r\\n\\r\\n return _inner_check\",\n \"def check_state(self):\\n pass\",\n \"def _should_run_now(self):\\n # Assumes the unit/all values will have values.\\n if not len(self._device_values.keys()) > 0:\\n return False\\n return not len(self._needed_devices) > 0\",\n \"def conditions():\\n pass\",\n \"def available(self):\\n return self.value_type in self._values\",\n \"def _check_pert(self, **kwargs):\\n conditions = {\\n 'mode >= low' : kwargs['mode'] >= kwargs['low'],\\n 'high >= mode' : kwargs['high'] >= kwargs['mode'],\\n }\\n for condition_name, condition_value in conditions.items():\\n if condition_value == False:\\n err = 'Param \\\"{}\\\" fails PERT requirement \\\"{}\\\".'.format(kwargs, condition_name)\\n raise FairException(err)\",\n \"def should_execute(self, context: dict) -> bool:\\n\\n print(f'Checking snippet: {self.name}')\\n\\n if 'when' not in self.metadata:\\n # always execute when no when conditional is present\\n print(f'No conditional present, proceeding with skillet: {self.name}')\\n return True\\n\\n when = self.metadata['when']\\n when_str = '{{%- if {0} -%}} True {{%- else -%}} False {{%- endif -%}}'.format(when)\\n when_template = self._env.from_string(when_str)\\n results = when_template.render(context)\\n print(f' Conditional Evaluation results: {results} ')\\n if str(results).strip() == 'True':\\n return True\\n else:\\n return False\",\n \"def check_value(self, value):\",\n \"def is_met(self, *args, **kwargs):\\n today = timezone.now().date()\\n if self.weekday == today.isoweekday() and (not self.last_executed or self.last_executed.date() != today):\\n return True\\n\\n return False\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.67982715","0.6380257","0.6109528","0.60492665","0.60492665","0.5985159","0.5962633","0.5921427","0.5918396","0.5918396","0.5901136","0.5835458","0.5809594","0.5807828","0.5793611","0.57830834","0.5774989","0.5774989","0.5774989","0.5774989","0.57692593","0.57667524","0.5766104","0.57485825","0.57485825","0.5740793","0.5722028","0.5713305","0.5710395","0.56870604","0.5674086","0.56343937","0.5633267","0.56101954","0.5608999","0.56048083","0.55792713","0.55721676","0.5566361","0.5534553","0.5533721","0.55245763","0.5522143","0.5515","0.5514821","0.549943","0.54739803","0.5461081","0.5458915","0.54354477","0.54265165","0.54241383","0.5420588","0.5415391","0.5413489","0.54111385","0.54081917","0.53978235","0.537918","0.5375732","0.53715295","0.53671056","0.5357238","0.53561413","0.5352969","0.53526676","0.53471136","0.53465766","0.5344842","0.5343896","0.53431594","0.5341947","0.5337501","0.53346014","0.5333632","0.5327375","0.5324745","0.5319971","0.5314797","0.5312537","0.5308442","0.5306019","0.53040946","0.5300428","0.5298351","0.5296963","0.52969253","0.52939093","0.52929574","0.5290867","0.528796","0.5279996","0.5279613","0.5277578","0.5274209","0.5272402","0.52685076","0.526639","0.526587","0.52631336"],"string":"[\n \"0.67982715\",\n \"0.6380257\",\n \"0.6109528\",\n \"0.60492665\",\n \"0.60492665\",\n \"0.5985159\",\n \"0.5962633\",\n \"0.5921427\",\n \"0.5918396\",\n \"0.5918396\",\n \"0.5901136\",\n \"0.5835458\",\n \"0.5809594\",\n \"0.5807828\",\n \"0.5793611\",\n \"0.57830834\",\n \"0.5774989\",\n \"0.5774989\",\n \"0.5774989\",\n \"0.5774989\",\n \"0.57692593\",\n \"0.57667524\",\n \"0.5766104\",\n \"0.57485825\",\n \"0.57485825\",\n \"0.5740793\",\n \"0.5722028\",\n \"0.5713305\",\n \"0.5710395\",\n \"0.56870604\",\n \"0.5674086\",\n \"0.56343937\",\n \"0.5633267\",\n \"0.56101954\",\n \"0.5608999\",\n \"0.56048083\",\n \"0.55792713\",\n \"0.55721676\",\n \"0.5566361\",\n \"0.5534553\",\n \"0.5533721\",\n \"0.55245763\",\n \"0.5522143\",\n \"0.5515\",\n \"0.5514821\",\n \"0.549943\",\n \"0.54739803\",\n \"0.5461081\",\n \"0.5458915\",\n \"0.54354477\",\n \"0.54265165\",\n \"0.54241383\",\n \"0.5420588\",\n \"0.5415391\",\n \"0.5413489\",\n \"0.54111385\",\n \"0.54081917\",\n \"0.53978235\",\n \"0.537918\",\n \"0.5375732\",\n \"0.53715295\",\n \"0.53671056\",\n \"0.5357238\",\n \"0.53561413\",\n \"0.5352969\",\n \"0.53526676\",\n \"0.53471136\",\n \"0.53465766\",\n \"0.5344842\",\n \"0.5343896\",\n \"0.53431594\",\n \"0.5341947\",\n \"0.5337501\",\n \"0.53346014\",\n \"0.5333632\",\n \"0.5327375\",\n \"0.5324745\",\n \"0.5319971\",\n \"0.5314797\",\n \"0.5312537\",\n \"0.5308442\",\n \"0.5306019\",\n \"0.53040946\",\n \"0.5300428\",\n \"0.5298351\",\n \"0.5296963\",\n \"0.52969253\",\n \"0.52939093\",\n \"0.52929574\",\n \"0.5290867\",\n \"0.528796\",\n \"0.5279996\",\n \"0.5279613\",\n \"0.5277578\",\n \"0.5274209\",\n \"0.5272402\",\n \"0.52685076\",\n \"0.526639\",\n \"0.526587\",\n \"0.52631336\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5867462"},"document_rank":{"kind":"string","value":"11"}}},{"rowIdx":94773,"cells":{"query":{"kind":"string","value":"Simple check that the variable is set"},"document":{"kind":"string","value":"def _check_valid_basic(self, get_params):\n try:\n if get_params(self.variable):\n return self.default\n except: # noqa e722\n pass\n return not self.default"},"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 has_value(var) :\n return var != None","def isSet(self) -> bool:\n ...","def has_assignment_for(self, var):\n return self.variable_to_value.get(var) != None","def _var_check(self):\n missing = set()\n for v in self.variables:\n if getattr(self, v) is None:\n missing.add(v)\n self.missing = missing","def isSetVariable(self):\n return _libsbml.EventAssignment_isSetVariable(self)","def isSetVariable(self):\n return _libsbml.Rule_isSetVariable(self)","def isset(cls,name):\n inst = cls.inst()\n if name in inst.options and \\\n len(inst.options[name]) > 0:\n return True\n else:\n return False","def _set(env_var: str) -> bool:\n return os.getenv(env_var) not in [None, \"0\"]","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\r\n if \"_is_valid\" in self.__dict__:\r\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def is_assign(self):\n return self.var.initializer is not None","def sanity_check(self):\n return True","def requested() -> bool:\n\treturn _flag.is_set()","def check_vars(self):\n\n # The pipe name.\n if not has_pipe(self.pipe_name):\n raise RelaxNoPipeError(self.pipe_name)","def test_variable(self, condition, undefined_paths, current_path):\n var = str(condition.find('name').text)\n if not var in self.variables.get_keys() and self.fail_on_undefined_vars:\n current_path += ((var, 'undefined variable'),)\n undefined_paths.add(current_path)\n return False\n else:\n return True","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def assert_valid(self):\n if \"_is_valid\" in self.__dict__:\n assert self.__dict__[\"_is_valid\"](), \"Variable has already been deleted\"","def global_check(self):\n return None","def _validate_variable(self, variable):\n if variable is not None:\n # test type\n if not self.validate_type(variable):\n return False\n\n return True","def required_field(variable_to_test: any, err_string: str) -> None:\n if variable_to_test is None:\n print('\\n' + err_string + '\\n')\n sys.exit(1)","def _check_assigned(self):\n\n if self.values is None and self.lazy:\n raise ValueError(\"This instance has not been assigned any data.\")","def _check_vals(self):\n\n try:\n self.is_set = True\n self.pack()\n except Exception as err:\n # Set default values again\n raise ValueError(\"Invalid arguments. Could not packed since: {}\".format(err))\n self.__init__()","def is_initialized(self) -> bool:\n return (\n (self._exchange_params_by_currency_id is not None)\n and (self._utility_params_by_good_id is not None)\n and (self._transaction_fees is not None)\n )","def checkValName(self):\n valLength = len(self.val)\n if valLength == 0:\n try:\n valsLength = len(self.val)\n if valsLength == 0:\n self.val = self.vals\n except Exception:\n print \"No value set\"","def check_settings(self):\r\n pass","def isMandatory(self, is_set, get_value):\n\t\tif self._mandatory and not is_set(self.name):\treturn True\n\t\treturn False","def _check_parameter(self, data):\n return self._pre_process_record(data) is not None","def check_settings(self):\n pass","def Sets(self, variable):\n return variable and variable.upper().strip() in self.variables","def exist(x):\n return x is not None","def keyIsValid(key):\n\n isValid = 1\n \n try:\n temp = getParam(key)\n\n except ValueError:\n isValid = 0\n warning(\" WARNING: %s not set\" % (key))\n\n return isValid","def test_no_existing_value(self):\n var_name = \"PICCOLO_TEST_1\"\n\n # Make sure it definitely doesn't exist already\n if os.environ.get(var_name) is not None:\n del os.environ[var_name]\n\n new_value = \"hello world\"\n\n with set_env_var(var_name=var_name, temp_value=new_value):\n self.assertEqual(os.environ.get(var_name), new_value)\n\n self.assertEqual(os.environ.get(var_name), None)","def hasEditVariable(self, variable: Variable, /) -> bool:\n ...","def validate_value_flag(self):\n if not self.app.args.value is None or self.app.args.value == '':\n return True\n else:\n return False","def _check_env():\n\tif os.getenv(_DATA_DIRECTORY_ENV_KEY) is None:\n\t\texit_everything(ERROR_DATA_DIRECTORY_NOT_SET, f'{_DATA_DIRECTORY_ENV_KEY} env var not set')\n\t\n\tif os.getenv(_FRONTEND_URL_ENV_KEY) is None:\n\t\texit_everything(ERROR_FRONTEND_NOT_SET, f'{_FRONTEND_URL_ENV_KEY} env var not set')","def check_params_set():\n critical = {'machineinfo' : MACHINEID, \n 'error_serverinfo' : ERROR_SERVER, \n 'serverinfo' : SERVER}\n for i, val in critical.iteritems():\n if not val:\n print \"ERROR: Set value for \\\"%s\\\" in baseconfig.cfg file first\\n\" % i\n sys.exit(1)","def f_exists(self, varname):\r\n return (varname in self.locals_ptr)","def required(self) -> bool:\n return self._default is None","def check(self):\n return True","def _check_settings(self):\n if self.api_key is None:\n raise ImproperlyConfigured(\"You must provide an API key.\")","def __checkInput(self, var):\n try:\n int(var)\n\n except:\n return False\n\n else:\n return True","def check():","def sanity_check(self):\n pass","def hasVeryTrustedValue(self):","def check_envvar(envvar):\n if not os.environ.get(envvar):\n raise EnvironmentError(\"Variable '%s' not set\" % envvar)","def test_variables(self):\n self._api.SetVariable(\"debug_file\", \"/dev/null\")\n self.assertEqual(self._api.GetVariableAsString(\"debug_file\"), \"/dev/null\")","def payload_undefined(self):\n return self._attr is None","def test_get_none(self):\n self.assertTrue(self.tester.get('Not_a_Sample') is None)","def test_get_none(self):\n self.assertTrue(self.tester.get('Not_a_Sample') is None)","def verify(self):\n D,S,I,C = False,False,False,False\n if self.geoData and os.path.exists(self.geoData):\n D = True\n if self.scales:\n S = True\n if type(self.idVariable) == int:\n I = True\n if self.cacheFile:\n C = True\n if D and S and I and C:\n return True\n return False","def empty(self, value):\r\n return value is None","def empty(self, value):\r\n return value is None","def empty(self, value):\r\n return value is None","def empty(self, value):\r\n return value is None","def empty(self, value):\r\n return value is None","def not_set(string):\n if string is None:\n return True\n elif string == '':\n return True\n return False","def id_is_variable(self):\n return not self.defined","def is_optionally_defined(self):\n return self._is_optionally_defined","def check_persist_model():\n return env_helper.has_env(_store_environment_variable)","def check_variable_line(self, line):\n self.E_str = \"check_variable_line\"\n line, any_vars = self.find_vars_in_str(line)\n words = [i for i in line.split('=') if i]\n words = self.fix_words(words)\n\n if len(words) < 2:\n self.print_error(\"The syntax for declaring variables is: \"\n + \"'<name> = <value>'\")","def check_value(self, value):","def has_value(self):\n return hasattr(self, '_value')","def _is_ready(self):\n res = True\n for (key, val) in self._attrs.iteritems():\n if key not in self._optional_attrs:\n if val is None:\n res = False\n return res","def check(self) -> None:","def checkValid(self):\n if (self.noteName is not None) and (self.accidental is not None) and (self.octave is not None):\n return True\n else:\n return False","def _check_env_var_presence_s3_db(env_var_name):\n if os.environ.get(env_var_name) is None:\n logger.info(\"Warning: the {name} environment variable is not set.\\n\"\n \"All tests that access AWS S3 database will fail\\n\".format(\n name=env_var_name))","def invariant(self):\n\t\treturn ((self.url != \"\") and (self.locationId != \"\"))","def test_exists(self, condition, undefined_paths, current_path):\n var = str(condition.find('variable').text)\n if not var in self.variables.get_keys() and self.fail_on_undefined_vars:\n current_path += ((var, 'undefined variable'),)\n undefined_paths.add(current_path)\n return False\n else:\n return True","async def set_value(self, value: int | float, init: bool = False) -> bool:\n req_url = self.isy.conn.compile_url(\n [\n URL_VARIABLES,\n ATTR_INIT if init else ATTR_SET,\n str(self._type),\n str(self._id),\n str(value),\n ]\n )\n if not await self.isy.conn.request(req_url):\n _LOGGER.warning(\n \"ISY could not set variable%s: %s.%s\",\n \" init value\" if init else \"\",\n str(self._type),\n str(self._id),\n )\n return False\n _LOGGER.debug(\n \"ISY set variable%s: %s.%s\",\n \" init value\" if init else \"\",\n str(self._type),\n str(self._id),\n )\n return True","def _is_initialized(self) -> bool:\n return len(self) > 0","def check_state(self):\n pass","def compare_with_none():\n value = {};\n if value is not None:\n print(\"value is not none\")\n else:\n print(\"value is none\")","def has_value(key: str) -> bool:\n Config.__get()\n assert Config.__config is not None\n return Config.__config.has_option(\"wsgi\", key)","def test_get(self, env: yaenv.Env):\n assert env.get('BLANK', 'default') == ''\n assert env.get('MISSING') is None\n assert env.get('MISSING', 'default') == 'default'","def is_initialized(self) -> bool:\n return (\n self._amount_by_currency_id is not None\n and self._quantities_by_good_id is not None\n )","def is_empty(self):\r\n dict = self.piDD\r\n if dict == {\"[0]\": None}:\r\n return True\r\n else:\r\n return False","def has_variable(self, name):\n return name in self._variables","def _isinit(self):\n return self.dp.state()==PyTango.DevState.INIT","def check(self):\n self._parse_config()\n if self.name == \"\":\n self.name = \"local\"\n self.chart_name += \"_\" + self.name\n data = self._get_data()\n if data is None:\n return False\n\n return True","def is_empty(self) -> bool:\n return self.command is None and not self.required","def verify_environment():\n reqs = ['NAME', 'RECIPIENT', 'SUBJECT', 'MESSAGE',\n 'MAILGUN_API_KEY', 'MAILGUN_DOMAIN']\n for req in reqs:\n if not os.getenv(req):\n logging.error('Environment variable ' + req + ' is not set')\n sys.exit(2)","def validate_and_init() -> bool:\n env_vars_absent = [\n env\n for env in REQUIRED_ENVS\n if env not in os.environ or len(os.environ[env]) == 0\n ]\n if env_vars_absent:\n print(f\"Please define {env_vars_absent} in your github secrets. Aborting...\")\n return False\n\n if not (\n ENV_VAR_STATS_TYPE in os.environ\n and len(os.environ[ENV_VAR_STATS_TYPE]) > 0\n and os.environ[ENV_VAR_STATS_TYPE] in ALLOWED_STATS_TYPES\n ):\n print(f\"Using default stats type: {DEFAULT_STATS_TYPE}\")\n os.environ[ENV_VAR_STATS_TYPE] = DEFAULT_STATS_TYPE\n\n return True","def has_default_value(self):\n return self.default is not None"],"string":"[\n \"def has_value(var) :\\n return var != None\",\n \"def isSet(self) -> bool:\\n ...\",\n \"def has_assignment_for(self, var):\\n return self.variable_to_value.get(var) != None\",\n \"def _var_check(self):\\n missing = set()\\n for v in self.variables:\\n if getattr(self, v) is None:\\n missing.add(v)\\n self.missing = missing\",\n \"def isSetVariable(self):\\n return _libsbml.EventAssignment_isSetVariable(self)\",\n \"def isSetVariable(self):\\n return _libsbml.Rule_isSetVariable(self)\",\n \"def isset(cls,name):\\n inst = cls.inst()\\n if name in inst.options and \\\\\\n len(inst.options[name]) > 0:\\n return True\\n else:\\n return False\",\n \"def _set(env_var: str) -> bool:\\n return os.getenv(env_var) not in [None, \\\"0\\\"]\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\r\\n if \\\"_is_valid\\\" in self.__dict__:\\r\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def is_assign(self):\\n return self.var.initializer is not None\",\n \"def sanity_check(self):\\n return True\",\n \"def requested() -> bool:\\n\\treturn _flag.is_set()\",\n \"def check_vars(self):\\n\\n # The pipe name.\\n if not has_pipe(self.pipe_name):\\n raise RelaxNoPipeError(self.pipe_name)\",\n \"def test_variable(self, condition, undefined_paths, current_path):\\n var = str(condition.find('name').text)\\n if not var in self.variables.get_keys() and self.fail_on_undefined_vars:\\n current_path += ((var, 'undefined variable'),)\\n undefined_paths.add(current_path)\\n return False\\n else:\\n return True\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def assert_valid(self):\\n if \\\"_is_valid\\\" in self.__dict__:\\n assert self.__dict__[\\\"_is_valid\\\"](), \\\"Variable has already been deleted\\\"\",\n \"def global_check(self):\\n return None\",\n \"def _validate_variable(self, variable):\\n if variable is not None:\\n # test type\\n if not self.validate_type(variable):\\n return False\\n\\n return True\",\n \"def required_field(variable_to_test: any, err_string: str) -> None:\\n if variable_to_test is None:\\n print('\\\\n' + err_string + '\\\\n')\\n sys.exit(1)\",\n \"def _check_assigned(self):\\n\\n if self.values is None and self.lazy:\\n raise ValueError(\\\"This instance has not been assigned any data.\\\")\",\n \"def _check_vals(self):\\n\\n try:\\n self.is_set = True\\n self.pack()\\n except Exception as err:\\n # Set default values again\\n raise ValueError(\\\"Invalid arguments. Could not packed since: {}\\\".format(err))\\n self.__init__()\",\n \"def is_initialized(self) -> bool:\\n return (\\n (self._exchange_params_by_currency_id is not None)\\n and (self._utility_params_by_good_id is not None)\\n and (self._transaction_fees is not None)\\n )\",\n \"def checkValName(self):\\n valLength = len(self.val)\\n if valLength == 0:\\n try:\\n valsLength = len(self.val)\\n if valsLength == 0:\\n self.val = self.vals\\n except Exception:\\n print \\\"No value set\\\"\",\n \"def check_settings(self):\\r\\n pass\",\n \"def isMandatory(self, is_set, get_value):\\n\\t\\tif self._mandatory and not is_set(self.name):\\treturn True\\n\\t\\treturn False\",\n \"def _check_parameter(self, data):\\n return self._pre_process_record(data) is not None\",\n \"def check_settings(self):\\n pass\",\n \"def Sets(self, variable):\\n return variable and variable.upper().strip() in self.variables\",\n \"def exist(x):\\n return x is not None\",\n \"def keyIsValid(key):\\n\\n isValid = 1\\n \\n try:\\n temp = getParam(key)\\n\\n except ValueError:\\n isValid = 0\\n warning(\\\" WARNING: %s not set\\\" % (key))\\n\\n return isValid\",\n \"def test_no_existing_value(self):\\n var_name = \\\"PICCOLO_TEST_1\\\"\\n\\n # Make sure it definitely doesn't exist already\\n if os.environ.get(var_name) is not None:\\n del os.environ[var_name]\\n\\n new_value = \\\"hello world\\\"\\n\\n with set_env_var(var_name=var_name, temp_value=new_value):\\n self.assertEqual(os.environ.get(var_name), new_value)\\n\\n self.assertEqual(os.environ.get(var_name), None)\",\n \"def hasEditVariable(self, variable: Variable, /) -> bool:\\n ...\",\n \"def validate_value_flag(self):\\n if not self.app.args.value is None or self.app.args.value == '':\\n return True\\n else:\\n return False\",\n \"def _check_env():\\n\\tif os.getenv(_DATA_DIRECTORY_ENV_KEY) is None:\\n\\t\\texit_everything(ERROR_DATA_DIRECTORY_NOT_SET, f'{_DATA_DIRECTORY_ENV_KEY} env var not set')\\n\\t\\n\\tif os.getenv(_FRONTEND_URL_ENV_KEY) is None:\\n\\t\\texit_everything(ERROR_FRONTEND_NOT_SET, f'{_FRONTEND_URL_ENV_KEY} env var not set')\",\n \"def check_params_set():\\n critical = {'machineinfo' : MACHINEID, \\n 'error_serverinfo' : ERROR_SERVER, \\n 'serverinfo' : SERVER}\\n for i, val in critical.iteritems():\\n if not val:\\n print \\\"ERROR: Set value for \\\\\\\"%s\\\\\\\" in baseconfig.cfg file first\\\\n\\\" % i\\n sys.exit(1)\",\n \"def f_exists(self, varname):\\r\\n return (varname in self.locals_ptr)\",\n \"def required(self) -> bool:\\n return self._default is None\",\n \"def check(self):\\n return True\",\n \"def _check_settings(self):\\n if self.api_key is None:\\n raise ImproperlyConfigured(\\\"You must provide an API key.\\\")\",\n \"def __checkInput(self, var):\\n try:\\n int(var)\\n\\n except:\\n return False\\n\\n else:\\n return True\",\n \"def check():\",\n \"def sanity_check(self):\\n pass\",\n \"def hasVeryTrustedValue(self):\",\n \"def check_envvar(envvar):\\n if not os.environ.get(envvar):\\n raise EnvironmentError(\\\"Variable '%s' not set\\\" % envvar)\",\n \"def test_variables(self):\\n self._api.SetVariable(\\\"debug_file\\\", \\\"/dev/null\\\")\\n self.assertEqual(self._api.GetVariableAsString(\\\"debug_file\\\"), \\\"/dev/null\\\")\",\n \"def payload_undefined(self):\\n return self._attr is None\",\n \"def test_get_none(self):\\n self.assertTrue(self.tester.get('Not_a_Sample') is None)\",\n \"def test_get_none(self):\\n self.assertTrue(self.tester.get('Not_a_Sample') is None)\",\n \"def verify(self):\\n D,S,I,C = False,False,False,False\\n if self.geoData and os.path.exists(self.geoData):\\n D = True\\n if self.scales:\\n S = True\\n if type(self.idVariable) == int:\\n I = True\\n if self.cacheFile:\\n C = True\\n if D and S and I and C:\\n return True\\n return False\",\n \"def empty(self, value):\\r\\n return value is None\",\n \"def empty(self, value):\\r\\n return value is None\",\n \"def empty(self, value):\\r\\n return value is None\",\n \"def empty(self, value):\\r\\n return value is None\",\n \"def empty(self, value):\\r\\n return value is None\",\n \"def not_set(string):\\n if string is None:\\n return True\\n elif string == '':\\n return True\\n return False\",\n \"def id_is_variable(self):\\n return not self.defined\",\n \"def is_optionally_defined(self):\\n return self._is_optionally_defined\",\n \"def check_persist_model():\\n return env_helper.has_env(_store_environment_variable)\",\n \"def check_variable_line(self, line):\\n self.E_str = \\\"check_variable_line\\\"\\n line, any_vars = self.find_vars_in_str(line)\\n words = [i for i in line.split('=') if i]\\n words = self.fix_words(words)\\n\\n if len(words) < 2:\\n self.print_error(\\\"The syntax for declaring variables is: \\\"\\n + \\\"'<name> = <value>'\\\")\",\n \"def check_value(self, value):\",\n \"def has_value(self):\\n return hasattr(self, '_value')\",\n \"def _is_ready(self):\\n res = True\\n for (key, val) in self._attrs.iteritems():\\n if key not in self._optional_attrs:\\n if val is None:\\n res = False\\n return res\",\n \"def check(self) -> None:\",\n \"def checkValid(self):\\n if (self.noteName is not None) and (self.accidental is not None) and (self.octave is not None):\\n return True\\n else:\\n return False\",\n \"def _check_env_var_presence_s3_db(env_var_name):\\n if os.environ.get(env_var_name) is None:\\n logger.info(\\\"Warning: the {name} environment variable is not set.\\\\n\\\"\\n \\\"All tests that access AWS S3 database will fail\\\\n\\\".format(\\n name=env_var_name))\",\n \"def invariant(self):\\n\\t\\treturn ((self.url != \\\"\\\") and (self.locationId != \\\"\\\"))\",\n \"def test_exists(self, condition, undefined_paths, current_path):\\n var = str(condition.find('variable').text)\\n if not var in self.variables.get_keys() and self.fail_on_undefined_vars:\\n current_path += ((var, 'undefined variable'),)\\n undefined_paths.add(current_path)\\n return False\\n else:\\n return True\",\n \"async def set_value(self, value: int | float, init: bool = False) -> bool:\\n req_url = self.isy.conn.compile_url(\\n [\\n URL_VARIABLES,\\n ATTR_INIT if init else ATTR_SET,\\n str(self._type),\\n str(self._id),\\n str(value),\\n ]\\n )\\n if not await self.isy.conn.request(req_url):\\n _LOGGER.warning(\\n \\\"ISY could not set variable%s: %s.%s\\\",\\n \\\" init value\\\" if init else \\\"\\\",\\n str(self._type),\\n str(self._id),\\n )\\n return False\\n _LOGGER.debug(\\n \\\"ISY set variable%s: %s.%s\\\",\\n \\\" init value\\\" if init else \\\"\\\",\\n str(self._type),\\n str(self._id),\\n )\\n return True\",\n \"def _is_initialized(self) -> bool:\\n return len(self) > 0\",\n \"def check_state(self):\\n pass\",\n \"def compare_with_none():\\n value = {};\\n if value is not None:\\n print(\\\"value is not none\\\")\\n else:\\n print(\\\"value is none\\\")\",\n \"def has_value(key: str) -> bool:\\n Config.__get()\\n assert Config.__config is not None\\n return Config.__config.has_option(\\\"wsgi\\\", key)\",\n \"def test_get(self, env: yaenv.Env):\\n assert env.get('BLANK', 'default') == ''\\n assert env.get('MISSING') is None\\n assert env.get('MISSING', 'default') == 'default'\",\n \"def is_initialized(self) -> bool:\\n return (\\n self._amount_by_currency_id is not None\\n and self._quantities_by_good_id is not None\\n )\",\n \"def is_empty(self):\\r\\n dict = self.piDD\\r\\n if dict == {\\\"[0]\\\": None}:\\r\\n return True\\r\\n else:\\r\\n return False\",\n \"def has_variable(self, name):\\n return name in self._variables\",\n \"def _isinit(self):\\n return self.dp.state()==PyTango.DevState.INIT\",\n \"def check(self):\\n self._parse_config()\\n if self.name == \\\"\\\":\\n self.name = \\\"local\\\"\\n self.chart_name += \\\"_\\\" + self.name\\n data = self._get_data()\\n if data is None:\\n return False\\n\\n return True\",\n \"def is_empty(self) -> bool:\\n return self.command is None and not self.required\",\n \"def verify_environment():\\n reqs = ['NAME', 'RECIPIENT', 'SUBJECT', 'MESSAGE',\\n 'MAILGUN_API_KEY', 'MAILGUN_DOMAIN']\\n for req in reqs:\\n if not os.getenv(req):\\n logging.error('Environment variable ' + req + ' is not set')\\n sys.exit(2)\",\n \"def validate_and_init() -> bool:\\n env_vars_absent = [\\n env\\n for env in REQUIRED_ENVS\\n if env not in os.environ or len(os.environ[env]) == 0\\n ]\\n if env_vars_absent:\\n print(f\\\"Please define {env_vars_absent} in your github secrets. Aborting...\\\")\\n return False\\n\\n if not (\\n ENV_VAR_STATS_TYPE in os.environ\\n and len(os.environ[ENV_VAR_STATS_TYPE]) > 0\\n and os.environ[ENV_VAR_STATS_TYPE] in ALLOWED_STATS_TYPES\\n ):\\n print(f\\\"Using default stats type: {DEFAULT_STATS_TYPE}\\\")\\n os.environ[ENV_VAR_STATS_TYPE] = DEFAULT_STATS_TYPE\\n\\n return True\",\n \"def has_default_value(self):\\n return self.default is not None\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.718136","0.6951559","0.6602433","0.65596896","0.6471603","0.6464828","0.64093935","0.63088953","0.61869645","0.61869645","0.61869645","0.61869645","0.61869645","0.61869645","0.61869645","0.61869645","0.61869645","0.61869645","0.61869645","0.61869645","0.617754","0.6168864","0.6143583","0.61368537","0.61341774","0.6120801","0.6120801","0.6120801","0.6120801","0.6120801","0.6120801","0.6120801","0.6120801","0.6120801","0.6110685","0.60985076","0.6097396","0.6078897","0.6013909","0.60008603","0.59862715","0.5970379","0.59432125","0.5934388","0.5922709","0.58937645","0.5871716","0.5864951","0.5854971","0.5842988","0.58354425","0.5827533","0.5825942","0.5812874","0.57854843","0.57551867","0.57403034","0.57231295","0.57225835","0.57072926","0.5705515","0.57005626","0.5687629","0.5687248","0.568508","0.568508","0.5677692","0.5677143","0.5677143","0.5677143","0.5677143","0.5677143","0.56726825","0.5664391","0.5659608","0.5657004","0.5652213","0.56513625","0.56475514","0.5646764","0.5646543","0.5641434","0.56405824","0.5636159","0.5623938","0.56175834","0.5605055","0.56022173","0.5602102","0.56015694","0.5594691","0.557835","0.5574159","0.5565855","0.5556465","0.5556458","0.5548006","0.5545008","0.5542524","0.5541201"],"string":"[\n \"0.718136\",\n \"0.6951559\",\n \"0.6602433\",\n \"0.65596896\",\n \"0.6471603\",\n \"0.6464828\",\n \"0.64093935\",\n \"0.63088953\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.61869645\",\n \"0.617754\",\n \"0.6168864\",\n \"0.6143583\",\n \"0.61368537\",\n \"0.61341774\",\n \"0.6120801\",\n \"0.6120801\",\n \"0.6120801\",\n \"0.6120801\",\n \"0.6120801\",\n \"0.6120801\",\n \"0.6120801\",\n \"0.6120801\",\n \"0.6120801\",\n \"0.6110685\",\n \"0.60985076\",\n \"0.6097396\",\n \"0.6078897\",\n \"0.6013909\",\n \"0.60008603\",\n \"0.59862715\",\n \"0.5970379\",\n \"0.59432125\",\n \"0.5934388\",\n \"0.5922709\",\n \"0.58937645\",\n \"0.5871716\",\n \"0.5864951\",\n \"0.5854971\",\n \"0.5842988\",\n \"0.58354425\",\n \"0.5827533\",\n \"0.5825942\",\n \"0.5812874\",\n \"0.57854843\",\n \"0.57551867\",\n \"0.57403034\",\n \"0.57231295\",\n \"0.57225835\",\n \"0.57072926\",\n \"0.5705515\",\n \"0.57005626\",\n \"0.5687629\",\n \"0.5687248\",\n \"0.568508\",\n \"0.568508\",\n \"0.5677692\",\n \"0.5677143\",\n \"0.5677143\",\n \"0.5677143\",\n \"0.5677143\",\n \"0.5677143\",\n \"0.56726825\",\n \"0.5664391\",\n \"0.5659608\",\n \"0.5657004\",\n \"0.5652213\",\n \"0.56513625\",\n \"0.56475514\",\n \"0.5646764\",\n \"0.5646543\",\n \"0.5641434\",\n \"0.56405824\",\n \"0.5636159\",\n \"0.5623938\",\n \"0.56175834\",\n \"0.5605055\",\n \"0.56022173\",\n \"0.5602102\",\n \"0.56015694\",\n \"0.5594691\",\n \"0.557835\",\n \"0.5574159\",\n \"0.5565855\",\n \"0.5556465\",\n \"0.5556458\",\n \"0.5548006\",\n \"0.5545008\",\n \"0.5542524\",\n \"0.5541201\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.674686"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":94774,"cells":{"query":{"kind":"string","value":"update with commands from the block"},"document":{"kind":"string","value":"def update_commands(self, commands_str):\n commands = dict(parse_qsl(commands_str, keep_blank_values=True))\n _if = commands.get(\"if\", self._if)\n if _if:\n self._if = Condition(_if)\n self._set_int(commands, \"max_length\")\n self._set_int(commands, \"min_length\")\n self.color = expand_color(commands.get(\"color\"), passthrough=True, block=self.color)\n\n self.not_zero = \"not_zero\" in commands or self.not_zero\n self.show = \"show\" in commands or self.show\n self.soft = \"soft\" in commands or self.soft"},"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 update():","def update():","def commandUpdate(self):\n pass","def update( ):\r\n pass","def update(self) -> None:\n ...","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n pass","def update(self):\n\n pass","def update(self):\n self.blocks.update()\n self.players.update()\n self.Coins.update()","def _update(self):\n pass","def update(self):\n\n print(\"---\\n |\\n |\")\n print(self.__body__, \"\\n\\n\")","def update(self):\r\n pass","def update(self):","def update(self):","def update(self):","def updateBlock(self):\n self.blkno = self.blknoSpinBox.value() - 1\n self.initDataParms()\n self.updateCurveList()\n self.compute()","def changed_block(self, old_block, new_block):","def update(*args):","async def async_update(self):","def update(self, *args, **kwargs):","def _update_block_in_structure(self, structure, block_key, content):\n structure['blocks'][block_key] = content","def update(self, args):\n pass","def update(self) -> None:\n pass","def update(self) -> None:\n pass","def update(self, *args, **kw):\n pass","def dispatch_update(self, update):\n command_handlers = {\n '/start': self._do_start,\n '/help': self._do_help,\n '/neuer_spruch': self._do_neuer_spruch,\n '/mein_spruch': self._do_mein_spruch,\n '/alle_meine_sprueche': self._do_alle_meine_sprueche,\n '/loesche_meine_sprueche': self._do_loesche_meine_sprüche,\n '/setze_aktiven_spruch': self._do_setze_aktiven_spruch\n }\n callback_handlers = {\n '/delete': self._callback_delete,\n '/active': self._callback_active\n }\n\n if \"message\" in update.keys():\n # Parse command\n args = update[\"message\"][\"text\"].split(' ', 1)\n command = args[0].replace('@cde_nasenspruch_bot', '')\n chat_id = update[\"message\"][\"chat\"][\"id\"]\n user_id = update[\"message\"][\"from\"][\"id\"]\n\n # Call command handler function\n try:\n command_handlers[command](chat_id, user_id, args, update)\n except KeyError:\n if command.startswith('/'):\n self.tclient.send_message('Unbekannter Befehl. Versuch es mal mit /help', chat_id)\n pass\n elif \"callback_query\" in update.keys():\n args = update[\"callback_query\"][\"data\"].split(' ', 2)\n command = args[0].replace('@cde_nasenspruch_bot', '')\n chat_id = update[\"callback_query\"][\"from\"][\"id\"]\n user_id = update[\"callback_query\"][\"from\"][\"id\"]\n \n # Call callback handler function\n try:\n callback_handlers[command](chat_id, user_id, args, update)\n except KeyError:\n print('Unbekannter callback_query {}'.format(update[\"callback_query\"][\"data\"]))\n pass","def async_update(self):","async def _update_stmt(self):\n raise NotImplementedError","def update(self, line):","def Update(self):\r\n\r\n # does nothing\r\n pass","def update(self)->None:\n pass","def _update(self, host):\n pass","def help_update(self):\n print(UPDATE)","def cmd_update(self):\n self.update_repository()\n results = self.results.getvalue()\n if results:\n print('---')\n print(results, end='')","async def async_update(self):\n await self.chainso.async_get_data()","def update(self, *args, **kwargs):\n pass","def update(self, *args, **kwargs):\n pass","def update(self, *args, **kwargs):\n pass","def update(blockstring):\n with BLOCK_LOCK:\n for block in blockstring.split('|'):\n name, values = parse(block)\n BLOCKS[name] = values","async def update(self) -> None:\n # pause logic\n if not self.running.is_set():\n self.add_to_output(\"Paused...\")\n await self.running.wait()\n\n # tell the user we are updating\n self.add_to_output(f\"Updating...\")\n # create ssh connection to miner\n try:\n conn = await self.get_connection(\"root\", \"admin\")\n # tell the user we are sending the update file\n self.add_to_output(\"Sending upgrade file...\")\n # send the update file\n await self.send_file(UPDATE_FILE_S9, \"/tmp/firmware.tar\")\n # install the update and collect the result\n result = await conn.run(f'sysupgrade /tmp/firmware.tar')\n self.add_to_output(result.stdout.strip())\n # tell the user the update completed\n self.add_to_output(f\"Update completed...\")\n except OSError:\n self.add_to_output(f\"Unknown error...\")","def cmd_update(self, text):\n self.update(text)","def update(self) -> None:\n pass","def update_self(self, command):\n yield from command.reply('Starting full self update...')\n yield from self.git_pull(command)\n yield from self.migrate(command)\n yield from self.sysinfo(command)\n yield from self.restart(command)","def version_block(self, block_data, user_id, update_version):\n if block_data.edit_info.update_version == update_version:\n return\n\n original_usage = block_data.edit_info.original_usage\n original_usage_version = block_data.edit_info.original_usage_version\n block_data.edit_info.edited_on = datetime.datetime.now(UTC)\n block_data.edit_info.edited_by = user_id\n block_data.edit_info.previous_version = block_data.edit_info.update_version\n block_data.edit_info.update_version = update_version\n if original_usage:\n block_data.edit_info.original_usage = original_usage\n block_data.edit_info.original_usage_version = original_usage_version","def update(self, params):","def _update(self, count=True, forced=False):","def update(self):\n return self._process('update')","def update(self):\n sess = u.get_default_session()\n # sess.run(self.update_op)\n u.run(self.update_op)","def update_data():\n pass","def update(self,update_flags):\n pass","def update(self, data):\n pass","def update(self, data):\n pass","def update(self, data):\n pass","def update(self, data):\n pass","def update(self):\n self.__execute(self.pkgin_bin, \"update\")","def dummy_update( self ):\r\n pass","def send_update(self, target_block, DIR):\r\n new_opts = []\r\n new_weights = []\r\n if len(self.block_opts) != 1:\r\n raise Exception (\"Improperly collapsed block!\")\r\n i = self.block_opts[0] #our state\r\n for k in range(len(target_block.block_opts)): #k is their state\r\n #print(\"Checking \",i,k,DIR)\r\n if check_allowed(i,target_block.block_opts[k],DIR):\r\n new_opts.append(target_block.block_opts[k])\r\n new_weights.append(target_block.block_weights[k])\r\n target_block.block_opts = new_opts\r\n n = sum(new_weights)\r\n target_block.block_weights = [x/n for x in new_weights]\r\n target_block.block_weights = new_weights\r\n target_block.arr = target_block.superposition()\r\n return","async def async_update(self) -> None:\n return","def update(self, msg):\n pass","def update():\n return 'update api in put'","def _update_block_in_structure(self, structure, block_id, content):\r\n structure['blocks'][LocMapperStore.encode_key_for_mongo(block_id)] = content","def handle_updates(self, update):\r\n self.__manage_pump()","def gen_update(self, TL):\r\n pass","def update(self):\n\n\t\tif not self.complete:\n\t\t\tfor vasp_run in self.vasp_run_list:\n\t\t\t\tvasp_run.update()","def onBlock(self, data) :\n pass","def command_wrapupdate(self):\n wrapupdater.main(*self.args())","def update(self):\n pass","def handl_update(updates):\n for update in updates[\"result\"]:\n text = update[\"message\"][\"text\"]\n chat = update[\"message\"][\"chat\"][\"id\"]\n items = db.get_item(chat)\n if text == \"/done\":\n keyboard = build_keyboard(items)\n send_message(\"Sélectionner un items pour le suprimer\", chat, keyboard)\n elif text == \"/start\":\n send_message(\"Bienvenue dans votre liste de tâches personnelles. \"\n \"Envoyez-moi n'importe quel texte et je le stockerai comme un article.\"\n \" Envoyé (/) terminé pour supprimer des éléments\", chat)\n elif text.startswith(\"/\"):\n continue\n elif text in items:\n db.delete_item(text, chat)\n items = db.get_item(chat)\n keyboard = build_keyboard(items)\n send_message(\"Sélectionner un items pour le suprimer \", chat, keyboard)\n else:\n db.add_item(text, chat)\n items = db.get_item(chat)\n # print(\"items \", items)\n message = \"\\n\".join(items)\n # print(\"message\", message)\n send_message(message, chat)","def _update(self, last_blk=None):\n self._clear_queue()\n self.blockchain_lock.acquire()\n self.added_tx_lock.acquire()\n self.balance_lock.acquire()\n try:\n # Resolve blockchain to get last block\n if last_blk is None:\n last_blk = self._blockchain.resolve()\n # Update added transactions with transactions in blockchain\n blockchain_tx = self._blockchain.get_transactions_by_fork(last_blk)\n self._added_transactions = set(blockchain_tx)\n # Update balance state with latest\n self._balance = self._blockchain.get_balance_by_fork(last_blk)\n finally:\n self.blockchain_lock.release()\n self.added_tx_lock.release()\n self.balance_lock.release()\n self.stop_mine.clear()\n return last_blk","def block(self, block):\n\n self._block = block","def block(self, block):\n\n self._block = block","def command_update_hw(self, cmd):\n # TODO\n pass","def update(self):\n raise NotImplementedError","def CommitBlock(self, block):\n QUEUE.put(Block(block=block))","def update(self):\n # default implementation is to do nothing.","def _set_block(self, pos, block_):\n self._changes[deepcopy(pos)] = block","def update():\r\n\t#print(\"Updating poeninja database...\")\r\n\t#poeninja.update_database()\r\n\t#print(\"Updateing poeninja name-dict...\")\r\n\t#poeninja.update_name_dict()\r\n\t#print(\"Updating stats...\")\r\n\t#update_stats()\r\n\t#print(\"Updating items...\")\r\n\t#update_items()\r\n\t#print(\"Updating mod MySQL database...\")\r\n\t#update_mod_database()\r\n\tmydb = database()\r\n\twhile True:\r\n\t\trandom_mod(mydb)","def update_command():\n # global selected_tuple\n backend.update(selected_tuple[0], \n title_text.get(), \n author_text.get(), \n year_text.get(), \n isbn_text.get())","def __await__(self):\n return self.update().__await__()","def update(self, *args, **kwargs): # real signature unknown\n pass","def update(self, *args, **kwargs): # real signature unknown\n pass","def update(self, *args, **kwargs): # real signature unknown\n pass","def update(self, *args, **kwargs): # real signature unknown\n pass","def update(self, *args, **kwargs): # real signature unknown\n pass","def update(self, *args, **kwargs): # real signature unknown\n pass","def update_recovered_block(\n self, block_hash: Sha256Hash, block_msg: TBlockMessage\n ) -> None:\n pass","async def on_block_updated(\n self, position: typing.Tuple[float, float, float], itself=True\n ):\n raise NotImplementedError","def update(self, data: bytes):\n self.send(data)"],"string":"[\n \"def update():\",\n \"def update():\",\n \"def commandUpdate(self):\\n pass\",\n \"def update( ):\\r\\n pass\",\n \"def update(self) -> None:\\n ...\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n pass\",\n \"def update(self):\\n\\n pass\",\n \"def update(self):\\n self.blocks.update()\\n self.players.update()\\n self.Coins.update()\",\n \"def _update(self):\\n pass\",\n \"def update(self):\\n\\n print(\\\"---\\\\n |\\\\n |\\\")\\n print(self.__body__, \\\"\\\\n\\\\n\\\")\",\n \"def update(self):\\r\\n pass\",\n \"def update(self):\",\n \"def update(self):\",\n \"def update(self):\",\n \"def updateBlock(self):\\n self.blkno = self.blknoSpinBox.value() - 1\\n self.initDataParms()\\n self.updateCurveList()\\n self.compute()\",\n \"def changed_block(self, old_block, new_block):\",\n \"def update(*args):\",\n \"async def async_update(self):\",\n \"def update(self, *args, **kwargs):\",\n \"def _update_block_in_structure(self, structure, block_key, content):\\n structure['blocks'][block_key] = content\",\n \"def update(self, args):\\n pass\",\n \"def update(self) -> None:\\n pass\",\n \"def update(self) -> None:\\n pass\",\n \"def update(self, *args, **kw):\\n pass\",\n \"def dispatch_update(self, update):\\n command_handlers = {\\n '/start': self._do_start,\\n '/help': self._do_help,\\n '/neuer_spruch': self._do_neuer_spruch,\\n '/mein_spruch': self._do_mein_spruch,\\n '/alle_meine_sprueche': self._do_alle_meine_sprueche,\\n '/loesche_meine_sprueche': self._do_loesche_meine_sprüche,\\n '/setze_aktiven_spruch': self._do_setze_aktiven_spruch\\n }\\n callback_handlers = {\\n '/delete': self._callback_delete,\\n '/active': self._callback_active\\n }\\n\\n if \\\"message\\\" in update.keys():\\n # Parse command\\n args = update[\\\"message\\\"][\\\"text\\\"].split(' ', 1)\\n command = args[0].replace('@cde_nasenspruch_bot', '')\\n chat_id = update[\\\"message\\\"][\\\"chat\\\"][\\\"id\\\"]\\n user_id = update[\\\"message\\\"][\\\"from\\\"][\\\"id\\\"]\\n\\n # Call command handler function\\n try:\\n command_handlers[command](chat_id, user_id, args, update)\\n except KeyError:\\n if command.startswith('/'):\\n self.tclient.send_message('Unbekannter Befehl. Versuch es mal mit /help', chat_id)\\n pass\\n elif \\\"callback_query\\\" in update.keys():\\n args = update[\\\"callback_query\\\"][\\\"data\\\"].split(' ', 2)\\n command = args[0].replace('@cde_nasenspruch_bot', '')\\n chat_id = update[\\\"callback_query\\\"][\\\"from\\\"][\\\"id\\\"]\\n user_id = update[\\\"callback_query\\\"][\\\"from\\\"][\\\"id\\\"]\\n \\n # Call callback handler function\\n try:\\n callback_handlers[command](chat_id, user_id, args, update)\\n except KeyError:\\n print('Unbekannter callback_query {}'.format(update[\\\"callback_query\\\"][\\\"data\\\"]))\\n pass\",\n \"def async_update(self):\",\n \"async def _update_stmt(self):\\n raise NotImplementedError\",\n \"def update(self, line):\",\n \"def Update(self):\\r\\n\\r\\n # does nothing\\r\\n pass\",\n \"def update(self)->None:\\n pass\",\n \"def _update(self, host):\\n pass\",\n \"def help_update(self):\\n print(UPDATE)\",\n \"def cmd_update(self):\\n self.update_repository()\\n results = self.results.getvalue()\\n if results:\\n print('---')\\n print(results, end='')\",\n \"async def async_update(self):\\n await self.chainso.async_get_data()\",\n \"def update(self, *args, **kwargs):\\n pass\",\n \"def update(self, *args, **kwargs):\\n pass\",\n \"def update(self, *args, **kwargs):\\n pass\",\n \"def update(blockstring):\\n with BLOCK_LOCK:\\n for block in blockstring.split('|'):\\n name, values = parse(block)\\n BLOCKS[name] = values\",\n \"async def update(self) -> None:\\n # pause logic\\n if not self.running.is_set():\\n self.add_to_output(\\\"Paused...\\\")\\n await self.running.wait()\\n\\n # tell the user we are updating\\n self.add_to_output(f\\\"Updating...\\\")\\n # create ssh connection to miner\\n try:\\n conn = await self.get_connection(\\\"root\\\", \\\"admin\\\")\\n # tell the user we are sending the update file\\n self.add_to_output(\\\"Sending upgrade file...\\\")\\n # send the update file\\n await self.send_file(UPDATE_FILE_S9, \\\"/tmp/firmware.tar\\\")\\n # install the update and collect the result\\n result = await conn.run(f'sysupgrade /tmp/firmware.tar')\\n self.add_to_output(result.stdout.strip())\\n # tell the user the update completed\\n self.add_to_output(f\\\"Update completed...\\\")\\n except OSError:\\n self.add_to_output(f\\\"Unknown error...\\\")\",\n \"def cmd_update(self, text):\\n self.update(text)\",\n \"def update(self) -> None:\\n pass\",\n \"def update_self(self, command):\\n yield from command.reply('Starting full self update...')\\n yield from self.git_pull(command)\\n yield from self.migrate(command)\\n yield from self.sysinfo(command)\\n yield from self.restart(command)\",\n \"def version_block(self, block_data, user_id, update_version):\\n if block_data.edit_info.update_version == update_version:\\n return\\n\\n original_usage = block_data.edit_info.original_usage\\n original_usage_version = block_data.edit_info.original_usage_version\\n block_data.edit_info.edited_on = datetime.datetime.now(UTC)\\n block_data.edit_info.edited_by = user_id\\n block_data.edit_info.previous_version = block_data.edit_info.update_version\\n block_data.edit_info.update_version = update_version\\n if original_usage:\\n block_data.edit_info.original_usage = original_usage\\n block_data.edit_info.original_usage_version = original_usage_version\",\n \"def update(self, params):\",\n \"def _update(self, count=True, forced=False):\",\n \"def update(self):\\n return self._process('update')\",\n \"def update(self):\\n sess = u.get_default_session()\\n # sess.run(self.update_op)\\n u.run(self.update_op)\",\n \"def update_data():\\n pass\",\n \"def update(self,update_flags):\\n pass\",\n \"def update(self, data):\\n pass\",\n \"def update(self, data):\\n pass\",\n \"def update(self, data):\\n pass\",\n \"def update(self, data):\\n pass\",\n \"def update(self):\\n self.__execute(self.pkgin_bin, \\\"update\\\")\",\n \"def dummy_update( self ):\\r\\n pass\",\n \"def send_update(self, target_block, DIR):\\r\\n new_opts = []\\r\\n new_weights = []\\r\\n if len(self.block_opts) != 1:\\r\\n raise Exception (\\\"Improperly collapsed block!\\\")\\r\\n i = self.block_opts[0] #our state\\r\\n for k in range(len(target_block.block_opts)): #k is their state\\r\\n #print(\\\"Checking \\\",i,k,DIR)\\r\\n if check_allowed(i,target_block.block_opts[k],DIR):\\r\\n new_opts.append(target_block.block_opts[k])\\r\\n new_weights.append(target_block.block_weights[k])\\r\\n target_block.block_opts = new_opts\\r\\n n = sum(new_weights)\\r\\n target_block.block_weights = [x/n for x in new_weights]\\r\\n target_block.block_weights = new_weights\\r\\n target_block.arr = target_block.superposition()\\r\\n return\",\n \"async def async_update(self) -> None:\\n return\",\n \"def update(self, msg):\\n pass\",\n \"def update():\\n return 'update api in put'\",\n \"def _update_block_in_structure(self, structure, block_id, content):\\r\\n structure['blocks'][LocMapperStore.encode_key_for_mongo(block_id)] = content\",\n \"def handle_updates(self, update):\\r\\n self.__manage_pump()\",\n \"def gen_update(self, TL):\\r\\n pass\",\n \"def update(self):\\n\\n\\t\\tif not self.complete:\\n\\t\\t\\tfor vasp_run in self.vasp_run_list:\\n\\t\\t\\t\\tvasp_run.update()\",\n \"def onBlock(self, data) :\\n pass\",\n \"def command_wrapupdate(self):\\n wrapupdater.main(*self.args())\",\n \"def update(self):\\n pass\",\n \"def handl_update(updates):\\n for update in updates[\\\"result\\\"]:\\n text = update[\\\"message\\\"][\\\"text\\\"]\\n chat = update[\\\"message\\\"][\\\"chat\\\"][\\\"id\\\"]\\n items = db.get_item(chat)\\n if text == \\\"/done\\\":\\n keyboard = build_keyboard(items)\\n send_message(\\\"Sélectionner un items pour le suprimer\\\", chat, keyboard)\\n elif text == \\\"/start\\\":\\n send_message(\\\"Bienvenue dans votre liste de tâches personnelles. \\\"\\n \\\"Envoyez-moi n'importe quel texte et je le stockerai comme un article.\\\"\\n \\\" Envoyé (/) terminé pour supprimer des éléments\\\", chat)\\n elif text.startswith(\\\"/\\\"):\\n continue\\n elif text in items:\\n db.delete_item(text, chat)\\n items = db.get_item(chat)\\n keyboard = build_keyboard(items)\\n send_message(\\\"Sélectionner un items pour le suprimer \\\", chat, keyboard)\\n else:\\n db.add_item(text, chat)\\n items = db.get_item(chat)\\n # print(\\\"items \\\", items)\\n message = \\\"\\\\n\\\".join(items)\\n # print(\\\"message\\\", message)\\n send_message(message, chat)\",\n \"def _update(self, last_blk=None):\\n self._clear_queue()\\n self.blockchain_lock.acquire()\\n self.added_tx_lock.acquire()\\n self.balance_lock.acquire()\\n try:\\n # Resolve blockchain to get last block\\n if last_blk is None:\\n last_blk = self._blockchain.resolve()\\n # Update added transactions with transactions in blockchain\\n blockchain_tx = self._blockchain.get_transactions_by_fork(last_blk)\\n self._added_transactions = set(blockchain_tx)\\n # Update balance state with latest\\n self._balance = self._blockchain.get_balance_by_fork(last_blk)\\n finally:\\n self.blockchain_lock.release()\\n self.added_tx_lock.release()\\n self.balance_lock.release()\\n self.stop_mine.clear()\\n return last_blk\",\n \"def block(self, block):\\n\\n self._block = block\",\n \"def block(self, block):\\n\\n self._block = block\",\n \"def command_update_hw(self, cmd):\\n # TODO\\n pass\",\n \"def update(self):\\n raise NotImplementedError\",\n \"def CommitBlock(self, block):\\n QUEUE.put(Block(block=block))\",\n \"def update(self):\\n # default implementation is to do nothing.\",\n \"def _set_block(self, pos, block_):\\n self._changes[deepcopy(pos)] = block\",\n \"def update():\\r\\n\\t#print(\\\"Updating poeninja database...\\\")\\r\\n\\t#poeninja.update_database()\\r\\n\\t#print(\\\"Updateing poeninja name-dict...\\\")\\r\\n\\t#poeninja.update_name_dict()\\r\\n\\t#print(\\\"Updating stats...\\\")\\r\\n\\t#update_stats()\\r\\n\\t#print(\\\"Updating items...\\\")\\r\\n\\t#update_items()\\r\\n\\t#print(\\\"Updating mod MySQL database...\\\")\\r\\n\\t#update_mod_database()\\r\\n\\tmydb = database()\\r\\n\\twhile True:\\r\\n\\t\\trandom_mod(mydb)\",\n \"def update_command():\\n # global selected_tuple\\n backend.update(selected_tuple[0], \\n title_text.get(), \\n author_text.get(), \\n year_text.get(), \\n isbn_text.get())\",\n \"def __await__(self):\\n return self.update().__await__()\",\n \"def update(self, *args, **kwargs): # real signature unknown\\n pass\",\n \"def update(self, *args, **kwargs): # real signature unknown\\n pass\",\n \"def update(self, *args, **kwargs): # real signature unknown\\n pass\",\n \"def update(self, *args, **kwargs): # real signature unknown\\n pass\",\n \"def update(self, *args, **kwargs): # real signature unknown\\n pass\",\n \"def update(self, *args, **kwargs): # real signature unknown\\n pass\",\n \"def update_recovered_block(\\n self, block_hash: Sha256Hash, block_msg: TBlockMessage\\n ) -> None:\\n pass\",\n \"async def on_block_updated(\\n self, position: typing.Tuple[float, float, float], itself=True\\n ):\\n raise NotImplementedError\",\n \"def update(self, data: bytes):\\n self.send(data)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.70040303","0.70040303","0.68496","0.68419474","0.63492554","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6342758","0.6337077","0.6331995","0.6330059","0.6302485","0.6299308","0.6270749","0.6270749","0.6270749","0.6260961","0.620627","0.6193621","0.61855054","0.6155812","0.61086863","0.6084857","0.60818183","0.60818183","0.60542375","0.60428303","0.6017601","0.6015206","0.601412","0.60061866","0.6004132","0.5978561","0.5973048","0.5966905","0.59668803","0.5941202","0.5941202","0.5941202","0.59377795","0.59347886","0.59333926","0.5924701","0.5916357","0.5912083","0.59109807","0.59104013","0.5890006","0.5888199","0.5878568","0.58569574","0.5856585","0.5856585","0.5856585","0.5856585","0.5850872","0.58491457","0.58289856","0.5803684","0.5801602","0.57888186","0.57873785","0.5773595","0.57693106","0.5748793","0.5737725","0.5736379","0.5721011","0.57063764","0.5692362","0.56882167","0.56882167","0.5681648","0.5664678","0.5654744","0.56418234","0.5607175","0.55938256","0.55913717","0.55856365","0.55853975","0.55853975","0.55853975","0.55853975","0.55853975","0.55853975","0.558511","0.55819416","0.5567681"],"string":"[\n \"0.70040303\",\n \"0.70040303\",\n \"0.68496\",\n \"0.68419474\",\n \"0.63492554\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6342758\",\n \"0.6337077\",\n \"0.6331995\",\n \"0.6330059\",\n \"0.6302485\",\n \"0.6299308\",\n \"0.6270749\",\n \"0.6270749\",\n \"0.6270749\",\n \"0.6260961\",\n \"0.620627\",\n \"0.6193621\",\n \"0.61855054\",\n \"0.6155812\",\n \"0.61086863\",\n \"0.6084857\",\n \"0.60818183\",\n \"0.60818183\",\n \"0.60542375\",\n \"0.60428303\",\n \"0.6017601\",\n \"0.6015206\",\n \"0.601412\",\n \"0.60061866\",\n \"0.6004132\",\n \"0.5978561\",\n \"0.5973048\",\n \"0.5966905\",\n \"0.59668803\",\n \"0.5941202\",\n \"0.5941202\",\n \"0.5941202\",\n \"0.59377795\",\n \"0.59347886\",\n \"0.59333926\",\n \"0.5924701\",\n \"0.5916357\",\n \"0.5912083\",\n \"0.59109807\",\n \"0.59104013\",\n \"0.5890006\",\n \"0.5888199\",\n \"0.5878568\",\n \"0.58569574\",\n \"0.5856585\",\n \"0.5856585\",\n \"0.5856585\",\n \"0.5856585\",\n \"0.5850872\",\n \"0.58491457\",\n \"0.58289856\",\n \"0.5803684\",\n \"0.5801602\",\n \"0.57888186\",\n \"0.57873785\",\n \"0.5773595\",\n \"0.57693106\",\n \"0.5748793\",\n \"0.5737725\",\n \"0.5736379\",\n \"0.5721011\",\n \"0.57063764\",\n \"0.5692362\",\n \"0.56882167\",\n \"0.56882167\",\n \"0.5681648\",\n \"0.5664678\",\n \"0.5654744\",\n \"0.56418234\",\n \"0.5607175\",\n \"0.55938256\",\n \"0.55913717\",\n \"0.55856365\",\n \"0.55853975\",\n \"0.55853975\",\n \"0.55853975\",\n \"0.55853975\",\n \"0.55853975\",\n \"0.55853975\",\n \"0.558511\",\n \"0.55819416\",\n \"0.5567681\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94775,"cells":{"query":{"kind":"string","value":"set integer value from commands"},"document":{"kind":"string","value":"def _set_int(self, commands, name):\n if name in commands:\n try:\n value = int(commands[name])\n setattr(self, name, value)\n except ValueError:\n pass"},"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 setInteger(self, value):","def setInteger(self, value):","def set_num(self, num):\n self.cmd_num = num","def setInteger(self, value: int):\n self.value = value","def setInt(self, addr: ghidra.program.model.address.Address, value: int) -> None:\n ...","def getint(self, strcommand):\n result = ct.c_longlong()\n command = ct.c_wchar_p(strcommand)\n self.lib.AT_GetInt(self.AT_H, command, ct.addressof(result))\n return result.value","def setInteger(self, value):\n assert self._is_int is True\n self._value = value","def execute(self, cmd: Command) -> int:\n try:\n return self.cmds[cmd.id]\n except KeyError:\n if cmd.val:\n self.state[cmd.key] = cmd.val\n self.cmds[cmd.id] = self.state[cmd.key]\n return self.cmds[cmd.id]","def setInt(self, address: ghidra.program.model.address.Address, value: int) -> None:\n ...","def set_raw_output(val: int) -> None:\n print(val)","def main(cls, args):\r\n var = cls.MyInt()\r\n print \"Value before increment :\" , var.value\r\n cls.increment(var)\r\n print \"Value after increment :\" , var.value","def output_integer(state, key, data):\n return int(state[key])","def CLI(self, *_):\n self.reg.I = 0","def setChanInt(\n self,\n u,\n chan,\n intval,\n ):\n\n # print \"setting chan %d to %d\" % (chan,intval)\n # sys.stdout.flush()\n\n self.DMX[u].set_chan_int(chan, intval)","def seti(self, node, new_int):\n\n self.daq.syncSetInt(f'/{self.device_id}/{node}', new_int)","def update_variable(value):\n return value + 1","def setValue(self,val):\n val = int(val)\n self.input.setText(str(val))","def setIntValue(self, *args):\n return _libsbml.ConversionOption_setIntValue(self, *args)","def setIntValue(self, *args):\n return _libsbml.ConversionProperties_setIntValue(self, *args)","def getint(self, option, argument=None):\n value = self.get(option, argument)\n if value: return int(value)\n else: return 0","def getInteger(self):","def getInteger(self):","def set_power_management(value: int) -> None:","def __int__(self): \n return int(self.val())","def updateInt(data):\n emit('timestamp', data)","def assign_value(self, points):\n \n self.value = int(points)","def _cmd_set_button(self, command):\r\n index = int(command.get('value'))\r\n self.l_debug(\"_cmd_set_button\",\"index=%d\" % (index))\r\n return self._send_command_by_index(index)","def setInt(self, key, value):\n self.__config.setValue(key, QtCore.QVariant(value))\n self.__saved = False","def main2(cls, args):\r\n var = 1\r\n print \"Value before increment :\" , var\r\n cls.increment(var)\r\n print \"Value after increment :\" , var","def _setVals(self, cmd_length=0):\n self.cmd_length = cmd_length","def getValue(self) -> int:\n ...","def set_attributes(value, attribute):\n try:\n int(value)\n return int(value)\n except ValueError:\n my_banner(\"Value must be an integer.\" + attribute.upper() +\n \" set to 0. Use \" + attribute.upper() + \" setter function to change attribute.\")\n return 0","def value(self, p_int): # real signature unknown; restored from __doc__\n pass","def set(self, val: int) -> None:\n self.val = val\n self.notes = []","def __send__(self,val):\n assert(len(val) == 1)\n assert(type(val) == bytes)\n v = int.from_bytes(val,byteorder=\"little\")\n if(self.verbose):\n pc.color_stdout(\"GREEN\")\n print(\">> %s\\t - %s\\t - %d\"% (hex(v),bin(v),v))\n pc.color_stdout(\"RESET\")\n self.port.write(val)","def test_integer_update(self):\r\n vm = Integer.value_manager(None, None, 5)\r\n assert not vm.changed\r\n vm.value = 4\r\n assert vm.changed","def setContentInt(_session, _segment, _el, _data):\n _session.set_content_int(_el, _data)\n _session.gen3_f_a_f(_segment, keynodes.ui.format_int, _el, sc.SC_A_CONST|sc.SC_POS)","def incrdecr(con,command,key,value=1):\n # yy=atpic.log.setname(xx,'incrdecr')\n thecommand=\"{command} {key} {value}\\r\\n\".format(command=command,key=key,value=value)\n con.send(thecommand.encode('utf-8'))\n line=get_line(con)\n # atpic.log.debug(yy,line)\n if line==b'NOT_FOUND':\n return None\n else:\n return int(line.strip())","def Set(self,value):\n self.Bus.Write_uInt8(self.Address,0x50+self.Pin,value)","def setInt(self, addr: ghidra.program.model.address.Address, value: int, bigEndian: bool) -> None:\n ...","def assign_number(world: World, number: int):\r\n if number == 1:\r\n world[\"cpu choice\"] = \"santa\"\r\n elif number == 2:\r\n world[\"cpu choice\"] = \"reindeer\"\r\n elif number == 3:\r\n world[\"cpu choice\"] = \"snowman\"","def getint(self, option):\n return getint(self.name, option)","def command( self, value ): # uint8_t\n\t\tself.send(value, mode=0)","def command(self, value):\n self._send(value, _RS_INSTRUCTION)","def setIntegerOption(self, option, value):\n result = self.__lib.voikkoSetIntegerOption(self.__handle, option, value)\n if result == 0:\n raise VoikkoException(\"Could not set integer option %s to value %s\" % (option, value))","def __int__(self):\n return self.get_raw_int()","def command(self, value):\n self._send(value, self.RS_INSTRUCTION)","def getInteger(self):\n pass","def _command_number(self, number):\r\n if number == '.':\r\n # check if the number is a float\r\n if '.' in self.current_number:\r\n return\r\n self.current_number = self.current_number + number\r\n elif self.current_number == '0':\r\n # check if the number is 0\r\n # if it is, replace it\r\n self.current_number = number\r\n else:\r\n # else we add number after the current number\r\n self.current_number = self.current_number + number","def set_value(self, index, mode, value):\n address = self.get_address(index, mode)\n self.program[address] = value","def setC(self, c):\n\t\tself.c = int(c)","def write(self, value: int, /) -> None:","def integer(self, integer):\n\n self._integer = integer","def setenumerated(self, strcommand, value):\n command = ct.c_wchar_p(strcommand)\n value = ct.c_bool(value)\n self.lib.AT_SetEnumerated(self.AT_H, command, value)","def set_int_reset():\n int_reset = request.params.get(\"int_reset\", 0) == \"true\"\n pid = request.params.get(\"pid\", 1, type=int)\n retval = RP_LIB.rp_PIDSetIntReset(pid, int_reset)\n if retval != 0:\n LOG.error(\"Failed to set PID integrator reset. Error code: %s\", ERROR_CODES[retval])","def testSetPowerWithInt(self):\n self.node.power = 2\n\n self.assertEqual(\n (2, 2, 2),\n self.node.power\n )","def writeInt(self, value: int):\n self._pack('!i', value)","def execute(self):\n \n self.outvar = self.invar + .01","def give_me_an_integer():\n return 5\n pass","def test_device_init_command(self):\n default_val = 0\n self.assertEqual(self.sim_device.integer1, default_val)\n # Write to the attribute integer1\n self.sim_device.integer1 = 45\n self.assertEqual(self.sim_device.integer1, 45)\n # Reset the values of the device attributes to default.\n self.sim_device.Init()\n # Check that the desiredPointing attribute is reset.\n self.assertEqual(self.sim_device.integer1, default_val)","def cmd_num(self):\r\n return self._arm.cmd_num","def set_Value(self, n_value):\n#Joerg S/Martin W advice\n self.StoredValue=n_value","def test_set_integer(self):\n setting_name = 'project_int_setting'\n url = reverse(\n 'projectroles:api_project_setting_set',\n kwargs={'project': self.project.sodar_uuid},\n )\n post_data = {\n 'app_name': EX_APP_NAME,\n 'setting_name': setting_name,\n 'value': '170',\n }\n response = self.request_knox(url, method='POST', data=post_data)\n self.assertEqual(response.status_code, 200, msg=response.content)\n obj = AppSetting.objects.get(name=setting_name, project=self.project)\n self.assertEqual(obj.get_value(), 170)","def test_get_value_int(self):\n val = self.setting_int.get_value()\n self.assertIsInstance(val, int)\n self.assertEqual(val, 170)","def test_get_value_int(self):\n val = self.setting_int.get_value()\n self.assertIsInstance(val, int)\n self.assertEqual(val, 170)","def set_value(self,parameter_number,value):\n code = int(\"01100000\",2) | parameter_number\n command = pack('<BH',code,int(rint(value)))\n reply = self.query(command = command,ser = self.ser, count=1)\n if len(reply) != 1:\n warn(\"expecting 1, got %d bytes\" % len(reply)); return\n reply_code, = unpack('B',reply)\n if reply_code != code: warn(\"expecting 0x%X, got 0x%X\" % (code,reply_code))","def __execute(self, command: MicrobitCommand) -> None:\n if isinstance(command, MicrobitAccelerometerSetRange):\n self.__set_max_value(command.value)","def useti(self, prompt=None, default=None):\n \n i = 0\n abak = copy(default) # Backup our default value\n\n a = abak\n while(i<self.maxTries):\n tmp = self.uset(prompt,default)\n try:\n a = float(tmp)\n a = int(a)\n i = self.maxTries # preload failure\n except:\n # Print warning\n print\n print \" WARNING: Invalid Entry. Please enter an integer!!\"\n print \n # reload the default\n a = abak\n i = i+1\n \n return(a)","def change_value(self,val):\n self.val = val","def command(self, inst_data: int, buf: bytes, /) -> None:","def get_int(self, item: str) -> int:\n return int(self[item])","def GetInteger(self,prompt=''):\n\t\treturn self.acad.ActiveDocument.Utility.GetInteger(prompt)","def gpio(self) -> int:","def getint(self, option, default=None):\n\t\treturn self._get_raw(option, 'int', default)","def cmd_calculation():","def int_val(self) -> int:\n return int(self.current_token)","def command(self, value):\n self.tcp_comms.tcp_params.ISO = int(value)\n self.tcp_comms.send_iso(self.tcp_comms.tcp_params.ISO)","def variable(self, val):","def value(self):\n return int(self.input.text())","def __int__(self):\n\n return self.value","async def set_param(self, param: str, value: int) -> ArchonCommand:\n cmd = await self.send_command(f\"FASTLOADPARAM {param} {value}\")\n if not cmd.succeeded():\n raise ArchonError(\n f\"Failed setting parameter {param!r} ({cmd.status.name}).\"\n )\n return cmd","def getint(self, section, option):\n return int(self.get(section, option))","def cli():\n palette = \"Set1\"\n num_vals = 10\n for arg in sys.argv[1:]:\n if arg.isdigit():\n num_vals = int(arg)\n else:\n palette = arg\n run(palette, num_vals)","def set(self, var, value):\n cmd = '{0}={1};'.format(var, value)\n out = self.eval(cmd)\n if out.find(\"error\") != -1:\n raise TypeError(\"Error executing code in Matlab\\nCODE:\\n\\t{0}\\nMatlab ERROR:\\n\\t{1}\".format(cmd, out))","def getint(self, option, default = None, section = None):\n return int(self.get(option, default, section))","def set_count(c):\n global count\n count = c","def increment_counter(self) -> None:","def _change_cmd(self, cmd_number: int, new_cmd: str):\n if cmd_number is 0:\n self.command_group.cmd0 = str(new_cmd)\n elif cmd_number is 1:\n self.command_group.cmd1 = str(new_cmd)\n elif cmd_number is 2:\n self.command_group.cmd2 = str(new_cmd)\n else:\n assert False\n\n if self.command_group.is_cmd_runner_command(new_cmd):\n self._initialize_runner(new_cmd)\n\n logging.info(\"Setting {0} to {1}\".format(str(cmd_number), str(new_cmd)))\n cybld_helpers.print_seperator_lines()","def setvalue(self,num,name,val):\n self.M.reconfigure(num,{name:float(val)})","def __setitem__(self, item: str, value: int) -> None:\n self.stoi[item] = value","def adjustMotorValue(value):\n value = int(value)\n if value <= 20:\n value = 0\n motor.writeNumber(value)\n print(motor.readNumber(), flush=True)","def cmd(self):","def __init__(__self__, *,\n number: int):\n pulumi.set(__self__, \"number\", number)","def set_pid(self, pid, value):\n if type(value) in (list, tuple):\n value = \",\".join(map(hex, value))\n cmd = \"ATSET {}={}\\r\".format(pid, value)\n self.sendCMD(cmd)","def set_number(update: Update, context: CallbackContext):\n\n # Fix number of questions\n context.chat_data['number'] = 0\n context.chat_data['total'] = int(update.message.text)\n chat_id = update.message.chat_id\n\n # Create dictionary for future score input\n context.chat_data['user'] = dict()\n\n # Start the quiz\n data = {'chat_id': chat_id,'context': context}\n context.job_queue.run_once(run_quiz, 3, context=data, name=str(chat_id))# Delay time to 1st question\n\n return RUNNING_QUIZ","def set_totalizer(self, cmd_code=0): #command #241\r\n byte0 = hex(cmd_code)[2:].zfill(2)\r\n status, data = self.comm2('f101' + byte0)\r\n totaliser_status = int(Brooks.get_bytes(0,data,1),16)\r\n return totaliser_status","def set_assist(self, a):\n a = int(a*10)\n lo = a&0xff\n hi = a>>8\n self.communicate('S', '\\x03' + chr(lo) + chr(hi) + '\\x01\\x80')","def increment_number(self):\n # self.number += 1\n print('fuckwit')\n # print(self.number)","def entero(self):\n return int(\"\".join(self.binario), 2)","def setCount(self, num):\n self.count=num"],"string":"[\n \"def setInteger(self, value):\",\n \"def setInteger(self, value):\",\n \"def set_num(self, num):\\n self.cmd_num = num\",\n \"def setInteger(self, value: int):\\n self.value = value\",\n \"def setInt(self, addr: ghidra.program.model.address.Address, value: int) -> None:\\n ...\",\n \"def getint(self, strcommand):\\n result = ct.c_longlong()\\n command = ct.c_wchar_p(strcommand)\\n self.lib.AT_GetInt(self.AT_H, command, ct.addressof(result))\\n return result.value\",\n \"def setInteger(self, value):\\n assert self._is_int is True\\n self._value = value\",\n \"def execute(self, cmd: Command) -> int:\\n try:\\n return self.cmds[cmd.id]\\n except KeyError:\\n if cmd.val:\\n self.state[cmd.key] = cmd.val\\n self.cmds[cmd.id] = self.state[cmd.key]\\n return self.cmds[cmd.id]\",\n \"def setInt(self, address: ghidra.program.model.address.Address, value: int) -> None:\\n ...\",\n \"def set_raw_output(val: int) -> None:\\n print(val)\",\n \"def main(cls, args):\\r\\n var = cls.MyInt()\\r\\n print \\\"Value before increment :\\\" , var.value\\r\\n cls.increment(var)\\r\\n print \\\"Value after increment :\\\" , var.value\",\n \"def output_integer(state, key, data):\\n return int(state[key])\",\n \"def CLI(self, *_):\\n self.reg.I = 0\",\n \"def setChanInt(\\n self,\\n u,\\n chan,\\n intval,\\n ):\\n\\n # print \\\"setting chan %d to %d\\\" % (chan,intval)\\n # sys.stdout.flush()\\n\\n self.DMX[u].set_chan_int(chan, intval)\",\n \"def seti(self, node, new_int):\\n\\n self.daq.syncSetInt(f'/{self.device_id}/{node}', new_int)\",\n \"def update_variable(value):\\n return value + 1\",\n \"def setValue(self,val):\\n val = int(val)\\n self.input.setText(str(val))\",\n \"def setIntValue(self, *args):\\n return _libsbml.ConversionOption_setIntValue(self, *args)\",\n \"def setIntValue(self, *args):\\n return _libsbml.ConversionProperties_setIntValue(self, *args)\",\n \"def getint(self, option, argument=None):\\n value = self.get(option, argument)\\n if value: return int(value)\\n else: return 0\",\n \"def getInteger(self):\",\n \"def getInteger(self):\",\n \"def set_power_management(value: int) -> None:\",\n \"def __int__(self): \\n return int(self.val())\",\n \"def updateInt(data):\\n emit('timestamp', data)\",\n \"def assign_value(self, points):\\n \\n self.value = int(points)\",\n \"def _cmd_set_button(self, command):\\r\\n index = int(command.get('value'))\\r\\n self.l_debug(\\\"_cmd_set_button\\\",\\\"index=%d\\\" % (index))\\r\\n return self._send_command_by_index(index)\",\n \"def setInt(self, key, value):\\n self.__config.setValue(key, QtCore.QVariant(value))\\n self.__saved = False\",\n \"def main2(cls, args):\\r\\n var = 1\\r\\n print \\\"Value before increment :\\\" , var\\r\\n cls.increment(var)\\r\\n print \\\"Value after increment :\\\" , var\",\n \"def _setVals(self, cmd_length=0):\\n self.cmd_length = cmd_length\",\n \"def getValue(self) -> int:\\n ...\",\n \"def set_attributes(value, attribute):\\n try:\\n int(value)\\n return int(value)\\n except ValueError:\\n my_banner(\\\"Value must be an integer.\\\" + attribute.upper() +\\n \\\" set to 0. Use \\\" + attribute.upper() + \\\" setter function to change attribute.\\\")\\n return 0\",\n \"def value(self, p_int): # real signature unknown; restored from __doc__\\n pass\",\n \"def set(self, val: int) -> None:\\n self.val = val\\n self.notes = []\",\n \"def __send__(self,val):\\n assert(len(val) == 1)\\n assert(type(val) == bytes)\\n v = int.from_bytes(val,byteorder=\\\"little\\\")\\n if(self.verbose):\\n pc.color_stdout(\\\"GREEN\\\")\\n print(\\\">> %s\\\\t - %s\\\\t - %d\\\"% (hex(v),bin(v),v))\\n pc.color_stdout(\\\"RESET\\\")\\n self.port.write(val)\",\n \"def test_integer_update(self):\\r\\n vm = Integer.value_manager(None, None, 5)\\r\\n assert not vm.changed\\r\\n vm.value = 4\\r\\n assert vm.changed\",\n \"def setContentInt(_session, _segment, _el, _data):\\n _session.set_content_int(_el, _data)\\n _session.gen3_f_a_f(_segment, keynodes.ui.format_int, _el, sc.SC_A_CONST|sc.SC_POS)\",\n \"def incrdecr(con,command,key,value=1):\\n # yy=atpic.log.setname(xx,'incrdecr')\\n thecommand=\\\"{command} {key} {value}\\\\r\\\\n\\\".format(command=command,key=key,value=value)\\n con.send(thecommand.encode('utf-8'))\\n line=get_line(con)\\n # atpic.log.debug(yy,line)\\n if line==b'NOT_FOUND':\\n return None\\n else:\\n return int(line.strip())\",\n \"def Set(self,value):\\n self.Bus.Write_uInt8(self.Address,0x50+self.Pin,value)\",\n \"def setInt(self, addr: ghidra.program.model.address.Address, value: int, bigEndian: bool) -> None:\\n ...\",\n \"def assign_number(world: World, number: int):\\r\\n if number == 1:\\r\\n world[\\\"cpu choice\\\"] = \\\"santa\\\"\\r\\n elif number == 2:\\r\\n world[\\\"cpu choice\\\"] = \\\"reindeer\\\"\\r\\n elif number == 3:\\r\\n world[\\\"cpu choice\\\"] = \\\"snowman\\\"\",\n \"def getint(self, option):\\n return getint(self.name, option)\",\n \"def command( self, value ): # uint8_t\\n\\t\\tself.send(value, mode=0)\",\n \"def command(self, value):\\n self._send(value, _RS_INSTRUCTION)\",\n \"def setIntegerOption(self, option, value):\\n result = self.__lib.voikkoSetIntegerOption(self.__handle, option, value)\\n if result == 0:\\n raise VoikkoException(\\\"Could not set integer option %s to value %s\\\" % (option, value))\",\n \"def __int__(self):\\n return self.get_raw_int()\",\n \"def command(self, value):\\n self._send(value, self.RS_INSTRUCTION)\",\n \"def getInteger(self):\\n pass\",\n \"def _command_number(self, number):\\r\\n if number == '.':\\r\\n # check if the number is a float\\r\\n if '.' in self.current_number:\\r\\n return\\r\\n self.current_number = self.current_number + number\\r\\n elif self.current_number == '0':\\r\\n # check if the number is 0\\r\\n # if it is, replace it\\r\\n self.current_number = number\\r\\n else:\\r\\n # else we add number after the current number\\r\\n self.current_number = self.current_number + number\",\n \"def set_value(self, index, mode, value):\\n address = self.get_address(index, mode)\\n self.program[address] = value\",\n \"def setC(self, c):\\n\\t\\tself.c = int(c)\",\n \"def write(self, value: int, /) -> None:\",\n \"def integer(self, integer):\\n\\n self._integer = integer\",\n \"def setenumerated(self, strcommand, value):\\n command = ct.c_wchar_p(strcommand)\\n value = ct.c_bool(value)\\n self.lib.AT_SetEnumerated(self.AT_H, command, value)\",\n \"def set_int_reset():\\n int_reset = request.params.get(\\\"int_reset\\\", 0) == \\\"true\\\"\\n pid = request.params.get(\\\"pid\\\", 1, type=int)\\n retval = RP_LIB.rp_PIDSetIntReset(pid, int_reset)\\n if retval != 0:\\n LOG.error(\\\"Failed to set PID integrator reset. Error code: %s\\\", ERROR_CODES[retval])\",\n \"def testSetPowerWithInt(self):\\n self.node.power = 2\\n\\n self.assertEqual(\\n (2, 2, 2),\\n self.node.power\\n )\",\n \"def writeInt(self, value: int):\\n self._pack('!i', value)\",\n \"def execute(self):\\n \\n self.outvar = self.invar + .01\",\n \"def give_me_an_integer():\\n return 5\\n pass\",\n \"def test_device_init_command(self):\\n default_val = 0\\n self.assertEqual(self.sim_device.integer1, default_val)\\n # Write to the attribute integer1\\n self.sim_device.integer1 = 45\\n self.assertEqual(self.sim_device.integer1, 45)\\n # Reset the values of the device attributes to default.\\n self.sim_device.Init()\\n # Check that the desiredPointing attribute is reset.\\n self.assertEqual(self.sim_device.integer1, default_val)\",\n \"def cmd_num(self):\\r\\n return self._arm.cmd_num\",\n \"def set_Value(self, n_value):\\n#Joerg S/Martin W advice\\n self.StoredValue=n_value\",\n \"def test_set_integer(self):\\n setting_name = 'project_int_setting'\\n url = reverse(\\n 'projectroles:api_project_setting_set',\\n kwargs={'project': self.project.sodar_uuid},\\n )\\n post_data = {\\n 'app_name': EX_APP_NAME,\\n 'setting_name': setting_name,\\n 'value': '170',\\n }\\n response = self.request_knox(url, method='POST', data=post_data)\\n self.assertEqual(response.status_code, 200, msg=response.content)\\n obj = AppSetting.objects.get(name=setting_name, project=self.project)\\n self.assertEqual(obj.get_value(), 170)\",\n \"def test_get_value_int(self):\\n val = self.setting_int.get_value()\\n self.assertIsInstance(val, int)\\n self.assertEqual(val, 170)\",\n \"def test_get_value_int(self):\\n val = self.setting_int.get_value()\\n self.assertIsInstance(val, int)\\n self.assertEqual(val, 170)\",\n \"def set_value(self,parameter_number,value):\\n code = int(\\\"01100000\\\",2) | parameter_number\\n command = pack('<BH',code,int(rint(value)))\\n reply = self.query(command = command,ser = self.ser, count=1)\\n if len(reply) != 1:\\n warn(\\\"expecting 1, got %d bytes\\\" % len(reply)); return\\n reply_code, = unpack('B',reply)\\n if reply_code != code: warn(\\\"expecting 0x%X, got 0x%X\\\" % (code,reply_code))\",\n \"def __execute(self, command: MicrobitCommand) -> None:\\n if isinstance(command, MicrobitAccelerometerSetRange):\\n self.__set_max_value(command.value)\",\n \"def useti(self, prompt=None, default=None):\\n \\n i = 0\\n abak = copy(default) # Backup our default value\\n\\n a = abak\\n while(i<self.maxTries):\\n tmp = self.uset(prompt,default)\\n try:\\n a = float(tmp)\\n a = int(a)\\n i = self.maxTries # preload failure\\n except:\\n # Print warning\\n print\\n print \\\" WARNING: Invalid Entry. Please enter an integer!!\\\"\\n print \\n # reload the default\\n a = abak\\n i = i+1\\n \\n return(a)\",\n \"def change_value(self,val):\\n self.val = val\",\n \"def command(self, inst_data: int, buf: bytes, /) -> None:\",\n \"def get_int(self, item: str) -> int:\\n return int(self[item])\",\n \"def GetInteger(self,prompt=''):\\n\\t\\treturn self.acad.ActiveDocument.Utility.GetInteger(prompt)\",\n \"def gpio(self) -> int:\",\n \"def getint(self, option, default=None):\\n\\t\\treturn self._get_raw(option, 'int', default)\",\n \"def cmd_calculation():\",\n \"def int_val(self) -> int:\\n return int(self.current_token)\",\n \"def command(self, value):\\n self.tcp_comms.tcp_params.ISO = int(value)\\n self.tcp_comms.send_iso(self.tcp_comms.tcp_params.ISO)\",\n \"def variable(self, val):\",\n \"def value(self):\\n return int(self.input.text())\",\n \"def __int__(self):\\n\\n return self.value\",\n \"async def set_param(self, param: str, value: int) -> ArchonCommand:\\n cmd = await self.send_command(f\\\"FASTLOADPARAM {param} {value}\\\")\\n if not cmd.succeeded():\\n raise ArchonError(\\n f\\\"Failed setting parameter {param!r} ({cmd.status.name}).\\\"\\n )\\n return cmd\",\n \"def getint(self, section, option):\\n return int(self.get(section, option))\",\n \"def cli():\\n palette = \\\"Set1\\\"\\n num_vals = 10\\n for arg in sys.argv[1:]:\\n if arg.isdigit():\\n num_vals = int(arg)\\n else:\\n palette = arg\\n run(palette, num_vals)\",\n \"def set(self, var, value):\\n cmd = '{0}={1};'.format(var, value)\\n out = self.eval(cmd)\\n if out.find(\\\"error\\\") != -1:\\n raise TypeError(\\\"Error executing code in Matlab\\\\nCODE:\\\\n\\\\t{0}\\\\nMatlab ERROR:\\\\n\\\\t{1}\\\".format(cmd, out))\",\n \"def getint(self, option, default = None, section = None):\\n return int(self.get(option, default, section))\",\n \"def set_count(c):\\n global count\\n count = c\",\n \"def increment_counter(self) -> None:\",\n \"def _change_cmd(self, cmd_number: int, new_cmd: str):\\n if cmd_number is 0:\\n self.command_group.cmd0 = str(new_cmd)\\n elif cmd_number is 1:\\n self.command_group.cmd1 = str(new_cmd)\\n elif cmd_number is 2:\\n self.command_group.cmd2 = str(new_cmd)\\n else:\\n assert False\\n\\n if self.command_group.is_cmd_runner_command(new_cmd):\\n self._initialize_runner(new_cmd)\\n\\n logging.info(\\\"Setting {0} to {1}\\\".format(str(cmd_number), str(new_cmd)))\\n cybld_helpers.print_seperator_lines()\",\n \"def setvalue(self,num,name,val):\\n self.M.reconfigure(num,{name:float(val)})\",\n \"def __setitem__(self, item: str, value: int) -> None:\\n self.stoi[item] = value\",\n \"def adjustMotorValue(value):\\n value = int(value)\\n if value <= 20:\\n value = 0\\n motor.writeNumber(value)\\n print(motor.readNumber(), flush=True)\",\n \"def cmd(self):\",\n \"def __init__(__self__, *,\\n number: int):\\n pulumi.set(__self__, \\\"number\\\", number)\",\n \"def set_pid(self, pid, value):\\n if type(value) in (list, tuple):\\n value = \\\",\\\".join(map(hex, value))\\n cmd = \\\"ATSET {}={}\\\\r\\\".format(pid, value)\\n self.sendCMD(cmd)\",\n \"def set_number(update: Update, context: CallbackContext):\\n\\n # Fix number of questions\\n context.chat_data['number'] = 0\\n context.chat_data['total'] = int(update.message.text)\\n chat_id = update.message.chat_id\\n\\n # Create dictionary for future score input\\n context.chat_data['user'] = dict()\\n\\n # Start the quiz\\n data = {'chat_id': chat_id,'context': context}\\n context.job_queue.run_once(run_quiz, 3, context=data, name=str(chat_id))# Delay time to 1st question\\n\\n return RUNNING_QUIZ\",\n \"def set_totalizer(self, cmd_code=0): #command #241\\r\\n byte0 = hex(cmd_code)[2:].zfill(2)\\r\\n status, data = self.comm2('f101' + byte0)\\r\\n totaliser_status = int(Brooks.get_bytes(0,data,1),16)\\r\\n return totaliser_status\",\n \"def set_assist(self, a):\\n a = int(a*10)\\n lo = a&0xff\\n hi = a>>8\\n self.communicate('S', '\\\\x03' + chr(lo) + chr(hi) + '\\\\x01\\\\x80')\",\n \"def increment_number(self):\\n # self.number += 1\\n print('fuckwit')\\n # print(self.number)\",\n \"def entero(self):\\n return int(\\\"\\\".join(self.binario), 2)\",\n \"def setCount(self, num):\\n self.count=num\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.71163434","0.71163434","0.67835045","0.62937844","0.61526585","0.6076695","0.6070734","0.6059233","0.59684515","0.5945891","0.5915541","0.58779633","0.5800634","0.5786643","0.5786482","0.5768864","0.57324964","0.5721998","0.56996304","0.5692422","0.5685165","0.5685165","0.56751233","0.56431276","0.5626594","0.56041265","0.5597573","0.55639285","0.5547441","0.5539316","0.5536062","0.55340344","0.55291337","0.55289656","0.54955584","0.54730266","0.54685706","0.5450458","0.5447376","0.543579","0.5418894","0.5416496","0.5414876","0.5393683","0.5380284","0.5373573","0.536791","0.53678626","0.53282607","0.5325864","0.5322972","0.53205806","0.53204274","0.5320304","0.53106594","0.5307354","0.5305472","0.530478","0.53041255","0.53009355","0.52907765","0.52888674","0.5285767","0.52756447","0.52756447","0.5275485","0.52639776","0.5260944","0.52605516","0.5258342","0.52498186","0.52358097","0.5234446","0.52343345","0.5232994","0.5219069","0.5204685","0.5198631","0.5197136","0.519005","0.5189448","0.5177734","0.5174925","0.5171609","0.5167937","0.5166577","0.5154347","0.515411","0.51519144","0.51471907","0.5142907","0.5142359","0.51417935","0.5135396","0.51054364","0.510299","0.51014394","0.5098644","0.509646","0.5091001"],"string":"[\n \"0.71163434\",\n \"0.71163434\",\n \"0.67835045\",\n \"0.62937844\",\n \"0.61526585\",\n \"0.6076695\",\n \"0.6070734\",\n \"0.6059233\",\n \"0.59684515\",\n \"0.5945891\",\n \"0.5915541\",\n \"0.58779633\",\n \"0.5800634\",\n \"0.5786643\",\n \"0.5786482\",\n \"0.5768864\",\n \"0.57324964\",\n \"0.5721998\",\n \"0.56996304\",\n \"0.5692422\",\n \"0.5685165\",\n \"0.5685165\",\n \"0.56751233\",\n \"0.56431276\",\n \"0.5626594\",\n \"0.56041265\",\n \"0.5597573\",\n \"0.55639285\",\n \"0.5547441\",\n \"0.5539316\",\n \"0.5536062\",\n \"0.55340344\",\n \"0.55291337\",\n \"0.55289656\",\n \"0.54955584\",\n \"0.54730266\",\n \"0.54685706\",\n \"0.5450458\",\n \"0.5447376\",\n \"0.543579\",\n \"0.5418894\",\n \"0.5416496\",\n \"0.5414876\",\n \"0.5393683\",\n \"0.5380284\",\n \"0.5373573\",\n \"0.536791\",\n \"0.53678626\",\n \"0.53282607\",\n \"0.5325864\",\n \"0.5322972\",\n \"0.53205806\",\n \"0.53204274\",\n \"0.5320304\",\n \"0.53106594\",\n \"0.5307354\",\n \"0.5305472\",\n \"0.530478\",\n \"0.53041255\",\n \"0.53009355\",\n \"0.52907765\",\n \"0.52888674\",\n \"0.5285767\",\n \"0.52756447\",\n \"0.52756447\",\n \"0.5275485\",\n \"0.52639776\",\n \"0.5260944\",\n \"0.52605516\",\n \"0.5258342\",\n \"0.52498186\",\n \"0.52358097\",\n \"0.5234446\",\n \"0.52343345\",\n \"0.5232994\",\n \"0.5219069\",\n \"0.5204685\",\n \"0.5198631\",\n \"0.5197136\",\n \"0.519005\",\n \"0.5189448\",\n \"0.5177734\",\n \"0.5174925\",\n \"0.5171609\",\n \"0.5167937\",\n \"0.5166577\",\n \"0.5154347\",\n \"0.515411\",\n \"0.51519144\",\n \"0.51471907\",\n \"0.5142907\",\n \"0.5142359\",\n \"0.51417935\",\n \"0.5135396\",\n \"0.51054364\",\n \"0.510299\",\n \"0.51014394\",\n \"0.5098644\",\n \"0.509646\",\n \"0.5091001\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.8104841"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94776,"cells":{"query":{"kind":"string","value":"set any commands for this block"},"document":{"kind":"string","value":"def set_commands(self, command_str):\n self.commands.update_commands(command_str)"},"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 commands(self, commands):\n\n self._commands = commands","def commands():","def commands():\n pass","def commands():\n pass","def commands():\n pass","def commands():\n pass","def at_cmdset_creation(self):\n super().at_cmdset_creation()\n #\n # any commands you add below will overload the default ones.\n #","def at_cmdset_creation(self):\n super().at_cmdset_creation()\n #\n # any commands you add below will overload the default ones.\n #","def silkscreen_commands(self, commands):\n self.pcb_layers[\"silkscreen\"].commands = commands","def at_cmdset_creation(self):\n self.add(default_cmds.CmdLook())\n self.add(default_cmds.CmdSay())","def set_commands(self, commands, append=False):\n if append:\n self.commands.extend(commands)\n else:\n self.commands = commands","def __init__(self, commands=None):\n self.commands = {}\n self.context = None","def set_command_list(self):\n self.commands = dict( \\\n BTN_POWER_OFF = 2, \\\n BTN_TV = 27, \\\n BTN_1 = 4, \\\n BTN_2 = 5, \\\n BTN_3 = 6, \\\n BTN_4 = 8, \\\n BTN_5 = 9, \\\n BTN_6 = 10, \\\n BTN_7 = 12, \\\n BTN_8 = 13, \\\n BTN_9 = 14, \\\n BTN_0 = 17, \\\n BTN_FAVOURITE_CHANNEL = 68, \\\n BTN_PREVIOUS_CHANNEL = 19, \\\n BTN_VOLUME_UP = 7, \\\n BTN_VOLUME_DOWN = 11, \\\n BTN_CHANNEL_UP = 18, \\\n BTN_CHANNEL_DOWN = 16, \\\n BTN_MUTE = 15, \\\n BTN_SOURCE = 1, \\\n BTN_INFO = 31, \\\n BTN_TOOLS = 75, \\\n BTN_GUIDE = 79, \\\n BTN_RETURN = 88, \\\n BTN_MENU = 26, \\\n BTN_ENTER = 104, \\\n BTN_UP = 96, \\\n BTN_DOWN = 97, \\\n BTN_LEFT = 101, \\\n BTN_RIGHT = 98, \\\n BTN_INTERNET = 147, \\\n BTN_EXIT = 45, \\\n BTN_RED = 108, \\\n BTN_GREEN = 20, \\\n BTN_YELLOW = 21, \\\n BTN_BLUE = 22, \\\n BTN_TELETEXT = 44, \\\n BTN_MEDIA = 140, \\\n BTN_CONTENT = 121, \\\n BTN_CHANNEL_LIST = 107, \\\n BTN_AD = 0, \\\n BTN_SUBTITLE = 37, \\\n BTN_FORWARD = 69, \\\n BTN_PAUSE = 74, \\\n BTN_BACKWARD = 72, \\\n BTN_RECORD = 73, \\\n BTN_PLAY = 71, \\\n BTN_STOP = 70, \\\n BTN_SLEEP = 3, \\\n BTN_PICTURE_IN_PICTURE = 32, \\\n BTN_PSIZE = 62, \\\n BTN_ENERGY = 119, \\\n BTN_SRS = 110, \\\n BTN_PMODE = 40, \\\n BTN_P_DYNAMIC = 189, \\\n BTN_P_STANDARD = 223, \\\n BTN_P_MOVIE1 = 222, \\\n BTN_P_MOVIE2 = 221, \\\n BTN_P_USER1 = 220, \\\n BTN_P_USER2 = 219, \\\n BTN_P_USER3 = 218, \\\n BTN_ASPECT_43 = 227, \\\n BTN_ASPECT_169 = 228, \\\n BTN_S_SCART1 = 132, \\\n BTN_S_SCART2 = 235, \\\n BTN_S_MODULE = 134, \\\n BTN_S_AV = 236, \\\n BTN_S_VGA = 105, \\\n BTN_S_HDMI1 = 233, \\\n BTN_S_HDMI2 = 190, \\\n BTN_S_HDMI3_DVI = 194, \\\n BTN_S_HDMI4 = 197)","def process_commands(self, commands: List[str]):","def at_cmdset_creation(self):\n self.add(Command())","def setCommand(self):\r\n self.command = CommandsDatabase(self.userid)","def getCommands(self):","def __init__(self, command_list, ):\n self.command_list = [] # all addition via function below\n self.add_command( command_list )","def _command(self, *cmd, handler=None):","def _commands(self) -> Dict[str, List[str]]:\r\n pass","def __init__(self, *commands):\n \n self.cmds = dict()\n \n for nm, attr in commands:\n self[nm] = attr","def cmd(self):","def setup_method(self, method):\n self.cmds = []","def __init__(self):\n self._cmd_list = ['use']","async def set(self, ctx):\n # [p]set <subcommand>\n\n if ctx.invoked_subcommand is None:\n await send_command_help(ctx)\n pass","def loadAllCommand(self, player):\n for eachCmd in self.commands.keys():\n player.addCommand(eachCmd, self.commands[eachCmd]())","def run(self):\n for command in CUSTOM_COMMANDS:\n self.run_custom_command(command)","def normal(self):\n self.run_command('normal')","def loadStdCommands(self, player):\n player.addCommand('spawn', self.commands['spawn']())\n player.addCommand('edit', self.commands['edit']())\n player.addCommand('search', self.commands['search']())\n player.addCommand('warp', self.commands['warp']())\n player.addCommand('addstat', self.commands['addstat']())\n player.addCommand('delstat', self.commands['delstat']())\n player.addCommand('savezone', self.commands['savezone']())\n player.addCommand('obliterate', self.commands['obliterate']())","def _send_custom_commands_after_welcome(self, conn):\n for command in self.commands:\n conn.send_raw(command)","def preloop(self):\n super(CoreCommand, self).preloop() # sets up command completion","def __init__(self, command_list: list = None) -> None:\n if command_list is None:\n command_list = implemented_commands\n for command in command_list:\n setattr(self, command.get(\"name\").replace(\" \", \"_\"), self._SingleCommand(command))","def _transform_command(self) -> None:\n self.command = None if self.command == [] else self.command","async def hockey_commands(self, ctx: commands.Context) -> None:\n pass","def before_unlock_actions(self):\n for command in self.before_unlock_commands:\n addr = command[\"address\"]\n prop = command[\"property\"]\n if len(command[\"argument\"]) == 0:\n arg = [0]\n else:\n try:\n arg = [eval(command[\"argument\"])]\n except:\n arg = [command[\"argument\"]]\n if command[\"type\"] == \"set\":\n tine.set(addr, prop, arg)\n elif command[\"type\"] == \"query\":\n tine.query(addr, prop, arg[0])","def initDefaultCommand(self):\n pass","def __command_handler__(self, commands, handler):\n message_set = self.event.text.split(u' ')\n for command in commands:\n if command in message_set:\n handler(self.event, self.vk)\n break","def __init__(self, commandBlockListenerAbstract):\n super(CraftBlockCommandSender, self).__init__()\n self.block = commandBlockListenerAbstract","def initialize_commands(self) -> None:\n\n @self.command(name=\"snr\")\n @logger(\"all\")\n async def snr(ctx, *args):\n await ctx.message.channel.send(str(indie_seq.Seq([int(k) for k in args]).f()))\n\n @self.command(name=\"oeis\")\n @logger(\"all\")\n async def oeis(ctx, *args):\n global oeis_in_progress\n if not oeis_in_progress:\n oeis_in_progress = True\n if len(args) > 0:\n await ctx.message.channel.send(indie_oeis.get_sequence_from_b_file(args[0]))\n else:\n await ctx.message.channel.send(indie_oeis.get_sequence_from_b_file(str(random.randint(1, 341962))))\n oeis_in_progress = False\n else:\n await ctx.message.add_reaction(\"❌\")\n\n @self.command(name=\"collatz\")\n @logger(\"all\")\n async def collatz(ctx, *args):\n num = int(args[0])\n inity = \"\" if len(args) < 2 else args[1]\n\n collatz_results = indie_collatz.collatz_info(num)\n if len(inity) == 1:\n if inity == \"e\":\n await ctx.message.channel.send(f\"Evenity trajectory of {num}: {collatz_results.evenity_trajectory}\")\n elif inity == \"o\":\n await ctx.message.channel.send(f\"Oddinity trajectory of {num}: {collatz_results.oddinity_trajectory}\")\n else:\n await ctx.message.channel.send(f\"Collatz trajectory of {num}: {collatz_results.collatz_trajectory}\")\n\n @self.group(name=\"pig\")\n @logger(\"pig-math\")\n async def pig(ctx, *args):\n if ctx.invoked_subcommand is None:\n await ctx.message.add_reaction(\"❌\")\n\n def get_user_id_from_mention(user_id):\n user_id = user_id.replace(\"<\", \"\")\n user_id = user_id.replace(\">\", \"\")\n user_id = user_id.replace(\"@\", \"\")\n user_id = user_id.replace(\"!\", \"\")\n return user_id\n\n # Pig Math commands\n\n @pig.command(name=\"challenge\")\n @logger(\"pig-math\")\n async def pig_challenge(ctx, *args):\n challengee = get_user_id_from_mention(args[1])\n challengee = (await self.fetch_user(challengee)).name\n if len(args) > 2:\n point_target = int(args[2])\n else:\n point_target = 100\n pig_challenge = indie_pig.PigChallenge.create_challenge(ctx.message.author.name, challengee, point_target)\n await ctx.message.channel.send(pig_challenge.status)\n\n @pig.command(name=\"accept\")\n @logger(\"pig-math\")\n async def pig_accept(ctx, *args):\n await ctx.message.channel.send(indie_pig.PigChallenge.accept_challenge(ctx.message.author.name))\n\n @pig.command(name=\"reject\")\n @logger(\"pig-math\")\n async def pig_reject(ctx, *args):\n await ctx.message.channel.send(indie_pig.PigChallenge.reject_challenge(ctx.message.author.name))\n\n @pig.command(name=\"roll\")\n @logger(\"pig-math\")\n async def pig_roll(ctx, *args):\n await ctx.message.channel.send(indie_pig.PigGame.play(ctx.message.author.name, \"roll\"))\n\n @pig.command(name=\"bank\")\n @logger(\"pig-math\")\n async def pig_bank(ctx, *args):\n await ctx.message.channel.send(indie_pig.PigGame.play(ctx.message.author.name, \"bank\"))\n\n @pig.command(name=\"score\")\n @logger(\"pig-math\")\n async def pig_score(ctx, *args):\n await ctx.message.channel.send(indie_pig.PigGame.play(ctx.message.author.name, \"score\"))\n\n @pig.command(name=\"quit\")\n @logger(\"pig-math\")\n async def pig_quit(ctx, *args):\n await ctx.message.channel.send(indie_pig.PigGame.play(ctx.message.author.name, \"quit\"))\n\n @self.command(name=\"save\")\n @logger(\"modonly\")\n async def save(ctx, *args):\n self.save_data_files()\n await ctx.message.channel.send(\"Saved.\")\n\n @self.command(name=\"balance\")\n @logger(\"all\")\n async def balance(ctx, *args):\n bals = self.data[\"balances.json\"]\n user = ctx.message.author.id\n bal = 0\n if user in bals:\n bal = bals[user]\n else:\n bals[user] = 0 \n await ctx.message.channel.send(ctx.message.author.name+\", your balance is \"+str(bal)+\".\")\n\n @self.command(name=\"credit\")\n @logger(\"modonly\")\n async def credit(ctx, *args):\n \"\"\"\n Command with credit users mentioned with first float arg detected\n \"\"\"\n users_mentioned = ctx.message.mentions\n user_mention = ctx.author.mention\n credit = 0\n for arg in args:\n try:\n credit = float(arg)\n await ctx.message.channel.send(user_mention+\", we have successfully debited as you commanded.\")\n break\n except:\n pass\n bals = self.data[\"balances.json\"]\n for user in users_mentioned:\n if user.id in bals:\n bals[user.id] += credit\n else:\n bals[user.id] = credit\n\n @self.command(name=\"debit\")\n @logger(\"modonly\")\n async def debit(ctx, *args):\n \"\"\"\n Command with credit users mentioned with first float arg detected\n \"\"\"\n users_mentioned = ctx.message.mentions\n user_mention = ctx.author.mention\n debit = 0\n for arg in args:\n try:\n debit = float(arg)\n await ctx.message.channel.send(user_mention+\", we have successfully debited as you commanded.\")\n break\n except:\n pass\n bals = self.data[\"balances.json\"]\n for user in users_mentioned:\n if user.id in bals:\n bals[user.id] -= debit\n else:\n bals[user.id] = -debit\n\n @self.command(name=\"register\")\n @logger(\"all\")\n async def register(ctx, *args):\n \"\"\"\n This command will trigger a check if the user is registered,\n if not, the bot will ask them to review the terms and conditions and accept,\n if they accept, the bot will consider them registered\n \"\"\"\n user = ctx.message.author\n user_mention = ctx.author.mention\n chan_mention = \"<#876850365730021386>\"\n \n if user in self.data[\"users.json\"]:\n await ctx.message.channel.send(user_mention+\", you are already registered. :blue_heart:\")\n else:\n self.data[\"users_asked_to_be_registered.json\"].append(user)\n await ctx.message.channel.send(user_mention+\", do you accept the \"+chan_mention+\n \" (Indie Library Terms of Service). Command .accept if you do. :blue_heart:\")\n \n @self.command(name=\"accept\")\n @logger(\"all\")\n async def accept(ctx, *args):\n \"\"\"\n This command will trigger a check if the user has asked to be registered.\n If they have, then calling this triggers adding them to registered users.\n If they have not, they will be asked to type .register first.\n \"\"\"\n user = ctx.message.author\n user_mention = \"<@\"+str(user.id)+\">\"\n\n if user in self.data[\"users_asked_to_be_registered.json\"]:\n self.data[\"users.json\"].append(user)\n self.data[\"users_asked_to_be_registered.json\"].remove(user)\n await ctx.message.channel.send(user_mention+\", you have been successfully registered. :blue_heart:\")\n else:\n await ctx.message.channel.send(user_mention+\", have not commanded .register yet. \"\n \"Please do so first. :blue_heart:\")","def custom(self, command):\n self.command.append(command)\n return self","def command():\n pass","def at_cmdset_creation(self):\n self.add(power.CmdPower())\n self.add(CmdCursedBone())\n # self.add(CmdDeathSpike())\n \"\"\"\n self.add(CmdAnchor())\n self.add(CmdBloodCloak())\n self.add(CmdBloodShield())\n self.add(CmdBloodWard())\n self.add(CmdBodyToMind())\n self.add(CmdBoneScythe())\n self.add(CmdCircleDeath())\n self.add(CmdCorpseBurst())\n self.add(CmdCorpseDrain())\n self.add(CmdCreateBloodGem())\n self.add(CmdCurseDeathLink())\n self.add(CmdDeathRain())\n self.add(CmdDeathWard())\n self.add(CmdDisease())\n self.add(CmdBoneDust())\n self.add(CmdGloom())\n self.add(CmdImbueBlood())\n self.add(CmdImbueDeath())\n self.add(CmdMassSilence())\n self.add(CmdMassSleep())\n self.add(CmdMassAnchor())\n self.add(CmdMassWeakness())\n self.add(CmdPlague())\n self.add(CmdPoison())\n self.add(CmdPoisonCloud())\n self.add(CmdSilence())\n self.add(CmdSleep())\n self.add(CmdSpectralHunter())\n self.add(CmdSummon())\n self.add(CmdSummonCorruptedMan())\n self.add(CmdSummonCursedArmy())\n self.add(CmdSummonCursedMan())\n self.add(CmdSummonReanimatedMan())\n self.add(CmdTeleport())\n self.add(CmdTeleportOther())\n self.add(CmdTransferPain())\n self.add(CmdVampiricClaw())\n self.add(CmdVampiricTouch())\n self.add(CmdWeakness())\n \"\"\"","def additional_command(self):\n pass","def __init__(self,cmds):\n\n # Since the list may include multi-line entries, first make sure that\n # they've been all broken up before passing it to magic2python\n cmdlist = map(magic2python,''.join(cmds).split('\\n'))\n self.value = '\\n'.join(cmdlist)","def loadPlayerCommands(self, player):\n player.addCommand('get', self.commands['get']())\n player.addCommand('drop', self.commands['drop']())\n player.addCommand('go', self.commands['go']())\n player.addCommand('say', self.commands['say']())\n player.addCommand('look', self.commands['look']())\n player.addCommand('quit', self.commands['quit']())\n player.addCommand('commands', self.commands['commands']())\n player.addCommand('color', self.commands['color']())","def _init_commands(self):\n\t\tself.commands = {}\n\t\tself.log.info(\"Initializing commands...\")\n\t\t# Get all the commands and iterate over them\n\t\tfor command in self.conf_commands:\n\t\t\t\n\t\t\t# Verify the necessary config elements exist at all\n\t\t\tdisabled = command.get('disabled', False) # Disabled is optional, defaults to False\n\t\t\tif(disabled == True):\n\t\t\t\tcontinue;\n\t\t\tcommand_name = command.get('name', \"unknown\").lower()\n\t\t\tdescription = command.get('description', \"\")\n\t\t\tpermission_str = command.get('permission', None)\n\t\t\taction = command.get('action', None)\n\t\t\tmin_votes = command.get('min_votes', None)\n\t\t\targs = command.get('args', None)\n\t\t\taliases = command.get('aliases', None)\n\t\t\tif(command_name is None \n\t\t\t\tor permission_str is None \n\t\t\t\tor action is None \n\t\t\t\tor min_votes is None \n\t\t\t\tor args is None):\n\t\t\t\tself.log.warn(\"Command '{}': Error, missing 'permission', 'action', 'min_votes', or 'args' elements for command \".format(command_name))\n\t\t\t\tcontinue\n\n\t\t\t# Verify the votes and permission string are valid\n\t\t\tif(min_votes < 0):\n\t\t\t\tself.log.warn(\"Command '{}': Error, min_votes cannot be less than zero for command {}\".format(command_name, min_votes))\n\t\t\t\tcontinue\n\t\t\telse:\n\t\t\t\tself.log.debug(\"Command '{}': minimum votes is {}\".format(command_name, min_votes))\n\n\t\t\ttry:\n\t\t\t\tpermission = Permission[permission_str]\n\t\t\t\tself.log.debug(\"Command '{}': permission is {}\".format(command_name, permission))\n\t\t\texcept Exception as e:\n\t\t\t\tself.log.warn(\"Command '{}': Error, permission string '{}' is invalid, must be one of: {}\".format(command_name, permission_str, Permission.__members__))\n\t\t\t\tcontinue\n\n\t\t\t# Try to get the corresponding action class\n\t\t\ttry:\n\t\t\t\tmodule = import_module(\"obs.actions.\"+action)\n\t\t\t\tclass_ = getattr(module, action)\n\t\t\t\tself.log.debug(\"Command {}: action is {}\".format(command_name, class_))\n\t\t\texcept Exception as e:\n\t\t\t\tself.log.warn(\"Command '{}': Error, no such action {} is defined. Full error: {}\".format(command_name, action, e))\n\t\t\t\tcontinue\n\n\t\t\t# Try to instantiate the action class\n\t\t\ttry:\n\t\t\t\tself.log.debug(\"Command {}: args are: {}\".format(command_name, args))\n\t\t\t\tcommand_obj = class_(self, command_name, aliases, description, permission, min_votes, args)\n\t\t\texcept ValueError as e:\n\t\t\t\tself.log.warn(e)\n\t\t\t\tcontinue\n\n\t\t\t# Add command_obj to internal reference\n\t\t\tself.commands[command_name] = command_obj\n\n\t\t\t# If there are aliases, add them too\n\t\t\t\n\t\t\tif(not aliases is None and isinstance(aliases, (list,) )):\n\t\t\t\tself.log.debug(\"Command '{}': Found aliases {}\".format(command_name, aliases))\n\t\t\t\tfor alias in aliases:\n\t\t\t\t\tself.commands[alias] = command_obj\n\t\t\telse:\n\t\t\t\tself.log.debug(\"Command '{}': No aliases\".format(command_name, aliases))\n\n\t\t# Finally after all commands have been initialized then add the help command\n\t\t#self.commands['help'] = Help(self)\n\n\t\t# Done initializing\n\t\tself.log.info(\"...Commands initialized: {}\".format(\n\t\t\t\tlist( self.commands.keys()) \n\t\t\t)\n\t\t)","def loadOlcCommands(self, player):\n player.addCommand('newzone', self.commands['newzone']())\n player.addCommand('delzone', self.commands['delzone']())\n player.addCommand('listzone', self.commands['listzone']())\n player.addCommand('newroom', self.commands['newroom']())\n player.addCommand('redit', self.commands['redit']())\n player.addCommand('delroom', self.commands['delroom']())\n player.addCommand('newportal', self.commands['newportal']())\n player.addCommand('delportal', self.commands['delportal']())\n player.addCommand('zedit', self.commands['zedit']())\n player.addCommand('pedit', self.commands['pedit']())\n player.addCommand('newtemplate', self.commands['newtemplate']())","def flush_cmds(self):\r\n if self.select_cmd is not None:\r\n self.do_cmd()","def __init__(self):\n ElixirCommand.__init__(self)","def _setup_command(self):\r\n raise NotImplementedError","def run(self, commands: list[str]):\n ...","def setup(bot):\n bot.add_cog(AdminCommands(bot))","def at_pre_cmd(self):\n pass","def __init__(self, **manager_commands):\n self.package = manager_commands","def autodefaults (self):\r\n\r\n self.defaults_from_notes(identifying_key=EMPTYCHAR,\r\n mark=EQUAL,\r\n obj=self.default_dict['commands'],\r\n entrytext=COMMANDMACROSCRIPT)","def handle_commands_preset(self,cl,addr) :\n self.curDir = ['CTF','Challenges','tempUser'+str(random.randint(100,999))]\n try :\n client = cl\n if self.curDir != [] : \n userp = \"temp-user-\"+addr[0].replace('.','-')+\"@ieeectf:~/{}$ \".format('/'.join(self.curDir))\n else :\n userp = \"temp-user-\"+addr[0].replace('.','-')+\"@ieeectf:~$ \"\n self.userp = userp.encode()\n client.send(\"\"\"\nCustom Shell Server With Limited Functionality\n\nNew User Login from {} at {}\n \\n\"\"\".format(addr[0],time.ctime()).encode())\n shellin = \"\" \n while True:\n if self.curDir != [] : \n userp = \"temp-user-\"+addr[0].replace('.','-')+\"@ieeectf:~/{}$ \".format('/'.join(self.curDir))\n else :\n userp = \"temp-user-\"+addr[0].replace('.','-')+\"@ieeectf:~$ \"\n self.userp = userp.encode()\n client.send(self.userp)\n shellin = client.recv(2048).decode().strip('\\n')\n if shellin == \"exit\" or shellin == \"exit \" or shellin ==\"exit \" or shellin ==\"exit \" :\n break\n elif shellin == \"\" :\n continue\n elif shellin.split()[0] in self.denied :\n client.send(self.err.format(shellin.split()[0]).encode())\n else :\n self.handle_extended_commands(client,addr,shellin)\n continue\n client.close()\n except Exception as E:\n print(E)\n print(Log(\"Connection with {} Terminated\".format(addr)))","def exec_init_cmd(self):\n\n sys.argv = ['-c']\n self.push(self.rc.c)","def command(self):\n raise NotImplementedError","def add_general_cmdsets(self):\n from commands.base_commands import general\n from world.map import CmdMap\n self.add(general.CmdPoke)\n self.add(CmdMap)","def __init__(self, cmd):\n # Build command + options \n self.cmd = cmd \n setattr(self, 'command', \"%s\" % (cmd))","def _register_commands(self):\n cmds = []\n cmd_help = CommandParser(\"help\", \"Show help for a command.\")\n cmd_help.add_argument(\n \"command\",\n nargs=\"*\",\n help=\"The command to get help for. Specify multiple names to get help for subcommands.\",\n )\n cmd_help.add_argument(\"-m\", \"--module\", help=\"List all commands from the given module\")\n cmd_help.add_argument(\n \"-f\",\n \"--full\",\n action=\"store_true\",\n help='Include descriptions in the \"all\" help output.',\n )\n cmds.append(cmd_help)\n\n target_mod = CommandParser()\n target_mod.add_argument(\"module\", nargs=\"+\", help=\"Target module(s)\")\n target_mod.add_argument(\n \"-p\",\n \"--protocol\",\n action=\"store_const\",\n const=\"protocol\",\n default=\"feature\",\n dest=\"mtype\",\n help=\"Target is a protocol module\",\n )\n cmd_module = CommandParser(\"module\", \"Manage and query ZeroBot modules\")\n add_subcmd = cmd_module.make_adder(metavar=\"OPERATION\", dest=\"subcmd\", required=True)\n add_subcmd(\"load\", description=\"Load a module\", parents=[target_mod])\n add_subcmd(\"reload\", description=\"Reload a module\", parents=[target_mod])\n subcmd_list = add_subcmd(\"list\", description=\"List available modules\")\n subcmd_list.add_argument(\"-l\", \"--loaded\", action=\"store_true\", help=\"Only loaded modules\")\n list_group = subcmd_list.add_mutually_exclusive_group()\n default_categories = [\"protocol\", \"feature\"]\n list_group.add_argument(\n \"-f\",\n \"--feature\",\n action=\"store_const\",\n const=[\"feature\"],\n dest=\"category\",\n default=default_categories,\n help=\"Only feature modules\",\n )\n list_group.add_argument(\n \"-p\",\n \"--protocol\",\n action=\"store_const\",\n const=[\"protocol\"],\n dest=\"category\",\n default=default_categories,\n help=\"Only protocol modules\",\n )\n add_subcmd(\"info\", description=\"Show module information\", parents=[target_mod])\n cmds.append(cmd_module)\n\n save_reload_args = CommandParser()\n save_reload_args.add_argument(\n \"config_file\",\n nargs=\"*\",\n help=\"Name of config file (without .toml extension). Omit to affect all loaded config files.\",\n )\n set_reset_args = CommandParser()\n set_reset_args.add_argument(\"config_file\", help=\"Name of config file (without .toml extension)\")\n cmd_config = CommandParser(\"config\", \"Manage configuration\")\n add_subcmd = cmd_config.make_adder(metavar=\"OPERATION\", dest=\"subcmd\", required=True)\n add_subcmd(\"save\", description=\"Save config files to disk\", parents=[save_reload_args])\n subcmd_savenew = add_subcmd(\"savenew\", description=\"Save config file to a new path\")\n subcmd_savenew.add_argument(\"config_file\", help=\"Name of config file (without .toml extension)\")\n subcmd_savenew.add_argument(\"new_path\", help=\"The path to save the config file to\")\n add_subcmd(\n \"reload\",\n description=\"Reload config files from disk\",\n parents=[save_reload_args],\n )\n subcmd_set = add_subcmd(\"set\", description=\"Modify config settings\", parents=[set_reset_args])\n subcmd_set.add_argument(\n \"key_path\",\n help=\"The config key to set. Subkeys are separated by dots, e.g. 'Core.Backup.Filename'\",\n )\n subcmd_set.add_argument(\"value\", nargs=\"?\", help=\"The new value. Omit to show the current value.\")\n subcmd_reset = add_subcmd(\n \"reset\",\n description=\"Reset config settings to last loaded value\",\n parents=[set_reset_args],\n )\n subcmd_reset.add_argument(\n \"key_path\",\n nargs=\"?\",\n help=(\n \"The config key to set. Subkeys are separated by dots, \"\n \"e.g. 'Core.Backup.Filename'. If omitted, the entire \"\n \"config will be reset.\"\n ),\n )\n subcmd_reset.add_argument(\n \"-d\",\n \"--default\",\n action=\"store_true\",\n help=\"Set the key to its default value instead. Effectively unsets a config key.\",\n )\n cmds.append(cmd_config)\n\n cmd_version = CommandParser(\"version\", \"Show version information\")\n cmds.append(cmd_version)\n\n cmd_restart = CommandParser(\"restart\", \"Restart ZeroBot.\")\n cmd_restart.add_argument(\"msg\", nargs=\"*\", help=\"Message sent to protocol modules as a reason\")\n cmds.append(cmd_restart)\n\n cmd_quit = CommandParser(\"quit\", \"Shut down ZeroBot.\")\n cmd_quit.add_argument(\"msg\", nargs=\"*\", help=\"Message sent to protocol modules as a reason\")\n cmds.append(cmd_quit)\n\n cmd_wait = CommandParser(\"wait\", \"Execute a command after a delay\")\n cmd_wait.add_argument(\n \"delay\",\n help=\"Amount of time to delay. Accepts the following modifier suffixes: 'ms', 's' (default), 'm', 'h'.\",\n )\n cmd_wait.add_argument(\"command\", help=\"Command to delay\")\n cmd_wait.add_argument(\"args\", nargs=argparse.REMAINDER, help=\"Command arguments\")\n cmds.append(cmd_wait)\n\n cmd_cancel = CommandParser(\"cancel\", \"Cancel a waiting command\")\n cancel_group = cmd_cancel.add_mutually_exclusive_group()\n cancel_group.add_argument(\"id\", type=int, nargs=\"?\", help=\"The ID of a waiting command\")\n cancel_group.add_argument(\"-l\", \"--list\", action=\"store_true\", help=\"List currently waiting commands\")\n cmds.append(cmd_cancel)\n\n cmd_backup = CommandParser(\"backup\", \"Create a database backup\")\n cmd_backup.add_argument(\"name\", type=Path, help=\"Backup filename\")\n cmds.append(cmd_backup)\n\n self.command_register(\"core\", *cmds)","def add_command(self, name, fct):\r\n self.cmds[name] = fct","async def adding_command_list(self):\n command_aliases=['anime','fun','mod','nekogif'] #This includes the aliases and the cog names\n #NOTE: fun command added\n for i in self.bot.commands:\n self.commands.append(i.name)\n \n for i in command_aliases:\n self.commands.append(i)","def set_command(cmd_list):\n global last_command\n last_command = ' '.join(cmd_list)","def check_commands(self):\n pass","def start(self) -> None:\n\n os.system(\"cls\" if os.name == \"nt\" else \"clear\")\n print(\"Bienvenido al traductor TbSET. Para salir presiona Ctrl-D.\\n\")\n\n while True:\n try:\n typed = self.session.prompt(\n \".TbSET > \",\n completer=self.commands,\n validator=DummyValidator(),\n complete_while_typing=True\n )\n except KeyboardInterrupt:\n continue\n except EOFError:\n break\n else:\n self._command_processor(typed)\n\n print(\"Bye!\\n\")","def main_command_loop(self) -> None:\n\n self.commands.pop(0)\n for command in self.commands:\n if \"--static\" == command:\n self.update_static_files()\n elif \"--temp\" == command:\n self.update_templates()\n elif \"--app\" == command:\n self.update_app()\n elif \"--settings\" == command:\n self.update_settings()\n elif \"--mysql-files\" == command:\n self.update_mysql_files()\n elif \"--help\" == command or \"-h\" == command:\n self.write_help_message()","def cmd(self, cmd):\n\n self._cmd = cmd","def command(self, cmd):\n self.lmp.command(cmd)","def init_command_objects(self):\n super().init_command_objects()\n device_data = DeviceData.get_instance()\n\n args = (device_data, self.state_model, self.logger)\n\n self.register_command_object(\"SetStowMode\", SetStowMode(*args))\n self.register_command_object(\n \"SetStandbyLPMode\", SetStandbyLPMode(*args)\n )\n self.register_command_object(\"SetOperateMode\", SetOperateMode(*args))\n self.register_command_object(\"Scan\", Scan(*args))\n self.register_command_object(\"EndScan\", EndScan(*args))\n self.register_command_object(\"Configure\", Configure(*args))\n self.register_command_object(\"StartCapture\", StartCapture(*args))\n self.register_command_object(\"StopCapture\", StopCapture(*args))\n self.register_command_object(\n \"SetStandbyFPMode\", SetStandbyFPMode(*args)\n )\n self.register_command_object(\"Slew\", Slew(*args))\n self.register_command_object(\"Track\", Track(*args))\n self.register_command_object(\"StopTrack\", StopTrack(*args))\n self.register_command_object(\"Abort\", Abort(*args))\n self.register_command_object(\"Restart\", Restart(*args))\n self.register_command_object(\"ObsReset\", ObsReset(*args))","def add_command(self, command):\n self.command.extend(command)","def run_cmd(self):\r\n self.run = True","def command(self, *commands):\n def decorator(function):\n for command in commands:\n self.functions[command] = function\n return function\n return decorator","def post_run_cmds(self, host: str) -> tp.List[types.ShellCmdSpec]:\n raise NotImplementedError","def postloop(self):\n super(CoreCommand, self).postloop() # Clean up command completion","def parse(self, commands):\n raise NotImplementedError()","def build_commands(self):\r\n for tag in self.bmark.tags.keys():\r\n # if this tag is a command then return true\r\n if tag in COMMANDLIST:\r\n self.commands.append(tag)","def command(self, command):\n\n self._command = command","def command(self, command):\n\n self._command = command","def command(self, command):\n\n self._command = command","def do_command(self, args):\n pass","def setup(bot):\n new_cog = Commands(bot)\n bot.add_cog(new_cog)","def default_supported_commands(self, commands):\n self.state.default_supported_commands(commands)","def __init__(self, vanillaCommand, usage):\n super(VanillaCommandWrapper, self).__init__(vanillaCommand.b())\n # PAIL: rename\n self.vanillaCommand = vanillaCommand\n self.setPermission(\"minecraft.command.\" + vanillaCommand.getCommand())","def command(command_list):\n def add_attribute(func):\n if not hasattr(func, \"command\"):\n func.command = []\n func.command.append(command_list)\n return func\n return add_attribute","def __set_cmd_parse(self, _cmd: dict):\n for sitem in _cmd:\n #\n # alle sets durch\n # {\"set\":[{\"alert\":\"alert-04\",\"enable\":\"true\", ...}, {\"alert\":\"alert-03\",\"enable\":\"true\", ...}]}\n #\n alert_name = sitem['alert']\n if alert_name not in self.config:\n # da ist ein NEUNER Alarm angekommen == NEW\n self.log.debug(\"found NEW alert {} with set commands\".format(alert_name))\n _alert = ConfigFileObj.get_empty_configitem()\n ConfigFileObj.config_lock.acquire()\n self.config[alert_name] = _alert\n ConfigFileObj.config_lock.release()\n else:\n # EDIT Alarm\n self.log.debug(\"found alert {} with set commands\".format(alert_name))\n #\n # nun alle Eigenschaften durch\n #\n ConfigFileObj.config_lock.acquire()\n for set_command in sitem:\n if set_command == 'alert':\n continue\n # eine Einstellung schreiben\n self.log.debug(\"set property {} to {} for alert {}\".format(set_command, sitem[set_command], alert_name))\n if sitem[set_command] == 'null':\n self.config[alert_name][set_command] = \" \"\n else:\n self.config[alert_name][set_command] = sitem[set_command]\n ConfigFileObj.config_lock.release()\n # ende der kommandos per alarm\n # ende der alarme\n # es scheint alles geklappt zu haben\n # noch schnell den aktuellen hashwert berechnen (besser als version)\n self.config_hash['version'] = self.__get_hashstr(self.config)\n self.log.debug(\"set command for alert(s) successful!\")\n # callback, wenn erforderlich\n if self.on_config_change is not None:\n self.log.debug(\"call on_config_change...\")\n self.on_config_change(int(time()))\n return json.dumps({'ok': 'sucsessful commands done'}).encode(encoding='utf-8')\n # ENDE __set_cmd_parse","def setup_commands(bot):\n # Reset the bot's command setup\n bot.reset_commands()\n # Load enabled mods\n for mod in bot.enabled_mods:\n try:\n full = 'mod_%s' % mod\n m = getattr(__import__('mods.%s' % full), full)\n except Exception:\n bot.log(ERROR, 'Importing the %s mod failed!' % mod)\n sys.excepthook(*sys.exc_info())\n continue\n\n try:\n bot.installed_mods[mod] = m\n # Check for a 404 handler, and replace the current one if there is\n p404 = getattr(m, 'handle_404', None)\n if p404:\n bot.cb_404 = p404\n\n # Check for a setup function, and run it if there is\n setup = getattr(m, 'setup', None)\n if setup:\n setup(bot)\n\n # Required command bank\n for cmd in m.command_bank:\n # Get the actual function\n func = getattr(m, cmd)\n # Get the args for the command\n data = m.command_bank[cmd]\n # If data[0] is true, mod_help will recognize this command\n if data[0]:\n bot.help_db[data[1]] = parse_help(func)\n # Get the main name and aliases inserted\n for alias in data[1:]:\n bot.command_db[alias] = func\n\n # Helper function for optional nameless multiples\n def add_optional(olist, name):\n olist.extend(getattr(m, f) for f in getattr(m, name, ()))\n\n # Optional filters are loaded and added to the list\n add_optional(bot.filters, 'filters')\n\n # Ditto for time-cycle callbacks\n add_optional(bot.periodic_cbs, 'periodic')\n\n # Handlers are the same, but structured as a dict with\n # \"type\": \"single function-name\" items\n handlers = getattr(m, 'handlers', None)\n if handlers:\n for cbtype in handlers:\n bot.handlers[cbtype].append(getattr(m, handlers[cbtype]))\n\n # Register any requirements\n # NOTE: By putting this at the end, we avoid the possibility of\n # getting fake requires.\n reqs = getattr(m, 'requires', None)\n if reqs:\n bot.required_mods.update(reqs)\n except Exception:\n bot.log(ERROR, 'Unable to install the %s mod!' % mod)\n del bot.installed_mods[mod]\n sys.excepthook(*sys.exc_info())\n\n missing = bot.required_mods - set(bot.installed_mods)\n if missing:\n raise MissingRequirementsError(missing)\n\n # And now for the post-install triggers.\n for mod, m in bot.installed_mods.items():\n post = getattr(m, 'post_prepare', None)\n if post:\n try:\n post(bot)\n except Exception:\n bot.log(ERROR, 'Unable to post-prepare the %s mod!' % mod)\n sys.excepthook(*sys.exc_info())","def cmd(self, data, enable):\n pass","def sys_commands(self, obj, phase=''):\n commands = self.settings.get(phase)\n if commands and isinstance(commands, list):\n for command in commands:\n if isinstance(command, list):\n # Find list items that match the string after \"att_\",\n # these are names names of attribute in the calling class\n for key, item in enumerate(command):\n if item[:4] == 'att_':\n attribute = item[4:]\n try:\n command[key] = getattr(obj, attribute)\n except AttributeError:\n continue\n try:\n popen = subprocess.Popen(command, stdout=subprocess.PIPE,\n stderr=subprocess.PIPE)\n except OSError as error:\n msg = \"Cannot run {0} the command doesn't exist,\\n\".format(command.pop(0))\n msg += \"Error: {1}\".format(error.strerror)\n print msg\n results = popen.communicate()\n if results[1]:\n print \"Running {0}, \\n Error: {1}\".format(command, results[1])\n else:\n continue","def runCommand(self): \\\n # pylint: disable=no-self-use","def modulecmds():\n\n class Commands:\n @staticmethod\n def setenv(key, val=None):\n val = val or key\n return \"setenv({0!r}, {1!r})\\n\".format(key, val)\n\n @staticmethod\n def unsetenv(key):\n return \"unsetenv({0!r})\\n\".format(key)\n\n @staticmethod\n def load(x):\n return \"load({0!r})\\n\".format(x)\n\n @staticmethod\n def load_first(*x):\n x = \",\".join(\"{0!r}\".format(_) for _ in x)\n return \"load_first({0})\\n\".format(x)\n\n @staticmethod\n def unload(x):\n return \"unload({0!r})\\n\".format(x)\n\n @staticmethod\n def prepend_path(key, val=None, sep=os.pathsep):\n val = val or key\n return \"prepend_path({0!r},{1!r},sep={2!r})\\n\".format(key, val, sep)\n\n @staticmethod\n def append_path(key, val=None, sep=os.pathsep):\n val = val or key\n return \"append_path({0!r},{1!r},sep={2!r})\\n\".format(key, val, sep)\n\n @staticmethod\n def remove_path(key, val=None, sep=os.pathsep):\n val = val or key\n return \"remove_path({0!r},{1!r},sep={2!r})\\n\".format(key, val, sep)\n\n @staticmethod\n def set_alias(key, val):\n return \"set_alias({0!r},{1!r})\\n\".format(key, val)\n\n @staticmethod\n def unset_alias(key):\n return \"unset_alias({0!r})\\n\".format(key)\n\n @staticmethod\n def set_shell_function(key, val):\n return \"set_shell_function({0!r},{1!r})\\n\".format(key, val)\n\n @staticmethod\n def unset_shell_function(key):\n return \"unset_shell_function({0!r})\\n\".format(key)\n\n @staticmethod\n def use(path):\n return \"use({0!r})\\n\".format(path)\n\n @staticmethod\n def unuse(path):\n return \"unuse({0!r})\\n\".format(path)\n\n @staticmethod\n def swap(a, b):\n return \"swap({0!r}, {1!r})\\n\".format(a, b)\n\n @staticmethod\n def family(x):\n return \"family({0!r})\\n\".format(x)\n\n @staticmethod\n def conflict(x):\n return \"conflict({0!r})\\n\".format(x)\n\n @staticmethod\n def prereq(x):\n return \"prereq({0!r})\\n\".format(x)\n\n @staticmethod\n def prereq_any(*x):\n x = \",\".join(\"{0!r}\".format(_) for _ in x)\n return \"prereq_any({0})\\n\".format(x)\n\n @staticmethod\n def source(f):\n return \"source({0!r})\\n\".format(f)\n\n @staticmethod\n def help(x):\n return \"help({0!r})\\n\".format(x)\n\n @staticmethod\n def whatis(x):\n return \"whatis({0!r})\\n\".format(x)\n\n @staticmethod\n def isloaded(x):\n return \"is_loaded({0!r})\\n\".format(x)\n\n return Commands()","def init_command_objects(self):\n super().init_command_objects()\n device_args = (self, self.state_model, self.logger)\n # resource_args = (self.resource_manager, self.state_model, self.logger) \n # only use resource_args if we want to have separate resource_manager object\n\n self.register_command_object(\n \"Configure\",\n self.ConfigureCommand(*device_args)\n ) \n self.register_command_object(\n \"AddReceptors\",\n self.AddReceptorsCommand(*device_args)\n )\n self.register_command_object(\n \"RemoveReceptors\",\n self.RemoveReceptorsCommand(*device_args)\n )\n self.register_command_object(\n \"RemoveAllReceptors\",\n self.RemoveAllReceptorsCommand(*device_args)\n )\n self.register_command_object(\n \"ConfigureScan\",\n self.ConfigureScanCommand(*device_args)\n )\n self.register_command_object(\n \"StartScan\",\n self.ScanCommand(*device_args)\n )\n self.register_command_object(\n \"GoToIdle\",\n self.GoToIdleCommand(*device_args)\n )","def control_center(self):\r\n c_command = input(\"Enter your command : \")\r\n self.curs.executescript(c_command)\r\n self.conn.commit()","def update_commands(self, commands_str):\n commands = dict(parse_qsl(commands_str, keep_blank_values=True))\n _if = commands.get(\"if\", self._if)\n if _if:\n self._if = Condition(_if)\n self._set_int(commands, \"max_length\")\n self._set_int(commands, \"min_length\")\n self.color = expand_color(commands.get(\"color\"), passthrough=True, block=self.color)\n\n self.not_zero = \"not_zero\" in commands or self.not_zero\n self.show = \"show\" in commands or self.show\n self.soft = \"soft\" in commands or self.soft","def set_command(self, command):\n self.player_command = command\n return None","def ConsoleRun(self, command, sender):\n pass","def __call__(self, cmd):\n cmdname = cmd.name\n self.commands[cmdname] = self._prepare_cmd(cmd)\n return cmd","async def setheist(self, ctx):\r\n\r\n pass","def cmd(self, command):\n self._commands.append(command)","def _execute_impl(self, commands):\n raise NotImplementedError(\"abstract method\")"],"string":"[\n \"def commands(self, commands):\\n\\n self._commands = commands\",\n \"def commands():\",\n \"def commands():\\n pass\",\n \"def commands():\\n pass\",\n \"def commands():\\n pass\",\n \"def commands():\\n pass\",\n \"def at_cmdset_creation(self):\\n super().at_cmdset_creation()\\n #\\n # any commands you add below will overload the default ones.\\n #\",\n \"def at_cmdset_creation(self):\\n super().at_cmdset_creation()\\n #\\n # any commands you add below will overload the default ones.\\n #\",\n \"def silkscreen_commands(self, commands):\\n self.pcb_layers[\\\"silkscreen\\\"].commands = commands\",\n \"def at_cmdset_creation(self):\\n self.add(default_cmds.CmdLook())\\n self.add(default_cmds.CmdSay())\",\n \"def set_commands(self, commands, append=False):\\n if append:\\n self.commands.extend(commands)\\n else:\\n self.commands = commands\",\n \"def __init__(self, commands=None):\\n self.commands = {}\\n self.context = None\",\n \"def set_command_list(self):\\n self.commands = dict( \\\\\\n BTN_POWER_OFF = 2, \\\\\\n BTN_TV = 27, \\\\\\n BTN_1 = 4, \\\\\\n BTN_2 = 5, \\\\\\n BTN_3 = 6, \\\\\\n BTN_4 = 8, \\\\\\n BTN_5 = 9, \\\\\\n BTN_6 = 10, \\\\\\n BTN_7 = 12, \\\\\\n BTN_8 = 13, \\\\\\n BTN_9 = 14, \\\\\\n BTN_0 = 17, \\\\\\n BTN_FAVOURITE_CHANNEL = 68, \\\\\\n BTN_PREVIOUS_CHANNEL = 19, \\\\\\n BTN_VOLUME_UP = 7, \\\\\\n BTN_VOLUME_DOWN = 11, \\\\\\n BTN_CHANNEL_UP = 18, \\\\\\n BTN_CHANNEL_DOWN = 16, \\\\\\n BTN_MUTE = 15, \\\\\\n BTN_SOURCE = 1, \\\\\\n BTN_INFO = 31, \\\\\\n BTN_TOOLS = 75, \\\\\\n BTN_GUIDE = 79, \\\\\\n BTN_RETURN = 88, \\\\\\n BTN_MENU = 26, \\\\\\n BTN_ENTER = 104, \\\\\\n BTN_UP = 96, \\\\\\n BTN_DOWN = 97, \\\\\\n BTN_LEFT = 101, \\\\\\n BTN_RIGHT = 98, \\\\\\n BTN_INTERNET = 147, \\\\\\n BTN_EXIT = 45, \\\\\\n BTN_RED = 108, \\\\\\n BTN_GREEN = 20, \\\\\\n BTN_YELLOW = 21, \\\\\\n BTN_BLUE = 22, \\\\\\n BTN_TELETEXT = 44, \\\\\\n BTN_MEDIA = 140, \\\\\\n BTN_CONTENT = 121, \\\\\\n BTN_CHANNEL_LIST = 107, \\\\\\n BTN_AD = 0, \\\\\\n BTN_SUBTITLE = 37, \\\\\\n BTN_FORWARD = 69, \\\\\\n BTN_PAUSE = 74, \\\\\\n BTN_BACKWARD = 72, \\\\\\n BTN_RECORD = 73, \\\\\\n BTN_PLAY = 71, \\\\\\n BTN_STOP = 70, \\\\\\n BTN_SLEEP = 3, \\\\\\n BTN_PICTURE_IN_PICTURE = 32, \\\\\\n BTN_PSIZE = 62, \\\\\\n BTN_ENERGY = 119, \\\\\\n BTN_SRS = 110, \\\\\\n BTN_PMODE = 40, \\\\\\n BTN_P_DYNAMIC = 189, \\\\\\n BTN_P_STANDARD = 223, \\\\\\n BTN_P_MOVIE1 = 222, \\\\\\n BTN_P_MOVIE2 = 221, \\\\\\n BTN_P_USER1 = 220, \\\\\\n BTN_P_USER2 = 219, \\\\\\n BTN_P_USER3 = 218, \\\\\\n BTN_ASPECT_43 = 227, \\\\\\n BTN_ASPECT_169 = 228, \\\\\\n BTN_S_SCART1 = 132, \\\\\\n BTN_S_SCART2 = 235, \\\\\\n BTN_S_MODULE = 134, \\\\\\n BTN_S_AV = 236, \\\\\\n BTN_S_VGA = 105, \\\\\\n BTN_S_HDMI1 = 233, \\\\\\n BTN_S_HDMI2 = 190, \\\\\\n BTN_S_HDMI3_DVI = 194, \\\\\\n BTN_S_HDMI4 = 197)\",\n \"def process_commands(self, commands: List[str]):\",\n \"def at_cmdset_creation(self):\\n self.add(Command())\",\n \"def setCommand(self):\\r\\n self.command = CommandsDatabase(self.userid)\",\n \"def getCommands(self):\",\n \"def __init__(self, command_list, ):\\n self.command_list = [] # all addition via function below\\n self.add_command( command_list )\",\n \"def _command(self, *cmd, handler=None):\",\n \"def _commands(self) -> Dict[str, List[str]]:\\r\\n pass\",\n \"def __init__(self, *commands):\\n \\n self.cmds = dict()\\n \\n for nm, attr in commands:\\n self[nm] = attr\",\n \"def cmd(self):\",\n \"def setup_method(self, method):\\n self.cmds = []\",\n \"def __init__(self):\\n self._cmd_list = ['use']\",\n \"async def set(self, ctx):\\n # [p]set <subcommand>\\n\\n if ctx.invoked_subcommand is None:\\n await send_command_help(ctx)\\n pass\",\n \"def loadAllCommand(self, player):\\n for eachCmd in self.commands.keys():\\n player.addCommand(eachCmd, self.commands[eachCmd]())\",\n \"def run(self):\\n for command in CUSTOM_COMMANDS:\\n self.run_custom_command(command)\",\n \"def normal(self):\\n self.run_command('normal')\",\n \"def loadStdCommands(self, player):\\n player.addCommand('spawn', self.commands['spawn']())\\n player.addCommand('edit', self.commands['edit']())\\n player.addCommand('search', self.commands['search']())\\n player.addCommand('warp', self.commands['warp']())\\n player.addCommand('addstat', self.commands['addstat']())\\n player.addCommand('delstat', self.commands['delstat']())\\n player.addCommand('savezone', self.commands['savezone']())\\n player.addCommand('obliterate', self.commands['obliterate']())\",\n \"def _send_custom_commands_after_welcome(self, conn):\\n for command in self.commands:\\n conn.send_raw(command)\",\n \"def preloop(self):\\n super(CoreCommand, self).preloop() # sets up command completion\",\n \"def __init__(self, command_list: list = None) -> None:\\n if command_list is None:\\n command_list = implemented_commands\\n for command in command_list:\\n setattr(self, command.get(\\\"name\\\").replace(\\\" \\\", \\\"_\\\"), self._SingleCommand(command))\",\n \"def _transform_command(self) -> None:\\n self.command = None if self.command == [] else self.command\",\n \"async def hockey_commands(self, ctx: commands.Context) -> None:\\n pass\",\n \"def before_unlock_actions(self):\\n for command in self.before_unlock_commands:\\n addr = command[\\\"address\\\"]\\n prop = command[\\\"property\\\"]\\n if len(command[\\\"argument\\\"]) == 0:\\n arg = [0]\\n else:\\n try:\\n arg = [eval(command[\\\"argument\\\"])]\\n except:\\n arg = [command[\\\"argument\\\"]]\\n if command[\\\"type\\\"] == \\\"set\\\":\\n tine.set(addr, prop, arg)\\n elif command[\\\"type\\\"] == \\\"query\\\":\\n tine.query(addr, prop, arg[0])\",\n \"def initDefaultCommand(self):\\n pass\",\n \"def __command_handler__(self, commands, handler):\\n message_set = self.event.text.split(u' ')\\n for command in commands:\\n if command in message_set:\\n handler(self.event, self.vk)\\n break\",\n \"def __init__(self, commandBlockListenerAbstract):\\n super(CraftBlockCommandSender, self).__init__()\\n self.block = commandBlockListenerAbstract\",\n \"def initialize_commands(self) -> None:\\n\\n @self.command(name=\\\"snr\\\")\\n @logger(\\\"all\\\")\\n async def snr(ctx, *args):\\n await ctx.message.channel.send(str(indie_seq.Seq([int(k) for k in args]).f()))\\n\\n @self.command(name=\\\"oeis\\\")\\n @logger(\\\"all\\\")\\n async def oeis(ctx, *args):\\n global oeis_in_progress\\n if not oeis_in_progress:\\n oeis_in_progress = True\\n if len(args) > 0:\\n await ctx.message.channel.send(indie_oeis.get_sequence_from_b_file(args[0]))\\n else:\\n await ctx.message.channel.send(indie_oeis.get_sequence_from_b_file(str(random.randint(1, 341962))))\\n oeis_in_progress = False\\n else:\\n await ctx.message.add_reaction(\\\"❌\\\")\\n\\n @self.command(name=\\\"collatz\\\")\\n @logger(\\\"all\\\")\\n async def collatz(ctx, *args):\\n num = int(args[0])\\n inity = \\\"\\\" if len(args) < 2 else args[1]\\n\\n collatz_results = indie_collatz.collatz_info(num)\\n if len(inity) == 1:\\n if inity == \\\"e\\\":\\n await ctx.message.channel.send(f\\\"Evenity trajectory of {num}: {collatz_results.evenity_trajectory}\\\")\\n elif inity == \\\"o\\\":\\n await ctx.message.channel.send(f\\\"Oddinity trajectory of {num}: {collatz_results.oddinity_trajectory}\\\")\\n else:\\n await ctx.message.channel.send(f\\\"Collatz trajectory of {num}: {collatz_results.collatz_trajectory}\\\")\\n\\n @self.group(name=\\\"pig\\\")\\n @logger(\\\"pig-math\\\")\\n async def pig(ctx, *args):\\n if ctx.invoked_subcommand is None:\\n await ctx.message.add_reaction(\\\"❌\\\")\\n\\n def get_user_id_from_mention(user_id):\\n user_id = user_id.replace(\\\"<\\\", \\\"\\\")\\n user_id = user_id.replace(\\\">\\\", \\\"\\\")\\n user_id = user_id.replace(\\\"@\\\", \\\"\\\")\\n user_id = user_id.replace(\\\"!\\\", \\\"\\\")\\n return user_id\\n\\n # Pig Math commands\\n\\n @pig.command(name=\\\"challenge\\\")\\n @logger(\\\"pig-math\\\")\\n async def pig_challenge(ctx, *args):\\n challengee = get_user_id_from_mention(args[1])\\n challengee = (await self.fetch_user(challengee)).name\\n if len(args) > 2:\\n point_target = int(args[2])\\n else:\\n point_target = 100\\n pig_challenge = indie_pig.PigChallenge.create_challenge(ctx.message.author.name, challengee, point_target)\\n await ctx.message.channel.send(pig_challenge.status)\\n\\n @pig.command(name=\\\"accept\\\")\\n @logger(\\\"pig-math\\\")\\n async def pig_accept(ctx, *args):\\n await ctx.message.channel.send(indie_pig.PigChallenge.accept_challenge(ctx.message.author.name))\\n\\n @pig.command(name=\\\"reject\\\")\\n @logger(\\\"pig-math\\\")\\n async def pig_reject(ctx, *args):\\n await ctx.message.channel.send(indie_pig.PigChallenge.reject_challenge(ctx.message.author.name))\\n\\n @pig.command(name=\\\"roll\\\")\\n @logger(\\\"pig-math\\\")\\n async def pig_roll(ctx, *args):\\n await ctx.message.channel.send(indie_pig.PigGame.play(ctx.message.author.name, \\\"roll\\\"))\\n\\n @pig.command(name=\\\"bank\\\")\\n @logger(\\\"pig-math\\\")\\n async def pig_bank(ctx, *args):\\n await ctx.message.channel.send(indie_pig.PigGame.play(ctx.message.author.name, \\\"bank\\\"))\\n\\n @pig.command(name=\\\"score\\\")\\n @logger(\\\"pig-math\\\")\\n async def pig_score(ctx, *args):\\n await ctx.message.channel.send(indie_pig.PigGame.play(ctx.message.author.name, \\\"score\\\"))\\n\\n @pig.command(name=\\\"quit\\\")\\n @logger(\\\"pig-math\\\")\\n async def pig_quit(ctx, *args):\\n await ctx.message.channel.send(indie_pig.PigGame.play(ctx.message.author.name, \\\"quit\\\"))\\n\\n @self.command(name=\\\"save\\\")\\n @logger(\\\"modonly\\\")\\n async def save(ctx, *args):\\n self.save_data_files()\\n await ctx.message.channel.send(\\\"Saved.\\\")\\n\\n @self.command(name=\\\"balance\\\")\\n @logger(\\\"all\\\")\\n async def balance(ctx, *args):\\n bals = self.data[\\\"balances.json\\\"]\\n user = ctx.message.author.id\\n bal = 0\\n if user in bals:\\n bal = bals[user]\\n else:\\n bals[user] = 0 \\n await ctx.message.channel.send(ctx.message.author.name+\\\", your balance is \\\"+str(bal)+\\\".\\\")\\n\\n @self.command(name=\\\"credit\\\")\\n @logger(\\\"modonly\\\")\\n async def credit(ctx, *args):\\n \\\"\\\"\\\"\\n Command with credit users mentioned with first float arg detected\\n \\\"\\\"\\\"\\n users_mentioned = ctx.message.mentions\\n user_mention = ctx.author.mention\\n credit = 0\\n for arg in args:\\n try:\\n credit = float(arg)\\n await ctx.message.channel.send(user_mention+\\\", we have successfully debited as you commanded.\\\")\\n break\\n except:\\n pass\\n bals = self.data[\\\"balances.json\\\"]\\n for user in users_mentioned:\\n if user.id in bals:\\n bals[user.id] += credit\\n else:\\n bals[user.id] = credit\\n\\n @self.command(name=\\\"debit\\\")\\n @logger(\\\"modonly\\\")\\n async def debit(ctx, *args):\\n \\\"\\\"\\\"\\n Command with credit users mentioned with first float arg detected\\n \\\"\\\"\\\"\\n users_mentioned = ctx.message.mentions\\n user_mention = ctx.author.mention\\n debit = 0\\n for arg in args:\\n try:\\n debit = float(arg)\\n await ctx.message.channel.send(user_mention+\\\", we have successfully debited as you commanded.\\\")\\n break\\n except:\\n pass\\n bals = self.data[\\\"balances.json\\\"]\\n for user in users_mentioned:\\n if user.id in bals:\\n bals[user.id] -= debit\\n else:\\n bals[user.id] = -debit\\n\\n @self.command(name=\\\"register\\\")\\n @logger(\\\"all\\\")\\n async def register(ctx, *args):\\n \\\"\\\"\\\"\\n This command will trigger a check if the user is registered,\\n if not, the bot will ask them to review the terms and conditions and accept,\\n if they accept, the bot will consider them registered\\n \\\"\\\"\\\"\\n user = ctx.message.author\\n user_mention = ctx.author.mention\\n chan_mention = \\\"<#876850365730021386>\\\"\\n \\n if user in self.data[\\\"users.json\\\"]:\\n await ctx.message.channel.send(user_mention+\\\", you are already registered. :blue_heart:\\\")\\n else:\\n self.data[\\\"users_asked_to_be_registered.json\\\"].append(user)\\n await ctx.message.channel.send(user_mention+\\\", do you accept the \\\"+chan_mention+\\n \\\" (Indie Library Terms of Service). Command .accept if you do. :blue_heart:\\\")\\n \\n @self.command(name=\\\"accept\\\")\\n @logger(\\\"all\\\")\\n async def accept(ctx, *args):\\n \\\"\\\"\\\"\\n This command will trigger a check if the user has asked to be registered.\\n If they have, then calling this triggers adding them to registered users.\\n If they have not, they will be asked to type .register first.\\n \\\"\\\"\\\"\\n user = ctx.message.author\\n user_mention = \\\"<@\\\"+str(user.id)+\\\">\\\"\\n\\n if user in self.data[\\\"users_asked_to_be_registered.json\\\"]:\\n self.data[\\\"users.json\\\"].append(user)\\n self.data[\\\"users_asked_to_be_registered.json\\\"].remove(user)\\n await ctx.message.channel.send(user_mention+\\\", you have been successfully registered. :blue_heart:\\\")\\n else:\\n await ctx.message.channel.send(user_mention+\\\", have not commanded .register yet. \\\"\\n \\\"Please do so first. :blue_heart:\\\")\",\n \"def custom(self, command):\\n self.command.append(command)\\n return self\",\n \"def command():\\n pass\",\n \"def at_cmdset_creation(self):\\n self.add(power.CmdPower())\\n self.add(CmdCursedBone())\\n # self.add(CmdDeathSpike())\\n \\\"\\\"\\\"\\n self.add(CmdAnchor())\\n self.add(CmdBloodCloak())\\n self.add(CmdBloodShield())\\n self.add(CmdBloodWard())\\n self.add(CmdBodyToMind())\\n self.add(CmdBoneScythe())\\n self.add(CmdCircleDeath())\\n self.add(CmdCorpseBurst())\\n self.add(CmdCorpseDrain())\\n self.add(CmdCreateBloodGem())\\n self.add(CmdCurseDeathLink())\\n self.add(CmdDeathRain())\\n self.add(CmdDeathWard())\\n self.add(CmdDisease())\\n self.add(CmdBoneDust())\\n self.add(CmdGloom())\\n self.add(CmdImbueBlood())\\n self.add(CmdImbueDeath())\\n self.add(CmdMassSilence())\\n self.add(CmdMassSleep())\\n self.add(CmdMassAnchor())\\n self.add(CmdMassWeakness())\\n self.add(CmdPlague())\\n self.add(CmdPoison())\\n self.add(CmdPoisonCloud())\\n self.add(CmdSilence())\\n self.add(CmdSleep())\\n self.add(CmdSpectralHunter())\\n self.add(CmdSummon())\\n self.add(CmdSummonCorruptedMan())\\n self.add(CmdSummonCursedArmy())\\n self.add(CmdSummonCursedMan())\\n self.add(CmdSummonReanimatedMan())\\n self.add(CmdTeleport())\\n self.add(CmdTeleportOther())\\n self.add(CmdTransferPain())\\n self.add(CmdVampiricClaw())\\n self.add(CmdVampiricTouch())\\n self.add(CmdWeakness())\\n \\\"\\\"\\\"\",\n \"def additional_command(self):\\n pass\",\n \"def __init__(self,cmds):\\n\\n # Since the list may include multi-line entries, first make sure that\\n # they've been all broken up before passing it to magic2python\\n cmdlist = map(magic2python,''.join(cmds).split('\\\\n'))\\n self.value = '\\\\n'.join(cmdlist)\",\n \"def loadPlayerCommands(self, player):\\n player.addCommand('get', self.commands['get']())\\n player.addCommand('drop', self.commands['drop']())\\n player.addCommand('go', self.commands['go']())\\n player.addCommand('say', self.commands['say']())\\n player.addCommand('look', self.commands['look']())\\n player.addCommand('quit', self.commands['quit']())\\n player.addCommand('commands', self.commands['commands']())\\n player.addCommand('color', self.commands['color']())\",\n \"def _init_commands(self):\\n\\t\\tself.commands = {}\\n\\t\\tself.log.info(\\\"Initializing commands...\\\")\\n\\t\\t# Get all the commands and iterate over them\\n\\t\\tfor command in self.conf_commands:\\n\\t\\t\\t\\n\\t\\t\\t# Verify the necessary config elements exist at all\\n\\t\\t\\tdisabled = command.get('disabled', False) # Disabled is optional, defaults to False\\n\\t\\t\\tif(disabled == True):\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tcommand_name = command.get('name', \\\"unknown\\\").lower()\\n\\t\\t\\tdescription = command.get('description', \\\"\\\")\\n\\t\\t\\tpermission_str = command.get('permission', None)\\n\\t\\t\\taction = command.get('action', None)\\n\\t\\t\\tmin_votes = command.get('min_votes', None)\\n\\t\\t\\targs = command.get('args', None)\\n\\t\\t\\taliases = command.get('aliases', None)\\n\\t\\t\\tif(command_name is None \\n\\t\\t\\t\\tor permission_str is None \\n\\t\\t\\t\\tor action is None \\n\\t\\t\\t\\tor min_votes is None \\n\\t\\t\\t\\tor args is None):\\n\\t\\t\\t\\tself.log.warn(\\\"Command '{}': Error, missing 'permission', 'action', 'min_votes', or 'args' elements for command \\\".format(command_name))\\n\\t\\t\\t\\tcontinue\\n\\n\\t\\t\\t# Verify the votes and permission string are valid\\n\\t\\t\\tif(min_votes < 0):\\n\\t\\t\\t\\tself.log.warn(\\\"Command '{}': Error, min_votes cannot be less than zero for command {}\\\".format(command_name, min_votes))\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\telse:\\n\\t\\t\\t\\tself.log.debug(\\\"Command '{}': minimum votes is {}\\\".format(command_name, min_votes))\\n\\n\\t\\t\\ttry:\\n\\t\\t\\t\\tpermission = Permission[permission_str]\\n\\t\\t\\t\\tself.log.debug(\\\"Command '{}': permission is {}\\\".format(command_name, permission))\\n\\t\\t\\texcept Exception as e:\\n\\t\\t\\t\\tself.log.warn(\\\"Command '{}': Error, permission string '{}' is invalid, must be one of: {}\\\".format(command_name, permission_str, Permission.__members__))\\n\\t\\t\\t\\tcontinue\\n\\n\\t\\t\\t# Try to get the corresponding action class\\n\\t\\t\\ttry:\\n\\t\\t\\t\\tmodule = import_module(\\\"obs.actions.\\\"+action)\\n\\t\\t\\t\\tclass_ = getattr(module, action)\\n\\t\\t\\t\\tself.log.debug(\\\"Command {}: action is {}\\\".format(command_name, class_))\\n\\t\\t\\texcept Exception as e:\\n\\t\\t\\t\\tself.log.warn(\\\"Command '{}': Error, no such action {} is defined. Full error: {}\\\".format(command_name, action, e))\\n\\t\\t\\t\\tcontinue\\n\\n\\t\\t\\t# Try to instantiate the action class\\n\\t\\t\\ttry:\\n\\t\\t\\t\\tself.log.debug(\\\"Command {}: args are: {}\\\".format(command_name, args))\\n\\t\\t\\t\\tcommand_obj = class_(self, command_name, aliases, description, permission, min_votes, args)\\n\\t\\t\\texcept ValueError as e:\\n\\t\\t\\t\\tself.log.warn(e)\\n\\t\\t\\t\\tcontinue\\n\\n\\t\\t\\t# Add command_obj to internal reference\\n\\t\\t\\tself.commands[command_name] = command_obj\\n\\n\\t\\t\\t# If there are aliases, add them too\\n\\t\\t\\t\\n\\t\\t\\tif(not aliases is None and isinstance(aliases, (list,) )):\\n\\t\\t\\t\\tself.log.debug(\\\"Command '{}': Found aliases {}\\\".format(command_name, aliases))\\n\\t\\t\\t\\tfor alias in aliases:\\n\\t\\t\\t\\t\\tself.commands[alias] = command_obj\\n\\t\\t\\telse:\\n\\t\\t\\t\\tself.log.debug(\\\"Command '{}': No aliases\\\".format(command_name, aliases))\\n\\n\\t\\t# Finally after all commands have been initialized then add the help command\\n\\t\\t#self.commands['help'] = Help(self)\\n\\n\\t\\t# Done initializing\\n\\t\\tself.log.info(\\\"...Commands initialized: {}\\\".format(\\n\\t\\t\\t\\tlist( self.commands.keys()) \\n\\t\\t\\t)\\n\\t\\t)\",\n \"def loadOlcCommands(self, player):\\n player.addCommand('newzone', self.commands['newzone']())\\n player.addCommand('delzone', self.commands['delzone']())\\n player.addCommand('listzone', self.commands['listzone']())\\n player.addCommand('newroom', self.commands['newroom']())\\n player.addCommand('redit', self.commands['redit']())\\n player.addCommand('delroom', self.commands['delroom']())\\n player.addCommand('newportal', self.commands['newportal']())\\n player.addCommand('delportal', self.commands['delportal']())\\n player.addCommand('zedit', self.commands['zedit']())\\n player.addCommand('pedit', self.commands['pedit']())\\n player.addCommand('newtemplate', self.commands['newtemplate']())\",\n \"def flush_cmds(self):\\r\\n if self.select_cmd is not None:\\r\\n self.do_cmd()\",\n \"def __init__(self):\\n ElixirCommand.__init__(self)\",\n \"def _setup_command(self):\\r\\n raise NotImplementedError\",\n \"def run(self, commands: list[str]):\\n ...\",\n \"def setup(bot):\\n bot.add_cog(AdminCommands(bot))\",\n \"def at_pre_cmd(self):\\n pass\",\n \"def __init__(self, **manager_commands):\\n self.package = manager_commands\",\n \"def autodefaults (self):\\r\\n\\r\\n self.defaults_from_notes(identifying_key=EMPTYCHAR,\\r\\n mark=EQUAL,\\r\\n obj=self.default_dict['commands'],\\r\\n entrytext=COMMANDMACROSCRIPT)\",\n \"def handle_commands_preset(self,cl,addr) :\\n self.curDir = ['CTF','Challenges','tempUser'+str(random.randint(100,999))]\\n try :\\n client = cl\\n if self.curDir != [] : \\n userp = \\\"temp-user-\\\"+addr[0].replace('.','-')+\\\"@ieeectf:~/{}$ \\\".format('/'.join(self.curDir))\\n else :\\n userp = \\\"temp-user-\\\"+addr[0].replace('.','-')+\\\"@ieeectf:~$ \\\"\\n self.userp = userp.encode()\\n client.send(\\\"\\\"\\\"\\nCustom Shell Server With Limited Functionality\\n\\nNew User Login from {} at {}\\n \\\\n\\\"\\\"\\\".format(addr[0],time.ctime()).encode())\\n shellin = \\\"\\\" \\n while True:\\n if self.curDir != [] : \\n userp = \\\"temp-user-\\\"+addr[0].replace('.','-')+\\\"@ieeectf:~/{}$ \\\".format('/'.join(self.curDir))\\n else :\\n userp = \\\"temp-user-\\\"+addr[0].replace('.','-')+\\\"@ieeectf:~$ \\\"\\n self.userp = userp.encode()\\n client.send(self.userp)\\n shellin = client.recv(2048).decode().strip('\\\\n')\\n if shellin == \\\"exit\\\" or shellin == \\\"exit \\\" or shellin ==\\\"exit \\\" or shellin ==\\\"exit \\\" :\\n break\\n elif shellin == \\\"\\\" :\\n continue\\n elif shellin.split()[0] in self.denied :\\n client.send(self.err.format(shellin.split()[0]).encode())\\n else :\\n self.handle_extended_commands(client,addr,shellin)\\n continue\\n client.close()\\n except Exception as E:\\n print(E)\\n print(Log(\\\"Connection with {} Terminated\\\".format(addr)))\",\n \"def exec_init_cmd(self):\\n\\n sys.argv = ['-c']\\n self.push(self.rc.c)\",\n \"def command(self):\\n raise NotImplementedError\",\n \"def add_general_cmdsets(self):\\n from commands.base_commands import general\\n from world.map import CmdMap\\n self.add(general.CmdPoke)\\n self.add(CmdMap)\",\n \"def __init__(self, cmd):\\n # Build command + options \\n self.cmd = cmd \\n setattr(self, 'command', \\\"%s\\\" % (cmd))\",\n \"def _register_commands(self):\\n cmds = []\\n cmd_help = CommandParser(\\\"help\\\", \\\"Show help for a command.\\\")\\n cmd_help.add_argument(\\n \\\"command\\\",\\n nargs=\\\"*\\\",\\n help=\\\"The command to get help for. Specify multiple names to get help for subcommands.\\\",\\n )\\n cmd_help.add_argument(\\\"-m\\\", \\\"--module\\\", help=\\\"List all commands from the given module\\\")\\n cmd_help.add_argument(\\n \\\"-f\\\",\\n \\\"--full\\\",\\n action=\\\"store_true\\\",\\n help='Include descriptions in the \\\"all\\\" help output.',\\n )\\n cmds.append(cmd_help)\\n\\n target_mod = CommandParser()\\n target_mod.add_argument(\\\"module\\\", nargs=\\\"+\\\", help=\\\"Target module(s)\\\")\\n target_mod.add_argument(\\n \\\"-p\\\",\\n \\\"--protocol\\\",\\n action=\\\"store_const\\\",\\n const=\\\"protocol\\\",\\n default=\\\"feature\\\",\\n dest=\\\"mtype\\\",\\n help=\\\"Target is a protocol module\\\",\\n )\\n cmd_module = CommandParser(\\\"module\\\", \\\"Manage and query ZeroBot modules\\\")\\n add_subcmd = cmd_module.make_adder(metavar=\\\"OPERATION\\\", dest=\\\"subcmd\\\", required=True)\\n add_subcmd(\\\"load\\\", description=\\\"Load a module\\\", parents=[target_mod])\\n add_subcmd(\\\"reload\\\", description=\\\"Reload a module\\\", parents=[target_mod])\\n subcmd_list = add_subcmd(\\\"list\\\", description=\\\"List available modules\\\")\\n subcmd_list.add_argument(\\\"-l\\\", \\\"--loaded\\\", action=\\\"store_true\\\", help=\\\"Only loaded modules\\\")\\n list_group = subcmd_list.add_mutually_exclusive_group()\\n default_categories = [\\\"protocol\\\", \\\"feature\\\"]\\n list_group.add_argument(\\n \\\"-f\\\",\\n \\\"--feature\\\",\\n action=\\\"store_const\\\",\\n const=[\\\"feature\\\"],\\n dest=\\\"category\\\",\\n default=default_categories,\\n help=\\\"Only feature modules\\\",\\n )\\n list_group.add_argument(\\n \\\"-p\\\",\\n \\\"--protocol\\\",\\n action=\\\"store_const\\\",\\n const=[\\\"protocol\\\"],\\n dest=\\\"category\\\",\\n default=default_categories,\\n help=\\\"Only protocol modules\\\",\\n )\\n add_subcmd(\\\"info\\\", description=\\\"Show module information\\\", parents=[target_mod])\\n cmds.append(cmd_module)\\n\\n save_reload_args = CommandParser()\\n save_reload_args.add_argument(\\n \\\"config_file\\\",\\n nargs=\\\"*\\\",\\n help=\\\"Name of config file (without .toml extension). Omit to affect all loaded config files.\\\",\\n )\\n set_reset_args = CommandParser()\\n set_reset_args.add_argument(\\\"config_file\\\", help=\\\"Name of config file (without .toml extension)\\\")\\n cmd_config = CommandParser(\\\"config\\\", \\\"Manage configuration\\\")\\n add_subcmd = cmd_config.make_adder(metavar=\\\"OPERATION\\\", dest=\\\"subcmd\\\", required=True)\\n add_subcmd(\\\"save\\\", description=\\\"Save config files to disk\\\", parents=[save_reload_args])\\n subcmd_savenew = add_subcmd(\\\"savenew\\\", description=\\\"Save config file to a new path\\\")\\n subcmd_savenew.add_argument(\\\"config_file\\\", help=\\\"Name of config file (without .toml extension)\\\")\\n subcmd_savenew.add_argument(\\\"new_path\\\", help=\\\"The path to save the config file to\\\")\\n add_subcmd(\\n \\\"reload\\\",\\n description=\\\"Reload config files from disk\\\",\\n parents=[save_reload_args],\\n )\\n subcmd_set = add_subcmd(\\\"set\\\", description=\\\"Modify config settings\\\", parents=[set_reset_args])\\n subcmd_set.add_argument(\\n \\\"key_path\\\",\\n help=\\\"The config key to set. Subkeys are separated by dots, e.g. 'Core.Backup.Filename'\\\",\\n )\\n subcmd_set.add_argument(\\\"value\\\", nargs=\\\"?\\\", help=\\\"The new value. Omit to show the current value.\\\")\\n subcmd_reset = add_subcmd(\\n \\\"reset\\\",\\n description=\\\"Reset config settings to last loaded value\\\",\\n parents=[set_reset_args],\\n )\\n subcmd_reset.add_argument(\\n \\\"key_path\\\",\\n nargs=\\\"?\\\",\\n help=(\\n \\\"The config key to set. Subkeys are separated by dots, \\\"\\n \\\"e.g. 'Core.Backup.Filename'. If omitted, the entire \\\"\\n \\\"config will be reset.\\\"\\n ),\\n )\\n subcmd_reset.add_argument(\\n \\\"-d\\\",\\n \\\"--default\\\",\\n action=\\\"store_true\\\",\\n help=\\\"Set the key to its default value instead. Effectively unsets a config key.\\\",\\n )\\n cmds.append(cmd_config)\\n\\n cmd_version = CommandParser(\\\"version\\\", \\\"Show version information\\\")\\n cmds.append(cmd_version)\\n\\n cmd_restart = CommandParser(\\\"restart\\\", \\\"Restart ZeroBot.\\\")\\n cmd_restart.add_argument(\\\"msg\\\", nargs=\\\"*\\\", help=\\\"Message sent to protocol modules as a reason\\\")\\n cmds.append(cmd_restart)\\n\\n cmd_quit = CommandParser(\\\"quit\\\", \\\"Shut down ZeroBot.\\\")\\n cmd_quit.add_argument(\\\"msg\\\", nargs=\\\"*\\\", help=\\\"Message sent to protocol modules as a reason\\\")\\n cmds.append(cmd_quit)\\n\\n cmd_wait = CommandParser(\\\"wait\\\", \\\"Execute a command after a delay\\\")\\n cmd_wait.add_argument(\\n \\\"delay\\\",\\n help=\\\"Amount of time to delay. Accepts the following modifier suffixes: 'ms', 's' (default), 'm', 'h'.\\\",\\n )\\n cmd_wait.add_argument(\\\"command\\\", help=\\\"Command to delay\\\")\\n cmd_wait.add_argument(\\\"args\\\", nargs=argparse.REMAINDER, help=\\\"Command arguments\\\")\\n cmds.append(cmd_wait)\\n\\n cmd_cancel = CommandParser(\\\"cancel\\\", \\\"Cancel a waiting command\\\")\\n cancel_group = cmd_cancel.add_mutually_exclusive_group()\\n cancel_group.add_argument(\\\"id\\\", type=int, nargs=\\\"?\\\", help=\\\"The ID of a waiting command\\\")\\n cancel_group.add_argument(\\\"-l\\\", \\\"--list\\\", action=\\\"store_true\\\", help=\\\"List currently waiting commands\\\")\\n cmds.append(cmd_cancel)\\n\\n cmd_backup = CommandParser(\\\"backup\\\", \\\"Create a database backup\\\")\\n cmd_backup.add_argument(\\\"name\\\", type=Path, help=\\\"Backup filename\\\")\\n cmds.append(cmd_backup)\\n\\n self.command_register(\\\"core\\\", *cmds)\",\n \"def add_command(self, name, fct):\\r\\n self.cmds[name] = fct\",\n \"async def adding_command_list(self):\\n command_aliases=['anime','fun','mod','nekogif'] #This includes the aliases and the cog names\\n #NOTE: fun command added\\n for i in self.bot.commands:\\n self.commands.append(i.name)\\n \\n for i in command_aliases:\\n self.commands.append(i)\",\n \"def set_command(cmd_list):\\n global last_command\\n last_command = ' '.join(cmd_list)\",\n \"def check_commands(self):\\n pass\",\n \"def start(self) -> None:\\n\\n os.system(\\\"cls\\\" if os.name == \\\"nt\\\" else \\\"clear\\\")\\n print(\\\"Bienvenido al traductor TbSET. Para salir presiona Ctrl-D.\\\\n\\\")\\n\\n while True:\\n try:\\n typed = self.session.prompt(\\n \\\".TbSET > \\\",\\n completer=self.commands,\\n validator=DummyValidator(),\\n complete_while_typing=True\\n )\\n except KeyboardInterrupt:\\n continue\\n except EOFError:\\n break\\n else:\\n self._command_processor(typed)\\n\\n print(\\\"Bye!\\\\n\\\")\",\n \"def main_command_loop(self) -> None:\\n\\n self.commands.pop(0)\\n for command in self.commands:\\n if \\\"--static\\\" == command:\\n self.update_static_files()\\n elif \\\"--temp\\\" == command:\\n self.update_templates()\\n elif \\\"--app\\\" == command:\\n self.update_app()\\n elif \\\"--settings\\\" == command:\\n self.update_settings()\\n elif \\\"--mysql-files\\\" == command:\\n self.update_mysql_files()\\n elif \\\"--help\\\" == command or \\\"-h\\\" == command:\\n self.write_help_message()\",\n \"def cmd(self, cmd):\\n\\n self._cmd = cmd\",\n \"def command(self, cmd):\\n self.lmp.command(cmd)\",\n \"def init_command_objects(self):\\n super().init_command_objects()\\n device_data = DeviceData.get_instance()\\n\\n args = (device_data, self.state_model, self.logger)\\n\\n self.register_command_object(\\\"SetStowMode\\\", SetStowMode(*args))\\n self.register_command_object(\\n \\\"SetStandbyLPMode\\\", SetStandbyLPMode(*args)\\n )\\n self.register_command_object(\\\"SetOperateMode\\\", SetOperateMode(*args))\\n self.register_command_object(\\\"Scan\\\", Scan(*args))\\n self.register_command_object(\\\"EndScan\\\", EndScan(*args))\\n self.register_command_object(\\\"Configure\\\", Configure(*args))\\n self.register_command_object(\\\"StartCapture\\\", StartCapture(*args))\\n self.register_command_object(\\\"StopCapture\\\", StopCapture(*args))\\n self.register_command_object(\\n \\\"SetStandbyFPMode\\\", SetStandbyFPMode(*args)\\n )\\n self.register_command_object(\\\"Slew\\\", Slew(*args))\\n self.register_command_object(\\\"Track\\\", Track(*args))\\n self.register_command_object(\\\"StopTrack\\\", StopTrack(*args))\\n self.register_command_object(\\\"Abort\\\", Abort(*args))\\n self.register_command_object(\\\"Restart\\\", Restart(*args))\\n self.register_command_object(\\\"ObsReset\\\", ObsReset(*args))\",\n \"def add_command(self, command):\\n self.command.extend(command)\",\n \"def run_cmd(self):\\r\\n self.run = True\",\n \"def command(self, *commands):\\n def decorator(function):\\n for command in commands:\\n self.functions[command] = function\\n return function\\n return decorator\",\n \"def post_run_cmds(self, host: str) -> tp.List[types.ShellCmdSpec]:\\n raise NotImplementedError\",\n \"def postloop(self):\\n super(CoreCommand, self).postloop() # Clean up command completion\",\n \"def parse(self, commands):\\n raise NotImplementedError()\",\n \"def build_commands(self):\\r\\n for tag in self.bmark.tags.keys():\\r\\n # if this tag is a command then return true\\r\\n if tag in COMMANDLIST:\\r\\n self.commands.append(tag)\",\n \"def command(self, command):\\n\\n self._command = command\",\n \"def command(self, command):\\n\\n self._command = command\",\n \"def command(self, command):\\n\\n self._command = command\",\n \"def do_command(self, args):\\n pass\",\n \"def setup(bot):\\n new_cog = Commands(bot)\\n bot.add_cog(new_cog)\",\n \"def default_supported_commands(self, commands):\\n self.state.default_supported_commands(commands)\",\n \"def __init__(self, vanillaCommand, usage):\\n super(VanillaCommandWrapper, self).__init__(vanillaCommand.b())\\n # PAIL: rename\\n self.vanillaCommand = vanillaCommand\\n self.setPermission(\\\"minecraft.command.\\\" + vanillaCommand.getCommand())\",\n \"def command(command_list):\\n def add_attribute(func):\\n if not hasattr(func, \\\"command\\\"):\\n func.command = []\\n func.command.append(command_list)\\n return func\\n return add_attribute\",\n \"def __set_cmd_parse(self, _cmd: dict):\\n for sitem in _cmd:\\n #\\n # alle sets durch\\n # {\\\"set\\\":[{\\\"alert\\\":\\\"alert-04\\\",\\\"enable\\\":\\\"true\\\", ...}, {\\\"alert\\\":\\\"alert-03\\\",\\\"enable\\\":\\\"true\\\", ...}]}\\n #\\n alert_name = sitem['alert']\\n if alert_name not in self.config:\\n # da ist ein NEUNER Alarm angekommen == NEW\\n self.log.debug(\\\"found NEW alert {} with set commands\\\".format(alert_name))\\n _alert = ConfigFileObj.get_empty_configitem()\\n ConfigFileObj.config_lock.acquire()\\n self.config[alert_name] = _alert\\n ConfigFileObj.config_lock.release()\\n else:\\n # EDIT Alarm\\n self.log.debug(\\\"found alert {} with set commands\\\".format(alert_name))\\n #\\n # nun alle Eigenschaften durch\\n #\\n ConfigFileObj.config_lock.acquire()\\n for set_command in sitem:\\n if set_command == 'alert':\\n continue\\n # eine Einstellung schreiben\\n self.log.debug(\\\"set property {} to {} for alert {}\\\".format(set_command, sitem[set_command], alert_name))\\n if sitem[set_command] == 'null':\\n self.config[alert_name][set_command] = \\\" \\\"\\n else:\\n self.config[alert_name][set_command] = sitem[set_command]\\n ConfigFileObj.config_lock.release()\\n # ende der kommandos per alarm\\n # ende der alarme\\n # es scheint alles geklappt zu haben\\n # noch schnell den aktuellen hashwert berechnen (besser als version)\\n self.config_hash['version'] = self.__get_hashstr(self.config)\\n self.log.debug(\\\"set command for alert(s) successful!\\\")\\n # callback, wenn erforderlich\\n if self.on_config_change is not None:\\n self.log.debug(\\\"call on_config_change...\\\")\\n self.on_config_change(int(time()))\\n return json.dumps({'ok': 'sucsessful commands done'}).encode(encoding='utf-8')\\n # ENDE __set_cmd_parse\",\n \"def setup_commands(bot):\\n # Reset the bot's command setup\\n bot.reset_commands()\\n # Load enabled mods\\n for mod in bot.enabled_mods:\\n try:\\n full = 'mod_%s' % mod\\n m = getattr(__import__('mods.%s' % full), full)\\n except Exception:\\n bot.log(ERROR, 'Importing the %s mod failed!' % mod)\\n sys.excepthook(*sys.exc_info())\\n continue\\n\\n try:\\n bot.installed_mods[mod] = m\\n # Check for a 404 handler, and replace the current one if there is\\n p404 = getattr(m, 'handle_404', None)\\n if p404:\\n bot.cb_404 = p404\\n\\n # Check for a setup function, and run it if there is\\n setup = getattr(m, 'setup', None)\\n if setup:\\n setup(bot)\\n\\n # Required command bank\\n for cmd in m.command_bank:\\n # Get the actual function\\n func = getattr(m, cmd)\\n # Get the args for the command\\n data = m.command_bank[cmd]\\n # If data[0] is true, mod_help will recognize this command\\n if data[0]:\\n bot.help_db[data[1]] = parse_help(func)\\n # Get the main name and aliases inserted\\n for alias in data[1:]:\\n bot.command_db[alias] = func\\n\\n # Helper function for optional nameless multiples\\n def add_optional(olist, name):\\n olist.extend(getattr(m, f) for f in getattr(m, name, ()))\\n\\n # Optional filters are loaded and added to the list\\n add_optional(bot.filters, 'filters')\\n\\n # Ditto for time-cycle callbacks\\n add_optional(bot.periodic_cbs, 'periodic')\\n\\n # Handlers are the same, but structured as a dict with\\n # \\\"type\\\": \\\"single function-name\\\" items\\n handlers = getattr(m, 'handlers', None)\\n if handlers:\\n for cbtype in handlers:\\n bot.handlers[cbtype].append(getattr(m, handlers[cbtype]))\\n\\n # Register any requirements\\n # NOTE: By putting this at the end, we avoid the possibility of\\n # getting fake requires.\\n reqs = getattr(m, 'requires', None)\\n if reqs:\\n bot.required_mods.update(reqs)\\n except Exception:\\n bot.log(ERROR, 'Unable to install the %s mod!' % mod)\\n del bot.installed_mods[mod]\\n sys.excepthook(*sys.exc_info())\\n\\n missing = bot.required_mods - set(bot.installed_mods)\\n if missing:\\n raise MissingRequirementsError(missing)\\n\\n # And now for the post-install triggers.\\n for mod, m in bot.installed_mods.items():\\n post = getattr(m, 'post_prepare', None)\\n if post:\\n try:\\n post(bot)\\n except Exception:\\n bot.log(ERROR, 'Unable to post-prepare the %s mod!' % mod)\\n sys.excepthook(*sys.exc_info())\",\n \"def cmd(self, data, enable):\\n pass\",\n \"def sys_commands(self, obj, phase=''):\\n commands = self.settings.get(phase)\\n if commands and isinstance(commands, list):\\n for command in commands:\\n if isinstance(command, list):\\n # Find list items that match the string after \\\"att_\\\",\\n # these are names names of attribute in the calling class\\n for key, item in enumerate(command):\\n if item[:4] == 'att_':\\n attribute = item[4:]\\n try:\\n command[key] = getattr(obj, attribute)\\n except AttributeError:\\n continue\\n try:\\n popen = subprocess.Popen(command, stdout=subprocess.PIPE,\\n stderr=subprocess.PIPE)\\n except OSError as error:\\n msg = \\\"Cannot run {0} the command doesn't exist,\\\\n\\\".format(command.pop(0))\\n msg += \\\"Error: {1}\\\".format(error.strerror)\\n print msg\\n results = popen.communicate()\\n if results[1]:\\n print \\\"Running {0}, \\\\n Error: {1}\\\".format(command, results[1])\\n else:\\n continue\",\n \"def runCommand(self): \\\\\\n # pylint: disable=no-self-use\",\n \"def modulecmds():\\n\\n class Commands:\\n @staticmethod\\n def setenv(key, val=None):\\n val = val or key\\n return \\\"setenv({0!r}, {1!r})\\\\n\\\".format(key, val)\\n\\n @staticmethod\\n def unsetenv(key):\\n return \\\"unsetenv({0!r})\\\\n\\\".format(key)\\n\\n @staticmethod\\n def load(x):\\n return \\\"load({0!r})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def load_first(*x):\\n x = \\\",\\\".join(\\\"{0!r}\\\".format(_) for _ in x)\\n return \\\"load_first({0})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def unload(x):\\n return \\\"unload({0!r})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def prepend_path(key, val=None, sep=os.pathsep):\\n val = val or key\\n return \\\"prepend_path({0!r},{1!r},sep={2!r})\\\\n\\\".format(key, val, sep)\\n\\n @staticmethod\\n def append_path(key, val=None, sep=os.pathsep):\\n val = val or key\\n return \\\"append_path({0!r},{1!r},sep={2!r})\\\\n\\\".format(key, val, sep)\\n\\n @staticmethod\\n def remove_path(key, val=None, sep=os.pathsep):\\n val = val or key\\n return \\\"remove_path({0!r},{1!r},sep={2!r})\\\\n\\\".format(key, val, sep)\\n\\n @staticmethod\\n def set_alias(key, val):\\n return \\\"set_alias({0!r},{1!r})\\\\n\\\".format(key, val)\\n\\n @staticmethod\\n def unset_alias(key):\\n return \\\"unset_alias({0!r})\\\\n\\\".format(key)\\n\\n @staticmethod\\n def set_shell_function(key, val):\\n return \\\"set_shell_function({0!r},{1!r})\\\\n\\\".format(key, val)\\n\\n @staticmethod\\n def unset_shell_function(key):\\n return \\\"unset_shell_function({0!r})\\\\n\\\".format(key)\\n\\n @staticmethod\\n def use(path):\\n return \\\"use({0!r})\\\\n\\\".format(path)\\n\\n @staticmethod\\n def unuse(path):\\n return \\\"unuse({0!r})\\\\n\\\".format(path)\\n\\n @staticmethod\\n def swap(a, b):\\n return \\\"swap({0!r}, {1!r})\\\\n\\\".format(a, b)\\n\\n @staticmethod\\n def family(x):\\n return \\\"family({0!r})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def conflict(x):\\n return \\\"conflict({0!r})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def prereq(x):\\n return \\\"prereq({0!r})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def prereq_any(*x):\\n x = \\\",\\\".join(\\\"{0!r}\\\".format(_) for _ in x)\\n return \\\"prereq_any({0})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def source(f):\\n return \\\"source({0!r})\\\\n\\\".format(f)\\n\\n @staticmethod\\n def help(x):\\n return \\\"help({0!r})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def whatis(x):\\n return \\\"whatis({0!r})\\\\n\\\".format(x)\\n\\n @staticmethod\\n def isloaded(x):\\n return \\\"is_loaded({0!r})\\\\n\\\".format(x)\\n\\n return Commands()\",\n \"def init_command_objects(self):\\n super().init_command_objects()\\n device_args = (self, self.state_model, self.logger)\\n # resource_args = (self.resource_manager, self.state_model, self.logger) \\n # only use resource_args if we want to have separate resource_manager object\\n\\n self.register_command_object(\\n \\\"Configure\\\",\\n self.ConfigureCommand(*device_args)\\n ) \\n self.register_command_object(\\n \\\"AddReceptors\\\",\\n self.AddReceptorsCommand(*device_args)\\n )\\n self.register_command_object(\\n \\\"RemoveReceptors\\\",\\n self.RemoveReceptorsCommand(*device_args)\\n )\\n self.register_command_object(\\n \\\"RemoveAllReceptors\\\",\\n self.RemoveAllReceptorsCommand(*device_args)\\n )\\n self.register_command_object(\\n \\\"ConfigureScan\\\",\\n self.ConfigureScanCommand(*device_args)\\n )\\n self.register_command_object(\\n \\\"StartScan\\\",\\n self.ScanCommand(*device_args)\\n )\\n self.register_command_object(\\n \\\"GoToIdle\\\",\\n self.GoToIdleCommand(*device_args)\\n )\",\n \"def control_center(self):\\r\\n c_command = input(\\\"Enter your command : \\\")\\r\\n self.curs.executescript(c_command)\\r\\n self.conn.commit()\",\n \"def update_commands(self, commands_str):\\n commands = dict(parse_qsl(commands_str, keep_blank_values=True))\\n _if = commands.get(\\\"if\\\", self._if)\\n if _if:\\n self._if = Condition(_if)\\n self._set_int(commands, \\\"max_length\\\")\\n self._set_int(commands, \\\"min_length\\\")\\n self.color = expand_color(commands.get(\\\"color\\\"), passthrough=True, block=self.color)\\n\\n self.not_zero = \\\"not_zero\\\" in commands or self.not_zero\\n self.show = \\\"show\\\" in commands or self.show\\n self.soft = \\\"soft\\\" in commands or self.soft\",\n \"def set_command(self, command):\\n self.player_command = command\\n return None\",\n \"def ConsoleRun(self, command, sender):\\n pass\",\n \"def __call__(self, cmd):\\n cmdname = cmd.name\\n self.commands[cmdname] = self._prepare_cmd(cmd)\\n return cmd\",\n \"async def setheist(self, ctx):\\r\\n\\r\\n pass\",\n \"def cmd(self, command):\\n self._commands.append(command)\",\n \"def _execute_impl(self, commands):\\n raise NotImplementedError(\\\"abstract method\\\")\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7058163","0.70184225","0.6852532","0.6852532","0.6852532","0.6852532","0.6804543","0.6804543","0.66652715","0.65947163","0.65928555","0.65210867","0.64140224","0.63312364","0.6290925","0.62714374","0.6251512","0.6167499","0.61642545","0.6146838","0.6128197","0.61257267","0.6070907","0.6067032","0.6065646","0.6052757","0.6041006","0.60356104","0.60264885","0.60080695","0.5994932","0.5968947","0.5966107","0.5964301","0.5924975","0.5902757","0.58377635","0.5830734","0.582569","0.5817137","0.58003116","0.5793148","0.5790446","0.57795763","0.57705426","0.5750098","0.5743952","0.57320875","0.572757","0.5717779","0.5706019","0.56914276","0.56861985","0.5673234","0.56729174","0.5669422","0.5657623","0.5651898","0.56467575","0.5643041","0.5614757","0.56096184","0.5604782","0.560443","0.5592759","0.5591101","0.55807096","0.55791473","0.55770844","0.5568445","0.5550506","0.55471784","0.55439717","0.553301","0.55311435","0.5510976","0.5504238","0.5503939","0.5503939","0.5503939","0.5499717","0.5478448","0.5469912","0.5458316","0.5447364","0.5446283","0.5437724","0.5424095","0.54141426","0.5412261","0.5400978","0.539887","0.53983","0.53974915","0.5396886","0.5392795","0.5392231","0.5390548","0.53876346","0.53805643"],"string":"[\n \"0.7058163\",\n \"0.70184225\",\n \"0.6852532\",\n \"0.6852532\",\n \"0.6852532\",\n \"0.6852532\",\n \"0.6804543\",\n \"0.6804543\",\n \"0.66652715\",\n \"0.65947163\",\n \"0.65928555\",\n \"0.65210867\",\n \"0.64140224\",\n \"0.63312364\",\n \"0.6290925\",\n \"0.62714374\",\n \"0.6251512\",\n \"0.6167499\",\n \"0.61642545\",\n \"0.6146838\",\n \"0.6128197\",\n \"0.61257267\",\n \"0.6070907\",\n \"0.6067032\",\n \"0.6065646\",\n \"0.6052757\",\n \"0.6041006\",\n \"0.60356104\",\n \"0.60264885\",\n \"0.60080695\",\n \"0.5994932\",\n \"0.5968947\",\n \"0.5966107\",\n \"0.5964301\",\n \"0.5924975\",\n \"0.5902757\",\n \"0.58377635\",\n \"0.5830734\",\n \"0.582569\",\n \"0.5817137\",\n \"0.58003116\",\n \"0.5793148\",\n \"0.5790446\",\n \"0.57795763\",\n \"0.57705426\",\n \"0.5750098\",\n \"0.5743952\",\n \"0.57320875\",\n \"0.572757\",\n \"0.5717779\",\n \"0.5706019\",\n \"0.56914276\",\n \"0.56861985\",\n \"0.5673234\",\n \"0.56729174\",\n \"0.5669422\",\n \"0.5657623\",\n \"0.5651898\",\n \"0.56467575\",\n \"0.5643041\",\n \"0.5614757\",\n \"0.56096184\",\n \"0.5604782\",\n \"0.560443\",\n \"0.5592759\",\n \"0.5591101\",\n \"0.55807096\",\n \"0.55791473\",\n \"0.55770844\",\n \"0.5568445\",\n \"0.5550506\",\n \"0.55471784\",\n \"0.55439717\",\n \"0.553301\",\n \"0.55311435\",\n \"0.5510976\",\n \"0.5504238\",\n \"0.5503939\",\n \"0.5503939\",\n \"0.5503939\",\n \"0.5499717\",\n \"0.5478448\",\n \"0.5469912\",\n \"0.5458316\",\n \"0.5447364\",\n \"0.5446283\",\n \"0.5437724\",\n \"0.5424095\",\n \"0.54141426\",\n \"0.5412261\",\n \"0.5400978\",\n \"0.539887\",\n \"0.53983\",\n \"0.53974915\",\n \"0.5396886\",\n \"0.5392795\",\n \"0.5392231\",\n \"0.5390548\",\n \"0.53876346\",\n \"0.53805643\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.65425885"},"document_rank":{"kind":"string","value":"11"}}},{"rowIdx":94777,"cells":{"query":{"kind":"string","value":"create a new sub block to the current block and return it. the sub block is added to the current block."},"document":{"kind":"string","value":"def new_block(self):\n child = Block(self, py3_wrapper=self.py3_wrapper)\n self.add(child)\n return child"},"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 gen_new_block(self):\n block = BasicBlock()\n self.blocks.append(block)\n return block","def newblock(self, parent=None):\n block = ControlBlock()\n self.blocks.add(block)\n if parent:\n parent.add_child(block)\n return block","def newblock(self, parent=None, **kwargs):\n block = ControlBlock(len(self.blocks), **kwargs)\n self.blocks.append(block)\n if parent:\n parent.add_child(block)\n\n return block","def nextblock(self, parent=None, **kwargs):\n block = self.newblock(parent, **kwargs)\n if not parent and self.block:\n self.block.add_child(block)\n\n self.block = block\n return block","def nextblock(self, parent=None):\n block = ControlBlock()\n self.blocks.add(block)\n if parent:\n parent.add_child(block)\n elif self.block:\n self.block.add_child(block)\n self.block = block\n return self.block","def add_new_block(self):\n old_block = self.curr_block\n self.curr_block = self.gen_new_block()\n add_edge(old_block, self.curr_block)","def NewBlock(self):\n for i in self.matrix:\n if 2 in i:\n return()\n blockType = self.bag.Choose()\n subtractor = {\"I\" : 4, \"J\" : 3, \"L\" : 3, \"O\" : 2, \"S\" : 3, \"T\" : 3, \"Z\": 3}\n x = random.randint(0, self.width - subtractor.get(blockType))\n coords = []\n if blockType == \"I\":\n coords = [(x + i, 0) for i in range(4)]\n elif blockType == \"J\":\n coords = [(x + i, 0) for i in range(3)]\n coords.append((x, 1))\n elif blockType == \"L\":\n coords = [(x + i, 0) for i in range(3)]\n coords.append((x + 2, 1))\n elif blockType == \"O\":\n coords = [(x, 0), (x + 1, 0), (x, 1), (x + 1, 1)]\n elif blockType == \"Z\":\n coords = [(x, 0), (x + 1, 0), (x + 1, 1), (x + 2, 1)]\n elif blockType == \"S\":\n coords = [(x + 1, 0), (x + 2, 0), (x, 1), (x + 1, 1)]\n elif blockType == \"T\":\n coords = [(x, 0), (x + 1, 0), (x + 2, 0), (x + 1, 1)]\n self.coords = coords\n return(coords)","def build_new_block(cls, data='', previous_block=None):\n if previous_block:\n new_index = previous_block.index+1\n previous_hash = previous_block.hash\n else:\n new_index = 0\n previous_hash = ''\n timestamp = int(time.time())\n block_hash = cls.build_block_hash(\n index=new_index,\n timestamp=timestamp,\n data=data,\n previous_hash=previous_hash\n )\n block = cls(\n index=new_index,\n previous_hash=previous_hash,\n data=data,\n timestamp=timestamp,\n block_hash=block_hash\n )\n\n return block","def newBlock(preBlock, remitter, number, payee):\r\n index = preBlock.index + 1\r\n timestamp = int(round(time.time() * 1000))\r\n data = (remitter, number, payee).__str__()\r\n previousHash = preBlock.hash\r\n nounce = 0\r\n return Blockchain(index, data, timestamp, nounce, previousHash)","def new_block(self, proof, previous_hash = None):\n #create a new Block & adds it to the chain.\n \n block = {\n 'index' : len(self.chain) + 1,\n 'timestamp' : time(),\n 'transactions' : self.pending_transactions,\n 'proof' : proof,\n 'previous_hash' : previous_hash or self.hash(self.chain[-1])\n }\n\n # Reset the current list of transactions\n self.pending_transactions = []\n\n self.chain.append(block)\n return block\n #pass","def get_a_block(self, usage_id=None):\r\n scope_ids = Mock()\r\n if usage_id is None:\r\n usage_id = \"_auto%d\" % len(self.all_blocks)\r\n scope_ids.usage_id = usage_id\r\n block = self.system.construct_xblock_from_class(\r\n self.TestableInheritingXBlock,\r\n field_data=self.field_data,\r\n scope_ids=scope_ids,\r\n )\r\n self.all_blocks[usage_id] = block\r\n return block","def switch(self):\n base_block = self.base_block or self\n self.next_block = Block(self.parent, base_block=base_block, py3_wrapper=self.py3_wrapper)\n return self.next_block","def createFirstBlock(self):\n firstBlock = Block(0, self.__currentTransactionsList, 0, '00')\n self.__chain.append(firstBlock)","def new_block(self, proof, previous_hash=None):\n \n block = {\n 'index': len(self.chain) + 1,\n 'timestamp': time(),\n 'transactions': self.current_transactions,\n 'proof': proof,\n 'previous_hash': previous_hash or self.hash(self.chain[-1]),\n }\n\n # Reset the current list of transactions\n self.current_transactions = []\n # Add block to existing chain\n self.chain.append(block)\n return block","def new_block(self, proof, previous_hash=None):\n\n\t\tblock = {\n\t\t\t'index': len(self.chain) + 1,\n\t\t\t'timestamp': time(),\n\t\t\t'transactions': self.current_transactions,\n\t\t\t'proof': proof,\n\t\t\t'previous_hash': previous_hash or self.hash(self.chain[-1]),\t\t\n\t\t}\n\n\t\t#Reset current list of transactions\n\t\tself.current_transactions = []\n\n\t\tself.chain.append(block)\n\t\treturn block","def exit_block(self, parent=None, **kwargs):\n block = self.newblock(parent, have_code=False, is_exit=True, **kwargs)\n self.blocks.pop()\n return block","def build_block(self, format_string):\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\n block = first_block\n\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n value = token.group(0)\n if token.group(\"block_start\"):\n # Create new block\n block = block.new_block()\n elif token.group(\"block_end\"):\n # Close block setting any valid state as needed\n # and return to parent block to continue\n if not block.parent:\n raise Exception(\"Too many `]`\")\n block = block.parent\n elif token.group(\"switch\"):\n # a new option has been created\n block = block.switch()\n elif token.group(\"placeholder\"):\n # Found a {placeholder}\n key = token.group(\"key\")\n format = token.group(\"format\")\n block.add(Placeholder(key, format))\n elif token.group(\"literal\"):\n block.add(Literal(value))\n elif token.group(\"lost_brace\"):\n # due to how parsing happens we can get a lonesome }\n # eg in format_string '{{something}' this fixes that issue\n block.add(Literal(value))\n elif token.group(\"command\"):\n # a block command has been found\n block.set_commands(token.group(\"command\"))\n elif token.group(\"escaped\"):\n # escaped characters add unescaped values\n if value[0] in [\"\\\\\", \"{\", \"}\"]:\n value = value[1:]\n block.add(Literal(value))\n\n if block.parent:\n raise Exception(\"Block not closed\")\n # add to the cache\n self.block_cache[format_string] = first_block","def new_block(self, proof, previous_hash=None):\n\n # Create the block\n my_block = Block(proof=proof,\n previous_hash=previous_hash or self.hash(self.last_block))\n my_block.save()\n\n # Update current_transactions with this new block.\n my_block_trans = self.current_transactions_obj\n\n for trans in Transaction.objects.filter(block__isnull=True):\n trans.block = my_block\n trans.save()\n\n block = {\n 'index': my_block.id,\n 'timestamp': my_block.timestamp,\n 'transactions': list(Transaction.objects.filter(block=my_block).values()),\n 'proof': my_block.proof,\n 'previous_hash': my_block.previous_hash,\n }\n\n return block","def create_block(self):\n return poet_transaction_block.PoetTransactionBlock()","def _new_block(self, user_id, category, block_fields, definition_id, new_id, raw=False):\r\n if not raw:\r\n block_fields = self._serialize_fields(category, block_fields)\r\n return {\r\n 'category': category,\r\n 'definition': definition_id,\r\n 'fields': block_fields,\r\n 'edit_info': {\r\n 'edited_on': datetime.datetime.now(UTC),\r\n 'edited_by': user_id,\r\n 'previous_version': None,\r\n 'update_version': new_id\r\n }\r\n }","def add_block(self, block_pf):\n\n # test si il s'agit du bloc genesis\n if len(self.blocks) != 0:\n # check si previous H est coherent avant ajout a chaine\n if self.check_previousBlockH(block_pf.header['prevBlockH']):\n self.blocks.append(block_pf)\n else:\n print \"== Probleme de parent\"\n print \"= %s\" % block_pf.header['prevBlockH']\n print \"= %s\" % getHashBlock(self.get_topBlock())\n else:\n self.blocks.append(block_pf)","def addBlock(self, data):\n #get the hashVal of last block in blockchain\n lastHash = self.chain[len(self.chain) - 1].hashVal\n timestamp = time()\n hashVal = Block.hashSHA(timestamp, lastHash, data, NONCE, DIFFICULTY)\n adding_block = Block(timestamp, lastHash, hashVal, data, NONCE, DIFFICULTY)\n \n self.chain.append(adding_block)\n return adding_block","def new_block(self, proof, previous_hash=None):\n block = {\n 'index': len(self.chain) + 1,\n 'timestamp': time(),\n 'transactions':self.current_transactions,\n 'proof': proof,\n 'previous_hash': previous_hash or self.hash(self.chain[-1]),\n }\n self.current_transactions = []\n self.chain.append(block)\n return block","def build_nested_blocks(self):\n pass","def new_block(self, proof, previous_hash=None):\r\n block = {\r\n 'index': len(self.chain) + 1,\r\n 'timestamp': time(),\r\n 'transactions': self.current_transactions,\r\n 'proof': proof,\r\n 'previous_hash': previous_hash or self.hash(self.chain[-1]),\r\n }\r\n\r\n # reseta a atual lista de transacoes\r\n self.current_transactions = []\r\n\r\n self.chain.append(block)\r\n return block","def _new_block(self, user_id, category, block_fields, definition_id, new_id, raw=False,\n asides=None, block_defaults=None):\n if not raw:\n block_fields = self._serialize_fields(category, block_fields)\n if not asides:\n asides = {}\n document = {\n 'block_type': category,\n 'definition': definition_id,\n 'fields': block_fields,\n 'asides': asides,\n 'edit_info': {\n 'edited_on': datetime.datetime.now(UTC),\n 'edited_by': user_id,\n 'previous_version': None,\n 'update_version': new_id\n }\n }\n if block_defaults:\n document['defaults'] = block_defaults\n return BlockData(**document)","def make_block(self, in_size, out_size, **kwargs):\n raise NotImplementedError(\"Abstract\")","def new_block(self, previous_hash):\n\n block = {\n 'index': len(self.chain) + 1,\n 'timestamp': time(),\n 'information': self.current_information,\n 'previous_hash': previous_hash or self.hash(self.chain[-1]),\n }\n\n # Reset the current list of transactions\n self.current_information = []\n\n self.chain.append(block)\n return block","def addBlock(self, newBlock):\n newBlock.index = len(self.chain)\n newBlock.previousHash = self.chain[-1].hash\n newBlock.mineBlock(self.difficulty)\n self.chain.append(newBlock)\n self.writeBlocks()","def createBlock(self, block: ghidra.program.model.mem.MemoryBlock, name: unicode, start: ghidra.program.model.address.Address, length: long) -> ghidra.program.model.mem.MemoryBlock:\n ...","def makeBlock(tag):\n return {\"t\":\"RawBlock\",\"c\":[\"html\",tag]}","def _do_add_block(self, args):\r\n bus_type = args[1]\r\n slave_id = int(args[2])\r\n name = args[3]\r\n block_type = int(args[4])\r\n starting_address = int(args[5])\r\n length = int(args[6])\r\n if bus_type == 'rtu':\r\n slave = self.server._servers[0].get_slave(slave_id)\r\n elif bus_type == 'tcp':\r\n slave = self.server._servers[1].get_slave(slave_id)\r\n slave.add_block(name, block_type, starting_address, length)\r\n return name","def createNewBlock(self, nonce, previousBlockHash, hash):\n newBlock = Block(len(self.chain), self.pendingTransactions, nonce, hash, previousBlockHash)\n self.pendingTransactions = []\n self.chain.append(newBlock)\n return newBlock","def genesis_block(self):\n block = Block(target=self.target, transactions=[])\n self.current_transactions.append(block)","def _initBlock(o,block):\n o.block = block.clone().shift(*o.board.startPosition)","def CreateBlock(audio):\n\n BitDepth = audio.getsampwidth() # Number of bytes\n FrameList = []\n BlockList = []\n SamplesCursor = audio.tell() # Cursor inside audio file\n NumSamples = audio.getnframes() # Num Samples inside audio file\n StatusList = BuildStatusBits() # List with all status bits\n StatusCursor = 0\n\n\n # Take 2 samples and create the frist Frame\n AudioSamples = audio.readframes(2)\n Frame = CreateFrame(AudioSamples[0:2], AudioSamples[2:5],\n StatusList, StatusCursor, BitDepth)\n StatusCursor += 1\n FrameList.append(Frame) # First Frame with Z preamble\n\n SamplesCursor = audio.tell()\n while SamplesCursor != NumSamples:\n if len(FrameList) == 192: # Each 192 frames we introduce a block\n print(\"what is love\")\n BlockList.append(FrameList)\n FrameList = []\n StatusCursor = 0 # We reset SampleCursor and FrameList\n AudioSamples = audio.readframes(2)\n Frame = CreateFrame(AudioSamples[0:2], AudioSamples[2:5],\n StatusList, StatusCursor, BitDepth)\n StatusCursor += 1\n FrameList.append(Frame) # First Frame with Z preamble\n\n AudioSamples = audio.readframes(2)\n Frame = CreateFrame(AudioSamples[0:2], AudioSamples[2:5],\n StatusList, StatusCursor, BitDepth)\n StatusCursor += 1\n FrameList.append(Frame)\n SamplesCursor = audio.tell() # Update cursor\n\n return BlockList","def build_block(self, current, block_params):\n block_args = {}\n\n # extract name\n block_name = block_params['name']\n\n # save upper_tri flatten\n self.preds_triu |= (block_name == 'upper_tri')\n \n # if Keras, get block variables names\n pass_all_globals = True\n if block_name[0].isupper():\n pass_all_globals = False\n block_func = blocks.keras_func[block_name]\n block_varnames = block_func.__init__.__code__.co_varnames\n\n # set global defaults\n global_vars = ['activation', 'batch_norm', 'bn_momentum', 'norm_type',\n 'l2_scale', 'l1_scale', 'padding', 'kernel_initializer']\n for gv in global_vars:\n gv_value = getattr(self, gv, False)\n if gv_value and (pass_all_globals or gv in block_varnames):\n block_args[gv] = gv_value\n\n # set remaining params\n block_args.update(block_params)\n del block_args['name']\n\n # save representations\n if block_name.find('tower') != -1:\n block_args['reprs'] = self.reprs\n\n # U-net helper\n if block_name[-5:] == '_unet':\n # find matching representation\n unet_repr = None\n for seq_repr in reversed(self.reprs[:-1]):\n if seq_repr.shape[1] == current.shape[1]*2:\n unet_repr = seq_repr\n break\n if unet_repr is None:\n print('Could not find matching representation for length %d' % current.shape[1], sys.stderr)\n exit(1)\n block_args['unet_repr'] = unet_repr\n\n # switch for block\n if block_name[0].islower():\n block_func = blocks.name_func[block_name]\n current = block_func(current, **block_args)\n\n else:\n block_func = blocks.keras_func[block_name]\n current = block_func(**block_args)(current)\n\n return current","def _make_block(self, model):\n # TODO Make base class\n assert model is not None, 'Top level model must be initialized first'\n self.model = model\n # If block is already present, remove it\n if self.model.component(self.name) is not None:\n self.model.del_component(self.name)\n self.model.add_component(self.name, Block())\n self.block = self.model.__getattribute__(self.name)\n\n self.logger.info(\n 'Optimization block initialized for {}'.format(self.name))","def build(self, block_size):","def _get_block(self, pos):\n raise NotImplementedError","def get_block(self, usage_id, for_parent=None):\n def_id = self.id_reader.get_definition_id(usage_id)\n try:\n block_type = self.id_reader.get_block_type(def_id)\n except NoSuchDefinition:\n raise NoSuchUsage(repr(usage_id)) # pylint: disable= raise-missing-from\n keys = ScopeIds(self.user_id, block_type, def_id, usage_id)\n block = self.construct_xblock(block_type, keys, for_parent=for_parent)\n return block","def create_entry_basic_block(self):\n bb = BasicBlock(self)\n self.basic_blocks.insert(0, bb)\n return bb","def new_block(self, proof, previous_hash=None):\n block = {\n 'index': len( self.chain ) + 1,\n 'timestamp': time(),\n 'transactions': self.current_transactions,\n 'merkle': self.hash(self.current_transactions),\n 'proof': proof,\n 'previous_hash': previous_hash or self.hash(self.chain[-1])\n }\n\n # Reset the current list of transactions\n self.current_transactions = []\n\n # Add the block to the chain\n self.chain.append( block )\n self._write_chain()\n\n return block","def prepare(block):\n if block.parent:\n block.parent = None\n if not block.__dict__['is_open'] is None:\n block.__dict__['open'] = block.is_open\n del(block.is_open)\n # trim empty elements...\n for attr in dir(block):\n if not callable(attr) and not attr.startswith(\"__\") and \\\n attr != \"makeNode\" and attr != \"pretty\":\n if block.__dict__[attr] in [\"\", [], None, {}]:\n del(block.__dict__[attr])\n if 'children' in block.__dict__ and len(block.children) > 0:\n for i, child in enumerate(block.children):\n block.children[i] = prepare(child)\n if 'inline_content' in block.__dict__ and \\\n len(block.inline_content) > 0:\n for i, child in enumerate(block.inline_content):\n block.inline_content[i] = prepare(child)\n if 'label' in block.__dict__ and len(block.label) > 0:\n for i, child in enumerate(block.label):\n block.label[i] = prepare(child)\n if 'c' in block.__dict__ and type(block.c) is list and \\\n len(block.c) > 0:\n for i, child in enumerate(block.c):\n block.c[i] = prepare(child)\n return block","def create_block(self, previous_hash):\r\n if len(self.transaction_pool) < 1:\r\n return None, None\r\n\r\n # Create A Temporary Block\r\n block = {'index': None, # before mining set index to None\r\n 'timestamp': None, # before mining set timestamp to None\r\n 'nonce': 0, # before mining set nonce to 0\r\n 'transactions': self.transaction_pool, # Fill in all the transactions\r\n 'previous_hash': previous_hash, # Set the previous hash\r\n 'current_hash': ''} # Current hash is yet to be calculated\r\n\r\n # Empty Transaction Pool\r\n self.transaction_pool = [] # Once transactions have been placed in a block\r\n # they can be removed from the pool\r\n\r\n # Calculate Proof Of Work (Nonce)\r\n block['nonce'], block['current_hash'] = self.proof_of_work(block, previous_hash) # Validate the block by calculating the nonce\r\n block['index'] = len(self.chain) + 1 # Set the block index\r\n block['timestamp'] = str(datetime.datetime.now()) # Set the timestamp to the time when the block was validated\r\n\r\n # Add Block To DistrictNode's Own Chain\r\n self.chain.append(block) # Append the block to the list of blocks in the blockchain\r\n print(\"BLOCK ADDED TO 90\")\r\n for block in self.chain:\r\n for key, value in block.items():\r\n print(key, value)\r\n print('\\n')\r\n\r\n return self.chain, self.transaction_pool # Return the new chain and the new transaction_pool\r","def create_block(self, x, y, block_type):\n sprite_stack = self.get_sprite(x, y)\n if sprite_stack:\n sprite = sprite_stack[-1]\n sprite.image = block_type\n return\n\n # no existing block, so create a new one\n block_x = x * self.block_x + self.offset_x + self.menu_x\n block_y = y * self.block_y + self.offset_y\n\n bar = Sprite(\"\", image_data=block_type, x=block_x, y=block_y)\n if (x, y) in self.sprites:\n self.sprites[(x, y)].append(bar)\n else:\n self.sprites[(x, y)] = [bar]","def createInnerRepresentation(self):\n\n for idx, single_block in enumerate(self._block_list):\n del self._to_be_processed[:]\n del self._metastring_rest[:]\n self._metastring_rest.append(self._metastring[idx])\n self.addMetastringPointer(single_block)","def add_block(self, env):\n block_size = (0.04, 0.04, 0.04)\n block_pose = self.random_pose(env, block_size)\n block_urdf = 'assets/stacking/block.urdf'\n block_id = env.add_object(block_urdf, block_pose)\n self.object_points[block_id] = np.float32((0, 0, 0)).reshape(3, 1)\n self._IDs[block_id] = 'block'\n return block_id","def make_genesis_block():\n block = Block(index=0,\n timestamp=datetime.now(),\n data=\"Genesis Block\",\n previous_hash=\"0\")\n return block","def MakeBlock(self, *args):\n return _BRepAlgo.BRepAlgo_EdgeConnector_MakeBlock(self, *args)","def newCDataBlock(self, content, len):\n ret = libxml2mod.xmlNewCDataBlock(self._o, content, len)\n if ret is None:raise treeError('xmlNewCDataBlock() failed')\n __tmp = xmlNode(_obj=ret)\n return __tmp","def Block(self):\n self.currtok = next(self.tg)\n statements = self.Statements()\n if self.currtok[1].name == \"RCURLY\":\n self.currtok = next(self.tg)\n\n return BlockExpr(statements.get_lst())\n\n raise SLUCSyntaxError(\"ERROR: Right Curly Brace on line {0}\".format(str(self.currtok[2] - 1)))","def make_block_ptr(base: tensor, shape, strides, offsets, block_shape, order, _builder=None):\n return semantic.make_block_ptr(base, shape, strides, offsets, block_shape, order, _builder)","def open_subblock(self, lines: Tuple[int, int], name: str, size: Tuple[int, int], color=None) -> None:","def create_genesis_block(self):\r\n genesis_block = Block(0, [], time.time(), \"0\")\r\n genesis_block.hash = genesis_block.compute_hash()\r\n self.chain.append(genesis_block)","def create_genesis_block(self):\n index = 0\n transactions = []\n timestamp = 0.0\n previous_hash = \"0\"*64\n block = Block(index=index, transactions=transactions, timestamp=timestamp,previous_hash=previous_hash)\n block.hash = block.compute_hash()\n self.chain.append(block)","def copy(self):\n args = []\n for arg in self.args:\n if isinstance(arg, Block):\n arg = arg.copy()\n elif isinstance(arg, list):\n arg = [b.copy() for b in arg]\n args.append(arg)\n return Block(self.type, *args)","def new_block(self, proof, previous_hash=None):\n servers = [\n \"1.us.pool.ntp.org\",\n \"2.us.pool.ntp.org\",\n \"3.us.pool.ntp.org\"\n ]\n\n response = {}\n\n try:\n response = self.c.request('0.us.pool.ntp.org')\n except Exception:\n for server in servers:\n try:\n response = self.c.request(server)\n\n if response:\n break\n\n except Exception:\n print('\\n //// alternate ntp server didnt work')\n\n block = {\n 'message': 'New Block Forged',\n 'index': len(self.chain) + 1,\n 'timestamp': response.tx_time or time(),\n 'transactions': self.current_transactions,\n 'proof': proof,\n 'previous_hash': previous_hash or self.chain[-1]['hash'],\n }\n\n # Calculate the hash of this new Block\n block['hash'] = self.hash(block)\n\n # Reset the current list of transactions\n self.current_transactions = []\n\n self.chain.append(block)\n return block","def create_block(self, prev_hash=None):\n # Update blockchain and balance state (thread safe)\n if prev_hash is not None and prev_hash not in self._blockchain.hash_block_map.keys():\n print(prev_hash, self._blockchain.hash_block_map)\n prev_blk = None if prev_hash is None else \\\n self._blockchain.hash_block_map[prev_hash]\n last_blk = self._update(prev_blk)\n pending_tx = self._get_tx_pool()\n gathered_tx = self._gather_transactions(pending_tx)\n block = self._mine_new_block(last_blk.header, gathered_tx)\n if block is not None:\n blk_json = block.to_json()\n # Add block to blockchain (thread safe)\n self.add_block(blk_json)\n print(f\"{self.__class__.__name__} {self.name} created a block.\")\n # Broadcast block and the header.\n self._broadcast_block(block)\n # Remove gathered transactions from pool and them to added pile\n with self.added_tx_lock:\n self._added_transactions |= set(gathered_tx)\n self._update()\n return block","def newfragment(self):\n newfragment = fragment()\n self.addfragment(newfragment)\n return newfragment","def create_block(self, proof, previous_hash=None):\n\n block = {\n 'index': len(self.chain) + 1,\n 'timestamp': time(),\n 'transactions': self.current_transactions,\n 'proof': proof,\n 'previous_hash': previous_hash,\n }\n\n # Reset current list of transactions\n self.current_transactions = []\n\n self.chain.append(block)\n return block","def splitblock(self, name=None, terminate=False):\n # -------------------------------------------------\n # Sanity check\n\n # Allow splitting only after leaders and before terminator\n # TODO: error check\n\n # -------------------------------------------------\n # Split\n\n oldblock = self._curblock\n newblock = self.func.new_block(name or 'block', after=self._curblock)\n op = self._lastop\n\n # Terminate if requested and not done already\n if terminate and not ops.is_terminator(op):\n op = self.jump(newblock)\n\n # -------------------------------------------------\n # Move ops after the split to new block\n\n if op:\n if op == 'head':\n trailing = list(self._curblock.ops)\n elif op == 'tail':\n trailing = []\n else:\n trailing = list(op.block.ops.iter_from(op))[1:]\n\n for op in trailing:\n op.unlink()\n newblock.extend(trailing)\n\n # -------------------------------------------------\n # Patch phis\n\n if terminate:\n self._patch_phis(oldblock.ops, oldblock, newblock)\n else:\n for op in oldblock:\n for use in self.func.uses[op]:\n if use.opcode == 'phi':\n raise error.CompileError(\n \"Splitting this block would corrupt some phis\")\n\n self._patch_phis(newblock.ops, oldblock, newblock)\n\n return oldblock, newblock","def create_child(self, user_id, parent_usage_key, block_type, block_id=None, fields=None, asides=None, **kwargs): # lint-amnesty, pylint: disable=arguments-differ\n with self.bulk_operations(parent_usage_key.course_key):\n xblock = self.create_item(\n user_id, parent_usage_key.course_key, block_type, block_id=block_id, fields=fields, asides=asides,\n **kwargs)\n\n # skip attach to parent if xblock has 'detached' tag\n if 'detached' in xblock._class_tags: # pylint: disable=protected-access\n return xblock\n\n # don't version the structure as create_item handled that already.\n new_structure = self._lookup_course(xblock.location.course_key).structure\n\n # add new block as child and update parent's version\n block_id = BlockKey.from_usage_key(parent_usage_key)\n if block_id not in new_structure['blocks']:\n raise ItemNotFoundError(parent_usage_key)\n\n parent = new_structure['blocks'][block_id]\n\n # Originally added to support entrance exams (settings.FEATURES.get('ENTRANCE_EXAMS'))\n if kwargs.get('position') is None:\n parent.fields.setdefault('children', []).append(BlockKey.from_usage_key(xblock.location))\n else:\n parent.fields.setdefault('children', []).insert(\n kwargs.get('position'),\n BlockKey.from_usage_key(xblock.location)\n )\n\n if parent.edit_info.update_version != new_structure['_id']:\n # if the parent hadn't been previously changed in this bulk transaction, indicate that it's\n # part of the bulk transaction\n self.version_block(parent, user_id, new_structure['_id'])\n self.decache_block(parent_usage_key.course_key, new_structure['_id'], block_id)\n\n # db update\n self.update_structure(parent_usage_key.course_key, new_structure)\n\n # don't need to update the index b/c create_item did it for this version\n return xblock","def generate_sub_blocks(rdd):\n ### BEGIN SOLUTION ###\n return rdd","def new_block(self, body_blocks, snake_head):\n\t\tx = randint(0, 35)\n\t\ty = randint(1, 26)\n\t\tself.rect.x = (25 * x) + 1\n\t\tself.rect.bottom = 25 * y\n\t\t\n\t\t# If new block is on snake, get new block\n\t\tif self.rect.x == snake_head.rect.x and self.rect.bottom == snake_head.rect.bottom:\n\t\t\tself.new_block(body_blocks, snake_head)\n\t\t\n\t\t# If new block is on any body block, get new block\n\t\tif body_blocks:\n\t\t\tfor i in range(len(body_blocks)):\n\t\t\t\tif self.rect.x == body_blocks[i].rect.x and self.rect.bottom == body_blocks[i].rect.bottom:\n\t\t\t\t\tself.new_block(body_blocks, snake_head)","def create_block(self, complete_hash, nonce):\n print(\"Creating block with hash: '%s'\" % complete_hash)\n block = Block(complete_hash, nonce)\n for transaction in self.transactions:\n block.add_transaction(transaction)\n return block","def create_genesis_block(self):\n genesis_block = Block(0, [], time.time(), \"0\")\n genesis_block.hash = genesis_block.compute_hash()\n self.chain.append(genesis_block)","def add_block(self, cxnode, code, **magic_vars):\n ast = cparse(code)\n # ast.show()\n generator = MagicCGenerator(cxnode, magic_vars)\n generator.indent_level = self.indent_level\n hdr = '\\n%s// %s\\n' % (' ' * self.indent_level,\n cxnode.__class__.__name__)\n self.code += hdr + generator.visit(ast)","def _construct_block(self, block_info):\n layer_name = block_info[0]\n if layer_name=='Conv2d':\n in_channels, out_channels, kernel_size = block_info[1:]\n return nn.Conv2d(in_channels=in_channels,\n out_channels=out_channels,\n kernel_size=kernel_size)\n elif layer_name=='ReLU':\n return nn.ReLU(inplace=True)\n elif layer_name=='MaxPool2d':\n kernel_size, stride = block_info[1:]\n return nn.MaxPool2d(kernel_size=kernel_size,\n stride=stride)\n elif layer_name=='BatchNorm2d':\n num_features = block_info[1]\n return nn.BatchNorm2d(num_features=num_features)\n elif layer_name=='Linear':\n in_features, out_features = block_info[1:]\n return nn.Linear(in_features=in_features,\n out_features=out_features)\n else:\n raise Exception(\"_construct_block cannot construct block\")","def create_genesis(self):\n return Block(0, 0, b'0', b'0', b'')","def _create_item(self, category, name, data, metadata, parent_category, parent_name, draft=True, split=True):\r\n location = self.old_course_key.make_usage_key(category, name)\r\n if not draft or category in DIRECT_ONLY_CATEGORIES:\r\n mongo = self.old_mongo\r\n else:\r\n mongo = self.draft_mongo\r\n mongo.create_and_save_xmodule(location, data, metadata, self.runtime)\r\n if isinstance(data, basestring):\r\n fields = {'data': data}\r\n else:\r\n fields = data.copy()\r\n fields.update(metadata)\r\n if parent_name:\r\n # add child to parent in mongo\r\n parent_location = self.old_course_key.make_usage_key(parent_category, parent_name)\r\n if not draft or parent_category in DIRECT_ONLY_CATEGORIES:\r\n mongo = self.old_mongo\r\n else:\r\n mongo = self.draft_mongo\r\n parent = mongo.get_item(parent_location)\r\n parent.children.append(location)\r\n mongo.update_item(parent, self.userid)\r\n # create pointer for split\r\n course_or_parent_locator = BlockUsageLocator(\r\n course_key=self.split_course_key,\r\n block_type=parent_category,\r\n block_id=parent_name\r\n )\r\n else:\r\n course_or_parent_locator = self.split_course_key\r\n if split:\r\n self.split_mongo.create_item(course_or_parent_locator, category, self.userid, block_id=name, fields=fields)","def add_block2(_input, growth_rate, layers_per_block, bc_mode, is_training):\n output = _input\n for layer in range(layers_per_block):\n with tf.variable_scope(\"layer_%d\" % layer):\n output = add_internal_layer(output, growth_rate, bc_mode=bc_mode, is_training=is_training)\n return output","def create_genesis_block(self):\n genesis_block = Block(0, [], 0, \"0\")\n genesis_block.hash = genesis_block.compute_hash()\n self.chain.append(genesis_block)","def create_genesis_block(self):\n genesis_block = Block(0, [], 0, \"0\")\n genesis_block.hash = genesis_block.compute_hash()\n self.chain.append(genesis_block)","def add_block_as_child_node(self, block, node):\n child = etree.SubElement(node, \"unknown\")\n block.add_xml_to_node(child)","def add(self, block):\n\n try:\n self.blocks[block.height]\n except:\n\n self.blocks[block.height] = [block]\n if self.current_height < block.height:\n self.current_height = block.height\n return\n\n if not block.hash() in [b.hash() for b in self.blocks[block.height]]:\n self.blocks[block.height].append(block)\n loggerutil.debug(\"fork detected for height:\" + str(block.height) +\n \"block candidats:\" + str(self.blocks[block.height]))\n if self.current_height < block.height:\n self.current_height = block.height","def new_child(self,instance):\n\t\treturn self.cu_for_new_child(instance,False)","def blockMirror_create(self, forceNew = False):\n try:\n _str_func = 'blockMirror_create'\n _side = get_sideMirror(self)\n _blockType = self.blockType\n if not _side:\n log.error(\"|{0}| >> Block is not sided. Can't create mirror\".format(_str_func, self.mNode)) \n return False\n \n if self.getMessage('blockMirror'):\n mMirror = self.blockMirror\n log.debug(\"|{0}| >> blockMirror found {1} \".format(_str_func, mMirror))\n if not forceNew:\n return mMirror\n log.debug(\"|{0}| >> focing new... \".format(_str_func, mMirror)) \n mMirror.delete()\n \n log.debug(\"|{0}| >> blockParent....\".format(_str_func))\n mBlockParent = self.p_blockParent\n if mBlockParent and mBlockParent.getMessage('blockMirror'):\n mBlockParent = mBlockParent.blockMirror\n log.debug(\"|{0}| >> blockParent has blockMirror: {1}\".format(_str_func,mBlockParent))\n \n log.debug(\"|{0}| >> Creating mirror block. {1} | {2}\".format(_str_func, _blockType, _side))\n \n _d = {'blockType':self.blockType, 'side':_side,\n 'autoForm':False,\n 'blockParent':mBlockParent,\n \n #'baseAim':[self.baseAimX,-self.baseAimY,self.baseAimZ],\n 'baseSize':baseSize_get(self)}\n \n for a in 'blockProfile','buildProfile','cgmName':\n if a in ['cgmName']:\n _d['name'] = self.getMayaAttr(a)\n else:\n _d[a] = self.getMayaAttr(a)\n\n \n log.debug(\"|{0}| >> Block settings...\".format(_str_func, self.mNode)) \n #pprint.pprint(_d)\n \n mMirror = cgmMeta.createMetaNode('cgmRigBlock',\n **_d)\n \n \n \n blockDat = self.getBlockDat()\n blockDat['ud']['side'] = _side\n for k in ['baseSize','baseAim']:\n if blockDat['ud'].has_key(k):\n blockDat['ud'].pop(k)\n for a in 'XYZ':\n if blockDat['ud'].has_key(k+a):\n blockDat['ud'].pop(k+a)\n mMirror.blockDat = blockDat\n \n blockMirror_settings(self,mMirror)\n mMirror.saveBlockDat()\n _d = mMirror.blockDat\n _d['blockState']=self.getEnumValueString('blockState')\n\n mMirror.blockDat = _d\n \n \"\"\"\n for k,dIter in BLOCKSHARE._d_mirrorAttrCheck.iteritems():\n _check = blockDat['ud'].get(k)\n if _check:\n log.debug(\"|{0}| >> mirror dat check {1} | {2}\".format(_str_func, k, dIter))\n blockDat['ud'][k] = dIter.get(blockDat['ud'][k])\"\"\"\n \n \"\"\"\n #Mirror some specfic dat\n if blockDat.get('form'):\n _subShapers = blockDat['form'].get('subShapers',{})\n log.debug(\"|{0}| >> subShaper dat mirror...\".format(_str_func, self.mNode)) \n \n for i,d_sub in _subShapers.iteritems():\n l_t = d_sub.get('t')\n l_r = d_sub.get('r')\n l_s = d_sub.get('s')\n \n for ii,d_list in enumerate(l_t):\n d_list[0] = d_list[0]*-1\n for ii,d_list in enumerate(l_r):\n d_list[0] = d_list[0]*-1 \n d_list[1] = d_list[1]*-1\n \n _subShapers[str(i)]['r'][ii] = l_r\n _subShapers[str(i)]['r'][ii] = l_t\"\"\"\n \n\n self.connectChildNode(mMirror,'blockMirror','blockMirror')#Connect\n mMirror.p_blockParent = mBlockParent\n \n blockDat_load(mMirror,useMirror=True,redefine=True)\n controls_mirror(self,mMirror)\n return mMirror\n except Exception,err:cgmGEN.cgmException(Exception,err)","def extend_template(base, text):\n\n block_search = re.compile(\"{{(block) (\\w+)}}\")\n has_blocks = re.search(block_search, base)\n if not has_blocks:\n return base\n else:\n find_content = re.compile(\"({{block \"+has_blocks.group(2)+\"}})(.*?)({{endblock}})\", re.DOTALL)\n \n content = re.search(find_content, text).group(2)\n base = re.sub(\"{{block \"+has_blocks.group(2)+\"}}\", content, base)\n return extend_template(base, text)","def create_item(self, parent, block):\r\n li = util.etree.SubElement(parent, 'li')\r\n self.parser.parseBlocks(li, [block])","def create_block(self, nonce, previous_hash):\n block = {'block_number': transaction_blocks.count() + 1,\n 'timestamp': ctime(t),\n 'transactions': self.transactions,\n 'nonce': nonce,\n 'previous_hash': previous_hash}\n\n # Reset the current list of transactions\n self.transactions = []\n self.chain.append(block)\n return block","def add_basic_block(self, basic_block):\n self.basic_blocks.append(basic_block)\n basic_block.function = self","def pack(cls, blocks, *args, **kwargs) -> None:\n\n if not blocks:\n raise BlockError(\"At least one block must be provided\")\n\n # The new block will be added here\n parent = blocks[0].parent\n\n # All of the blocks must share the same parent\n if not all(blk.parent is parent for blk in blocks):\n raise BlockError(\"All of the blocks must share the same parent\")\n\n # Store all existing connections\n connections = set()\n for port in chain.from_iterable([blk.ports for blk in blocks]):\n\n if port.is_in:\n connections.update((ups, port) for ups in port.upstream)\n else:\n connections.update((port, dws) for dws in port.downstream)\n\n # Create a new block instance and place in under the parent\n block = cls(*args, **kwargs, parent=parent)\n\n # Move blocks under parent block\n for blk in blocks:\n blk.parent = block\n\n # Restore connections\n for p1, p2 in connections:\n try:\n p1.feed(p2)\n\n # If connection adding has failed, it probably means that this is an external connection,\n # therefore we add an intermediate port\n except PortError:\n\n def add_proxy_from(p):\n if p.is_in and not p.auxiliary:\n return block.In.new(f'{p.block.name}_{p.name}')\n\n elif p.is_in and p.auxiliary:\n return block.AuxIn.new(f'{p.block.name}_{p.name}')\n\n elif not p.is_in and not p.auxiliary:\n return block.Out.new(f'{p.block.name}_{p.name}')\n\n else:\n return block.AuxOut.new(f'{p.block.name}_{p.name}')\n\n # The case when p1 is outside\n if p2.block.parent is block:\n new_port = add_proxy_from(p2)\n\n # The case when p2 is outside\n else:\n # Add new port\n new_port = add_proxy_from(p1)\n\n p1.feed(new_port)\n new_port.feed(p2)\n\n block.ports.sort()","def add_block(self, env, block_color, width, height):\n\n block_size = (0.04, 0.04, 0.04)\n block_urdf = \"stacking/block.urdf\"\n block_pose = self.get_random_pose(env, block_size)\n block_id = env.add_object(block_urdf, block_pose)\n pb.changeVisualShape(\n block_id, -1, rgbaColor=utils.COLORS[block_color] + [1])\n # (0, None): 0 means that the block is symmetric.\n # TODO(hagrawal): Not sure what None means. Update. This is kept\n # for CLIPort compatibility. We don't use it.\n self.blocks.append((block_id, (0, None)))\n block_pix = utils.xyz_to_pix(block_pose[0], self.bounds, self.pix_size)\n block_obj_info = {\n \"obj_id\": block_id,\n \"pose\": block_pose,\n \"size\": block_size,\n \"urdf\": block_urdf,\n \"color\": block_color,\n \"unknown_color\": block_color in utils.EVAL_COLORS,\n \"pix\": block_pix,\n \"region\": determine_region(block_pix[0], block_pix[1], width, height),\n }\n return block_obj_info","def make_sub(self, sub):\n [lu, subs] = [self.lineup, self.subs]\n if 'PositionSwitch' in str(type(sub)):\n done = False\n for player in lu:\n if player.id == sub.player:\n done = True\n player.switch.append(player.pos)\n player.pos = sub.pos\n if sub.pos in player.switch:\n player.switch.remove(sub.pos)\n if not done:\n sub_idx = find_player_index(subs, sub.player)\n if sub.pos == 'p':\n subs[sub_idx].status = 'entered'\n if not len([s for s in lu if s.pos == 'p']) > 0:\n subs[sub_idx].order = 10\n lu.append(subs.pop(sub_idx))\n else:\n print(\"ERROR: NOT SURE WHAT TO DO WITH SUB\")\n print([p.__dict__ for p in lu])\n print(sub.__dict__)\n\n elif 'OffensiveSub' in str(type(sub)):\n lu_idx = find_player_index(lu, sub.sub)\n sub_idx = find_player_index(subs, sub.player)\n if sub_idx is None:\n print(\"ERROR: \" + str(sub.__dict__))\n else:\n if subs[sub_idx].status == 'removed':\n print('ILLEGAL SUB ' + str(subs[sub_idx].__dict__))\n if not lu_idx is None:\n lu[lu_idx].status = 'removed'\n subs.append(lu.pop(lu_idx))\n lu.insert(lu_idx, subs.pop(sub_idx))\n\n elif 'DefensiveSub' in str(type(sub)):\n lu_idx = find_player_index(lu, sub.sub)\n sub_idx = find_player_index(subs, sub.player)\n if sub_idx is None:\n if sub.pos == 'p':\n sub_idx = find_player_index(lu, sub.player)\n if not sub_idx is None and not lu_idx is None:\n add = lu[sub_idx]\n lu[lu_idx].status = 'removed'\n subs.append(lu.pop(lu_idx))\n lu.insert(lu_idx, add)\n if lu[lu_idx].order == 10:\n lu[lu_idx].order = lu_idx+1\n else:\n print(\"ERROR: \" + str(sub.__dict__))\n else:\n if subs[sub_idx].status == 'removed':\n print('ILLEGAL SUB ' + str(subs[sub_idx].__dict__ ))\n if not lu_idx is None: \n lu[lu_idx].status = 'removed'\n if lu[lu_idx].order != subs[sub_idx].order:\n print(\"ASSUMING ORDER FOR SUB: \" + subs[sub_idx].name)\n subs[sub_idx].order = lu[lu_idx].order\n for p in lu:\n if p.pos == subs[sub_idx].pos:\n p.pos = ''\n subs.append(lu.pop(lu_idx))\n lu.insert(lu_idx, subs.pop(sub_idx))\n\n elif 'Removal' in str(type(sub)):\n if lu[-1].id == sub.sub:\n lu_idx = len(lu)-1\n else:\n lu_idx = find_player_index(lu, sub.sub)\n if not lu_idx is None:\n lu[lu_idx].status = 'removed'\n subs.append(lu.pop(lu_idx))\n \n\n [self.lineup, self.subs] = [lu, subs]","def create_submodule(self, *args: Any, **kwargs: Any) -> Submodule:\n return Submodule.add(self, *args, **kwargs)","def _create_vertical(self, parent_usage_key=None):\r\n resp = self.create_xblock(category='vertical', parent_usage_key=parent_usage_key)\r\n self.assertEqual(resp.status_code, 200)\r\n return self.response_usage_key(resp)","def duplicate2(self):\n try:\n _str_func = 'blockDuplicate'\n mDup = cgmMeta.createMetaNode('cgmRigBlock',blockType = self.blockType, autoForm=False)\n mDup.loadBlockDat(self.getBlockDat())\n mDup.doName()\n return mDup\n except Exception,err:cgmGEN.cgmExceptCB(Exception,err)","def add_node_as_child(self, block, node, id_generator=None):\n usage_id = self._usage_id_from_node(node, block.scope_ids.usage_id, id_generator)\n block.children.append(usage_id)","def mine(self):\n last_block = self.chain[-1]\n\n nonce = self.proof_of_work()\n previous_hash = self.hash(last_block)\n self.create_block(nonce, previous_hash)","def create_origin_block(self):\n # creating a new hash object and finding new hash with empty string.\n hash = hashlib.sha256()\n hash.update(''.encode('utf-8'))\n # Instantiating a new block with data 'Origin', and for previous hash we'll give the hash generated by empty string\n origin_block = Block('Origin', hash)\n # Mine the block with the difficulty level of the chain\n origin_block.mine(self.difficulty)\n # Appending it to the mined block list\n self.blocks.append(origin_block)","def create_xblock(usage, student_id=None):\n block_cls = XBlock.load_class(usage.block_name)\n runtime = StuviewRuntime(block_cls, student_id, usage)\n model = DbModel(SCOPED_KVS, block_cls, student_id, usage)\n block = block_cls(runtime, model)\n return block","def init_blocks(self):\n length = self.physics.len_blocks\n rect = Rectangle(Vector(self.rpos.x, self.rpos.y),\n Vector(self.rpos.x + length, self.rpos.y + length))\n self.rects.append(rect)\n self.physics.add_block(rect, self.stype)","def CreateBlock(self, props):\n # Set some default properties\n\n # blk / cfg | name | name+inst\n # -----------------------------\n # name | n==n | False\n # name+inst | n==n | n==n&&i==i\n if 'ordinal' not in props and 'name' in props:\n for ordinal, ni in self.config.get('ordinals', {}).items():\n if isinstance(ni, str):\n # Config only has name, don't care about block\n if props['name'] == ni:\n props['ordinal'] = ordinal\n break\n elif 'instance' not in props:\n # Config has name+instance, block only has name\n continue\n else:\n # Config has name+instance, block has name+instance\n if props['name'] == ni[0] and props['instance'] == ni[1]:\n props['ordinal'] = ordinal\n break\n\n # Compute a block ID\n if 'name' in props:\n bid = props['name'].replace('-', '')\n else:\n bid = \"block\"\n\n if bid in self.blocks:\n i = 1\n while bid+str(i) in self.blocks:\n i += 1\n bid = bid+str(i)\n\n # Actually create block\n self.blocks[bid] = blk = Block(bid, props)\n blk.changed.handler(lambda: self.blockchanged(blk))\n\n self.blockadded(blk)\n\n return blk","def begin():\n return BeginBlock()","def _create_xblock(self, parent_loc, xblock_desc):\r\n create_payload = {\r\n 'category': xblock_desc.category,\r\n 'display_name': xblock_desc.display_name,\r\n }\r\n\r\n if parent_loc is not None:\r\n create_payload['parent_locator'] = parent_loc\r\n\r\n # Create the new XBlock\r\n response = self.session.post(\r\n STUDIO_BASE_URL + '/xblock/',\r\n data=json.dumps(create_payload),\r\n headers=self.headers,\r\n )\r\n\r\n if not response.ok:\r\n msg = \"Could not create {0}. Status was {1}\".format(xblock_desc, response.status_code)\r\n raise CourseFixtureError(msg)\r\n\r\n try:\r\n loc = response.json().get('locator')\r\n\r\n except ValueError:\r\n raise CourseFixtureError(\"Could not decode JSON from '{0}'\".format(response.content))\r\n\r\n # Configure the XBlock\r\n response = self.session.post(\r\n STUDIO_BASE_URL + '/xblock/' + loc,\r\n data=xblock_desc.serialize(),\r\n headers=self.headers,\r\n )\r\n\r\n if response.ok:\r\n return loc\r\n else:\r\n raise CourseFixtureError(\r\n \"Could not update {0}. Status code: {1}\".format(\r\n xblock_desc, response.status_code))","def createChild(self):\n childName = self._generateChildName()\n zincRegion = self._zincRegion.createChild(childName)\n if zincRegion.isValid():\n childRegion = NeonRegion(childName, zincRegion, self)\n self._children.append(childRegion)\n self._informRegionChange(True)\n return childRegion\n return None","def add_block(self, name):\n\n if not self.RE_NAME.match(name):\n raise ValueError(u\"Invalid block name '{0}'\"\n .format(common.from_utf8(name)))\n\n if name in self._block_map:\n raise ValueError(u\"Block '{0}' already exists\"\n .format(common.from_utf8(name)))\n\n # add new block and index mapping\n self._block_map[name] = len(self._ast[2]) # must come first\n option_list = []\n block = [name, option_list]\n self._ast[2].append(block)","def create_block():\n global BLOCK\n posx = SEG_SIZE * random.randint(1, (WIDTH-SEG_SIZE) / SEG_SIZE)\n posy = SEG_SIZE * random.randint(1, (HEIGHT-SEG_SIZE) / SEG_SIZE)\n BLOCK = c.create_oval(posx, posy,\n posx+SEG_SIZE, posy+SEG_SIZE,\n fill=\"red\")\n # print(posx, posy)\n return posx, posy","def add_block(_input, growth_rate, layers_per_block, bc_mode, name, is_training):\n output = _input\n for layer in range(layers_per_block):\n with tf.variable_scope(\"%s_layer_%d\" % (name, layer)):\n output = add_internal_layer(output, growth_rate, bc_mode=bc_mode, is_training=is_training)\n return output"],"string":"[\n \"def gen_new_block(self):\\n block = BasicBlock()\\n self.blocks.append(block)\\n return block\",\n \"def newblock(self, parent=None):\\n block = ControlBlock()\\n self.blocks.add(block)\\n if parent:\\n parent.add_child(block)\\n return block\",\n \"def newblock(self, parent=None, **kwargs):\\n block = ControlBlock(len(self.blocks), **kwargs)\\n self.blocks.append(block)\\n if parent:\\n parent.add_child(block)\\n\\n return block\",\n \"def nextblock(self, parent=None, **kwargs):\\n block = self.newblock(parent, **kwargs)\\n if not parent and self.block:\\n self.block.add_child(block)\\n\\n self.block = block\\n return block\",\n \"def nextblock(self, parent=None):\\n block = ControlBlock()\\n self.blocks.add(block)\\n if parent:\\n parent.add_child(block)\\n elif self.block:\\n self.block.add_child(block)\\n self.block = block\\n return self.block\",\n \"def add_new_block(self):\\n old_block = self.curr_block\\n self.curr_block = self.gen_new_block()\\n add_edge(old_block, self.curr_block)\",\n \"def NewBlock(self):\\n for i in self.matrix:\\n if 2 in i:\\n return()\\n blockType = self.bag.Choose()\\n subtractor = {\\\"I\\\" : 4, \\\"J\\\" : 3, \\\"L\\\" : 3, \\\"O\\\" : 2, \\\"S\\\" : 3, \\\"T\\\" : 3, \\\"Z\\\": 3}\\n x = random.randint(0, self.width - subtractor.get(blockType))\\n coords = []\\n if blockType == \\\"I\\\":\\n coords = [(x + i, 0) for i in range(4)]\\n elif blockType == \\\"J\\\":\\n coords = [(x + i, 0) for i in range(3)]\\n coords.append((x, 1))\\n elif blockType == \\\"L\\\":\\n coords = [(x + i, 0) for i in range(3)]\\n coords.append((x + 2, 1))\\n elif blockType == \\\"O\\\":\\n coords = [(x, 0), (x + 1, 0), (x, 1), (x + 1, 1)]\\n elif blockType == \\\"Z\\\":\\n coords = [(x, 0), (x + 1, 0), (x + 1, 1), (x + 2, 1)]\\n elif blockType == \\\"S\\\":\\n coords = [(x + 1, 0), (x + 2, 0), (x, 1), (x + 1, 1)]\\n elif blockType == \\\"T\\\":\\n coords = [(x, 0), (x + 1, 0), (x + 2, 0), (x + 1, 1)]\\n self.coords = coords\\n return(coords)\",\n \"def build_new_block(cls, data='', previous_block=None):\\n if previous_block:\\n new_index = previous_block.index+1\\n previous_hash = previous_block.hash\\n else:\\n new_index = 0\\n previous_hash = ''\\n timestamp = int(time.time())\\n block_hash = cls.build_block_hash(\\n index=new_index,\\n timestamp=timestamp,\\n data=data,\\n previous_hash=previous_hash\\n )\\n block = cls(\\n index=new_index,\\n previous_hash=previous_hash,\\n data=data,\\n timestamp=timestamp,\\n block_hash=block_hash\\n )\\n\\n return block\",\n \"def newBlock(preBlock, remitter, number, payee):\\r\\n index = preBlock.index + 1\\r\\n timestamp = int(round(time.time() * 1000))\\r\\n data = (remitter, number, payee).__str__()\\r\\n previousHash = preBlock.hash\\r\\n nounce = 0\\r\\n return Blockchain(index, data, timestamp, nounce, previousHash)\",\n \"def new_block(self, proof, previous_hash = None):\\n #create a new Block & adds it to the chain.\\n \\n block = {\\n 'index' : len(self.chain) + 1,\\n 'timestamp' : time(),\\n 'transactions' : self.pending_transactions,\\n 'proof' : proof,\\n 'previous_hash' : previous_hash or self.hash(self.chain[-1])\\n }\\n\\n # Reset the current list of transactions\\n self.pending_transactions = []\\n\\n self.chain.append(block)\\n return block\\n #pass\",\n \"def get_a_block(self, usage_id=None):\\r\\n scope_ids = Mock()\\r\\n if usage_id is None:\\r\\n usage_id = \\\"_auto%d\\\" % len(self.all_blocks)\\r\\n scope_ids.usage_id = usage_id\\r\\n block = self.system.construct_xblock_from_class(\\r\\n self.TestableInheritingXBlock,\\r\\n field_data=self.field_data,\\r\\n scope_ids=scope_ids,\\r\\n )\\r\\n self.all_blocks[usage_id] = block\\r\\n return block\",\n \"def switch(self):\\n base_block = self.base_block or self\\n self.next_block = Block(self.parent, base_block=base_block, py3_wrapper=self.py3_wrapper)\\n return self.next_block\",\n \"def createFirstBlock(self):\\n firstBlock = Block(0, self.__currentTransactionsList, 0, '00')\\n self.__chain.append(firstBlock)\",\n \"def new_block(self, proof, previous_hash=None):\\n \\n block = {\\n 'index': len(self.chain) + 1,\\n 'timestamp': time(),\\n 'transactions': self.current_transactions,\\n 'proof': proof,\\n 'previous_hash': previous_hash or self.hash(self.chain[-1]),\\n }\\n\\n # Reset the current list of transactions\\n self.current_transactions = []\\n # Add block to existing chain\\n self.chain.append(block)\\n return block\",\n \"def new_block(self, proof, previous_hash=None):\\n\\n\\t\\tblock = {\\n\\t\\t\\t'index': len(self.chain) + 1,\\n\\t\\t\\t'timestamp': time(),\\n\\t\\t\\t'transactions': self.current_transactions,\\n\\t\\t\\t'proof': proof,\\n\\t\\t\\t'previous_hash': previous_hash or self.hash(self.chain[-1]),\\t\\t\\n\\t\\t}\\n\\n\\t\\t#Reset current list of transactions\\n\\t\\tself.current_transactions = []\\n\\n\\t\\tself.chain.append(block)\\n\\t\\treturn block\",\n \"def exit_block(self, parent=None, **kwargs):\\n block = self.newblock(parent, have_code=False, is_exit=True, **kwargs)\\n self.blocks.pop()\\n return block\",\n \"def build_block(self, format_string):\\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\\n block = first_block\\n\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n value = token.group(0)\\n if token.group(\\\"block_start\\\"):\\n # Create new block\\n block = block.new_block()\\n elif token.group(\\\"block_end\\\"):\\n # Close block setting any valid state as needed\\n # and return to parent block to continue\\n if not block.parent:\\n raise Exception(\\\"Too many `]`\\\")\\n block = block.parent\\n elif token.group(\\\"switch\\\"):\\n # a new option has been created\\n block = block.switch()\\n elif token.group(\\\"placeholder\\\"):\\n # Found a {placeholder}\\n key = token.group(\\\"key\\\")\\n format = token.group(\\\"format\\\")\\n block.add(Placeholder(key, format))\\n elif token.group(\\\"literal\\\"):\\n block.add(Literal(value))\\n elif token.group(\\\"lost_brace\\\"):\\n # due to how parsing happens we can get a lonesome }\\n # eg in format_string '{{something}' this fixes that issue\\n block.add(Literal(value))\\n elif token.group(\\\"command\\\"):\\n # a block command has been found\\n block.set_commands(token.group(\\\"command\\\"))\\n elif token.group(\\\"escaped\\\"):\\n # escaped characters add unescaped values\\n if value[0] in [\\\"\\\\\\\\\\\", \\\"{\\\", \\\"}\\\"]:\\n value = value[1:]\\n block.add(Literal(value))\\n\\n if block.parent:\\n raise Exception(\\\"Block not closed\\\")\\n # add to the cache\\n self.block_cache[format_string] = first_block\",\n \"def new_block(self, proof, previous_hash=None):\\n\\n # Create the block\\n my_block = Block(proof=proof,\\n previous_hash=previous_hash or self.hash(self.last_block))\\n my_block.save()\\n\\n # Update current_transactions with this new block.\\n my_block_trans = self.current_transactions_obj\\n\\n for trans in Transaction.objects.filter(block__isnull=True):\\n trans.block = my_block\\n trans.save()\\n\\n block = {\\n 'index': my_block.id,\\n 'timestamp': my_block.timestamp,\\n 'transactions': list(Transaction.objects.filter(block=my_block).values()),\\n 'proof': my_block.proof,\\n 'previous_hash': my_block.previous_hash,\\n }\\n\\n return block\",\n \"def create_block(self):\\n return poet_transaction_block.PoetTransactionBlock()\",\n \"def _new_block(self, user_id, category, block_fields, definition_id, new_id, raw=False):\\r\\n if not raw:\\r\\n block_fields = self._serialize_fields(category, block_fields)\\r\\n return {\\r\\n 'category': category,\\r\\n 'definition': definition_id,\\r\\n 'fields': block_fields,\\r\\n 'edit_info': {\\r\\n 'edited_on': datetime.datetime.now(UTC),\\r\\n 'edited_by': user_id,\\r\\n 'previous_version': None,\\r\\n 'update_version': new_id\\r\\n }\\r\\n }\",\n \"def add_block(self, block_pf):\\n\\n # test si il s'agit du bloc genesis\\n if len(self.blocks) != 0:\\n # check si previous H est coherent avant ajout a chaine\\n if self.check_previousBlockH(block_pf.header['prevBlockH']):\\n self.blocks.append(block_pf)\\n else:\\n print \\\"== Probleme de parent\\\"\\n print \\\"= %s\\\" % block_pf.header['prevBlockH']\\n print \\\"= %s\\\" % getHashBlock(self.get_topBlock())\\n else:\\n self.blocks.append(block_pf)\",\n \"def addBlock(self, data):\\n #get the hashVal of last block in blockchain\\n lastHash = self.chain[len(self.chain) - 1].hashVal\\n timestamp = time()\\n hashVal = Block.hashSHA(timestamp, lastHash, data, NONCE, DIFFICULTY)\\n adding_block = Block(timestamp, lastHash, hashVal, data, NONCE, DIFFICULTY)\\n \\n self.chain.append(adding_block)\\n return adding_block\",\n \"def new_block(self, proof, previous_hash=None):\\n block = {\\n 'index': len(self.chain) + 1,\\n 'timestamp': time(),\\n 'transactions':self.current_transactions,\\n 'proof': proof,\\n 'previous_hash': previous_hash or self.hash(self.chain[-1]),\\n }\\n self.current_transactions = []\\n self.chain.append(block)\\n return block\",\n \"def build_nested_blocks(self):\\n pass\",\n \"def new_block(self, proof, previous_hash=None):\\r\\n block = {\\r\\n 'index': len(self.chain) + 1,\\r\\n 'timestamp': time(),\\r\\n 'transactions': self.current_transactions,\\r\\n 'proof': proof,\\r\\n 'previous_hash': previous_hash or self.hash(self.chain[-1]),\\r\\n }\\r\\n\\r\\n # reseta a atual lista de transacoes\\r\\n self.current_transactions = []\\r\\n\\r\\n self.chain.append(block)\\r\\n return block\",\n \"def _new_block(self, user_id, category, block_fields, definition_id, new_id, raw=False,\\n asides=None, block_defaults=None):\\n if not raw:\\n block_fields = self._serialize_fields(category, block_fields)\\n if not asides:\\n asides = {}\\n document = {\\n 'block_type': category,\\n 'definition': definition_id,\\n 'fields': block_fields,\\n 'asides': asides,\\n 'edit_info': {\\n 'edited_on': datetime.datetime.now(UTC),\\n 'edited_by': user_id,\\n 'previous_version': None,\\n 'update_version': new_id\\n }\\n }\\n if block_defaults:\\n document['defaults'] = block_defaults\\n return BlockData(**document)\",\n \"def make_block(self, in_size, out_size, **kwargs):\\n raise NotImplementedError(\\\"Abstract\\\")\",\n \"def new_block(self, previous_hash):\\n\\n block = {\\n 'index': len(self.chain) + 1,\\n 'timestamp': time(),\\n 'information': self.current_information,\\n 'previous_hash': previous_hash or self.hash(self.chain[-1]),\\n }\\n\\n # Reset the current list of transactions\\n self.current_information = []\\n\\n self.chain.append(block)\\n return block\",\n \"def addBlock(self, newBlock):\\n newBlock.index = len(self.chain)\\n newBlock.previousHash = self.chain[-1].hash\\n newBlock.mineBlock(self.difficulty)\\n self.chain.append(newBlock)\\n self.writeBlocks()\",\n \"def createBlock(self, block: ghidra.program.model.mem.MemoryBlock, name: unicode, start: ghidra.program.model.address.Address, length: long) -> ghidra.program.model.mem.MemoryBlock:\\n ...\",\n \"def makeBlock(tag):\\n return {\\\"t\\\":\\\"RawBlock\\\",\\\"c\\\":[\\\"html\\\",tag]}\",\n \"def _do_add_block(self, args):\\r\\n bus_type = args[1]\\r\\n slave_id = int(args[2])\\r\\n name = args[3]\\r\\n block_type = int(args[4])\\r\\n starting_address = int(args[5])\\r\\n length = int(args[6])\\r\\n if bus_type == 'rtu':\\r\\n slave = self.server._servers[0].get_slave(slave_id)\\r\\n elif bus_type == 'tcp':\\r\\n slave = self.server._servers[1].get_slave(slave_id)\\r\\n slave.add_block(name, block_type, starting_address, length)\\r\\n return name\",\n \"def createNewBlock(self, nonce, previousBlockHash, hash):\\n newBlock = Block(len(self.chain), self.pendingTransactions, nonce, hash, previousBlockHash)\\n self.pendingTransactions = []\\n self.chain.append(newBlock)\\n return newBlock\",\n \"def genesis_block(self):\\n block = Block(target=self.target, transactions=[])\\n self.current_transactions.append(block)\",\n \"def _initBlock(o,block):\\n o.block = block.clone().shift(*o.board.startPosition)\",\n \"def CreateBlock(audio):\\n\\n BitDepth = audio.getsampwidth() # Number of bytes\\n FrameList = []\\n BlockList = []\\n SamplesCursor = audio.tell() # Cursor inside audio file\\n NumSamples = audio.getnframes() # Num Samples inside audio file\\n StatusList = BuildStatusBits() # List with all status bits\\n StatusCursor = 0\\n\\n\\n # Take 2 samples and create the frist Frame\\n AudioSamples = audio.readframes(2)\\n Frame = CreateFrame(AudioSamples[0:2], AudioSamples[2:5],\\n StatusList, StatusCursor, BitDepth)\\n StatusCursor += 1\\n FrameList.append(Frame) # First Frame with Z preamble\\n\\n SamplesCursor = audio.tell()\\n while SamplesCursor != NumSamples:\\n if len(FrameList) == 192: # Each 192 frames we introduce a block\\n print(\\\"what is love\\\")\\n BlockList.append(FrameList)\\n FrameList = []\\n StatusCursor = 0 # We reset SampleCursor and FrameList\\n AudioSamples = audio.readframes(2)\\n Frame = CreateFrame(AudioSamples[0:2], AudioSamples[2:5],\\n StatusList, StatusCursor, BitDepth)\\n StatusCursor += 1\\n FrameList.append(Frame) # First Frame with Z preamble\\n\\n AudioSamples = audio.readframes(2)\\n Frame = CreateFrame(AudioSamples[0:2], AudioSamples[2:5],\\n StatusList, StatusCursor, BitDepth)\\n StatusCursor += 1\\n FrameList.append(Frame)\\n SamplesCursor = audio.tell() # Update cursor\\n\\n return BlockList\",\n \"def build_block(self, current, block_params):\\n block_args = {}\\n\\n # extract name\\n block_name = block_params['name']\\n\\n # save upper_tri flatten\\n self.preds_triu |= (block_name == 'upper_tri')\\n \\n # if Keras, get block variables names\\n pass_all_globals = True\\n if block_name[0].isupper():\\n pass_all_globals = False\\n block_func = blocks.keras_func[block_name]\\n block_varnames = block_func.__init__.__code__.co_varnames\\n\\n # set global defaults\\n global_vars = ['activation', 'batch_norm', 'bn_momentum', 'norm_type',\\n 'l2_scale', 'l1_scale', 'padding', 'kernel_initializer']\\n for gv in global_vars:\\n gv_value = getattr(self, gv, False)\\n if gv_value and (pass_all_globals or gv in block_varnames):\\n block_args[gv] = gv_value\\n\\n # set remaining params\\n block_args.update(block_params)\\n del block_args['name']\\n\\n # save representations\\n if block_name.find('tower') != -1:\\n block_args['reprs'] = self.reprs\\n\\n # U-net helper\\n if block_name[-5:] == '_unet':\\n # find matching representation\\n unet_repr = None\\n for seq_repr in reversed(self.reprs[:-1]):\\n if seq_repr.shape[1] == current.shape[1]*2:\\n unet_repr = seq_repr\\n break\\n if unet_repr is None:\\n print('Could not find matching representation for length %d' % current.shape[1], sys.stderr)\\n exit(1)\\n block_args['unet_repr'] = unet_repr\\n\\n # switch for block\\n if block_name[0].islower():\\n block_func = blocks.name_func[block_name]\\n current = block_func(current, **block_args)\\n\\n else:\\n block_func = blocks.keras_func[block_name]\\n current = block_func(**block_args)(current)\\n\\n return current\",\n \"def _make_block(self, model):\\n # TODO Make base class\\n assert model is not None, 'Top level model must be initialized first'\\n self.model = model\\n # If block is already present, remove it\\n if self.model.component(self.name) is not None:\\n self.model.del_component(self.name)\\n self.model.add_component(self.name, Block())\\n self.block = self.model.__getattribute__(self.name)\\n\\n self.logger.info(\\n 'Optimization block initialized for {}'.format(self.name))\",\n \"def build(self, block_size):\",\n \"def _get_block(self, pos):\\n raise NotImplementedError\",\n \"def get_block(self, usage_id, for_parent=None):\\n def_id = self.id_reader.get_definition_id(usage_id)\\n try:\\n block_type = self.id_reader.get_block_type(def_id)\\n except NoSuchDefinition:\\n raise NoSuchUsage(repr(usage_id)) # pylint: disable= raise-missing-from\\n keys = ScopeIds(self.user_id, block_type, def_id, usage_id)\\n block = self.construct_xblock(block_type, keys, for_parent=for_parent)\\n return block\",\n \"def create_entry_basic_block(self):\\n bb = BasicBlock(self)\\n self.basic_blocks.insert(0, bb)\\n return bb\",\n \"def new_block(self, proof, previous_hash=None):\\n block = {\\n 'index': len( self.chain ) + 1,\\n 'timestamp': time(),\\n 'transactions': self.current_transactions,\\n 'merkle': self.hash(self.current_transactions),\\n 'proof': proof,\\n 'previous_hash': previous_hash or self.hash(self.chain[-1])\\n }\\n\\n # Reset the current list of transactions\\n self.current_transactions = []\\n\\n # Add the block to the chain\\n self.chain.append( block )\\n self._write_chain()\\n\\n return block\",\n \"def prepare(block):\\n if block.parent:\\n block.parent = None\\n if not block.__dict__['is_open'] is None:\\n block.__dict__['open'] = block.is_open\\n del(block.is_open)\\n # trim empty elements...\\n for attr in dir(block):\\n if not callable(attr) and not attr.startswith(\\\"__\\\") and \\\\\\n attr != \\\"makeNode\\\" and attr != \\\"pretty\\\":\\n if block.__dict__[attr] in [\\\"\\\", [], None, {}]:\\n del(block.__dict__[attr])\\n if 'children' in block.__dict__ and len(block.children) > 0:\\n for i, child in enumerate(block.children):\\n block.children[i] = prepare(child)\\n if 'inline_content' in block.__dict__ and \\\\\\n len(block.inline_content) > 0:\\n for i, child in enumerate(block.inline_content):\\n block.inline_content[i] = prepare(child)\\n if 'label' in block.__dict__ and len(block.label) > 0:\\n for i, child in enumerate(block.label):\\n block.label[i] = prepare(child)\\n if 'c' in block.__dict__ and type(block.c) is list and \\\\\\n len(block.c) > 0:\\n for i, child in enumerate(block.c):\\n block.c[i] = prepare(child)\\n return block\",\n \"def create_block(self, previous_hash):\\r\\n if len(self.transaction_pool) < 1:\\r\\n return None, None\\r\\n\\r\\n # Create A Temporary Block\\r\\n block = {'index': None, # before mining set index to None\\r\\n 'timestamp': None, # before mining set timestamp to None\\r\\n 'nonce': 0, # before mining set nonce to 0\\r\\n 'transactions': self.transaction_pool, # Fill in all the transactions\\r\\n 'previous_hash': previous_hash, # Set the previous hash\\r\\n 'current_hash': ''} # Current hash is yet to be calculated\\r\\n\\r\\n # Empty Transaction Pool\\r\\n self.transaction_pool = [] # Once transactions have been placed in a block\\r\\n # they can be removed from the pool\\r\\n\\r\\n # Calculate Proof Of Work (Nonce)\\r\\n block['nonce'], block['current_hash'] = self.proof_of_work(block, previous_hash) # Validate the block by calculating the nonce\\r\\n block['index'] = len(self.chain) + 1 # Set the block index\\r\\n block['timestamp'] = str(datetime.datetime.now()) # Set the timestamp to the time when the block was validated\\r\\n\\r\\n # Add Block To DistrictNode's Own Chain\\r\\n self.chain.append(block) # Append the block to the list of blocks in the blockchain\\r\\n print(\\\"BLOCK ADDED TO 90\\\")\\r\\n for block in self.chain:\\r\\n for key, value in block.items():\\r\\n print(key, value)\\r\\n print('\\\\n')\\r\\n\\r\\n return self.chain, self.transaction_pool # Return the new chain and the new transaction_pool\\r\",\n \"def create_block(self, x, y, block_type):\\n sprite_stack = self.get_sprite(x, y)\\n if sprite_stack:\\n sprite = sprite_stack[-1]\\n sprite.image = block_type\\n return\\n\\n # no existing block, so create a new one\\n block_x = x * self.block_x + self.offset_x + self.menu_x\\n block_y = y * self.block_y + self.offset_y\\n\\n bar = Sprite(\\\"\\\", image_data=block_type, x=block_x, y=block_y)\\n if (x, y) in self.sprites:\\n self.sprites[(x, y)].append(bar)\\n else:\\n self.sprites[(x, y)] = [bar]\",\n \"def createInnerRepresentation(self):\\n\\n for idx, single_block in enumerate(self._block_list):\\n del self._to_be_processed[:]\\n del self._metastring_rest[:]\\n self._metastring_rest.append(self._metastring[idx])\\n self.addMetastringPointer(single_block)\",\n \"def add_block(self, env):\\n block_size = (0.04, 0.04, 0.04)\\n block_pose = self.random_pose(env, block_size)\\n block_urdf = 'assets/stacking/block.urdf'\\n block_id = env.add_object(block_urdf, block_pose)\\n self.object_points[block_id] = np.float32((0, 0, 0)).reshape(3, 1)\\n self._IDs[block_id] = 'block'\\n return block_id\",\n \"def make_genesis_block():\\n block = Block(index=0,\\n timestamp=datetime.now(),\\n data=\\\"Genesis Block\\\",\\n previous_hash=\\\"0\\\")\\n return block\",\n \"def MakeBlock(self, *args):\\n return _BRepAlgo.BRepAlgo_EdgeConnector_MakeBlock(self, *args)\",\n \"def newCDataBlock(self, content, len):\\n ret = libxml2mod.xmlNewCDataBlock(self._o, content, len)\\n if ret is None:raise treeError('xmlNewCDataBlock() failed')\\n __tmp = xmlNode(_obj=ret)\\n return __tmp\",\n \"def Block(self):\\n self.currtok = next(self.tg)\\n statements = self.Statements()\\n if self.currtok[1].name == \\\"RCURLY\\\":\\n self.currtok = next(self.tg)\\n\\n return BlockExpr(statements.get_lst())\\n\\n raise SLUCSyntaxError(\\\"ERROR: Right Curly Brace on line {0}\\\".format(str(self.currtok[2] - 1)))\",\n \"def make_block_ptr(base: tensor, shape, strides, offsets, block_shape, order, _builder=None):\\n return semantic.make_block_ptr(base, shape, strides, offsets, block_shape, order, _builder)\",\n \"def open_subblock(self, lines: Tuple[int, int], name: str, size: Tuple[int, int], color=None) -> None:\",\n \"def create_genesis_block(self):\\r\\n genesis_block = Block(0, [], time.time(), \\\"0\\\")\\r\\n genesis_block.hash = genesis_block.compute_hash()\\r\\n self.chain.append(genesis_block)\",\n \"def create_genesis_block(self):\\n index = 0\\n transactions = []\\n timestamp = 0.0\\n previous_hash = \\\"0\\\"*64\\n block = Block(index=index, transactions=transactions, timestamp=timestamp,previous_hash=previous_hash)\\n block.hash = block.compute_hash()\\n self.chain.append(block)\",\n \"def copy(self):\\n args = []\\n for arg in self.args:\\n if isinstance(arg, Block):\\n arg = arg.copy()\\n elif isinstance(arg, list):\\n arg = [b.copy() for b in arg]\\n args.append(arg)\\n return Block(self.type, *args)\",\n \"def new_block(self, proof, previous_hash=None):\\n servers = [\\n \\\"1.us.pool.ntp.org\\\",\\n \\\"2.us.pool.ntp.org\\\",\\n \\\"3.us.pool.ntp.org\\\"\\n ]\\n\\n response = {}\\n\\n try:\\n response = self.c.request('0.us.pool.ntp.org')\\n except Exception:\\n for server in servers:\\n try:\\n response = self.c.request(server)\\n\\n if response:\\n break\\n\\n except Exception:\\n print('\\\\n //// alternate ntp server didnt work')\\n\\n block = {\\n 'message': 'New Block Forged',\\n 'index': len(self.chain) + 1,\\n 'timestamp': response.tx_time or time(),\\n 'transactions': self.current_transactions,\\n 'proof': proof,\\n 'previous_hash': previous_hash or self.chain[-1]['hash'],\\n }\\n\\n # Calculate the hash of this new Block\\n block['hash'] = self.hash(block)\\n\\n # Reset the current list of transactions\\n self.current_transactions = []\\n\\n self.chain.append(block)\\n return block\",\n \"def create_block(self, prev_hash=None):\\n # Update blockchain and balance state (thread safe)\\n if prev_hash is not None and prev_hash not in self._blockchain.hash_block_map.keys():\\n print(prev_hash, self._blockchain.hash_block_map)\\n prev_blk = None if prev_hash is None else \\\\\\n self._blockchain.hash_block_map[prev_hash]\\n last_blk = self._update(prev_blk)\\n pending_tx = self._get_tx_pool()\\n gathered_tx = self._gather_transactions(pending_tx)\\n block = self._mine_new_block(last_blk.header, gathered_tx)\\n if block is not None:\\n blk_json = block.to_json()\\n # Add block to blockchain (thread safe)\\n self.add_block(blk_json)\\n print(f\\\"{self.__class__.__name__} {self.name} created a block.\\\")\\n # Broadcast block and the header.\\n self._broadcast_block(block)\\n # Remove gathered transactions from pool and them to added pile\\n with self.added_tx_lock:\\n self._added_transactions |= set(gathered_tx)\\n self._update()\\n return block\",\n \"def newfragment(self):\\n newfragment = fragment()\\n self.addfragment(newfragment)\\n return newfragment\",\n \"def create_block(self, proof, previous_hash=None):\\n\\n block = {\\n 'index': len(self.chain) + 1,\\n 'timestamp': time(),\\n 'transactions': self.current_transactions,\\n 'proof': proof,\\n 'previous_hash': previous_hash,\\n }\\n\\n # Reset current list of transactions\\n self.current_transactions = []\\n\\n self.chain.append(block)\\n return block\",\n \"def splitblock(self, name=None, terminate=False):\\n # -------------------------------------------------\\n # Sanity check\\n\\n # Allow splitting only after leaders and before terminator\\n # TODO: error check\\n\\n # -------------------------------------------------\\n # Split\\n\\n oldblock = self._curblock\\n newblock = self.func.new_block(name or 'block', after=self._curblock)\\n op = self._lastop\\n\\n # Terminate if requested and not done already\\n if terminate and not ops.is_terminator(op):\\n op = self.jump(newblock)\\n\\n # -------------------------------------------------\\n # Move ops after the split to new block\\n\\n if op:\\n if op == 'head':\\n trailing = list(self._curblock.ops)\\n elif op == 'tail':\\n trailing = []\\n else:\\n trailing = list(op.block.ops.iter_from(op))[1:]\\n\\n for op in trailing:\\n op.unlink()\\n newblock.extend(trailing)\\n\\n # -------------------------------------------------\\n # Patch phis\\n\\n if terminate:\\n self._patch_phis(oldblock.ops, oldblock, newblock)\\n else:\\n for op in oldblock:\\n for use in self.func.uses[op]:\\n if use.opcode == 'phi':\\n raise error.CompileError(\\n \\\"Splitting this block would corrupt some phis\\\")\\n\\n self._patch_phis(newblock.ops, oldblock, newblock)\\n\\n return oldblock, newblock\",\n \"def create_child(self, user_id, parent_usage_key, block_type, block_id=None, fields=None, asides=None, **kwargs): # lint-amnesty, pylint: disable=arguments-differ\\n with self.bulk_operations(parent_usage_key.course_key):\\n xblock = self.create_item(\\n user_id, parent_usage_key.course_key, block_type, block_id=block_id, fields=fields, asides=asides,\\n **kwargs)\\n\\n # skip attach to parent if xblock has 'detached' tag\\n if 'detached' in xblock._class_tags: # pylint: disable=protected-access\\n return xblock\\n\\n # don't version the structure as create_item handled that already.\\n new_structure = self._lookup_course(xblock.location.course_key).structure\\n\\n # add new block as child and update parent's version\\n block_id = BlockKey.from_usage_key(parent_usage_key)\\n if block_id not in new_structure['blocks']:\\n raise ItemNotFoundError(parent_usage_key)\\n\\n parent = new_structure['blocks'][block_id]\\n\\n # Originally added to support entrance exams (settings.FEATURES.get('ENTRANCE_EXAMS'))\\n if kwargs.get('position') is None:\\n parent.fields.setdefault('children', []).append(BlockKey.from_usage_key(xblock.location))\\n else:\\n parent.fields.setdefault('children', []).insert(\\n kwargs.get('position'),\\n BlockKey.from_usage_key(xblock.location)\\n )\\n\\n if parent.edit_info.update_version != new_structure['_id']:\\n # if the parent hadn't been previously changed in this bulk transaction, indicate that it's\\n # part of the bulk transaction\\n self.version_block(parent, user_id, new_structure['_id'])\\n self.decache_block(parent_usage_key.course_key, new_structure['_id'], block_id)\\n\\n # db update\\n self.update_structure(parent_usage_key.course_key, new_structure)\\n\\n # don't need to update the index b/c create_item did it for this version\\n return xblock\",\n \"def generate_sub_blocks(rdd):\\n ### BEGIN SOLUTION ###\\n return rdd\",\n \"def new_block(self, body_blocks, snake_head):\\n\\t\\tx = randint(0, 35)\\n\\t\\ty = randint(1, 26)\\n\\t\\tself.rect.x = (25 * x) + 1\\n\\t\\tself.rect.bottom = 25 * y\\n\\t\\t\\n\\t\\t# If new block is on snake, get new block\\n\\t\\tif self.rect.x == snake_head.rect.x and self.rect.bottom == snake_head.rect.bottom:\\n\\t\\t\\tself.new_block(body_blocks, snake_head)\\n\\t\\t\\n\\t\\t# If new block is on any body block, get new block\\n\\t\\tif body_blocks:\\n\\t\\t\\tfor i in range(len(body_blocks)):\\n\\t\\t\\t\\tif self.rect.x == body_blocks[i].rect.x and self.rect.bottom == body_blocks[i].rect.bottom:\\n\\t\\t\\t\\t\\tself.new_block(body_blocks, snake_head)\",\n \"def create_block(self, complete_hash, nonce):\\n print(\\\"Creating block with hash: '%s'\\\" % complete_hash)\\n block = Block(complete_hash, nonce)\\n for transaction in self.transactions:\\n block.add_transaction(transaction)\\n return block\",\n \"def create_genesis_block(self):\\n genesis_block = Block(0, [], time.time(), \\\"0\\\")\\n genesis_block.hash = genesis_block.compute_hash()\\n self.chain.append(genesis_block)\",\n \"def add_block(self, cxnode, code, **magic_vars):\\n ast = cparse(code)\\n # ast.show()\\n generator = MagicCGenerator(cxnode, magic_vars)\\n generator.indent_level = self.indent_level\\n hdr = '\\\\n%s// %s\\\\n' % (' ' * self.indent_level,\\n cxnode.__class__.__name__)\\n self.code += hdr + generator.visit(ast)\",\n \"def _construct_block(self, block_info):\\n layer_name = block_info[0]\\n if layer_name=='Conv2d':\\n in_channels, out_channels, kernel_size = block_info[1:]\\n return nn.Conv2d(in_channels=in_channels,\\n out_channels=out_channels,\\n kernel_size=kernel_size)\\n elif layer_name=='ReLU':\\n return nn.ReLU(inplace=True)\\n elif layer_name=='MaxPool2d':\\n kernel_size, stride = block_info[1:]\\n return nn.MaxPool2d(kernel_size=kernel_size,\\n stride=stride)\\n elif layer_name=='BatchNorm2d':\\n num_features = block_info[1]\\n return nn.BatchNorm2d(num_features=num_features)\\n elif layer_name=='Linear':\\n in_features, out_features = block_info[1:]\\n return nn.Linear(in_features=in_features,\\n out_features=out_features)\\n else:\\n raise Exception(\\\"_construct_block cannot construct block\\\")\",\n \"def create_genesis(self):\\n return Block(0, 0, b'0', b'0', b'')\",\n \"def _create_item(self, category, name, data, metadata, parent_category, parent_name, draft=True, split=True):\\r\\n location = self.old_course_key.make_usage_key(category, name)\\r\\n if not draft or category in DIRECT_ONLY_CATEGORIES:\\r\\n mongo = self.old_mongo\\r\\n else:\\r\\n mongo = self.draft_mongo\\r\\n mongo.create_and_save_xmodule(location, data, metadata, self.runtime)\\r\\n if isinstance(data, basestring):\\r\\n fields = {'data': data}\\r\\n else:\\r\\n fields = data.copy()\\r\\n fields.update(metadata)\\r\\n if parent_name:\\r\\n # add child to parent in mongo\\r\\n parent_location = self.old_course_key.make_usage_key(parent_category, parent_name)\\r\\n if not draft or parent_category in DIRECT_ONLY_CATEGORIES:\\r\\n mongo = self.old_mongo\\r\\n else:\\r\\n mongo = self.draft_mongo\\r\\n parent = mongo.get_item(parent_location)\\r\\n parent.children.append(location)\\r\\n mongo.update_item(parent, self.userid)\\r\\n # create pointer for split\\r\\n course_or_parent_locator = BlockUsageLocator(\\r\\n course_key=self.split_course_key,\\r\\n block_type=parent_category,\\r\\n block_id=parent_name\\r\\n )\\r\\n else:\\r\\n course_or_parent_locator = self.split_course_key\\r\\n if split:\\r\\n self.split_mongo.create_item(course_or_parent_locator, category, self.userid, block_id=name, fields=fields)\",\n \"def add_block2(_input, growth_rate, layers_per_block, bc_mode, is_training):\\n output = _input\\n for layer in range(layers_per_block):\\n with tf.variable_scope(\\\"layer_%d\\\" % layer):\\n output = add_internal_layer(output, growth_rate, bc_mode=bc_mode, is_training=is_training)\\n return output\",\n \"def create_genesis_block(self):\\n genesis_block = Block(0, [], 0, \\\"0\\\")\\n genesis_block.hash = genesis_block.compute_hash()\\n self.chain.append(genesis_block)\",\n \"def create_genesis_block(self):\\n genesis_block = Block(0, [], 0, \\\"0\\\")\\n genesis_block.hash = genesis_block.compute_hash()\\n self.chain.append(genesis_block)\",\n \"def add_block_as_child_node(self, block, node):\\n child = etree.SubElement(node, \\\"unknown\\\")\\n block.add_xml_to_node(child)\",\n \"def add(self, block):\\n\\n try:\\n self.blocks[block.height]\\n except:\\n\\n self.blocks[block.height] = [block]\\n if self.current_height < block.height:\\n self.current_height = block.height\\n return\\n\\n if not block.hash() in [b.hash() for b in self.blocks[block.height]]:\\n self.blocks[block.height].append(block)\\n loggerutil.debug(\\\"fork detected for height:\\\" + str(block.height) +\\n \\\"block candidats:\\\" + str(self.blocks[block.height]))\\n if self.current_height < block.height:\\n self.current_height = block.height\",\n \"def new_child(self,instance):\\n\\t\\treturn self.cu_for_new_child(instance,False)\",\n \"def blockMirror_create(self, forceNew = False):\\n try:\\n _str_func = 'blockMirror_create'\\n _side = get_sideMirror(self)\\n _blockType = self.blockType\\n if not _side:\\n log.error(\\\"|{0}| >> Block is not sided. Can't create mirror\\\".format(_str_func, self.mNode)) \\n return False\\n \\n if self.getMessage('blockMirror'):\\n mMirror = self.blockMirror\\n log.debug(\\\"|{0}| >> blockMirror found {1} \\\".format(_str_func, mMirror))\\n if not forceNew:\\n return mMirror\\n log.debug(\\\"|{0}| >> focing new... \\\".format(_str_func, mMirror)) \\n mMirror.delete()\\n \\n log.debug(\\\"|{0}| >> blockParent....\\\".format(_str_func))\\n mBlockParent = self.p_blockParent\\n if mBlockParent and mBlockParent.getMessage('blockMirror'):\\n mBlockParent = mBlockParent.blockMirror\\n log.debug(\\\"|{0}| >> blockParent has blockMirror: {1}\\\".format(_str_func,mBlockParent))\\n \\n log.debug(\\\"|{0}| >> Creating mirror block. {1} | {2}\\\".format(_str_func, _blockType, _side))\\n \\n _d = {'blockType':self.blockType, 'side':_side,\\n 'autoForm':False,\\n 'blockParent':mBlockParent,\\n \\n #'baseAim':[self.baseAimX,-self.baseAimY,self.baseAimZ],\\n 'baseSize':baseSize_get(self)}\\n \\n for a in 'blockProfile','buildProfile','cgmName':\\n if a in ['cgmName']:\\n _d['name'] = self.getMayaAttr(a)\\n else:\\n _d[a] = self.getMayaAttr(a)\\n\\n \\n log.debug(\\\"|{0}| >> Block settings...\\\".format(_str_func, self.mNode)) \\n #pprint.pprint(_d)\\n \\n mMirror = cgmMeta.createMetaNode('cgmRigBlock',\\n **_d)\\n \\n \\n \\n blockDat = self.getBlockDat()\\n blockDat['ud']['side'] = _side\\n for k in ['baseSize','baseAim']:\\n if blockDat['ud'].has_key(k):\\n blockDat['ud'].pop(k)\\n for a in 'XYZ':\\n if blockDat['ud'].has_key(k+a):\\n blockDat['ud'].pop(k+a)\\n mMirror.blockDat = blockDat\\n \\n blockMirror_settings(self,mMirror)\\n mMirror.saveBlockDat()\\n _d = mMirror.blockDat\\n _d['blockState']=self.getEnumValueString('blockState')\\n\\n mMirror.blockDat = _d\\n \\n \\\"\\\"\\\"\\n for k,dIter in BLOCKSHARE._d_mirrorAttrCheck.iteritems():\\n _check = blockDat['ud'].get(k)\\n if _check:\\n log.debug(\\\"|{0}| >> mirror dat check {1} | {2}\\\".format(_str_func, k, dIter))\\n blockDat['ud'][k] = dIter.get(blockDat['ud'][k])\\\"\\\"\\\"\\n \\n \\\"\\\"\\\"\\n #Mirror some specfic dat\\n if blockDat.get('form'):\\n _subShapers = blockDat['form'].get('subShapers',{})\\n log.debug(\\\"|{0}| >> subShaper dat mirror...\\\".format(_str_func, self.mNode)) \\n \\n for i,d_sub in _subShapers.iteritems():\\n l_t = d_sub.get('t')\\n l_r = d_sub.get('r')\\n l_s = d_sub.get('s')\\n \\n for ii,d_list in enumerate(l_t):\\n d_list[0] = d_list[0]*-1\\n for ii,d_list in enumerate(l_r):\\n d_list[0] = d_list[0]*-1 \\n d_list[1] = d_list[1]*-1\\n \\n _subShapers[str(i)]['r'][ii] = l_r\\n _subShapers[str(i)]['r'][ii] = l_t\\\"\\\"\\\"\\n \\n\\n self.connectChildNode(mMirror,'blockMirror','blockMirror')#Connect\\n mMirror.p_blockParent = mBlockParent\\n \\n blockDat_load(mMirror,useMirror=True,redefine=True)\\n controls_mirror(self,mMirror)\\n return mMirror\\n except Exception,err:cgmGEN.cgmException(Exception,err)\",\n \"def extend_template(base, text):\\n\\n block_search = re.compile(\\\"{{(block) (\\\\w+)}}\\\")\\n has_blocks = re.search(block_search, base)\\n if not has_blocks:\\n return base\\n else:\\n find_content = re.compile(\\\"({{block \\\"+has_blocks.group(2)+\\\"}})(.*?)({{endblock}})\\\", re.DOTALL)\\n \\n content = re.search(find_content, text).group(2)\\n base = re.sub(\\\"{{block \\\"+has_blocks.group(2)+\\\"}}\\\", content, base)\\n return extend_template(base, text)\",\n \"def create_item(self, parent, block):\\r\\n li = util.etree.SubElement(parent, 'li')\\r\\n self.parser.parseBlocks(li, [block])\",\n \"def create_block(self, nonce, previous_hash):\\n block = {'block_number': transaction_blocks.count() + 1,\\n 'timestamp': ctime(t),\\n 'transactions': self.transactions,\\n 'nonce': nonce,\\n 'previous_hash': previous_hash}\\n\\n # Reset the current list of transactions\\n self.transactions = []\\n self.chain.append(block)\\n return block\",\n \"def add_basic_block(self, basic_block):\\n self.basic_blocks.append(basic_block)\\n basic_block.function = self\",\n \"def pack(cls, blocks, *args, **kwargs) -> None:\\n\\n if not blocks:\\n raise BlockError(\\\"At least one block must be provided\\\")\\n\\n # The new block will be added here\\n parent = blocks[0].parent\\n\\n # All of the blocks must share the same parent\\n if not all(blk.parent is parent for blk in blocks):\\n raise BlockError(\\\"All of the blocks must share the same parent\\\")\\n\\n # Store all existing connections\\n connections = set()\\n for port in chain.from_iterable([blk.ports for blk in blocks]):\\n\\n if port.is_in:\\n connections.update((ups, port) for ups in port.upstream)\\n else:\\n connections.update((port, dws) for dws in port.downstream)\\n\\n # Create a new block instance and place in under the parent\\n block = cls(*args, **kwargs, parent=parent)\\n\\n # Move blocks under parent block\\n for blk in blocks:\\n blk.parent = block\\n\\n # Restore connections\\n for p1, p2 in connections:\\n try:\\n p1.feed(p2)\\n\\n # If connection adding has failed, it probably means that this is an external connection,\\n # therefore we add an intermediate port\\n except PortError:\\n\\n def add_proxy_from(p):\\n if p.is_in and not p.auxiliary:\\n return block.In.new(f'{p.block.name}_{p.name}')\\n\\n elif p.is_in and p.auxiliary:\\n return block.AuxIn.new(f'{p.block.name}_{p.name}')\\n\\n elif not p.is_in and not p.auxiliary:\\n return block.Out.new(f'{p.block.name}_{p.name}')\\n\\n else:\\n return block.AuxOut.new(f'{p.block.name}_{p.name}')\\n\\n # The case when p1 is outside\\n if p2.block.parent is block:\\n new_port = add_proxy_from(p2)\\n\\n # The case when p2 is outside\\n else:\\n # Add new port\\n new_port = add_proxy_from(p1)\\n\\n p1.feed(new_port)\\n new_port.feed(p2)\\n\\n block.ports.sort()\",\n \"def add_block(self, env, block_color, width, height):\\n\\n block_size = (0.04, 0.04, 0.04)\\n block_urdf = \\\"stacking/block.urdf\\\"\\n block_pose = self.get_random_pose(env, block_size)\\n block_id = env.add_object(block_urdf, block_pose)\\n pb.changeVisualShape(\\n block_id, -1, rgbaColor=utils.COLORS[block_color] + [1])\\n # (0, None): 0 means that the block is symmetric.\\n # TODO(hagrawal): Not sure what None means. Update. This is kept\\n # for CLIPort compatibility. We don't use it.\\n self.blocks.append((block_id, (0, None)))\\n block_pix = utils.xyz_to_pix(block_pose[0], self.bounds, self.pix_size)\\n block_obj_info = {\\n \\\"obj_id\\\": block_id,\\n \\\"pose\\\": block_pose,\\n \\\"size\\\": block_size,\\n \\\"urdf\\\": block_urdf,\\n \\\"color\\\": block_color,\\n \\\"unknown_color\\\": block_color in utils.EVAL_COLORS,\\n \\\"pix\\\": block_pix,\\n \\\"region\\\": determine_region(block_pix[0], block_pix[1], width, height),\\n }\\n return block_obj_info\",\n \"def make_sub(self, sub):\\n [lu, subs] = [self.lineup, self.subs]\\n if 'PositionSwitch' in str(type(sub)):\\n done = False\\n for player in lu:\\n if player.id == sub.player:\\n done = True\\n player.switch.append(player.pos)\\n player.pos = sub.pos\\n if sub.pos in player.switch:\\n player.switch.remove(sub.pos)\\n if not done:\\n sub_idx = find_player_index(subs, sub.player)\\n if sub.pos == 'p':\\n subs[sub_idx].status = 'entered'\\n if not len([s for s in lu if s.pos == 'p']) > 0:\\n subs[sub_idx].order = 10\\n lu.append(subs.pop(sub_idx))\\n else:\\n print(\\\"ERROR: NOT SURE WHAT TO DO WITH SUB\\\")\\n print([p.__dict__ for p in lu])\\n print(sub.__dict__)\\n\\n elif 'OffensiveSub' in str(type(sub)):\\n lu_idx = find_player_index(lu, sub.sub)\\n sub_idx = find_player_index(subs, sub.player)\\n if sub_idx is None:\\n print(\\\"ERROR: \\\" + str(sub.__dict__))\\n else:\\n if subs[sub_idx].status == 'removed':\\n print('ILLEGAL SUB ' + str(subs[sub_idx].__dict__))\\n if not lu_idx is None:\\n lu[lu_idx].status = 'removed'\\n subs.append(lu.pop(lu_idx))\\n lu.insert(lu_idx, subs.pop(sub_idx))\\n\\n elif 'DefensiveSub' in str(type(sub)):\\n lu_idx = find_player_index(lu, sub.sub)\\n sub_idx = find_player_index(subs, sub.player)\\n if sub_idx is None:\\n if sub.pos == 'p':\\n sub_idx = find_player_index(lu, sub.player)\\n if not sub_idx is None and not lu_idx is None:\\n add = lu[sub_idx]\\n lu[lu_idx].status = 'removed'\\n subs.append(lu.pop(lu_idx))\\n lu.insert(lu_idx, add)\\n if lu[lu_idx].order == 10:\\n lu[lu_idx].order = lu_idx+1\\n else:\\n print(\\\"ERROR: \\\" + str(sub.__dict__))\\n else:\\n if subs[sub_idx].status == 'removed':\\n print('ILLEGAL SUB ' + str(subs[sub_idx].__dict__ ))\\n if not lu_idx is None: \\n lu[lu_idx].status = 'removed'\\n if lu[lu_idx].order != subs[sub_idx].order:\\n print(\\\"ASSUMING ORDER FOR SUB: \\\" + subs[sub_idx].name)\\n subs[sub_idx].order = lu[lu_idx].order\\n for p in lu:\\n if p.pos == subs[sub_idx].pos:\\n p.pos = ''\\n subs.append(lu.pop(lu_idx))\\n lu.insert(lu_idx, subs.pop(sub_idx))\\n\\n elif 'Removal' in str(type(sub)):\\n if lu[-1].id == sub.sub:\\n lu_idx = len(lu)-1\\n else:\\n lu_idx = find_player_index(lu, sub.sub)\\n if not lu_idx is None:\\n lu[lu_idx].status = 'removed'\\n subs.append(lu.pop(lu_idx))\\n \\n\\n [self.lineup, self.subs] = [lu, subs]\",\n \"def create_submodule(self, *args: Any, **kwargs: Any) -> Submodule:\\n return Submodule.add(self, *args, **kwargs)\",\n \"def _create_vertical(self, parent_usage_key=None):\\r\\n resp = self.create_xblock(category='vertical', parent_usage_key=parent_usage_key)\\r\\n self.assertEqual(resp.status_code, 200)\\r\\n return self.response_usage_key(resp)\",\n \"def duplicate2(self):\\n try:\\n _str_func = 'blockDuplicate'\\n mDup = cgmMeta.createMetaNode('cgmRigBlock',blockType = self.blockType, autoForm=False)\\n mDup.loadBlockDat(self.getBlockDat())\\n mDup.doName()\\n return mDup\\n except Exception,err:cgmGEN.cgmExceptCB(Exception,err)\",\n \"def add_node_as_child(self, block, node, id_generator=None):\\n usage_id = self._usage_id_from_node(node, block.scope_ids.usage_id, id_generator)\\n block.children.append(usage_id)\",\n \"def mine(self):\\n last_block = self.chain[-1]\\n\\n nonce = self.proof_of_work()\\n previous_hash = self.hash(last_block)\\n self.create_block(nonce, previous_hash)\",\n \"def create_origin_block(self):\\n # creating a new hash object and finding new hash with empty string.\\n hash = hashlib.sha256()\\n hash.update(''.encode('utf-8'))\\n # Instantiating a new block with data 'Origin', and for previous hash we'll give the hash generated by empty string\\n origin_block = Block('Origin', hash)\\n # Mine the block with the difficulty level of the chain\\n origin_block.mine(self.difficulty)\\n # Appending it to the mined block list\\n self.blocks.append(origin_block)\",\n \"def create_xblock(usage, student_id=None):\\n block_cls = XBlock.load_class(usage.block_name)\\n runtime = StuviewRuntime(block_cls, student_id, usage)\\n model = DbModel(SCOPED_KVS, block_cls, student_id, usage)\\n block = block_cls(runtime, model)\\n return block\",\n \"def init_blocks(self):\\n length = self.physics.len_blocks\\n rect = Rectangle(Vector(self.rpos.x, self.rpos.y),\\n Vector(self.rpos.x + length, self.rpos.y + length))\\n self.rects.append(rect)\\n self.physics.add_block(rect, self.stype)\",\n \"def CreateBlock(self, props):\\n # Set some default properties\\n\\n # blk / cfg | name | name+inst\\n # -----------------------------\\n # name | n==n | False\\n # name+inst | n==n | n==n&&i==i\\n if 'ordinal' not in props and 'name' in props:\\n for ordinal, ni in self.config.get('ordinals', {}).items():\\n if isinstance(ni, str):\\n # Config only has name, don't care about block\\n if props['name'] == ni:\\n props['ordinal'] = ordinal\\n break\\n elif 'instance' not in props:\\n # Config has name+instance, block only has name\\n continue\\n else:\\n # Config has name+instance, block has name+instance\\n if props['name'] == ni[0] and props['instance'] == ni[1]:\\n props['ordinal'] = ordinal\\n break\\n\\n # Compute a block ID\\n if 'name' in props:\\n bid = props['name'].replace('-', '')\\n else:\\n bid = \\\"block\\\"\\n\\n if bid in self.blocks:\\n i = 1\\n while bid+str(i) in self.blocks:\\n i += 1\\n bid = bid+str(i)\\n\\n # Actually create block\\n self.blocks[bid] = blk = Block(bid, props)\\n blk.changed.handler(lambda: self.blockchanged(blk))\\n\\n self.blockadded(blk)\\n\\n return blk\",\n \"def begin():\\n return BeginBlock()\",\n \"def _create_xblock(self, parent_loc, xblock_desc):\\r\\n create_payload = {\\r\\n 'category': xblock_desc.category,\\r\\n 'display_name': xblock_desc.display_name,\\r\\n }\\r\\n\\r\\n if parent_loc is not None:\\r\\n create_payload['parent_locator'] = parent_loc\\r\\n\\r\\n # Create the new XBlock\\r\\n response = self.session.post(\\r\\n STUDIO_BASE_URL + '/xblock/',\\r\\n data=json.dumps(create_payload),\\r\\n headers=self.headers,\\r\\n )\\r\\n\\r\\n if not response.ok:\\r\\n msg = \\\"Could not create {0}. Status was {1}\\\".format(xblock_desc, response.status_code)\\r\\n raise CourseFixtureError(msg)\\r\\n\\r\\n try:\\r\\n loc = response.json().get('locator')\\r\\n\\r\\n except ValueError:\\r\\n raise CourseFixtureError(\\\"Could not decode JSON from '{0}'\\\".format(response.content))\\r\\n\\r\\n # Configure the XBlock\\r\\n response = self.session.post(\\r\\n STUDIO_BASE_URL + '/xblock/' + loc,\\r\\n data=xblock_desc.serialize(),\\r\\n headers=self.headers,\\r\\n )\\r\\n\\r\\n if response.ok:\\r\\n return loc\\r\\n else:\\r\\n raise CourseFixtureError(\\r\\n \\\"Could not update {0}. Status code: {1}\\\".format(\\r\\n xblock_desc, response.status_code))\",\n \"def createChild(self):\\n childName = self._generateChildName()\\n zincRegion = self._zincRegion.createChild(childName)\\n if zincRegion.isValid():\\n childRegion = NeonRegion(childName, zincRegion, self)\\n self._children.append(childRegion)\\n self._informRegionChange(True)\\n return childRegion\\n return None\",\n \"def add_block(self, name):\\n\\n if not self.RE_NAME.match(name):\\n raise ValueError(u\\\"Invalid block name '{0}'\\\"\\n .format(common.from_utf8(name)))\\n\\n if name in self._block_map:\\n raise ValueError(u\\\"Block '{0}' already exists\\\"\\n .format(common.from_utf8(name)))\\n\\n # add new block and index mapping\\n self._block_map[name] = len(self._ast[2]) # must come first\\n option_list = []\\n block = [name, option_list]\\n self._ast[2].append(block)\",\n \"def create_block():\\n global BLOCK\\n posx = SEG_SIZE * random.randint(1, (WIDTH-SEG_SIZE) / SEG_SIZE)\\n posy = SEG_SIZE * random.randint(1, (HEIGHT-SEG_SIZE) / SEG_SIZE)\\n BLOCK = c.create_oval(posx, posy,\\n posx+SEG_SIZE, posy+SEG_SIZE,\\n fill=\\\"red\\\")\\n # print(posx, posy)\\n return posx, posy\",\n \"def add_block(_input, growth_rate, layers_per_block, bc_mode, name, is_training):\\n output = _input\\n for layer in range(layers_per_block):\\n with tf.variable_scope(\\\"%s_layer_%d\\\" % (name, layer)):\\n output = add_internal_layer(output, growth_rate, bc_mode=bc_mode, is_training=is_training)\\n return output\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7300657","0.7137283","0.700307","0.67426383","0.65247345","0.64328855","0.64139366","0.6404519","0.6204402","0.61623967","0.6048261","0.5963573","0.59493285","0.5928946","0.5925224","0.5924873","0.59158665","0.5912983","0.5904347","0.58974856","0.5862565","0.58518505","0.584571","0.58374643","0.5819552","0.5813169","0.58130515","0.5799499","0.5794494","0.57889706","0.57718897","0.57630163","0.57329714","0.57304585","0.5729394","0.57199794","0.5712181","0.57050866","0.5704886","0.5671287","0.56516564","0.564135","0.56412643","0.56132627","0.56063795","0.5596406","0.5586833","0.55771995","0.55599403","0.55553937","0.5549632","0.5544024","0.5543659","0.55427104","0.5528622","0.5505878","0.5504886","0.5500673","0.5492654","0.54914093","0.5491187","0.5490123","0.5488035","0.548346","0.5481799","0.5479431","0.54787236","0.54728717","0.54683286","0.54672873","0.5443881","0.54428893","0.5430977","0.5430977","0.54048055","0.5397223","0.53965336","0.5391919","0.5390654","0.5385845","0.5380702","0.53805625","0.53564495","0.5353999","0.5345577","0.5344728","0.53432393","0.5341908","0.53405446","0.5332013","0.5324306","0.53125536","0.5311059","0.52993864","0.52968943","0.5289444","0.52852124","0.52850676","0.52841455","0.5280303"],"string":"[\n \"0.7300657\",\n \"0.7137283\",\n \"0.700307\",\n \"0.67426383\",\n \"0.65247345\",\n \"0.64328855\",\n \"0.64139366\",\n \"0.6404519\",\n \"0.6204402\",\n \"0.61623967\",\n \"0.6048261\",\n \"0.5963573\",\n \"0.59493285\",\n \"0.5928946\",\n \"0.5925224\",\n \"0.5924873\",\n \"0.59158665\",\n \"0.5912983\",\n \"0.5904347\",\n \"0.58974856\",\n \"0.5862565\",\n \"0.58518505\",\n \"0.584571\",\n \"0.58374643\",\n \"0.5819552\",\n \"0.5813169\",\n \"0.58130515\",\n \"0.5799499\",\n \"0.5794494\",\n \"0.57889706\",\n \"0.57718897\",\n \"0.57630163\",\n \"0.57329714\",\n \"0.57304585\",\n \"0.5729394\",\n \"0.57199794\",\n \"0.5712181\",\n \"0.57050866\",\n \"0.5704886\",\n \"0.5671287\",\n \"0.56516564\",\n \"0.564135\",\n \"0.56412643\",\n \"0.56132627\",\n \"0.56063795\",\n \"0.5596406\",\n \"0.5586833\",\n \"0.55771995\",\n \"0.55599403\",\n \"0.55553937\",\n \"0.5549632\",\n \"0.5544024\",\n \"0.5543659\",\n \"0.55427104\",\n \"0.5528622\",\n \"0.5505878\",\n \"0.5504886\",\n \"0.5500673\",\n \"0.5492654\",\n \"0.54914093\",\n \"0.5491187\",\n \"0.5490123\",\n \"0.5488035\",\n \"0.548346\",\n \"0.5481799\",\n \"0.5479431\",\n \"0.54787236\",\n \"0.54728717\",\n \"0.54683286\",\n \"0.54672873\",\n \"0.5443881\",\n \"0.54428893\",\n \"0.5430977\",\n \"0.5430977\",\n \"0.54048055\",\n \"0.5397223\",\n \"0.53965336\",\n \"0.5391919\",\n \"0.5390654\",\n \"0.5385845\",\n \"0.5380702\",\n \"0.53805625\",\n \"0.53564495\",\n \"0.5353999\",\n \"0.5345577\",\n \"0.5344728\",\n \"0.53432393\",\n \"0.5341908\",\n \"0.53405446\",\n \"0.5332013\",\n \"0.5324306\",\n \"0.53125536\",\n \"0.5311059\",\n \"0.52993864\",\n \"0.52968943\",\n \"0.5289444\",\n \"0.52852124\",\n \"0.52850676\",\n \"0.52841455\",\n \"0.5280303\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.73637503"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94778,"cells":{"query":{"kind":"string","value":"block has been split via | so we need to start a new block for that option and return it to the user."},"document":{"kind":"string","value":"def switch(self):\n base_block = self.base_block or self\n self.next_block = Block(self.parent, base_block=base_block, py3_wrapper=self.py3_wrapper)\n return self.next_block"},"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 block_one(self):","def block(self):\n pass","def handle_request(self, request):\n ret = True\n for option in request.options:\n if option.number == defines.inv_options[\"Block2\"]:\n host, port = request.source\n key = hash(str(host) + str(port) + str(request.token))\n num, m, size = parse_blockwise(option.raw_value)\n # remember choices\n if key in self._parent.blockwise:\n block, byte, num2, m2, size2 = self._parent.blockwise[key]\n if block == 2:\n self._parent.blockwise[key] = (2, byte, num, m, size)\n else:\n self._parent.blockwise[key] = (2, 0, num, m, size)\n else:\n self._parent.blockwise[key] = (2, 0, num, m, size)\n elif option.number == defines.inv_options[\"Block1\"]:\n host, port = request.source\n key = hash(str(host) + str(port) + str(request.token))\n num, m, size = parse_blockwise(option.raw_value)\n # remember choices\n self._parent.blockwise[key] = (1, 0, num, m, size)\n if m == 0:\n del self._parent.blockwise[key]\n ret = False\n return ret, request","def start_block2(self, request):\n host, port = request.source\n key = hash(str(host) + str(port) + str(request.token))\n self._parent.blockwise[key] = (2, 0, 0, 1, 1024)","def new_block_call(self, event):\n self.push_job(flush=True)","def blocks(self):\n pass","def split(self, block: ghidra.program.model.mem.MemoryBlock, addr: ghidra.program.model.address.Address) -> None:\n ...","def execute_block_now(event):\n b = event.cli.current_buffer\n b.validate_and_handle()","def block_on(self, char):\n self._blocker_char = char","def handleBlock(self, block_str):\n\n new_block = Block()\n new_block.parseJson(block_str)\n if not self.checkBlock(new_block):\n return False\n\n if new_block.confirmed:# if confirmed by someone, check and add block\n if valid_proof_of_work(new_block):\n print(\"Someone done before me, I'm going to stop\")\n self.threadjob = False\n self.BlockChain.addBlock(new_block) \n else:\n raise Exception(\"Hey this Block's Hash is not valid\")\n return False\n\n elif self.miner_indicator:\n if self.threadjob:\n print(\"This is miner, I should mine, but I'm already doing \")\n return True\n print(\"Hey this is miner, I'm going to mine\")\n self.threadjob = True\n t = Thread(target=self.mine, args = (new_block,))\n t.start()\n else:\n print(\"Hey this is unconfirmed block , but I am not miner, so I gonna miss it\")\n return True","def block_type(self):\r\n raise NotImplementedError()","def splitblock(self, name=None, terminate=False):\n # -------------------------------------------------\n # Sanity check\n\n # Allow splitting only after leaders and before terminator\n # TODO: error check\n\n # -------------------------------------------------\n # Split\n\n oldblock = self._curblock\n newblock = self.func.new_block(name or 'block', after=self._curblock)\n op = self._lastop\n\n # Terminate if requested and not done already\n if terminate and not ops.is_terminator(op):\n op = self.jump(newblock)\n\n # -------------------------------------------------\n # Move ops after the split to new block\n\n if op:\n if op == 'head':\n trailing = list(self._curblock.ops)\n elif op == 'tail':\n trailing = []\n else:\n trailing = list(op.block.ops.iter_from(op))[1:]\n\n for op in trailing:\n op.unlink()\n newblock.extend(trailing)\n\n # -------------------------------------------------\n # Patch phis\n\n if terminate:\n self._patch_phis(oldblock.ops, oldblock, newblock)\n else:\n for op in oldblock:\n for use in self.func.uses[op]:\n if use.opcode == 'phi':\n raise error.CompileError(\n \"Splitting this block would corrupt some phis\")\n\n self._patch_phis(newblock.ops, oldblock, newblock)\n\n return oldblock, newblock","def end():\n return EndBlock()","def parseBlock(self, text, prevLineData):\n return self.parser.parseBlock(text, prevLineData)","def changed_block(self, old_block, new_block):","def start_block(self):\n self.stop_running()\n self.update_action(Action.block)","def check_block(self, block):\n pass","def onBlock(self, data) :\n pass","def test_block_full_context(self):\n # old model file == beam block full context false\n pp = ParlaiParser(True, True)\n opt = pp.parse_args(\n ['--model-file', 'zoo:unittest/transformer_generator2/model']\n )\n agent = create_agent(opt, True)\n self.assertEqual(agent.opt['beam_block_full_context'], False)\n self.assertEqual(agent.beam_block_full_context, False)\n\n # brand new model == beam block full context true\n pp = ParlaiParser(True, True)\n opt = pp.parse_args(['--model', 'transformer/generator'])\n agent = create_agent(opt, True)\n self.assertEqual(agent.opt['beam_block_full_context'], True)\n self.assertEqual(agent.beam_block_full_context, True)","def _prepare_blocks():\n\n counter = blocks[0]['freeStart']\n maxBlocks = blocks[0]['maxBlocks']\n while(counter < maxBlocks) :\n try:\n # print (mount['parent'] + '/linddata.' + str(counter))\n f = open(mount['parent'] + '/linddata.' + str(counter), 'r') \n except IOError, e:\n return STATUS['M_BD']\n else :\n fdatastring = f.next()\n fdata = deserializedata(fdatastring)\n blocks[counter] = fdata\n counter += 1\n \n return STATUS['OK']","def put_block(self):\n self.blocks[self.editor_cursor_position[1]][\n self.editor_cursor_position[0]] = self.available_block_types[self.current_block_type]","def block_program(description):\n\n def run(self):\n n = len(description)\n i = 0\n while i + n <= len(self.shrink_target.blocks):\n attempt = bytearray(self.shrink_target.buffer)\n failed = False\n for k, d in reversed(list(enumerate(description))):\n j = i + k\n u, v = self.blocks[j].bounds\n if d == \"-\":\n value = int_from_bytes(attempt[u:v])\n if value == 0:\n failed = True\n break\n else:\n attempt[u:v] = int_to_bytes(value - 1, v - u)\n elif d == \"X\":\n del attempt[u:v]\n else: # pragma: no cover\n assert False, \"Unrecognised command %r\" % (d,)\n if failed or not self.incorporate_new_buffer(attempt):\n i += 1\n\n run.command = description\n run.__name__ = \"block_program(%r)\" % (description,)\n return run","def test_04(self):\n assert 'False' == Api.requestBlock('test-04', charOrder='')","def nextSplit(self):\n pass","def processFirstBlock(block):\n print(block)\n if block[0:6].decode() == \"TRQ t \":\n return [\"TRQ\", \"t\"]\n elif block[0:6].decode() == \"TRQ f \":\n return [\"TRQ\", \"f\"]\n else:\n return [\"\", \"\"]","def build_block(self, format_string):\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\n block = first_block\n\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n value = token.group(0)\n if token.group(\"block_start\"):\n # Create new block\n block = block.new_block()\n elif token.group(\"block_end\"):\n # Close block setting any valid state as needed\n # and return to parent block to continue\n if not block.parent:\n raise Exception(\"Too many `]`\")\n block = block.parent\n elif token.group(\"switch\"):\n # a new option has been created\n block = block.switch()\n elif token.group(\"placeholder\"):\n # Found a {placeholder}\n key = token.group(\"key\")\n format = token.group(\"format\")\n block.add(Placeholder(key, format))\n elif token.group(\"literal\"):\n block.add(Literal(value))\n elif token.group(\"lost_brace\"):\n # due to how parsing happens we can get a lonesome }\n # eg in format_string '{{something}' this fixes that issue\n block.add(Literal(value))\n elif token.group(\"command\"):\n # a block command has been found\n block.set_commands(token.group(\"command\"))\n elif token.group(\"escaped\"):\n # escaped characters add unescaped values\n if value[0] in [\"\\\\\", \"{\", \"}\"]:\n value = value[1:]\n block.add(Literal(value))\n\n if block.parent:\n raise Exception(\"Block not closed\")\n # add to the cache\n self.block_cache[format_string] = first_block","def _set_block(self, pos, block_):\n raise NotImplementedError","def pick_block(self):\n current_block = self.blocks[self.editor_cursor_position[1]][self.editor_cursor_position[0]]\n if current_block in self.available_block_types:\n self.current_block_type = self.available_block_types.index(current_block)","def is_block(self) -> bool:\n return self.answer == \".\"","def begin():\n return BeginBlock()","def test_block_extra_batch(self):\n pass","def print_in_block(message):\n print(\"|\", message)","def _get_block(self, pos):\n raise NotImplementedError","def duplicate(self, uiPrompt = True):\n try:\n _str_func = 'duplicate'\n _blockType = self.blockType\n _side = get_side(self)\n _nameOriginal = self.cgmName\n \n _d = {'blockType':self.blockType,\n 'autoForm':False,\n 'side':_side,\n 'baseSize':baseSize_get(self),\n 'blockProfile':self.blockProfile,\n 'blockParent': self.p_blockParent}\n \n for a in 'cgmName','blockProfile':\n if a in ['cgmName']:\n _d['name'] = self.getMayaAttr(a)\n elif self.hasAttr(a):\n _d[a] = self.getMayaAttr(a) \n \n _title = 'New name for duplicate'.format(_blockType)\n result = mc.promptDialog(title=_title,\n message='Current: {0} | type: {1} | build: {2} | block:{3} '.format(_d['name'],_blockType,_d.get('blockProfile'),_d.get('buildProfile')),\n button=['OK', 'Cancel'],\n text = _d['name'],\n defaultButton='OK',\n cancelButton='Cancel',\n dismissString='Cancel')\n if result == 'OK':\n _v = mc.promptDialog(query=True, text=True)\n _d['name'] = _v\n \n else:\n log.error(\"Duplication cancelled for |{0}|\".format(self))\n return False\n \n log.debug(\"|{0}| >> Creating duplicate block. {1} | source: {2}\".format(_str_func, _blockType, self))\n\n \n log.debug(\"|{0}| >> Block settings...\".format(_str_func)) \n #pprint.pprint(_d)\n \"\"\"\n if replaceSelf:\n ml_children = self.getBlockChildren()\n _blockProfile = self.getMayaAttr('blockProfile')\n mBlockModule = self.p_blockModule\n \n _d_profiles = {} \n try:_d_profiles = mBlockModule.d_block_profiles\n except:\n log.error(cgmGEN.logString_msg(_str_func,'No d_block_profile_found')) \n \n _typeDict= _d_profiles.get(_blockProfile,{})\n if _blockProfile and not _typeDict:\n log.error(cgmGEN.logString_msg(_str_func,'blockType not found in blockProfiles. Please fix | found {0}'.format(_blockProfile)))\n pprint.pprint(_d_profiles.keys())\n return False \n \n _baseDat = _typeDict.get('baseDat')\"\"\"\n \n mDup = cgmMeta.createMetaNode('cgmRigBlock',\n **_d)\n \n mDup.doSnapTo(self)\n \n blockDat = self.getBlockDat()\n \n blockDat['baseName'] = _v\n blockDat['ud']['cgmName'] = _v\n \n if _d['blockType'] in ['finger','thumb']:\n log.debug(\"|{0}| >> Clearing nameList\".format(_str_func))\n for a in blockDat['ud'].iteritems():\n if 'nameList' in a:\n blockDat['ud'].remove(a)\n blockDat['ud']['nameList_0'] = _v \n \n \"\"\"\n if blockDat['ud'].get('rigSetup') in ['finger']:\n log.debug(\"|{0}| >> Clearing nameList\".format(_str_func))\n for a in blockDat['ud'].iteritems():\n if 'nameList' in a:\n blockDat['ud'].remove(a)\n blockDat['nameList_0'] = _v\"\"\"\n \n #changeState(mDup,'define',forceNew=True)#redefine to catch any optional created items from settings\n mDup.blockDat = blockDat\n \"\"\"\n if replaceSelf:\n if _baseDat:\n log.warning(cgmGEN.logString_msg(_str_func,'resetting baseDat: {0}'.format(_baseDat)))\n mDup.baseDat = _baseDat \"\"\" \n \n for a in ['numSubShapers','rollCount']:\n if ATTR.datList_exists(self.mNode, a):\n l = self.datList_get(a)\n mDup.datList_connect(a,l)\n \n \n l_nameList = mDup.datList_get('nameList')\n for i,n in enumerate(l_nameList):\n if _nameOriginal in n:\n l_nameList[i] = n.replace(_nameOriginal,_d['name'])\n \n mDup.datList_connect('nameList',l_nameList)\n pprint.pprint(l_nameList) \n \n \n blockDat_load(mDup,redefine=True)\n #log.debug('here...')\n #blockDat_load(mDup)#...investigate why we need two...\n \n #mDup.p_blockParent = self.p_blockParent\n #self.connectChildNode(mMirror,'blockMirror','blockMirror')#Connect \n \"\"\"\n if replaceSelf:\n for mChild in ml_children:\n mChild.p_blockParent = mDup\n \n self.delete()\"\"\"\n \n\n \n return mDup\n except Exception,err:cgmGEN.cgmExceptCB(Exception,err)","def blockParser(block):\n struct = []\n first = True\n record = False\n for line in block:\n if line.startswith('Structure #'):\n record = True\n if not first:\n yield struct\n struct = []\n first = False\n if record:\n struct.append(line)\n yield struct","def test_05(self):\n assert 'True' == Api.requestBlock('test-05', charOrder=50)","def run(self, parent, blocks):\r\n pass","def _prepare_consumed_block():\n \n blkcounter = 0\n maxBlocks = blocks[0]['maxBlocks']\n \n freeStart = blocks[0]['freeStart']\n freeEnd = blocks[0]['freeEnd']\n \n while(blkcounter in xrange(0, maxBlocks, 1)) :\n # data type can be varied\n # dictionary - for superBlock, directory and file inode\n # list - for free block list, index list\n # string - data blocks\n # empty - free block\n bdata = blocks[blkcounter]\n # an afterthought - we really do not need to bother about\n # data blocks here, as all the data blocks should be in one\n # of index list or in location attribute of inode\n \n if (type(bdata) == list) :\n if(blkcounter >= freeStart and blkcounter <= freeEnd) :\n # free block list, so no reading the content of the list, \n # but mark the block as a consumed block \n consumedBlocks.append(blkcounter)\n else :\n # this is an index list, marking this block as consumed\n # mark all the blocks listed in this list as consumed as well\n consumedBlocks.append(blkcounter)\n for n in bdata :\n consumedBlocks.append(n)\n elif (type(bdata) == dict) :\n # mark this block as consumed block\n consumedBlocks.append(blkcounter)\n if(bdata.has_key('filename_to_inode_dict')) :\n # if directory node has connected files\n for n in bdata['filename_to_inode_dict'].values() :\n consumedBlocks.append(n)\n elif(bdata.has_key('location')): \n # if this is a file node, then check indirect attribute\n # and if inderect if 0, mark the value in location attribute\n # as consumed block\n # if indirect is 1, mark the value in location attribute\n # as consumed block, then leave it, cause the 'if' block already\n # does a check on index list \n consumedBlocks.append(bdata['location'])","def _do_add_block(self, args):\r\n bus_type = args[1]\r\n slave_id = int(args[2])\r\n name = args[3]\r\n block_type = int(args[4])\r\n starting_address = int(args[5])\r\n length = int(args[6])\r\n if bus_type == 'rtu':\r\n slave = self.server._servers[0].get_slave(slave_id)\r\n elif bus_type == 'tcp':\r\n slave = self.server._servers[1].get_slave(slave_id)\r\n slave.add_block(name, block_type, starting_address, length)\r\n return name","def block(self, block):\n\n self._block = block","def block(self, block):\n\n self._block = block","def test_07(self):\n assert 'False' == Api.requestBlock('test-07', charOrder='~!@#$%%^&*()=_+<>?/')","def __parse_blocks_pass(self):\n\n self.stack = [DocumentStackToken()]\n\n self.tokenized_document = []\n token_to_use = self.source_provider.get_next_line()\n did_start_close = False\n did_started_close = False\n requeue = []\n ignore_link_definition_start = False\n POGGER.debug(\"---$---\", token_to_use)\n POGGER.debug(\"---\")\n self.__parse_properties.pragma_lines = {}\n line_number = 1\n try:\n (\n token_to_use,\n line_number,\n requeue,\n ) = self.__process_front_matter_header_if_present(\n token_to_use, line_number, requeue\n )\n did_start_close = token_to_use is None\n keep_on_going = True\n while keep_on_going:\n POGGER.debug(\"next-line>>$\", token_to_use)\n POGGER.debug(\"stack>>$\", self.stack)\n POGGER.debug(\"current_block>>$\", self.stack[-1])\n POGGER.debug(\"line_number>>$\", line_number)\n POGGER.debug(\"---\")\n\n position_marker = PositionMarker(line_number, 0, token_to_use)\n parser_state = ParserState(\n self.stack,\n self.tokenized_document,\n TokenizedMarkdown.__close_open_blocks,\n self.__handle_blank_line,\n )\n if did_start_close:\n POGGER.debug(\"\\n\\ncleanup\")\n\n was_link_definition_started_before_close = self.stack[\n -1\n ].was_link_definition_started\n\n did_started_close = True\n (\n tokens_from_line,\n requeue_line_info,\n ) = TokenizedMarkdown.__close_open_blocks(\n parser_state,\n self.tokenized_document,\n include_block_quotes=True,\n include_lists=True,\n caller_can_handle_requeue=True,\n was_forced=True,\n )\n if tokens_from_line and not self.tokenized_document:\n self.tokenized_document.extend(tokens_from_line)\n\n if not (requeue_line_info and requeue_line_info.lines_to_requeue):\n keep_on_going = False\n else:\n assert was_link_definition_started_before_close\n assert not requeue_line_info.lines_to_requeue[0]\n\n del requeue_line_info.lines_to_requeue[0]\n line_number -= 1\n\n did_start_close = False\n tokens_from_line = None\n else:\n POGGER.debug(\">>>>$\", self.tokenized_document)\n\n if not token_to_use or not token_to_use.strip():\n POGGER.debug(\"call __parse_blocks_pass>>handle_blank_line\")\n (\n tokens_from_line,\n requeue_line_info,\n ) = self.__handle_blank_line(\n parser_state,\n token_to_use,\n from_main_transform=True,\n position_marker=position_marker,\n )\n else:\n POGGER.debug(\"\\n\\nnormal lines\")\n (\n tokens_from_line,\n _,\n _,\n requeue_line_info,\n _,\n ) = ContainerBlockProcessor.parse_line_for_container_blocks(\n parser_state,\n position_marker,\n ignore_link_definition_start,\n self.__parse_properties,\n None,\n )\n\n POGGER.debug(\"<<<<$\", self.tokenized_document)\n\n if keep_on_going:\n line_number, ignore_link_definition_start = TokenizedMarkdown.__xx(\n line_number, requeue_line_info, requeue\n )\n\n POGGER.debug(\n \"---\\nbefore>>$\",\n self.tokenized_document,\n )\n POGGER.debug(\"before>>$\", tokens_from_line)\n if tokens_from_line:\n self.tokenized_document.extend(tokens_from_line)\n POGGER.debug(\n \"after>>$\",\n self.tokenized_document,\n )\n if requeue:\n POGGER.debug(\"requeue>>$\", requeue)\n POGGER.debug(\"---\")\n\n (\n token_to_use,\n did_start_close,\n did_started_close,\n ) = self.__determine_next_token_process(\n requeue, did_start_close, did_started_close\n )\n except AssertionError as this_exception:\n error_message = f\"A project assertion failed on line {line_number} of the current document.\"\n raise BadTokenizationError(error_message) from this_exception\n\n if self.__parse_properties.pragma_lines:\n self.tokenized_document.append(\n PragmaToken(self.__parse_properties.pragma_lines)\n )\n return self.tokenized_document","def handle_eof_in_block(self):\n self.handle_error(\"hit EOF, expected close tag\")","def inner_start_mining(self):\n print(\"Mining a new block\")\n blockchain = self.get_blockchain()\n self.request_transactions(blockchain)\n last_block_hash = blockchain.last_block().header\n complete_hash, nonce = self.proof_of_work(last_block_hash)\n new_block = self.create_block(complete_hash, nonce)\n self.send_block(new_block)\n self.reset_transaction()","def makeBlock(tag):\n return {\"t\":\"RawBlock\",\"c\":[\"html\",tag]}","def penblock(self, block):\n self.block = block","def block(self):\n return self._block","def test_29(self):\n assert 'True' == Api.requestBlock('test-29')","def test_13(self):\n assert 'False' == Api.requestBlock('test-13')","def test_06(self):\n assert 'False' == Api.requestBlock('test-06', charOrder=51)","def test_27(self):\n assert 'False' == Api.requestBlock('test-27')","def block(self, source, task):\n raise NotImplementedError","def test_fork_simple(self):\n bvh = self.BlockValidationHandler()\n new_block = self.btm.generate_block(previous_block=self.btm.chain_head,\n add_to_store=True)\n\n bv = self.create_block_validator(new_block, bvh.on_block_validated)\n bv.run()\n\n self.assertTrue(bvh.has_result())\n self.assertTrue(new_block.status == BlockStatus.Valid)\n self.assertTrue(bvh.result[\"commit_new_block\"])","def write_special_block(self, block, cell_content):\n if not cell_content:\n self.save_text()\n con = 1\n if block['t'] == 'Header':\n con = 2\n self.list_parse(block['c'][con])\n if not cell_content:\n self.save_text()","def test_39(self):\n assert 'True' == Api.requestBlock('test-39')","def block_splitter(data, block_size):\n buf = []\n for i, datum in enumerate(data):\n buf.append(datum)\n if len(buf) == block_size:\n yield buf\n buf = []\n\n # If there's anything leftover (a partial block),\n # yield it as well.\n if buf:\n yield buf","def combine_and_select_block(self, first):\n block = self.combine_block(first)\n self.combined.append(block)","def open_launcher(self):\n vim.command('silent! botright split {0}'.format(self.name))\n self.setup_buffer()","def add_new_block(self):\n old_block = self.curr_block\n self.curr_block = self.gen_new_block()\n add_edge(old_block, self.curr_block)","def addBlock(self, newBlock):\n newBlock.index = len(self.chain)\n newBlock.previousHash = self.chain[-1].hash\n newBlock.mineBlock(self.difficulty)\n self.chain.append(newBlock)\n self.writeBlocks()","def nextblock(self, parent=None, **kwargs):\n block = self.newblock(parent, **kwargs)\n if not parent and self.block:\n self.block.add_child(block)\n\n self.block = block\n return block","def test_block_bad_batch(self):\n pass","def add_block_str(self, block_str):\n return self._add_block_str(block_str, True, False)","def test_02(self):\n assert 'False' == Api.requestBlock('test-02')","def finish_hanging(self):\n if self.groups.starting_signature:\n if self.groups.starting_group:\n self.add_tokens_for_group(with_pass=True)\n\n elif self.groups.starting_single:\n self.add_tokens_for_single()","def get_block(\n self, position: typing.Tuple[int, int, int], none_if_str=True\n ) -> typing.Union[typing.Any, str, None]:\n raise NotImplementedError","def _initBlock(o,block):\n o.block = block.clone().shift(*o.board.startPosition)","def test_34(self):\n assert 'False' == Api.requestBlock('test-34')","def func(self):\n # check what aliases we have used\n if self.cmdstring == \"getinline\":\n self.switches.append(\"getinline\")\n if self.cmdstring == \"nextinline\":\n self.switches.append(\"nextinline\")\n if \"createline\" in self.switches:\n self.create_line()\n return\n if not self.args and not self.switches:\n self.display_line()\n return\n if not self.check_line:\n return\n if \"getinline\" in self.switches:\n self.join_line()\n return\n if \"nextinline\" in self.switches:\n self.next_in_line()\n return\n if \"dropout\" in self.switches:\n self.drop_out()\n return\n if \"dismiss\" in self.switches:\n self.dismiss()\n return\n if \"loop\" in self.switches:\n self.toggle_loop()\n return","def _maskhg19(self):\n if len(self._current_block) > 2:\n self._current_block[0].text = self._current_block[1].text\n self._current_block[0].size = self._current_block[1].size\n self._current_block[0].setstring()\n self._current_block.remove(self._current_block[1])\n else:\n self._current_block = []","def reconsiderblock(self, block_hash: str) -> None:\n return self.rpc_call(\"reconsiderblock\", block_hash)","def test_43(self):\n assert 'False' == Api.requestBlock('test-43')","def createFirstBlock(self):\n firstBlock = Block(0, self.__currentTransactionsList, 0, '00')\n self.__chain.append(firstBlock)","def test_block_bad_signature(self):\n pass","def test_14(self):\n assert 'False' == Api.requestBlock('test-14')","def do_block():\n print_column()\n print_rows()","def do_block():\n print_column()\n print_rows()","def on_new_line(self, line, is_full_line):\n try:\n if is_full_line:\n self._parse_v_option(line)\n self._parse_general_info(line)\n self._parse_header(line)\n except ParsingDone:\n pass # line has been fully parsed by one of above parse-methods\n return super(W, self).on_new_line(line, is_full_line)","def parseChunk(self, parent, text):\r\n self.parseBlocks(parent, text.split('\\n\\n'))","def visit_option_argument(self, node):\n self.body.append(node.get('delimiter', ' '))","def visit_option_argument(self, node):\n self.body.append(node.get('delimiter', ' '))","def test_03(self):\n assert 'False' == Api.requestBlock('test-03')","def test_41(self):\n assert 'False' == Api.requestBlock('test-41')","def test_16(self):\n assert 'False' == Api.requestBlock('test-16')","def nextblock(self, parent=None):\n block = ControlBlock()\n self.blocks.add(block)\n if parent:\n parent.add_child(block)\n elif self.block:\n self.block.add_child(block)\n self.block = block\n return self.block","def valid_chain(self, block, prev_block):\n self.stop_mine()\n\n print('\\n //// MINING STOPPED\\n')\n\n print('\\n //// block entering valid_chain')\n pprint(block)\n\n if block is not None and block['message'] != 'mining stopped':\n if block['previous_hash'] == self.hash(prev_block):\n \n # Check that the Proof of Work is correct\n if self.valid_proof(prev_block['proof'], block['proof']):\n if block['index'] == self.last_block['index']:\n if self.last_block['timestamp'] > block['timestamp']:\n del self.chain[-1]\n self.chain.append(block)\n print('\\n //// true from equal index but older timestamp')\n return True\n\n elif self.last_block['timestamp'] == block['timestamp']:\n print('\\n //// true from timestamps are equal block isnt added')\n return True\n else:\n print('\\n //// true timestamp is newer not added but sending false')\n return False\n\n elif block['index'] > self.last_block['index']:\n print('\\n //// true from index is greater and block is added')\n self.chain.append(block)\n return True\n else:\n print('\\n //// false from adding block had index less than block already there')\n else:\n print('\\n //// false from not a valid proof')\n\n else:\n print('\\n //// false from hashes arent equal')\n if (block['timestamp'] < self.last_block['timestamp']):\n if (block['index'] == self.last_block['index']):\n print('\\n //// hashes arent equal but block is older, subtracting and adding')\n del self.chain[-1]\n self.chain.append(block)\n return True\n\n elif (block['timestamp'] > self.last_block['timestamp']):\n if(block['index'] > self.last_block['index']):\n self.chain.append(block)\n return True\n else:\n return True\n\n return False\n\n else:\n return 'reject'","async def xpblock(self, ctx, *, user_or_role : str = None):\r\n\r\n\t\tusage = 'Usage: `{}xpblock [user_or_role]`'.format(ctx.prefix)\r\n\r\n\t\tif not await Utils.is_bot_admin_reply(ctx): return\r\n\r\n\t\tif user_or_role == None:\r\n\t\t\tawait ctx.message.channel.send(usage)\r\n\t\t\treturn\r\n\r\n\t\troleName = user_or_role\r\n\t\tis_user = True\r\n\t\tif type(user_or_role) is str:\r\n\t\t\t# Check user first\r\n\t\t\tuser_or_role = DisplayName.memberForName(roleName, ctx.guild)\r\n\t\t\tif not user_or_role:\r\n\t\t\t\tis_user = False\r\n\t\t\t\t# Check role\r\n\t\t\t\tif roleName.lower() == \"everyone\" or roleName.lower() == \"@everyone\":\r\n\t\t\t\t\tuser_or_role = ctx.guild.default_role\r\n\t\t\t\telse:\r\n\t\t\t\t\tuser_or_role = DisplayName.roleForName(roleName, ctx.guild)\r\n\t\t\t\t\t\r\n\t\t\tif not user_or_role:\r\n\t\t\t\tmsg = 'I couldn\\'t find *{}*...'.format(Nullify.escape_all(roleName))\r\n\t\t\t\tawait ctx.message.channel.send(msg)\r\n\t\t\t\treturn\r\n\t\t\r\n\t\t# Check if they're admin or bot admin\r\n\t\tif Utils.is_bot_admin(user_or_role):\r\n\t\t\treturn await ctx.send(\"You can't block other admins with this command.\")\r\n\t\tif is_user:\r\n\t\t\tur_name = DisplayName.name(user_or_role)\r\n\t\telse:\r\n\t\t\tur_name = Nullify.escape_all(user_or_role.name)\r\n\r\n\t\t# Now we see if we already have that role in our list\r\n\t\tpromoArray = self.settings.getServerStat(ctx.message.guild, \"XpBlockArray\")\r\n\r\n\t\tfor aRole in promoArray:\r\n\t\t\t# Get the role that corresponds to the id\r\n\t\t\tif str(aRole) == str(user_or_role.id):\r\n\t\t\t\t# We found it - throw an error message and return\r\n\t\t\t\tmsg = '**{}** is already in the list.'.format(ur_name)\r\n\t\t\t\tawait ctx.message.channel.send(msg)\r\n\t\t\t\treturn\r\n\r\n\t\t# If we made it this far - then we can add it\r\n\t\tpromoArray.append(user_or_role.id)\r\n\t\tself.settings.setServerStat(ctx.message.guild, \"XpBlockArray\", promoArray)\r\n\r\n\t\tmsg = '**{}** added to list.'.format(ur_name)\r\n\t\tawait ctx.message.channel.send(msg)\r\n\t\treturn","def next_block_type(self):\n if self.current_block_type >= len(self.available_block_types) - 1:\n self.current_block_type = 0\n else:\n self.current_block_type += 1","def gen_break(self, stmt: statements.Break) -> None:\n # block = self.get_label_block(stmt.label)\n if self.break_block_stack:\n block = self.break_block_stack[-1]\n self.builder.emit_jump(block)\n else:\n self.error(\"Cannot break here!\", stmt)\n new_block = self.builder.new_block()\n self.builder.set_block(new_block)","def test_15(self):\n assert 'False' == Api.requestBlock('test-15')","def test_26(self):\n assert 'False' == Api.requestBlock('test-26')","def parse_blocks(self):\n if not self.options.blocks:\n return\n block_identifiers, block_aliases = [list(b) for b in zip(*self.options.blocks)]\n while block_identifiers:\n nodelist = self.parser.parse(block_identifiers)\n token = self.parser.next_token()\n current_identifier = block_identifiers.pop(0)\n current_alias = block_aliases.pop(0)\n while token.contents != current_identifier:\n current_identifier = block_identifiers.pop(0)\n self.blocks[block_aliases.pop(0)] = template.NodeList() \n self.blocks[current_alias] = nodelist\n assert len(self.blocks) == len(self.options.blocks), \"%s block parsing failed: %r => %r\" % (self.tagname, self.options.blocks, self.blocks)","def test_46(self):\n assert 'False' == Api.requestBlock('test-46')","def test_12(self):\n assert 'False' == Api.requestBlock('test-12')","def test_11(self):\n assert 'False' == Api.requestBlock('test-11')","def enter(self):\n if self.pos < self.line_length():\n # If the position is not at the end of the line split the line\n self.buffer.split_line(self.line, self.pos)\n else:\n self.buffer.insert_line(\"\", self.line + 1)\n \n self.line += 1\n self.pos = 0\n self.has_changes = True","def test_38(self):\n assert 'True' == Api.requestBlock('test-38')","def test(self, parent, block):\r\n pass","def test_44(self):\n assert 'False' == Api.requestBlock('test-44')"],"string":"[\n \"def block_one(self):\",\n \"def block(self):\\n pass\",\n \"def handle_request(self, request):\\n ret = True\\n for option in request.options:\\n if option.number == defines.inv_options[\\\"Block2\\\"]:\\n host, port = request.source\\n key = hash(str(host) + str(port) + str(request.token))\\n num, m, size = parse_blockwise(option.raw_value)\\n # remember choices\\n if key in self._parent.blockwise:\\n block, byte, num2, m2, size2 = self._parent.blockwise[key]\\n if block == 2:\\n self._parent.blockwise[key] = (2, byte, num, m, size)\\n else:\\n self._parent.blockwise[key] = (2, 0, num, m, size)\\n else:\\n self._parent.blockwise[key] = (2, 0, num, m, size)\\n elif option.number == defines.inv_options[\\\"Block1\\\"]:\\n host, port = request.source\\n key = hash(str(host) + str(port) + str(request.token))\\n num, m, size = parse_blockwise(option.raw_value)\\n # remember choices\\n self._parent.blockwise[key] = (1, 0, num, m, size)\\n if m == 0:\\n del self._parent.blockwise[key]\\n ret = False\\n return ret, request\",\n \"def start_block2(self, request):\\n host, port = request.source\\n key = hash(str(host) + str(port) + str(request.token))\\n self._parent.blockwise[key] = (2, 0, 0, 1, 1024)\",\n \"def new_block_call(self, event):\\n self.push_job(flush=True)\",\n \"def blocks(self):\\n pass\",\n \"def split(self, block: ghidra.program.model.mem.MemoryBlock, addr: ghidra.program.model.address.Address) -> None:\\n ...\",\n \"def execute_block_now(event):\\n b = event.cli.current_buffer\\n b.validate_and_handle()\",\n \"def block_on(self, char):\\n self._blocker_char = char\",\n \"def handleBlock(self, block_str):\\n\\n new_block = Block()\\n new_block.parseJson(block_str)\\n if not self.checkBlock(new_block):\\n return False\\n\\n if new_block.confirmed:# if confirmed by someone, check and add block\\n if valid_proof_of_work(new_block):\\n print(\\\"Someone done before me, I'm going to stop\\\")\\n self.threadjob = False\\n self.BlockChain.addBlock(new_block) \\n else:\\n raise Exception(\\\"Hey this Block's Hash is not valid\\\")\\n return False\\n\\n elif self.miner_indicator:\\n if self.threadjob:\\n print(\\\"This is miner, I should mine, but I'm already doing \\\")\\n return True\\n print(\\\"Hey this is miner, I'm going to mine\\\")\\n self.threadjob = True\\n t = Thread(target=self.mine, args = (new_block,))\\n t.start()\\n else:\\n print(\\\"Hey this is unconfirmed block , but I am not miner, so I gonna miss it\\\")\\n return True\",\n \"def block_type(self):\\r\\n raise NotImplementedError()\",\n \"def splitblock(self, name=None, terminate=False):\\n # -------------------------------------------------\\n # Sanity check\\n\\n # Allow splitting only after leaders and before terminator\\n # TODO: error check\\n\\n # -------------------------------------------------\\n # Split\\n\\n oldblock = self._curblock\\n newblock = self.func.new_block(name or 'block', after=self._curblock)\\n op = self._lastop\\n\\n # Terminate if requested and not done already\\n if terminate and not ops.is_terminator(op):\\n op = self.jump(newblock)\\n\\n # -------------------------------------------------\\n # Move ops after the split to new block\\n\\n if op:\\n if op == 'head':\\n trailing = list(self._curblock.ops)\\n elif op == 'tail':\\n trailing = []\\n else:\\n trailing = list(op.block.ops.iter_from(op))[1:]\\n\\n for op in trailing:\\n op.unlink()\\n newblock.extend(trailing)\\n\\n # -------------------------------------------------\\n # Patch phis\\n\\n if terminate:\\n self._patch_phis(oldblock.ops, oldblock, newblock)\\n else:\\n for op in oldblock:\\n for use in self.func.uses[op]:\\n if use.opcode == 'phi':\\n raise error.CompileError(\\n \\\"Splitting this block would corrupt some phis\\\")\\n\\n self._patch_phis(newblock.ops, oldblock, newblock)\\n\\n return oldblock, newblock\",\n \"def end():\\n return EndBlock()\",\n \"def parseBlock(self, text, prevLineData):\\n return self.parser.parseBlock(text, prevLineData)\",\n \"def changed_block(self, old_block, new_block):\",\n \"def start_block(self):\\n self.stop_running()\\n self.update_action(Action.block)\",\n \"def check_block(self, block):\\n pass\",\n \"def onBlock(self, data) :\\n pass\",\n \"def test_block_full_context(self):\\n # old model file == beam block full context false\\n pp = ParlaiParser(True, True)\\n opt = pp.parse_args(\\n ['--model-file', 'zoo:unittest/transformer_generator2/model']\\n )\\n agent = create_agent(opt, True)\\n self.assertEqual(agent.opt['beam_block_full_context'], False)\\n self.assertEqual(agent.beam_block_full_context, False)\\n\\n # brand new model == beam block full context true\\n pp = ParlaiParser(True, True)\\n opt = pp.parse_args(['--model', 'transformer/generator'])\\n agent = create_agent(opt, True)\\n self.assertEqual(agent.opt['beam_block_full_context'], True)\\n self.assertEqual(agent.beam_block_full_context, True)\",\n \"def _prepare_blocks():\\n\\n counter = blocks[0]['freeStart']\\n maxBlocks = blocks[0]['maxBlocks']\\n while(counter < maxBlocks) :\\n try:\\n # print (mount['parent'] + '/linddata.' + str(counter))\\n f = open(mount['parent'] + '/linddata.' + str(counter), 'r') \\n except IOError, e:\\n return STATUS['M_BD']\\n else :\\n fdatastring = f.next()\\n fdata = deserializedata(fdatastring)\\n blocks[counter] = fdata\\n counter += 1\\n \\n return STATUS['OK']\",\n \"def put_block(self):\\n self.blocks[self.editor_cursor_position[1]][\\n self.editor_cursor_position[0]] = self.available_block_types[self.current_block_type]\",\n \"def block_program(description):\\n\\n def run(self):\\n n = len(description)\\n i = 0\\n while i + n <= len(self.shrink_target.blocks):\\n attempt = bytearray(self.shrink_target.buffer)\\n failed = False\\n for k, d in reversed(list(enumerate(description))):\\n j = i + k\\n u, v = self.blocks[j].bounds\\n if d == \\\"-\\\":\\n value = int_from_bytes(attempt[u:v])\\n if value == 0:\\n failed = True\\n break\\n else:\\n attempt[u:v] = int_to_bytes(value - 1, v - u)\\n elif d == \\\"X\\\":\\n del attempt[u:v]\\n else: # pragma: no cover\\n assert False, \\\"Unrecognised command %r\\\" % (d,)\\n if failed or not self.incorporate_new_buffer(attempt):\\n i += 1\\n\\n run.command = description\\n run.__name__ = \\\"block_program(%r)\\\" % (description,)\\n return run\",\n \"def test_04(self):\\n assert 'False' == Api.requestBlock('test-04', charOrder='')\",\n \"def nextSplit(self):\\n pass\",\n \"def processFirstBlock(block):\\n print(block)\\n if block[0:6].decode() == \\\"TRQ t \\\":\\n return [\\\"TRQ\\\", \\\"t\\\"]\\n elif block[0:6].decode() == \\\"TRQ f \\\":\\n return [\\\"TRQ\\\", \\\"f\\\"]\\n else:\\n return [\\\"\\\", \\\"\\\"]\",\n \"def build_block(self, format_string):\\n first_block = Block(None, py3_wrapper=self.py3_wrapper)\\n block = first_block\\n\\n # Tokenize the format string and process them\\n for token in self.tokens(format_string):\\n value = token.group(0)\\n if token.group(\\\"block_start\\\"):\\n # Create new block\\n block = block.new_block()\\n elif token.group(\\\"block_end\\\"):\\n # Close block setting any valid state as needed\\n # and return to parent block to continue\\n if not block.parent:\\n raise Exception(\\\"Too many `]`\\\")\\n block = block.parent\\n elif token.group(\\\"switch\\\"):\\n # a new option has been created\\n block = block.switch()\\n elif token.group(\\\"placeholder\\\"):\\n # Found a {placeholder}\\n key = token.group(\\\"key\\\")\\n format = token.group(\\\"format\\\")\\n block.add(Placeholder(key, format))\\n elif token.group(\\\"literal\\\"):\\n block.add(Literal(value))\\n elif token.group(\\\"lost_brace\\\"):\\n # due to how parsing happens we can get a lonesome }\\n # eg in format_string '{{something}' this fixes that issue\\n block.add(Literal(value))\\n elif token.group(\\\"command\\\"):\\n # a block command has been found\\n block.set_commands(token.group(\\\"command\\\"))\\n elif token.group(\\\"escaped\\\"):\\n # escaped characters add unescaped values\\n if value[0] in [\\\"\\\\\\\\\\\", \\\"{\\\", \\\"}\\\"]:\\n value = value[1:]\\n block.add(Literal(value))\\n\\n if block.parent:\\n raise Exception(\\\"Block not closed\\\")\\n # add to the cache\\n self.block_cache[format_string] = first_block\",\n \"def _set_block(self, pos, block_):\\n raise NotImplementedError\",\n \"def pick_block(self):\\n current_block = self.blocks[self.editor_cursor_position[1]][self.editor_cursor_position[0]]\\n if current_block in self.available_block_types:\\n self.current_block_type = self.available_block_types.index(current_block)\",\n \"def is_block(self) -> bool:\\n return self.answer == \\\".\\\"\",\n \"def begin():\\n return BeginBlock()\",\n \"def test_block_extra_batch(self):\\n pass\",\n \"def print_in_block(message):\\n print(\\\"|\\\", message)\",\n \"def _get_block(self, pos):\\n raise NotImplementedError\",\n \"def duplicate(self, uiPrompt = True):\\n try:\\n _str_func = 'duplicate'\\n _blockType = self.blockType\\n _side = get_side(self)\\n _nameOriginal = self.cgmName\\n \\n _d = {'blockType':self.blockType,\\n 'autoForm':False,\\n 'side':_side,\\n 'baseSize':baseSize_get(self),\\n 'blockProfile':self.blockProfile,\\n 'blockParent': self.p_blockParent}\\n \\n for a in 'cgmName','blockProfile':\\n if a in ['cgmName']:\\n _d['name'] = self.getMayaAttr(a)\\n elif self.hasAttr(a):\\n _d[a] = self.getMayaAttr(a) \\n \\n _title = 'New name for duplicate'.format(_blockType)\\n result = mc.promptDialog(title=_title,\\n message='Current: {0} | type: {1} | build: {2} | block:{3} '.format(_d['name'],_blockType,_d.get('blockProfile'),_d.get('buildProfile')),\\n button=['OK', 'Cancel'],\\n text = _d['name'],\\n defaultButton='OK',\\n cancelButton='Cancel',\\n dismissString='Cancel')\\n if result == 'OK':\\n _v = mc.promptDialog(query=True, text=True)\\n _d['name'] = _v\\n \\n else:\\n log.error(\\\"Duplication cancelled for |{0}|\\\".format(self))\\n return False\\n \\n log.debug(\\\"|{0}| >> Creating duplicate block. {1} | source: {2}\\\".format(_str_func, _blockType, self))\\n\\n \\n log.debug(\\\"|{0}| >> Block settings...\\\".format(_str_func)) \\n #pprint.pprint(_d)\\n \\\"\\\"\\\"\\n if replaceSelf:\\n ml_children = self.getBlockChildren()\\n _blockProfile = self.getMayaAttr('blockProfile')\\n mBlockModule = self.p_blockModule\\n \\n _d_profiles = {} \\n try:_d_profiles = mBlockModule.d_block_profiles\\n except:\\n log.error(cgmGEN.logString_msg(_str_func,'No d_block_profile_found')) \\n \\n _typeDict= _d_profiles.get(_blockProfile,{})\\n if _blockProfile and not _typeDict:\\n log.error(cgmGEN.logString_msg(_str_func,'blockType not found in blockProfiles. Please fix | found {0}'.format(_blockProfile)))\\n pprint.pprint(_d_profiles.keys())\\n return False \\n \\n _baseDat = _typeDict.get('baseDat')\\\"\\\"\\\"\\n \\n mDup = cgmMeta.createMetaNode('cgmRigBlock',\\n **_d)\\n \\n mDup.doSnapTo(self)\\n \\n blockDat = self.getBlockDat()\\n \\n blockDat['baseName'] = _v\\n blockDat['ud']['cgmName'] = _v\\n \\n if _d['blockType'] in ['finger','thumb']:\\n log.debug(\\\"|{0}| >> Clearing nameList\\\".format(_str_func))\\n for a in blockDat['ud'].iteritems():\\n if 'nameList' in a:\\n blockDat['ud'].remove(a)\\n blockDat['ud']['nameList_0'] = _v \\n \\n \\\"\\\"\\\"\\n if blockDat['ud'].get('rigSetup') in ['finger']:\\n log.debug(\\\"|{0}| >> Clearing nameList\\\".format(_str_func))\\n for a in blockDat['ud'].iteritems():\\n if 'nameList' in a:\\n blockDat['ud'].remove(a)\\n blockDat['nameList_0'] = _v\\\"\\\"\\\"\\n \\n #changeState(mDup,'define',forceNew=True)#redefine to catch any optional created items from settings\\n mDup.blockDat = blockDat\\n \\\"\\\"\\\"\\n if replaceSelf:\\n if _baseDat:\\n log.warning(cgmGEN.logString_msg(_str_func,'resetting baseDat: {0}'.format(_baseDat)))\\n mDup.baseDat = _baseDat \\\"\\\"\\\" \\n \\n for a in ['numSubShapers','rollCount']:\\n if ATTR.datList_exists(self.mNode, a):\\n l = self.datList_get(a)\\n mDup.datList_connect(a,l)\\n \\n \\n l_nameList = mDup.datList_get('nameList')\\n for i,n in enumerate(l_nameList):\\n if _nameOriginal in n:\\n l_nameList[i] = n.replace(_nameOriginal,_d['name'])\\n \\n mDup.datList_connect('nameList',l_nameList)\\n pprint.pprint(l_nameList) \\n \\n \\n blockDat_load(mDup,redefine=True)\\n #log.debug('here...')\\n #blockDat_load(mDup)#...investigate why we need two...\\n \\n #mDup.p_blockParent = self.p_blockParent\\n #self.connectChildNode(mMirror,'blockMirror','blockMirror')#Connect \\n \\\"\\\"\\\"\\n if replaceSelf:\\n for mChild in ml_children:\\n mChild.p_blockParent = mDup\\n \\n self.delete()\\\"\\\"\\\"\\n \\n\\n \\n return mDup\\n except Exception,err:cgmGEN.cgmExceptCB(Exception,err)\",\n \"def blockParser(block):\\n struct = []\\n first = True\\n record = False\\n for line in block:\\n if line.startswith('Structure #'):\\n record = True\\n if not first:\\n yield struct\\n struct = []\\n first = False\\n if record:\\n struct.append(line)\\n yield struct\",\n \"def test_05(self):\\n assert 'True' == Api.requestBlock('test-05', charOrder=50)\",\n \"def run(self, parent, blocks):\\r\\n pass\",\n \"def _prepare_consumed_block():\\n \\n blkcounter = 0\\n maxBlocks = blocks[0]['maxBlocks']\\n \\n freeStart = blocks[0]['freeStart']\\n freeEnd = blocks[0]['freeEnd']\\n \\n while(blkcounter in xrange(0, maxBlocks, 1)) :\\n # data type can be varied\\n # dictionary - for superBlock, directory and file inode\\n # list - for free block list, index list\\n # string - data blocks\\n # empty - free block\\n bdata = blocks[blkcounter]\\n # an afterthought - we really do not need to bother about\\n # data blocks here, as all the data blocks should be in one\\n # of index list or in location attribute of inode\\n \\n if (type(bdata) == list) :\\n if(blkcounter >= freeStart and blkcounter <= freeEnd) :\\n # free block list, so no reading the content of the list, \\n # but mark the block as a consumed block \\n consumedBlocks.append(blkcounter)\\n else :\\n # this is an index list, marking this block as consumed\\n # mark all the blocks listed in this list as consumed as well\\n consumedBlocks.append(blkcounter)\\n for n in bdata :\\n consumedBlocks.append(n)\\n elif (type(bdata) == dict) :\\n # mark this block as consumed block\\n consumedBlocks.append(blkcounter)\\n if(bdata.has_key('filename_to_inode_dict')) :\\n # if directory node has connected files\\n for n in bdata['filename_to_inode_dict'].values() :\\n consumedBlocks.append(n)\\n elif(bdata.has_key('location')): \\n # if this is a file node, then check indirect attribute\\n # and if inderect if 0, mark the value in location attribute\\n # as consumed block\\n # if indirect is 1, mark the value in location attribute\\n # as consumed block, then leave it, cause the 'if' block already\\n # does a check on index list \\n consumedBlocks.append(bdata['location'])\",\n \"def _do_add_block(self, args):\\r\\n bus_type = args[1]\\r\\n slave_id = int(args[2])\\r\\n name = args[3]\\r\\n block_type = int(args[4])\\r\\n starting_address = int(args[5])\\r\\n length = int(args[6])\\r\\n if bus_type == 'rtu':\\r\\n slave = self.server._servers[0].get_slave(slave_id)\\r\\n elif bus_type == 'tcp':\\r\\n slave = self.server._servers[1].get_slave(slave_id)\\r\\n slave.add_block(name, block_type, starting_address, length)\\r\\n return name\",\n \"def block(self, block):\\n\\n self._block = block\",\n \"def block(self, block):\\n\\n self._block = block\",\n \"def test_07(self):\\n assert 'False' == Api.requestBlock('test-07', charOrder='~!@#$%%^&*()=_+<>?/')\",\n \"def __parse_blocks_pass(self):\\n\\n self.stack = [DocumentStackToken()]\\n\\n self.tokenized_document = []\\n token_to_use = self.source_provider.get_next_line()\\n did_start_close = False\\n did_started_close = False\\n requeue = []\\n ignore_link_definition_start = False\\n POGGER.debug(\\\"---$---\\\", token_to_use)\\n POGGER.debug(\\\"---\\\")\\n self.__parse_properties.pragma_lines = {}\\n line_number = 1\\n try:\\n (\\n token_to_use,\\n line_number,\\n requeue,\\n ) = self.__process_front_matter_header_if_present(\\n token_to_use, line_number, requeue\\n )\\n did_start_close = token_to_use is None\\n keep_on_going = True\\n while keep_on_going:\\n POGGER.debug(\\\"next-line>>$\\\", token_to_use)\\n POGGER.debug(\\\"stack>>$\\\", self.stack)\\n POGGER.debug(\\\"current_block>>$\\\", self.stack[-1])\\n POGGER.debug(\\\"line_number>>$\\\", line_number)\\n POGGER.debug(\\\"---\\\")\\n\\n position_marker = PositionMarker(line_number, 0, token_to_use)\\n parser_state = ParserState(\\n self.stack,\\n self.tokenized_document,\\n TokenizedMarkdown.__close_open_blocks,\\n self.__handle_blank_line,\\n )\\n if did_start_close:\\n POGGER.debug(\\\"\\\\n\\\\ncleanup\\\")\\n\\n was_link_definition_started_before_close = self.stack[\\n -1\\n ].was_link_definition_started\\n\\n did_started_close = True\\n (\\n tokens_from_line,\\n requeue_line_info,\\n ) = TokenizedMarkdown.__close_open_blocks(\\n parser_state,\\n self.tokenized_document,\\n include_block_quotes=True,\\n include_lists=True,\\n caller_can_handle_requeue=True,\\n was_forced=True,\\n )\\n if tokens_from_line and not self.tokenized_document:\\n self.tokenized_document.extend(tokens_from_line)\\n\\n if not (requeue_line_info and requeue_line_info.lines_to_requeue):\\n keep_on_going = False\\n else:\\n assert was_link_definition_started_before_close\\n assert not requeue_line_info.lines_to_requeue[0]\\n\\n del requeue_line_info.lines_to_requeue[0]\\n line_number -= 1\\n\\n did_start_close = False\\n tokens_from_line = None\\n else:\\n POGGER.debug(\\\">>>>$\\\", self.tokenized_document)\\n\\n if not token_to_use or not token_to_use.strip():\\n POGGER.debug(\\\"call __parse_blocks_pass>>handle_blank_line\\\")\\n (\\n tokens_from_line,\\n requeue_line_info,\\n ) = self.__handle_blank_line(\\n parser_state,\\n token_to_use,\\n from_main_transform=True,\\n position_marker=position_marker,\\n )\\n else:\\n POGGER.debug(\\\"\\\\n\\\\nnormal lines\\\")\\n (\\n tokens_from_line,\\n _,\\n _,\\n requeue_line_info,\\n _,\\n ) = ContainerBlockProcessor.parse_line_for_container_blocks(\\n parser_state,\\n position_marker,\\n ignore_link_definition_start,\\n self.__parse_properties,\\n None,\\n )\\n\\n POGGER.debug(\\\"<<<<$\\\", self.tokenized_document)\\n\\n if keep_on_going:\\n line_number, ignore_link_definition_start = TokenizedMarkdown.__xx(\\n line_number, requeue_line_info, requeue\\n )\\n\\n POGGER.debug(\\n \\\"---\\\\nbefore>>$\\\",\\n self.tokenized_document,\\n )\\n POGGER.debug(\\\"before>>$\\\", tokens_from_line)\\n if tokens_from_line:\\n self.tokenized_document.extend(tokens_from_line)\\n POGGER.debug(\\n \\\"after>>$\\\",\\n self.tokenized_document,\\n )\\n if requeue:\\n POGGER.debug(\\\"requeue>>$\\\", requeue)\\n POGGER.debug(\\\"---\\\")\\n\\n (\\n token_to_use,\\n did_start_close,\\n did_started_close,\\n ) = self.__determine_next_token_process(\\n requeue, did_start_close, did_started_close\\n )\\n except AssertionError as this_exception:\\n error_message = f\\\"A project assertion failed on line {line_number} of the current document.\\\"\\n raise BadTokenizationError(error_message) from this_exception\\n\\n if self.__parse_properties.pragma_lines:\\n self.tokenized_document.append(\\n PragmaToken(self.__parse_properties.pragma_lines)\\n )\\n return self.tokenized_document\",\n \"def handle_eof_in_block(self):\\n self.handle_error(\\\"hit EOF, expected close tag\\\")\",\n \"def inner_start_mining(self):\\n print(\\\"Mining a new block\\\")\\n blockchain = self.get_blockchain()\\n self.request_transactions(blockchain)\\n last_block_hash = blockchain.last_block().header\\n complete_hash, nonce = self.proof_of_work(last_block_hash)\\n new_block = self.create_block(complete_hash, nonce)\\n self.send_block(new_block)\\n self.reset_transaction()\",\n \"def makeBlock(tag):\\n return {\\\"t\\\":\\\"RawBlock\\\",\\\"c\\\":[\\\"html\\\",tag]}\",\n \"def penblock(self, block):\\n self.block = block\",\n \"def block(self):\\n return self._block\",\n \"def test_29(self):\\n assert 'True' == Api.requestBlock('test-29')\",\n \"def test_13(self):\\n assert 'False' == Api.requestBlock('test-13')\",\n \"def test_06(self):\\n assert 'False' == Api.requestBlock('test-06', charOrder=51)\",\n \"def test_27(self):\\n assert 'False' == Api.requestBlock('test-27')\",\n \"def block(self, source, task):\\n raise NotImplementedError\",\n \"def test_fork_simple(self):\\n bvh = self.BlockValidationHandler()\\n new_block = self.btm.generate_block(previous_block=self.btm.chain_head,\\n add_to_store=True)\\n\\n bv = self.create_block_validator(new_block, bvh.on_block_validated)\\n bv.run()\\n\\n self.assertTrue(bvh.has_result())\\n self.assertTrue(new_block.status == BlockStatus.Valid)\\n self.assertTrue(bvh.result[\\\"commit_new_block\\\"])\",\n \"def write_special_block(self, block, cell_content):\\n if not cell_content:\\n self.save_text()\\n con = 1\\n if block['t'] == 'Header':\\n con = 2\\n self.list_parse(block['c'][con])\\n if not cell_content:\\n self.save_text()\",\n \"def test_39(self):\\n assert 'True' == Api.requestBlock('test-39')\",\n \"def block_splitter(data, block_size):\\n buf = []\\n for i, datum in enumerate(data):\\n buf.append(datum)\\n if len(buf) == block_size:\\n yield buf\\n buf = []\\n\\n # If there's anything leftover (a partial block),\\n # yield it as well.\\n if buf:\\n yield buf\",\n \"def combine_and_select_block(self, first):\\n block = self.combine_block(first)\\n self.combined.append(block)\",\n \"def open_launcher(self):\\n vim.command('silent! botright split {0}'.format(self.name))\\n self.setup_buffer()\",\n \"def add_new_block(self):\\n old_block = self.curr_block\\n self.curr_block = self.gen_new_block()\\n add_edge(old_block, self.curr_block)\",\n \"def addBlock(self, newBlock):\\n newBlock.index = len(self.chain)\\n newBlock.previousHash = self.chain[-1].hash\\n newBlock.mineBlock(self.difficulty)\\n self.chain.append(newBlock)\\n self.writeBlocks()\",\n \"def nextblock(self, parent=None, **kwargs):\\n block = self.newblock(parent, **kwargs)\\n if not parent and self.block:\\n self.block.add_child(block)\\n\\n self.block = block\\n return block\",\n \"def test_block_bad_batch(self):\\n pass\",\n \"def add_block_str(self, block_str):\\n return self._add_block_str(block_str, True, False)\",\n \"def test_02(self):\\n assert 'False' == Api.requestBlock('test-02')\",\n \"def finish_hanging(self):\\n if self.groups.starting_signature:\\n if self.groups.starting_group:\\n self.add_tokens_for_group(with_pass=True)\\n\\n elif self.groups.starting_single:\\n self.add_tokens_for_single()\",\n \"def get_block(\\n self, position: typing.Tuple[int, int, int], none_if_str=True\\n ) -> typing.Union[typing.Any, str, None]:\\n raise NotImplementedError\",\n \"def _initBlock(o,block):\\n o.block = block.clone().shift(*o.board.startPosition)\",\n \"def test_34(self):\\n assert 'False' == Api.requestBlock('test-34')\",\n \"def func(self):\\n # check what aliases we have used\\n if self.cmdstring == \\\"getinline\\\":\\n self.switches.append(\\\"getinline\\\")\\n if self.cmdstring == \\\"nextinline\\\":\\n self.switches.append(\\\"nextinline\\\")\\n if \\\"createline\\\" in self.switches:\\n self.create_line()\\n return\\n if not self.args and not self.switches:\\n self.display_line()\\n return\\n if not self.check_line:\\n return\\n if \\\"getinline\\\" in self.switches:\\n self.join_line()\\n return\\n if \\\"nextinline\\\" in self.switches:\\n self.next_in_line()\\n return\\n if \\\"dropout\\\" in self.switches:\\n self.drop_out()\\n return\\n if \\\"dismiss\\\" in self.switches:\\n self.dismiss()\\n return\\n if \\\"loop\\\" in self.switches:\\n self.toggle_loop()\\n return\",\n \"def _maskhg19(self):\\n if len(self._current_block) > 2:\\n self._current_block[0].text = self._current_block[1].text\\n self._current_block[0].size = self._current_block[1].size\\n self._current_block[0].setstring()\\n self._current_block.remove(self._current_block[1])\\n else:\\n self._current_block = []\",\n \"def reconsiderblock(self, block_hash: str) -> None:\\n return self.rpc_call(\\\"reconsiderblock\\\", block_hash)\",\n \"def test_43(self):\\n assert 'False' == Api.requestBlock('test-43')\",\n \"def createFirstBlock(self):\\n firstBlock = Block(0, self.__currentTransactionsList, 0, '00')\\n self.__chain.append(firstBlock)\",\n \"def test_block_bad_signature(self):\\n pass\",\n \"def test_14(self):\\n assert 'False' == Api.requestBlock('test-14')\",\n \"def do_block():\\n print_column()\\n print_rows()\",\n \"def do_block():\\n print_column()\\n print_rows()\",\n \"def on_new_line(self, line, is_full_line):\\n try:\\n if is_full_line:\\n self._parse_v_option(line)\\n self._parse_general_info(line)\\n self._parse_header(line)\\n except ParsingDone:\\n pass # line has been fully parsed by one of above parse-methods\\n return super(W, self).on_new_line(line, is_full_line)\",\n \"def parseChunk(self, parent, text):\\r\\n self.parseBlocks(parent, text.split('\\\\n\\\\n'))\",\n \"def visit_option_argument(self, node):\\n self.body.append(node.get('delimiter', ' '))\",\n \"def visit_option_argument(self, node):\\n self.body.append(node.get('delimiter', ' '))\",\n \"def test_03(self):\\n assert 'False' == Api.requestBlock('test-03')\",\n \"def test_41(self):\\n assert 'False' == Api.requestBlock('test-41')\",\n \"def test_16(self):\\n assert 'False' == Api.requestBlock('test-16')\",\n \"def nextblock(self, parent=None):\\n block = ControlBlock()\\n self.blocks.add(block)\\n if parent:\\n parent.add_child(block)\\n elif self.block:\\n self.block.add_child(block)\\n self.block = block\\n return self.block\",\n \"def valid_chain(self, block, prev_block):\\n self.stop_mine()\\n\\n print('\\\\n //// MINING STOPPED\\\\n')\\n\\n print('\\\\n //// block entering valid_chain')\\n pprint(block)\\n\\n if block is not None and block['message'] != 'mining stopped':\\n if block['previous_hash'] == self.hash(prev_block):\\n \\n # Check that the Proof of Work is correct\\n if self.valid_proof(prev_block['proof'], block['proof']):\\n if block['index'] == self.last_block['index']:\\n if self.last_block['timestamp'] > block['timestamp']:\\n del self.chain[-1]\\n self.chain.append(block)\\n print('\\\\n //// true from equal index but older timestamp')\\n return True\\n\\n elif self.last_block['timestamp'] == block['timestamp']:\\n print('\\\\n //// true from timestamps are equal block isnt added')\\n return True\\n else:\\n print('\\\\n //// true timestamp is newer not added but sending false')\\n return False\\n\\n elif block['index'] > self.last_block['index']:\\n print('\\\\n //// true from index is greater and block is added')\\n self.chain.append(block)\\n return True\\n else:\\n print('\\\\n //// false from adding block had index less than block already there')\\n else:\\n print('\\\\n //// false from not a valid proof')\\n\\n else:\\n print('\\\\n //// false from hashes arent equal')\\n if (block['timestamp'] < self.last_block['timestamp']):\\n if (block['index'] == self.last_block['index']):\\n print('\\\\n //// hashes arent equal but block is older, subtracting and adding')\\n del self.chain[-1]\\n self.chain.append(block)\\n return True\\n\\n elif (block['timestamp'] > self.last_block['timestamp']):\\n if(block['index'] > self.last_block['index']):\\n self.chain.append(block)\\n return True\\n else:\\n return True\\n\\n return False\\n\\n else:\\n return 'reject'\",\n \"async def xpblock(self, ctx, *, user_or_role : str = None):\\r\\n\\r\\n\\t\\tusage = 'Usage: `{}xpblock [user_or_role]`'.format(ctx.prefix)\\r\\n\\r\\n\\t\\tif not await Utils.is_bot_admin_reply(ctx): return\\r\\n\\r\\n\\t\\tif user_or_role == None:\\r\\n\\t\\t\\tawait ctx.message.channel.send(usage)\\r\\n\\t\\t\\treturn\\r\\n\\r\\n\\t\\troleName = user_or_role\\r\\n\\t\\tis_user = True\\r\\n\\t\\tif type(user_or_role) is str:\\r\\n\\t\\t\\t# Check user first\\r\\n\\t\\t\\tuser_or_role = DisplayName.memberForName(roleName, ctx.guild)\\r\\n\\t\\t\\tif not user_or_role:\\r\\n\\t\\t\\t\\tis_user = False\\r\\n\\t\\t\\t\\t# Check role\\r\\n\\t\\t\\t\\tif roleName.lower() == \\\"everyone\\\" or roleName.lower() == \\\"@everyone\\\":\\r\\n\\t\\t\\t\\t\\tuser_or_role = ctx.guild.default_role\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\tuser_or_role = DisplayName.roleForName(roleName, ctx.guild)\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\tif not user_or_role:\\r\\n\\t\\t\\t\\tmsg = 'I couldn\\\\'t find *{}*...'.format(Nullify.escape_all(roleName))\\r\\n\\t\\t\\t\\tawait ctx.message.channel.send(msg)\\r\\n\\t\\t\\t\\treturn\\r\\n\\t\\t\\r\\n\\t\\t# Check if they're admin or bot admin\\r\\n\\t\\tif Utils.is_bot_admin(user_or_role):\\r\\n\\t\\t\\treturn await ctx.send(\\\"You can't block other admins with this command.\\\")\\r\\n\\t\\tif is_user:\\r\\n\\t\\t\\tur_name = DisplayName.name(user_or_role)\\r\\n\\t\\telse:\\r\\n\\t\\t\\tur_name = Nullify.escape_all(user_or_role.name)\\r\\n\\r\\n\\t\\t# Now we see if we already have that role in our list\\r\\n\\t\\tpromoArray = self.settings.getServerStat(ctx.message.guild, \\\"XpBlockArray\\\")\\r\\n\\r\\n\\t\\tfor aRole in promoArray:\\r\\n\\t\\t\\t# Get the role that corresponds to the id\\r\\n\\t\\t\\tif str(aRole) == str(user_or_role.id):\\r\\n\\t\\t\\t\\t# We found it - throw an error message and return\\r\\n\\t\\t\\t\\tmsg = '**{}** is already in the list.'.format(ur_name)\\r\\n\\t\\t\\t\\tawait ctx.message.channel.send(msg)\\r\\n\\t\\t\\t\\treturn\\r\\n\\r\\n\\t\\t# If we made it this far - then we can add it\\r\\n\\t\\tpromoArray.append(user_or_role.id)\\r\\n\\t\\tself.settings.setServerStat(ctx.message.guild, \\\"XpBlockArray\\\", promoArray)\\r\\n\\r\\n\\t\\tmsg = '**{}** added to list.'.format(ur_name)\\r\\n\\t\\tawait ctx.message.channel.send(msg)\\r\\n\\t\\treturn\",\n \"def next_block_type(self):\\n if self.current_block_type >= len(self.available_block_types) - 1:\\n self.current_block_type = 0\\n else:\\n self.current_block_type += 1\",\n \"def gen_break(self, stmt: statements.Break) -> None:\\n # block = self.get_label_block(stmt.label)\\n if self.break_block_stack:\\n block = self.break_block_stack[-1]\\n self.builder.emit_jump(block)\\n else:\\n self.error(\\\"Cannot break here!\\\", stmt)\\n new_block = self.builder.new_block()\\n self.builder.set_block(new_block)\",\n \"def test_15(self):\\n assert 'False' == Api.requestBlock('test-15')\",\n \"def test_26(self):\\n assert 'False' == Api.requestBlock('test-26')\",\n \"def parse_blocks(self):\\n if not self.options.blocks:\\n return\\n block_identifiers, block_aliases = [list(b) for b in zip(*self.options.blocks)]\\n while block_identifiers:\\n nodelist = self.parser.parse(block_identifiers)\\n token = self.parser.next_token()\\n current_identifier = block_identifiers.pop(0)\\n current_alias = block_aliases.pop(0)\\n while token.contents != current_identifier:\\n current_identifier = block_identifiers.pop(0)\\n self.blocks[block_aliases.pop(0)] = template.NodeList() \\n self.blocks[current_alias] = nodelist\\n assert len(self.blocks) == len(self.options.blocks), \\\"%s block parsing failed: %r => %r\\\" % (self.tagname, self.options.blocks, self.blocks)\",\n \"def test_46(self):\\n assert 'False' == Api.requestBlock('test-46')\",\n \"def test_12(self):\\n assert 'False' == Api.requestBlock('test-12')\",\n \"def test_11(self):\\n assert 'False' == Api.requestBlock('test-11')\",\n \"def enter(self):\\n if self.pos < self.line_length():\\n # If the position is not at the end of the line split the line\\n self.buffer.split_line(self.line, self.pos)\\n else:\\n self.buffer.insert_line(\\\"\\\", self.line + 1)\\n \\n self.line += 1\\n self.pos = 0\\n self.has_changes = True\",\n \"def test_38(self):\\n assert 'True' == Api.requestBlock('test-38')\",\n \"def test(self, parent, block):\\r\\n pass\",\n \"def test_44(self):\\n assert 'False' == Api.requestBlock('test-44')\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.62640697","0.61661994","0.6021515","0.5755425","0.56972605","0.5621218","0.55789465","0.55772924","0.5509449","0.55021685","0.5426134","0.53966236","0.53940547","0.53849393","0.5371453","0.53622526","0.5353725","0.5346401","0.53440475","0.5342697","0.5316477","0.52873236","0.5286101","0.52671295","0.5254315","0.52464074","0.5243924","0.5239295","0.52022743","0.5185023","0.51746094","0.51717204","0.5169843","0.5162618","0.5141435","0.5124506","0.51035875","0.50774753","0.50774497","0.5052052","0.5052052","0.5049856","0.504101","0.5029518","0.5015477","0.5013375","0.4998327","0.49829","0.49625477","0.49447128","0.4941575","0.4932166","0.4931994","0.4928474","0.49271235","0.4924444","0.49236873","0.49090055","0.4905615","0.4901128","0.4891148","0.4889988","0.48890084","0.4887226","0.48823753","0.48819506","0.48806563","0.4875949","0.4874744","0.48678035","0.48657107","0.4865508","0.48647285","0.48609617","0.48604724","0.48586854","0.4858151","0.4858151","0.48556116","0.4840658","0.4835976","0.4835976","0.4833429","0.4831193","0.48289403","0.48259628","0.48212835","0.48185456","0.48146486","0.48144957","0.4813606","0.48111534","0.48085618","0.48084688","0.48062307","0.48044008","0.48040462","0.48034403","0.48026255","0.47961903"],"string":"[\n \"0.62640697\",\n \"0.61661994\",\n \"0.6021515\",\n \"0.5755425\",\n \"0.56972605\",\n \"0.5621218\",\n \"0.55789465\",\n \"0.55772924\",\n \"0.5509449\",\n \"0.55021685\",\n \"0.5426134\",\n \"0.53966236\",\n \"0.53940547\",\n \"0.53849393\",\n \"0.5371453\",\n \"0.53622526\",\n \"0.5353725\",\n \"0.5346401\",\n \"0.53440475\",\n \"0.5342697\",\n \"0.5316477\",\n \"0.52873236\",\n \"0.5286101\",\n \"0.52671295\",\n \"0.5254315\",\n \"0.52464074\",\n \"0.5243924\",\n \"0.5239295\",\n \"0.52022743\",\n \"0.5185023\",\n \"0.51746094\",\n \"0.51717204\",\n \"0.5169843\",\n \"0.5162618\",\n \"0.5141435\",\n \"0.5124506\",\n \"0.51035875\",\n \"0.50774753\",\n \"0.50774497\",\n \"0.5052052\",\n \"0.5052052\",\n \"0.5049856\",\n \"0.504101\",\n \"0.5029518\",\n \"0.5015477\",\n \"0.5013375\",\n \"0.4998327\",\n \"0.49829\",\n \"0.49625477\",\n \"0.49447128\",\n \"0.4941575\",\n \"0.4932166\",\n \"0.4931994\",\n \"0.4928474\",\n \"0.49271235\",\n \"0.4924444\",\n \"0.49236873\",\n \"0.49090055\",\n \"0.4905615\",\n \"0.4901128\",\n \"0.4891148\",\n \"0.4889988\",\n \"0.48890084\",\n \"0.4887226\",\n \"0.48823753\",\n \"0.48819506\",\n \"0.48806563\",\n \"0.4875949\",\n \"0.4874744\",\n \"0.48678035\",\n \"0.48657107\",\n \"0.4865508\",\n \"0.48647285\",\n \"0.48609617\",\n \"0.48604724\",\n \"0.48586854\",\n \"0.4858151\",\n \"0.4858151\",\n \"0.48556116\",\n \"0.4840658\",\n \"0.4835976\",\n \"0.4835976\",\n \"0.4833429\",\n \"0.4831193\",\n \"0.48289403\",\n \"0.48259628\",\n \"0.48212835\",\n \"0.48185456\",\n \"0.48146486\",\n \"0.48144957\",\n \"0.4813606\",\n \"0.48111534\",\n \"0.48085618\",\n \"0.48084688\",\n \"0.48062307\",\n \"0.48044008\",\n \"0.48040462\",\n \"0.48034403\",\n \"0.48026255\",\n \"0.47961903\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5264465"},"document_rank":{"kind":"string","value":"24"}}},{"rowIdx":94779,"cells":{"query":{"kind":"string","value":"see if the if condition for a block is valid"},"document":{"kind":"string","value":"def check_valid(self, get_params):\n if self.commands._if:\n return self.commands._if.check_valid(get_params)"},"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 check_block(self, block):\n pass","def is_block(self):\n return self.v & 1 == 0","def test_29_if(self):\n\t\tinput = \"\"\"procedure main(); var x:integer; begin x:=foo(); end\n\t\tfunction foo():integer; var a:real; begin\n\t\twith a:integer;b:real; do begin if a>0 then return 1; else b:=0; end\n\t\tend\"\"\"\n\t\texpect = \"Function foo Not Return\"\n\t\tself.assertTrue(TestChecker.test(input,expect,429))","def is_block(self):\n\t\treturn self.name in get_elements_collection(self.__res, 'block_level')","def is_valid_block(self, first):\n return (self.a_cursor > first.a and\n self.b_cursor > first.b)","def test_30_if(self):\n\t\tinput = \"\"\"procedure main(); var x:integer; begin x:=foo(); end\n\t\tfunction foo():integer; var a:real; begin\n\t\twith a:integer;b:real; do begin if a>0 then a:=1; else return 0; end\n\t\tend\"\"\"\n\t\texpect = \"Function foo Not Return\"\n\t\tself.assertTrue(TestChecker.test(input,expect,430))","def verify(condition):\n global _is_in_verify_within\n if not condition:\n calling_frame = inspect.currentframe().f_back\n error_message = 'verify() failed at line {} in \"{}\"'.format(calling_frame.f_lineno,\n calling_frame.f_code.co_filename)\n if not _is_in_verify_within:\n print error_message\n return False\n return True","def is_valid_proof(self, block, block_hash): \n return (block_hash.startswith('0' * Blockchain.difficulty) and block_hash == compute_hash())","def _inblock(row, column, init, end):\n return all([row[column][0] >= init[0],\n row[column][1] >= init[1],\n row[column][0] <= end[0],\n row[column][1] <= end[1]])","def test_28_if(self):\n\t\tinput = \"\"\"procedure main(); var x:integer; begin x:=foo(); end\n\t\tfunction foo():integer; var a:real; begin\n\t\twith a:integer;b:real; do begin if a>0 then return; else return 0; end\n\t\tend\"\"\"\n\t\texpect = \"Type Mismatch In Statement: Return(None)\"\n\t\tself.assertTrue(TestChecker.test(input,expect,428))","def check_if(self, token: tokenize.TokenInfo) -> bool:\n if self._seen_for:\n self._seen_if_in_line = True\n\n self._potential_violation = (\n self._potential_violation or\n self.seen_clause_in_line\n )\n return self._check_violation(token)\n return True","def test_27_if(self):\n\t\tinput = \"\"\"procedure main(); var x:integer; begin x:=foo(); end\n\t\tfunction foo():integer; var a:real; begin\n\t\twith a:integer;b:real; do begin if a>0 then a:=0; else b:=0; end\n\t\tend\"\"\"\n\t\texpect = \"Function foo Not Return\"\n\t\tself.assertTrue(TestChecker.test(input,expect,427))","def is_valid(self):\n # Check blocks\n for block in self.blocks.values():\n # Non-optional blocks must be enabled\n if (\n block.structure.number_non_optional_data() > 0\n and not block.enabled\n and block.is_allowed()\n ):\n self.last_error = (\n f'Required block \"{block.block_header.name}\" not enabled'\n )\n return False\n # Enabled blocks must be valid\n if block.enabled and not block.is_valid:\n self.last_error = f'Invalid block \"{block.block_header.name}\"'\n return False\n\n return True","def isValid(self):\n currBlock = self.getBlock(self.tailBlockHash)\n while currBlock != self.genesisBlock:\n if not self.isValidBlock(currBlock):\n return False\n currBlock = self.getBlock(currBlock.prevHash)\n return True","def chainIsValid(self):\n for i in range(1, len(self.blocks)):\n prev_block = self.blocks[i-1]\n cur_block = self.blocks[i]\n if cur_block.header['prevBlockH'] != getHashBlock(prev_block):\n return False\n return True","def is_block(self) -> bool:\n return self.answer == \".\"","def isValidBlock(self, block, unSpentTransactions):\n\n prevBlock = self.getBlock(self.tailBlockHash)\n if prevBlock.index+1 != block.index:\n return False\n elif prevBlock.currHash != block.prevHash:\n return False\n elif block.calculateHash() != block.currHash:\n return False\n return block.isValid(unSpentTransactions)","def valid_proof(block):\n return Blockchain.hash(block) [:4] == \"0000\"","def check():","def isValid(self) :\n try :\n pos = 0\n while self.firstblock[pos] == chr(0) :\n pos += 1\n except IndexError : \n return False\n else : \n firstblock = self.firstblock[pos:]\n if firstblock.startswith(\"\\033E\\033\") or \\\n firstblock.startswith(\"\\033%1BBPIN;\") or \\\n ((pos == 11000) and firstblock.startswith(\"\\033\")) or \\\n (firstblock.startswith(\"\\033*rbC\") and (not self.lastblock[-3:] == \"\\f\\033@\")) or \\\n firstblock.startswith(\"\\033*rB\\033\") or \\\n firstblock.startswith(\"\\033%8\\033\") or \\\n (firstblock.find(\"\\033%-12345X\") != -1) or \\\n (firstblock.find(\"@PJL ENTER LANGUAGE=PCL\\012\\015\\033\") != -1) or \\\n (firstblock.startswith(chr(0xcd)+chr(0xca)) and (firstblock.find(\"\\033E\\033\") != -1)) :\n return True\n else : \n return False","def validateBlock(self, currentBlock, previousBlock): \n \n # Check the block index\n if currentBlock.index != previousBlock.index + 1:\n return False\n if currentBlock.previousHash != previousBlock.hash:\n return False\n if currentBlock.hash != currentBlock.hashBlock():\n return False\n if not self.validateNonce(previousBlock.nonce, previousBlock.hash, currentBlock.nonce):\n return False\n return True","def check(self): # full program\n r = re.compile('(?!(^(((?!;)[A-Z][+-]?\\d+(\\.\\d+)?\\s?)*(\\s*;\\s.*)?)$))')\n for line in self.blocks:\n if r.match(line) and line and line != '\\r' and line != '\\n':\n return False\n return True","def test_34(self):\n assert 'False' == Api.requestBlock('test-34')","def is_valid_proof(self, block, block_hash):\r\n return (block_hash.startswith('0' * Blockchain.difficulty) and\r\n block_hash == block.compute_hash())","def find_block_to_run(blk):\n _top = find_top_block(blk)\n if blk == _top and blk.name[0:3] is not 'def':\n return True\n else:\n return False","def is_valid_proof(cls, block, block_hash):\n return (cls.ifsatisfy_diff(block_hash) and block_hash == block.compute_hash())","def test_13(self):\n assert 'False' == Api.requestBlock('test-13')","def test_03(self):\n assert 'False' == Api.requestBlock('test-03')","def test_37(self):\n assert 'False' == Api.requestBlock('test-37')","def test_27(self):\n assert 'False' == Api.requestBlock('test-27')","def is_valid_proof(cls, block, block_hash):\n return (block_hash.startswith('0' * Blockchain.difficulty) and\n block_hash == block.compute_hash())","def is_valid_proof(cls, block, block_hash):\n return (block_hash.startswith('0' * Blockchain.difficulty) and\n block_hash == block.compute_hash())","def test_41(self):\n assert 'False' == Api.requestBlock('test-41')","def test_28(self):\n assert 'False' == Api.requestBlock('test-28')","def test_35(self):\n assert 'False' == Api.requestBlock('test-35')","def test_33(self):\n assert 'False' == Api.requestBlock('test-33')","def test_26(self):\n assert 'False' == Api.requestBlock('test-26')","def condition_forward_checking(csp, var) :\n return False","def condition_forward_checking(csp, var) :\n return False","def test_46(self):\n assert 'False' == Api.requestBlock('test-46')","def test_43(self):\n assert 'False' == Api.requestBlock('test-43')","def test_11(self):\n assert 'False' == Api.requestBlock('test-11')","def check_for(self, token: tokenize.TokenInfo) -> bool:\n self._is_comprehension = True\n self._seen_for = True\n self._seen_for_in_line = True\n\n self._potential_violation = (\n self._potential_violation or\n self.seen_clause_in_line\n )\n return self._check_violation(token)","def test_14(self):\n assert 'False' == Api.requestBlock('test-14')","def test_44(self):\n assert 'False' == Api.requestBlock('test-44')","def test_23(self):\n assert 'False' == Api.requestBlock('test-23')","def test_09(self):\n assert 'False' == Api.requestBlock('test-09')","def test(self, parent, block):\n\n self.match = self.pattern.match(block) if self.pattern is not None else None\n return self.match is not None","def test_02(self):\n assert 'False' == Api.requestBlock('test-02')","def _check_free_block():\n \n # populate the block data fields\n status = _prepare_blocks()\n if(status != STATUS['OK']) :\n # some metadata file reading error\n return status\n \n # find which blocks are already consumed, \n # per the block level metadata\n _prepare_consumed_block()\n \n \n # TODO : remove debug statements\n # print consumedBlocks\n \n freeStart = blocks[0]['freeStart']\n freeEnd = blocks[0]['freeEnd']\n blknum = 0\n for fblkcnt in xrange(freeStart, freeEnd + 1, 1) :\n for fblk in blocks[fblkcnt] :\n # if free block is zero, then, it should not be in consumed blocks\n # else it definitely should be\n print fblkcnt, \" - \", fblk, \" - \", blknum\n if (fblk == 0 and (blknum in consumedBlocks)):\n # free blocks says it's free, but consumed block says it's not\n return STATUS['F_NFB']\n elif(fblk == 1 and not(blknum in consumedBlocks)) : \n # free block says it's not free, but consumed block says it is\n return STATUS['F_MFB']\n \n blknum += 1\n # consistency all ok\n return STATUS['OK']","def _check_multiline_conditions(self, node: ast.If) -> None:\n start_lineno = getattr(node, 'lineno', None)\n for sub_nodes in ast.walk(node.test):\n sub_lineno = getattr(sub_nodes, 'lineno', None)\n if sub_lineno is not None and sub_lineno > start_lineno:\n self.add_violation(MultilineConditionsViolation(node))\n break","def check(self):\n return True","def test_52(self):\n assert 'False' == Api.requestBlock('test-52')","def valid_chain(self, chain):\n last_block = chain[0]\n current_index = 1\n\n while current_index < len(chain):\n block = chain[current_index]\n # print(f'{last_block}')\n # print(f'{block}')\n # print(\"\\n-----------\\n\")\n # Check that the hash of the block is correct\n last_block_hash = self.hash(last_block)\n if block['previous_hash'] != self.hash(last_block):\n return False\n\n # Check that the Proof of Work is correct\n if not self.valid_proof(last_block['proof'], block['proof'], last_block_hash):\n return False\n\n last_block = block\n current_index += 1\n\n return True","def test_12(self):\n assert 'False' == Api.requestBlock('test-12')","def test_36(self):\n assert 'False' == Api.requestBlock('test-36')","def is_valid_block(last_block, block):\n if block.last_hash != last_block.hash:\n raise Exception('Incorrect last_hash')\n if hex_to_binary(block.hash)[0:block.difficulty] != '0' * block.difficulty:\n raise Exception('Proof of Work not fulfilled')\n if abs(block.difficulty - last_block.difficulty) > 1:\n raise Exception('Block difficulty must only adjust by 1')\n\n reconstructed_hash = crypto_hash(\n block.timestamp,\n block.last_hash,\n block.data,\n block.nonce,\n block.difficulty\n )\n\n if block.hash != reconstructed_hash:\n raise Exception('Incorrect Block hash')","def condition(self):\n return True","def test_40(self):\n assert 'False' == Api.requestBlock('test-40')","def _if(self):\n debug.show(\"if:Stack = \" + str(self.opStack))\n if self.opStack.size() >= 2:\n ifcode = isCode(self.opStack.pop()) # Make sure it is code (a list)\n if check.isBool(self.opStack.pop()):\n debug.show(\"if:True\")\n evaluate(ifcode)\n else:\n debug.err(\"not enough items on the stack\")\n debug.show(\"if:False\")\n return None","def is_block_complete(self, n):\n\n return self._complete(self._block(n))","def test_15(self):\n assert 'False' == Api.requestBlock('test-15')","def test_16(self):\n assert 'False' == Api.requestBlock('test-16')","def check_ok (result):\n return not result is None and (not \"due to errors\" in result)","def test_21(self):\n assert 'False' == Api.requestBlock('test-21')","def test_06(self):\n assert 'False' == Api.requestBlock('test-06', charOrder=51)","def is_valid(self):\n\n chain = blockchain.chain # This object of type Blockchain may be useful\n\n # Placeholder for (1a)\n\n # (checks that apply to all blocks)\n # Check that Merkle root calculation is consistent with transactions in block (use the calculate_merkle_root function) [test_rejects_invalid_merkle]\n # On failure: return False, \"Merkle root failed to match\"\n if self.merkle != self.calculate_merkle_root():\n return False, \"Merkle root failed to match\"\n\n # Check that block.hash is correctly calculated [test_rejects_invalid_hash]\n # On failure: return False, \"Hash failed to match\"\n if self.hash != self.calculate_hash():\n return False, \"Hash failed to match\"\n\n # Check that there are at most 900 transactions in the block [test_rejects_too_many_txs]\n # On failure: return False, \"Too many transactions\"\n if len(self.transactions) > 900:\n return False, \"Too many transactions\"\n\n # (checks that apply to genesis block)\n if self.is_genesis:\n # Check that height is 0 and parent_hash is \"genesis\" [test_invalid_genesis]\n # On failure: return False, \"Invalid genesis\"\n if self.height != 0 or self.parent_hash != \"genesis\":\n return False, \"Invalid genesis\"\n\n # (checks that apply only to non-genesis blocks)\n else:\n # Check that parent exists (you may find chain.blocks helpful) [test_nonexistent_parent]\n # On failure: return False, \"Nonexistent parent\"\n if self.parent_hash not in chain.blocks:\n return False, \"Nonexistent parent\"\n\n # Check that height is correct w.r.t. parent height [test_bad_height]\n # On failure: return False, \"Invalid height\"\n if self.height != chain.blocks[self.parent_hash].height + 1:\n return False, \"Invalid height\"\n\n # Check that timestamp is non-decreasing [test_bad_timestamp]\n # On failure: return False, \"Invalid timestamp\"\n if self.timestamp < chain.blocks[self.parent_hash].timestamp:\n return False, \"Invalid timestamp\"\n\n # Check that seal is correctly computed and satisfies \"target\" requirements; use the provided seal_is_valid method [test_bad_seal]\n # On failure: return False, \"Invalid seal\"\n if self.seal_is_valid() == False:\n return False, \"Invalid seal\"\n\n # Check that all transactions within are valid (use tx.is_valid) [test_malformed_txs]\n # On failure: return False, \"Malformed transaction included\"\n for tx in self.transactions:\n if tx.is_valid() == False:\n return False, \"Malformed transaction included\"\n\n # Check that for every transaction\n tx_in_block = {}\n input_refs_in_block = {}\n for tx in self.transactions:\n # the transaction has not already been included on a block on the same blockchain as this block [test_double_tx_inclusion_same_chain]\n # (or twice in this block; you will have to check this manually) [test_double_tx_inclusion_same_block]\n # (you may find chain.get_chain_ending_with and chain.blocks_containing_tx and util.nonempty_intersection useful)\n # On failure: return False, \"Double transaction inclusion\"\n if nonempty_intersection(chain.get_chain_ending_with(self.parent_hash), chain.blocks_containing_tx.get(tx.hash, [])):\n return False, \"Double transaction inclusion\"\n\n # If the two same transactions in this block\n if tx.hash in tx_in_block:\n return False, \"Double transaction inclusion\"\n else:\n # If not, add to the dict.\n tx_in_block[tx.hash] = tx\n\n # for every input ref in the tx\n input_user = None\n output_sum=0\n input_sum = 0\n for input_ref in tx.input_refs:\n\n # (you may find the string split method for parsing the input into its components)\n input_tx = input_ref.split(\":\")\n input_tx_hash = input_tx[0]\n input_tx_index = int(input_tx[1])\n\n # each input_ref is valid (aka corresponding transaction can be looked up in its holding transaction) [test_failed_input_lookup]\n # (you may find chain.all_transactions useful here)\n # On failure: return False, \"Required output not found\"\n if (input_tx_hash not in chain.all_transactions or input_tx_index >= len(chain.all_transactions[input_tx_hash].outputs)) and input_tx_hash not in tx_in_block:\n return False, \"Required output not found\"\n\n # every input was sent to the same user (would normally carry a signature from this user; we leave this out for simplicity) [test_user_consistency]\n # On failure: return False, \"User inconsistencies\"\n input_tx_ref = None\n if input_tx_hash in chain.all_transactions:\n input_tx_ref = chain.all_transactions[input_tx_hash]\n else:\n input_tx_ref = tx_in_block[input_tx_hash]\n\n if input_user != None and input_user != input_tx_ref.outputs[input_tx_index].receiver:\n return False, \"User inconsistencies\"\n else:\n input_user = input_tx_ref.outputs[input_tx_index].receiver\n\n # no input_ref has been spent in a previous block on this chain [test_doublespent_input_same_chain]\n # (or in this block; you will have to check this manually) [test_doublespent_input_same_block]\n # (you may find nonempty_intersection and chain.blocks_spending_input helpful here)\n # On failure: return False, \"Double-spent input\"\n if input_tx_hash in input_refs_in_block:\n return False, \"Double-spent input\"\n else:\n input_refs_in_block[input_tx_hash] = input_ref\n\n if input_ref in chain.blocks_spending_input and nonempty_intersection(chain.get_chain_ending_with(self.parent_hash), chain.blocks_spending_input[input_ref]):\n return False, \"Double-spent input\"\n\n # each input_ref points to a transaction on the same blockchain as this block [test_input_txs_on_chain]\n # (or in this block; you will have to check this manually) [test_input_txs_in_block]\n # (you may find chain.blocks_containing_tx.get and nonempty_intersection as above helpful)\n # On failure: return False, \"Input transaction not found\"\n if input_tx_hash not in tx_in_block and nonempty_intersection(chain.get_chain_ending_with(self.parent_hash), chain.blocks_containing_tx.get(input_tx_hash)) == False:\n return False, \"Input transaction not found\"\n input_sum += input_tx_ref.outputs[input_tx_index].amount\n\n # for every output in the tx\n for output in tx.outputs:\n\n # every output was sent from the same user (would normally carry a signature from this user; we leave this out for simplicity)\n # (this MUST be the same user as the outputs are locked to above) [test_user_consistency]\n # On failure: return False, \"User inconsistencies\"\n if output.sender != input_user:\n return False, \"User inconsistencies\"\n output_sum += output.amount\n\n # the sum of the input values is at least the sum of the output values (no money created out of thin air) [test_no_money_creation]\n # On failure: return False, \"Creating money\" \n if output_sum > input_sum:\n return False, \"Creating money\"\n\n return True, \"All checks passed\"","def test_32(self):\n assert 'False' == Api.requestBlock('test-32')","def valid_chain(self, block, prev_block):\n self.stop_mine()\n\n print('\\n //// MINING STOPPED\\n')\n\n print('\\n //// block entering valid_chain')\n pprint(block)\n\n if block is not None and block['message'] != 'mining stopped':\n if block['previous_hash'] == self.hash(prev_block):\n \n # Check that the Proof of Work is correct\n if self.valid_proof(prev_block['proof'], block['proof']):\n if block['index'] == self.last_block['index']:\n if self.last_block['timestamp'] > block['timestamp']:\n del self.chain[-1]\n self.chain.append(block)\n print('\\n //// true from equal index but older timestamp')\n return True\n\n elif self.last_block['timestamp'] == block['timestamp']:\n print('\\n //// true from timestamps are equal block isnt added')\n return True\n else:\n print('\\n //// true timestamp is newer not added but sending false')\n return False\n\n elif block['index'] > self.last_block['index']:\n print('\\n //// true from index is greater and block is added')\n self.chain.append(block)\n return True\n else:\n print('\\n //// false from adding block had index less than block already there')\n else:\n print('\\n //// false from not a valid proof')\n\n else:\n print('\\n //// false from hashes arent equal')\n if (block['timestamp'] < self.last_block['timestamp']):\n if (block['index'] == self.last_block['index']):\n print('\\n //// hashes arent equal but block is older, subtracting and adding')\n del self.chain[-1]\n self.chain.append(block)\n return True\n\n elif (block['timestamp'] > self.last_block['timestamp']):\n if(block['index'] > self.last_block['index']):\n self.chain.append(block)\n return True\n else:\n return True\n\n return False\n\n else:\n return 'reject'","def check(self, description: Description) -> bool:","def is_valid(self):\n return (4 * (self.a ** 3) + 27 * (self.b ** 2)) % self.fp != 0","def validate_acid_block_preview(self, acid_block):\r\n self.assertTrue(acid_block.init_fn_passed)\r\n self.assertTrue(acid_block.resource_url_passed)\r\n self.assertTrue(acid_block.scope_passed('user_state'))\r\n self.assertTrue(acid_block.scope_passed('user_state_summary'))\r\n self.assertTrue(acid_block.scope_passed('preferences'))\r\n self.assertTrue(acid_block.scope_passed('user_info'))","def test_31_if(self):\n\t\tinput = \"\"\"procedure main(); var x:integer; begin x:=foo(); end\n\t\tfunction foo():integer; var a:real; begin\n\t\tif a>0 then return 0;\n\t\tend\"\"\"\n\t\texpect = \"Function foo Not Return\"\n\t\tself.assertTrue(TestChecker.test(input,expect,431))","def test_32_if(self):\n\t\tinput = \"\"\"function foo():integer; var a:real; begin\n\t\twith a:integer;b:real; do begin if a=0 then return 1; else return a; end\n\t\tend\n\t\tprocedure main(); var x:integer; begin x:=foo(); foo(); end\"\"\"\n\t\texpect = \"Undeclared Procedure: foo\"\n\t\tself.assertTrue(TestChecker.test(input,expect,432))","def validate_acid_block_view(self, acid_block):\r\n self.assertTrue(acid_block.init_fn_passed)\r\n self.assertTrue(acid_block.resource_url_passed)\r\n self.assertTrue(acid_block.scope_passed('user_state'))\r\n self.assertTrue(acid_block.scope_passed('user_state_summary'))\r\n self.assertTrue(acid_block.scope_passed('preferences'))\r\n self.assertTrue(acid_block.scope_passed('user_info'))","def valid(self) -> bool:\n pass","def test_30(self):\n assert 'False' == Api.requestBlock('test-30')","def valid_chain(self, chain):\n\n last_block = chain[0]\n current_index = 1\n\n while current_index < len(chain):\n block = chain[current_index]\n print(f'{last_block}')\n print(f'{block}')\n print(\"\\n-----------\\n\")\n # Check that the hash of the block is correct\n last_block_hash = self.hash(last_block)\n if block['previous_hash'] != last_block_hash:\n return False\n\n # Check that the Proof of Work is correct\n if not self.valid_proof(last_block['proof'], block['proof'], last_block_hash):\n return False\n\n last_block = block\n current_index += 1\n\n return True","def is_block(modules):\n if isinstance(modules, (BasicBlock, Bottleneck)):\n return True\n return False","def check_block(block):\n asides = block.runtime.get_asides(block)\n assert len(asides) == 1, f'Found {asides} asides but expected only test_aside'\n assert isinstance(asides[0], AsideTestType)\n category = block.scope_ids.block_type\n assert asides[0].data_field == f'{category} aside data'\n assert asides[0].content == f'{category.capitalize()} Aside'\n\n for child in block.get_children():\n check_block(child)","def is_valid(self):\r\n return self.circuit.is_valid","def test_24(self):\n assert 'False' == Api.requestBlock('test-24')","def test_29(self):\n assert 'True' == Api.requestBlock('test-29')","def valid_chain(self, chain):\n last_block = chain[0]\n current_index = 1\n\n while current_index < len(chain):\n block = chain[current_index]\n\n # Check that the hash of block is correct\n if block['previous_hash'] != self.hash(last_block):\n return False\n\n # Check the Proof of Work\n if not self.valid_proof(last_block['proof'], block['proof']):\n return False\n \n last_block = block\n current_index += 1\n return True","def validate_Eval(result, _dummy_expression):\n return result is not None","def isValid(self):\n return self.file_name != \"\" and self.line_number != 0","def test_39(self):\n assert 'True' == Api.requestBlock('test-39')","async def bot_check(self, ctx):\n blocked = await self.db.fetchrow(\n \"\"\"\n SELECT *\n FROM blocks\n WHERE user_id=$1\n \"\"\",\n ctx.author.id,\n )\n if blocked is None:\n return True\n raise BlackListed","def test_04(self):\n assert 'False' == Api.requestBlock('test-04', charOrder='')","def test_25(self):\n assert 'False' == Api.requestBlock('test-25')","def test_31(self):\n assert 'True' == Api.requestBlock('test-31')","def is_chain_valid(self, chain):\r\n previous_block = chain[0]\r\n block_index = 1\r\n while block_index < len(chain):\r\n block = chain[block_index]\r\n if block['previous_hash'] != self.hash(previous_block):\r\n return False\r\n previous_proof = previous_block['proof']\r\n proof = block['proof']\r\n hash_operation = self.hash(block)\r\n if hash_operation[:4] != '0000':\r\n return False\r\n previous_block = block\r\n block_index += 1\r\n return True","def IsExitBlock(self, node) -> bool:\n return self.nodes[node].get(\"exit\", False)","def test_block_bad_state(self):\n pass","def is_valid(self):\n # check data sets\n for dataset in self.datasets.values():\n # Non-optional datasets must be enabled\n if not dataset.structure.optional and not dataset.enabled:\n return False\n # Enabled blocks must be valid\n if dataset.enabled and not dataset.is_valid:\n return False\n # check variables\n for block_header in self.block_headers:\n for dataset in block_header.data_items:\n # Non-optional datasets must be enabled\n if not dataset.structure.optional and not dataset.enabled:\n return False\n # Enabled blocks must be valid\n if dataset.enabled and not dataset.is_valid():\n return False","def valid(self) -> bool:\n return True","def _check_block_type():\n \n \n maxBlocks = blocks[0]['maxBlocks']\n freeEnd = blocks[0]['freeEnd']\n \n while(blkcounter in xrange(freeEnd + 1, maxBlocks, 1)) :\n if (type(bdata) == dict) :\n # directory, file inodes\n # won't touch the character device file\n if IS_DIR(blocks[blkcounter]['mode']):\n status = _check_dir_type(blocks[blkcounter], blkcounter)\n elif IS_REG(blocks[blkcounter]['mode']) :\n status = _check_reg_type(blocks[blkcounter], blkcounter)\n \n if(status != STATUS['OK']) :\n return status\n \n return STATUS['OK']","def stmt_if(executor, stmt):\n e = Expression()\n result = e.eval(stmt._tokens, symbols=executor._symbols)\n if not result:\n executor.goto_next_line()","def validate(self):\n if not ((self.bpq_kind == self.BPQ_BLOCK_KIND_QUERY) or\n (self.bpq_kind == self.BPQ_BLOCK_KIND_RESPONSE) or\n (self.bpq_kind == self.BPQ_BLOCK_KIND_RESPONSE_DO_NOT_CACHE_FRAG) or\n (self.bpq_kind == self.BPQ_BLOCK_KIND_PUBLISH)):\n return False\n\n if not ((self.matching_rule == self.BPQ_MATCHING_RULE_EXACT) or\n (self.matching_rule == self.BPQ_MATCHING_RULE_TOKENS) or\n (self.matching_rule == self.BPQ_MATCHING_RULE_NEVER)):\n return False\n\n if not (self.src_eid and (len(self.src_eid) == self.src_eid_len)):\n return False\n\n if not (self.bpq_id and (len(self.bpq_id) == self.bpq_id_len)):\n return False\n\n if not (self.bpq_val and (len(self.bpq_val) == self.bpq_val_len)):\n return False\n\n if not (self.frag_cnt == len(self.frag_desc)):\n return False\n\n for d in self.frag_desc:\n if not (d.has_key(\"frag_offset\") and d.has_key(\"frag_len\")):\n return False\n\n return True","def has_inside(block):\n return comma(block[0]) if block else '#N/A'","def _block_matches_all(block_data):\n # do the checks which don't require loading any additional data\n if (\n self._block_matches(block_data, qualifiers) and\n self._block_matches(block_data.fields, settings)\n ):\n if content:\n definition_block = self.get_definition(course_locator, block_data.definition)\n return self._block_matches(definition_block['fields'], content)\n else:\n return True"],"string":"[\n \"def check_block(self, block):\\n pass\",\n \"def is_block(self):\\n return self.v & 1 == 0\",\n \"def test_29_if(self):\\n\\t\\tinput = \\\"\\\"\\\"procedure main(); var x:integer; begin x:=foo(); end\\n\\t\\tfunction foo():integer; var a:real; begin\\n\\t\\twith a:integer;b:real; do begin if a>0 then return 1; else b:=0; end\\n\\t\\tend\\\"\\\"\\\"\\n\\t\\texpect = \\\"Function foo Not Return\\\"\\n\\t\\tself.assertTrue(TestChecker.test(input,expect,429))\",\n \"def is_block(self):\\n\\t\\treturn self.name in get_elements_collection(self.__res, 'block_level')\",\n \"def is_valid_block(self, first):\\n return (self.a_cursor > first.a and\\n self.b_cursor > first.b)\",\n \"def test_30_if(self):\\n\\t\\tinput = \\\"\\\"\\\"procedure main(); var x:integer; begin x:=foo(); end\\n\\t\\tfunction foo():integer; var a:real; begin\\n\\t\\twith a:integer;b:real; do begin if a>0 then a:=1; else return 0; end\\n\\t\\tend\\\"\\\"\\\"\\n\\t\\texpect = \\\"Function foo Not Return\\\"\\n\\t\\tself.assertTrue(TestChecker.test(input,expect,430))\",\n \"def verify(condition):\\n global _is_in_verify_within\\n if not condition:\\n calling_frame = inspect.currentframe().f_back\\n error_message = 'verify() failed at line {} in \\\"{}\\\"'.format(calling_frame.f_lineno,\\n calling_frame.f_code.co_filename)\\n if not _is_in_verify_within:\\n print error_message\\n return False\\n return True\",\n \"def is_valid_proof(self, block, block_hash): \\n return (block_hash.startswith('0' * Blockchain.difficulty) and block_hash == compute_hash())\",\n \"def _inblock(row, column, init, end):\\n return all([row[column][0] >= init[0],\\n row[column][1] >= init[1],\\n row[column][0] <= end[0],\\n row[column][1] <= end[1]])\",\n \"def test_28_if(self):\\n\\t\\tinput = \\\"\\\"\\\"procedure main(); var x:integer; begin x:=foo(); end\\n\\t\\tfunction foo():integer; var a:real; begin\\n\\t\\twith a:integer;b:real; do begin if a>0 then return; else return 0; end\\n\\t\\tend\\\"\\\"\\\"\\n\\t\\texpect = \\\"Type Mismatch In Statement: Return(None)\\\"\\n\\t\\tself.assertTrue(TestChecker.test(input,expect,428))\",\n \"def check_if(self, token: tokenize.TokenInfo) -> bool:\\n if self._seen_for:\\n self._seen_if_in_line = True\\n\\n self._potential_violation = (\\n self._potential_violation or\\n self.seen_clause_in_line\\n )\\n return self._check_violation(token)\\n return True\",\n \"def test_27_if(self):\\n\\t\\tinput = \\\"\\\"\\\"procedure main(); var x:integer; begin x:=foo(); end\\n\\t\\tfunction foo():integer; var a:real; begin\\n\\t\\twith a:integer;b:real; do begin if a>0 then a:=0; else b:=0; end\\n\\t\\tend\\\"\\\"\\\"\\n\\t\\texpect = \\\"Function foo Not Return\\\"\\n\\t\\tself.assertTrue(TestChecker.test(input,expect,427))\",\n \"def is_valid(self):\\n # Check blocks\\n for block in self.blocks.values():\\n # Non-optional blocks must be enabled\\n if (\\n block.structure.number_non_optional_data() > 0\\n and not block.enabled\\n and block.is_allowed()\\n ):\\n self.last_error = (\\n f'Required block \\\"{block.block_header.name}\\\" not enabled'\\n )\\n return False\\n # Enabled blocks must be valid\\n if block.enabled and not block.is_valid:\\n self.last_error = f'Invalid block \\\"{block.block_header.name}\\\"'\\n return False\\n\\n return True\",\n \"def isValid(self):\\n currBlock = self.getBlock(self.tailBlockHash)\\n while currBlock != self.genesisBlock:\\n if not self.isValidBlock(currBlock):\\n return False\\n currBlock = self.getBlock(currBlock.prevHash)\\n return True\",\n \"def chainIsValid(self):\\n for i in range(1, len(self.blocks)):\\n prev_block = self.blocks[i-1]\\n cur_block = self.blocks[i]\\n if cur_block.header['prevBlockH'] != getHashBlock(prev_block):\\n return False\\n return True\",\n \"def is_block(self) -> bool:\\n return self.answer == \\\".\\\"\",\n \"def isValidBlock(self, block, unSpentTransactions):\\n\\n prevBlock = self.getBlock(self.tailBlockHash)\\n if prevBlock.index+1 != block.index:\\n return False\\n elif prevBlock.currHash != block.prevHash:\\n return False\\n elif block.calculateHash() != block.currHash:\\n return False\\n return block.isValid(unSpentTransactions)\",\n \"def valid_proof(block):\\n return Blockchain.hash(block) [:4] == \\\"0000\\\"\",\n \"def check():\",\n \"def isValid(self) :\\n try :\\n pos = 0\\n while self.firstblock[pos] == chr(0) :\\n pos += 1\\n except IndexError : \\n return False\\n else : \\n firstblock = self.firstblock[pos:]\\n if firstblock.startswith(\\\"\\\\033E\\\\033\\\") or \\\\\\n firstblock.startswith(\\\"\\\\033%1BBPIN;\\\") or \\\\\\n ((pos == 11000) and firstblock.startswith(\\\"\\\\033\\\")) or \\\\\\n (firstblock.startswith(\\\"\\\\033*rbC\\\") and (not self.lastblock[-3:] == \\\"\\\\f\\\\033@\\\")) or \\\\\\n firstblock.startswith(\\\"\\\\033*rB\\\\033\\\") or \\\\\\n firstblock.startswith(\\\"\\\\033%8\\\\033\\\") or \\\\\\n (firstblock.find(\\\"\\\\033%-12345X\\\") != -1) or \\\\\\n (firstblock.find(\\\"@PJL ENTER LANGUAGE=PCL\\\\012\\\\015\\\\033\\\") != -1) or \\\\\\n (firstblock.startswith(chr(0xcd)+chr(0xca)) and (firstblock.find(\\\"\\\\033E\\\\033\\\") != -1)) :\\n return True\\n else : \\n return False\",\n \"def validateBlock(self, currentBlock, previousBlock): \\n \\n # Check the block index\\n if currentBlock.index != previousBlock.index + 1:\\n return False\\n if currentBlock.previousHash != previousBlock.hash:\\n return False\\n if currentBlock.hash != currentBlock.hashBlock():\\n return False\\n if not self.validateNonce(previousBlock.nonce, previousBlock.hash, currentBlock.nonce):\\n return False\\n return True\",\n \"def check(self): # full program\\n r = re.compile('(?!(^(((?!;)[A-Z][+-]?\\\\d+(\\\\.\\\\d+)?\\\\s?)*(\\\\s*;\\\\s.*)?)$))')\\n for line in self.blocks:\\n if r.match(line) and line and line != '\\\\r' and line != '\\\\n':\\n return False\\n return True\",\n \"def test_34(self):\\n assert 'False' == Api.requestBlock('test-34')\",\n \"def is_valid_proof(self, block, block_hash):\\r\\n return (block_hash.startswith('0' * Blockchain.difficulty) and\\r\\n block_hash == block.compute_hash())\",\n \"def find_block_to_run(blk):\\n _top = find_top_block(blk)\\n if blk == _top and blk.name[0:3] is not 'def':\\n return True\\n else:\\n return False\",\n \"def is_valid_proof(cls, block, block_hash):\\n return (cls.ifsatisfy_diff(block_hash) and block_hash == block.compute_hash())\",\n \"def test_13(self):\\n assert 'False' == Api.requestBlock('test-13')\",\n \"def test_03(self):\\n assert 'False' == Api.requestBlock('test-03')\",\n \"def test_37(self):\\n assert 'False' == Api.requestBlock('test-37')\",\n \"def test_27(self):\\n assert 'False' == Api.requestBlock('test-27')\",\n \"def is_valid_proof(cls, block, block_hash):\\n return (block_hash.startswith('0' * Blockchain.difficulty) and\\n block_hash == block.compute_hash())\",\n \"def is_valid_proof(cls, block, block_hash):\\n return (block_hash.startswith('0' * Blockchain.difficulty) and\\n block_hash == block.compute_hash())\",\n \"def test_41(self):\\n assert 'False' == Api.requestBlock('test-41')\",\n \"def test_28(self):\\n assert 'False' == Api.requestBlock('test-28')\",\n \"def test_35(self):\\n assert 'False' == Api.requestBlock('test-35')\",\n \"def test_33(self):\\n assert 'False' == Api.requestBlock('test-33')\",\n \"def test_26(self):\\n assert 'False' == Api.requestBlock('test-26')\",\n \"def condition_forward_checking(csp, var) :\\n return False\",\n \"def condition_forward_checking(csp, var) :\\n return False\",\n \"def test_46(self):\\n assert 'False' == Api.requestBlock('test-46')\",\n \"def test_43(self):\\n assert 'False' == Api.requestBlock('test-43')\",\n \"def test_11(self):\\n assert 'False' == Api.requestBlock('test-11')\",\n \"def check_for(self, token: tokenize.TokenInfo) -> bool:\\n self._is_comprehension = True\\n self._seen_for = True\\n self._seen_for_in_line = True\\n\\n self._potential_violation = (\\n self._potential_violation or\\n self.seen_clause_in_line\\n )\\n return self._check_violation(token)\",\n \"def test_14(self):\\n assert 'False' == Api.requestBlock('test-14')\",\n \"def test_44(self):\\n assert 'False' == Api.requestBlock('test-44')\",\n \"def test_23(self):\\n assert 'False' == Api.requestBlock('test-23')\",\n \"def test_09(self):\\n assert 'False' == Api.requestBlock('test-09')\",\n \"def test(self, parent, block):\\n\\n self.match = self.pattern.match(block) if self.pattern is not None else None\\n return self.match is not None\",\n \"def test_02(self):\\n assert 'False' == Api.requestBlock('test-02')\",\n \"def _check_free_block():\\n \\n # populate the block data fields\\n status = _prepare_blocks()\\n if(status != STATUS['OK']) :\\n # some metadata file reading error\\n return status\\n \\n # find which blocks are already consumed, \\n # per the block level metadata\\n _prepare_consumed_block()\\n \\n \\n # TODO : remove debug statements\\n # print consumedBlocks\\n \\n freeStart = blocks[0]['freeStart']\\n freeEnd = blocks[0]['freeEnd']\\n blknum = 0\\n for fblkcnt in xrange(freeStart, freeEnd + 1, 1) :\\n for fblk in blocks[fblkcnt] :\\n # if free block is zero, then, it should not be in consumed blocks\\n # else it definitely should be\\n print fblkcnt, \\\" - \\\", fblk, \\\" - \\\", blknum\\n if (fblk == 0 and (blknum in consumedBlocks)):\\n # free blocks says it's free, but consumed block says it's not\\n return STATUS['F_NFB']\\n elif(fblk == 1 and not(blknum in consumedBlocks)) : \\n # free block says it's not free, but consumed block says it is\\n return STATUS['F_MFB']\\n \\n blknum += 1\\n # consistency all ok\\n return STATUS['OK']\",\n \"def _check_multiline_conditions(self, node: ast.If) -> None:\\n start_lineno = getattr(node, 'lineno', None)\\n for sub_nodes in ast.walk(node.test):\\n sub_lineno = getattr(sub_nodes, 'lineno', None)\\n if sub_lineno is not None and sub_lineno > start_lineno:\\n self.add_violation(MultilineConditionsViolation(node))\\n break\",\n \"def check(self):\\n return True\",\n \"def test_52(self):\\n assert 'False' == Api.requestBlock('test-52')\",\n \"def valid_chain(self, chain):\\n last_block = chain[0]\\n current_index = 1\\n\\n while current_index < len(chain):\\n block = chain[current_index]\\n # print(f'{last_block}')\\n # print(f'{block}')\\n # print(\\\"\\\\n-----------\\\\n\\\")\\n # Check that the hash of the block is correct\\n last_block_hash = self.hash(last_block)\\n if block['previous_hash'] != self.hash(last_block):\\n return False\\n\\n # Check that the Proof of Work is correct\\n if not self.valid_proof(last_block['proof'], block['proof'], last_block_hash):\\n return False\\n\\n last_block = block\\n current_index += 1\\n\\n return True\",\n \"def test_12(self):\\n assert 'False' == Api.requestBlock('test-12')\",\n \"def test_36(self):\\n assert 'False' == Api.requestBlock('test-36')\",\n \"def is_valid_block(last_block, block):\\n if block.last_hash != last_block.hash:\\n raise Exception('Incorrect last_hash')\\n if hex_to_binary(block.hash)[0:block.difficulty] != '0' * block.difficulty:\\n raise Exception('Proof of Work not fulfilled')\\n if abs(block.difficulty - last_block.difficulty) > 1:\\n raise Exception('Block difficulty must only adjust by 1')\\n\\n reconstructed_hash = crypto_hash(\\n block.timestamp,\\n block.last_hash,\\n block.data,\\n block.nonce,\\n block.difficulty\\n )\\n\\n if block.hash != reconstructed_hash:\\n raise Exception('Incorrect Block hash')\",\n \"def condition(self):\\n return True\",\n \"def test_40(self):\\n assert 'False' == Api.requestBlock('test-40')\",\n \"def _if(self):\\n debug.show(\\\"if:Stack = \\\" + str(self.opStack))\\n if self.opStack.size() >= 2:\\n ifcode = isCode(self.opStack.pop()) # Make sure it is code (a list)\\n if check.isBool(self.opStack.pop()):\\n debug.show(\\\"if:True\\\")\\n evaluate(ifcode)\\n else:\\n debug.err(\\\"not enough items on the stack\\\")\\n debug.show(\\\"if:False\\\")\\n return None\",\n \"def is_block_complete(self, n):\\n\\n return self._complete(self._block(n))\",\n \"def test_15(self):\\n assert 'False' == Api.requestBlock('test-15')\",\n \"def test_16(self):\\n assert 'False' == Api.requestBlock('test-16')\",\n \"def check_ok (result):\\n return not result is None and (not \\\"due to errors\\\" in result)\",\n \"def test_21(self):\\n assert 'False' == Api.requestBlock('test-21')\",\n \"def test_06(self):\\n assert 'False' == Api.requestBlock('test-06', charOrder=51)\",\n \"def is_valid(self):\\n\\n chain = blockchain.chain # This object of type Blockchain may be useful\\n\\n # Placeholder for (1a)\\n\\n # (checks that apply to all blocks)\\n # Check that Merkle root calculation is consistent with transactions in block (use the calculate_merkle_root function) [test_rejects_invalid_merkle]\\n # On failure: return False, \\\"Merkle root failed to match\\\"\\n if self.merkle != self.calculate_merkle_root():\\n return False, \\\"Merkle root failed to match\\\"\\n\\n # Check that block.hash is correctly calculated [test_rejects_invalid_hash]\\n # On failure: return False, \\\"Hash failed to match\\\"\\n if self.hash != self.calculate_hash():\\n return False, \\\"Hash failed to match\\\"\\n\\n # Check that there are at most 900 transactions in the block [test_rejects_too_many_txs]\\n # On failure: return False, \\\"Too many transactions\\\"\\n if len(self.transactions) > 900:\\n return False, \\\"Too many transactions\\\"\\n\\n # (checks that apply to genesis block)\\n if self.is_genesis:\\n # Check that height is 0 and parent_hash is \\\"genesis\\\" [test_invalid_genesis]\\n # On failure: return False, \\\"Invalid genesis\\\"\\n if self.height != 0 or self.parent_hash != \\\"genesis\\\":\\n return False, \\\"Invalid genesis\\\"\\n\\n # (checks that apply only to non-genesis blocks)\\n else:\\n # Check that parent exists (you may find chain.blocks helpful) [test_nonexistent_parent]\\n # On failure: return False, \\\"Nonexistent parent\\\"\\n if self.parent_hash not in chain.blocks:\\n return False, \\\"Nonexistent parent\\\"\\n\\n # Check that height is correct w.r.t. parent height [test_bad_height]\\n # On failure: return False, \\\"Invalid height\\\"\\n if self.height != chain.blocks[self.parent_hash].height + 1:\\n return False, \\\"Invalid height\\\"\\n\\n # Check that timestamp is non-decreasing [test_bad_timestamp]\\n # On failure: return False, \\\"Invalid timestamp\\\"\\n if self.timestamp < chain.blocks[self.parent_hash].timestamp:\\n return False, \\\"Invalid timestamp\\\"\\n\\n # Check that seal is correctly computed and satisfies \\\"target\\\" requirements; use the provided seal_is_valid method [test_bad_seal]\\n # On failure: return False, \\\"Invalid seal\\\"\\n if self.seal_is_valid() == False:\\n return False, \\\"Invalid seal\\\"\\n\\n # Check that all transactions within are valid (use tx.is_valid) [test_malformed_txs]\\n # On failure: return False, \\\"Malformed transaction included\\\"\\n for tx in self.transactions:\\n if tx.is_valid() == False:\\n return False, \\\"Malformed transaction included\\\"\\n\\n # Check that for every transaction\\n tx_in_block = {}\\n input_refs_in_block = {}\\n for tx in self.transactions:\\n # the transaction has not already been included on a block on the same blockchain as this block [test_double_tx_inclusion_same_chain]\\n # (or twice in this block; you will have to check this manually) [test_double_tx_inclusion_same_block]\\n # (you may find chain.get_chain_ending_with and chain.blocks_containing_tx and util.nonempty_intersection useful)\\n # On failure: return False, \\\"Double transaction inclusion\\\"\\n if nonempty_intersection(chain.get_chain_ending_with(self.parent_hash), chain.blocks_containing_tx.get(tx.hash, [])):\\n return False, \\\"Double transaction inclusion\\\"\\n\\n # If the two same transactions in this block\\n if tx.hash in tx_in_block:\\n return False, \\\"Double transaction inclusion\\\"\\n else:\\n # If not, add to the dict.\\n tx_in_block[tx.hash] = tx\\n\\n # for every input ref in the tx\\n input_user = None\\n output_sum=0\\n input_sum = 0\\n for input_ref in tx.input_refs:\\n\\n # (you may find the string split method for parsing the input into its components)\\n input_tx = input_ref.split(\\\":\\\")\\n input_tx_hash = input_tx[0]\\n input_tx_index = int(input_tx[1])\\n\\n # each input_ref is valid (aka corresponding transaction can be looked up in its holding transaction) [test_failed_input_lookup]\\n # (you may find chain.all_transactions useful here)\\n # On failure: return False, \\\"Required output not found\\\"\\n if (input_tx_hash not in chain.all_transactions or input_tx_index >= len(chain.all_transactions[input_tx_hash].outputs)) and input_tx_hash not in tx_in_block:\\n return False, \\\"Required output not found\\\"\\n\\n # every input was sent to the same user (would normally carry a signature from this user; we leave this out for simplicity) [test_user_consistency]\\n # On failure: return False, \\\"User inconsistencies\\\"\\n input_tx_ref = None\\n if input_tx_hash in chain.all_transactions:\\n input_tx_ref = chain.all_transactions[input_tx_hash]\\n else:\\n input_tx_ref = tx_in_block[input_tx_hash]\\n\\n if input_user != None and input_user != input_tx_ref.outputs[input_tx_index].receiver:\\n return False, \\\"User inconsistencies\\\"\\n else:\\n input_user = input_tx_ref.outputs[input_tx_index].receiver\\n\\n # no input_ref has been spent in a previous block on this chain [test_doublespent_input_same_chain]\\n # (or in this block; you will have to check this manually) [test_doublespent_input_same_block]\\n # (you may find nonempty_intersection and chain.blocks_spending_input helpful here)\\n # On failure: return False, \\\"Double-spent input\\\"\\n if input_tx_hash in input_refs_in_block:\\n return False, \\\"Double-spent input\\\"\\n else:\\n input_refs_in_block[input_tx_hash] = input_ref\\n\\n if input_ref in chain.blocks_spending_input and nonempty_intersection(chain.get_chain_ending_with(self.parent_hash), chain.blocks_spending_input[input_ref]):\\n return False, \\\"Double-spent input\\\"\\n\\n # each input_ref points to a transaction on the same blockchain as this block [test_input_txs_on_chain]\\n # (or in this block; you will have to check this manually) [test_input_txs_in_block]\\n # (you may find chain.blocks_containing_tx.get and nonempty_intersection as above helpful)\\n # On failure: return False, \\\"Input transaction not found\\\"\\n if input_tx_hash not in tx_in_block and nonempty_intersection(chain.get_chain_ending_with(self.parent_hash), chain.blocks_containing_tx.get(input_tx_hash)) == False:\\n return False, \\\"Input transaction not found\\\"\\n input_sum += input_tx_ref.outputs[input_tx_index].amount\\n\\n # for every output in the tx\\n for output in tx.outputs:\\n\\n # every output was sent from the same user (would normally carry a signature from this user; we leave this out for simplicity)\\n # (this MUST be the same user as the outputs are locked to above) [test_user_consistency]\\n # On failure: return False, \\\"User inconsistencies\\\"\\n if output.sender != input_user:\\n return False, \\\"User inconsistencies\\\"\\n output_sum += output.amount\\n\\n # the sum of the input values is at least the sum of the output values (no money created out of thin air) [test_no_money_creation]\\n # On failure: return False, \\\"Creating money\\\" \\n if output_sum > input_sum:\\n return False, \\\"Creating money\\\"\\n\\n return True, \\\"All checks passed\\\"\",\n \"def test_32(self):\\n assert 'False' == Api.requestBlock('test-32')\",\n \"def valid_chain(self, block, prev_block):\\n self.stop_mine()\\n\\n print('\\\\n //// MINING STOPPED\\\\n')\\n\\n print('\\\\n //// block entering valid_chain')\\n pprint(block)\\n\\n if block is not None and block['message'] != 'mining stopped':\\n if block['previous_hash'] == self.hash(prev_block):\\n \\n # Check that the Proof of Work is correct\\n if self.valid_proof(prev_block['proof'], block['proof']):\\n if block['index'] == self.last_block['index']:\\n if self.last_block['timestamp'] > block['timestamp']:\\n del self.chain[-1]\\n self.chain.append(block)\\n print('\\\\n //// true from equal index but older timestamp')\\n return True\\n\\n elif self.last_block['timestamp'] == block['timestamp']:\\n print('\\\\n //// true from timestamps are equal block isnt added')\\n return True\\n else:\\n print('\\\\n //// true timestamp is newer not added but sending false')\\n return False\\n\\n elif block['index'] > self.last_block['index']:\\n print('\\\\n //// true from index is greater and block is added')\\n self.chain.append(block)\\n return True\\n else:\\n print('\\\\n //// false from adding block had index less than block already there')\\n else:\\n print('\\\\n //// false from not a valid proof')\\n\\n else:\\n print('\\\\n //// false from hashes arent equal')\\n if (block['timestamp'] < self.last_block['timestamp']):\\n if (block['index'] == self.last_block['index']):\\n print('\\\\n //// hashes arent equal but block is older, subtracting and adding')\\n del self.chain[-1]\\n self.chain.append(block)\\n return True\\n\\n elif (block['timestamp'] > self.last_block['timestamp']):\\n if(block['index'] > self.last_block['index']):\\n self.chain.append(block)\\n return True\\n else:\\n return True\\n\\n return False\\n\\n else:\\n return 'reject'\",\n \"def check(self, description: Description) -> bool:\",\n \"def is_valid(self):\\n return (4 * (self.a ** 3) + 27 * (self.b ** 2)) % self.fp != 0\",\n \"def validate_acid_block_preview(self, acid_block):\\r\\n self.assertTrue(acid_block.init_fn_passed)\\r\\n self.assertTrue(acid_block.resource_url_passed)\\r\\n self.assertTrue(acid_block.scope_passed('user_state'))\\r\\n self.assertTrue(acid_block.scope_passed('user_state_summary'))\\r\\n self.assertTrue(acid_block.scope_passed('preferences'))\\r\\n self.assertTrue(acid_block.scope_passed('user_info'))\",\n \"def test_31_if(self):\\n\\t\\tinput = \\\"\\\"\\\"procedure main(); var x:integer; begin x:=foo(); end\\n\\t\\tfunction foo():integer; var a:real; begin\\n\\t\\tif a>0 then return 0;\\n\\t\\tend\\\"\\\"\\\"\\n\\t\\texpect = \\\"Function foo Not Return\\\"\\n\\t\\tself.assertTrue(TestChecker.test(input,expect,431))\",\n \"def test_32_if(self):\\n\\t\\tinput = \\\"\\\"\\\"function foo():integer; var a:real; begin\\n\\t\\twith a:integer;b:real; do begin if a=0 then return 1; else return a; end\\n\\t\\tend\\n\\t\\tprocedure main(); var x:integer; begin x:=foo(); foo(); end\\\"\\\"\\\"\\n\\t\\texpect = \\\"Undeclared Procedure: foo\\\"\\n\\t\\tself.assertTrue(TestChecker.test(input,expect,432))\",\n \"def validate_acid_block_view(self, acid_block):\\r\\n self.assertTrue(acid_block.init_fn_passed)\\r\\n self.assertTrue(acid_block.resource_url_passed)\\r\\n self.assertTrue(acid_block.scope_passed('user_state'))\\r\\n self.assertTrue(acid_block.scope_passed('user_state_summary'))\\r\\n self.assertTrue(acid_block.scope_passed('preferences'))\\r\\n self.assertTrue(acid_block.scope_passed('user_info'))\",\n \"def valid(self) -> bool:\\n pass\",\n \"def test_30(self):\\n assert 'False' == Api.requestBlock('test-30')\",\n \"def valid_chain(self, chain):\\n\\n last_block = chain[0]\\n current_index = 1\\n\\n while current_index < len(chain):\\n block = chain[current_index]\\n print(f'{last_block}')\\n print(f'{block}')\\n print(\\\"\\\\n-----------\\\\n\\\")\\n # Check that the hash of the block is correct\\n last_block_hash = self.hash(last_block)\\n if block['previous_hash'] != last_block_hash:\\n return False\\n\\n # Check that the Proof of Work is correct\\n if not self.valid_proof(last_block['proof'], block['proof'], last_block_hash):\\n return False\\n\\n last_block = block\\n current_index += 1\\n\\n return True\",\n \"def is_block(modules):\\n if isinstance(modules, (BasicBlock, Bottleneck)):\\n return True\\n return False\",\n \"def check_block(block):\\n asides = block.runtime.get_asides(block)\\n assert len(asides) == 1, f'Found {asides} asides but expected only test_aside'\\n assert isinstance(asides[0], AsideTestType)\\n category = block.scope_ids.block_type\\n assert asides[0].data_field == f'{category} aside data'\\n assert asides[0].content == f'{category.capitalize()} Aside'\\n\\n for child in block.get_children():\\n check_block(child)\",\n \"def is_valid(self):\\r\\n return self.circuit.is_valid\",\n \"def test_24(self):\\n assert 'False' == Api.requestBlock('test-24')\",\n \"def test_29(self):\\n assert 'True' == Api.requestBlock('test-29')\",\n \"def valid_chain(self, chain):\\n last_block = chain[0]\\n current_index = 1\\n\\n while current_index < len(chain):\\n block = chain[current_index]\\n\\n # Check that the hash of block is correct\\n if block['previous_hash'] != self.hash(last_block):\\n return False\\n\\n # Check the Proof of Work\\n if not self.valid_proof(last_block['proof'], block['proof']):\\n return False\\n \\n last_block = block\\n current_index += 1\\n return True\",\n \"def validate_Eval(result, _dummy_expression):\\n return result is not None\",\n \"def isValid(self):\\n return self.file_name != \\\"\\\" and self.line_number != 0\",\n \"def test_39(self):\\n assert 'True' == Api.requestBlock('test-39')\",\n \"async def bot_check(self, ctx):\\n blocked = await self.db.fetchrow(\\n \\\"\\\"\\\"\\n SELECT *\\n FROM blocks\\n WHERE user_id=$1\\n \\\"\\\"\\\",\\n ctx.author.id,\\n )\\n if blocked is None:\\n return True\\n raise BlackListed\",\n \"def test_04(self):\\n assert 'False' == Api.requestBlock('test-04', charOrder='')\",\n \"def test_25(self):\\n assert 'False' == Api.requestBlock('test-25')\",\n \"def test_31(self):\\n assert 'True' == Api.requestBlock('test-31')\",\n \"def is_chain_valid(self, chain):\\r\\n previous_block = chain[0]\\r\\n block_index = 1\\r\\n while block_index < len(chain):\\r\\n block = chain[block_index]\\r\\n if block['previous_hash'] != self.hash(previous_block):\\r\\n return False\\r\\n previous_proof = previous_block['proof']\\r\\n proof = block['proof']\\r\\n hash_operation = self.hash(block)\\r\\n if hash_operation[:4] != '0000':\\r\\n return False\\r\\n previous_block = block\\r\\n block_index += 1\\r\\n return True\",\n \"def IsExitBlock(self, node) -> bool:\\n return self.nodes[node].get(\\\"exit\\\", False)\",\n \"def test_block_bad_state(self):\\n pass\",\n \"def is_valid(self):\\n # check data sets\\n for dataset in self.datasets.values():\\n # Non-optional datasets must be enabled\\n if not dataset.structure.optional and not dataset.enabled:\\n return False\\n # Enabled blocks must be valid\\n if dataset.enabled and not dataset.is_valid:\\n return False\\n # check variables\\n for block_header in self.block_headers:\\n for dataset in block_header.data_items:\\n # Non-optional datasets must be enabled\\n if not dataset.structure.optional and not dataset.enabled:\\n return False\\n # Enabled blocks must be valid\\n if dataset.enabled and not dataset.is_valid():\\n return False\",\n \"def valid(self) -> bool:\\n return True\",\n \"def _check_block_type():\\n \\n \\n maxBlocks = blocks[0]['maxBlocks']\\n freeEnd = blocks[0]['freeEnd']\\n \\n while(blkcounter in xrange(freeEnd + 1, maxBlocks, 1)) :\\n if (type(bdata) == dict) :\\n # directory, file inodes\\n # won't touch the character device file\\n if IS_DIR(blocks[blkcounter]['mode']):\\n status = _check_dir_type(blocks[blkcounter], blkcounter)\\n elif IS_REG(blocks[blkcounter]['mode']) :\\n status = _check_reg_type(blocks[blkcounter], blkcounter)\\n \\n if(status != STATUS['OK']) :\\n return status\\n \\n return STATUS['OK']\",\n \"def stmt_if(executor, stmt):\\n e = Expression()\\n result = e.eval(stmt._tokens, symbols=executor._symbols)\\n if not result:\\n executor.goto_next_line()\",\n \"def validate(self):\\n if not ((self.bpq_kind == self.BPQ_BLOCK_KIND_QUERY) or\\n (self.bpq_kind == self.BPQ_BLOCK_KIND_RESPONSE) or\\n (self.bpq_kind == self.BPQ_BLOCK_KIND_RESPONSE_DO_NOT_CACHE_FRAG) or\\n (self.bpq_kind == self.BPQ_BLOCK_KIND_PUBLISH)):\\n return False\\n\\n if not ((self.matching_rule == self.BPQ_MATCHING_RULE_EXACT) or\\n (self.matching_rule == self.BPQ_MATCHING_RULE_TOKENS) or\\n (self.matching_rule == self.BPQ_MATCHING_RULE_NEVER)):\\n return False\\n\\n if not (self.src_eid and (len(self.src_eid) == self.src_eid_len)):\\n return False\\n\\n if not (self.bpq_id and (len(self.bpq_id) == self.bpq_id_len)):\\n return False\\n\\n if not (self.bpq_val and (len(self.bpq_val) == self.bpq_val_len)):\\n return False\\n\\n if not (self.frag_cnt == len(self.frag_desc)):\\n return False\\n\\n for d in self.frag_desc:\\n if not (d.has_key(\\\"frag_offset\\\") and d.has_key(\\\"frag_len\\\")):\\n return False\\n\\n return True\",\n \"def has_inside(block):\\n return comma(block[0]) if block else '#N/A'\",\n \"def _block_matches_all(block_data):\\n # do the checks which don't require loading any additional data\\n if (\\n self._block_matches(block_data, qualifiers) and\\n self._block_matches(block_data.fields, settings)\\n ):\\n if content:\\n definition_block = self.get_definition(course_locator, block_data.definition)\\n return self._block_matches(definition_block['fields'], content)\\n else:\\n return True\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.78990954","0.6600305","0.63182026","0.63088113","0.63049823","0.6304188","0.6274338","0.62668514","0.6249396","0.62368685","0.62282825","0.6225797","0.62173724","0.6185306","0.6149648","0.61086375","0.6089408","0.60828173","0.6078198","0.6062693","0.6043321","0.60343885","0.5967337","0.59645027","0.5955123","0.59518284","0.59311426","0.5916689","0.5912164","0.58929396","0.5882824","0.5882824","0.5871161","0.58512884","0.58493227","0.5848021","0.5842264","0.583868","0.583868","0.58327144","0.5829176","0.582594","0.581562","0.5813151","0.58077043","0.5804267","0.5801222","0.57993305","0.57844186","0.57764685","0.57460517","0.5739442","0.5735214","0.57292086","0.5720529","0.57178277","0.5716183","0.57142234","0.570992","0.57088375","0.5708802","0.5708587","0.57078856","0.5702561","0.5693498","0.56914824","0.56783473","0.5677271","0.5671606","0.5670828","0.56707805","0.56642354","0.5652061","0.56366694","0.56344867","0.5629829","0.562574","0.5608291","0.5606486","0.5605819","0.5593206","0.55915743","0.5591535","0.55838174","0.55758756","0.5575086","0.55712414","0.55660677","0.5558777","0.55572456","0.5556086","0.555555","0.555208","0.5551141","0.55500144","0.5548138","0.55429196","0.55333894","0.5527913","0.55248636","0.5522113"],"string":"[\n \"0.78990954\",\n \"0.6600305\",\n \"0.63182026\",\n \"0.63088113\",\n \"0.63049823\",\n \"0.6304188\",\n \"0.6274338\",\n \"0.62668514\",\n \"0.6249396\",\n \"0.62368685\",\n \"0.62282825\",\n \"0.6225797\",\n \"0.62173724\",\n \"0.6185306\",\n \"0.6149648\",\n \"0.61086375\",\n \"0.6089408\",\n \"0.60828173\",\n \"0.6078198\",\n \"0.6062693\",\n \"0.6043321\",\n \"0.60343885\",\n \"0.5967337\",\n \"0.59645027\",\n \"0.5955123\",\n \"0.59518284\",\n \"0.59311426\",\n \"0.5916689\",\n \"0.5912164\",\n \"0.58929396\",\n \"0.5882824\",\n \"0.5882824\",\n \"0.5871161\",\n \"0.58512884\",\n \"0.58493227\",\n \"0.5848021\",\n \"0.5842264\",\n \"0.583868\",\n \"0.583868\",\n \"0.58327144\",\n \"0.5829176\",\n \"0.582594\",\n \"0.581562\",\n \"0.5813151\",\n \"0.58077043\",\n \"0.5804267\",\n \"0.5801222\",\n \"0.57993305\",\n \"0.57844186\",\n \"0.57764685\",\n \"0.57460517\",\n \"0.5739442\",\n \"0.5735214\",\n \"0.57292086\",\n \"0.5720529\",\n \"0.57178277\",\n \"0.5716183\",\n \"0.57142234\",\n \"0.570992\",\n \"0.57088375\",\n \"0.5708802\",\n \"0.5708587\",\n \"0.57078856\",\n \"0.5702561\",\n \"0.5693498\",\n \"0.56914824\",\n \"0.56783473\",\n \"0.5677271\",\n \"0.5671606\",\n \"0.5670828\",\n \"0.56707805\",\n \"0.56642354\",\n \"0.5652061\",\n \"0.56366694\",\n \"0.56344867\",\n \"0.5629829\",\n \"0.562574\",\n \"0.5608291\",\n \"0.5606486\",\n \"0.5605819\",\n \"0.5593206\",\n \"0.55915743\",\n \"0.5591535\",\n \"0.55838174\",\n \"0.55758756\",\n \"0.5575086\",\n \"0.55712414\",\n \"0.55660677\",\n \"0.5558777\",\n \"0.55572456\",\n \"0.5556086\",\n \"0.555555\",\n \"0.555208\",\n \"0.5551141\",\n \"0.55500144\",\n \"0.5548138\",\n \"0.55429196\",\n \"0.55333894\",\n \"0.5527913\",\n \"0.55248636\",\n \"0.5522113\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94780,"cells":{"query":{"kind":"string","value":"render the block and return the output."},"document":{"kind":"string","value":"def render(self, get_params, module, _if=None):\n enough = False\n output = []\n valid = None\n\n if self.commands.show:\n valid = True\n if self.parent and self.commands.soft and _if is None:\n return None, self\n if _if:\n valid = True\n elif self.commands._if:\n valid = self.check_valid(get_params)\n if valid is not False:\n for item in self.content:\n if isinstance(item, Placeholder):\n sub_valid, sub_output, enough = item.get(get_params, self)\n output.append(sub_output)\n elif isinstance(item, Literal):\n sub_valid = None\n enough = True\n output.append(item.text)\n elif isinstance(item, Block):\n sub_valid, sub_output = item.render(get_params, module)\n if sub_valid is None:\n output.append(sub_output)\n else:\n output.extend(sub_output)\n valid = valid or sub_valid\n if not valid:\n if self.next_block:\n valid, output = self.next_block.render(get_params, module, _if=self.commands._if)\n elif self.parent is None and ((not self.next_block and enough) or self.base_block):\n valid = True\n else:\n output = []\n\n # clean\n color = self.commands.color\n if color and color[0] != \"#\":\n color_name = f\"color_{color}\"\n threshold_color_name = f\"color_threshold_{color}\"\n # substitute color\n color = (\n getattr(module, color_name, None)\n or getattr(module, threshold_color_name, None)\n or getattr(module.py3, color_name.upper(), None)\n )\n if color == \"hidden\":\n return False, []\n\n text = \"\"\n out = []\n if isinstance(output, str):\n output = [output]\n\n # merge as much output as we can.\n first = True\n last_block = None\n for index, item in enumerate(output):\n is_block = isinstance(item, Block)\n if not is_block and item:\n last_block = None\n if isinstance(item, (str, bool, int, float, bytes)) or item is None:\n text += str(item)\n continue\n elif text:\n if not first and (text == \"\" or out and out[-1].get(\"color\") == color):\n out[-1][\"full_text\"] += text\n else:\n part = {\"full_text\": text}\n if color:\n part[\"color\"] = color\n out.append(part)\n text = \"\"\n if isinstance(item, Composite):\n if color:\n item.composite_update(item, {\"color\": color}, soft=True)\n out.extend(item.get_content())\n elif is_block:\n # if this is a block then likely it is soft.\n if not out:\n continue\n for other in output[index + 1 :]:\n if other and not isinstance(other, Block):\n valid, _output = item.render(get_params, module, _if=True)\n if _output and _output != last_block:\n last_block = _output\n out.extend(_output)\n break\n else:\n if item:\n out.append(item)\n first = False\n\n # add any left over text\n if text:\n part = {\"full_text\": text}\n if color:\n part[\"color\"] = color\n out.append(part)\n\n # process any min/max length commands\n max_length = self.commands.max_length\n min_length = self.commands.min_length\n\n if max_length or min_length:\n for item in out:\n if max_length is not None:\n item[\"full_text\"] = item[\"full_text\"][:max_length]\n max_length -= len(item[\"full_text\"])\n if min_length:\n min_length -= len(item[\"full_text\"])\n if min_length > 0:\n out[0][\"full_text\"] = \" \" * min_length + out[0][\"full_text\"]\n min_length = 0\n\n return valid, out"},"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 render_block(data):\n\tsnippet = data[2] \n\ttitle = data[0]['name']\n\tdescription = data[0]['description']\n\tblock_type = data[0]['type']\n\t\n\n\t# change the panel outline for\n\t# warnings and detections\n\tblock_border = 'yellow' if block_type == 'warning' else 'red1'\n\n\tcode_snippet = Syntax(\n\t\t\t\t\t\tsnippet, \n\t\t\t\t\t\tSYNTAX, \n\t\t\t\t\t\ttheme=THEME, \n\t\t\t\t\t\tline_numbers=True, \n\t\t\t\t\t\tstart_line=data[1]\n\t\t\t\t\t)\n\n\tdescription_txt = Markdown(\n\t\t\tf\"\"\" ## Explanation \\n {description} \"\"\",\n\t\t\tinline_code_lexer=SYNTAX,\n\t\t\tinline_code_theme=THEME,\n\t\t)\n\t\n\tcomponents = RenderGroup(\n\t\t\t\t\tcode_snippet,\n\t\t\t\t\tdescription_txt\n\t\t\t\t)\n\t\n\tblock = Panel(\n\t\t\tcomponents,\n\t\t\ttitle=f'[b white]{title}',\n\t\t\twidth=60,\n\t\t\tborder_style=block_border\n\t\t)\n\n\t# render\n\tprint('\\n')\n\tprint(block)","def render(self, template_name, block, **context):\n template = self._get_template(template_name)\n return self._render_context(template,\n template.blocks[block],\n **context)","def _render(self) -> None:\n pass","def render(self):\n pass","def render(self):\n pass","def render(self):\n pass","def render(self):\n pass","def render(self):\n pass","def render(self):\n pass","def render(self):\r\n super().render()","def run(self) -> None:\n self._render()\n print(self.sio.getvalue())","def render(self, block, view_name, context=None):\n # Set the active view so that :function:`render_child` can use it\n # as a default\n old_view_name = self._view_name\n self._view_name = view_name\n try:\n\n view_fn = getattr(block, view_name, None)\n if view_fn is None:\n view_fn = getattr(block, \"fallback_view\", None)\n if view_fn is None:\n raise NoSuchViewError(block, view_name)\n view_fn = functools.partial(view_fn, view_name)\n\n frag = view_fn(context)\n\n # Explicitly save because render action may have changed state\n block.save()\n updated_frag = self.wrap_xblock(block, view_name, frag, context)\n return self.render_asides(block, view_name, updated_frag, context)\n finally:\n # Reset the active view to what it was before entering this method\n self._view_name = old_view_name","def render():\n html = request.get_data().decode('utf-8')\n sio.emit('render', html)\n return 'OK'","def _render_context(self, template, block, **context):\n return u''.join(block(template.new_context(context)))","def render(self):\n\n self.desert_image.render()\n self.cannon_image.render()\n self.play_button.render()\n self.escape_label.render()","def render(self):","def render(self, **kw):\r\n style = kw.get('style', c.render_style or 'html')\r\n return Wrapped.part_render(self, self.style, style = style, **kw)","def render(self, r):\n raise NotImplementedError","def _render(self) -> str:\n html = self._template.render(self._transient_context)\n self._transient_context = None\n return html","def render(self):\n fmt = 'B' + 'B' * len(self.frame)\n self.sendPacket(6, struct.pack(fmt, self.start_code, *self.frame))","def render(self, rstate):\n pass","def render(self):\n raise NotImplementedError","def render(self, renderer, right=False):\n pass # pragma: no cover","def output_open_html(self):\n text = self.token[\"text\"]\n tag = self.token[\"tag\"]\n if self._parse_block_html and tag not in _pre_tags:\n text = self.inline(text)\n extra = self.token.get(\"extra\") or \"\"\n html = \"<%s%s>%s</%s>\" % (tag, extra, text, tag)\n return self.renderer.block_html(html)","def render(self, mode='human', close=False):\n return None","def render_report(blocks):\n\tfor block in blocks:\n\t render_block(\n\t\t(\n\t\t block[0],\t\t# signature \n\t\t block[1], # line number\n\t\t block[2],\t\t# line\n\t\t)\n\t )","def render(self, mode='human', close=False):\n pass","def render(self):\n self._render_text = self.content.replace('\\n', '<br>') # deal with new line\n return render_str(\"post.html\", p = self)","def render(self):\n context = {'groups': self._groups}\n\n return loader.render_to_string(self._template_path, dictionary=context)","def render(self):\n self._render_text = self.content.replace('\\n', '<br>')\n return TemplateFile.jinja_render_str(\"post.html\", p=self)","def render(self, mode='human'):","def render(self) -> str:\n with no_colors():\n self._render()\n return self.sio.getvalue()","def render(self, mode='human', close=False):\n pass","def render(self):\n raise NotImplementedError()","def makeBlock(tag):\n return {\"t\":\"RawBlock\",\"c\":[\"html\",tag]}","def render(self):\n raise RenderNotImplemented('Render function is not implemented.')","def end_rendering(self, output):\n if self.wrapper_to_generate:\n output = self.div(output, id=self.id, class_='nagare-generated nagare-async-view')\n\n return output","def render(self):\n self.run()\n return [{'dest' : self.dest,\n 'text' : self.tmpl.render(**self.data)}]","def render(self) -> str:\n\n return \"\\n\".join(self.render_iter())","def render(self, mode='human'):\n pass # no use in this situation","def render(self, out_file=None, cur_ind=\"\"):\n output_string = cur_ind\n if self.tag:\n output_string += self.get_opening_tag_string()\n for line in self.content:\n output_string += f\"{line}\"\n if self.tag:\n output_string += f\"</{self.tag}>\"\n if out_file:\n out_file.write(output_string)\n return output_string","def render(self):\n self.increase_view_count()\n return render_to_string(self.template.template_file, {'advert':self})","def render(self, mode='human'):\n\n pass","def draw_block(cls, coord):\n block, _ = MapModel.get_block(coord)\n\n block_size = Resolution.get_primary().block_height\n block_surface = BlockTexture.load_texture(block.type, block.variant)\n cls.view.surface.blit(\n block_surface,\n coord.relative(\n depth=cls.depth, section=cls.section, scale=block_size\n ),\n )\n # Render decorations.\n # TODO: This will NOT work with offsets into unrendered blocks!\n decor, offset = block.decoration\n if decor:\n decoration = BlockTexture.load_texture(decor)\n cls.view.surface.blit(\n decoration,\n coord.get_adjacent(offset).relative(\n depth=Depth.of(coord.row),\n section=Section.of(coord.col),\n scale=block_size,\n ),\n )","def render(self, template, **kw):\n self.write(self.render_string(template, **kw))","def draw_block(self):\n draw_component = DrawComponent(self.component_spot,self.component_type)\n return draw_component","def render(self, template, **kw):\n self.write(self.render_str(template, **kw))","def render(self, template, **kw):\n self.write(self.render_str(template, **kw))","def render(self, template, **kw):\n self.write(self.render_str(template, **kw))","def _render(self):\n self._renderer.render_menu()\n pg.display.update()","def render(self, mode='human', close=False):\n raise NotImplementedError()","def serve(self) -> str:\n return self._render()","def render_html(self):\n return self.template.render(content=self.content, **self.styles)","def render(self):\n self.env.render()","def render(self):\n return self","def render(self):\n self.rendering = True\n self.env.render()","def render(self):\n if self.can_render():\n output = '<ul>'\n for item in self.items:\n output += \"<li>{0}</li>\".format(item)\n return output + '</ul>'\n return ''","def render(self):\n self.env.render()\n #input(\"Press enter to take a step \")","def render(self):\n\n self._render_text = self.content.replace('\\n', '<br>')\n return render_str('post_template.html', post=self, user=self.user)","def render(self, context=None):\n # Make the complete context we'll use.\n render_context = dict(self.context)\n if context:\n render_context.update(context)\n return self._render_function(render_context, self._do_dots)","def render(self):\n return render_to_string(\n self.template_name, self.get_context_data(), request=self.request\n )","def renderNode(self, node):\n self.html += '<div id=\\\"nodeDecoration\\\">'\n self.html += '<p id=\\\"nodeTitle\\\">'\n self.html += escape(node.titleLong)\n self.html += '</p></div>\\n'\n for idevice in node.idevices:\n block = g_blockFactory.createBlock(None, idevice)\n if not block:\n log.critical(\"Unable to render iDevice.\")\n raise Error(\"Unable to render iDevice.\")\n if hasattr(idevice, \"isQuiz\"):\n self.html += block.renderJavascriptForWeb()\n self.html += block.renderView(self.style)\n for child in node.children:\n self.renderNode(child)","def render(self, screen):\n pass","def render(self, screen):\n pass","def render(self, file_out, cur_ind=''):\n file_out.write(cur_ind + f'<{self.tag}')\n Element.add_values(self, file_out)\n file_out.write('>')\n Element.add_items_no_line(self, file_out)\n file_out.write(cur_ind + f'</{self.tag}>\\n')","def render(self, resource):\n result = resource.render(self)\n if result is NOT_DONE_YET:\n return\n self.write(result)\n self.finish()","def render(self, context=None, **kwargs):\n # store the given context\n global_context = {}\n # store the result\n result = []\n # group the given context or kwargs\n if context:\n global_context.update(context)\n elif kwargs:\n global_context.update(kwargs)\n\n # this function to output from context\n # to the rendered template\n def write(*args):\n result.extend([str(arg) for arg in args])\n\n def fmt_write(fmt, *args):\n result.append(fmt % args)\n\n # add write and fmt_write into global_context\n global_context['write'] = write\n global_context['fmt_write'] = fmt_write\n # run the code\n for is_code, token in self.tokens:\n if is_code:\n exec(token, global_context)\n else:\n result.append(token)\n return ''.join(result)","def render_all_blocks(self, template_name, template_vars):\n # Read the state template file into a template object using the\n # environment object\n found_template_name = (\n self.find_template_name(template_name + '\\.tpl(\\.\\w+)?$'))\n template = self._template_env.select_template(\n [template_name, found_template_name])\n\n # Render template code for each of the template blocks (all except the\n # meta block)\n template_block_code = {\n block: self.render_block(template_name, template_vars, block)\n for block in\n self.get_template_blocks(template_name) if block != 'meta'}\n\n return template_block_code","def render(self,screen):\n for boids in self.boid_list:\n boids.render(screen)","def _draw_block(self, block: Tuple[int, int], kind: str) -> None:\n # ToDo: implement display picture: https://pythonprogramming.net/displaying-images-pygame/\n if self.board_formatting[kind]['picture'] is not None:\n raise Exception('Displaying pictures has not yet been implemented!')\n else:\n rectangle = [block[1] * self.block_length, block[0] * self.block_length,\n self.block_length, self.block_length]\n pygame.draw.rect(self.display, self.board_formatting[kind]['color'], rectangle)","def student_view(self, context=None):\n context = {\n u\"title\": self.title,\n u\"description\": self.description,\n u\"embed_code\": self.embed_code\n }\n fragment = Fragment()\n fragment.add_content(\n loader.render_template(\"templates/vr.html\", context)\n )\n fragment.add_css_url(\n self.runtime.local_resource_url(self, \"public/css/vr.css\")\n )\n self.runtime.publish(self, 'progress', {})\n return fragment","def render(self, out_file=None, cur_ind=\"\"):\n output_string = cur_ind\n if self.tag:\n output_string += self.get_opening_tag_string()\n for line in self.content:\n if not isinstance(line, str): # Recursively render objects\n output_string += line.render(out_file, cur_ind + self.indent)\n else: #If it's a string just render it with padding\n output_string += cur_ind + self.indent\n output_string += f\"{line}\"\n if self.add_new_line:\n output_string += \"\\n\"\n if self.tag:\n output_string += cur_ind\n output_string += f\"</{self.tag}>\"\n if out_file:\n out_file.write(output_string)\n return output_string","def do_block():\n print_column()\n print_rows()","def do_block():\n print_column()\n print_rows()","def student_view(self, context=None): # pylint: disable=unused-argument\n html = self.resource_string(\"static/html/chartsxblock.html\")\n frag = Fragment(html.format(self=self))\n frag.add_css(self.resource_string(\"static/css/chartsxblock.css\"))\n frag.add_javascript(self.resource_string(\"static/vendor/GCloader.js\"))\n frag.add_javascript(self.resource_string(\"static/js/src/chartsxblock.js\"))\n frag.initialize_js('ChartsXBlock', {'chartData': self.chart_data,\n 'chartType': self.chart_type,\n 'chartName': self.chart_name,\n 'chartTypes': self.chart_types})\n return frag","def render(self):\n\n self.page_current = self.pages[-1]\n\n # Remember terminal size.\n self.terminal_width = terminal.width\n self.terminal_height = terminal.height - 1\n\n # Do not render if no items exist in page yet.\n if not self.page_current.items:\n return\n\n # Fill buffer with content if empty.\n if not self.render_buffer:\n for line in self.page_current.item_strings_formatted:\n line += terminal.on_black(' ' * (self.terminal_width - terminal.length(line)))\n self.render_buffer.append(line)\n self.render_offset = self.page_current.item_onscreenlocs[self.page_current.item_selected]\n\n # Adjust the rendering offset if selected menu item is out of bounds of current terminal.\n if self.page_current.item_onscreenlocs[self.page_current.item_selected] >= self.render_offset + self.terminal_height:\n self.render_offset += self.terminal_height\n elif self.page_current.item_onscreenlocs[self.page_current.item_selected] < self.render_offset:\n self.render_offset -= self.terminal_height\n if self.render_offset < 0:\n self.render_offset = 0\n\n # Render buffer content to terminal\n for buffer_line_no in range(self.terminal_height):\n try:\n buffer_line = self.render_buffer[self.render_offset + self.render_offset_item + buffer_line_no]\n print(terminal.move(buffer_line_no, 0) + buffer_line, end='')\n except IndexError:\n # Print blank line in case buffer is empty\n print(terminal.move(buffer_line_no, 0) + (terminal.on_black(' ' * self.terminal_width)), end='')\n\n # Render status\n print(terminal.move(self.terminal_height, 0) + (terminal.black_on_cyan(self.status_text + ' ' * (self.terminal_width - terminal.length(self.status_text)))), end='')\n\n # Render cursor.\n # TODO Need to fix bug where the cursor occasionally gets drawn outside the screen and disrupting the rendering process\n if self.render_offset_item == 0:\n cursor = terminal.white_on_black('>')\n try:\n cursor += terminal.white_on_black('-' * (self.page_current.item_indentations[self.page_current.item_selected] * 2))\n except IndexError:\n pass\n print(terminal.move(self.page_current.item_onscreenlocs[self.page_current.item_selected] - self.render_offset, 0) + cursor)","def render(self):\n try:\n if self.permit():\n return self.renderer.render(self)\n except AttributeError:\n if self.renderer is None:\n raise NotImplementedError(\"Should have implemented a renderer for {0}\".format(self.name))\n else:\n raise\n return ''","def index(self, **kw):\n\n template = self.context\n request = self.request\n\n request.response.setHeader('content-type',\n template.content_type)\n\n return template.render(request, **kw)","def rawHTMLrendered(self):","def render(self, template: str, **vars) -> str:","def render_meta_block(self, template_name):\n # Read the state template file into a template object using the\n # environment object\n found_template_name = (\n self.find_template_name(template_name + '\\.tpl(\\.\\w+)?$'))\n template = self._template_env.select_template(\n [template_name, found_template_name])\n\n # Generate a context placeholder\n context = template.new_context\n\n # Render template code for the template meta block\n meta_block_code = template.blocks['meta'](context(vars={})).next()\n\n return meta_block_code","def render(self):\n self._render_product()\n\n self.params['product'] = self.product\n\n params = copy(self.params)\n\n try:\n if self.source.needs_render:\n # if this task has upstream dependencies, render using the\n # context manager, which will raise a warning if any of the\n # dependencies is not used, otherwise just render\n if params.get('upstream'):\n with params.get('upstream'):\n self.source.render(params)\n else:\n self.source.render(params)\n except Exception as e:\n raise type(e)('Error rendering code from Task \"{}\", '\n ' check the full traceback above for details'\n .format(repr(self), self.params)) from e\n\n self._status = (TaskStatus.WaitingExecution if not self.upstream\n else TaskStatus.WaitingUpstream)","def get_html(self):\r\n context = self.get_context()\r\n html = self.system.render_template(\r\n '{0}/combined_open_ended.html'.format(self.TEMPLATE_DIR), context\r\n )\r\n return html","def render_reponse(self, template, **context):\n content = self.jinja2.render_template(template, **context)\n self.response.write(content)","def instrumented_test_render(self, context):\n signals.template_rendered.send(sender=self, template=self, context=context)\n return self.nodelist.render(context)","def render(self, template, **kw):\n self.write(self._render_str(template, **kw))","def render(self):\n\n context = {\n 'model': self,\n 'hidden_fields': self.hidden_fields,\n 'css_prefix': self.css_prefix,\n }\n rendered = loader.render_to_string(self.template_path,\n dictionary=context)\n return rendered","def render(self):\n self.rendered = self.value\n return self.rendered","def render(self, template, *args, **kwargs):\n self._render(template, sys.stdout, *args, **kwargs)","def draw(self, parent, cr):\n for x, y in self.get_block_coords():\n parent.draw_block_element(cr, x, y)","def mj_render(self):\n self.render(mode='human')","def student_view(self, context=None):\n html = self.resource_string(self.html_path)\n fragment = Fragment(html.format(self=self))\n fragment.add_css(self.resource_string(self.css_path))\n fragment.add_javascript(self.resource_string(self.js_path))\n fragment.initialize_js('WhoWhereWhyXBlock')\n return fragment","def render(self, renderer: RenderingManager):\n self.grader.render(renderer)","def renderHTTP(ctx):","def render(self, file_out, cur_ind=''):\n file_out.write(cur_ind + f'<{self.tag}')\n Element.add_values(self, file_out)\n file_out.write('>\\n')\n Element.add_items(self, file_out)\n file_out.write(cur_ind + f'</{self.tag}>\\n')","def codeBlock( self, text ):\n indent= self.context[-1]\n lines= text.split( '\\n' )\n if len(lines) == 1: # Fragment with no newline.\n self.write('{!s}{!s}'.format(self.lastIndent*' ', lines[0]) )\n self.lastIndent= 0\n self.fragment= True\n else:\n first, rest= lines[:1], lines[1:]\n self.write('{!s}{!s}\\n'.format(self.lastIndent*' ', first[0]) )\n for l in rest[:-1]:\n self.write( '{!s}{!s}\\n'.format(indent*' ', l) )\n if rest[-1]:\n self.write( '{!s}{!s}'.format(indent*' ', rest[-1]) )\n self.lastIndent= 0\n self.fragment= True\n else:\n # Buffer a next indent\n self.lastIndent= len(rest[-1]) + indent\n self.fragment= False","def render(self,value):\n self.content += value\n if self._rendernl:\n self.content += self._rendernl","def render(self, mode='human', close=False):\n self.gym.render(mode=mode, close=close)","def render(self, data, *args, **kwargs):\n pass # pragma: nocover","def render( *args, **kwargs ):"],"string":"[\n \"def render_block(data):\\n\\tsnippet = data[2] \\n\\ttitle = data[0]['name']\\n\\tdescription = data[0]['description']\\n\\tblock_type = data[0]['type']\\n\\t\\n\\n\\t# change the panel outline for\\n\\t# warnings and detections\\n\\tblock_border = 'yellow' if block_type == 'warning' else 'red1'\\n\\n\\tcode_snippet = Syntax(\\n\\t\\t\\t\\t\\t\\tsnippet, \\n\\t\\t\\t\\t\\t\\tSYNTAX, \\n\\t\\t\\t\\t\\t\\ttheme=THEME, \\n\\t\\t\\t\\t\\t\\tline_numbers=True, \\n\\t\\t\\t\\t\\t\\tstart_line=data[1]\\n\\t\\t\\t\\t\\t)\\n\\n\\tdescription_txt = Markdown(\\n\\t\\t\\tf\\\"\\\"\\\" ## Explanation \\\\n {description} \\\"\\\"\\\",\\n\\t\\t\\tinline_code_lexer=SYNTAX,\\n\\t\\t\\tinline_code_theme=THEME,\\n\\t\\t)\\n\\t\\n\\tcomponents = RenderGroup(\\n\\t\\t\\t\\t\\tcode_snippet,\\n\\t\\t\\t\\t\\tdescription_txt\\n\\t\\t\\t\\t)\\n\\t\\n\\tblock = Panel(\\n\\t\\t\\tcomponents,\\n\\t\\t\\ttitle=f'[b white]{title}',\\n\\t\\t\\twidth=60,\\n\\t\\t\\tborder_style=block_border\\n\\t\\t)\\n\\n\\t# render\\n\\tprint('\\\\n')\\n\\tprint(block)\",\n \"def render(self, template_name, block, **context):\\n template = self._get_template(template_name)\\n return self._render_context(template,\\n template.blocks[block],\\n **context)\",\n \"def _render(self) -> None:\\n pass\",\n \"def render(self):\\n pass\",\n \"def render(self):\\n pass\",\n \"def render(self):\\n pass\",\n \"def render(self):\\n pass\",\n \"def render(self):\\n pass\",\n \"def render(self):\\n pass\",\n \"def render(self):\\r\\n super().render()\",\n \"def run(self) -> None:\\n self._render()\\n print(self.sio.getvalue())\",\n \"def render(self, block, view_name, context=None):\\n # Set the active view so that :function:`render_child` can use it\\n # as a default\\n old_view_name = self._view_name\\n self._view_name = view_name\\n try:\\n\\n view_fn = getattr(block, view_name, None)\\n if view_fn is None:\\n view_fn = getattr(block, \\\"fallback_view\\\", None)\\n if view_fn is None:\\n raise NoSuchViewError(block, view_name)\\n view_fn = functools.partial(view_fn, view_name)\\n\\n frag = view_fn(context)\\n\\n # Explicitly save because render action may have changed state\\n block.save()\\n updated_frag = self.wrap_xblock(block, view_name, frag, context)\\n return self.render_asides(block, view_name, updated_frag, context)\\n finally:\\n # Reset the active view to what it was before entering this method\\n self._view_name = old_view_name\",\n \"def render():\\n html = request.get_data().decode('utf-8')\\n sio.emit('render', html)\\n return 'OK'\",\n \"def _render_context(self, template, block, **context):\\n return u''.join(block(template.new_context(context)))\",\n \"def render(self):\\n\\n self.desert_image.render()\\n self.cannon_image.render()\\n self.play_button.render()\\n self.escape_label.render()\",\n \"def render(self):\",\n \"def render(self, **kw):\\r\\n style = kw.get('style', c.render_style or 'html')\\r\\n return Wrapped.part_render(self, self.style, style = style, **kw)\",\n \"def render(self, r):\\n raise NotImplementedError\",\n \"def _render(self) -> str:\\n html = self._template.render(self._transient_context)\\n self._transient_context = None\\n return html\",\n \"def render(self):\\n fmt = 'B' + 'B' * len(self.frame)\\n self.sendPacket(6, struct.pack(fmt, self.start_code, *self.frame))\",\n \"def render(self, rstate):\\n pass\",\n \"def render(self):\\n raise NotImplementedError\",\n \"def render(self, renderer, right=False):\\n pass # pragma: no cover\",\n \"def output_open_html(self):\\n text = self.token[\\\"text\\\"]\\n tag = self.token[\\\"tag\\\"]\\n if self._parse_block_html and tag not in _pre_tags:\\n text = self.inline(text)\\n extra = self.token.get(\\\"extra\\\") or \\\"\\\"\\n html = \\\"<%s%s>%s</%s>\\\" % (tag, extra, text, tag)\\n return self.renderer.block_html(html)\",\n \"def render(self, mode='human', close=False):\\n return None\",\n \"def render_report(blocks):\\n\\tfor block in blocks:\\n\\t render_block(\\n\\t\\t(\\n\\t\\t block[0],\\t\\t# signature \\n\\t\\t block[1], # line number\\n\\t\\t block[2],\\t\\t# line\\n\\t\\t)\\n\\t )\",\n \"def render(self, mode='human', close=False):\\n pass\",\n \"def render(self):\\n self._render_text = self.content.replace('\\\\n', '<br>') # deal with new line\\n return render_str(\\\"post.html\\\", p = self)\",\n \"def render(self):\\n context = {'groups': self._groups}\\n\\n return loader.render_to_string(self._template_path, dictionary=context)\",\n \"def render(self):\\n self._render_text = self.content.replace('\\\\n', '<br>')\\n return TemplateFile.jinja_render_str(\\\"post.html\\\", p=self)\",\n \"def render(self, mode='human'):\",\n \"def render(self) -> str:\\n with no_colors():\\n self._render()\\n return self.sio.getvalue()\",\n \"def render(self, mode='human', close=False):\\n pass\",\n \"def render(self):\\n raise NotImplementedError()\",\n \"def makeBlock(tag):\\n return {\\\"t\\\":\\\"RawBlock\\\",\\\"c\\\":[\\\"html\\\",tag]}\",\n \"def render(self):\\n raise RenderNotImplemented('Render function is not implemented.')\",\n \"def end_rendering(self, output):\\n if self.wrapper_to_generate:\\n output = self.div(output, id=self.id, class_='nagare-generated nagare-async-view')\\n\\n return output\",\n \"def render(self):\\n self.run()\\n return [{'dest' : self.dest,\\n 'text' : self.tmpl.render(**self.data)}]\",\n \"def render(self) -> str:\\n\\n return \\\"\\\\n\\\".join(self.render_iter())\",\n \"def render(self, mode='human'):\\n pass # no use in this situation\",\n \"def render(self, out_file=None, cur_ind=\\\"\\\"):\\n output_string = cur_ind\\n if self.tag:\\n output_string += self.get_opening_tag_string()\\n for line in self.content:\\n output_string += f\\\"{line}\\\"\\n if self.tag:\\n output_string += f\\\"</{self.tag}>\\\"\\n if out_file:\\n out_file.write(output_string)\\n return output_string\",\n \"def render(self):\\n self.increase_view_count()\\n return render_to_string(self.template.template_file, {'advert':self})\",\n \"def render(self, mode='human'):\\n\\n pass\",\n \"def draw_block(cls, coord):\\n block, _ = MapModel.get_block(coord)\\n\\n block_size = Resolution.get_primary().block_height\\n block_surface = BlockTexture.load_texture(block.type, block.variant)\\n cls.view.surface.blit(\\n block_surface,\\n coord.relative(\\n depth=cls.depth, section=cls.section, scale=block_size\\n ),\\n )\\n # Render decorations.\\n # TODO: This will NOT work with offsets into unrendered blocks!\\n decor, offset = block.decoration\\n if decor:\\n decoration = BlockTexture.load_texture(decor)\\n cls.view.surface.blit(\\n decoration,\\n coord.get_adjacent(offset).relative(\\n depth=Depth.of(coord.row),\\n section=Section.of(coord.col),\\n scale=block_size,\\n ),\\n )\",\n \"def render(self, template, **kw):\\n self.write(self.render_string(template, **kw))\",\n \"def draw_block(self):\\n draw_component = DrawComponent(self.component_spot,self.component_type)\\n return draw_component\",\n \"def render(self, template, **kw):\\n self.write(self.render_str(template, **kw))\",\n \"def render(self, template, **kw):\\n self.write(self.render_str(template, **kw))\",\n \"def render(self, template, **kw):\\n self.write(self.render_str(template, **kw))\",\n \"def _render(self):\\n self._renderer.render_menu()\\n pg.display.update()\",\n \"def render(self, mode='human', close=False):\\n raise NotImplementedError()\",\n \"def serve(self) -> str:\\n return self._render()\",\n \"def render_html(self):\\n return self.template.render(content=self.content, **self.styles)\",\n \"def render(self):\\n self.env.render()\",\n \"def render(self):\\n return self\",\n \"def render(self):\\n self.rendering = True\\n self.env.render()\",\n \"def render(self):\\n if self.can_render():\\n output = '<ul>'\\n for item in self.items:\\n output += \\\"<li>{0}</li>\\\".format(item)\\n return output + '</ul>'\\n return ''\",\n \"def render(self):\\n self.env.render()\\n #input(\\\"Press enter to take a step \\\")\",\n \"def render(self):\\n\\n self._render_text = self.content.replace('\\\\n', '<br>')\\n return render_str('post_template.html', post=self, user=self.user)\",\n \"def render(self, context=None):\\n # Make the complete context we'll use.\\n render_context = dict(self.context)\\n if context:\\n render_context.update(context)\\n return self._render_function(render_context, self._do_dots)\",\n \"def render(self):\\n return render_to_string(\\n self.template_name, self.get_context_data(), request=self.request\\n )\",\n \"def renderNode(self, node):\\n self.html += '<div id=\\\\\\\"nodeDecoration\\\\\\\">'\\n self.html += '<p id=\\\\\\\"nodeTitle\\\\\\\">'\\n self.html += escape(node.titleLong)\\n self.html += '</p></div>\\\\n'\\n for idevice in node.idevices:\\n block = g_blockFactory.createBlock(None, idevice)\\n if not block:\\n log.critical(\\\"Unable to render iDevice.\\\")\\n raise Error(\\\"Unable to render iDevice.\\\")\\n if hasattr(idevice, \\\"isQuiz\\\"):\\n self.html += block.renderJavascriptForWeb()\\n self.html += block.renderView(self.style)\\n for child in node.children:\\n self.renderNode(child)\",\n \"def render(self, screen):\\n pass\",\n \"def render(self, screen):\\n pass\",\n \"def render(self, file_out, cur_ind=''):\\n file_out.write(cur_ind + f'<{self.tag}')\\n Element.add_values(self, file_out)\\n file_out.write('>')\\n Element.add_items_no_line(self, file_out)\\n file_out.write(cur_ind + f'</{self.tag}>\\\\n')\",\n \"def render(self, resource):\\n result = resource.render(self)\\n if result is NOT_DONE_YET:\\n return\\n self.write(result)\\n self.finish()\",\n \"def render(self, context=None, **kwargs):\\n # store the given context\\n global_context = {}\\n # store the result\\n result = []\\n # group the given context or kwargs\\n if context:\\n global_context.update(context)\\n elif kwargs:\\n global_context.update(kwargs)\\n\\n # this function to output from context\\n # to the rendered template\\n def write(*args):\\n result.extend([str(arg) for arg in args])\\n\\n def fmt_write(fmt, *args):\\n result.append(fmt % args)\\n\\n # add write and fmt_write into global_context\\n global_context['write'] = write\\n global_context['fmt_write'] = fmt_write\\n # run the code\\n for is_code, token in self.tokens:\\n if is_code:\\n exec(token, global_context)\\n else:\\n result.append(token)\\n return ''.join(result)\",\n \"def render_all_blocks(self, template_name, template_vars):\\n # Read the state template file into a template object using the\\n # environment object\\n found_template_name = (\\n self.find_template_name(template_name + '\\\\.tpl(\\\\.\\\\w+)?$'))\\n template = self._template_env.select_template(\\n [template_name, found_template_name])\\n\\n # Render template code for each of the template blocks (all except the\\n # meta block)\\n template_block_code = {\\n block: self.render_block(template_name, template_vars, block)\\n for block in\\n self.get_template_blocks(template_name) if block != 'meta'}\\n\\n return template_block_code\",\n \"def render(self,screen):\\n for boids in self.boid_list:\\n boids.render(screen)\",\n \"def _draw_block(self, block: Tuple[int, int], kind: str) -> None:\\n # ToDo: implement display picture: https://pythonprogramming.net/displaying-images-pygame/\\n if self.board_formatting[kind]['picture'] is not None:\\n raise Exception('Displaying pictures has not yet been implemented!')\\n else:\\n rectangle = [block[1] * self.block_length, block[0] * self.block_length,\\n self.block_length, self.block_length]\\n pygame.draw.rect(self.display, self.board_formatting[kind]['color'], rectangle)\",\n \"def student_view(self, context=None):\\n context = {\\n u\\\"title\\\": self.title,\\n u\\\"description\\\": self.description,\\n u\\\"embed_code\\\": self.embed_code\\n }\\n fragment = Fragment()\\n fragment.add_content(\\n loader.render_template(\\\"templates/vr.html\\\", context)\\n )\\n fragment.add_css_url(\\n self.runtime.local_resource_url(self, \\\"public/css/vr.css\\\")\\n )\\n self.runtime.publish(self, 'progress', {})\\n return fragment\",\n \"def render(self, out_file=None, cur_ind=\\\"\\\"):\\n output_string = cur_ind\\n if self.tag:\\n output_string += self.get_opening_tag_string()\\n for line in self.content:\\n if not isinstance(line, str): # Recursively render objects\\n output_string += line.render(out_file, cur_ind + self.indent)\\n else: #If it's a string just render it with padding\\n output_string += cur_ind + self.indent\\n output_string += f\\\"{line}\\\"\\n if self.add_new_line:\\n output_string += \\\"\\\\n\\\"\\n if self.tag:\\n output_string += cur_ind\\n output_string += f\\\"</{self.tag}>\\\"\\n if out_file:\\n out_file.write(output_string)\\n return output_string\",\n \"def do_block():\\n print_column()\\n print_rows()\",\n \"def do_block():\\n print_column()\\n print_rows()\",\n \"def student_view(self, context=None): # pylint: disable=unused-argument\\n html = self.resource_string(\\\"static/html/chartsxblock.html\\\")\\n frag = Fragment(html.format(self=self))\\n frag.add_css(self.resource_string(\\\"static/css/chartsxblock.css\\\"))\\n frag.add_javascript(self.resource_string(\\\"static/vendor/GCloader.js\\\"))\\n frag.add_javascript(self.resource_string(\\\"static/js/src/chartsxblock.js\\\"))\\n frag.initialize_js('ChartsXBlock', {'chartData': self.chart_data,\\n 'chartType': self.chart_type,\\n 'chartName': self.chart_name,\\n 'chartTypes': self.chart_types})\\n return frag\",\n \"def render(self):\\n\\n self.page_current = self.pages[-1]\\n\\n # Remember terminal size.\\n self.terminal_width = terminal.width\\n self.terminal_height = terminal.height - 1\\n\\n # Do not render if no items exist in page yet.\\n if not self.page_current.items:\\n return\\n\\n # Fill buffer with content if empty.\\n if not self.render_buffer:\\n for line in self.page_current.item_strings_formatted:\\n line += terminal.on_black(' ' * (self.terminal_width - terminal.length(line)))\\n self.render_buffer.append(line)\\n self.render_offset = self.page_current.item_onscreenlocs[self.page_current.item_selected]\\n\\n # Adjust the rendering offset if selected menu item is out of bounds of current terminal.\\n if self.page_current.item_onscreenlocs[self.page_current.item_selected] >= self.render_offset + self.terminal_height:\\n self.render_offset += self.terminal_height\\n elif self.page_current.item_onscreenlocs[self.page_current.item_selected] < self.render_offset:\\n self.render_offset -= self.terminal_height\\n if self.render_offset < 0:\\n self.render_offset = 0\\n\\n # Render buffer content to terminal\\n for buffer_line_no in range(self.terminal_height):\\n try:\\n buffer_line = self.render_buffer[self.render_offset + self.render_offset_item + buffer_line_no]\\n print(terminal.move(buffer_line_no, 0) + buffer_line, end='')\\n except IndexError:\\n # Print blank line in case buffer is empty\\n print(terminal.move(buffer_line_no, 0) + (terminal.on_black(' ' * self.terminal_width)), end='')\\n\\n # Render status\\n print(terminal.move(self.terminal_height, 0) + (terminal.black_on_cyan(self.status_text + ' ' * (self.terminal_width - terminal.length(self.status_text)))), end='')\\n\\n # Render cursor.\\n # TODO Need to fix bug where the cursor occasionally gets drawn outside the screen and disrupting the rendering process\\n if self.render_offset_item == 0:\\n cursor = terminal.white_on_black('>')\\n try:\\n cursor += terminal.white_on_black('-' * (self.page_current.item_indentations[self.page_current.item_selected] * 2))\\n except IndexError:\\n pass\\n print(terminal.move(self.page_current.item_onscreenlocs[self.page_current.item_selected] - self.render_offset, 0) + cursor)\",\n \"def render(self):\\n try:\\n if self.permit():\\n return self.renderer.render(self)\\n except AttributeError:\\n if self.renderer is None:\\n raise NotImplementedError(\\\"Should have implemented a renderer for {0}\\\".format(self.name))\\n else:\\n raise\\n return ''\",\n \"def index(self, **kw):\\n\\n template = self.context\\n request = self.request\\n\\n request.response.setHeader('content-type',\\n template.content_type)\\n\\n return template.render(request, **kw)\",\n \"def rawHTMLrendered(self):\",\n \"def render(self, template: str, **vars) -> str:\",\n \"def render_meta_block(self, template_name):\\n # Read the state template file into a template object using the\\n # environment object\\n found_template_name = (\\n self.find_template_name(template_name + '\\\\.tpl(\\\\.\\\\w+)?$'))\\n template = self._template_env.select_template(\\n [template_name, found_template_name])\\n\\n # Generate a context placeholder\\n context = template.new_context\\n\\n # Render template code for the template meta block\\n meta_block_code = template.blocks['meta'](context(vars={})).next()\\n\\n return meta_block_code\",\n \"def render(self):\\n self._render_product()\\n\\n self.params['product'] = self.product\\n\\n params = copy(self.params)\\n\\n try:\\n if self.source.needs_render:\\n # if this task has upstream dependencies, render using the\\n # context manager, which will raise a warning if any of the\\n # dependencies is not used, otherwise just render\\n if params.get('upstream'):\\n with params.get('upstream'):\\n self.source.render(params)\\n else:\\n self.source.render(params)\\n except Exception as e:\\n raise type(e)('Error rendering code from Task \\\"{}\\\", '\\n ' check the full traceback above for details'\\n .format(repr(self), self.params)) from e\\n\\n self._status = (TaskStatus.WaitingExecution if not self.upstream\\n else TaskStatus.WaitingUpstream)\",\n \"def get_html(self):\\r\\n context = self.get_context()\\r\\n html = self.system.render_template(\\r\\n '{0}/combined_open_ended.html'.format(self.TEMPLATE_DIR), context\\r\\n )\\r\\n return html\",\n \"def render_reponse(self, template, **context):\\n content = self.jinja2.render_template(template, **context)\\n self.response.write(content)\",\n \"def instrumented_test_render(self, context):\\n signals.template_rendered.send(sender=self, template=self, context=context)\\n return self.nodelist.render(context)\",\n \"def render(self, template, **kw):\\n self.write(self._render_str(template, **kw))\",\n \"def render(self):\\n\\n context = {\\n 'model': self,\\n 'hidden_fields': self.hidden_fields,\\n 'css_prefix': self.css_prefix,\\n }\\n rendered = loader.render_to_string(self.template_path,\\n dictionary=context)\\n return rendered\",\n \"def render(self):\\n self.rendered = self.value\\n return self.rendered\",\n \"def render(self, template, *args, **kwargs):\\n self._render(template, sys.stdout, *args, **kwargs)\",\n \"def draw(self, parent, cr):\\n for x, y in self.get_block_coords():\\n parent.draw_block_element(cr, x, y)\",\n \"def mj_render(self):\\n self.render(mode='human')\",\n \"def student_view(self, context=None):\\n html = self.resource_string(self.html_path)\\n fragment = Fragment(html.format(self=self))\\n fragment.add_css(self.resource_string(self.css_path))\\n fragment.add_javascript(self.resource_string(self.js_path))\\n fragment.initialize_js('WhoWhereWhyXBlock')\\n return fragment\",\n \"def render(self, renderer: RenderingManager):\\n self.grader.render(renderer)\",\n \"def renderHTTP(ctx):\",\n \"def render(self, file_out, cur_ind=''):\\n file_out.write(cur_ind + f'<{self.tag}')\\n Element.add_values(self, file_out)\\n file_out.write('>\\\\n')\\n Element.add_items(self, file_out)\\n file_out.write(cur_ind + f'</{self.tag}>\\\\n')\",\n \"def codeBlock( self, text ):\\n indent= self.context[-1]\\n lines= text.split( '\\\\n' )\\n if len(lines) == 1: # Fragment with no newline.\\n self.write('{!s}{!s}'.format(self.lastIndent*' ', lines[0]) )\\n self.lastIndent= 0\\n self.fragment= True\\n else:\\n first, rest= lines[:1], lines[1:]\\n self.write('{!s}{!s}\\\\n'.format(self.lastIndent*' ', first[0]) )\\n for l in rest[:-1]:\\n self.write( '{!s}{!s}\\\\n'.format(indent*' ', l) )\\n if rest[-1]:\\n self.write( '{!s}{!s}'.format(indent*' ', rest[-1]) )\\n self.lastIndent= 0\\n self.fragment= True\\n else:\\n # Buffer a next indent\\n self.lastIndent= len(rest[-1]) + indent\\n self.fragment= False\",\n \"def render(self,value):\\n self.content += value\\n if self._rendernl:\\n self.content += self._rendernl\",\n \"def render(self, mode='human', close=False):\\n self.gym.render(mode=mode, close=close)\",\n \"def render(self, data, *args, **kwargs):\\n pass # pragma: nocover\",\n \"def render( *args, **kwargs ):\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7029032","0.69647723","0.6806205","0.65881765","0.65881765","0.65881765","0.65881765","0.65881765","0.65881765","0.65558636","0.6526438","0.6469616","0.6436933","0.64222467","0.63671017","0.63276225","0.6301424","0.6263438","0.6262892","0.6222637","0.61917096","0.61849964","0.6142114","0.6135704","0.6127353","0.61211157","0.6104681","0.60987437","0.60900253","0.6083268","0.6075749","0.6074311","0.6057477","0.60555387","0.6046632","0.60323685","0.6031627","0.60198796","0.59999067","0.5999396","0.59817517","0.59788984","0.59686095","0.5936603","0.5919452","0.59023994","0.5874536","0.5874536","0.5874536","0.5860077","0.58523285","0.58210826","0.5809542","0.5808336","0.5805234","0.58039826","0.5798226","0.57926196","0.57891184","0.57715","0.5769802","0.57684684","0.5756998","0.5756998","0.57545936","0.5753187","0.5735119","0.57251626","0.57245845","0.57174474","0.57158357","0.5710612","0.56991655","0.56991655","0.56962466","0.56919336","0.5687553","0.5685101","0.56841385","0.5680185","0.5672627","0.5668297","0.5667108","0.56632984","0.5651388","0.5650363","0.5647693","0.5647598","0.5645278","0.56378317","0.56371266","0.5633591","0.56330115","0.5631753","0.5629145","0.56290925","0.56128144","0.55929196","0.5590812","0.55858934"],"string":"[\n \"0.7029032\",\n \"0.69647723\",\n \"0.6806205\",\n \"0.65881765\",\n \"0.65881765\",\n \"0.65881765\",\n \"0.65881765\",\n \"0.65881765\",\n \"0.65881765\",\n \"0.65558636\",\n \"0.6526438\",\n \"0.6469616\",\n \"0.6436933\",\n \"0.64222467\",\n \"0.63671017\",\n \"0.63276225\",\n \"0.6301424\",\n \"0.6263438\",\n \"0.6262892\",\n \"0.6222637\",\n \"0.61917096\",\n \"0.61849964\",\n \"0.6142114\",\n \"0.6135704\",\n \"0.6127353\",\n \"0.61211157\",\n \"0.6104681\",\n \"0.60987437\",\n \"0.60900253\",\n \"0.6083268\",\n \"0.6075749\",\n \"0.6074311\",\n \"0.6057477\",\n \"0.60555387\",\n \"0.6046632\",\n \"0.60323685\",\n \"0.6031627\",\n \"0.60198796\",\n \"0.59999067\",\n \"0.5999396\",\n \"0.59817517\",\n \"0.59788984\",\n \"0.59686095\",\n \"0.5936603\",\n \"0.5919452\",\n \"0.59023994\",\n \"0.5874536\",\n \"0.5874536\",\n \"0.5874536\",\n \"0.5860077\",\n \"0.58523285\",\n \"0.58210826\",\n \"0.5809542\",\n \"0.5808336\",\n \"0.5805234\",\n \"0.58039826\",\n \"0.5798226\",\n \"0.57926196\",\n \"0.57891184\",\n \"0.57715\",\n \"0.5769802\",\n \"0.57684684\",\n \"0.5756998\",\n \"0.5756998\",\n \"0.57545936\",\n \"0.5753187\",\n \"0.5735119\",\n \"0.57251626\",\n \"0.57245845\",\n \"0.57174474\",\n \"0.57158357\",\n \"0.5710612\",\n \"0.56991655\",\n \"0.56991655\",\n \"0.56962466\",\n \"0.56919336\",\n \"0.5687553\",\n \"0.5685101\",\n \"0.56841385\",\n \"0.5680185\",\n \"0.5672627\",\n \"0.5668297\",\n \"0.5667108\",\n \"0.56632984\",\n \"0.5651388\",\n \"0.5650363\",\n \"0.5647693\",\n \"0.5647598\",\n \"0.5645278\",\n \"0.56378317\",\n \"0.56371266\",\n \"0.5633591\",\n \"0.56330115\",\n \"0.5631753\",\n \"0.5629145\",\n \"0.56290925\",\n \"0.56128144\",\n \"0.55929196\",\n \"0.5590812\",\n \"0.55858934\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.56899357"},"document_rank":{"kind":"string","value":"76"}}},{"rowIdx":94781,"cells":{"query":{"kind":"string","value":"Create a new position."},"document":{"kind":"string","value":"def __init__(self,x,y):\n self.x = x\n self.y = y"},"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 create_position(self):\n raise NotImplementedError","def create(self, pos):\n self.pos = pos","def position(self, create, position=2, **kwargs): # pylint: disable=unused-argument, method-hidden\r\n self.position = position","def position(self, create, position=2, **kwargs): # pylint: disable=unused-argument, method-hidden\r\n self.position = position","def new_position(self, p):\n if self.track:\n self.gnx = p.gnx\n else:\n p = self.get_position()\n\n self.new_position_edit(p)\n self.new_position_view(p)","def create_position(self, position, name):\n # get row name and create a column\n row_name = self.rows[0]\n self.create_column(0, position)\n col_name = self.columns[position]\n\n if self.verbose:\n print(f'Creating and opening subgroup {row_name}/{col_name}/{name}')\n\n # create position subgroup\n self.store[row_name][col_name].create_group(name)\n\n # update trackers\n self.current_pos_group = self.store[row_name][col_name][name]\n self.current_well_group = self.store[row_name][col_name]\n self.current_position = position\n\n # update ome-metadata\n self.positions[position] = {'name': name, 'row': row_name, 'col': col_name}\n self._update_plate_meta(position)\n self._update_well_meta(position)","def create_position(self):\n area = utils.AreaCreator(\n self._width, self._height, starts_at=self._starts_at,\n is_battle_area=False)\n for coordinate in area.get_coordinates():\n position = coordinate.get_position()\n self._cells.append(PShipCell(position))\n self._update_battle_position(self._cells)","def set_new_location(self, xPos, yPos):","def make_position(data) -> Position:\n return (data[\"x\"], data[\"y\"])","def create_position(self):\n area = utils.AreaCreator(\n self._width, self._height, starts_at=self._starts_at,\n is_battle_area=False)\n for coordinate in area.get_coordinates():\n position = coordinate.get_position()\n self._cells.append(QShipCell(position))\n self._update_battle_position(self._cells)","def setPosition(position):","def new_position_edit(self, p):\n\n DBG(\"new edit position\")\n if self.mode != 'view':\n self.edit_widget.new_text(p.b)","def position(self, x, y):\n self.x = x \n self.y = y\n self.pos[0] = x \n self.pos[1] = y","def new_position_view(self, p):\n DBG(\"new view position\")\n if self.mode != 'edit':\n if self.recurse:\n text = g.getScript(self.c, p, useSelectedText=False, useSentinels=False)\n else:\n text = p.b\n self.view_widget.new_text(text)","def _make_position(self, node):\n return self.Position(self, node) if node is not None else None","def _make_position(self, node):\n return self.Position(self, node) if node is not None else None","def _make_position(self, node):\n return self.Position(self, node) if node is not None else None","def _make_position(self, node):\n return self.Position(self, node) if node is not None else None","def _make_position(self, node):\n return self.Position(self, node) if node is not None else None","def set_position(self, position):\n self.position = tuple(position)","def test_transact_position_new_position():\n # Create the PositionHandler, Transaction and\n # carry out a transaction\n ph = PositionHandler()\n asset = 'EQ:AMZN'\n\n transaction = Transaction(\n asset,\n quantity=100,\n dt=pd.Timestamp('2015-05-06 15:00:00', tz=pytz.UTC),\n price=960.0,\n order_id=123,\n commission=26.83\n )\n ph.transact_position(transaction)\n\n # Check that the position object is set correctly\n pos = ph.positions[asset]\n\n assert pos.buy_quantity == 100\n assert pos.sell_quantity == 0\n assert pos.net_quantity == 100\n assert pos.direction == 1\n assert pos.avg_price == 960.2683000000001","def set_position(self, new_pos):\n self._position = new_pos","def _make_position(self, node):\n return self.Position(self, node) if node is not None else None","def setPosition(self):\n self.data['pos-x'] = \"%s\" % self.x()\n self.data['pos-y'] = \"%s\" % self.y()","def __init__(self, pos):\r\n self.pos = pos","def set_pos(self, p: tuple) -> None:\n self.pos = p","def set_position(self, position):\n raise NotImplementedError()","def set_position(self, x, y):\n self.geometry('%s%s' % (x, y))","def spawn(self, y, x, h, w):\n self.pos = (np.random.randint(y, y + h), np.random.randint(x, x + w))","def _init(self, position):\n\t\tself._position = position","def set_position(self, new_pos, units=\"bohr\"):\n from numpy import array\n # Convert the input to the right units.\n pos = array(new_pos)\n if _IsAngstroem(units):\n pos /= AU_to_A\n if _IsAngstroem(self):\n pos *= AU_to_A\n pos = [x for x in pos]\n\n # Insert\n if 'r' in self.store:\n self.store['r'] = pos\n else:\n self.store[self.sym] = pos\n pass","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def create_new_point(self, coords, **options):\n\n if 'fill' not in options:\n options['fill'] = self.variables.foreground_color\n\n x1, y1 = (coords[0] - self.variables.point_size), (coords[1] - self.variables.point_size)\n x2, y2 = (coords[0] + self.variables.point_size), (coords[1] + self.variables.point_size)\n shape_id = self.create_oval(x1, y1, x2, y2, **options)\n self.variables.vector_objects[str(shape_id)] = VectorObject(SHAPE_TYPES.POINT, options)\n self.variables.vector_objects[str(shape_id)].point_size = self.variables.point_size\n self.variables.shape_ids.append(shape_id)\n self.set_shape_pixel_coords_from_canvas_coords(shape_id, coords)\n self.variables.current_shape_id = shape_id\n return shape_id","def position(self, position):\n self.move_to(position)","def set_position(self, position):\n self.position = position","def create_marker_for_position(self, position):\n\n marker = Marker()\n marker.header.frame_id = '/world'\n marker.type = marker.SPHERE\n marker.action = marker.ADD\n marker.scale.x = 0.1\n marker.scale.y = 0.1\n marker.scale.z = 0.1\n marker.color.r = 1\n marker.color.g = 1\n marker.color.b = 1\n marker.color.a = 1.0\n marker.pose.orientation.w = 1.0\n marker.pose.position.x = position[0]\n marker.pose.position.y = position[1]\n marker.pose.position.z = position[2]\n self.marker_list.markers.append(marker)","def __init__(self, position, is_horizontal, map_state):\n\n self.position = position\n self.spawn_position = position[:]\n self.in_spawn_area = True\n self.is_horizontal = is_horizontal\n self.map_state = map_state\n self.previous_direction = (0, 0)","def get_new_position(cls, position_x, position_y, direction):\n new_position_x = cls.calculate_position_x(position_x, direction)\n new_position_y = cls.calculate_position_y(position_y, direction)\n return new_position_x, new_position_y","def set_position():\n function = LegacyFunctionSpecification()\n function.addParameter('index_of_the_particle', dtype='int32', direction=function.IN)\n for par in [\"x\", \"y\", \"z\"]:\n function.addParameter(par, dtype='float64', unit=generic_unit_system.length, direction=function.IN, \n description = \"The new position vector of the particle\")\n function.addParameter('npoints', dtype='int32', direction=function.LENGTH)\n function.result_type = 'int32'\n function.must_handle_array = True\n return function","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def __init__(self, *args):\n this = _ida_hexrays.new_ctext_position_t(*args)\n try: self.this.append(this)\n except: self.this = this","def setPosition(self,newPos):\n self._position = newPos","def pos_gen(self, method = None):\n # Generate positions object\n pos = pos_class.pos(self._parent, method)\n # Save it to ICobj\n self._parent.pos = pos","def add_position(self, position):\n if not hasattr(self, 'positions'):\n self.positions = list()\n self.append_to('positions', position)","def getNewPosition(self, angle, speed):\n old_x, old_y = self.getX(), self.getY()\n # Compute the change in position\n delta_y = speed * math.cos(math.radians(angle))\n delta_x = speed * math.sin(math.radians(angle))\n # Add that to the existing position\n new_x = old_x + delta_x\n new_y = old_y + delta_y\n #print \"new x = \" + str(new_x) + \" new y \" + str(new_y)\n #print \"floor of x = \" + str(math.floor(new_x)) + \" floor of y = \" + str(math.floor(new_y))\n \n return Position(new_x, new_y)","def __init__(self, *args):\n if len(args) == 1:\n position = args[0]\n if len(position) != 2:\n raise PositionError\n self._position = args\n elif len(args) == 2:\n self._position = args\n else:\n raise PositionError","def position(self, pos: int):\n self.__pos = pos","def __new_position(self):\n iterables = [range(self.size_x), range(self.size_y)]\n points = [] # Save all points in size.\n for point in itertools.product(*iterables):\n points.append(point)\n\n current_points = [] # Save used points.\n for object in self.objects:\n if (object.x, object.y) not in current_points:\n current_points.append((object.x, object.y))\n\n for point in current_points:\n points.remove(point) # Remove all used points.\n\n location = np.random.choice(a=range(len(points)), replace=False)\n return points[location]","def position(self, x, y, z):\n self.curr_position = Vector([x, y, z])\n self.ptr.position(x, y, z)","def update_position(position):\n pass","def set_pos(self, p, a, **kwargs):\n\t\treturn self.send(\"set_pos\", p[0], p[1], a, **kwargs)","def __init__(self, name, position):\n self.name = name\n self.position = position","def __init__(self):\n self.position = 0","def set_position(self):\n raise RuntimeError(\"the 'set_position' method must be overriden\")","def __init__(self, size=0, position=(0, 0)):\n self.size = size\n self.position = position","def __init__(self, size=0, position=(0, 0)):\n self.size = size\n self.position = position","def __init__(self, size=0, position=(0, 0)):\n self.size = size\n self.position = position","def createCell(self, xPos, yPos):\n self.cells.append(Cell(self.screen, xPos, yPos))","def make_pose(self, position, orientation, frame):\n\n pose = PoseStamped()\n pose.header.frame_id = frame\n pose.pose.position.x = position[0]\n pose.pose.position.y = position[1]\n pose.pose.position.z = position[2]\n pose.pose.orientation.w = orientation[0]\n pose.pose.orientation.x = orientation[1]\n pose.pose.orientation.y = orientation[2]\n pose.pose.orientation.z = orientation[3]\n return pose","def __init__(self, x, y):\n # assigning the initial position\n self.x = x\n self.y = y","def __init__(self, position):\n self.position = position\n self.direction = 'U'\n self.length = 0","def getNewPosition(self, angle, speed):\n old_x, old_y = self.getX(), self.getY()\n # Compute the change in position\n delta_y = speed * math.cos(math.radians(angle))\n delta_x = speed * math.sin(math.radians(angle))\n # Add that to the existing position\n new_x = old_x + delta_x\n new_y = old_y + delta_y\n return Position(new_x, new_y)","def getNewPosition(self, angle, speed):\n old_x, old_y = self.getX(), self.getY()\n # Compute the change in position\n delta_y = speed * math.cos(math.radians(angle))\n delta_x = speed * math.sin(math.radians(angle))\n # Add that to the existing position\n new_x = old_x + delta_x\n new_y = old_y + delta_y\n return Position(new_x, new_y)","def getNewPosition(self, angle, speed):\n old_x, old_y = self.getX(), self.getY()\n # Compute the change in position\n delta_y = speed * math.cos(math.radians(angle))\n delta_x = speed * math.sin(math.radians(angle))\n # Add that to the existing position\n new_x = old_x + delta_x\n new_y = old_y + delta_y\n return Position(new_x, new_y)","def position_append(self, pos, gtid):\n return None","def set_position(self, x, y):\n self.position.x = x\n self.position.y = y\n self.rect.topleft = x, y","def generate_positions(self):\n raise NotImplementedError(\"Should implement generate_positions()!\")","def get_position(self, position):","def fl_add_positioner(posittype, xpos, ypos, width, height, label):\n _fl_add_positioner = library.cfuncproto(\n library.load_so_libforms(), \"fl_add_positioner\",\n cty.POINTER(xfdata.FL_OBJECT), [cty.c_int, xfdata.FL_Coord,\n xfdata.FL_Coord, xfdata.FL_Coord, xfdata.FL_Coord, xfdata.STRING],\n \"\"\"FL_OBJECT * fl_add_positioner(int type, FL_Coord x, FL_Coord y,\n FL_Coord w, FL_Coord h, const char * label)\"\"\")\n library.check_if_flinitialized()\n library.checkfatal_allowed_value_in_list(posittype, \\\n xfdata.POSITIONERTYPE_list)\n i_posittype = library.convert_to_intc(posittype)\n i_xpos = library.convert_to_FL_Coord(xpos)\n i_ypos = library.convert_to_FL_Coord(ypos)\n i_width = library.convert_to_FL_Coord(width)\n i_height = library.convert_to_FL_Coord(height)\n s_label = library.convert_to_bytestrc(label)\n library.keep_elem_refs(posittype, xpos, ypos, width, height, label, \\\n i_posittype, i_xpos, i_ypos, i_width, i_height, s_label)\n retval = _fl_add_positioner(i_posittype, i_xpos, i_ypos, i_width, \\\n i_height, s_label)\n return retval","def getRandomPosition(self):\n posX = np.random.uniform(0, self.width)\n posY = np.random.uniform(0, self.height)\n return Position(posX, posY)","def generatePos(self):\n self.pos = np.zeros((self.num_points, 2), dtype='int32')\n self.pos[:, 1] = np.repeat(list(reversed(np.arange(1, self.x*2, 2))), self.y)\n self.pos[:, 0] = np.tile(np.arange(1, self.x*2, 2), self.y)","def __init__(self, position, expiry_tick):\n self.position = position\n self.expiry_tick = expiry_tick","def _test_set_new_pos(self):\n self.p.setup(siteInfo={}, source=None, device=self.device)\n time.sleep(0.3) if self.using_mock else time.sleep(3)\n act_position = self.device.getActPosition()\n offset = 0.5\n self.p.setOffset(offset)\n time.sleep(0.3) if self.using_mock else time.sleep(3)\n self.assertAlmostEqual(\n self.p.getPosition(), \n act_position + offset, \n places=1\n )\n self.assertAlmostEqual(\n act_position + offset, \n self.device.getActPosition(), \n places=1\n )","def pos(self, x=-1, y=-1):\n self._p('[pos] {} {}'.format(x, y))","async def set_position(self, pos: int) -> None:\n return await self.relay(\"set_position\")(pos=pos)","def position(self):\r\n pass","def createNew(cls, x0, y0, z0, a1, b1, c1, a2, b2, c2):\n p0 = Point(x0, y0, z0)\n d1 = Vector(a1, b1, c1)\n d2 = Vector(a2, b2, c2)\n return cls(p0, d1, d2)","def set_position( self, posx, posy ):\n\n self.__foodx = posx\n self.__foody = posy","def getNewPosition(self, angle, speed):\n old_x, old_y = self.getX(), self.getY()\n angle = float(angle)\n # Compute the change in position\n delta_y = speed * math.cos(math.radians(angle))\n delta_x = speed * math.sin(math.radians(angle))\n # Add that to the existing position\n new_x = old_x + delta_x\n new_y = old_y + delta_y\n return Position(new_x, new_y)","def getNewPosition(self, angle, speed):\n old_x, old_y = self.getX(), self.getY()\n angle = float(angle)\n # Compute the change in position\n delta_y = speed * math.cos(math.radians(angle))\n delta_x = speed * math.sin(math.radians(angle))\n # Add that to the existing position\n new_x = old_x + delta_x\n new_y = old_y + delta_y\n return Position(new_x, new_y)","def getNewPosition(self, angle, speed):\n old_x, old_y = self.getX(), self.getY()\n angle = float(angle)\n # Compute the change in position\n delta_y = speed * math.cos(math.radians(angle))\n delta_x = speed * math.sin(math.radians(angle))\n # Add that to the existing position\n new_x = old_x + delta_x\n new_y = old_y + delta_y\n return Position(new_x, new_y)","def set_pos(self, newpos : list) :\n if len(newpos) == 2 :\n self.pos = list(newpos).copy()\n else :\n raise UserWarning('wrong position passed')","def position(x, y):\n command([x + 0x80, y + 0x40])","def __init__(self, pos=(SCREEN_X//2, SCREEN_Y//2)):\n self.heading = \"right\"\n self.speed = 4\n self.length = 32\n self.size = 16\n self.color = COLOR\n self.pos = pos\n (self.x_coord, self.y_coord) = ([], [])\n self.displacement = 0\n for _ in range(self.length):\n self.x_coord.append(self.pos[0] - self.displacement)\n self.y_coord.append(self.pos[1])\n self.displacement += 4"],"string":"[\n \"def create_position(self):\\n raise NotImplementedError\",\n \"def create(self, pos):\\n self.pos = pos\",\n \"def position(self, create, position=2, **kwargs): # pylint: disable=unused-argument, method-hidden\\r\\n self.position = position\",\n \"def position(self, create, position=2, **kwargs): # pylint: disable=unused-argument, method-hidden\\r\\n self.position = position\",\n \"def new_position(self, p):\\n if self.track:\\n self.gnx = p.gnx\\n else:\\n p = self.get_position()\\n\\n self.new_position_edit(p)\\n self.new_position_view(p)\",\n \"def create_position(self, position, name):\\n # get row name and create a column\\n row_name = self.rows[0]\\n self.create_column(0, position)\\n col_name = self.columns[position]\\n\\n if self.verbose:\\n print(f'Creating and opening subgroup {row_name}/{col_name}/{name}')\\n\\n # create position subgroup\\n self.store[row_name][col_name].create_group(name)\\n\\n # update trackers\\n self.current_pos_group = self.store[row_name][col_name][name]\\n self.current_well_group = self.store[row_name][col_name]\\n self.current_position = position\\n\\n # update ome-metadata\\n self.positions[position] = {'name': name, 'row': row_name, 'col': col_name}\\n self._update_plate_meta(position)\\n self._update_well_meta(position)\",\n \"def create_position(self):\\n area = utils.AreaCreator(\\n self._width, self._height, starts_at=self._starts_at,\\n is_battle_area=False)\\n for coordinate in area.get_coordinates():\\n position = coordinate.get_position()\\n self._cells.append(PShipCell(position))\\n self._update_battle_position(self._cells)\",\n \"def set_new_location(self, xPos, yPos):\",\n \"def make_position(data) -> Position:\\n return (data[\\\"x\\\"], data[\\\"y\\\"])\",\n \"def create_position(self):\\n area = utils.AreaCreator(\\n self._width, self._height, starts_at=self._starts_at,\\n is_battle_area=False)\\n for coordinate in area.get_coordinates():\\n position = coordinate.get_position()\\n self._cells.append(QShipCell(position))\\n self._update_battle_position(self._cells)\",\n \"def setPosition(position):\",\n \"def new_position_edit(self, p):\\n\\n DBG(\\\"new edit position\\\")\\n if self.mode != 'view':\\n self.edit_widget.new_text(p.b)\",\n \"def position(self, x, y):\\n self.x = x \\n self.y = y\\n self.pos[0] = x \\n self.pos[1] = y\",\n \"def new_position_view(self, p):\\n DBG(\\\"new view position\\\")\\n if self.mode != 'edit':\\n if self.recurse:\\n text = g.getScript(self.c, p, useSelectedText=False, useSentinels=False)\\n else:\\n text = p.b\\n self.view_widget.new_text(text)\",\n \"def _make_position(self, node):\\n return self.Position(self, node) if node is not None else None\",\n \"def _make_position(self, node):\\n return self.Position(self, node) if node is not None else None\",\n \"def _make_position(self, node):\\n return self.Position(self, node) if node is not None else None\",\n \"def _make_position(self, node):\\n return self.Position(self, node) if node is not None else None\",\n \"def _make_position(self, node):\\n return self.Position(self, node) if node is not None else None\",\n \"def set_position(self, position):\\n self.position = tuple(position)\",\n \"def test_transact_position_new_position():\\n # Create the PositionHandler, Transaction and\\n # carry out a transaction\\n ph = PositionHandler()\\n asset = 'EQ:AMZN'\\n\\n transaction = Transaction(\\n asset,\\n quantity=100,\\n dt=pd.Timestamp('2015-05-06 15:00:00', tz=pytz.UTC),\\n price=960.0,\\n order_id=123,\\n commission=26.83\\n )\\n ph.transact_position(transaction)\\n\\n # Check that the position object is set correctly\\n pos = ph.positions[asset]\\n\\n assert pos.buy_quantity == 100\\n assert pos.sell_quantity == 0\\n assert pos.net_quantity == 100\\n assert pos.direction == 1\\n assert pos.avg_price == 960.2683000000001\",\n \"def set_position(self, new_pos):\\n self._position = new_pos\",\n \"def _make_position(self, node):\\n return self.Position(self, node) if node is not None else None\",\n \"def setPosition(self):\\n self.data['pos-x'] = \\\"%s\\\" % self.x()\\n self.data['pos-y'] = \\\"%s\\\" % self.y()\",\n \"def __init__(self, pos):\\r\\n self.pos = pos\",\n \"def set_pos(self, p: tuple) -> None:\\n self.pos = p\",\n \"def set_position(self, position):\\n raise NotImplementedError()\",\n \"def set_position(self, x, y):\\n self.geometry('%s%s' % (x, y))\",\n \"def spawn(self, y, x, h, w):\\n self.pos = (np.random.randint(y, y + h), np.random.randint(x, x + w))\",\n \"def _init(self, position):\\n\\t\\tself._position = position\",\n \"def set_position(self, new_pos, units=\\\"bohr\\\"):\\n from numpy import array\\n # Convert the input to the right units.\\n pos = array(new_pos)\\n if _IsAngstroem(units):\\n pos /= AU_to_A\\n if _IsAngstroem(self):\\n pos *= AU_to_A\\n pos = [x for x in pos]\\n\\n # Insert\\n if 'r' in self.store:\\n self.store['r'] = pos\\n else:\\n self.store[self.sym] = pos\\n pass\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def create_new_point(self, coords, **options):\\n\\n if 'fill' not in options:\\n options['fill'] = self.variables.foreground_color\\n\\n x1, y1 = (coords[0] - self.variables.point_size), (coords[1] - self.variables.point_size)\\n x2, y2 = (coords[0] + self.variables.point_size), (coords[1] + self.variables.point_size)\\n shape_id = self.create_oval(x1, y1, x2, y2, **options)\\n self.variables.vector_objects[str(shape_id)] = VectorObject(SHAPE_TYPES.POINT, options)\\n self.variables.vector_objects[str(shape_id)].point_size = self.variables.point_size\\n self.variables.shape_ids.append(shape_id)\\n self.set_shape_pixel_coords_from_canvas_coords(shape_id, coords)\\n self.variables.current_shape_id = shape_id\\n return shape_id\",\n \"def position(self, position):\\n self.move_to(position)\",\n \"def set_position(self, position):\\n self.position = position\",\n \"def create_marker_for_position(self, position):\\n\\n marker = Marker()\\n marker.header.frame_id = '/world'\\n marker.type = marker.SPHERE\\n marker.action = marker.ADD\\n marker.scale.x = 0.1\\n marker.scale.y = 0.1\\n marker.scale.z = 0.1\\n marker.color.r = 1\\n marker.color.g = 1\\n marker.color.b = 1\\n marker.color.a = 1.0\\n marker.pose.orientation.w = 1.0\\n marker.pose.position.x = position[0]\\n marker.pose.position.y = position[1]\\n marker.pose.position.z = position[2]\\n self.marker_list.markers.append(marker)\",\n \"def __init__(self, position, is_horizontal, map_state):\\n\\n self.position = position\\n self.spawn_position = position[:]\\n self.in_spawn_area = True\\n self.is_horizontal = is_horizontal\\n self.map_state = map_state\\n self.previous_direction = (0, 0)\",\n \"def get_new_position(cls, position_x, position_y, direction):\\n new_position_x = cls.calculate_position_x(position_x, direction)\\n new_position_y = cls.calculate_position_y(position_y, direction)\\n return new_position_x, new_position_y\",\n \"def set_position():\\n function = LegacyFunctionSpecification()\\n function.addParameter('index_of_the_particle', dtype='int32', direction=function.IN)\\n for par in [\\\"x\\\", \\\"y\\\", \\\"z\\\"]:\\n function.addParameter(par, dtype='float64', unit=generic_unit_system.length, direction=function.IN, \\n description = \\\"The new position vector of the particle\\\")\\n function.addParameter('npoints', dtype='int32', direction=function.LENGTH)\\n function.result_type = 'int32'\\n function.must_handle_array = True\\n return function\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def __init__(self, *args):\\n this = _ida_hexrays.new_ctext_position_t(*args)\\n try: self.this.append(this)\\n except: self.this = this\",\n \"def setPosition(self,newPos):\\n self._position = newPos\",\n \"def pos_gen(self, method = None):\\n # Generate positions object\\n pos = pos_class.pos(self._parent, method)\\n # Save it to ICobj\\n self._parent.pos = pos\",\n \"def add_position(self, position):\\n if not hasattr(self, 'positions'):\\n self.positions = list()\\n self.append_to('positions', position)\",\n \"def getNewPosition(self, angle, speed):\\n old_x, old_y = self.getX(), self.getY()\\n # Compute the change in position\\n delta_y = speed * math.cos(math.radians(angle))\\n delta_x = speed * math.sin(math.radians(angle))\\n # Add that to the existing position\\n new_x = old_x + delta_x\\n new_y = old_y + delta_y\\n #print \\\"new x = \\\" + str(new_x) + \\\" new y \\\" + str(new_y)\\n #print \\\"floor of x = \\\" + str(math.floor(new_x)) + \\\" floor of y = \\\" + str(math.floor(new_y))\\n \\n return Position(new_x, new_y)\",\n \"def __init__(self, *args):\\n if len(args) == 1:\\n position = args[0]\\n if len(position) != 2:\\n raise PositionError\\n self._position = args\\n elif len(args) == 2:\\n self._position = args\\n else:\\n raise PositionError\",\n \"def position(self, pos: int):\\n self.__pos = pos\",\n \"def __new_position(self):\\n iterables = [range(self.size_x), range(self.size_y)]\\n points = [] # Save all points in size.\\n for point in itertools.product(*iterables):\\n points.append(point)\\n\\n current_points = [] # Save used points.\\n for object in self.objects:\\n if (object.x, object.y) not in current_points:\\n current_points.append((object.x, object.y))\\n\\n for point in current_points:\\n points.remove(point) # Remove all used points.\\n\\n location = np.random.choice(a=range(len(points)), replace=False)\\n return points[location]\",\n \"def position(self, x, y, z):\\n self.curr_position = Vector([x, y, z])\\n self.ptr.position(x, y, z)\",\n \"def update_position(position):\\n pass\",\n \"def set_pos(self, p, a, **kwargs):\\n\\t\\treturn self.send(\\\"set_pos\\\", p[0], p[1], a, **kwargs)\",\n \"def __init__(self, name, position):\\n self.name = name\\n self.position = position\",\n \"def __init__(self):\\n self.position = 0\",\n \"def set_position(self):\\n raise RuntimeError(\\\"the 'set_position' method must be overriden\\\")\",\n \"def __init__(self, size=0, position=(0, 0)):\\n self.size = size\\n self.position = position\",\n \"def __init__(self, size=0, position=(0, 0)):\\n self.size = size\\n self.position = position\",\n \"def __init__(self, size=0, position=(0, 0)):\\n self.size = size\\n self.position = position\",\n \"def createCell(self, xPos, yPos):\\n self.cells.append(Cell(self.screen, xPos, yPos))\",\n \"def make_pose(self, position, orientation, frame):\\n\\n pose = PoseStamped()\\n pose.header.frame_id = frame\\n pose.pose.position.x = position[0]\\n pose.pose.position.y = position[1]\\n pose.pose.position.z = position[2]\\n pose.pose.orientation.w = orientation[0]\\n pose.pose.orientation.x = orientation[1]\\n pose.pose.orientation.y = orientation[2]\\n pose.pose.orientation.z = orientation[3]\\n return pose\",\n \"def __init__(self, x, y):\\n # assigning the initial position\\n self.x = x\\n self.y = y\",\n \"def __init__(self, position):\\n self.position = position\\n self.direction = 'U'\\n self.length = 0\",\n \"def getNewPosition(self, angle, speed):\\n old_x, old_y = self.getX(), self.getY()\\n # Compute the change in position\\n delta_y = speed * math.cos(math.radians(angle))\\n delta_x = speed * math.sin(math.radians(angle))\\n # Add that to the existing position\\n new_x = old_x + delta_x\\n new_y = old_y + delta_y\\n return Position(new_x, new_y)\",\n \"def getNewPosition(self, angle, speed):\\n old_x, old_y = self.getX(), self.getY()\\n # Compute the change in position\\n delta_y = speed * math.cos(math.radians(angle))\\n delta_x = speed * math.sin(math.radians(angle))\\n # Add that to the existing position\\n new_x = old_x + delta_x\\n new_y = old_y + delta_y\\n return Position(new_x, new_y)\",\n \"def getNewPosition(self, angle, speed):\\n old_x, old_y = self.getX(), self.getY()\\n # Compute the change in position\\n delta_y = speed * math.cos(math.radians(angle))\\n delta_x = speed * math.sin(math.radians(angle))\\n # Add that to the existing position\\n new_x = old_x + delta_x\\n new_y = old_y + delta_y\\n return Position(new_x, new_y)\",\n \"def position_append(self, pos, gtid):\\n return None\",\n \"def set_position(self, x, y):\\n self.position.x = x\\n self.position.y = y\\n self.rect.topleft = x, y\",\n \"def generate_positions(self):\\n raise NotImplementedError(\\\"Should implement generate_positions()!\\\")\",\n \"def get_position(self, position):\",\n \"def fl_add_positioner(posittype, xpos, ypos, width, height, label):\\n _fl_add_positioner = library.cfuncproto(\\n library.load_so_libforms(), \\\"fl_add_positioner\\\",\\n cty.POINTER(xfdata.FL_OBJECT), [cty.c_int, xfdata.FL_Coord,\\n xfdata.FL_Coord, xfdata.FL_Coord, xfdata.FL_Coord, xfdata.STRING],\\n \\\"\\\"\\\"FL_OBJECT * fl_add_positioner(int type, FL_Coord x, FL_Coord y,\\n FL_Coord w, FL_Coord h, const char * label)\\\"\\\"\\\")\\n library.check_if_flinitialized()\\n library.checkfatal_allowed_value_in_list(posittype, \\\\\\n xfdata.POSITIONERTYPE_list)\\n i_posittype = library.convert_to_intc(posittype)\\n i_xpos = library.convert_to_FL_Coord(xpos)\\n i_ypos = library.convert_to_FL_Coord(ypos)\\n i_width = library.convert_to_FL_Coord(width)\\n i_height = library.convert_to_FL_Coord(height)\\n s_label = library.convert_to_bytestrc(label)\\n library.keep_elem_refs(posittype, xpos, ypos, width, height, label, \\\\\\n i_posittype, i_xpos, i_ypos, i_width, i_height, s_label)\\n retval = _fl_add_positioner(i_posittype, i_xpos, i_ypos, i_width, \\\\\\n i_height, s_label)\\n return retval\",\n \"def getRandomPosition(self):\\n posX = np.random.uniform(0, self.width)\\n posY = np.random.uniform(0, self.height)\\n return Position(posX, posY)\",\n \"def generatePos(self):\\n self.pos = np.zeros((self.num_points, 2), dtype='int32')\\n self.pos[:, 1] = np.repeat(list(reversed(np.arange(1, self.x*2, 2))), self.y)\\n self.pos[:, 0] = np.tile(np.arange(1, self.x*2, 2), self.y)\",\n \"def __init__(self, position, expiry_tick):\\n self.position = position\\n self.expiry_tick = expiry_tick\",\n \"def _test_set_new_pos(self):\\n self.p.setup(siteInfo={}, source=None, device=self.device)\\n time.sleep(0.3) if self.using_mock else time.sleep(3)\\n act_position = self.device.getActPosition()\\n offset = 0.5\\n self.p.setOffset(offset)\\n time.sleep(0.3) if self.using_mock else time.sleep(3)\\n self.assertAlmostEqual(\\n self.p.getPosition(), \\n act_position + offset, \\n places=1\\n )\\n self.assertAlmostEqual(\\n act_position + offset, \\n self.device.getActPosition(), \\n places=1\\n )\",\n \"def pos(self, x=-1, y=-1):\\n self._p('[pos] {} {}'.format(x, y))\",\n \"async def set_position(self, pos: int) -> None:\\n return await self.relay(\\\"set_position\\\")(pos=pos)\",\n \"def position(self):\\r\\n pass\",\n \"def createNew(cls, x0, y0, z0, a1, b1, c1, a2, b2, c2):\\n p0 = Point(x0, y0, z0)\\n d1 = Vector(a1, b1, c1)\\n d2 = Vector(a2, b2, c2)\\n return cls(p0, d1, d2)\",\n \"def set_position( self, posx, posy ):\\n\\n self.__foodx = posx\\n self.__foody = posy\",\n \"def getNewPosition(self, angle, speed):\\n old_x, old_y = self.getX(), self.getY()\\n angle = float(angle)\\n # Compute the change in position\\n delta_y = speed * math.cos(math.radians(angle))\\n delta_x = speed * math.sin(math.radians(angle))\\n # Add that to the existing position\\n new_x = old_x + delta_x\\n new_y = old_y + delta_y\\n return Position(new_x, new_y)\",\n \"def getNewPosition(self, angle, speed):\\n old_x, old_y = self.getX(), self.getY()\\n angle = float(angle)\\n # Compute the change in position\\n delta_y = speed * math.cos(math.radians(angle))\\n delta_x = speed * math.sin(math.radians(angle))\\n # Add that to the existing position\\n new_x = old_x + delta_x\\n new_y = old_y + delta_y\\n return Position(new_x, new_y)\",\n \"def getNewPosition(self, angle, speed):\\n old_x, old_y = self.getX(), self.getY()\\n angle = float(angle)\\n # Compute the change in position\\n delta_y = speed * math.cos(math.radians(angle))\\n delta_x = speed * math.sin(math.radians(angle))\\n # Add that to the existing position\\n new_x = old_x + delta_x\\n new_y = old_y + delta_y\\n return Position(new_x, new_y)\",\n \"def set_pos(self, newpos : list) :\\n if len(newpos) == 2 :\\n self.pos = list(newpos).copy()\\n else :\\n raise UserWarning('wrong position passed')\",\n \"def position(x, y):\\n command([x + 0x80, y + 0x40])\",\n \"def __init__(self, pos=(SCREEN_X//2, SCREEN_Y//2)):\\n self.heading = \\\"right\\\"\\n self.speed = 4\\n self.length = 32\\n self.size = 16\\n self.color = COLOR\\n self.pos = pos\\n (self.x_coord, self.y_coord) = ([], [])\\n self.displacement = 0\\n for _ in range(self.length):\\n self.x_coord.append(self.pos[0] - self.displacement)\\n self.y_coord.append(self.pos[1])\\n self.displacement += 4\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.847801","0.8391693","0.8154143","0.8154143","0.7296945","0.692898","0.678412","0.6775694","0.67575675","0.6718587","0.6701663","0.65915143","0.6572498","0.65635514","0.65402424","0.65402424","0.65402424","0.65402424","0.65402424","0.647187","0.64189696","0.6401512","0.63681185","0.6355446","0.63266635","0.6285665","0.6250105","0.6249137","0.62480664","0.62462413","0.6242256","0.62356055","0.62356055","0.62356055","0.62356055","0.62356055","0.62356055","0.62356055","0.62356055","0.62356055","0.62356055","0.62356055","0.6231228","0.62137055","0.6211468","0.6206496","0.6205113","0.619186","0.618599","0.6185304","0.6185304","0.6185304","0.6185304","0.6185304","0.6185304","0.6185304","0.6185304","0.6181098","0.6168401","0.61606675","0.61606044","0.61493516","0.61416507","0.6122833","0.61139095","0.61060655","0.60843647","0.60666645","0.6062765","0.60545564","0.6046288","0.60432833","0.5992293","0.5992293","0.5987201","0.5963765","0.5948354","0.5941344","0.5939529","0.5939529","0.5939529","0.5938988","0.59183604","0.59172165","0.5911951","0.5904317","0.5901551","0.58985895","0.58983266","0.58979976","0.58956194","0.5893542","0.58880293","0.5878515","0.5874195","0.5873715","0.5873715","0.5873715","0.58702093","0.5866985","0.5862936"],"string":"[\n \"0.847801\",\n \"0.8391693\",\n \"0.8154143\",\n \"0.8154143\",\n \"0.7296945\",\n \"0.692898\",\n \"0.678412\",\n \"0.6775694\",\n \"0.67575675\",\n \"0.6718587\",\n \"0.6701663\",\n \"0.65915143\",\n \"0.6572498\",\n \"0.65635514\",\n \"0.65402424\",\n \"0.65402424\",\n \"0.65402424\",\n \"0.65402424\",\n \"0.65402424\",\n \"0.647187\",\n \"0.64189696\",\n \"0.6401512\",\n \"0.63681185\",\n \"0.6355446\",\n \"0.63266635\",\n \"0.6285665\",\n \"0.6250105\",\n \"0.6249137\",\n \"0.62480664\",\n \"0.62462413\",\n \"0.6242256\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.62356055\",\n \"0.6231228\",\n \"0.62137055\",\n \"0.6211468\",\n \"0.6206496\",\n \"0.6205113\",\n \"0.619186\",\n \"0.618599\",\n \"0.6185304\",\n \"0.6185304\",\n \"0.6185304\",\n \"0.6185304\",\n \"0.6185304\",\n \"0.6185304\",\n \"0.6185304\",\n \"0.6185304\",\n \"0.6181098\",\n \"0.6168401\",\n \"0.61606675\",\n \"0.61606044\",\n \"0.61493516\",\n \"0.61416507\",\n \"0.6122833\",\n \"0.61139095\",\n \"0.61060655\",\n \"0.60843647\",\n \"0.60666645\",\n \"0.6062765\",\n \"0.60545564\",\n \"0.6046288\",\n \"0.60432833\",\n \"0.5992293\",\n \"0.5992293\",\n \"0.5987201\",\n \"0.5963765\",\n \"0.5948354\",\n \"0.5941344\",\n \"0.5939529\",\n \"0.5939529\",\n \"0.5939529\",\n \"0.5938988\",\n \"0.59183604\",\n \"0.59172165\",\n \"0.5911951\",\n \"0.5904317\",\n \"0.5901551\",\n \"0.58985895\",\n \"0.58983266\",\n \"0.58979976\",\n \"0.58956194\",\n \"0.5893542\",\n \"0.58880293\",\n \"0.5878515\",\n \"0.5874195\",\n \"0.5873715\",\n \"0.5873715\",\n \"0.5873715\",\n \"0.58702093\",\n \"0.5866985\",\n \"0.5862936\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94782,"cells":{"query":{"kind":"string","value":"Display position in user friendly manner."},"document":{"kind":"string","value":"def __repr__(self):\n return \"(\"+str(self.x)+\",\"+str(self.y)+\")\""},"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 position(self):\r\n pass","def display(self):\n \"\"\" Coordinates for position are x-axis (LR) and y-axis (NS) \"\"\"\n for coordY in range(self.y):\n print()\n for column in range(self.height):\n for coordLR in range(self.x):\n print(\" \", end=\"\")\n for row in range(self.width):\n print(\"#\", end=\"\")\n print()","def display_coordinates(self) -> None:\n\n print('Y coordinate: ', self.player.row_position + 1)\n print('X coordinate: ', self.player.column_position + 1)","def get_position(self, position):","def positioning(self):\n pass","def show_position(self):\n self.anc350_instrument.update_all_positions()\n\n self.current_positions = self.anc350_instrument.current_positions\n\n self.gui.label_actualPositionX.setText(str(self.current_positions['XPiezoStepper']))\n self.gui.label_actualPositionY.setText(str(self.current_positions['YPiezoStepper']))\n self.gui.label_actualPositionZ.setText(str(self.current_positions['ZPiezoStepper']))\n\n self.gui.scan_positionX.setText(str(self.current_positions['XPiezoScanner']))\n self.gui.scan_positionY.setText(str(self.current_positions['YPiezoScanner']))\n self.gui.scan_positionZ.setText(str(self.current_positions['ZPiezoScanner']))","def setPosition(self):\n self.data['pos-x'] = \"%s\" % self.x()\n self.data['pos-y'] = \"%s\" % self.y()","def display(self):\n mg_w = self.width\n mg_h = self.height\n str_to_prt = \"\\n\" * self.y + (\" \" * self.x + \"#\" * mg_w + '\\n') * mg_h\n print(str_to_prt[:-1])","def _pos(self):\n sw = self.parent.winfo_screenwidth()\n sh = self.parent.winfo_screenheight()\n w = sw * 0.8\n h = sh * 0.8\n x = (sw - w) / 2\n y = (sh - h) / 2\n self.parent.geometry('%dx%d+%d+%d' % (w, h, x, y))","def draw_position_label(self):\n x, y, z = self.player.pos\n x, y, z = math.floor(x), math.floor(y), math.floor(z)\n self.label.text = 'FPS: {}, X: {}, Y: {}, Z: {}'.format(round(pyglet.clock.get_fps()), x, y, z)\n self.label.draw()","def printPosition(self, node):\n self.node = str(node)\n \n self.pos_x = self.nodePosition[self.node][0]\n self.pos_y = self.nodePosition[self.node][1]\n self.pos_z = self.nodePosition[self.node][2] \n print \"----------------\\nPosition of %s\\n----------------\\nPosition X: %.2f\\nPosition Y: %.2f\\nPosition Z: %.2f\\n\" % (self.node, float(self.pos_x), float(self.pos_y), float(self.pos_z))","def display(self):\n prow = self.__width * '#'\n nstr = self.y * \"\\n\"\n for x in range(self.__height):\n nstr += self.x * \" \"\n nstr += prow\n if x == (self.__height - 1):\n break\n nstr += \"\\n\"\n print(nstr)","def position(self):\n return self.__position","def my_print(self):\n length = self.__size\n\n if self.__size == 0:\n print(\"\")\n\n \"\"\"Print using position of y-axis.\"\"\"\n for i in range(self.__position[1]):\n print(\"\")\n for j in range(length):\n \"\"\"Print spaces and # in x-axis.\"\"\"\n print((\" \" * self.__position[0]) + (\"#\" * length))","def display(self):\n\n print(\"\\n\" * self.__y, end='') # y offset\n\n for i in range(self.__height):\n print(\" \" * self.__x, end='') # x offset\n print(\"#\" * self.__width)","def __str__(self) -> str:\n position = self.get_position()\n return f\"Baby at position ({position[0]}, {position[1]}) (row, col)\"","def display(self):\n for i in range(self.__y):\n print()\n for i in range(self.__height):\n print(\" \" * self.__x + \"#\" * self.__width)","def get_pos(self):\r\n return self.pos","def show_status(self):\n color = (255, 255, 255)\n w, h = self.width, self.height\n x, y = self.pos_shift\n self.put_text(\"scale factor: %.2E\" % SCALE_FACTOR,\n color, (x, y))\n self.put_text(\"G: %.7E\" % G,\n color, (x, y + 25))\n self.put_text(\"number of objects: %d\" % len(self.phy.objects),\n color, (x, y + 50))\n self.put_text(\"x: %d\" % x,\n color, (w + x - 100, h + y - 50))\n self.put_text(\"y: %d\" % y,\n color, (w + x - 100, h + y - 25))","def cmd_position(self, n, e, d, heading):\n pass","def position(self):\n return self._position","def print_position(position):\n print('Packet Number # %s' % position)","def position(self):\n return (self.__position)","def get_position(self):\n return self.position","def get_position(self):\n return self.position","def display(self):\n for b in range(self.y):\n print()\n for i in range(self.height):\n print(\" \" * self.x + \"#\" * self.width)","def get_pos(self):\n return self.pos","def get_position(self):\n raise NotImplementedError()","def print_pos(pos):\n # TO DO: EXCLUDE FIRST LINE\n s = \"%BLOCK POSITIONS_FRAC\\n\" + str(pos) + \"\\n%ENDBLOCK POSITIONS_FRAC\"\n return s","def __str__(self):\r\n x, y, z = self.pos\r\n return self.label + f\" {x} {y} {z}\"","def position(self):\r\n return self._position","def send_position(self):\r\n return '{},{}'.format(self.x_Pos, self.y_Pos)","def position(self):\n return self.__position","def position(self):\n return self.__position","def position(self):\n return self.__position","def display(self):\n print('\\n' * (self.__y), end='')\n for point in range(self.__height):\n print(' ' * self.__x, end='')\n for point in range(self.__width - 1):\n # print(' ' * self.__x, end='')\n print('#', end='')\n print('#')","def display(self):\n width = self.width\n height = self.height\n x = self.x\n y = self.y\n for d_y in range(y):\n print()\n for h in range(height):\n if x != 0:\n print(\" \" * x, end=\"\")\n print(\"#\" * width)","def display(self):\n row = (' ' * self.__x) + (Rectangle.print_symbol * self.__width) + '\\n'\n print(('\\n' * self.__y) + (row * self.__height), end=\"\")","def GetPosition(self):\n ...","def display(self):\n print(\"\\n\" * self.__y, end=\"\")\n for i in range(self.__height):\n print(\" \" * self.__x, end=\"\")\n print(\"#\" * self.__width, end=\"\")\n print()","def getPosition(self):\n return self.x","def pos(self, x=-1, y=-1):\n self._p('[pos] {} {}'.format(x, y))","def pos(self) -> str:\n return self._pos","def get_aa_pos_on_screen(self,position,frame):\n position=position*3+float(frame)-1\n x,y=self.get_base_pos_on_screen(position)\n y=y+20.0+float(frame)*15.0\n return x,y","def position(self):\n return self.x, self.y","def setPosition(position):","def display(self):\n print(\"\\n\" * self.__y, end='')\n for row in range(self.__height):\n if self.__x:\n print(\" \" * (self.__x), end='')\n if self.__width:\n print(\"#\" * self.__width)","def show_mouse_position_with_px(self):\n self.main_menu_greets_fonts = pygame.font.Font(os.path.join(PATH_TO_RESOURCE, 'font_forever.ttf'), 10)\n self.positiontext(f'Mouse position {pygame.mouse.get_pos()}', (770, 20))\n self.mouse = pygame.mouse.get_pos()\n return self.mouse","def display(self):\n map_show = self.map.copy()\n map_show[self.currY, self.currX] = 4 \n print(map_show)","def position(self):\n return self.properties.get('position')","def pos(self, x, y):\n\n if isinstance(x, float):\n x = int(x)\n\n self.screen.write(colorama.Cursor.POS(x, y), ansi=True)\n self.x = x\n self.y = y\n\n return x, y","def display(self):\n for _jumpline in range(self.y):\n print(end=\"\\n\")\n for _height in range(self.height):\n for _space in range(self.x):\n print(\" \", end=\"\")\n for _width in range(self.width):\n print(\"#\", end=\"\")\n print(end=\"\\n\")","def display(self):\n print('')\n print(\" ---------------------------------\")\n counter = 0\n for row in self.positions:\n counter += 1\n line = f'{counter}: |'\n for space in row:\n if isinstance(space, str):\n line += f' {space} |'\n else:\n starter = ' '\n ender = '|'\n if space.team == 'white':\n piece = stylize(space.symbol+' ', colored.fg(\"light_blue\"))\n else:\n piece = stylize(space.symbol+' ', colored.fg(\"light_red\"))\n line += starter+piece+ender\n print(line)\n print(\" ---------------------------------\")\n print(\" | A | B | C | D | E | F | G | H |\\n\")","def my_print(self):\n if self.__size is not 0:\n for ite in range(self.__position[1]):\n print()\n for ite in range(self.__size):\n print(\" \" * self.__position[0], end=\"\")\n print(\"#\" * self.size)\n else:\n print()","def update_position(position):\n pass","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def position(self):\n return self._position","def get_position(self):\n position = (self.position_x * SPRITE_SIZE, self.position_y * SPRITE_SIZE)\n return position","def get_position(self):\n return self.__position","def show( self):\n def symbol( i):\n return i<0 and (i==-2 and ' ' or '0') or chr(ord('a') + i)\n \n X, Y = np.max( self.board.positions, 0)\n # -2 to indicate outside board.\n display = np.zeros( (X+1,Y+1), dtype=int) - 2 \n for x, y in self.board.positions:\n display[x, y] = -1 # -1 to indicate unoccupied\n for p, i in self.occupation.items():\n x, y = self.board.positions[p]\n display[x, y] = i\n for x in xrange(X+1):\n s = ''.join( [ symbol( display[x, y]) for y in xrange(Y+1) ])\n print s","def display(self):\n print(\"\\n\" * self.y, end=\"\")\n for i in range(self.height):\n print(\" \" * self.x, end=\"\")\n for j in range(self.width):\n print(\"#\", end=\"\")\n print()","def pos(self):\n return self._position","def updateScreenText(self) :\n\t\t# Update the text showing avatar's position\n\t\th = self.avatarNP.getH()\n\t\tif h < -180 : h += 360\n\t\telif h > 180 : h -= 360\n\t\tself.avPos.setText(\"Your location (x, y, dir): (%d, %d, %d)\"%\\\n\t\t\t(self.avatarNP.getX(), self.avatarNP.getY(), h))\n\n\t\t# update text showing visible avatars\n \t\tself.showNumVisible.setText(\"Visible avatars: \" + \\\n\t\t\t\t\t self.updateVisList())","def position(self):\n return self.source.position + self.position_relative","def get_position(self):\n return self._pos","def get_position(self):\n return self._pos","def my_print(self):\n if self.size == 0:\n print(\"\")\n return\n for j in range(self.__position[1]):\n print(\"\")\n for i in range(self.size):\n if self.__position[0] > 0:\n print(\" \" * self.__position[0], end=\"\")\n print('#' * self.size)","def position(self):\n\n\t\treturn self._window.position","def __str__(self):\n return str(\"{0} {1} {2} {3}\".format(self.label, self.position[0], self.position[1], self.position[2]))","def get_base_pos_on_screen(self,position):\n\n return self.seq_xstart+float(position-1)*self.base_scale.get(),self.seq_row","def print_info(self):\n\n print \"parent:\\t {0}\".format(self.parent)\n print \"value:\\t {0}\".format(self.value)\n \n #children\n print \"posXposYposZ: \\t {0}\".format(self.posXposYposZ)\n print \"posXposYnegz: \\t {0}\".format(self.posXposYnegZ)\n print \"posXnegYposZ: \\t {0}\".format(self.posXnegYposZ)\n print \"posXnegYnegZ: \\t {0}\".format(self.posXnegYnegZ)\n print \"negXposYposZ: \\t {0}\".format(self.negXposYposZ)\n print \"negXposYnegZ: \\t {0}\".format(self.negXposYnegZ)\n print \"negXnegYposZ: \\t {0}\".format(self.negXnegYposZ)\n print \"negXnegYnegZ: \\t {0}\".format(self.negXnegYnegZ) \n\n #position in space\n print \"Xupperlimit: \\t {0}\".format(self.Xupperlimit)\n print \"Yupperlimit: \\t {0}\".format(self.Yupperlimit)\n print \"Zupperlimit: \\t {0}\".format(self.Zupperlimit)\n \n print \"Xlowerlimit: \\t {0}\".format(self.Xlowerlimit)\n print \"Ylowerlimit: \\t {0}\".format(self.Ylowerlimit)\n print \"Zlowerlimit: \\t {0}\".format(self.Zlowerlimit)\n\n print \"Xcenter: \\t {0}\".format(self.Xcenter)\n print \"Ycenter: \\t {0}\".format(self.Ycenter)\n print \"Zcenter: \\t {0}\".format(self.Zcenter)","def my_print(self):\n if self.__size > 0:\n print(\"\\n\" * self.__position[1], end=\"\")\n for i in range(self.__size):\n print(\" \" * self.__position[0], end=\"\")\n print(\"#\" * self.__size)\n else:\n print()","def display(self):\n for space in range(self.y):\n print('')\n for row in range(self.height):\n for x in range(self.x):\n print(' ', end='')\n for col in range(self.width):\n print('#', end='')\n print('')","def display(self):\n\n #player UI\n s = \" \"\n for p in range(WIDTH):\n s += str(p)\n s += \" \"\n\n print(s)\n\n for row in range(HEIGHT):\n\n # player UI\n print(row, end=' ')\n\n for col in range(WIDTH):\n\n if self.board[row][col] == 1:\n print(\"X\", end=' ')\n elif self.board[row][col] == 2:\n print(\"O\", end=' ')\n else:\n print(\"-\", end=' ')\n print()","def draw_pos_text(self, text):\n fw, fh = self.font.size(text) # fw: font width, fh: font height\n surface = self.font.render(text, True, (0, 255, 0))\n # // makes integer division in python3\n self.screen.blit(surface, ((self.width - fw) // 2, (self.height - fh) // 2))","def display(self):\n for r in range(len(self.grid)):\n for c in range(len(self.grid[r])):\n if (r, c) == self.location:\n print('\\033[96m*\\x1b[0m', end=' ') # print a blue *\n else:\n print(self.grid[r][c], end=' ') # prints a space or wall\n print()\n print()","def x(self):\r\n return self.position.x","def __repr__(self):\n s = \" position:\" + str(self.pos) + \"\\n\"\n s += \" heading: \" + str(self.heading) + \"\\n\"\n return s","def _get_pos(self):\n return self._pos","def _print(self):\n print('center :', self.center, ' widht : ', self.width, ' height : ', self.height, ' heat : ', self.heat,\n ' speed ', self.speed)","def display(self):\n print(\"\\n\" * self.y, end='')\n for i in range(self.height):\n for j in range(self.width + self.x):\n if j < self.x:\n print(' ', end='')\n else:\n print('#', end='')\n print('')","def position(self):\n if self.p:\n if self._finished:\n return None\n return self.p.get_position()*10","def render(self, **kwargs):\n return print(self.game.agent_positions)","def _repr_(self):\n if self.is_multitape:\n pos = tuple(p for p, t in sorted(self.position, key=lambda x: x[1]))\n return 'multi-tape at %s' % (pos,)\n else:\n return 'tape at %s' % (self.position[0][0],)","def display_player_points():\r\n pass","def show(self, screen):\n x_display = self.xy_position[0] * constants.CELL_SIZE\n y_display = self.xy_position[1] * constants.CELL_SIZE\n screen.blit(self.image, (x_display, y_display))","def getPosition(*args):","def getPosition(*args):","def getPosition(*args):","def getPosition(*args):","def getPosition(*args):"],"string":"[\n \"def position(self):\\r\\n pass\",\n \"def display(self):\\n \\\"\\\"\\\" Coordinates for position are x-axis (LR) and y-axis (NS) \\\"\\\"\\\"\\n for coordY in range(self.y):\\n print()\\n for column in range(self.height):\\n for coordLR in range(self.x):\\n print(\\\" \\\", end=\\\"\\\")\\n for row in range(self.width):\\n print(\\\"#\\\", end=\\\"\\\")\\n print()\",\n \"def display_coordinates(self) -> None:\\n\\n print('Y coordinate: ', self.player.row_position + 1)\\n print('X coordinate: ', self.player.column_position + 1)\",\n \"def get_position(self, position):\",\n \"def positioning(self):\\n pass\",\n \"def show_position(self):\\n self.anc350_instrument.update_all_positions()\\n\\n self.current_positions = self.anc350_instrument.current_positions\\n\\n self.gui.label_actualPositionX.setText(str(self.current_positions['XPiezoStepper']))\\n self.gui.label_actualPositionY.setText(str(self.current_positions['YPiezoStepper']))\\n self.gui.label_actualPositionZ.setText(str(self.current_positions['ZPiezoStepper']))\\n\\n self.gui.scan_positionX.setText(str(self.current_positions['XPiezoScanner']))\\n self.gui.scan_positionY.setText(str(self.current_positions['YPiezoScanner']))\\n self.gui.scan_positionZ.setText(str(self.current_positions['ZPiezoScanner']))\",\n \"def setPosition(self):\\n self.data['pos-x'] = \\\"%s\\\" % self.x()\\n self.data['pos-y'] = \\\"%s\\\" % self.y()\",\n \"def display(self):\\n mg_w = self.width\\n mg_h = self.height\\n str_to_prt = \\\"\\\\n\\\" * self.y + (\\\" \\\" * self.x + \\\"#\\\" * mg_w + '\\\\n') * mg_h\\n print(str_to_prt[:-1])\",\n \"def _pos(self):\\n sw = self.parent.winfo_screenwidth()\\n sh = self.parent.winfo_screenheight()\\n w = sw * 0.8\\n h = sh * 0.8\\n x = (sw - w) / 2\\n y = (sh - h) / 2\\n self.parent.geometry('%dx%d+%d+%d' % (w, h, x, y))\",\n \"def draw_position_label(self):\\n x, y, z = self.player.pos\\n x, y, z = math.floor(x), math.floor(y), math.floor(z)\\n self.label.text = 'FPS: {}, X: {}, Y: {}, Z: {}'.format(round(pyglet.clock.get_fps()), x, y, z)\\n self.label.draw()\",\n \"def printPosition(self, node):\\n self.node = str(node)\\n \\n self.pos_x = self.nodePosition[self.node][0]\\n self.pos_y = self.nodePosition[self.node][1]\\n self.pos_z = self.nodePosition[self.node][2] \\n print \\\"----------------\\\\nPosition of %s\\\\n----------------\\\\nPosition X: %.2f\\\\nPosition Y: %.2f\\\\nPosition Z: %.2f\\\\n\\\" % (self.node, float(self.pos_x), float(self.pos_y), float(self.pos_z))\",\n \"def display(self):\\n prow = self.__width * '#'\\n nstr = self.y * \\\"\\\\n\\\"\\n for x in range(self.__height):\\n nstr += self.x * \\\" \\\"\\n nstr += prow\\n if x == (self.__height - 1):\\n break\\n nstr += \\\"\\\\n\\\"\\n print(nstr)\",\n \"def position(self):\\n return self.__position\",\n \"def my_print(self):\\n length = self.__size\\n\\n if self.__size == 0:\\n print(\\\"\\\")\\n\\n \\\"\\\"\\\"Print using position of y-axis.\\\"\\\"\\\"\\n for i in range(self.__position[1]):\\n print(\\\"\\\")\\n for j in range(length):\\n \\\"\\\"\\\"Print spaces and # in x-axis.\\\"\\\"\\\"\\n print((\\\" \\\" * self.__position[0]) + (\\\"#\\\" * length))\",\n \"def display(self):\\n\\n print(\\\"\\\\n\\\" * self.__y, end='') # y offset\\n\\n for i in range(self.__height):\\n print(\\\" \\\" * self.__x, end='') # x offset\\n print(\\\"#\\\" * self.__width)\",\n \"def __str__(self) -> str:\\n position = self.get_position()\\n return f\\\"Baby at position ({position[0]}, {position[1]}) (row, col)\\\"\",\n \"def display(self):\\n for i in range(self.__y):\\n print()\\n for i in range(self.__height):\\n print(\\\" \\\" * self.__x + \\\"#\\\" * self.__width)\",\n \"def get_pos(self):\\r\\n return self.pos\",\n \"def show_status(self):\\n color = (255, 255, 255)\\n w, h = self.width, self.height\\n x, y = self.pos_shift\\n self.put_text(\\\"scale factor: %.2E\\\" % SCALE_FACTOR,\\n color, (x, y))\\n self.put_text(\\\"G: %.7E\\\" % G,\\n color, (x, y + 25))\\n self.put_text(\\\"number of objects: %d\\\" % len(self.phy.objects),\\n color, (x, y + 50))\\n self.put_text(\\\"x: %d\\\" % x,\\n color, (w + x - 100, h + y - 50))\\n self.put_text(\\\"y: %d\\\" % y,\\n color, (w + x - 100, h + y - 25))\",\n \"def cmd_position(self, n, e, d, heading):\\n pass\",\n \"def position(self):\\n return self._position\",\n \"def print_position(position):\\n print('Packet Number # %s' % position)\",\n \"def position(self):\\n return (self.__position)\",\n \"def get_position(self):\\n return self.position\",\n \"def get_position(self):\\n return self.position\",\n \"def display(self):\\n for b in range(self.y):\\n print()\\n for i in range(self.height):\\n print(\\\" \\\" * self.x + \\\"#\\\" * self.width)\",\n \"def get_pos(self):\\n return self.pos\",\n \"def get_position(self):\\n raise NotImplementedError()\",\n \"def print_pos(pos):\\n # TO DO: EXCLUDE FIRST LINE\\n s = \\\"%BLOCK POSITIONS_FRAC\\\\n\\\" + str(pos) + \\\"\\\\n%ENDBLOCK POSITIONS_FRAC\\\"\\n return s\",\n \"def __str__(self):\\r\\n x, y, z = self.pos\\r\\n return self.label + f\\\" {x} {y} {z}\\\"\",\n \"def position(self):\\r\\n return self._position\",\n \"def send_position(self):\\r\\n return '{},{}'.format(self.x_Pos, self.y_Pos)\",\n \"def position(self):\\n return self.__position\",\n \"def position(self):\\n return self.__position\",\n \"def position(self):\\n return self.__position\",\n \"def display(self):\\n print('\\\\n' * (self.__y), end='')\\n for point in range(self.__height):\\n print(' ' * self.__x, end='')\\n for point in range(self.__width - 1):\\n # print(' ' * self.__x, end='')\\n print('#', end='')\\n print('#')\",\n \"def display(self):\\n width = self.width\\n height = self.height\\n x = self.x\\n y = self.y\\n for d_y in range(y):\\n print()\\n for h in range(height):\\n if x != 0:\\n print(\\\" \\\" * x, end=\\\"\\\")\\n print(\\\"#\\\" * width)\",\n \"def display(self):\\n row = (' ' * self.__x) + (Rectangle.print_symbol * self.__width) + '\\\\n'\\n print(('\\\\n' * self.__y) + (row * self.__height), end=\\\"\\\")\",\n \"def GetPosition(self):\\n ...\",\n \"def display(self):\\n print(\\\"\\\\n\\\" * self.__y, end=\\\"\\\")\\n for i in range(self.__height):\\n print(\\\" \\\" * self.__x, end=\\\"\\\")\\n print(\\\"#\\\" * self.__width, end=\\\"\\\")\\n print()\",\n \"def getPosition(self):\\n return self.x\",\n \"def pos(self, x=-1, y=-1):\\n self._p('[pos] {} {}'.format(x, y))\",\n \"def pos(self) -> str:\\n return self._pos\",\n \"def get_aa_pos_on_screen(self,position,frame):\\n position=position*3+float(frame)-1\\n x,y=self.get_base_pos_on_screen(position)\\n y=y+20.0+float(frame)*15.0\\n return x,y\",\n \"def position(self):\\n return self.x, self.y\",\n \"def setPosition(position):\",\n \"def display(self):\\n print(\\\"\\\\n\\\" * self.__y, end='')\\n for row in range(self.__height):\\n if self.__x:\\n print(\\\" \\\" * (self.__x), end='')\\n if self.__width:\\n print(\\\"#\\\" * self.__width)\",\n \"def show_mouse_position_with_px(self):\\n self.main_menu_greets_fonts = pygame.font.Font(os.path.join(PATH_TO_RESOURCE, 'font_forever.ttf'), 10)\\n self.positiontext(f'Mouse position {pygame.mouse.get_pos()}', (770, 20))\\n self.mouse = pygame.mouse.get_pos()\\n return self.mouse\",\n \"def display(self):\\n map_show = self.map.copy()\\n map_show[self.currY, self.currX] = 4 \\n print(map_show)\",\n \"def position(self):\\n return self.properties.get('position')\",\n \"def pos(self, x, y):\\n\\n if isinstance(x, float):\\n x = int(x)\\n\\n self.screen.write(colorama.Cursor.POS(x, y), ansi=True)\\n self.x = x\\n self.y = y\\n\\n return x, y\",\n \"def display(self):\\n for _jumpline in range(self.y):\\n print(end=\\\"\\\\n\\\")\\n for _height in range(self.height):\\n for _space in range(self.x):\\n print(\\\" \\\", end=\\\"\\\")\\n for _width in range(self.width):\\n print(\\\"#\\\", end=\\\"\\\")\\n print(end=\\\"\\\\n\\\")\",\n \"def display(self):\\n print('')\\n print(\\\" ---------------------------------\\\")\\n counter = 0\\n for row in self.positions:\\n counter += 1\\n line = f'{counter}: |'\\n for space in row:\\n if isinstance(space, str):\\n line += f' {space} |'\\n else:\\n starter = ' '\\n ender = '|'\\n if space.team == 'white':\\n piece = stylize(space.symbol+' ', colored.fg(\\\"light_blue\\\"))\\n else:\\n piece = stylize(space.symbol+' ', colored.fg(\\\"light_red\\\"))\\n line += starter+piece+ender\\n print(line)\\n print(\\\" ---------------------------------\\\")\\n print(\\\" | A | B | C | D | E | F | G | H |\\\\n\\\")\",\n \"def my_print(self):\\n if self.__size is not 0:\\n for ite in range(self.__position[1]):\\n print()\\n for ite in range(self.__size):\\n print(\\\" \\\" * self.__position[0], end=\\\"\\\")\\n print(\\\"#\\\" * self.size)\\n else:\\n print()\",\n \"def update_position(position):\\n pass\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def position(self):\\n return self._position\",\n \"def get_position(self):\\n position = (self.position_x * SPRITE_SIZE, self.position_y * SPRITE_SIZE)\\n return position\",\n \"def get_position(self):\\n return self.__position\",\n \"def show( self):\\n def symbol( i):\\n return i<0 and (i==-2 and ' ' or '0') or chr(ord('a') + i)\\n \\n X, Y = np.max( self.board.positions, 0)\\n # -2 to indicate outside board.\\n display = np.zeros( (X+1,Y+1), dtype=int) - 2 \\n for x, y in self.board.positions:\\n display[x, y] = -1 # -1 to indicate unoccupied\\n for p, i in self.occupation.items():\\n x, y = self.board.positions[p]\\n display[x, y] = i\\n for x in xrange(X+1):\\n s = ''.join( [ symbol( display[x, y]) for y in xrange(Y+1) ])\\n print s\",\n \"def display(self):\\n print(\\\"\\\\n\\\" * self.y, end=\\\"\\\")\\n for i in range(self.height):\\n print(\\\" \\\" * self.x, end=\\\"\\\")\\n for j in range(self.width):\\n print(\\\"#\\\", end=\\\"\\\")\\n print()\",\n \"def pos(self):\\n return self._position\",\n \"def updateScreenText(self) :\\n\\t\\t# Update the text showing avatar's position\\n\\t\\th = self.avatarNP.getH()\\n\\t\\tif h < -180 : h += 360\\n\\t\\telif h > 180 : h -= 360\\n\\t\\tself.avPos.setText(\\\"Your location (x, y, dir): (%d, %d, %d)\\\"%\\\\\\n\\t\\t\\t(self.avatarNP.getX(), self.avatarNP.getY(), h))\\n\\n\\t\\t# update text showing visible avatars\\n \\t\\tself.showNumVisible.setText(\\\"Visible avatars: \\\" + \\\\\\n\\t\\t\\t\\t\\t self.updateVisList())\",\n \"def position(self):\\n return self.source.position + self.position_relative\",\n \"def get_position(self):\\n return self._pos\",\n \"def get_position(self):\\n return self._pos\",\n \"def my_print(self):\\n if self.size == 0:\\n print(\\\"\\\")\\n return\\n for j in range(self.__position[1]):\\n print(\\\"\\\")\\n for i in range(self.size):\\n if self.__position[0] > 0:\\n print(\\\" \\\" * self.__position[0], end=\\\"\\\")\\n print('#' * self.size)\",\n \"def position(self):\\n\\n\\t\\treturn self._window.position\",\n \"def __str__(self):\\n return str(\\\"{0} {1} {2} {3}\\\".format(self.label, self.position[0], self.position[1], self.position[2]))\",\n \"def get_base_pos_on_screen(self,position):\\n\\n return self.seq_xstart+float(position-1)*self.base_scale.get(),self.seq_row\",\n \"def print_info(self):\\n\\n print \\\"parent:\\\\t {0}\\\".format(self.parent)\\n print \\\"value:\\\\t {0}\\\".format(self.value)\\n \\n #children\\n print \\\"posXposYposZ: \\\\t {0}\\\".format(self.posXposYposZ)\\n print \\\"posXposYnegz: \\\\t {0}\\\".format(self.posXposYnegZ)\\n print \\\"posXnegYposZ: \\\\t {0}\\\".format(self.posXnegYposZ)\\n print \\\"posXnegYnegZ: \\\\t {0}\\\".format(self.posXnegYnegZ)\\n print \\\"negXposYposZ: \\\\t {0}\\\".format(self.negXposYposZ)\\n print \\\"negXposYnegZ: \\\\t {0}\\\".format(self.negXposYnegZ)\\n print \\\"negXnegYposZ: \\\\t {0}\\\".format(self.negXnegYposZ)\\n print \\\"negXnegYnegZ: \\\\t {0}\\\".format(self.negXnegYnegZ) \\n\\n #position in space\\n print \\\"Xupperlimit: \\\\t {0}\\\".format(self.Xupperlimit)\\n print \\\"Yupperlimit: \\\\t {0}\\\".format(self.Yupperlimit)\\n print \\\"Zupperlimit: \\\\t {0}\\\".format(self.Zupperlimit)\\n \\n print \\\"Xlowerlimit: \\\\t {0}\\\".format(self.Xlowerlimit)\\n print \\\"Ylowerlimit: \\\\t {0}\\\".format(self.Ylowerlimit)\\n print \\\"Zlowerlimit: \\\\t {0}\\\".format(self.Zlowerlimit)\\n\\n print \\\"Xcenter: \\\\t {0}\\\".format(self.Xcenter)\\n print \\\"Ycenter: \\\\t {0}\\\".format(self.Ycenter)\\n print \\\"Zcenter: \\\\t {0}\\\".format(self.Zcenter)\",\n \"def my_print(self):\\n if self.__size > 0:\\n print(\\\"\\\\n\\\" * self.__position[1], end=\\\"\\\")\\n for i in range(self.__size):\\n print(\\\" \\\" * self.__position[0], end=\\\"\\\")\\n print(\\\"#\\\" * self.__size)\\n else:\\n print()\",\n \"def display(self):\\n for space in range(self.y):\\n print('')\\n for row in range(self.height):\\n for x in range(self.x):\\n print(' ', end='')\\n for col in range(self.width):\\n print('#', end='')\\n print('')\",\n \"def display(self):\\n\\n #player UI\\n s = \\\" \\\"\\n for p in range(WIDTH):\\n s += str(p)\\n s += \\\" \\\"\\n\\n print(s)\\n\\n for row in range(HEIGHT):\\n\\n # player UI\\n print(row, end=' ')\\n\\n for col in range(WIDTH):\\n\\n if self.board[row][col] == 1:\\n print(\\\"X\\\", end=' ')\\n elif self.board[row][col] == 2:\\n print(\\\"O\\\", end=' ')\\n else:\\n print(\\\"-\\\", end=' ')\\n print()\",\n \"def draw_pos_text(self, text):\\n fw, fh = self.font.size(text) # fw: font width, fh: font height\\n surface = self.font.render(text, True, (0, 255, 0))\\n # // makes integer division in python3\\n self.screen.blit(surface, ((self.width - fw) // 2, (self.height - fh) // 2))\",\n \"def display(self):\\n for r in range(len(self.grid)):\\n for c in range(len(self.grid[r])):\\n if (r, c) == self.location:\\n print('\\\\033[96m*\\\\x1b[0m', end=' ') # print a blue *\\n else:\\n print(self.grid[r][c], end=' ') # prints a space or wall\\n print()\\n print()\",\n \"def x(self):\\r\\n return self.position.x\",\n \"def __repr__(self):\\n s = \\\" position:\\\" + str(self.pos) + \\\"\\\\n\\\"\\n s += \\\" heading: \\\" + str(self.heading) + \\\"\\\\n\\\"\\n return s\",\n \"def _get_pos(self):\\n return self._pos\",\n \"def _print(self):\\n print('center :', self.center, ' widht : ', self.width, ' height : ', self.height, ' heat : ', self.heat,\\n ' speed ', self.speed)\",\n \"def display(self):\\n print(\\\"\\\\n\\\" * self.y, end='')\\n for i in range(self.height):\\n for j in range(self.width + self.x):\\n if j < self.x:\\n print(' ', end='')\\n else:\\n print('#', end='')\\n print('')\",\n \"def position(self):\\n if self.p:\\n if self._finished:\\n return None\\n return self.p.get_position()*10\",\n \"def render(self, **kwargs):\\n return print(self.game.agent_positions)\",\n \"def _repr_(self):\\n if self.is_multitape:\\n pos = tuple(p for p, t in sorted(self.position, key=lambda x: x[1]))\\n return 'multi-tape at %s' % (pos,)\\n else:\\n return 'tape at %s' % (self.position[0][0],)\",\n \"def display_player_points():\\r\\n pass\",\n \"def show(self, screen):\\n x_display = self.xy_position[0] * constants.CELL_SIZE\\n y_display = self.xy_position[1] * constants.CELL_SIZE\\n screen.blit(self.image, (x_display, y_display))\",\n \"def getPosition(*args):\",\n \"def getPosition(*args):\",\n \"def getPosition(*args):\",\n \"def getPosition(*args):\",\n \"def getPosition(*args):\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7464939","0.7350452","0.7230497","0.71928203","0.7168089","0.71171767","0.6995238","0.6969509","0.6844631","0.68162245","0.6798185","0.6786135","0.665452","0.6650976","0.66377974","0.66324097","0.6619713","0.66189533","0.6613451","0.6598675","0.65528977","0.6537376","0.65082747","0.64998335","0.64998335","0.64962435","0.6449015","0.644721","0.64445615","0.6430174","0.6427575","0.6423468","0.6423391","0.6423391","0.6423391","0.6422447","0.6422315","0.6421346","0.6417551","0.6393669","0.6389788","0.6381125","0.6378031","0.63752234","0.6336609","0.6324888","0.6320327","0.63165134","0.6311758","0.63042736","0.63007814","0.629824","0.6288609","0.6285713","0.62814677","0.6281119","0.6281119","0.6281119","0.6281119","0.6281119","0.6281119","0.6281119","0.6281119","0.6281119","0.6281119","0.6281119","0.6281119","0.628028","0.6264021","0.62582684","0.6254786","0.62465906","0.6230786","0.62282485","0.62277746","0.62277746","0.62233216","0.62222004","0.6220652","0.6219756","0.62193096","0.6209869","0.62092936","0.6208698","0.62008286","0.6199561","0.6197475","0.6196163","0.6192391","0.61830014","0.6179132","0.6178247","0.61711055","0.6157396","0.61521596","0.61519516","0.61495537","0.61495537","0.61495537","0.61495537","0.61495537"],"string":"[\n \"0.7464939\",\n \"0.7350452\",\n \"0.7230497\",\n \"0.71928203\",\n \"0.7168089\",\n \"0.71171767\",\n \"0.6995238\",\n \"0.6969509\",\n \"0.6844631\",\n \"0.68162245\",\n \"0.6798185\",\n \"0.6786135\",\n \"0.665452\",\n \"0.6650976\",\n \"0.66377974\",\n \"0.66324097\",\n \"0.6619713\",\n \"0.66189533\",\n \"0.6613451\",\n \"0.6598675\",\n \"0.65528977\",\n \"0.6537376\",\n \"0.65082747\",\n \"0.64998335\",\n \"0.64998335\",\n \"0.64962435\",\n \"0.6449015\",\n \"0.644721\",\n \"0.64445615\",\n \"0.6430174\",\n \"0.6427575\",\n \"0.6423468\",\n \"0.6423391\",\n \"0.6423391\",\n \"0.6423391\",\n \"0.6422447\",\n \"0.6422315\",\n \"0.6421346\",\n \"0.6417551\",\n \"0.6393669\",\n \"0.6389788\",\n \"0.6381125\",\n \"0.6378031\",\n \"0.63752234\",\n \"0.6336609\",\n \"0.6324888\",\n \"0.6320327\",\n \"0.63165134\",\n \"0.6311758\",\n \"0.63042736\",\n \"0.63007814\",\n \"0.629824\",\n \"0.6288609\",\n \"0.6285713\",\n \"0.62814677\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.6281119\",\n \"0.628028\",\n \"0.6264021\",\n \"0.62582684\",\n \"0.6254786\",\n \"0.62465906\",\n \"0.6230786\",\n \"0.62282485\",\n \"0.62277746\",\n \"0.62277746\",\n \"0.62233216\",\n \"0.62222004\",\n \"0.6220652\",\n \"0.6219756\",\n \"0.62193096\",\n \"0.6209869\",\n \"0.62092936\",\n \"0.6208698\",\n \"0.62008286\",\n \"0.6199561\",\n \"0.6197475\",\n \"0.6196163\",\n \"0.6192391\",\n \"0.61830014\",\n \"0.6179132\",\n \"0.6178247\",\n \"0.61711055\",\n \"0.6157396\",\n \"0.61521596\",\n \"0.61519516\",\n \"0.61495537\",\n \"0.61495537\",\n \"0.61495537\",\n \"0.61495537\",\n \"0.61495537\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94783,"cells":{"query":{"kind":"string","value":"Returns a tuple of position in (x,y) form."},"document":{"kind":"string","value":"def get(self):\n return (self.x,self.y);"},"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_position(self) -> typing.Tuple[int, int]:\n raise NotImplementedError","def get_pos(self):\n return (self.x, self.y)","def position(self) -> Tuple[int, int]:\n return self.row, self.col","def get_position(self):\n return (self.x_pos, self.y_pos)","def get_pos(self) -> tuple:\n return self.pos","def coordinates(self) -> Tuple[int, int]:\n return self.x, self.y","def get_position(self) -> Tuple[int]:\n return self.position.copy()","def getPosition(self):\n\tleft = self.getLeft()\n\ttop = self.getTop()\n\treturn (left,top)","def position_tuple_for_index(self, index):\n x = self.base_values[index % self.size]\n y = self.base_values[index // self.size]\n return x, y","def xy(self) -> Tuple[int, int]:\n return self._x, self._y","def xy(self) -> Tuple[float, float]:\n return (self.x, self.y)","def coordinates(self) -> Tuple[float, float, float, float, float]:\n return (self.x, self.y, self.x + self.width, self.y + self.height)","def position(self):\n return self.x, self.y","def getIntPos(self):\n return (int(self.pos[0]),int(self.pos[1]))","def get_position_coords(cls):\n row = math.floor(cls.position / cls.size)\n col = cls.position - row * cls.size\n return row, col","def position(self):\n return self._x, self._y","def get_current_position(self) -> Tuple[int, int]:\n return self.__row_position, self.__col_position","def coordinate(self) -> Tuple[float, float]:\n return self.lat, self.lon","def get_coords(self) -> Tuple[int]:\r\n return self.file, self.rank","def get_pos(x, y):\r\n return normalize(x) // 2, normalize(y) // 4","def coord (i, j):\r\n return j, i","def position(self):\n return (self.__position)","def index_from_position_tuple(self, position):\n x = self.base_values.index(position[0])\n y = self.base_values.index(position[1])\n return y * self.size + x","def get_pick_position(self):\n x0 = int(self.GetPickX1())\n x1 = int(self.GetPickX2())\n y0 = int(self.GetPickY1())\n y1 = int(self.GetPickY2())\n return x0, y0, x1, y1","def position(square):\n first = square[0]\n second = square[1]\n col = parseCol(first)\n row = parseRow(second)\n return (row, col)","def getTuple(self):\n return self.position.exportToTuple()","def to_position(self, x, y, i, j):\n return (x * self.SIZE + i, y * self.SIZE + j)","def get(self):\r\n return ((self.x, self.y), self.dir)","def getXY(self):\n return (self.X,self.Y)","def coords(self) -> Tuple[float, float]:\n return self.lat, self.lng","def tuple(self) -> Tuple[float, float]:\n return (self.latitude, self.longitude)","def make_position(data) -> Position:\n return (data[\"x\"], data[\"y\"])","def value(self) -> tuple:\n return self._position","def getCoord(self, i):\n _x = self.__xpts[i]\n _y = self.__ypts[i]\n return _x, _y","def pixelcoord(coordx: float, coordy: float) -> Tuple[int, int]:\n ox, oy = origin()\n x, y = int(round(ox+coordx)), int(round(oy-coordy))\n return (x, y)","def coordinate(self):\n\t\tif self.boldness_coord is None and self.price_coord is None and self.hold_coord is None:\n\t\t\treturn None\n\n\t\treturn (self.boldness_coord, self.price_coord, self.hold_coord)","def get_pos(self, cx, cy):\n x = self.min_x + cx*(self.size+0.5)\n y = self.min_y + cy*(self.size+0.5)\n return (x,y)","def get_location(self):\r\n return self.__x, self.__y","def cursor_coordinates(self):\n text = self.getText()\n lines = text.split(\"\\n\")\n pos = self.getCursorPos()\n if pos == 0:\n return (0, 0)\n i = 0\n cursor_row = -1\n cursor_col = -1\n for row, line in enumerate(lines):\n i += len(line) + 1 # we need to include \"\\n\"\n if pos < i:\n cursor_row = row\n cursor_col = pos - i + len(line) + 1\n break\n return (cursor_col, cursor_row)","def get_xy_position(row, col):\n spacing_x = 86 + 11\n spacing_y = 98 + 8\n top_y = 50\n left_x = 50\n return left_x + col * spacing_x, top_y + row * spacing_y","def get_pos(self):\n return (self.x/3, 3**0.5*self.y/3, self.r/3)","def getBallPos(self) -> (int,int):\n return self.x, self.y","def get_coordinates(num: int) -> tuple:\r\n return num * math.sin(num), num * math.cos(num)","def get_position(self):\n return [self._row, self._column]","def restored_position(self) -> Tuple[int, int]:\n x_n, y_n = self.normalized_position\n w, h = self.region.original_size\n return int(x_n * w), int(y_n * h)","def restored_position(self) -> Tuple[int, int]:\n x_n, y_n = self.normalized_position\n w, h = self.region.original_size\n return int(x_n * w), int(y_n * h)","def mouse_position(pos):\n x, y = pos\n m = x // SQUARE_SIZE\n n = y // SQUARE_SIZE\n return n, m","def local_coordinates(self, position: np.ndarray) -> Tuple[float, float]:\n raise NotImplementedError()","def coords2D(self):\n return (self.x, self.y)","def get_position(self, position):","def HTSeq_pos_to_tuple(HTSeq_pos):\n try:\n chrom = HTSeq_pos.chrom\n except AttributeError:\n raise MutantError(\"Invalid position %s! Need an HTSeq iv object. (If empty, maybe read wasn't aligned?)\"%(HTSeq_pos,))\n strand = HTSeq_pos.strand\n # HTSeq is 0-based and I want 1-based, thus the +1; end has no +1 because in HTSeq end is the base AFTER the alignment.\n start_pos = HTSeq_pos.start+1\n end_pos = HTSeq_pos.end\n output_pos = (chrom, start_pos, end_pos, strand)\n check_valid_position_tuple(output_pos)\n return output_pos","def to_tuple(self):\n return (self.row_start, self.row_end, self.col_start, self.col_end)","def get_frame_coordinates(self, i: int) -> Tuple[Tuple[int]]:\n return (self.get_frame_x(i), self.get_frame_y(i))","def getPos(self):\n return self.Xpos,self.Ypos","def get_point(self):\n return self._x, self._y","def coords(self):\n return (self.x, self.y, self.z)","def coords(self):\n return (self.x, self.y, self.z)","def last_pos(self) -> tuple[int, int]:\n if not self.actions:\n return (self.start_x, self.start_y)\n else:\n box = self.get_hitbox_at(self.time_consumed)\n return box.pos_x, box.pos_y","def ind(self, pos):\n row = int(pos[1:]) - 1\n column = self.letter_to_column(pos[0])\n return row, column","def ind(self, pos):\n row = int(pos[1:]) - 1\n column = self.letter_to_column(pos[0])\n return row, column","def ind(self, pos):\n row = int(pos[1:]) - 1\n column = self.letter_to_column(pos[0])\n return row, column","def get_pos(self) -> tuple:\n return self.rect.center","def relative_position(self) -> Tuple[int, int]:\n return self.position[0] - self.region.rect.x, self.position[1] - self.region.rect.y","def relative_position(self) -> Tuple[int, int]:\n return self.position[0] - self.region.rect.x, self.position[1] - self.region.rect.y","def get_position(self):\n return parsegeometry(self.geometry())[2:]","def get_position(self, cell) -> tuple:\n for i, row in enumerate(self.cells):\n if cell in row:\n return row.index(cell), i\n if not isinstance(cell, Cell):\n raise TypeError(f\"Argument should be of type 'Cell', not '{cell.__class__.__name__}'.\")\n raise ValueError(\"The given cell is not a part of the grid.\")","def _coord(self, x, y):\n gridEdge = 7 # originally 5\n y = gridEdge - y\n cx = 100 * (x - 1) + 50\n cy = 100 * (y - 1) + 50\n r = 20\n return (cx - r, cy - r, cx + r, cy + r)","def coordinates(self, xy_pairs=False):\n\n if xy_pairs:\n return tuple(zip(self._coordinates[:-1:2], self._coordinates[1::2]))\n else:\n return tuple(self._coordinates)","def coordinates(self, xy_pairs=False):\n\n if xy_pairs:\n return tuple(zip(self._coordinates[:-1:2], self._coordinates[1::2]))\n else:\n return tuple(self._coordinates)","def get_pos(self):\n return [self.row, self.col]","def pixel_coords_to_pos(i, j, maze_size):\n maze_border = ((maze_size - 1) // 2) * BLOCK_PIXEL_SIZE\n pos_x = (i + maze_border) // BLOCK_PIXEL_SIZE\n pos_y = (maze_border - j) // BLOCK_PIXEL_SIZE\n\n return int(pos_x), int(pos_y)","def getPosition(self):\n return self.x","def get_position_on_game(self):\n return (self.peg, self.position_on_peg)","def handle_position(data: bytes) -> Tuple[bytes, str]:\n x, y, z = struct.unpack('fff', data[0:3 * 4])\n return data[20:], f'Current Position (x,y,z): {x} {y} {z}'","def get_xy_position(gcode_command):\n\tpattern = re.compile(r\"^G\\dX(\\d+(?:\\.\\d*)?|\\.\\d+)Y(\\d+(?:\\.\\d*)?|\\.\\d+)F(\\d+)$\") # using non-capturing groups\n\tm = pattern.match(gcode_command) # no need for re.search() because we have a complete pattern\n\t(x, y) = m.group(1,2)\n\ttry:\n\t\tx = float(x)\n\t\ty = float(y)\n\texcept:\n\t\traise Exception(\"Could not convert X and Y to floats. X={}, Y={}\".format(x,y))\n\tx_pixel = round(x/X_STEP) # round to nearest int\n\ty_pixel = round(y/Y_STEP*12)\n\treturn (x_pixel, y_pixel)","def point2pos(self, point):\n row = self._vim.eval('byte2line({})'.format(point))\n col = self._vim.eval('{} - line2byte({})'.format(point, row))\n return (int(row), int(col))","def getCoords(self):\n if self._ra == \"\" or self._dec == \"\":\n raise ValueError('Object named ' + self._name +' has no coordinates in database.')\n ra = self._ra.split(\":\")\n dec = self._dec.split(\":\")\n raTuple = (int(ra[0]), int(ra[1]), float(ra[2]))\n decTuple = (dec[0][0], int(dec[0][1:]), int(dec[1]), float(dec[2]))\n return raTuple, decTuple","def to_coords(self, px, py):\n if px not in range(self.SIZE**2) or py not in range(self.SIZE**2):\n raise IndexError\n return (px // self.SIZE, py // self.SIZE,\n px % self.SIZE, py % self.SIZE)","def getMousePosition(self):\n return (self.mouseData.x, self.mouseData.y)","def get_position(self, row, column):\n position_key = \"{}{}\".format(row, column)\n return self.positions[position_key]","def player_location(self):\n x = 0\n y = 0\n for line in self.grid:\n for i in line:\n if i == \"P\":\n return x, y\n \n y+=1\n x += 1\n y = 0","def get_position(self):\n position = (self.position_x * SPRITE_SIZE, self.position_y * SPRITE_SIZE)\n return position","def GetPosition(board):\n\tfor i in range(len(board.matrix)):\n\t\tfor j in range(len(board.matrix[i])):\n\t\t\tif board.matrix[i][j]==\"X\":\n\t\t\t\treturn i,j","def __get_position(self, value, state):\n coords = np.argwhere(state == value).flatten()\n return coords","def ind2coord(self, index):\n\n # assert (index >= 0)\n # assert(index < self.n - 1)\n\n col = index // self.rows\n row = index % self.rows\n\n return [row, col]","def get_coords(self):\n xTK = int(jeu.coords(self.rectangle)[0]) # Coordonnées TKinter x1 et y1 du rectangle correspondant à la voiture\n yTK = int(jeu.coords(self.rectangle)[1])\n # On divise par la largeur d'une case et on renvoie les valeurs obtenues sous la forme d'un tuple\n X = xTK//100\n Y = yTK//100\n resultat = [X, Y]\n return resultat","def get_location(self) -> tuple:\r\n if self.data is None:\r\n return (None, None)\r\n \r\n lat = self.data['GPSInfo']['GPSLatitude']\r\n lon = self.data['GPSInfo']['GPSLongitude']\r\n \r\n # Convert from Degrees, minutes, seconds to standard form\r\n latitude = (lat[0][0] / lat[0][1]) \\\r\n + (lat[1][0] / lat[1][1] / 60) \\\r\n + (lat[2][0] / lat[2][1] / 3600)\r\n \r\n longitude = (lon[0][0] / lon[0][1]) \\\r\n + (lon[1][0] / lon[1][1] / 60) \\\r\n + (lon[2][0] / lon[2][1] / 3600)\r\n\r\n # Adjust for direction references\r\n if self.data['GPSInfo']['GPSLatitudeRef'] == 'S':\r\n latitude *= -1\r\n\r\n if self.data['GPSInfo']['GPSLongitudeRef'] == 'W':\r\n longitude *= -1\r\n\r\n return (round(latitude, 6), round(longitude, 6))","def element_coordinates(self, element):\n out = (0,0,0,0)\n if 'title' in element.attrib:\n matches = self.boxPattern.search(element.attrib['title'])\n if matches:\n coords = matches.group(1).split()\n out = (int(coords[0]),int(coords[1]),int(coords[2]),int(coords[3]))\n return out","def get_xy(self, x, y):\r\n\t\treturn self.grid[y, x]","def position(self, x, y):\n if self.portrait:\n # HMSB\n index = (x + y * self.size[0]) >> 3\n offset = 7 - (x & 0x07)\n else:\n # VMSB\n index = (y >> 3) * self.size[0] + x\n offset = 7 - (y & 0x07)\n return index, offset","def cursorPosGL(self):\n globalPos = QtGui.QCursor.pos()\n pos = self.mapFromGlobal(globalPos)\n y = self.size().height() - pos.y()\n return pos.x(), y","def cursorPosGL(self):\n globalPos = QtGui.QCursor.pos()\n pos = self.mapFromGlobal(globalPos)\n y = self.size().height() - pos.y()\n return pos.x(), y","def index_to_position(self, index):\n col = index % self._grid_size\n row = index // self._grid_size\n return row, col","def pixel_to_position(self, pixel):\n x, y = pixel\n return y // 60, x // 60","def position_tuples(self, protein=False):\n if protein:\n if not self.is_coding():\n raise AttributeError(\n \"Cannot return wild type protein \"\n \"position tuples for non-coding wild \"\n \"type [{}]\".format(self.parent_name)\n )\n else:\n seq = self.protein_seq\n offset = self.protein_offset\n else:\n seq = self.dna_seq\n offset = self.dna_offset\n\n return [(i + offset + 1, seq[i]) for i in range(len(seq))]","def get_position(self):\n return self._find_gnx_node(self.gnx)","def getPosition(self):\n return self.target, min(self.points), max(self.points)","def _get_coordinates(self, tile, position=None):\n if not position:\n position = self.position\n\n for i in range(self.PUZZLE_NUM_ROWS):\n for j in range(self.PUZZLE_NUM_COLUMNS):\n if position[i][j] == tile:\n return i, j\n\n return RuntimeError('Invalid tile value')","def position(self):\n return self._position","def get(self):\n return self.x, self.y"],"string":"[\n \"def get_position(self) -> typing.Tuple[int, int]:\\n raise NotImplementedError\",\n \"def get_pos(self):\\n return (self.x, self.y)\",\n \"def position(self) -> Tuple[int, int]:\\n return self.row, self.col\",\n \"def get_position(self):\\n return (self.x_pos, self.y_pos)\",\n \"def get_pos(self) -> tuple:\\n return self.pos\",\n \"def coordinates(self) -> Tuple[int, int]:\\n return self.x, self.y\",\n \"def get_position(self) -> Tuple[int]:\\n return self.position.copy()\",\n \"def getPosition(self):\\n\\tleft = self.getLeft()\\n\\ttop = self.getTop()\\n\\treturn (left,top)\",\n \"def position_tuple_for_index(self, index):\\n x = self.base_values[index % self.size]\\n y = self.base_values[index // self.size]\\n return x, y\",\n \"def xy(self) -> Tuple[int, int]:\\n return self._x, self._y\",\n \"def xy(self) -> Tuple[float, float]:\\n return (self.x, self.y)\",\n \"def coordinates(self) -> Tuple[float, float, float, float, float]:\\n return (self.x, self.y, self.x + self.width, self.y + self.height)\",\n \"def position(self):\\n return self.x, self.y\",\n \"def getIntPos(self):\\n return (int(self.pos[0]),int(self.pos[1]))\",\n \"def get_position_coords(cls):\\n row = math.floor(cls.position / cls.size)\\n col = cls.position - row * cls.size\\n return row, col\",\n \"def position(self):\\n return self._x, self._y\",\n \"def get_current_position(self) -> Tuple[int, int]:\\n return self.__row_position, self.__col_position\",\n \"def coordinate(self) -> Tuple[float, float]:\\n return self.lat, self.lon\",\n \"def get_coords(self) -> Tuple[int]:\\r\\n return self.file, self.rank\",\n \"def get_pos(x, y):\\r\\n return normalize(x) // 2, normalize(y) // 4\",\n \"def coord (i, j):\\r\\n return j, i\",\n \"def position(self):\\n return (self.__position)\",\n \"def index_from_position_tuple(self, position):\\n x = self.base_values.index(position[0])\\n y = self.base_values.index(position[1])\\n return y * self.size + x\",\n \"def get_pick_position(self):\\n x0 = int(self.GetPickX1())\\n x1 = int(self.GetPickX2())\\n y0 = int(self.GetPickY1())\\n y1 = int(self.GetPickY2())\\n return x0, y0, x1, y1\",\n \"def position(square):\\n first = square[0]\\n second = square[1]\\n col = parseCol(first)\\n row = parseRow(second)\\n return (row, col)\",\n \"def getTuple(self):\\n return self.position.exportToTuple()\",\n \"def to_position(self, x, y, i, j):\\n return (x * self.SIZE + i, y * self.SIZE + j)\",\n \"def get(self):\\r\\n return ((self.x, self.y), self.dir)\",\n \"def getXY(self):\\n return (self.X,self.Y)\",\n \"def coords(self) -> Tuple[float, float]:\\n return self.lat, self.lng\",\n \"def tuple(self) -> Tuple[float, float]:\\n return (self.latitude, self.longitude)\",\n \"def make_position(data) -> Position:\\n return (data[\\\"x\\\"], data[\\\"y\\\"])\",\n \"def value(self) -> tuple:\\n return self._position\",\n \"def getCoord(self, i):\\n _x = self.__xpts[i]\\n _y = self.__ypts[i]\\n return _x, _y\",\n \"def pixelcoord(coordx: float, coordy: float) -> Tuple[int, int]:\\n ox, oy = origin()\\n x, y = int(round(ox+coordx)), int(round(oy-coordy))\\n return (x, y)\",\n \"def coordinate(self):\\n\\t\\tif self.boldness_coord is None and self.price_coord is None and self.hold_coord is None:\\n\\t\\t\\treturn None\\n\\n\\t\\treturn (self.boldness_coord, self.price_coord, self.hold_coord)\",\n \"def get_pos(self, cx, cy):\\n x = self.min_x + cx*(self.size+0.5)\\n y = self.min_y + cy*(self.size+0.5)\\n return (x,y)\",\n \"def get_location(self):\\r\\n return self.__x, self.__y\",\n \"def cursor_coordinates(self):\\n text = self.getText()\\n lines = text.split(\\\"\\\\n\\\")\\n pos = self.getCursorPos()\\n if pos == 0:\\n return (0, 0)\\n i = 0\\n cursor_row = -1\\n cursor_col = -1\\n for row, line in enumerate(lines):\\n i += len(line) + 1 # we need to include \\\"\\\\n\\\"\\n if pos < i:\\n cursor_row = row\\n cursor_col = pos - i + len(line) + 1\\n break\\n return (cursor_col, cursor_row)\",\n \"def get_xy_position(row, col):\\n spacing_x = 86 + 11\\n spacing_y = 98 + 8\\n top_y = 50\\n left_x = 50\\n return left_x + col * spacing_x, top_y + row * spacing_y\",\n \"def get_pos(self):\\n return (self.x/3, 3**0.5*self.y/3, self.r/3)\",\n \"def getBallPos(self) -> (int,int):\\n return self.x, self.y\",\n \"def get_coordinates(num: int) -> tuple:\\r\\n return num * math.sin(num), num * math.cos(num)\",\n \"def get_position(self):\\n return [self._row, self._column]\",\n \"def restored_position(self) -> Tuple[int, int]:\\n x_n, y_n = self.normalized_position\\n w, h = self.region.original_size\\n return int(x_n * w), int(y_n * h)\",\n \"def restored_position(self) -> Tuple[int, int]:\\n x_n, y_n = self.normalized_position\\n w, h = self.region.original_size\\n return int(x_n * w), int(y_n * h)\",\n \"def mouse_position(pos):\\n x, y = pos\\n m = x // SQUARE_SIZE\\n n = y // SQUARE_SIZE\\n return n, m\",\n \"def local_coordinates(self, position: np.ndarray) -> Tuple[float, float]:\\n raise NotImplementedError()\",\n \"def coords2D(self):\\n return (self.x, self.y)\",\n \"def get_position(self, position):\",\n \"def HTSeq_pos_to_tuple(HTSeq_pos):\\n try:\\n chrom = HTSeq_pos.chrom\\n except AttributeError:\\n raise MutantError(\\\"Invalid position %s! Need an HTSeq iv object. (If empty, maybe read wasn't aligned?)\\\"%(HTSeq_pos,))\\n strand = HTSeq_pos.strand\\n # HTSeq is 0-based and I want 1-based, thus the +1; end has no +1 because in HTSeq end is the base AFTER the alignment.\\n start_pos = HTSeq_pos.start+1\\n end_pos = HTSeq_pos.end\\n output_pos = (chrom, start_pos, end_pos, strand)\\n check_valid_position_tuple(output_pos)\\n return output_pos\",\n \"def to_tuple(self):\\n return (self.row_start, self.row_end, self.col_start, self.col_end)\",\n \"def get_frame_coordinates(self, i: int) -> Tuple[Tuple[int]]:\\n return (self.get_frame_x(i), self.get_frame_y(i))\",\n \"def getPos(self):\\n return self.Xpos,self.Ypos\",\n \"def get_point(self):\\n return self._x, self._y\",\n \"def coords(self):\\n return (self.x, self.y, self.z)\",\n \"def coords(self):\\n return (self.x, self.y, self.z)\",\n \"def last_pos(self) -> tuple[int, int]:\\n if not self.actions:\\n return (self.start_x, self.start_y)\\n else:\\n box = self.get_hitbox_at(self.time_consumed)\\n return box.pos_x, box.pos_y\",\n \"def ind(self, pos):\\n row = int(pos[1:]) - 1\\n column = self.letter_to_column(pos[0])\\n return row, column\",\n \"def ind(self, pos):\\n row = int(pos[1:]) - 1\\n column = self.letter_to_column(pos[0])\\n return row, column\",\n \"def ind(self, pos):\\n row = int(pos[1:]) - 1\\n column = self.letter_to_column(pos[0])\\n return row, column\",\n \"def get_pos(self) -> tuple:\\n return self.rect.center\",\n \"def relative_position(self) -> Tuple[int, int]:\\n return self.position[0] - self.region.rect.x, self.position[1] - self.region.rect.y\",\n \"def relative_position(self) -> Tuple[int, int]:\\n return self.position[0] - self.region.rect.x, self.position[1] - self.region.rect.y\",\n \"def get_position(self):\\n return parsegeometry(self.geometry())[2:]\",\n \"def get_position(self, cell) -> tuple:\\n for i, row in enumerate(self.cells):\\n if cell in row:\\n return row.index(cell), i\\n if not isinstance(cell, Cell):\\n raise TypeError(f\\\"Argument should be of type 'Cell', not '{cell.__class__.__name__}'.\\\")\\n raise ValueError(\\\"The given cell is not a part of the grid.\\\")\",\n \"def _coord(self, x, y):\\n gridEdge = 7 # originally 5\\n y = gridEdge - y\\n cx = 100 * (x - 1) + 50\\n cy = 100 * (y - 1) + 50\\n r = 20\\n return (cx - r, cy - r, cx + r, cy + r)\",\n \"def coordinates(self, xy_pairs=False):\\n\\n if xy_pairs:\\n return tuple(zip(self._coordinates[:-1:2], self._coordinates[1::2]))\\n else:\\n return tuple(self._coordinates)\",\n \"def coordinates(self, xy_pairs=False):\\n\\n if xy_pairs:\\n return tuple(zip(self._coordinates[:-1:2], self._coordinates[1::2]))\\n else:\\n return tuple(self._coordinates)\",\n \"def get_pos(self):\\n return [self.row, self.col]\",\n \"def pixel_coords_to_pos(i, j, maze_size):\\n maze_border = ((maze_size - 1) // 2) * BLOCK_PIXEL_SIZE\\n pos_x = (i + maze_border) // BLOCK_PIXEL_SIZE\\n pos_y = (maze_border - j) // BLOCK_PIXEL_SIZE\\n\\n return int(pos_x), int(pos_y)\",\n \"def getPosition(self):\\n return self.x\",\n \"def get_position_on_game(self):\\n return (self.peg, self.position_on_peg)\",\n \"def handle_position(data: bytes) -> Tuple[bytes, str]:\\n x, y, z = struct.unpack('fff', data[0:3 * 4])\\n return data[20:], f'Current Position (x,y,z): {x} {y} {z}'\",\n \"def get_xy_position(gcode_command):\\n\\tpattern = re.compile(r\\\"^G\\\\dX(\\\\d+(?:\\\\.\\\\d*)?|\\\\.\\\\d+)Y(\\\\d+(?:\\\\.\\\\d*)?|\\\\.\\\\d+)F(\\\\d+)$\\\") # using non-capturing groups\\n\\tm = pattern.match(gcode_command) # no need for re.search() because we have a complete pattern\\n\\t(x, y) = m.group(1,2)\\n\\ttry:\\n\\t\\tx = float(x)\\n\\t\\ty = float(y)\\n\\texcept:\\n\\t\\traise Exception(\\\"Could not convert X and Y to floats. X={}, Y={}\\\".format(x,y))\\n\\tx_pixel = round(x/X_STEP) # round to nearest int\\n\\ty_pixel = round(y/Y_STEP*12)\\n\\treturn (x_pixel, y_pixel)\",\n \"def point2pos(self, point):\\n row = self._vim.eval('byte2line({})'.format(point))\\n col = self._vim.eval('{} - line2byte({})'.format(point, row))\\n return (int(row), int(col))\",\n \"def getCoords(self):\\n if self._ra == \\\"\\\" or self._dec == \\\"\\\":\\n raise ValueError('Object named ' + self._name +' has no coordinates in database.')\\n ra = self._ra.split(\\\":\\\")\\n dec = self._dec.split(\\\":\\\")\\n raTuple = (int(ra[0]), int(ra[1]), float(ra[2]))\\n decTuple = (dec[0][0], int(dec[0][1:]), int(dec[1]), float(dec[2]))\\n return raTuple, decTuple\",\n \"def to_coords(self, px, py):\\n if px not in range(self.SIZE**2) or py not in range(self.SIZE**2):\\n raise IndexError\\n return (px // self.SIZE, py // self.SIZE,\\n px % self.SIZE, py % self.SIZE)\",\n \"def getMousePosition(self):\\n return (self.mouseData.x, self.mouseData.y)\",\n \"def get_position(self, row, column):\\n position_key = \\\"{}{}\\\".format(row, column)\\n return self.positions[position_key]\",\n \"def player_location(self):\\n x = 0\\n y = 0\\n for line in self.grid:\\n for i in line:\\n if i == \\\"P\\\":\\n return x, y\\n \\n y+=1\\n x += 1\\n y = 0\",\n \"def get_position(self):\\n position = (self.position_x * SPRITE_SIZE, self.position_y * SPRITE_SIZE)\\n return position\",\n \"def GetPosition(board):\\n\\tfor i in range(len(board.matrix)):\\n\\t\\tfor j in range(len(board.matrix[i])):\\n\\t\\t\\tif board.matrix[i][j]==\\\"X\\\":\\n\\t\\t\\t\\treturn i,j\",\n \"def __get_position(self, value, state):\\n coords = np.argwhere(state == value).flatten()\\n return coords\",\n \"def ind2coord(self, index):\\n\\n # assert (index >= 0)\\n # assert(index < self.n - 1)\\n\\n col = index // self.rows\\n row = index % self.rows\\n\\n return [row, col]\",\n \"def get_coords(self):\\n xTK = int(jeu.coords(self.rectangle)[0]) # Coordonnées TKinter x1 et y1 du rectangle correspondant à la voiture\\n yTK = int(jeu.coords(self.rectangle)[1])\\n # On divise par la largeur d'une case et on renvoie les valeurs obtenues sous la forme d'un tuple\\n X = xTK//100\\n Y = yTK//100\\n resultat = [X, Y]\\n return resultat\",\n \"def get_location(self) -> tuple:\\r\\n if self.data is None:\\r\\n return (None, None)\\r\\n \\r\\n lat = self.data['GPSInfo']['GPSLatitude']\\r\\n lon = self.data['GPSInfo']['GPSLongitude']\\r\\n \\r\\n # Convert from Degrees, minutes, seconds to standard form\\r\\n latitude = (lat[0][0] / lat[0][1]) \\\\\\r\\n + (lat[1][0] / lat[1][1] / 60) \\\\\\r\\n + (lat[2][0] / lat[2][1] / 3600)\\r\\n \\r\\n longitude = (lon[0][0] / lon[0][1]) \\\\\\r\\n + (lon[1][0] / lon[1][1] / 60) \\\\\\r\\n + (lon[2][0] / lon[2][1] / 3600)\\r\\n\\r\\n # Adjust for direction references\\r\\n if self.data['GPSInfo']['GPSLatitudeRef'] == 'S':\\r\\n latitude *= -1\\r\\n\\r\\n if self.data['GPSInfo']['GPSLongitudeRef'] == 'W':\\r\\n longitude *= -1\\r\\n\\r\\n return (round(latitude, 6), round(longitude, 6))\",\n \"def element_coordinates(self, element):\\n out = (0,0,0,0)\\n if 'title' in element.attrib:\\n matches = self.boxPattern.search(element.attrib['title'])\\n if matches:\\n coords = matches.group(1).split()\\n out = (int(coords[0]),int(coords[1]),int(coords[2]),int(coords[3]))\\n return out\",\n \"def get_xy(self, x, y):\\r\\n\\t\\treturn self.grid[y, x]\",\n \"def position(self, x, y):\\n if self.portrait:\\n # HMSB\\n index = (x + y * self.size[0]) >> 3\\n offset = 7 - (x & 0x07)\\n else:\\n # VMSB\\n index = (y >> 3) * self.size[0] + x\\n offset = 7 - (y & 0x07)\\n return index, offset\",\n \"def cursorPosGL(self):\\n globalPos = QtGui.QCursor.pos()\\n pos = self.mapFromGlobal(globalPos)\\n y = self.size().height() - pos.y()\\n return pos.x(), y\",\n \"def cursorPosGL(self):\\n globalPos = QtGui.QCursor.pos()\\n pos = self.mapFromGlobal(globalPos)\\n y = self.size().height() - pos.y()\\n return pos.x(), y\",\n \"def index_to_position(self, index):\\n col = index % self._grid_size\\n row = index // self._grid_size\\n return row, col\",\n \"def pixel_to_position(self, pixel):\\n x, y = pixel\\n return y // 60, x // 60\",\n \"def position_tuples(self, protein=False):\\n if protein:\\n if not self.is_coding():\\n raise AttributeError(\\n \\\"Cannot return wild type protein \\\"\\n \\\"position tuples for non-coding wild \\\"\\n \\\"type [{}]\\\".format(self.parent_name)\\n )\\n else:\\n seq = self.protein_seq\\n offset = self.protein_offset\\n else:\\n seq = self.dna_seq\\n offset = self.dna_offset\\n\\n return [(i + offset + 1, seq[i]) for i in range(len(seq))]\",\n \"def get_position(self):\\n return self._find_gnx_node(self.gnx)\",\n \"def getPosition(self):\\n return self.target, min(self.points), max(self.points)\",\n \"def _get_coordinates(self, tile, position=None):\\n if not position:\\n position = self.position\\n\\n for i in range(self.PUZZLE_NUM_ROWS):\\n for j in range(self.PUZZLE_NUM_COLUMNS):\\n if position[i][j] == tile:\\n return i, j\\n\\n return RuntimeError('Invalid tile value')\",\n \"def position(self):\\n return self._position\",\n \"def get(self):\\n return self.x, self.y\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8117628","0.80366904","0.80062807","0.7994267","0.79300076","0.7879146","0.78181684","0.7731477","0.7600716","0.756264","0.7516764","0.75011235","0.7460002","0.7377023","0.7375958","0.73217714","0.7272441","0.72643983","0.72562724","0.7233895","0.72307074","0.71828496","0.7123727","0.7054602","0.7052914","0.7042365","0.7036704","0.70213485","0.7018248","0.7017193","0.7015173","0.7001802","0.6992793","0.69848615","0.69812334","0.6967557","0.6961377","0.69490266","0.69485974","0.693001","0.6924752","0.6922837","0.6919948","0.6919572","0.68733644","0.68733644","0.68354005","0.6828863","0.6825407","0.6818702","0.6810405","0.6787162","0.67666453","0.67547655","0.67503184","0.67478","0.67478","0.6747612","0.67448866","0.67448866","0.67448866","0.6697253","0.66929734","0.66929734","0.6686259","0.6679175","0.6671447","0.66625005","0.66625005","0.6650577","0.6640228","0.6635979","0.66147375","0.6605124","0.66009676","0.65960014","0.6588954","0.6584113","0.6552553","0.65499073","0.6548126","0.65393734","0.65221155","0.6518585","0.6497022","0.6496041","0.6492163","0.64913315","0.64774394","0.645816","0.6458005","0.6458005","0.6456314","0.6448156","0.64378923","0.6429952","0.64292616","0.6426562","0.6426109","0.6423071"],"string":"[\n \"0.8117628\",\n \"0.80366904\",\n \"0.80062807\",\n \"0.7994267\",\n \"0.79300076\",\n \"0.7879146\",\n \"0.78181684\",\n \"0.7731477\",\n \"0.7600716\",\n \"0.756264\",\n \"0.7516764\",\n \"0.75011235\",\n \"0.7460002\",\n \"0.7377023\",\n \"0.7375958\",\n \"0.73217714\",\n \"0.7272441\",\n \"0.72643983\",\n \"0.72562724\",\n \"0.7233895\",\n \"0.72307074\",\n \"0.71828496\",\n \"0.7123727\",\n \"0.7054602\",\n \"0.7052914\",\n \"0.7042365\",\n \"0.7036704\",\n \"0.70213485\",\n \"0.7018248\",\n \"0.7017193\",\n \"0.7015173\",\n \"0.7001802\",\n \"0.6992793\",\n \"0.69848615\",\n \"0.69812334\",\n \"0.6967557\",\n \"0.6961377\",\n \"0.69490266\",\n \"0.69485974\",\n \"0.693001\",\n \"0.6924752\",\n \"0.6922837\",\n \"0.6919948\",\n \"0.6919572\",\n \"0.68733644\",\n \"0.68733644\",\n \"0.68354005\",\n \"0.6828863\",\n \"0.6825407\",\n \"0.6818702\",\n \"0.6810405\",\n \"0.6787162\",\n \"0.67666453\",\n \"0.67547655\",\n \"0.67503184\",\n \"0.67478\",\n \"0.67478\",\n \"0.6747612\",\n \"0.67448866\",\n \"0.67448866\",\n \"0.67448866\",\n \"0.6697253\",\n \"0.66929734\",\n \"0.66929734\",\n \"0.6686259\",\n \"0.6679175\",\n \"0.6671447\",\n \"0.66625005\",\n \"0.66625005\",\n \"0.6650577\",\n \"0.6640228\",\n \"0.6635979\",\n \"0.66147375\",\n \"0.6605124\",\n \"0.66009676\",\n \"0.65960014\",\n \"0.6588954\",\n \"0.6584113\",\n \"0.6552553\",\n \"0.65499073\",\n \"0.6548126\",\n \"0.65393734\",\n \"0.65221155\",\n \"0.6518585\",\n \"0.6497022\",\n \"0.6496041\",\n \"0.6492163\",\n \"0.64913315\",\n \"0.64774394\",\n \"0.645816\",\n \"0.6458005\",\n \"0.6458005\",\n \"0.6456314\",\n \"0.6448156\",\n \"0.64378923\",\n \"0.6429952\",\n \"0.64292616\",\n \"0.6426562\",\n \"0.6426109\",\n \"0.6423071\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7212456"},"document_rank":{"kind":"string","value":"21"}}},{"rowIdx":94784,"cells":{"query":{"kind":"string","value":"Displays a string in user friendly manner."},"document":{"kind":"string","value":"def __repr__(self):\n return \"(\"+str(self.pos)+\",\"+str(self.color)+\")\""},"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 see(s):\n print(\"---- %s -----\" % s)","def _message_display(string):\n print(\"========================================\")\n print(string)\n print(time.asctime(time.localtime(time.time())))\n print(\"========================================\")","def show_on_screen(self, string, location, font='Arial', font_size=20, colour=WHITE):\n msg = pygame.font.SysFont(font, font_size).render(str(string), True, colour)\n self.screen.blit(msg, location)","def __str__(self): # pragma: no cover\n return self.display()","def _display_message(message: str) -> None:\n print(message)","def display(self,message):\r\n \r\n print(message)","def _display(s):\n if not isinstance(s, unicode):\n s = s.decode(\"utf-8\")\n s = _indent(_escaped_text_from_text(s, \"whitespace\"), 4)\n if not s.endswith('\\n'):\n s += '\\n'\n return s","def displayMessage(j, s):\n if j:\n j.DisplayMessage(\"info\", s.replace(\" \", \" \").replace(\"j.\", \"\", 1))\n print(\" \" + s)","def show(self) -> str:\n return f'[{self.font}]{self.text}[{self.font}]' if self.font else self.text","def print_(self, s: str) -> None:","def display_message():\n msg = \"I'm learning to store code in functions.\"\n print(msg)","def message(self, string):\n print (string)","def subtitle(string):\n print(\"{}\\n{}\\n\".format(bold(string), underline(string, \"-\")))","def display_text(self, text):\n self.write_to_serial(':DISP:TEXT \\'' + text + '\\'')","def show(self, stdscr):\n stdscr.addstr(*self.pos, self.asset)","def code_display(self):\r\n return u'%s-%s-%s' % (self.code[:3], self.code[3:6], self.code[6:])","def render_string(self, template: str, **vars) -> str:","def DrawStringAt(self, x, y, s, color=(229, 153, 153, 255)):\r\n self.screen.blit(self.font.render(s, True, color), (x, y))","def display_message():\n\tmessage = \"I'm learning how to use function.\"\n\tprint(message)","def drawString(text: str):\n pass","def displayString(*args, delete: bool=True, exists: bool=True, keys: bool=True, replace:\n bool=True, value: Union[AnyStr, bool]=\"\", q=True, query=True,\n **kwargs)->Union[None, Any]:\n pass","def display(self) -> str:\n lines, _, _, _ = self._display_aux()\n return '\\n'.join(lines)","def print_string(self, s):\n self._write('%s\\n' % s)","def display_message(self, message):\n text = self.font.render(message, True,\n self.display_states[self.display_names[self.current_display_state]]['text'])\n temp_width = text.get_rect().width\n self.gameDisplay.blit(text, ((self.SCREEN_WIDTH / 2) - (temp_width/2), 100))","def title(self, string):\n return self.bold(string)","def display_message(self, message):\n\t\tself.render('message.html', {'message': message})","def output_str(string:str) -> str:\n print(string)","def printString(self):\n if hasattr(self, 'string'):\n print self.string.upper()","def disp_msg(msg):\n from x84.bbs import getterminal, echo\n term = getterminal()\n echo(u''.join((u'\\r\\n\\r\\n',\n term.bold_yellow('%s ' % (msg,),),\n term.yellow_reverse_bold(u'...'),)))","def printout(string):\n print(string)","def __str__(self):\n bold = \"*\" if self.bold else ''\n italic = \"/\" if self.italic else ''\n underline = \"_\" if self.underline else ''\n return bold + italic + underline + self.character","def display_unicode(self, string):\n if string is None:\n return ''\n return string.decode(\"utf16\", \"ignore\").encode(\"ascii\", 'backslashreplace')","def shout():\n # Concatenate the strings: shout_word\n shout_word='congratulations'+'!!!'\n\n # Print shout_word\n print(shout_word)","def display_string(text_area_no: int) -> str:\n if text_area_no == 1:\n text = ''\n for v in utterances['P1']:\n text += v + '\\n'\n return text\n elif text_area_no == 2:\n text = ''\n for v in utterances['S1']:\n text += v + '\\n'\n return text\n elif text_area_no == 3:\n text = ''\n for v in utterances['S2']:\n text += v + '\\n'\n return text\n elif text_area_no == 4:\n text = ''\n for v in utterances['S3']:\n text += v + '\\n'\n return text\n elif text_area_no == 5:\n text = ''\n for v in utterances['S4']:\n text += v + '\\n'\n return text\n elif text_area_no == 6:\n text = ''\n for v in utterances['S4']:\n text += v + '\\n'\n return text\n elif text_area_no == 7:\n text = ''\n for v in utterances['C1']:\n text += v + '\\n'\n return text\n elif text_area_no == 8:\n text = ''\n for v in utterances['C2']:\n text += v + '\\n'\n return text","def the_display(self):\r\n return f\"\"\"\r\n {self.display[0]}\\n\r\n {self.display[1]}\\n\r\n {self.display[2]}\\n\r\n {self.display[3]}\\n\r\n {self.display[4]}\\n\r\n \"\"\"","def escape_for_display(s) :\n if len(s) == 0 :\n return \"[EMPTY]\"\n return s.replace(\"\\n\",\"[NL]\").replace(\"\\t\",\"[TAB]\") #.replace(\" \",\"[SP]\") # Escape newlines so not to confuse debug output.","def show_word(self):\n self.display_word = len(self.chosen_word) * \"_ \"\n Donatello.draw_word(self.display_word)\n return self.display_word","def display_message():\n message = \"I am learning about functions, function calls, parameters and \"\n message+= \"arguments.\"\n print(message)","def show_text(text, colour):\n message = font_style.render(text, True, colour)\n dis.blit(message, [game_size_x/2, game_size_y/2])","def display_message():","def __str__(self) -> str:\r\n return self.process(self.string)","def shout():\n # Concatenate the strings: shout_word\n shout_word = 'congratulations'+'!!!'\n\n # Print shout_word\n print(shout_word)","def say(string):\n print(\"\\n\" + string)","def sprint(string=\"string\"):\n global screen\n screen += string","def strprint(self, mystr):\n if self.is_verbose is True:\n print(mystr)\n else:\n pass\n return","def render_help(self, text):\n if text and text.strip():\n self.enable_help_toggle()\n style = \"display: %s;\" % (\"block\" if self.help_visible else \"none\")\n c = self.render_div(text.strip(), class_=\"help\", style=style)\n return c\n return \"\"","def title(string):\n print(\"{}\\n{}\\n\".format(bold(string), underline(string, \"=\")))","def display(self, message=\"\"):\n print(\"-\" * (79 - len(message)), end=\" \")\n print(message)\n if self.mat is None:\n print(\"None\")\n else:\n print(self.__repr__())\n print(\"=\" * 80)","def display_message():\n\tprint(\"In this chapter we will be learning how to write functions\")","def __str__(self):\n return 'str-human.%s' % self.name","def render_string(_str):\n\t\treturn str.encode(_str)","def bye():\r\n return \"<p>Bye World! <p>\"","def showme(message):\n print(message)","def __str__(self):\n t = Template(\n \"\"\"\n <h4>$title</h4>\n $imgs\n $footnotes\n <hr/>\"\"\")\n # Return result.\n return t.substitute({\n \"title\": self.title,\n \"imgs\": self.render_images(),\n \"footnotes\": self.render_footnotes()\n })","def display_s(s, font, screen, lcd, size=5, x=0, y=0):\n i = 0\n spacing = size * .11\n s = str(s)\n char = s[0]\n char_w, char_h = font[char].size\n for c in s:\n display_c(c,font,screen,lcd,size,(int(i*spacing*char_w)+x),y)\n i += 1\n return screen","def make_display_word(secret_word):\n return ('_ ' * len(secret_word))","def display_message():\n\tprint(\"Learnt to write functions, which are named blocks of code that are designed to do one specific job.\")","def display(self, assignment):\r\n # Subclasses can print in a prettier way, or display with a GUI\r\n print(assignment)","def pmd_display_text(text, size=1):\n esc = conditional_escape\n result = '<span class=\"pmd-display%d\">%s</span>' % (int(size), esc(text))\n return mark_safe(result)","def _display_error(message: str) -> None:\n print()\n print(message, end='\\n\\n')","def display_message(self, message):\n params = {\n 'message': message\n }\n self.render_template('message.html', params)","def url_to_display_string(url):\n raw_label = url.split('/')[-1]\n label = raw_label.replace('_', ' ')\n return label","def showMessage(self, message):\r\n print message","def do_display_ascii(self, address):\n address = self.ParseAddressExpr(address)\n string = self.reader.ReadAsciiString(address)\n if string == \"\":\n print(\"Not an ASCII string at %s\" % self.reader.FormatIntPtr(address))\n else:\n print(\"%s\\n\" % string)","def help_display(self):\r\n cmdString = 'pyuic5 -h' \r\n # execute command and return stdout string\r\n output2 = subprocess.getoutput(cmdString) \r\n # show stdout \r\n self.plainTextEdit.insertPlainText( output2 )","def showText(self, surface, point, text, color=None, size=20):\n if not color: color = self.color\n v = self / 2\n point = v(point)\n surface.print(text, tuple(point), color=color, size=size)","def display_string( self, a_string, update_now = False ):\n #rint( \"debug for display_string\")\n if AppGlobal.parameters.gui_text_log_fn:\n # for now open close.... later perhaps improve\n with open( AppGlobal.parameters.gui_text_log_fn, \"a\" ) as a_file:\n a_file.write( a_string ) # do we need \\n check\n #rint( a_string )\n\n if AppGlobal.parameters.log_gui_text:\n AppGlobal.logger.log( AppGlobal.parameters.log_gui_text_level, a_string, )\n\n self.msg_text.insert( Tk.END, a_string, ) # this is going wrong, why how\n try:\n numlines = int( self.msg_text.index( 'end - 1 line' ).split('.')[0] )\n # !! beware int( None ) how could it happen ?? it did this is new\n except Exception as exception:\n # Catch the custom exception -- !! to broad execpt\n AppGlobal.logger.error( str( exception ) )\n print( exception )\n numlines = 0\n if numlines > self.max_lines:\n cut = int( numlines/2 ) # lines to keep/remove\n self.msg_text.delete( 1.0, str( cut ) + \".0\" ) # remove excess text\n# msg = \"Delete from test area at \" + str( cut )\n# self.logger.info( msg )\n\n if self.cb_scroll_var.get():\n self.msg_text.see( Tk.END )\n\n if update_now:\n AppGlobal.gui.root.update()\n print( \"!! self.root not valid here \")","def print(self, my_screen, text_string):\n text_bitmap = self.font.render(text_string, True, BLACK)\n my_screen.blit(text_bitmap, [self.x_pos, self.y_pos])\n self.y_pos += self.line_height","def visualizeWithContents(self, paths):\n return ExpressString(\"A totally mystical rune.\")","def text(self):\n surface_score = pygame.font.SysFont('Helvetic', 100).render(str(self.score), False, BLACK)\n screen.blit(surface_score, (50, 50))","def _(string):\n\t\treturn string","def result_display(self, arg):\n if self.rc.pprint:\n out = stringify_func(arg)\n\n if '\\n' in out:\n print\n\n print out\n else:\n print repr(arg)","def display_text(text, x, y, size):\r\n font = pygame.font.Font('freesansbold.ttf', size)\r\n text_surf, text_rect = text_objects(text, font)\r\n text_rect.center = (x, y)\r\n display.blit(text_surf, text_rect)","def print_entry(text):\n print \"Text entered: \\n '%s'\" % text","def entertext(Title,objectname,stringtoenter):\n try:\n ldtp.enterstring(Title,objectname,stringtoenter)\n logging.DEBUG(\"entered string\")\n except Exception as er:\n logging.DEBUG(\"Not able to enter the string in %\")","def ui_output_text(morzeText: str):\n print(morzeText)","def __str__(self) -> str:\n\n return self.display_form()","def showText(self, context, text, size=1, color=colors.WHITE, conversion=True):\n context.print(text, self.components, size, color=color, conversion=conversion)","def display_profile(self):\n statement = f\"\"\"\n ------\n {self.name.upper()}\n ------\n Fee: {self.fee} -/Rs.\n Rating: {self.rating} STARS\n Qualification: {self.qualification}\n Speciality: {self.speciality}\n Language: {self.language}\n Working Hours: {self.working_hrs}\n Contact: {self.contact}\n Location: {self.location}\n \"\"\"\n print(statement)","def Print(self, s, color=(229, 153, 153, 255)):\r\n self.screen.blit(self.font.render(s, True, color), (5, self.textLine))\r\n self.textLine += 15","def render_string(self, source: str, **vars) -> str:\n vars.setdefault('ctx', self._ctx)\n return self._renderer.render_string(source, **vars)","def display_text(target_text):\n\n print('Text to analyze:')\n print('')\n print('-------TEXT BELOW-------')\n print(target_text)\n print('-------TEXT ENDS-------')\n print('')","def command_show(problem):\r\n print problem.get_html()","def display_message(self, message, subtitle=None, arg=None):\n if message is None:\n # Display same message as the placeholder\n message = self.placeholder\n xml = alfred.xml([\n alfred.Item(\n title=message,\n subtitle=subtitle,\n attributes={\n 'uid': alfred.uid(0),\n 'arg': arg\n },\n icon='icon.png',\n )\n ]) # compiles the XML answer\n alfred.write(xml) # writes the XML back to Alfred\n exit()","def lcd_string(self, message, line):\n # Send string to display\n\n # message = message.ljust(LCD_WIDTH,\" \")\n\n self.lcd_byte(line, LCD_CMD)\n for i in range(len(message)):\n self.lcd_byte(ord(message[i]),LCD_CHR)","def show_text(text, args):\n return expyriment.stimuli.TextLine(text,\n text_font=args[\"--text-font\"],\n text_size=args[\"--text-size\"],\n text_colour=args[\"stimuli_color\"],\n background_colour=args[\"bg_color\"])","def show_greeting(self):\n self.output(' ------------------------ ')\n self.output('You are now playing ' + self.name)\n self.output(self.greeting)\n self.output(' ------------------------ ')","def printStr(str):\n if str_chk.match(str): return str\n return repr(str)","def emu_print(text):\n print \"%s %s\" % (EMU_PRINT_PREFIX, text)","def banner_ascii():\n print(\"\")\n print(f\"\\n{RED} Steganography Tool{RESET}\")\n print(f\"{RED} Made By {RESET}\")\n print(f\"{RED} Ehthe Samul Islam Laskar USN:1DS16CS712 {RESET}\")\n print(f\"{RED} B Padma USN:1DS19CS420{RESET}\")\n print(f\"{RED} Nikhil D Kanyal USN:1DS17CS731{RESET}\")\n print(f\"{YELLOW}Type 'help' to see commands{RESET}\")","def show_help():\r\n print(\"What should we pickup at the store?\")\r\n print(\"\"\"\r\n Enter 'SHOW' to display current list.\r\n Enter 'DONE' to stop adding items.\r\n Enter 'REMOVE' followed by name to remove an item. Ex: REMOVE Orange\r\n Enter 'HELP' if you would like to reference the commands.\r\n \"\"\")","def display(self):\r\n\t\ts = self.options['space']\r\n\t\tv = self.level\r\n\t\tp = self.options['sep']\r\n\t\tt = self.options['tab']\r\n\t\tb = self.options['bullet']\r\n\t\tprint(v*t+b+s+self.abbrev+s+p+s+self.text)","def display_char(self) -> None:\r\n print(self.char if self.was_guessed else '_', end=' ')","def display_letter_prompt(self, letter=None):\n if letter == None:\n letter = self.current_prompt\n \n displaybox = self.pygame.draw.rect(self.gameDisplay,\n self.display_states[self.display_names[self.current_display_state]]['background'],\n ((self.SCREEN_WIDTH/2)-200, 108, 400, 50))\n\n text = self.font_large.render(letter, True,\n self.display_states[self.display_names[self.current_display_state]]['text'])\n\n temp_width = text.get_rect().width\n\n self.gameDisplay.blit(text, ((self.SCREEN_WIDTH / 2) - (temp_width/2), 100))","def display_character(window, name, path_template):\n # Could be improved a lot.\n border_size = 20\n path = \".\".join((path_template, \"200\", \"png\"))\n pic = pygame.image.load(path)\n pic_w, pic_h = pic.get_size()\n text = ft_title.render(\" \".join((\"<-\", name, \"->\")), 1, WHITE)\n text_w, text_h = text.get_size()\n pygame.draw.rect(window, GREY, (SCREEN_W/2 - pic_w/2 - border_size,\n SCREEN_H/2 - pic_h/2 - text_h - border_size,\n pic_w + border_size*2, pic_h + border_size*2),\n border_size)\n window.blit(pic, (SCREEN_W/2 - pic_w/2, SCREEN_H/2 - pic_h/2 - text_h))\n window.blit(text, (SCREEN_W/2 - text_w/2, SCREEN_H/2 + pic_h/2 - text_h/2))","def __str__(self):\n if len(self.title) > 50:\n return self.title[:50] + \"...\"\n else:\n return self.title","def display(self):\n statement = f\"\"\"\n ------\n By {self.prescribed_by.name.upper()}\n ------\n Patient Detail!\n Name: {self.prescribed_to.name.capitalize()}\n Age: {self.prescribed_to.age}\n Gender: {self.prescribed_to.gender}\n Prescribed Medicines!\"\"\"\n print(statement)\n self.display_cure()","def display(self):\n disptxt = str(self)\n if self.width == 0 or self.has_output:\n print(disptxt)\n else:\n print(\"\\r\", end='')\n print(disptxt, end='')\n sys.stdout.flush()","def about(display=True):\n\n ABOUT_TEXT = \"\"\"\nPre-release version %s (%s) of Topographica; an updated\nversion may be available from topographica.org.\n\nThis program is free, open-source software available under the BSD\nlicense (http://www.opensource.org/licenses/bsd-license.php).\n\"\"\"%(release,version)\n if display:\n print ABOUT_TEXT\n else:\n return ABOUT_TEXT","def show_code(code):\n\n print('The code was: '+str(code))","def Display2(self, rain, humidity, lang):\n if lang == 'eng':\n string = rain + '% Rain\\n' + humidity + '% Humidity'\n return string\n else:\n return 0\n # Not Yet Supported"],"string":"[\n \"def see(s):\\n print(\\\"---- %s -----\\\" % s)\",\n \"def _message_display(string):\\n print(\\\"========================================\\\")\\n print(string)\\n print(time.asctime(time.localtime(time.time())))\\n print(\\\"========================================\\\")\",\n \"def show_on_screen(self, string, location, font='Arial', font_size=20, colour=WHITE):\\n msg = pygame.font.SysFont(font, font_size).render(str(string), True, colour)\\n self.screen.blit(msg, location)\",\n \"def __str__(self): # pragma: no cover\\n return self.display()\",\n \"def _display_message(message: str) -> None:\\n print(message)\",\n \"def display(self,message):\\r\\n \\r\\n print(message)\",\n \"def _display(s):\\n if not isinstance(s, unicode):\\n s = s.decode(\\\"utf-8\\\")\\n s = _indent(_escaped_text_from_text(s, \\\"whitespace\\\"), 4)\\n if not s.endswith('\\\\n'):\\n s += '\\\\n'\\n return s\",\n \"def displayMessage(j, s):\\n if j:\\n j.DisplayMessage(\\\"info\\\", s.replace(\\\" \\\", \\\" \\\").replace(\\\"j.\\\", \\\"\\\", 1))\\n print(\\\" \\\" + s)\",\n \"def show(self) -> str:\\n return f'[{self.font}]{self.text}[{self.font}]' if self.font else self.text\",\n \"def print_(self, s: str) -> None:\",\n \"def display_message():\\n msg = \\\"I'm learning to store code in functions.\\\"\\n print(msg)\",\n \"def message(self, string):\\n print (string)\",\n \"def subtitle(string):\\n print(\\\"{}\\\\n{}\\\\n\\\".format(bold(string), underline(string, \\\"-\\\")))\",\n \"def display_text(self, text):\\n self.write_to_serial(':DISP:TEXT \\\\'' + text + '\\\\'')\",\n \"def show(self, stdscr):\\n stdscr.addstr(*self.pos, self.asset)\",\n \"def code_display(self):\\r\\n return u'%s-%s-%s' % (self.code[:3], self.code[3:6], self.code[6:])\",\n \"def render_string(self, template: str, **vars) -> str:\",\n \"def DrawStringAt(self, x, y, s, color=(229, 153, 153, 255)):\\r\\n self.screen.blit(self.font.render(s, True, color), (x, y))\",\n \"def display_message():\\n\\tmessage = \\\"I'm learning how to use function.\\\"\\n\\tprint(message)\",\n \"def drawString(text: str):\\n pass\",\n \"def displayString(*args, delete: bool=True, exists: bool=True, keys: bool=True, replace:\\n bool=True, value: Union[AnyStr, bool]=\\\"\\\", q=True, query=True,\\n **kwargs)->Union[None, Any]:\\n pass\",\n \"def display(self) -> str:\\n lines, _, _, _ = self._display_aux()\\n return '\\\\n'.join(lines)\",\n \"def print_string(self, s):\\n self._write('%s\\\\n' % s)\",\n \"def display_message(self, message):\\n text = self.font.render(message, True,\\n self.display_states[self.display_names[self.current_display_state]]['text'])\\n temp_width = text.get_rect().width\\n self.gameDisplay.blit(text, ((self.SCREEN_WIDTH / 2) - (temp_width/2), 100))\",\n \"def title(self, string):\\n return self.bold(string)\",\n \"def display_message(self, message):\\n\\t\\tself.render('message.html', {'message': message})\",\n \"def output_str(string:str) -> str:\\n print(string)\",\n \"def printString(self):\\n if hasattr(self, 'string'):\\n print self.string.upper()\",\n \"def disp_msg(msg):\\n from x84.bbs import getterminal, echo\\n term = getterminal()\\n echo(u''.join((u'\\\\r\\\\n\\\\r\\\\n',\\n term.bold_yellow('%s ' % (msg,),),\\n term.yellow_reverse_bold(u'...'),)))\",\n \"def printout(string):\\n print(string)\",\n \"def __str__(self):\\n bold = \\\"*\\\" if self.bold else ''\\n italic = \\\"/\\\" if self.italic else ''\\n underline = \\\"_\\\" if self.underline else ''\\n return bold + italic + underline + self.character\",\n \"def display_unicode(self, string):\\n if string is None:\\n return ''\\n return string.decode(\\\"utf16\\\", \\\"ignore\\\").encode(\\\"ascii\\\", 'backslashreplace')\",\n \"def shout():\\n # Concatenate the strings: shout_word\\n shout_word='congratulations'+'!!!'\\n\\n # Print shout_word\\n print(shout_word)\",\n \"def display_string(text_area_no: int) -> str:\\n if text_area_no == 1:\\n text = ''\\n for v in utterances['P1']:\\n text += v + '\\\\n'\\n return text\\n elif text_area_no == 2:\\n text = ''\\n for v in utterances['S1']:\\n text += v + '\\\\n'\\n return text\\n elif text_area_no == 3:\\n text = ''\\n for v in utterances['S2']:\\n text += v + '\\\\n'\\n return text\\n elif text_area_no == 4:\\n text = ''\\n for v in utterances['S3']:\\n text += v + '\\\\n'\\n return text\\n elif text_area_no == 5:\\n text = ''\\n for v in utterances['S4']:\\n text += v + '\\\\n'\\n return text\\n elif text_area_no == 6:\\n text = ''\\n for v in utterances['S4']:\\n text += v + '\\\\n'\\n return text\\n elif text_area_no == 7:\\n text = ''\\n for v in utterances['C1']:\\n text += v + '\\\\n'\\n return text\\n elif text_area_no == 8:\\n text = ''\\n for v in utterances['C2']:\\n text += v + '\\\\n'\\n return text\",\n \"def the_display(self):\\r\\n return f\\\"\\\"\\\"\\r\\n {self.display[0]}\\\\n\\r\\n {self.display[1]}\\\\n\\r\\n {self.display[2]}\\\\n\\r\\n {self.display[3]}\\\\n\\r\\n {self.display[4]}\\\\n\\r\\n \\\"\\\"\\\"\",\n \"def escape_for_display(s) :\\n if len(s) == 0 :\\n return \\\"[EMPTY]\\\"\\n return s.replace(\\\"\\\\n\\\",\\\"[NL]\\\").replace(\\\"\\\\t\\\",\\\"[TAB]\\\") #.replace(\\\" \\\",\\\"[SP]\\\") # Escape newlines so not to confuse debug output.\",\n \"def show_word(self):\\n self.display_word = len(self.chosen_word) * \\\"_ \\\"\\n Donatello.draw_word(self.display_word)\\n return self.display_word\",\n \"def display_message():\\n message = \\\"I am learning about functions, function calls, parameters and \\\"\\n message+= \\\"arguments.\\\"\\n print(message)\",\n \"def show_text(text, colour):\\n message = font_style.render(text, True, colour)\\n dis.blit(message, [game_size_x/2, game_size_y/2])\",\n \"def display_message():\",\n \"def __str__(self) -> str:\\r\\n return self.process(self.string)\",\n \"def shout():\\n # Concatenate the strings: shout_word\\n shout_word = 'congratulations'+'!!!'\\n\\n # Print shout_word\\n print(shout_word)\",\n \"def say(string):\\n print(\\\"\\\\n\\\" + string)\",\n \"def sprint(string=\\\"string\\\"):\\n global screen\\n screen += string\",\n \"def strprint(self, mystr):\\n if self.is_verbose is True:\\n print(mystr)\\n else:\\n pass\\n return\",\n \"def render_help(self, text):\\n if text and text.strip():\\n self.enable_help_toggle()\\n style = \\\"display: %s;\\\" % (\\\"block\\\" if self.help_visible else \\\"none\\\")\\n c = self.render_div(text.strip(), class_=\\\"help\\\", style=style)\\n return c\\n return \\\"\\\"\",\n \"def title(string):\\n print(\\\"{}\\\\n{}\\\\n\\\".format(bold(string), underline(string, \\\"=\\\")))\",\n \"def display(self, message=\\\"\\\"):\\n print(\\\"-\\\" * (79 - len(message)), end=\\\" \\\")\\n print(message)\\n if self.mat is None:\\n print(\\\"None\\\")\\n else:\\n print(self.__repr__())\\n print(\\\"=\\\" * 80)\",\n \"def display_message():\\n\\tprint(\\\"In this chapter we will be learning how to write functions\\\")\",\n \"def __str__(self):\\n return 'str-human.%s' % self.name\",\n \"def render_string(_str):\\n\\t\\treturn str.encode(_str)\",\n \"def bye():\\r\\n return \\\"<p>Bye World! <p>\\\"\",\n \"def showme(message):\\n print(message)\",\n \"def __str__(self):\\n t = Template(\\n \\\"\\\"\\\"\\n <h4>$title</h4>\\n $imgs\\n $footnotes\\n <hr/>\\\"\\\"\\\")\\n # Return result.\\n return t.substitute({\\n \\\"title\\\": self.title,\\n \\\"imgs\\\": self.render_images(),\\n \\\"footnotes\\\": self.render_footnotes()\\n })\",\n \"def display_s(s, font, screen, lcd, size=5, x=0, y=0):\\n i = 0\\n spacing = size * .11\\n s = str(s)\\n char = s[0]\\n char_w, char_h = font[char].size\\n for c in s:\\n display_c(c,font,screen,lcd,size,(int(i*spacing*char_w)+x),y)\\n i += 1\\n return screen\",\n \"def make_display_word(secret_word):\\n return ('_ ' * len(secret_word))\",\n \"def display_message():\\n\\tprint(\\\"Learnt to write functions, which are named blocks of code that are designed to do one specific job.\\\")\",\n \"def display(self, assignment):\\r\\n # Subclasses can print in a prettier way, or display with a GUI\\r\\n print(assignment)\",\n \"def pmd_display_text(text, size=1):\\n esc = conditional_escape\\n result = '<span class=\\\"pmd-display%d\\\">%s</span>' % (int(size), esc(text))\\n return mark_safe(result)\",\n \"def _display_error(message: str) -> None:\\n print()\\n print(message, end='\\\\n\\\\n')\",\n \"def display_message(self, message):\\n params = {\\n 'message': message\\n }\\n self.render_template('message.html', params)\",\n \"def url_to_display_string(url):\\n raw_label = url.split('/')[-1]\\n label = raw_label.replace('_', ' ')\\n return label\",\n \"def showMessage(self, message):\\r\\n print message\",\n \"def do_display_ascii(self, address):\\n address = self.ParseAddressExpr(address)\\n string = self.reader.ReadAsciiString(address)\\n if string == \\\"\\\":\\n print(\\\"Not an ASCII string at %s\\\" % self.reader.FormatIntPtr(address))\\n else:\\n print(\\\"%s\\\\n\\\" % string)\",\n \"def help_display(self):\\r\\n cmdString = 'pyuic5 -h' \\r\\n # execute command and return stdout string\\r\\n output2 = subprocess.getoutput(cmdString) \\r\\n # show stdout \\r\\n self.plainTextEdit.insertPlainText( output2 )\",\n \"def showText(self, surface, point, text, color=None, size=20):\\n if not color: color = self.color\\n v = self / 2\\n point = v(point)\\n surface.print(text, tuple(point), color=color, size=size)\",\n \"def display_string( self, a_string, update_now = False ):\\n #rint( \\\"debug for display_string\\\")\\n if AppGlobal.parameters.gui_text_log_fn:\\n # for now open close.... later perhaps improve\\n with open( AppGlobal.parameters.gui_text_log_fn, \\\"a\\\" ) as a_file:\\n a_file.write( a_string ) # do we need \\\\n check\\n #rint( a_string )\\n\\n if AppGlobal.parameters.log_gui_text:\\n AppGlobal.logger.log( AppGlobal.parameters.log_gui_text_level, a_string, )\\n\\n self.msg_text.insert( Tk.END, a_string, ) # this is going wrong, why how\\n try:\\n numlines = int( self.msg_text.index( 'end - 1 line' ).split('.')[0] )\\n # !! beware int( None ) how could it happen ?? it did this is new\\n except Exception as exception:\\n # Catch the custom exception -- !! to broad execpt\\n AppGlobal.logger.error( str( exception ) )\\n print( exception )\\n numlines = 0\\n if numlines > self.max_lines:\\n cut = int( numlines/2 ) # lines to keep/remove\\n self.msg_text.delete( 1.0, str( cut ) + \\\".0\\\" ) # remove excess text\\n# msg = \\\"Delete from test area at \\\" + str( cut )\\n# self.logger.info( msg )\\n\\n if self.cb_scroll_var.get():\\n self.msg_text.see( Tk.END )\\n\\n if update_now:\\n AppGlobal.gui.root.update()\\n print( \\\"!! self.root not valid here \\\")\",\n \"def print(self, my_screen, text_string):\\n text_bitmap = self.font.render(text_string, True, BLACK)\\n my_screen.blit(text_bitmap, [self.x_pos, self.y_pos])\\n self.y_pos += self.line_height\",\n \"def visualizeWithContents(self, paths):\\n return ExpressString(\\\"A totally mystical rune.\\\")\",\n \"def text(self):\\n surface_score = pygame.font.SysFont('Helvetic', 100).render(str(self.score), False, BLACK)\\n screen.blit(surface_score, (50, 50))\",\n \"def _(string):\\n\\t\\treturn string\",\n \"def result_display(self, arg):\\n if self.rc.pprint:\\n out = stringify_func(arg)\\n\\n if '\\\\n' in out:\\n print\\n\\n print out\\n else:\\n print repr(arg)\",\n \"def display_text(text, x, y, size):\\r\\n font = pygame.font.Font('freesansbold.ttf', size)\\r\\n text_surf, text_rect = text_objects(text, font)\\r\\n text_rect.center = (x, y)\\r\\n display.blit(text_surf, text_rect)\",\n \"def print_entry(text):\\n print \\\"Text entered: \\\\n '%s'\\\" % text\",\n \"def entertext(Title,objectname,stringtoenter):\\n try:\\n ldtp.enterstring(Title,objectname,stringtoenter)\\n logging.DEBUG(\\\"entered string\\\")\\n except Exception as er:\\n logging.DEBUG(\\\"Not able to enter the string in %\\\")\",\n \"def ui_output_text(morzeText: str):\\n print(morzeText)\",\n \"def __str__(self) -> str:\\n\\n return self.display_form()\",\n \"def showText(self, context, text, size=1, color=colors.WHITE, conversion=True):\\n context.print(text, self.components, size, color=color, conversion=conversion)\",\n \"def display_profile(self):\\n statement = f\\\"\\\"\\\"\\n ------\\n {self.name.upper()}\\n ------\\n Fee: {self.fee} -/Rs.\\n Rating: {self.rating} STARS\\n Qualification: {self.qualification}\\n Speciality: {self.speciality}\\n Language: {self.language}\\n Working Hours: {self.working_hrs}\\n Contact: {self.contact}\\n Location: {self.location}\\n \\\"\\\"\\\"\\n print(statement)\",\n \"def Print(self, s, color=(229, 153, 153, 255)):\\r\\n self.screen.blit(self.font.render(s, True, color), (5, self.textLine))\\r\\n self.textLine += 15\",\n \"def render_string(self, source: str, **vars) -> str:\\n vars.setdefault('ctx', self._ctx)\\n return self._renderer.render_string(source, **vars)\",\n \"def display_text(target_text):\\n\\n print('Text to analyze:')\\n print('')\\n print('-------TEXT BELOW-------')\\n print(target_text)\\n print('-------TEXT ENDS-------')\\n print('')\",\n \"def command_show(problem):\\r\\n print problem.get_html()\",\n \"def display_message(self, message, subtitle=None, arg=None):\\n if message is None:\\n # Display same message as the placeholder\\n message = self.placeholder\\n xml = alfred.xml([\\n alfred.Item(\\n title=message,\\n subtitle=subtitle,\\n attributes={\\n 'uid': alfred.uid(0),\\n 'arg': arg\\n },\\n icon='icon.png',\\n )\\n ]) # compiles the XML answer\\n alfred.write(xml) # writes the XML back to Alfred\\n exit()\",\n \"def lcd_string(self, message, line):\\n # Send string to display\\n\\n # message = message.ljust(LCD_WIDTH,\\\" \\\")\\n\\n self.lcd_byte(line, LCD_CMD)\\n for i in range(len(message)):\\n self.lcd_byte(ord(message[i]),LCD_CHR)\",\n \"def show_text(text, args):\\n return expyriment.stimuli.TextLine(text,\\n text_font=args[\\\"--text-font\\\"],\\n text_size=args[\\\"--text-size\\\"],\\n text_colour=args[\\\"stimuli_color\\\"],\\n background_colour=args[\\\"bg_color\\\"])\",\n \"def show_greeting(self):\\n self.output(' ------------------------ ')\\n self.output('You are now playing ' + self.name)\\n self.output(self.greeting)\\n self.output(' ------------------------ ')\",\n \"def printStr(str):\\n if str_chk.match(str): return str\\n return repr(str)\",\n \"def emu_print(text):\\n print \\\"%s %s\\\" % (EMU_PRINT_PREFIX, text)\",\n \"def banner_ascii():\\n print(\\\"\\\")\\n print(f\\\"\\\\n{RED} Steganography Tool{RESET}\\\")\\n print(f\\\"{RED} Made By {RESET}\\\")\\n print(f\\\"{RED} Ehthe Samul Islam Laskar USN:1DS16CS712 {RESET}\\\")\\n print(f\\\"{RED} B Padma USN:1DS19CS420{RESET}\\\")\\n print(f\\\"{RED} Nikhil D Kanyal USN:1DS17CS731{RESET}\\\")\\n print(f\\\"{YELLOW}Type 'help' to see commands{RESET}\\\")\",\n \"def show_help():\\r\\n print(\\\"What should we pickup at the store?\\\")\\r\\n print(\\\"\\\"\\\"\\r\\n Enter 'SHOW' to display current list.\\r\\n Enter 'DONE' to stop adding items.\\r\\n Enter 'REMOVE' followed by name to remove an item. Ex: REMOVE Orange\\r\\n Enter 'HELP' if you would like to reference the commands.\\r\\n \\\"\\\"\\\")\",\n \"def display(self):\\r\\n\\t\\ts = self.options['space']\\r\\n\\t\\tv = self.level\\r\\n\\t\\tp = self.options['sep']\\r\\n\\t\\tt = self.options['tab']\\r\\n\\t\\tb = self.options['bullet']\\r\\n\\t\\tprint(v*t+b+s+self.abbrev+s+p+s+self.text)\",\n \"def display_char(self) -> None:\\r\\n print(self.char if self.was_guessed else '_', end=' ')\",\n \"def display_letter_prompt(self, letter=None):\\n if letter == None:\\n letter = self.current_prompt\\n \\n displaybox = self.pygame.draw.rect(self.gameDisplay,\\n self.display_states[self.display_names[self.current_display_state]]['background'],\\n ((self.SCREEN_WIDTH/2)-200, 108, 400, 50))\\n\\n text = self.font_large.render(letter, True,\\n self.display_states[self.display_names[self.current_display_state]]['text'])\\n\\n temp_width = text.get_rect().width\\n\\n self.gameDisplay.blit(text, ((self.SCREEN_WIDTH / 2) - (temp_width/2), 100))\",\n \"def display_character(window, name, path_template):\\n # Could be improved a lot.\\n border_size = 20\\n path = \\\".\\\".join((path_template, \\\"200\\\", \\\"png\\\"))\\n pic = pygame.image.load(path)\\n pic_w, pic_h = pic.get_size()\\n text = ft_title.render(\\\" \\\".join((\\\"<-\\\", name, \\\"->\\\")), 1, WHITE)\\n text_w, text_h = text.get_size()\\n pygame.draw.rect(window, GREY, (SCREEN_W/2 - pic_w/2 - border_size,\\n SCREEN_H/2 - pic_h/2 - text_h - border_size,\\n pic_w + border_size*2, pic_h + border_size*2),\\n border_size)\\n window.blit(pic, (SCREEN_W/2 - pic_w/2, SCREEN_H/2 - pic_h/2 - text_h))\\n window.blit(text, (SCREEN_W/2 - text_w/2, SCREEN_H/2 + pic_h/2 - text_h/2))\",\n \"def __str__(self):\\n if len(self.title) > 50:\\n return self.title[:50] + \\\"...\\\"\\n else:\\n return self.title\",\n \"def display(self):\\n statement = f\\\"\\\"\\\"\\n ------\\n By {self.prescribed_by.name.upper()}\\n ------\\n Patient Detail!\\n Name: {self.prescribed_to.name.capitalize()}\\n Age: {self.prescribed_to.age}\\n Gender: {self.prescribed_to.gender}\\n Prescribed Medicines!\\\"\\\"\\\"\\n print(statement)\\n self.display_cure()\",\n \"def display(self):\\n disptxt = str(self)\\n if self.width == 0 or self.has_output:\\n print(disptxt)\\n else:\\n print(\\\"\\\\r\\\", end='')\\n print(disptxt, end='')\\n sys.stdout.flush()\",\n \"def about(display=True):\\n\\n ABOUT_TEXT = \\\"\\\"\\\"\\nPre-release version %s (%s) of Topographica; an updated\\nversion may be available from topographica.org.\\n\\nThis program is free, open-source software available under the BSD\\nlicense (http://www.opensource.org/licenses/bsd-license.php).\\n\\\"\\\"\\\"%(release,version)\\n if display:\\n print ABOUT_TEXT\\n else:\\n return ABOUT_TEXT\",\n \"def show_code(code):\\n\\n print('The code was: '+str(code))\",\n \"def Display2(self, rain, humidity, lang):\\n if lang == 'eng':\\n string = rain + '% Rain\\\\n' + humidity + '% Humidity'\\n return string\\n else:\\n return 0\\n # Not Yet Supported\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.71144617","0.6865019","0.6777228","0.6654619","0.6601663","0.6576626","0.65690356","0.654347","0.6448489","0.6334183","0.63277024","0.6308555","0.6306732","0.6305804","0.62739414","0.62355924","0.6233103","0.62326515","0.62177855","0.62035185","0.6197159","0.6167717","0.6167667","0.6167243","0.6154799","0.6125252","0.6118674","0.6112658","0.6105487","0.60987604","0.609601","0.60825163","0.6080288","0.6055717","0.6023397","0.6021482","0.60128707","0.60104096","0.6006801","0.6000908","0.5993272","0.5986248","0.5985843","0.5971898","0.59479034","0.5947135","0.5942999","0.5939034","0.591741","0.59125215","0.5883775","0.5875679","0.58736885","0.58660984","0.5863218","0.5856877","0.5852121","0.5848165","0.5822224","0.58196557","0.5806563","0.5798225","0.57930136","0.5788982","0.57861066","0.5783891","0.578015","0.57729214","0.57663834","0.5757942","0.57579136","0.57544386","0.57430905","0.57328075","0.572724","0.57231","0.57217765","0.57155013","0.57071054","0.57069296","0.5702195","0.5686774","0.56782544","0.56741256","0.5671378","0.5669025","0.5666256","0.56662405","0.5659276","0.565868","0.56540745","0.5642554","0.5640254","0.5637872","0.5637395","0.5629506","0.56221986","0.5612216","0.5593927","0.55915624","0.558118"],"string":"[\n \"0.71144617\",\n \"0.6865019\",\n \"0.6777228\",\n \"0.6654619\",\n \"0.6601663\",\n \"0.6576626\",\n \"0.65690356\",\n \"0.654347\",\n \"0.6448489\",\n \"0.6334183\",\n \"0.63277024\",\n \"0.6308555\",\n \"0.6306732\",\n \"0.6305804\",\n \"0.62739414\",\n \"0.62355924\",\n \"0.6233103\",\n \"0.62326515\",\n \"0.62177855\",\n \"0.62035185\",\n \"0.6197159\",\n \"0.6167717\",\n \"0.6167667\",\n \"0.6167243\",\n \"0.6154799\",\n \"0.6125252\",\n \"0.6118674\",\n \"0.6112658\",\n \"0.6105487\",\n \"0.60987604\",\n \"0.609601\",\n \"0.60825163\",\n \"0.6080288\",\n \"0.6055717\",\n \"0.6023397\",\n \"0.6021482\",\n \"0.60128707\",\n \"0.60104096\",\n \"0.6006801\",\n \"0.6000908\",\n \"0.5993272\",\n \"0.5986248\",\n \"0.5985843\",\n \"0.5971898\",\n \"0.59479034\",\n \"0.5947135\",\n \"0.5942999\",\n \"0.5939034\",\n \"0.591741\",\n \"0.59125215\",\n \"0.5883775\",\n \"0.5875679\",\n \"0.58736885\",\n \"0.58660984\",\n \"0.5863218\",\n \"0.5856877\",\n \"0.5852121\",\n \"0.5848165\",\n \"0.5822224\",\n \"0.58196557\",\n \"0.5806563\",\n \"0.5798225\",\n \"0.57930136\",\n \"0.5788982\",\n \"0.57861066\",\n \"0.5783891\",\n \"0.578015\",\n \"0.57729214\",\n \"0.57663834\",\n \"0.5757942\",\n \"0.57579136\",\n \"0.57544386\",\n \"0.57430905\",\n \"0.57328075\",\n \"0.572724\",\n \"0.57231\",\n \"0.57217765\",\n \"0.57155013\",\n \"0.57071054\",\n \"0.57069296\",\n \"0.5702195\",\n \"0.5686774\",\n \"0.56782544\",\n \"0.56741256\",\n \"0.5671378\",\n \"0.5669025\",\n \"0.5666256\",\n \"0.56662405\",\n \"0.5659276\",\n \"0.565868\",\n \"0.56540745\",\n \"0.5642554\",\n \"0.5640254\",\n \"0.5637872\",\n \"0.5637395\",\n \"0.5629506\",\n \"0.56221986\",\n \"0.5612216\",\n \"0.5593927\",\n \"0.55915624\",\n \"0.558118\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94785,"cells":{"query":{"kind":"string","value":"Compares color to pawn color, returns true if they are the same."},"document":{"kind":"string","value":"def isColor(self,color):\n return self.color==color"},"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 same_color(self, other: 'Piece') -> bool:\n\n return self.color == other.color","def color_check_mate(self, mycolor):\n\n if not self.color_in_check(mycolor):\n return False\n\n incheck = True\n for (x, y) in self.__players[mycolor]:\n moves = self._get_piece_moves(x, y)\n for to in moves:\n res, captured = self._make_move((x, y), to)\n if not self.color_in_check(mycolor):\n incheck = False\n\n self._unmake_move(to, (x, y), captured)\n if not incheck:\n return False\n\n return incheck","def color_in_check(self, mycolor):\n\n opponent = self.__players[self.get_opponent_color(mycolor)]\n\n x, y = None, None\n for (u, v) in self.__players[mycolor]:\n piece = self.get_piece(u, v)\n if not piece:\n raise ValueError()\n\n if self.get_piece(u, v).name == 'king':\n x, y = u, v\n break\n\n for (u, v) in opponent:\n if (x, y) in self._get_piece_moves(u, v):\n return True\n\n return False","def can_checkmate(self, color):\n\n if color == 'red':\n opposing_color = 'blue'\n else:\n opposing_color = 'red'\n general_location = None\n\n for piece in self._active_pieces[opposing_color]:\n if type(piece) is General:\n general_location = self.translate_to_algebraic(piece.get_location())\n break\n for piece in self._active_pieces[color]:\n piece_location = self.translate_to_algebraic(piece.get_location())\n if piece.validate_move(piece_location, general_location, self._board):\n return True\n return False","def check_win(self, color):\n if dijkstra(self, color) == 0:\n return True\n else:\n return False","def is_green(self, pixel: tuple) -> bool:\r\n\r\n # If the pixel is more green than any other color,\r\n # Then we consider is a plant pixel\r\n if pixel[0] < pixel[1] and pixel[2] < pixel[1]:\r\n return True\r\n\r\n # The following rules are for fine adjusments\r\n # These tolerances may vary by photo\r\n if pixel[0] > self.max_brightness:\r\n return False\r\n\r\n if pixel[1] < self.min_brightness:\r\n return False\r\n \r\n if pixel[0] / pixel[1] > self.color_tolerance[0] / self.color_tolerance[1]:\r\n return False\r\n\r\n if pixel[2] / pixel[1] > self.color_tolerance[2] / self.color_tolerance[1]:\r\n return False\r\n \r\n return True","def game_won(self):\n\n # Makes sure every tile is colored,\n for column in self.board:\n for tile in column:\n if not tile.color:\n return False\n\n # Makes sure each color has a line.\n colors = set()\n for dot in self.dots:\n dot_tile = self.board[dot.x][dot.y]\n colors.add(dot.color)\n for dot in self.dots:\n dot_tile = self.board[dot.x][dot.y]\n # If we've already found a line for this color.\n if dot.color not in colors:\n continue\n # If this dot starts a line and ends at the other dot.\n if dot_tile.next and not dot_tile.line_end().is_dot:\n return False\n elif dot_tile.next:\n colors.remove(dot.color)\n # If colors isn't empty, not all colors have lines.\n return not colors","def is_a_player_in_check(self, color):\n\n current_player = color\n if current_player == 'red':\n opposing_player = 'blue'\n else:\n opposing_player = 'red'\n\n if self.can_checkmate(opposing_player):\n return self.get_general(current_player)\n\n if self.can_checkmate(current_player):\n return self.get_general(opposing_player)\n\n return False","def in_check(self, colour):\n from pieces import King, Queen, Bishop, Knight, Rook, Pawn\n king_coord = self.white_king_coord if colour is WHITE else self.black_king_coord\n if king_coord is None:\n return False\n for piece_class in King, Queen, Bishop, Knight, Rook, Pawn:\n dummy_piece = piece_class(colour = colour)\n for coord_to in dummy_piece.iter_move_coords(self, king_coord):\n piece = self[coord_to]\n if isinstance(piece, piece_class) and piece.colour != colour:\n return True\n return False","def stalemate(self):\n last_piece = self.pieces.moveHistory[-1][0]\n last_piece_color = self.pieces.piece_color(last_piece)\n if last_piece_color == \"black\":\n if len(self.whiteMoves) == 0:\n return True\n else:\n if len(self.blackMoves) == 0:\n return True\n return False","def _is_same_color(p1: str, p2: str):\n return p1.islower() == p2.islower()","def CheckProperColoring(G):\r\n coloring_proper = True\r\n\r\n for vertex in G._color:\r\n #print('Vertex',vertex)\r\n #print('G._color',G._color[vertex])\r\n #print('G._adj[vertex]', G._adj[vertex])\r\n for adj_vertex in G._adj[vertex]:\r\n if G._color[vertex] == G._color[adj_vertex]:\r\n coloring_proper = False\r\n #end\r\n #end\r\n #end\r\n\r\n return coloring_proper","def win_check(self):\n\t\t# Create a temp var to capture the number of correct matches\n\t\tright = 0\n\t\t# retrieve peg_guess_color_list for current round\n\t\tguess = self.model.guesses[self.model.status]\n\t\t# retreive solution list\n\t\tsolution = self.model.guesses[\"solution\"]\n\t\t# compare values in each index for both lists against eachother\n\t\tfor i in range(len(solution.pegs)):\n\t\t\t# \n\t\t\tif solution.pegs[i].peg_color == guess.pegs[i].peg_color:\n\t\t\t\tright += 1\n\n\t\t\t\tprint(\"Yay, it works!\")\n\n\t\t# If all indexes of the peg_colors in the solution and guess are True:\n\t\tif right == 4:\n\t\t\treturn True\n\n\t\telse:\n\t\t\treturn False","def check_position_for_same_colour(self, position1, position2):\n return (not self.check_position_free(position1)) and self.check_position_for_same_occupancy(position1, position2)","def check_for_different_colour(self, arg1_position, arg2):\n return (not self.check_position_free(arg1_position)) and (not self.check_for_same_colour(arg1_position, arg2))","def validPlayerColor(color):\n if color not in (RED, GREEN, BLUE, YELLOW):\n return False\n else:\n return True","def checkWin(color_list):\n startcolor = color_list[0][0] #Saves color of [0][0] to variable for easy access\n for i in range(15):\n for k in range(25):\n if color_list[i][k] != startcolor: #If any color is not same as color on [0][0] stop and return False since game is not won\n return False\n return True #If all colors are the same as [0][0] the game ahs been won and return Tture","def answer_ok(a):\n (rightly_positioned, permutated) = a\n if (rightly_positioned + permutated > number_of_positions) \\\n or (rightly_positioned + permutated < len(colours) - number_of_positions):\n return False\n if rightly_positioned == 3 and permutated == 1:\n return False\n return True","def is_piece(\n self,\n rank: RankLike,\n color: ColorLike\n ) -> bool:\n\n return self.is_rank(rank) and self.is_color(color)","def add_a_pawn(self, player, pos_x, pos_y)-> bool:\n if not pos_x in range(0, len(self.grid)) \\\n or not pos_y in range(0, len(self.grid)):\n return False\n if self.grid[pos_x][pos_y].color is None:\n for index_x in range(-1, 2):\n for index_y in range(-1, 2):\n other_pos_x = pos_x + index_x\n other_pos_y = pos_y + index_y\n if other_pos_x < 0 or other_pos_y < 0:\n continue\n if other_pos_x >= self.grid_length or other_pos_y >= self.grid_length:\n continue\n if not self.grid[other_pos_x][other_pos_y].color is None:\n self.grid[other_pos_x][other_pos_y].change_color(player.color)\n self.grid[pos_x][pos_y].change_color(player.color)\n self.last_move.append((pos_x, pos_y))\n return True\n else:\n return False","def is_monochromatic(self):\n return equal(s.color for s in self.iter_states())","def is_solved(self):\n colors = ['green', 'blue', 'red', 'orange', 'white', 'yellow']\n for row in range(3):\n for column in range(3):\n if self.front[row][column] != colors[0]:\n return False\n for row in range(3):\n for column in range(3):\n if self.back[row][column] != colors[1]:\n return False\n for row in range(3):\n for column in range(3):\n if self.right[row][column] != colors[2]:\n return False\n for row in range(3):\n for column in range(3):\n if self.left[row][column] != colors[3]:\n return False\n for row in range(3):\n for column in range(3):\n if self.up[row][column] != colors[4]:\n return False\n for row in range(3):\n for column in range(3):\n if self.down[row][column] != colors[5]:\n return False\n return True","def is_win(self, color):\n win = self.n\n # check y-strips\n for y in range(self.n):\n count = 0\n for x in range(self.n):\n if self[x][y] == color:\n count += 1\n if count == win:\n return True\n # check x-strips\n for x in range(self.n):\n count = 0\n for y in range(self.n):\n if self[x][y] == color:\n count += 1\n if count == win:\n return True\n # check two diagonal strips\n count = 0\n for d in range(self.n):\n if self[d][d] == color:\n count += 1\n if count == win:\n return True\n count = 0\n for d in range(self.n):\n if self[d][self.n - d - 1] == color:\n count += 1\n if count == win:\n return True\n\n return False","def is_on_board(self, r, c):\r\n return 0 <= r <= 7 and 0 <= c <= 7","def checkEndOfGame(self, colorIndex):\n checkColor = self.grid.REPRESENTATION[colorIndex]\n otherColor = self.grid.REPRESENTATION[1-colorIndex]\n emptyColor = self.grid.REPRESENTATION[2]\n for i in range(1, self.grid.width+1):\n for j in range(1, self.grid.height+1):\n if self.grid[i, j] != checkColor:\n continue\n if (i > 2) and (self.grid[i-1, j] == otherColor) and (self.grid[i-2, j] == emptyColor):\n return False\n if (i < self.grid.width-1) and (self.grid[i+1, j] == otherColor) and (self.grid[i+2, j] == emptyColor):\n return False\n if (j > 2) and (self.grid[i, j-1] == otherColor) and (self.grid[i, j-2] == emptyColor):\n return False\n if (j < self.grid.height-1) and (self.grid[i, j+1] == otherColor) and (self.grid[i, j+2] == emptyColor):\n return False\n return True","def is_pawn_move_valid(self, from_row, from_col, to_row, to_col):\n # Setup variables used\n piece = self.board.squares[from_row][from_col]\n piece_color = self.piece_color(piece)\n to_piece = self.board.squares[to_row][to_col]\n row_diff = abs(from_row - to_row)\n col_diff = abs(from_col - to_col)\n dc = 0\n\n # Set flag for first move of pawn\n first_move = True if from_row == 6 or from_row == 1 else False\n\n # If direction is not correct for white, exit\n if to_row - from_row > 0:\n dr = 1\n if self.piece_color(piece) == \"white\":\n return False\n\n # If direction is not correct for black, exit\n if to_row - from_row < 0:\n dr = -1\n if self.piece_color(piece) == \"black\":\n return False\n\n # If moving straight\n if from_col == to_col:\n # if not legal straight move, exit\n if not (row_diff == 1 or (first_move and row_diff == 2)):\n return False\n\n # make sure to move has no pieces on straight path\n dm = row_diff + 1\n\n # return value\n retVal = self._any_piece_in_way(from_row, from_col, dr, dc, dm)\n\n# if retVal and not self.testing:\n# # self.pawn_promotion(to_row, to_col, piece_color)\n# self.board.overwrite_board_square(to_row, to_col)\n# if piece_color == \"black\":\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\n# else:\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\n\n return retVal\n\n # WHITE en passant\n # move from moveHistory => (\"piece\", fromRow, fromCol, toRow, toCol)\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\n self.moveHistory[-1][0] == \"♟\" and self.moveHistory[-1][1] == 1 and\\\n self.moveHistory[-1][3] == 3 and piece_color == \"white\":\n if col_diff == 1 and row_diff == 1 and to_piece == None:\n if not self.testing:\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\n return True\n\n # BLACK en passant\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\n self.moveHistory[-1][0] == \"♙\" and self.moveHistory[-1][1] == 6 and\\\n self.moveHistory[-1][3] == 4 and piece_color == \"black\":\n if col_diff == 1 and row_diff == 1 and to_piece == None:\n if not self.testing:\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\n return True\n\n # else move must be taking piece directly move\n # if legal taking piece move and (opponent-already check for own piece) piece at to-square\n if col_diff == 1 and row_diff == 1 and to_piece != None:\n\n# if not self.testing:\n# # self.pawn_promotion(to_row, to_col, piece_color)\n# self.board.overwrite_board_square(to_row, to_col)\n# if piece_color == \"black\":\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\n# else:\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\n return True\n\n return False","def same_player(self, other):\n return self.name == other.name \\\n and self.color == other.color","def check_color_card(player, color):\n for card in player.cards:\n if card.suit == color:\n return True","def at_exit(piece, colour):\n return ((colour == 'red' and piece.q == BOARDDIM) or\n (colour == 'green' and piece.r == BOARDDIM) or\n (colour == 'blue' and piece.q + piece.r == -BOARDDIM))","def is_in_checkmate(self):\r\n\r\n done = False # Determines when to stop the loop to check\r\n checkmate = True\r\n if not self.is_in_check(\"red\") and not self.is_in_check(\"black\"): # Exits the function if not one side is checked\r\n return False\r\n\r\n board = self._board.get_board()\r\n possible_move_list = []\r\n\r\n # Red's Turn: Creates a list of all possible positions for red to move\r\n if self.get_player_turn() == 1: # Red's turn\r\n for row in range(10):\r\n for col in range(9):\r\n if board[row][col].get_piece() is None or board[row][col].get_piece().get_player_id() == 'b':\r\n possible_move_list.append(self.location_to_pos(row, col))\r\n\r\n # Checks for all possible moves\r\n for row in range(10):\r\n for col in range(9):\r\n if board[row][col].get_piece() is not None:\r\n if board[row][col].get_piece().get_player_id() == 'r': # Loops through all the red pieces on board\r\n start = self.location_to_pos(row,col)\r\n for move in possible_move_list: # Checks for move\r\n if not done:\r\n end_loc = self.parse_pos(move)\r\n end_row = end_loc[0]\r\n end_col = end_loc[1]\r\n end_piece = board[end_row][end_col].get_piece()\r\n end_piece_player_id = None\r\n if end_piece is not None:\r\n end_piece_player_id = end_piece.get_player_id()\r\n if self.make_move(start, move) is True:\r\n if self.is_in_check(\"red\") is False: # If there is a way to get out of a check\r\n done = True\r\n checkmate = False\r\n self.reverse_move(start,move, board, end_piece_player_id, end_piece)\r\n self.set_player_turn(1)\r\n if checkmate:\r\n self.set_game_state('b') # Black wins\r\n\r\n # Black's Turn: Creates a list of all possible positions for black to move\r\n elif self.get_player_turn() == -1: # Blacks's turn\r\n for row in range(10):\r\n for col in range(9):\r\n if board[row][col].get_piece() is None or board[row][col].get_piece().get_player_id() == 'r':\r\n possible_move_list.append(self.location_to_pos(row, col))\r\n\r\n # Checks for all possible moves\r\n for row in range(10):\r\n for col in range(9):\r\n if board[row][col].get_piece() is not None:\r\n if board[row][col].get_piece().get_player_id() == 'b': # Loops through all the black pieces on board\r\n start = self.location_to_pos(row,col)\r\n for move in possible_move_list: # Checks for move\r\n if not done:\r\n end_loc = self.parse_pos(move)\r\n end_row = end_loc[0]\r\n end_col = end_loc[1]\r\n end_piece = board[end_row][end_col].get_piece()\r\n end_piece_player_id = None\r\n if end_piece is not None:\r\n end_piece_player_id = end_piece.get_player_id()\r\n if self.make_move(start, move) is True:\r\n if self.is_in_check(\"black\") is False: # If there is a way to get out of a check\r\n done = True\r\n checkmate = False\r\n self.reverse_move(start,move, board, end_piece_player_id, end_piece)\r\n self.set_player_turn(-1)\r\n if checkmate:\r\n self.set_game_state('r') # Red wins\r","def check_collision(self):\n self.collided = False\n\n for point in self.collision_points:\n\n try:\n if self.game_map.get_at((\n int(point[0]), int(point[1])\n )) == WHITE_COLOR:\n self.collided = True\n break\n except:\n self.collided = True","def gen_is_in_check(self, color, checkmate=False):\n\n gen_location = self.get_general_location(color)\n gen_piece = self._game_board[gen_location[0]][gen_location[1]]\n is_red = color == \"red\"\n opposite_color = \"black\" if is_red else \"red\"\n opposing_gen_loc = self.get_general_location(opposite_color)\n opposing_col_moves = self.avaiable_moves_for_color(opposite_color)\n\n # if checkmate is true\n if checkmate:\n gen_moves = gen_piece.available_moves(self._game_board)\n # for each available move\n for move in gen_moves:\n # move piece\n self.move_pieces(gen_location,move)\n # check if gen_is_in_check on the new board\n if not self.gen_is_in_check(color):\n # if any return false, move piece back to location and return false\n self.move_pieces(move, gen_location)\n return False\n else:\n self.move_pieces(move, gen_location)\n return True\n\n # if checkmate is False\n if not checkmate:\n # if gen's location is in opposing colors moves\n if gen_location in opposing_col_moves:\n return True","def c_equals(a, b):\n alpha = library.PixelGetAlpha\n return bool(library.IsPixelWandSimilar(a, b, 0) and\n alpha(a) == alpha(b))","def is_color(self, color: ColorLike) -> bool:\n\n if isinstance(color, Color):\n return self.color == color\n elif isinstance(color, str):\n return str(self.color) == color\n elif isinstance(color, int):\n return int(self.color) == color\n return False","def __eq__(self, other):\n return (\n self.bg_color == other.bg_color and\n self.width == other.width and\n self.height == other.height\n )","def fully_equal(left, right, compare_color=True):\n color = not compare_color or left.color == right.color\n return (left == right and\n left.is_initial == right.is_initial and\n left.is_final == right.is_final and\n left.final_word_out == right.final_word_out and\n left.word_out == right.word_out and\n color and\n left.initial_probability == right.initial_probability)","def is_dark(self):\n\n return self.red() < 125 and self.green() < 125 and self.blue() < 125","def __eq__(self, other):\n return type(other) is type(self) and other.color == self.color","def _is_taking_own_piece(self, from_row, from_col, to_row, to_col):\n # Get piece being moved\n piece = self.board.squares[from_row][from_col]\n piece_color = self.piece_color(piece)\n\n # is piece trying to take it's own piece?\n to_piece = self.board.squares[to_row][to_col]\n if to_piece != None:\n if self.piece_color(to_piece) == piece_color:\n return True\n return False","def has_winner(self):\n if self.color_check_mate(ChessGame.BLACK):\n return ChessGame.WHITE\n elif self.color_check_mate(ChessGame.WHITE):\n return ChessGame.BLACK\n else:\n return None","def check_moves(self, board, self_color, coords, delta):\r\n found_opponent = False\r\n for i in range(1, 8):\r\n dr = coords[0] + i * delta[0]\r\n dc = coords[1] + i * delta[1]\r\n\r\n if self.is_on_board(dr, dc):\r\n if board[dr][dc] == self_color:\r\n break\r\n\r\n elif board[dr][dc] == self.get_opponent_color(self_color):\r\n found_opponent = True\r\n\r\n elif board[dr][dc] == self.EMPTY:\r\n if found_opponent:\r\n return dr, dc\r\n else:\r\n break","def is_current_players_piece(piece: str, white_turn: bool) -> bool:\n if white_turn and piece in WHITE_PIECES:\n return True\n elif not white_turn and piece in BLACK_PIECES:\n return True\n else:\n return False","def is_finished(self)-> bool:\n for line in self.grid:\n for pawn in line:\n if pawn.color is None:\n return False\n return True","def check_color(i, j, k):\n img.show()\n image = Image.new(\"RGB\", (200, 200), (int(Y), int(Y), int(Y)))\n image.show()\n image = Image.new(\"RGB\", (200, 200), (int(i), int(j), int(k)))\n image.show()","def has_friendly_piece(self, piece) -> bool:\r\n if self.has_piece():\r\n if piece.get_color() == self.get_piece().get_color():\r\n return True\r\n \r\n return False","def _ischeckopponent(self, from_, to_):\n opp_color = 'W' if self.to_move == 'B' else 'B'\n opp_king_pos = self.board.get_occupants(color=opp_color, notation='K')[0]\n\n diff = (\n opp_king_pos[0] - to_cartesian(to_)[0],\n opp_king_pos[1] - to_cartesian(to_)[1]\n )\n\n if diff in self.board[from_].occupant.get_captures():\n if self.board[from_].occupant.hopping:\n return True\n\n if not self.board.isblocked(to_, opp_king_pos):\n return True\n\n return False","def checkMove(move: Card, game) -> bool:\n lastMove = game.lastMove\n\n if move.number == lastMove.number:\n return True\n\n elif move.color == lastMove.color: \n return True\n\n elif move.wild: \n return True\n\n return False","def check_game_over(self):\n red, blue = self.board.count_piece()\n if blue == 0:\n self.ui.show_result(\"RED WIN!\")\n self.turn = RED\n elif red == 0:\n self.ui.show_result(\"BLUE WIN!\")\n self.turn = BLUE\n elif red == blue == 1:\n self.ui.show_result(\"DRAW!\")","def game_over(self):\n red_minion = 0\n blue_minion = 0\n red_master = 0\n blue_master = 0\n only_masters = True\n for row in self.board:\n for piece in row:\n if piece != 0:\n if not piece.master:\n if piece.player:\n blue_minion += 1\n else:\n red_minion += 1\n only_masters = False\n else:\n if piece.player:\n blue_master += 1\n else:\n red_master += 1\n if blue_minion + blue_master == 0:\n self.winner = \"Red\"\n self.red_victories += 1\n self.number_of_games +=1\n self.game_over_screen()\n return True\n elif red_minion + red_master == 0:\n self.winner = \"Blue\"\n self.blue_victories += 1\n self.number_of_games +=1\n self.game_over_screen()\n return True\n elif only_masters:\n if red_master > blue_master:\n self.winner = \"Red\"\n self.red_victories += 1\n elif blue_master > red_master:\n self.winner = \"Blue\"\n self.blue_victories += 1\n else:\n self.winner = \"Nobody\"\n self.number_of_games +=1\n self.game_over_screen()\n return True\n \n return False","def hash_comparison(self):\n for result in self.cards:\n if result.hash_status:\n return True\n return False","def update_tile(tile, color, tiles):\n if color == BLACK:\n return num_black_neighbors(tile, tiles) in [1, 2]\n if color == WHITE:\n return num_black_neighbors(tile, tiles) == 2","def rgb(self) -> bool:\n return self.image_shape[2] == 3","def test_exist_and_change(self):\n colorList = ColorList()\n prev = colorList.pickColor()\n self.assertIsNotNone(prev)\n for i in range(100):\n color = colorList.pickColor()\n self.assertIsNotNone(color)\n self.assertTrue(color.r != prev.r or color.g != prev.g or color.b != prev.b)\n prev = color","def check_up(self, i, j, board):\r\n color = board.pieceAt(i, j)\r\n\r\n row = True\r\n for k in range(4):\r\n row &= board.pieceAt(i-k, j) is color\r\n\r\n if row:\r\n return color\r\n else:\r\n return Color.EMPTY","def can_change_colors(self):\n return self.condition is None or self.get_state(self.condition[\"entity\"]) == self.condition[\"state\"]","def is_en_passant(self, from_col, from_row, to_col, to_row):\n from_square = self.get_square(from_col, from_row)\n to_square = self.get_square(to_col, to_row)\n taking_square = self.get_square(to_col, from_row)\n # Check the to_col is next to the from_col\n if abs(ord(from_col) - ord(to_col)) != 1:\n return False\n # Check the from row is correct (5 for white, 4 for black)\n elif from_row != (5 if from_square.isupper() else 4):\n return False\n # Check the from square is a pawn\n elif from_square.lower() != 'p':\n return False\n # Check the to square is empty\n elif self.get_square(to_col, to_row) != ' ':\n return False\n # Check the square being taken is a pawn of the opposite colour\n elif taking_square.lower() != 'p' or taking_square == from_square:\n return False\n else:\n # It is a valid en-passant move\n return True","def red_has_won(self):\n return not any([self.squares[p].is_red() for p in self.squares \\\n if self.squares[p]])","def __eq__(self, other):\n return self.is_red() == other.is_red()","def is_cue_color(color, tolerance = 100):\n return col_diff(color, CUE_COLOR) <= tolerance","def colorOK(colorStr):\n tkWdg = _getTkWdg()\n\n try:\n tkWdg.winfo_rgb(colorStr)\n except tkinter.TclError:\n return False\n return True","def solved(self):\n\n for p in self.pieces:\n if [p.x, p.y, p.z].count(0) < 2: # Filter out centers.\n # Compare each sticker color with its respective center.\n for i, s in enumerate(p.stickers):\n cen = self.getpiece(s.x, s.y, s.z).getsticker(s.x, s.y, s.z)\n if s.c != cen.c:\n return False\n\n return True","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 validate_hair_color(passport: map) -> bool:\n if passport.get('hcl'):\n regex = re.compile('#[0-9a-f]{6}')\n match = regex.match(passport['hcl'])\n return bool(match)\n\n return False","def checks_check(self, turn):\n opposite_colour = next_turn(turn)\n\n if piece_class.KING_LOCATION[opposite_colour] in self.path_dict[turn]:\n self.print_message(\"CHECK!\")\n# self.checkmate(turn)\n self.mate_double(turn)\n self.mate_pinned(turn)\n self.mate_normal(turn)\n\n if piece_class.KING_LOCATION[turn] in self.path_dict[opposite_colour]:\n return True\n\n else:\n return False","def has_clashes(the_board):\r\n for c in range(1, len(the_board)):\r\n if col_clashes(the_board, c):\r\n return True\r\n return False","def GreenFilter(c):\n if (c[1] > c[0]) and (c[1] > c[2]) and (c[0] == c[2]): return True\n else: return False","def pawnTo(self, direction) :\n dirCoord = add(self.coord, direction)\n return self.board.playerCellList[dirCoord[0]][dirCoord[1]].hasPawn","def _is_color_valid(self, color):\n # make sure it is a tuple\n if type(color).__name__ != 'tuple':\n return False\n # check the length of the tuple\n if len(color) != 3:\n return False\n # verify that component colors are between _MIN and _MAX\n for c in color:\n if c < MIN or c > MAX:\n return False\n return True","def has_enemy_piece(self, piece) -> bool:\r\n if self.has_piece():\r\n if piece.get_color() != self.get_piece().get_color():\r\n return True\r\n \r\n return False","def has_clashes(the_board):\r\n for col in range(1,len(the_board)):\r\n if col_clashes(the_board, col):\r\n return True\r\n return False","def has_clashes(the_board):\r\n for col in range(1,len(the_board)):\r\n if col_clashes(the_board, col):\r\n return True\r\n return False","def _check_zone_locks(self, start, end):\n color = self._board[start]\n goal = CheckersGame.opposite[color]\n\n start_zone = FULL_BOARD[start]\n end_zone = FULL_BOARD[end]\n\n # You can always get into your own goal\n # and you can always move within a zone.\n if end_zone == start_zone or end_zone == goal:\n return True\n # So now we can assume they changed zones.\n # And that if they're in a goal, it's not their own.\n\n # The first rule is that if a piece is in *its destination goal*,\n # it can't be moved outside of it.\n # The second rule is that we may not move into a zone which is\n # another player's spawn or goal\n if start_zone == goal or end_zone == color:\n return False\n return True","def valid(black, white, x, y):\n return (not black & gobit[(x, y)]) and (not white & gobit[(x, y)])","def check(self, grain=50):\n opengles.glReadPixels(0, 0, self.ix, self.iy,\n GL_RGB, GL_UNSIGNED_BYTE,\n ctypes.byref(self.img))\n r0 = self.img[0:3]\n step = 3 * int(self.ix * self.iy / 50)\n for i in xrange(0, len(self.img)-3, step):\n if self.img[i:(i+3)] != r0:\n return True\n\n return False","def _check_redshift(self, red):\n if np.min(np.abs(red - self.zout)) > 0.01:\n return 0\n return 1","def has_clashes(the_board):\n for col in range(1,len(the_board)):\n if col_clashes(the_board, col):\n return True\n return False","def has_clashes(the_board):\n for col in range(1,len(the_board)):\n if col_clashes(the_board, col):\n return True\n return False","def combine_test():\n\n red = create_image(1, 3, create_color(255, 0, 0))\n green = create_image(1, 3, create_color(0, 255, 0))\n blue = create_image(1, 3, create_color(0, 0, 255))\n\n expected = create_image(1, 3, create_color(255, 255, 255))\n\n result = combine(red, green, blue)\n\n for x, y, (r, g, b) in result:\n if (r, g, b) == tuple(get_color(expected, x, y)):\n print(\"Pixel at (\" + str(x) + \",\" + str(y) + \") passed.\")\n else:\n print(\"Pixel at (\" + str(x) + \",\" + str(y) + \") failed. Expected \" + str((r, g, b)) + \" got \"\n + str(get_color(expected, x, y)))","def has_clashes(the_board):\n for col in range(1, len(the_board)):\n if col_clashes(the_board, col):\n return True\n return False","def select_our_piece(self):\n return self.board.location(self.mouse_pos) is not None and self.board.location(self.mouse_pos).color == self.turn","def test_p1_color_map(grid):\n space = bempp.api.function_space(grid, \"P\", 1)\n\n colors_unique = True\n\n for local_dofs in space.global2local:\n colors = [space.color_map[elem] for elem, _ in local_dofs]\n if len(colors) != len(set(colors)):\n colors_unique = False\n\n assert colors_unique","def is_game_finish(self):\n for row in self.chessboard:\n for val in row:\n if not val.is_correct_state():\n return False\n return True","def IsOk(*args, **kwargs):\n return _gdi_.Colour_IsOk(*args, **kwargs)","def __eq__(*args, **kwargs):\n return _gdi_.Colour___eq__(*args, **kwargs)","def is_valid(current_card: Card, destination: Card) -> bool:\n # TODO: check for a card to a space is only Kings; maybe in the board?\n match = current_card.color == destination.color\n difference = destination.value - current_card.value\n if not match and difference == 1:\n return True\n else:\n return False","def test_if_bottom_color_player_well_set(self):\n ui = UIRender(TestUI.image_path)\n ui.set_bottom_player_color(CELTIC_GREEN)\n self.assertEqual(ui.bottom_player_color, CELTIC_GREEN)\n self.assertEqual(ui.top_player_color, SPQR_RED)\n ui.set_bottom_player_color(SPQR_RED)\n self.assertEqual(ui.bottom_player_color, SPQR_RED)\n self.assertEqual(ui.top_player_color, CELTIC_GREEN)","def piece_color(self, piece):\n if piece == None:\n return None\n if ord(ChessPiece.W_KING) <= ord(piece) <= ord(ChessPiece.W_PAWN):\n return \"white\"\n return \"black\"","def testKingOnly(board):\n return bin(board.friends[board.color]).count(\"1\") == 1","def inside_gamut(rgb: ndarray) -> bool:\n return all(rgb >= 0)","def is_red(self):\n return \"red\" == self.color","def test_issue_269(self):\n\n c = pygame.Color(0)\n c.hsva = 360, 0, 0, 0\n self.assertEqual(c.hsva, (0, 0, 0, 0))\n c.hsva = 360, 100, 100, 100\n self.assertEqual(c.hsva, (0, 100, 100, 100))\n self.assertEqual(c, (255, 0, 0, 255))","def is_black(self):\n return \"black\" == self.color","def check(self, grain=50):\r\n opengles.glDisable(GL_SCISSOR_TEST)\r\n self.s_flg = False\r\n opengles.glReadPixels(0, self.y0, self.ix, 1,\r\n GL_RGB, GL_UNSIGNED_BYTE,\r\n ctypes.byref(self.img))\r\n r0 = self.img[0:3]\r\n for i in xrange(0, self.img_sz, self.step):\r\n if self.img[i:(i+3)] != r0:\r\n return True\r\n\r\n return False","def IsColor(self, *args):\n return _XCAFDoc.XCAFDoc_ColorTool_IsColor(self, *args)","def contains_black(image):\n extrema = ImageStat.Stat(image).extrema\n r = extrema[0][0]\n g = extrema[1][0]\n b = extrema[2][0]\n\n if r == 0 and g == 0 and b == 0:\n return True\n\n return False","def PinkFilter(c):\n if (c[0] > c[1]) and (c[2] > c[1]) and (c[2] == c[0]): return True\n else: return False","def check_opponent_winning(self):\n valid_actions = self.get_valid_actions()\n copy_board = np.copy(self.board)\n for action in list(valid_actions):\n height = self.get_height(action, board=copy_board)\n self.set(action, height=height, value=self.current_player * -1, board=copy_board)\n\n if self.check_winner(copy_board, action, height) != 0:\n return True\n\n self.set(action, height=height, value=0, board=copy_board)\n\n return False","def castling_valid(self, turn, direction):\n \n opposite_colour = next_turn(turn)\n\n \n if self.board[direction[0]] and self.board[direction[-1]] != self.empty:\n if ((self.board[direction[0]].graphic) == piece_class.PIECEDICT[turn][piece_class.King] and \n (self.board[direction[-1]].graphic) == piece_class.PIECEDICT[turn][piece_class.Rook]):\n if self.board[direction[0]].move_track == False and self.board[direction[-1]].move_track == False:\n for i in self.path_dict[opposite_colour]:\n if i in self.coords:\n if self.coords.index(i) == direction[0]:\n \n return False\n \n if self.coords.index(i) == direction[1]:\n \n return False\n \n if self.coords.index(i) == direction[2]:\n \n return False\n \n if len(direction) == 4:\n if self.board[direction[1]] == self.empty:\n if self.board[direction[2]] == self.empty:\n \n return True\n \n if len(direction) == 5:\n if self.board[direction[1]] == self.empty:\n if self.board[direction[2]] == self.empty:\n if self.board[direction[3]] == self.empty:\n \n return True\n \n return False","def same_color(suit):\n\tif suit == 's':\n\t\treturn 'c'\n\telif suit == 'c':\n\t\treturn 's'\n\telif suit == 'd':\n\t\treturn 'h'\n\telif suit == 'h':\n\t\treturn 'd'","def check(chessboard, row, col, n):\n for i in range(col):\n if chessboard[row][i] == 1:\n return False\n\n for j, i in zip(range(row, -1, -1), range(col, -1, -1)):\n if chessboard[j][i] == 1:\n return False\n \n for j, i in zip(range(row, n, 1), range(col, -1, -1)):\n if chessboard[j][i] == 1:\n return False\n\n return True"],"string":"[\n \"def same_color(self, other: 'Piece') -> bool:\\n\\n return self.color == other.color\",\n \"def color_check_mate(self, mycolor):\\n\\n if not self.color_in_check(mycolor):\\n return False\\n\\n incheck = True\\n for (x, y) in self.__players[mycolor]:\\n moves = self._get_piece_moves(x, y)\\n for to in moves:\\n res, captured = self._make_move((x, y), to)\\n if not self.color_in_check(mycolor):\\n incheck = False\\n\\n self._unmake_move(to, (x, y), captured)\\n if not incheck:\\n return False\\n\\n return incheck\",\n \"def color_in_check(self, mycolor):\\n\\n opponent = self.__players[self.get_opponent_color(mycolor)]\\n\\n x, y = None, None\\n for (u, v) in self.__players[mycolor]:\\n piece = self.get_piece(u, v)\\n if not piece:\\n raise ValueError()\\n\\n if self.get_piece(u, v).name == 'king':\\n x, y = u, v\\n break\\n\\n for (u, v) in opponent:\\n if (x, y) in self._get_piece_moves(u, v):\\n return True\\n\\n return False\",\n \"def can_checkmate(self, color):\\n\\n if color == 'red':\\n opposing_color = 'blue'\\n else:\\n opposing_color = 'red'\\n general_location = None\\n\\n for piece in self._active_pieces[opposing_color]:\\n if type(piece) is General:\\n general_location = self.translate_to_algebraic(piece.get_location())\\n break\\n for piece in self._active_pieces[color]:\\n piece_location = self.translate_to_algebraic(piece.get_location())\\n if piece.validate_move(piece_location, general_location, self._board):\\n return True\\n return False\",\n \"def check_win(self, color):\\n if dijkstra(self, color) == 0:\\n return True\\n else:\\n return False\",\n \"def is_green(self, pixel: tuple) -> bool:\\r\\n\\r\\n # If the pixel is more green than any other color,\\r\\n # Then we consider is a plant pixel\\r\\n if pixel[0] < pixel[1] and pixel[2] < pixel[1]:\\r\\n return True\\r\\n\\r\\n # The following rules are for fine adjusments\\r\\n # These tolerances may vary by photo\\r\\n if pixel[0] > self.max_brightness:\\r\\n return False\\r\\n\\r\\n if pixel[1] < self.min_brightness:\\r\\n return False\\r\\n \\r\\n if pixel[0] / pixel[1] > self.color_tolerance[0] / self.color_tolerance[1]:\\r\\n return False\\r\\n\\r\\n if pixel[2] / pixel[1] > self.color_tolerance[2] / self.color_tolerance[1]:\\r\\n return False\\r\\n \\r\\n return True\",\n \"def game_won(self):\\n\\n # Makes sure every tile is colored,\\n for column in self.board:\\n for tile in column:\\n if not tile.color:\\n return False\\n\\n # Makes sure each color has a line.\\n colors = set()\\n for dot in self.dots:\\n dot_tile = self.board[dot.x][dot.y]\\n colors.add(dot.color)\\n for dot in self.dots:\\n dot_tile = self.board[dot.x][dot.y]\\n # If we've already found a line for this color.\\n if dot.color not in colors:\\n continue\\n # If this dot starts a line and ends at the other dot.\\n if dot_tile.next and not dot_tile.line_end().is_dot:\\n return False\\n elif dot_tile.next:\\n colors.remove(dot.color)\\n # If colors isn't empty, not all colors have lines.\\n return not colors\",\n \"def is_a_player_in_check(self, color):\\n\\n current_player = color\\n if current_player == 'red':\\n opposing_player = 'blue'\\n else:\\n opposing_player = 'red'\\n\\n if self.can_checkmate(opposing_player):\\n return self.get_general(current_player)\\n\\n if self.can_checkmate(current_player):\\n return self.get_general(opposing_player)\\n\\n return False\",\n \"def in_check(self, colour):\\n from pieces import King, Queen, Bishop, Knight, Rook, Pawn\\n king_coord = self.white_king_coord if colour is WHITE else self.black_king_coord\\n if king_coord is None:\\n return False\\n for piece_class in King, Queen, Bishop, Knight, Rook, Pawn:\\n dummy_piece = piece_class(colour = colour)\\n for coord_to in dummy_piece.iter_move_coords(self, king_coord):\\n piece = self[coord_to]\\n if isinstance(piece, piece_class) and piece.colour != colour:\\n return True\\n return False\",\n \"def stalemate(self):\\n last_piece = self.pieces.moveHistory[-1][0]\\n last_piece_color = self.pieces.piece_color(last_piece)\\n if last_piece_color == \\\"black\\\":\\n if len(self.whiteMoves) == 0:\\n return True\\n else:\\n if len(self.blackMoves) == 0:\\n return True\\n return False\",\n \"def _is_same_color(p1: str, p2: str):\\n return p1.islower() == p2.islower()\",\n \"def CheckProperColoring(G):\\r\\n coloring_proper = True\\r\\n\\r\\n for vertex in G._color:\\r\\n #print('Vertex',vertex)\\r\\n #print('G._color',G._color[vertex])\\r\\n #print('G._adj[vertex]', G._adj[vertex])\\r\\n for adj_vertex in G._adj[vertex]:\\r\\n if G._color[vertex] == G._color[adj_vertex]:\\r\\n coloring_proper = False\\r\\n #end\\r\\n #end\\r\\n #end\\r\\n\\r\\n return coloring_proper\",\n \"def win_check(self):\\n\\t\\t# Create a temp var to capture the number of correct matches\\n\\t\\tright = 0\\n\\t\\t# retrieve peg_guess_color_list for current round\\n\\t\\tguess = self.model.guesses[self.model.status]\\n\\t\\t# retreive solution list\\n\\t\\tsolution = self.model.guesses[\\\"solution\\\"]\\n\\t\\t# compare values in each index for both lists against eachother\\n\\t\\tfor i in range(len(solution.pegs)):\\n\\t\\t\\t# \\n\\t\\t\\tif solution.pegs[i].peg_color == guess.pegs[i].peg_color:\\n\\t\\t\\t\\tright += 1\\n\\n\\t\\t\\t\\tprint(\\\"Yay, it works!\\\")\\n\\n\\t\\t# If all indexes of the peg_colors in the solution and guess are True:\\n\\t\\tif right == 4:\\n\\t\\t\\treturn True\\n\\n\\t\\telse:\\n\\t\\t\\treturn False\",\n \"def check_position_for_same_colour(self, position1, position2):\\n return (not self.check_position_free(position1)) and self.check_position_for_same_occupancy(position1, position2)\",\n \"def check_for_different_colour(self, arg1_position, arg2):\\n return (not self.check_position_free(arg1_position)) and (not self.check_for_same_colour(arg1_position, arg2))\",\n \"def validPlayerColor(color):\\n if color not in (RED, GREEN, BLUE, YELLOW):\\n return False\\n else:\\n return True\",\n \"def checkWin(color_list):\\n startcolor = color_list[0][0] #Saves color of [0][0] to variable for easy access\\n for i in range(15):\\n for k in range(25):\\n if color_list[i][k] != startcolor: #If any color is not same as color on [0][0] stop and return False since game is not won\\n return False\\n return True #If all colors are the same as [0][0] the game ahs been won and return Tture\",\n \"def answer_ok(a):\\n (rightly_positioned, permutated) = a\\n if (rightly_positioned + permutated > number_of_positions) \\\\\\n or (rightly_positioned + permutated < len(colours) - number_of_positions):\\n return False\\n if rightly_positioned == 3 and permutated == 1:\\n return False\\n return True\",\n \"def is_piece(\\n self,\\n rank: RankLike,\\n color: ColorLike\\n ) -> bool:\\n\\n return self.is_rank(rank) and self.is_color(color)\",\n \"def add_a_pawn(self, player, pos_x, pos_y)-> bool:\\n if not pos_x in range(0, len(self.grid)) \\\\\\n or not pos_y in range(0, len(self.grid)):\\n return False\\n if self.grid[pos_x][pos_y].color is None:\\n for index_x in range(-1, 2):\\n for index_y in range(-1, 2):\\n other_pos_x = pos_x + index_x\\n other_pos_y = pos_y + index_y\\n if other_pos_x < 0 or other_pos_y < 0:\\n continue\\n if other_pos_x >= self.grid_length or other_pos_y >= self.grid_length:\\n continue\\n if not self.grid[other_pos_x][other_pos_y].color is None:\\n self.grid[other_pos_x][other_pos_y].change_color(player.color)\\n self.grid[pos_x][pos_y].change_color(player.color)\\n self.last_move.append((pos_x, pos_y))\\n return True\\n else:\\n return False\",\n \"def is_monochromatic(self):\\n return equal(s.color for s in self.iter_states())\",\n \"def is_solved(self):\\n colors = ['green', 'blue', 'red', 'orange', 'white', 'yellow']\\n for row in range(3):\\n for column in range(3):\\n if self.front[row][column] != colors[0]:\\n return False\\n for row in range(3):\\n for column in range(3):\\n if self.back[row][column] != colors[1]:\\n return False\\n for row in range(3):\\n for column in range(3):\\n if self.right[row][column] != colors[2]:\\n return False\\n for row in range(3):\\n for column in range(3):\\n if self.left[row][column] != colors[3]:\\n return False\\n for row in range(3):\\n for column in range(3):\\n if self.up[row][column] != colors[4]:\\n return False\\n for row in range(3):\\n for column in range(3):\\n if self.down[row][column] != colors[5]:\\n return False\\n return True\",\n \"def is_win(self, color):\\n win = self.n\\n # check y-strips\\n for y in range(self.n):\\n count = 0\\n for x in range(self.n):\\n if self[x][y] == color:\\n count += 1\\n if count == win:\\n return True\\n # check x-strips\\n for x in range(self.n):\\n count = 0\\n for y in range(self.n):\\n if self[x][y] == color:\\n count += 1\\n if count == win:\\n return True\\n # check two diagonal strips\\n count = 0\\n for d in range(self.n):\\n if self[d][d] == color:\\n count += 1\\n if count == win:\\n return True\\n count = 0\\n for d in range(self.n):\\n if self[d][self.n - d - 1] == color:\\n count += 1\\n if count == win:\\n return True\\n\\n return False\",\n \"def is_on_board(self, r, c):\\r\\n return 0 <= r <= 7 and 0 <= c <= 7\",\n \"def checkEndOfGame(self, colorIndex):\\n checkColor = self.grid.REPRESENTATION[colorIndex]\\n otherColor = self.grid.REPRESENTATION[1-colorIndex]\\n emptyColor = self.grid.REPRESENTATION[2]\\n for i in range(1, self.grid.width+1):\\n for j in range(1, self.grid.height+1):\\n if self.grid[i, j] != checkColor:\\n continue\\n if (i > 2) and (self.grid[i-1, j] == otherColor) and (self.grid[i-2, j] == emptyColor):\\n return False\\n if (i < self.grid.width-1) and (self.grid[i+1, j] == otherColor) and (self.grid[i+2, j] == emptyColor):\\n return False\\n if (j > 2) and (self.grid[i, j-1] == otherColor) and (self.grid[i, j-2] == emptyColor):\\n return False\\n if (j < self.grid.height-1) and (self.grid[i, j+1] == otherColor) and (self.grid[i, j+2] == emptyColor):\\n return False\\n return True\",\n \"def is_pawn_move_valid(self, from_row, from_col, to_row, to_col):\\n # Setup variables used\\n piece = self.board.squares[from_row][from_col]\\n piece_color = self.piece_color(piece)\\n to_piece = self.board.squares[to_row][to_col]\\n row_diff = abs(from_row - to_row)\\n col_diff = abs(from_col - to_col)\\n dc = 0\\n\\n # Set flag for first move of pawn\\n first_move = True if from_row == 6 or from_row == 1 else False\\n\\n # If direction is not correct for white, exit\\n if to_row - from_row > 0:\\n dr = 1\\n if self.piece_color(piece) == \\\"white\\\":\\n return False\\n\\n # If direction is not correct for black, exit\\n if to_row - from_row < 0:\\n dr = -1\\n if self.piece_color(piece) == \\\"black\\\":\\n return False\\n\\n # If moving straight\\n if from_col == to_col:\\n # if not legal straight move, exit\\n if not (row_diff == 1 or (first_move and row_diff == 2)):\\n return False\\n\\n # make sure to move has no pieces on straight path\\n dm = row_diff + 1\\n\\n # return value\\n retVal = self._any_piece_in_way(from_row, from_col, dr, dc, dm)\\n\\n# if retVal and not self.testing:\\n# # self.pawn_promotion(to_row, to_col, piece_color)\\n# self.board.overwrite_board_square(to_row, to_col)\\n# if piece_color == \\\"black\\\":\\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\\n# else:\\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\\n\\n return retVal\\n\\n # WHITE en passant\\n # move from moveHistory => (\\\"piece\\\", fromRow, fromCol, toRow, toCol)\\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\\\\n self.moveHistory[-1][0] == \\\"♟\\\" and self.moveHistory[-1][1] == 1 and\\\\\\n self.moveHistory[-1][3] == 3 and piece_color == \\\"white\\\":\\n if col_diff == 1 and row_diff == 1 and to_piece == None:\\n if not self.testing:\\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\\n return True\\n\\n # BLACK en passant\\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\\\\n self.moveHistory[-1][0] == \\\"♙\\\" and self.moveHistory[-1][1] == 6 and\\\\\\n self.moveHistory[-1][3] == 4 and piece_color == \\\"black\\\":\\n if col_diff == 1 and row_diff == 1 and to_piece == None:\\n if not self.testing:\\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\\n return True\\n\\n # else move must be taking piece directly move\\n # if legal taking piece move and (opponent-already check for own piece) piece at to-square\\n if col_diff == 1 and row_diff == 1 and to_piece != None:\\n\\n# if not self.testing:\\n# # self.pawn_promotion(to_row, to_col, piece_color)\\n# self.board.overwrite_board_square(to_row, to_col)\\n# if piece_color == \\\"black\\\":\\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\\n# else:\\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\\n return True\\n\\n return False\",\n \"def same_player(self, other):\\n return self.name == other.name \\\\\\n and self.color == other.color\",\n \"def check_color_card(player, color):\\n for card in player.cards:\\n if card.suit == color:\\n return True\",\n \"def at_exit(piece, colour):\\n return ((colour == 'red' and piece.q == BOARDDIM) or\\n (colour == 'green' and piece.r == BOARDDIM) or\\n (colour == 'blue' and piece.q + piece.r == -BOARDDIM))\",\n \"def is_in_checkmate(self):\\r\\n\\r\\n done = False # Determines when to stop the loop to check\\r\\n checkmate = True\\r\\n if not self.is_in_check(\\\"red\\\") and not self.is_in_check(\\\"black\\\"): # Exits the function if not one side is checked\\r\\n return False\\r\\n\\r\\n board = self._board.get_board()\\r\\n possible_move_list = []\\r\\n\\r\\n # Red's Turn: Creates a list of all possible positions for red to move\\r\\n if self.get_player_turn() == 1: # Red's turn\\r\\n for row in range(10):\\r\\n for col in range(9):\\r\\n if board[row][col].get_piece() is None or board[row][col].get_piece().get_player_id() == 'b':\\r\\n possible_move_list.append(self.location_to_pos(row, col))\\r\\n\\r\\n # Checks for all possible moves\\r\\n for row in range(10):\\r\\n for col in range(9):\\r\\n if board[row][col].get_piece() is not None:\\r\\n if board[row][col].get_piece().get_player_id() == 'r': # Loops through all the red pieces on board\\r\\n start = self.location_to_pos(row,col)\\r\\n for move in possible_move_list: # Checks for move\\r\\n if not done:\\r\\n end_loc = self.parse_pos(move)\\r\\n end_row = end_loc[0]\\r\\n end_col = end_loc[1]\\r\\n end_piece = board[end_row][end_col].get_piece()\\r\\n end_piece_player_id = None\\r\\n if end_piece is not None:\\r\\n end_piece_player_id = end_piece.get_player_id()\\r\\n if self.make_move(start, move) is True:\\r\\n if self.is_in_check(\\\"red\\\") is False: # If there is a way to get out of a check\\r\\n done = True\\r\\n checkmate = False\\r\\n self.reverse_move(start,move, board, end_piece_player_id, end_piece)\\r\\n self.set_player_turn(1)\\r\\n if checkmate:\\r\\n self.set_game_state('b') # Black wins\\r\\n\\r\\n # Black's Turn: Creates a list of all possible positions for black to move\\r\\n elif self.get_player_turn() == -1: # Blacks's turn\\r\\n for row in range(10):\\r\\n for col in range(9):\\r\\n if board[row][col].get_piece() is None or board[row][col].get_piece().get_player_id() == 'r':\\r\\n possible_move_list.append(self.location_to_pos(row, col))\\r\\n\\r\\n # Checks for all possible moves\\r\\n for row in range(10):\\r\\n for col in range(9):\\r\\n if board[row][col].get_piece() is not None:\\r\\n if board[row][col].get_piece().get_player_id() == 'b': # Loops through all the black pieces on board\\r\\n start = self.location_to_pos(row,col)\\r\\n for move in possible_move_list: # Checks for move\\r\\n if not done:\\r\\n end_loc = self.parse_pos(move)\\r\\n end_row = end_loc[0]\\r\\n end_col = end_loc[1]\\r\\n end_piece = board[end_row][end_col].get_piece()\\r\\n end_piece_player_id = None\\r\\n if end_piece is not None:\\r\\n end_piece_player_id = end_piece.get_player_id()\\r\\n if self.make_move(start, move) is True:\\r\\n if self.is_in_check(\\\"black\\\") is False: # If there is a way to get out of a check\\r\\n done = True\\r\\n checkmate = False\\r\\n self.reverse_move(start,move, board, end_piece_player_id, end_piece)\\r\\n self.set_player_turn(-1)\\r\\n if checkmate:\\r\\n self.set_game_state('r') # Red wins\\r\",\n \"def check_collision(self):\\n self.collided = False\\n\\n for point in self.collision_points:\\n\\n try:\\n if self.game_map.get_at((\\n int(point[0]), int(point[1])\\n )) == WHITE_COLOR:\\n self.collided = True\\n break\\n except:\\n self.collided = True\",\n \"def gen_is_in_check(self, color, checkmate=False):\\n\\n gen_location = self.get_general_location(color)\\n gen_piece = self._game_board[gen_location[0]][gen_location[1]]\\n is_red = color == \\\"red\\\"\\n opposite_color = \\\"black\\\" if is_red else \\\"red\\\"\\n opposing_gen_loc = self.get_general_location(opposite_color)\\n opposing_col_moves = self.avaiable_moves_for_color(opposite_color)\\n\\n # if checkmate is true\\n if checkmate:\\n gen_moves = gen_piece.available_moves(self._game_board)\\n # for each available move\\n for move in gen_moves:\\n # move piece\\n self.move_pieces(gen_location,move)\\n # check if gen_is_in_check on the new board\\n if not self.gen_is_in_check(color):\\n # if any return false, move piece back to location and return false\\n self.move_pieces(move, gen_location)\\n return False\\n else:\\n self.move_pieces(move, gen_location)\\n return True\\n\\n # if checkmate is False\\n if not checkmate:\\n # if gen's location is in opposing colors moves\\n if gen_location in opposing_col_moves:\\n return True\",\n \"def c_equals(a, b):\\n alpha = library.PixelGetAlpha\\n return bool(library.IsPixelWandSimilar(a, b, 0) and\\n alpha(a) == alpha(b))\",\n \"def is_color(self, color: ColorLike) -> bool:\\n\\n if isinstance(color, Color):\\n return self.color == color\\n elif isinstance(color, str):\\n return str(self.color) == color\\n elif isinstance(color, int):\\n return int(self.color) == color\\n return False\",\n \"def __eq__(self, other):\\n return (\\n self.bg_color == other.bg_color and\\n self.width == other.width and\\n self.height == other.height\\n )\",\n \"def fully_equal(left, right, compare_color=True):\\n color = not compare_color or left.color == right.color\\n return (left == right and\\n left.is_initial == right.is_initial and\\n left.is_final == right.is_final and\\n left.final_word_out == right.final_word_out and\\n left.word_out == right.word_out and\\n color and\\n left.initial_probability == right.initial_probability)\",\n \"def is_dark(self):\\n\\n return self.red() < 125 and self.green() < 125 and self.blue() < 125\",\n \"def __eq__(self, other):\\n return type(other) is type(self) and other.color == self.color\",\n \"def _is_taking_own_piece(self, from_row, from_col, to_row, to_col):\\n # Get piece being moved\\n piece = self.board.squares[from_row][from_col]\\n piece_color = self.piece_color(piece)\\n\\n # is piece trying to take it's own piece?\\n to_piece = self.board.squares[to_row][to_col]\\n if to_piece != None:\\n if self.piece_color(to_piece) == piece_color:\\n return True\\n return False\",\n \"def has_winner(self):\\n if self.color_check_mate(ChessGame.BLACK):\\n return ChessGame.WHITE\\n elif self.color_check_mate(ChessGame.WHITE):\\n return ChessGame.BLACK\\n else:\\n return None\",\n \"def check_moves(self, board, self_color, coords, delta):\\r\\n found_opponent = False\\r\\n for i in range(1, 8):\\r\\n dr = coords[0] + i * delta[0]\\r\\n dc = coords[1] + i * delta[1]\\r\\n\\r\\n if self.is_on_board(dr, dc):\\r\\n if board[dr][dc] == self_color:\\r\\n break\\r\\n\\r\\n elif board[dr][dc] == self.get_opponent_color(self_color):\\r\\n found_opponent = True\\r\\n\\r\\n elif board[dr][dc] == self.EMPTY:\\r\\n if found_opponent:\\r\\n return dr, dc\\r\\n else:\\r\\n break\",\n \"def is_current_players_piece(piece: str, white_turn: bool) -> bool:\\n if white_turn and piece in WHITE_PIECES:\\n return True\\n elif not white_turn and piece in BLACK_PIECES:\\n return True\\n else:\\n return False\",\n \"def is_finished(self)-> bool:\\n for line in self.grid:\\n for pawn in line:\\n if pawn.color is None:\\n return False\\n return True\",\n \"def check_color(i, j, k):\\n img.show()\\n image = Image.new(\\\"RGB\\\", (200, 200), (int(Y), int(Y), int(Y)))\\n image.show()\\n image = Image.new(\\\"RGB\\\", (200, 200), (int(i), int(j), int(k)))\\n image.show()\",\n \"def has_friendly_piece(self, piece) -> bool:\\r\\n if self.has_piece():\\r\\n if piece.get_color() == self.get_piece().get_color():\\r\\n return True\\r\\n \\r\\n return False\",\n \"def _ischeckopponent(self, from_, to_):\\n opp_color = 'W' if self.to_move == 'B' else 'B'\\n opp_king_pos = self.board.get_occupants(color=opp_color, notation='K')[0]\\n\\n diff = (\\n opp_king_pos[0] - to_cartesian(to_)[0],\\n opp_king_pos[1] - to_cartesian(to_)[1]\\n )\\n\\n if diff in self.board[from_].occupant.get_captures():\\n if self.board[from_].occupant.hopping:\\n return True\\n\\n if not self.board.isblocked(to_, opp_king_pos):\\n return True\\n\\n return False\",\n \"def checkMove(move: Card, game) -> bool:\\n lastMove = game.lastMove\\n\\n if move.number == lastMove.number:\\n return True\\n\\n elif move.color == lastMove.color: \\n return True\\n\\n elif move.wild: \\n return True\\n\\n return False\",\n \"def check_game_over(self):\\n red, blue = self.board.count_piece()\\n if blue == 0:\\n self.ui.show_result(\\\"RED WIN!\\\")\\n self.turn = RED\\n elif red == 0:\\n self.ui.show_result(\\\"BLUE WIN!\\\")\\n self.turn = BLUE\\n elif red == blue == 1:\\n self.ui.show_result(\\\"DRAW!\\\")\",\n \"def game_over(self):\\n red_minion = 0\\n blue_minion = 0\\n red_master = 0\\n blue_master = 0\\n only_masters = True\\n for row in self.board:\\n for piece in row:\\n if piece != 0:\\n if not piece.master:\\n if piece.player:\\n blue_minion += 1\\n else:\\n red_minion += 1\\n only_masters = False\\n else:\\n if piece.player:\\n blue_master += 1\\n else:\\n red_master += 1\\n if blue_minion + blue_master == 0:\\n self.winner = \\\"Red\\\"\\n self.red_victories += 1\\n self.number_of_games +=1\\n self.game_over_screen()\\n return True\\n elif red_minion + red_master == 0:\\n self.winner = \\\"Blue\\\"\\n self.blue_victories += 1\\n self.number_of_games +=1\\n self.game_over_screen()\\n return True\\n elif only_masters:\\n if red_master > blue_master:\\n self.winner = \\\"Red\\\"\\n self.red_victories += 1\\n elif blue_master > red_master:\\n self.winner = \\\"Blue\\\"\\n self.blue_victories += 1\\n else:\\n self.winner = \\\"Nobody\\\"\\n self.number_of_games +=1\\n self.game_over_screen()\\n return True\\n \\n return False\",\n \"def hash_comparison(self):\\n for result in self.cards:\\n if result.hash_status:\\n return True\\n return False\",\n \"def update_tile(tile, color, tiles):\\n if color == BLACK:\\n return num_black_neighbors(tile, tiles) in [1, 2]\\n if color == WHITE:\\n return num_black_neighbors(tile, tiles) == 2\",\n \"def rgb(self) -> bool:\\n return self.image_shape[2] == 3\",\n \"def test_exist_and_change(self):\\n colorList = ColorList()\\n prev = colorList.pickColor()\\n self.assertIsNotNone(prev)\\n for i in range(100):\\n color = colorList.pickColor()\\n self.assertIsNotNone(color)\\n self.assertTrue(color.r != prev.r or color.g != prev.g or color.b != prev.b)\\n prev = color\",\n \"def check_up(self, i, j, board):\\r\\n color = board.pieceAt(i, j)\\r\\n\\r\\n row = True\\r\\n for k in range(4):\\r\\n row &= board.pieceAt(i-k, j) is color\\r\\n\\r\\n if row:\\r\\n return color\\r\\n else:\\r\\n return Color.EMPTY\",\n \"def can_change_colors(self):\\n return self.condition is None or self.get_state(self.condition[\\\"entity\\\"]) == self.condition[\\\"state\\\"]\",\n \"def is_en_passant(self, from_col, from_row, to_col, to_row):\\n from_square = self.get_square(from_col, from_row)\\n to_square = self.get_square(to_col, to_row)\\n taking_square = self.get_square(to_col, from_row)\\n # Check the to_col is next to the from_col\\n if abs(ord(from_col) - ord(to_col)) != 1:\\n return False\\n # Check the from row is correct (5 for white, 4 for black)\\n elif from_row != (5 if from_square.isupper() else 4):\\n return False\\n # Check the from square is a pawn\\n elif from_square.lower() != 'p':\\n return False\\n # Check the to square is empty\\n elif self.get_square(to_col, to_row) != ' ':\\n return False\\n # Check the square being taken is a pawn of the opposite colour\\n elif taking_square.lower() != 'p' or taking_square == from_square:\\n return False\\n else:\\n # It is a valid en-passant move\\n return True\",\n \"def red_has_won(self):\\n return not any([self.squares[p].is_red() for p in self.squares \\\\\\n if self.squares[p]])\",\n \"def __eq__(self, other):\\n return self.is_red() == other.is_red()\",\n \"def is_cue_color(color, tolerance = 100):\\n return col_diff(color, CUE_COLOR) <= tolerance\",\n \"def colorOK(colorStr):\\n tkWdg = _getTkWdg()\\n\\n try:\\n tkWdg.winfo_rgb(colorStr)\\n except tkinter.TclError:\\n return False\\n return True\",\n \"def solved(self):\\n\\n for p in self.pieces:\\n if [p.x, p.y, p.z].count(0) < 2: # Filter out centers.\\n # Compare each sticker color with its respective center.\\n for i, s in enumerate(p.stickers):\\n cen = self.getpiece(s.x, s.y, s.z).getsticker(s.x, s.y, s.z)\\n if s.c != cen.c:\\n return False\\n\\n return True\",\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 validate_hair_color(passport: map) -> bool:\\n if passport.get('hcl'):\\n regex = re.compile('#[0-9a-f]{6}')\\n match = regex.match(passport['hcl'])\\n return bool(match)\\n\\n return False\",\n \"def checks_check(self, turn):\\n opposite_colour = next_turn(turn)\\n\\n if piece_class.KING_LOCATION[opposite_colour] in self.path_dict[turn]:\\n self.print_message(\\\"CHECK!\\\")\\n# self.checkmate(turn)\\n self.mate_double(turn)\\n self.mate_pinned(turn)\\n self.mate_normal(turn)\\n\\n if piece_class.KING_LOCATION[turn] in self.path_dict[opposite_colour]:\\n return True\\n\\n else:\\n return False\",\n \"def has_clashes(the_board):\\r\\n for c in range(1, len(the_board)):\\r\\n if col_clashes(the_board, c):\\r\\n return True\\r\\n return False\",\n \"def GreenFilter(c):\\n if (c[1] > c[0]) and (c[1] > c[2]) and (c[0] == c[2]): return True\\n else: return False\",\n \"def pawnTo(self, direction) :\\n dirCoord = add(self.coord, direction)\\n return self.board.playerCellList[dirCoord[0]][dirCoord[1]].hasPawn\",\n \"def _is_color_valid(self, color):\\n # make sure it is a tuple\\n if type(color).__name__ != 'tuple':\\n return False\\n # check the length of the tuple\\n if len(color) != 3:\\n return False\\n # verify that component colors are between _MIN and _MAX\\n for c in color:\\n if c < MIN or c > MAX:\\n return False\\n return True\",\n \"def has_enemy_piece(self, piece) -> bool:\\r\\n if self.has_piece():\\r\\n if piece.get_color() != self.get_piece().get_color():\\r\\n return True\\r\\n \\r\\n return False\",\n \"def has_clashes(the_board):\\r\\n for col in range(1,len(the_board)):\\r\\n if col_clashes(the_board, col):\\r\\n return True\\r\\n return False\",\n \"def has_clashes(the_board):\\r\\n for col in range(1,len(the_board)):\\r\\n if col_clashes(the_board, col):\\r\\n return True\\r\\n return False\",\n \"def _check_zone_locks(self, start, end):\\n color = self._board[start]\\n goal = CheckersGame.opposite[color]\\n\\n start_zone = FULL_BOARD[start]\\n end_zone = FULL_BOARD[end]\\n\\n # You can always get into your own goal\\n # and you can always move within a zone.\\n if end_zone == start_zone or end_zone == goal:\\n return True\\n # So now we can assume they changed zones.\\n # And that if they're in a goal, it's not their own.\\n\\n # The first rule is that if a piece is in *its destination goal*,\\n # it can't be moved outside of it.\\n # The second rule is that we may not move into a zone which is\\n # another player's spawn or goal\\n if start_zone == goal or end_zone == color:\\n return False\\n return True\",\n \"def valid(black, white, x, y):\\n return (not black & gobit[(x, y)]) and (not white & gobit[(x, y)])\",\n \"def check(self, grain=50):\\n opengles.glReadPixels(0, 0, self.ix, self.iy,\\n GL_RGB, GL_UNSIGNED_BYTE,\\n ctypes.byref(self.img))\\n r0 = self.img[0:3]\\n step = 3 * int(self.ix * self.iy / 50)\\n for i in xrange(0, len(self.img)-3, step):\\n if self.img[i:(i+3)] != r0:\\n return True\\n\\n return False\",\n \"def _check_redshift(self, red):\\n if np.min(np.abs(red - self.zout)) > 0.01:\\n return 0\\n return 1\",\n \"def has_clashes(the_board):\\n for col in range(1,len(the_board)):\\n if col_clashes(the_board, col):\\n return True\\n return False\",\n \"def has_clashes(the_board):\\n for col in range(1,len(the_board)):\\n if col_clashes(the_board, col):\\n return True\\n return False\",\n \"def combine_test():\\n\\n red = create_image(1, 3, create_color(255, 0, 0))\\n green = create_image(1, 3, create_color(0, 255, 0))\\n blue = create_image(1, 3, create_color(0, 0, 255))\\n\\n expected = create_image(1, 3, create_color(255, 255, 255))\\n\\n result = combine(red, green, blue)\\n\\n for x, y, (r, g, b) in result:\\n if (r, g, b) == tuple(get_color(expected, x, y)):\\n print(\\\"Pixel at (\\\" + str(x) + \\\",\\\" + str(y) + \\\") passed.\\\")\\n else:\\n print(\\\"Pixel at (\\\" + str(x) + \\\",\\\" + str(y) + \\\") failed. Expected \\\" + str((r, g, b)) + \\\" got \\\"\\n + str(get_color(expected, x, y)))\",\n \"def has_clashes(the_board):\\n for col in range(1, len(the_board)):\\n if col_clashes(the_board, col):\\n return True\\n return False\",\n \"def select_our_piece(self):\\n return self.board.location(self.mouse_pos) is not None and self.board.location(self.mouse_pos).color == self.turn\",\n \"def test_p1_color_map(grid):\\n space = bempp.api.function_space(grid, \\\"P\\\", 1)\\n\\n colors_unique = True\\n\\n for local_dofs in space.global2local:\\n colors = [space.color_map[elem] for elem, _ in local_dofs]\\n if len(colors) != len(set(colors)):\\n colors_unique = False\\n\\n assert colors_unique\",\n \"def is_game_finish(self):\\n for row in self.chessboard:\\n for val in row:\\n if not val.is_correct_state():\\n return False\\n return True\",\n \"def IsOk(*args, **kwargs):\\n return _gdi_.Colour_IsOk(*args, **kwargs)\",\n \"def __eq__(*args, **kwargs):\\n return _gdi_.Colour___eq__(*args, **kwargs)\",\n \"def is_valid(current_card: Card, destination: Card) -> bool:\\n # TODO: check for a card to a space is only Kings; maybe in the board?\\n match = current_card.color == destination.color\\n difference = destination.value - current_card.value\\n if not match and difference == 1:\\n return True\\n else:\\n return False\",\n \"def test_if_bottom_color_player_well_set(self):\\n ui = UIRender(TestUI.image_path)\\n ui.set_bottom_player_color(CELTIC_GREEN)\\n self.assertEqual(ui.bottom_player_color, CELTIC_GREEN)\\n self.assertEqual(ui.top_player_color, SPQR_RED)\\n ui.set_bottom_player_color(SPQR_RED)\\n self.assertEqual(ui.bottom_player_color, SPQR_RED)\\n self.assertEqual(ui.top_player_color, CELTIC_GREEN)\",\n \"def piece_color(self, piece):\\n if piece == None:\\n return None\\n if ord(ChessPiece.W_KING) <= ord(piece) <= ord(ChessPiece.W_PAWN):\\n return \\\"white\\\"\\n return \\\"black\\\"\",\n \"def testKingOnly(board):\\n return bin(board.friends[board.color]).count(\\\"1\\\") == 1\",\n \"def inside_gamut(rgb: ndarray) -> bool:\\n return all(rgb >= 0)\",\n \"def is_red(self):\\n return \\\"red\\\" == self.color\",\n \"def test_issue_269(self):\\n\\n c = pygame.Color(0)\\n c.hsva = 360, 0, 0, 0\\n self.assertEqual(c.hsva, (0, 0, 0, 0))\\n c.hsva = 360, 100, 100, 100\\n self.assertEqual(c.hsva, (0, 100, 100, 100))\\n self.assertEqual(c, (255, 0, 0, 255))\",\n \"def is_black(self):\\n return \\\"black\\\" == self.color\",\n \"def check(self, grain=50):\\r\\n opengles.glDisable(GL_SCISSOR_TEST)\\r\\n self.s_flg = False\\r\\n opengles.glReadPixels(0, self.y0, self.ix, 1,\\r\\n GL_RGB, GL_UNSIGNED_BYTE,\\r\\n ctypes.byref(self.img))\\r\\n r0 = self.img[0:3]\\r\\n for i in xrange(0, self.img_sz, self.step):\\r\\n if self.img[i:(i+3)] != r0:\\r\\n return True\\r\\n\\r\\n return False\",\n \"def IsColor(self, *args):\\n return _XCAFDoc.XCAFDoc_ColorTool_IsColor(self, *args)\",\n \"def contains_black(image):\\n extrema = ImageStat.Stat(image).extrema\\n r = extrema[0][0]\\n g = extrema[1][0]\\n b = extrema[2][0]\\n\\n if r == 0 and g == 0 and b == 0:\\n return True\\n\\n return False\",\n \"def PinkFilter(c):\\n if (c[0] > c[1]) and (c[2] > c[1]) and (c[2] == c[0]): return True\\n else: return False\",\n \"def check_opponent_winning(self):\\n valid_actions = self.get_valid_actions()\\n copy_board = np.copy(self.board)\\n for action in list(valid_actions):\\n height = self.get_height(action, board=copy_board)\\n self.set(action, height=height, value=self.current_player * -1, board=copy_board)\\n\\n if self.check_winner(copy_board, action, height) != 0:\\n return True\\n\\n self.set(action, height=height, value=0, board=copy_board)\\n\\n return False\",\n \"def castling_valid(self, turn, direction):\\n \\n opposite_colour = next_turn(turn)\\n\\n \\n if self.board[direction[0]] and self.board[direction[-1]] != self.empty:\\n if ((self.board[direction[0]].graphic) == piece_class.PIECEDICT[turn][piece_class.King] and \\n (self.board[direction[-1]].graphic) == piece_class.PIECEDICT[turn][piece_class.Rook]):\\n if self.board[direction[0]].move_track == False and self.board[direction[-1]].move_track == False:\\n for i in self.path_dict[opposite_colour]:\\n if i in self.coords:\\n if self.coords.index(i) == direction[0]:\\n \\n return False\\n \\n if self.coords.index(i) == direction[1]:\\n \\n return False\\n \\n if self.coords.index(i) == direction[2]:\\n \\n return False\\n \\n if len(direction) == 4:\\n if self.board[direction[1]] == self.empty:\\n if self.board[direction[2]] == self.empty:\\n \\n return True\\n \\n if len(direction) == 5:\\n if self.board[direction[1]] == self.empty:\\n if self.board[direction[2]] == self.empty:\\n if self.board[direction[3]] == self.empty:\\n \\n return True\\n \\n return False\",\n \"def same_color(suit):\\n\\tif suit == 's':\\n\\t\\treturn 'c'\\n\\telif suit == 'c':\\n\\t\\treturn 's'\\n\\telif suit == 'd':\\n\\t\\treturn 'h'\\n\\telif suit == 'h':\\n\\t\\treturn 'd'\",\n \"def check(chessboard, row, col, n):\\n for i in range(col):\\n if chessboard[row][i] == 1:\\n return False\\n\\n for j, i in zip(range(row, -1, -1), range(col, -1, -1)):\\n if chessboard[j][i] == 1:\\n return False\\n \\n for j, i in zip(range(row, n, 1), range(col, -1, -1)):\\n if chessboard[j][i] == 1:\\n return False\\n\\n return True\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7082352","0.6642375","0.6420325","0.63803416","0.6271055","0.6236686","0.62152225","0.6214757","0.6146159","0.6136335","0.6056689","0.6049656","0.6021747","0.60207504","0.6019101","0.60071254","0.6001189","0.6000824","0.59897274","0.59405607","0.5914164","0.59021425","0.5842953","0.58133096","0.5810256","0.5799214","0.57960993","0.57919997","0.57706434","0.57624686","0.57583934","0.5755108","0.57348907","0.57340693","0.571377","0.5696566","0.56681585","0.56668746","0.56628287","0.56194884","0.5604908","0.5585283","0.55802375","0.555661","0.55518454","0.5550554","0.55497813","0.5544096","0.5543194","0.55152905","0.5496374","0.5484078","0.54765904","0.54724705","0.5462182","0.54413503","0.543558","0.54348326","0.5413382","0.54108614","0.5396273","0.53797054","0.53731763","0.53592455","0.5355614","0.5350689","0.53431386","0.5339132","0.5337703","0.5336549","0.5336549","0.5328069","0.5318972","0.531652","0.5309256","0.5308579","0.5308579","0.5303134","0.5300871","0.53005457","0.52884257","0.52816665","0.5281411","0.52673167","0.52641946","0.5262345","0.5254663","0.5250977","0.52466357","0.5243622","0.52350503","0.523059","0.5228432","0.5226302","0.5220336","0.521963","0.52167845","0.5207115","0.52070874","0.5206211"],"string":"[\n \"0.7082352\",\n \"0.6642375\",\n \"0.6420325\",\n \"0.63803416\",\n \"0.6271055\",\n \"0.6236686\",\n \"0.62152225\",\n \"0.6214757\",\n \"0.6146159\",\n \"0.6136335\",\n \"0.6056689\",\n \"0.6049656\",\n \"0.6021747\",\n \"0.60207504\",\n \"0.6019101\",\n \"0.60071254\",\n \"0.6001189\",\n \"0.6000824\",\n \"0.59897274\",\n \"0.59405607\",\n \"0.5914164\",\n \"0.59021425\",\n \"0.5842953\",\n \"0.58133096\",\n \"0.5810256\",\n \"0.5799214\",\n \"0.57960993\",\n \"0.57919997\",\n \"0.57706434\",\n \"0.57624686\",\n \"0.57583934\",\n \"0.5755108\",\n \"0.57348907\",\n \"0.57340693\",\n \"0.571377\",\n \"0.5696566\",\n \"0.56681585\",\n \"0.56668746\",\n \"0.56628287\",\n \"0.56194884\",\n \"0.5604908\",\n \"0.5585283\",\n \"0.55802375\",\n \"0.555661\",\n \"0.55518454\",\n \"0.5550554\",\n \"0.55497813\",\n \"0.5544096\",\n \"0.5543194\",\n \"0.55152905\",\n \"0.5496374\",\n \"0.5484078\",\n \"0.54765904\",\n \"0.54724705\",\n \"0.5462182\",\n \"0.54413503\",\n \"0.543558\",\n \"0.54348326\",\n \"0.5413382\",\n \"0.54108614\",\n \"0.5396273\",\n \"0.53797054\",\n \"0.53731763\",\n \"0.53592455\",\n \"0.5355614\",\n \"0.5350689\",\n \"0.53431386\",\n \"0.5339132\",\n \"0.5337703\",\n \"0.5336549\",\n \"0.5336549\",\n \"0.5328069\",\n \"0.5318972\",\n \"0.531652\",\n \"0.5309256\",\n \"0.5308579\",\n \"0.5308579\",\n \"0.5303134\",\n \"0.5300871\",\n \"0.53005457\",\n \"0.52884257\",\n \"0.52816665\",\n \"0.5281411\",\n \"0.52673167\",\n \"0.52641946\",\n \"0.5262345\",\n \"0.5254663\",\n \"0.5250977\",\n \"0.52466357\",\n \"0.5243622\",\n \"0.52350503\",\n \"0.523059\",\n \"0.5228432\",\n \"0.5226302\",\n \"0.5220336\",\n \"0.521963\",\n \"0.52167845\",\n \"0.5207115\",\n \"0.52070874\",\n \"0.5206211\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6147662"},"document_rank":{"kind":"string","value":"8"}}},{"rowIdx":94786,"cells":{"query":{"kind":"string","value":"Sets the position of the pawn"},"document":{"kind":"string","value":"def move(self,x,y):\n self.pos.x = x\n self.pos.y = y"},"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 setPosition(self):\n # determine posX, posY for battle\n (x1,y1) = globals.battlemapQuadrants[self.systemGrid]\n self.posX = x1+self.setX\n self.posY = y1+self.setY","def setPosition(position):","def setPosition(self):\n self.data['pos-x'] = \"%s\" % self.x()\n self.data['pos-y'] = \"%s\" % self.y()","def setDesiredPosition(self, x, y):\n (self.setX, self.setY) = (x , y)","def set_position(self, x, y):\n self.position.x = x\n self.position.y = y\n self.rect.topleft = x, y","def setPos(self,pos):\n self.Xpos,self.Ypos=pos","def set_position(self, x, y):\n self.pos = pygame.Rect(x, y, 0, 0)","def reset_position(self): \n self.rect.x = 400\n self.rect.y = 400\n \n # Specifies the Player's spawnpoint as maze_arrangement[8][8], representing\n # the tile in the center of the maze \n self.__minotaur_x = 8\n self.__minotaur_y = 8","def set_new_location(self, xPos, yPos):","def setzePosition(self, x, y):\n self.zielX = x\n self.zielY = y","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def setPosition(*args):","def set_position(self, x, y):\n self.geometry('%s%s' % (x, y))","def move(self, p):\r\n self.position.setvalue(p)","def set_position( self, posx, posy ):\n\n self.__foodx = posx\n self.__foody = posy","def teleport(self, x, y):\n self.rect.x = x\n self.rect.y = y","def position(self, x, y):\n self.x = x \n self.y = y\n self.pos[0] = x \n self.pos[1] = y","def set_position(self, position):\r\n\r\n self.position = position\r\n if (self.rect):\r\n self.rect.x = position[0]\r\n self.rect.y = position[1]","def set_position(self, position):\n self.position = position","def set_pos(self, x, y, orien):\n self.pos_x = x\n self.pos_y = y\n self.orientation = orien","def set_pos(self, p: tuple) -> None:\n self.pos = p","def set_position( self ):\n\t\tscreen_rect = self.get_preview_window_screen_rect( )\n\n\t\twhile screen_rect.Intersects( self.GetScreenRect( ) ):\n\t\t\tpos = self.GetPosition( )\n\t\t\tself.SetPosition( ( pos[ 0 ] - 2, pos[ 1 ] + 2 ) )","def set_position(self, x, y):\n self.tx = -x\n self.ty = -y","def set_player_position(self, position):\n raise NotImplementedError","def put_pawn_at(board: Board, pawn_value: int, x: int, y: int) -> None:\n\n board[y][x] = 1 if argv[2] is '0' else pawn_value","def set_position(self):\n raise RuntimeError(\"the 'set_position' method must be overriden\")","def set_position(self, position):\n self.set_current_position(position)","def respawn_player(self):\n self.rect.x = 50\n self.rect.y = 50\n \n # Specifies the Player's spawnpoint as maze_arrangement[1][1], representing\n # the tile in the top-left corner of the maze\n self.__user_x = 1\n self.__user_y = 1","def move(self):\n \n self.position = self.wander()","def reset_position(self):\n self.rect.left, self.rect.top = self.start_pos","def set_position(self, position):\n raise NotImplementedError()","def set_position(self, new_pos):\n self._position = new_pos","def setPosition(self,newPos):\n self._position = newPos","def set_position(self, position):\n self.gripper_io.set_signal_value(\"position_m\", position)","def setPos(self, pos):\n self.cameraNode.setPos(pos)","def set_pos(self, x):\n self._pos = x","def move_pawn(pos, game):\n #Convert coordinates to row and column\n row = int(pos[1]//(SQUARESIZE+FENCEWIDTH))\n col = int(pos[0]//(SQUARESIZE+FENCEWIDTH))\n #Make move\n game.move_pawn(game.get_player_turn(), (col,row))","def teleport(self, x, y, reset_rotation=False):\n self.center[0] = x\n self.center[1] = y\n self.rect.center = tuple(self.center) # update pygame sprite placement\n if reset_rotation:\n self.rotate(-self.rotation)","def SetPosition(self, pos):\n self._pos = pos","def set_position(self, updated):\n self.buff_x = updated[0]\n self.buff_y = updated[1]","def setNewPosition(self,board_object,x,y):\n\t\tif checkClash(board_object,self,x,y)==0:\n\t\t\toverlayMatrix(board_object,self,x,y)\n\t\t\tself.setPos(x,y)\n\t\t\treturn 0\n\t\telse:\n\t\t\treturn 1","def place(self,y,x):\n self.y = y\n self.x = x","def respawn(self):\n # If we are in the middle of respawning, this is non-zero.\n self.respawning = 1\n self.center_x = SCREEN_WIDTH / 2\n self.center_y = 600","def set_pos(self, p, a, **kwargs):\n\t\treturn self.send(\"set_pos\", p[0], p[1], a, **kwargs)","def set_position(self,position,midpoint = False):\n\n # Find the image size and midpoint of the image\n imagesize = self.image.get_size()\n imagemidp = (int(imagesize[0] * 0.5),int(imagesize[1] * 0.5))\n\n # if a midpoint arguement is passed, set the pos to the top left pixel\n # such that the position passed in is in the middle of the button\n if midpoint:\n self.pos = (position[0] - imagemidp[0], position[1] - imagemidp[1])\n else:\n self.pos = position\n\n # set the rectangle to be used for collision detection\n self.rect = pygame.Rect(self.pos,self.image.get_size())\n\n # Set up the information that is needed to blit the image to the surface\n self.blitinfo = (self.image, self.pos)","def position(self, position):\n self.move_to(position)","def respawn(self, xrespawn, yrespawn):\n # If we are in the middle of respawning, this is non-zero.\n self.respawning = 1\n #self.center_x = SCREEN_WIDTH / 2\n #self.center_y = SCREEN_HEIGHT / 2\n\n self.center_x = xrespawn\n self.center_y = yrespawn\n\n self.angle = 0\n\n self.cur_health = self.max_health","def new_position(self, p):\n if self.track:\n self.gnx = p.gnx\n else:\n p = self.get_position()\n\n self.new_position_edit(p)\n self.new_position_view(p)","def set_drone_position(self, new_point):\n self.drone.set_drone_position(new_point)","def set_position(self, position):\n self.position = tuple(position)","def move_to(self, x, y):\n self.x = x\n self.y = y","def move_to(self, x, y):\n self.x = x\n self.y = y","def set_location(self, x, y, z=0):\n self._rect.topleft = (x, y)\n self._z = z\n self._update()","def assign_position(self, position):\n\n self._actual_position = list(position)\n self._position = [0, 0]\n if not self._widget_assigned:\n self._align()\n self._update_widgets()\n self._widget_assigned = True","def set_position(self, x_position, y_position): \n \n # Checks if the tile position is within the x boundaries of the maze\n if x_position >= 0 and x_position <= 18: \n \n # The new self.rect.x is determined by multiplying the tile value by 50,\n # representing the pixel position of the sprite, and adding 3 as a slight\n # offset to center the image more appropriately on the tile \n self.rect.x = (x_position*50) + 3\n \n # Checks if the tile position is within the y boundaries of the maze \n if y_position >= 0 and y_position <= 18:\n \n # The new self.rect.y is determined by multiplying the tile value by 50,\n # representing the pixel position of the sprite, and adding 3 as a slight\n # offset to center the image more appropriately on the tile \n self.rect.y = (y_position*50)\n \n # Returns the updated self.rect.x and self.rect.y to the caller\n return self.rect.x, self.rect.y","def setRobotPosition(self, position):\n posx = position.getX()\n posy = position.getY()\n self.position = Position(posx, posy)\n #raise NotImplementedError","def reset(self, playerx, playery):\n self.rect.center = (playerx, playery)","def set_position(self, x_position, y_position):\n \n # Checks if the tile position is within the x boundaries of the maze\n if x_position >= 0 and x_position <= 18: \n \n # The new self.rect.x is determined by multiplying the tile value by 50,\n # representing the pixel position of the sprite, and adding 14 as a slight\n # offset to center the image more appropriately on the tile\n self.rect.x = (x_position*50) + 14\n \n # Checks if the tile position is within the y boundaries of the maze \n if y_position >= 0 and y_position <= 18:\n \n # The new self.rect.y is determined by multiplying the tile value by 50,\n # representing the pixel position of the sprite, and adding 3 as a slight\n # offset to center the image more appropriately on the tile \n self.rect.y = (y_position*50) + 3\n\n # Returns the updated self.rect.x and self.rect.y to the caller\n return self.rect.x, self.rect.y","def force_set(self, pos):\n self.rect.center = pos","def set_position(self, az_pos, el_pos):\n raise NotImplementedError()","def set_position(self, pos):\n self.ref_pos = pos","def set_move(self, x, y):\n self.pieces[x + (y * self.width)].set_move()","def setCenter(self, p):\n self.__center = p","def setposition(self, x, y, bearing=None):\n self.posX = x\n self.posY = y\n\n # self check of position inside canvas\n if self.posX < self._min_x:\n self.posX = self._min_x\n if self.posY < self._min_y:\n self.posY = self._max_y\n\n if self.posX > self._max_x:\n self.posX = self._max_x\n if self.posY > self._max_y:\n self.posY = self._max_y\n\n if bearing is None:\n self._add_point()\n elif isinstance(bearing, int):\n self.setbearing(bearing)\n else:\n raise ValueError(\"Bearing must be an integer\")","def respawn(self):\n # If we are in the middle of respawning, this is non-zero.\n self.respawning = 1\n self.center_x = SCREEN_WIDTH / 2\n self.center_y = SCREEN_HEIGHT / 2\n self.angle = 0","def positioning_ship(self):\n self.rect.midleft = self.screen_rect.midleft\n self.y = float(self.rect.y)","def reposition(self, x, y):\n self.groupx = x\n self.groupy = y\n self.call('reposition', x, y)","def __set_paddle_position(self):\n self.__window.remove(self.__paddle)\n self.__window.add(self.__paddle, (self.__window.width - self.__paddle.width) / 2,\n self.__window.height - self.__paddle_offset)","def updatePos(self):\n self.setPos(self.centerX-self.boundingRect().width()/2.0,\n self.centerY-self.boundingRect().height()/2.0)","def set_position(self, x: float, y: float):\n self._shape.body.position.x = x\n self._shape.body.position.y = y","def _setup_move(self, position):\n self.log.debug(\"%s.setpoint = %s\", self.name, position)\n self.setpoint.put(position, wait=True)\n if self.actuate is not None:\n self.log.debug(\"%s.actuate = %s\", self.name, self.actuate_value)\n self.actuate.put(self.actuate_value, wait=False)","def set_position(self, pos, debug=False):\n pos = max(pos, 0)\n pos = min(pos, 1)\n posrange = pos * self.range\n pos = posrange + self.min\n if debug:\n print('Setting Dynamixel {} with posrange {} to position {}'.format(self.id, posrange, pos))\n self.motor.set_position(int(pos))","def position(self, pos: int):\n self.__pos = pos","def setPoint(self, point):\n self.position = point.position","def setBallPos(self, x: int, y: int):\n self.x = x\n self.y = y","def setPosicion(self, posicion):\r\n\t\tif(isinstance(posicion, list)):\r\n\t\t\tself._x=posicion[0]+30\r\n\t\t\tself._y=posicion[1]+30\r\n\t\telse:\r\n\t\t\tself._x=posicion\r\n\t\t\r\n\t\tfor objeto in self.getObjetos():\r\n\t\t\tobjeto.setPosicion([self._x, self._y])","def setRobotPosition(self, position):\n self.position = position","def setRobotPosition(self, position):\n self.position = position","def _updatePos(self, newTile):\n self.pos = newTile\n self.rect = (newTile.x * TILE_W, newTile.y * TILE_H)","def setPosition(self, *args):\n return _libsbml.BoundingBox_setPosition(self, *args)","def position(x, y):\n command([x + 0x80, y + 0x40])","def move_to_start(self):\n self.pos = (SCREEN_WIDTH / 2, SCREEN_HEIGHT - 64)","async def set_position(self, pos: int) -> None:\n return await self.relay(\"set_position\")(pos=pos)","def setPos(self,x,y):\n for i in self.itemType.find('parameters'):\n paramType = i.find('type').text.strip()\n if paramType.startswith('position-x'):\n self.params[i.find('name').text] = x\n if paramType.startswith('position-y'):\n self.params[i.find('name').text] = y","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position","def position(self, position):\n\n self._position = position"],"string":"[\n \"def setPosition(self):\\n # determine posX, posY for battle\\n (x1,y1) = globals.battlemapQuadrants[self.systemGrid]\\n self.posX = x1+self.setX\\n self.posY = y1+self.setY\",\n \"def setPosition(position):\",\n \"def setPosition(self):\\n self.data['pos-x'] = \\\"%s\\\" % self.x()\\n self.data['pos-y'] = \\\"%s\\\" % self.y()\",\n \"def setDesiredPosition(self, x, y):\\n (self.setX, self.setY) = (x , y)\",\n \"def set_position(self, x, y):\\n self.position.x = x\\n self.position.y = y\\n self.rect.topleft = x, y\",\n \"def setPos(self,pos):\\n self.Xpos,self.Ypos=pos\",\n \"def set_position(self, x, y):\\n self.pos = pygame.Rect(x, y, 0, 0)\",\n \"def reset_position(self): \\n self.rect.x = 400\\n self.rect.y = 400\\n \\n # Specifies the Player's spawnpoint as maze_arrangement[8][8], representing\\n # the tile in the center of the maze \\n self.__minotaur_x = 8\\n self.__minotaur_y = 8\",\n \"def set_new_location(self, xPos, yPos):\",\n \"def setzePosition(self, x, y):\\n self.zielX = x\\n self.zielY = y\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def setPosition(*args):\",\n \"def set_position(self, x, y):\\n self.geometry('%s%s' % (x, y))\",\n \"def move(self, p):\\r\\n self.position.setvalue(p)\",\n \"def set_position( self, posx, posy ):\\n\\n self.__foodx = posx\\n self.__foody = posy\",\n \"def teleport(self, x, y):\\n self.rect.x = x\\n self.rect.y = y\",\n \"def position(self, x, y):\\n self.x = x \\n self.y = y\\n self.pos[0] = x \\n self.pos[1] = y\",\n \"def set_position(self, position):\\r\\n\\r\\n self.position = position\\r\\n if (self.rect):\\r\\n self.rect.x = position[0]\\r\\n self.rect.y = position[1]\",\n \"def set_position(self, position):\\n self.position = position\",\n \"def set_pos(self, x, y, orien):\\n self.pos_x = x\\n self.pos_y = y\\n self.orientation = orien\",\n \"def set_pos(self, p: tuple) -> None:\\n self.pos = p\",\n \"def set_position( self ):\\n\\t\\tscreen_rect = self.get_preview_window_screen_rect( )\\n\\n\\t\\twhile screen_rect.Intersects( self.GetScreenRect( ) ):\\n\\t\\t\\tpos = self.GetPosition( )\\n\\t\\t\\tself.SetPosition( ( pos[ 0 ] - 2, pos[ 1 ] + 2 ) )\",\n \"def set_position(self, x, y):\\n self.tx = -x\\n self.ty = -y\",\n \"def set_player_position(self, position):\\n raise NotImplementedError\",\n \"def put_pawn_at(board: Board, pawn_value: int, x: int, y: int) -> None:\\n\\n board[y][x] = 1 if argv[2] is '0' else pawn_value\",\n \"def set_position(self):\\n raise RuntimeError(\\\"the 'set_position' method must be overriden\\\")\",\n \"def set_position(self, position):\\n self.set_current_position(position)\",\n \"def respawn_player(self):\\n self.rect.x = 50\\n self.rect.y = 50\\n \\n # Specifies the Player's spawnpoint as maze_arrangement[1][1], representing\\n # the tile in the top-left corner of the maze\\n self.__user_x = 1\\n self.__user_y = 1\",\n \"def move(self):\\n \\n self.position = self.wander()\",\n \"def reset_position(self):\\n self.rect.left, self.rect.top = self.start_pos\",\n \"def set_position(self, position):\\n raise NotImplementedError()\",\n \"def set_position(self, new_pos):\\n self._position = new_pos\",\n \"def setPosition(self,newPos):\\n self._position = newPos\",\n \"def set_position(self, position):\\n self.gripper_io.set_signal_value(\\\"position_m\\\", position)\",\n \"def setPos(self, pos):\\n self.cameraNode.setPos(pos)\",\n \"def set_pos(self, x):\\n self._pos = x\",\n \"def move_pawn(pos, game):\\n #Convert coordinates to row and column\\n row = int(pos[1]//(SQUARESIZE+FENCEWIDTH))\\n col = int(pos[0]//(SQUARESIZE+FENCEWIDTH))\\n #Make move\\n game.move_pawn(game.get_player_turn(), (col,row))\",\n \"def teleport(self, x, y, reset_rotation=False):\\n self.center[0] = x\\n self.center[1] = y\\n self.rect.center = tuple(self.center) # update pygame sprite placement\\n if reset_rotation:\\n self.rotate(-self.rotation)\",\n \"def SetPosition(self, pos):\\n self._pos = pos\",\n \"def set_position(self, updated):\\n self.buff_x = updated[0]\\n self.buff_y = updated[1]\",\n \"def setNewPosition(self,board_object,x,y):\\n\\t\\tif checkClash(board_object,self,x,y)==0:\\n\\t\\t\\toverlayMatrix(board_object,self,x,y)\\n\\t\\t\\tself.setPos(x,y)\\n\\t\\t\\treturn 0\\n\\t\\telse:\\n\\t\\t\\treturn 1\",\n \"def place(self,y,x):\\n self.y = y\\n self.x = x\",\n \"def respawn(self):\\n # If we are in the middle of respawning, this is non-zero.\\n self.respawning = 1\\n self.center_x = SCREEN_WIDTH / 2\\n self.center_y = 600\",\n \"def set_pos(self, p, a, **kwargs):\\n\\t\\treturn self.send(\\\"set_pos\\\", p[0], p[1], a, **kwargs)\",\n \"def set_position(self,position,midpoint = False):\\n\\n # Find the image size and midpoint of the image\\n imagesize = self.image.get_size()\\n imagemidp = (int(imagesize[0] * 0.5),int(imagesize[1] * 0.5))\\n\\n # if a midpoint arguement is passed, set the pos to the top left pixel\\n # such that the position passed in is in the middle of the button\\n if midpoint:\\n self.pos = (position[0] - imagemidp[0], position[1] - imagemidp[1])\\n else:\\n self.pos = position\\n\\n # set the rectangle to be used for collision detection\\n self.rect = pygame.Rect(self.pos,self.image.get_size())\\n\\n # Set up the information that is needed to blit the image to the surface\\n self.blitinfo = (self.image, self.pos)\",\n \"def position(self, position):\\n self.move_to(position)\",\n \"def respawn(self, xrespawn, yrespawn):\\n # If we are in the middle of respawning, this is non-zero.\\n self.respawning = 1\\n #self.center_x = SCREEN_WIDTH / 2\\n #self.center_y = SCREEN_HEIGHT / 2\\n\\n self.center_x = xrespawn\\n self.center_y = yrespawn\\n\\n self.angle = 0\\n\\n self.cur_health = self.max_health\",\n \"def new_position(self, p):\\n if self.track:\\n self.gnx = p.gnx\\n else:\\n p = self.get_position()\\n\\n self.new_position_edit(p)\\n self.new_position_view(p)\",\n \"def set_drone_position(self, new_point):\\n self.drone.set_drone_position(new_point)\",\n \"def set_position(self, position):\\n self.position = tuple(position)\",\n \"def move_to(self, x, y):\\n self.x = x\\n self.y = y\",\n \"def move_to(self, x, y):\\n self.x = x\\n self.y = y\",\n \"def set_location(self, x, y, z=0):\\n self._rect.topleft = (x, y)\\n self._z = z\\n self._update()\",\n \"def assign_position(self, position):\\n\\n self._actual_position = list(position)\\n self._position = [0, 0]\\n if not self._widget_assigned:\\n self._align()\\n self._update_widgets()\\n self._widget_assigned = True\",\n \"def set_position(self, x_position, y_position): \\n \\n # Checks if the tile position is within the x boundaries of the maze\\n if x_position >= 0 and x_position <= 18: \\n \\n # The new self.rect.x is determined by multiplying the tile value by 50,\\n # representing the pixel position of the sprite, and adding 3 as a slight\\n # offset to center the image more appropriately on the tile \\n self.rect.x = (x_position*50) + 3\\n \\n # Checks if the tile position is within the y boundaries of the maze \\n if y_position >= 0 and y_position <= 18:\\n \\n # The new self.rect.y is determined by multiplying the tile value by 50,\\n # representing the pixel position of the sprite, and adding 3 as a slight\\n # offset to center the image more appropriately on the tile \\n self.rect.y = (y_position*50)\\n \\n # Returns the updated self.rect.x and self.rect.y to the caller\\n return self.rect.x, self.rect.y\",\n \"def setRobotPosition(self, position):\\n posx = position.getX()\\n posy = position.getY()\\n self.position = Position(posx, posy)\\n #raise NotImplementedError\",\n \"def reset(self, playerx, playery):\\n self.rect.center = (playerx, playery)\",\n \"def set_position(self, x_position, y_position):\\n \\n # Checks if the tile position is within the x boundaries of the maze\\n if x_position >= 0 and x_position <= 18: \\n \\n # The new self.rect.x is determined by multiplying the tile value by 50,\\n # representing the pixel position of the sprite, and adding 14 as a slight\\n # offset to center the image more appropriately on the tile\\n self.rect.x = (x_position*50) + 14\\n \\n # Checks if the tile position is within the y boundaries of the maze \\n if y_position >= 0 and y_position <= 18:\\n \\n # The new self.rect.y is determined by multiplying the tile value by 50,\\n # representing the pixel position of the sprite, and adding 3 as a slight\\n # offset to center the image more appropriately on the tile \\n self.rect.y = (y_position*50) + 3\\n\\n # Returns the updated self.rect.x and self.rect.y to the caller\\n return self.rect.x, self.rect.y\",\n \"def force_set(self, pos):\\n self.rect.center = pos\",\n \"def set_position(self, az_pos, el_pos):\\n raise NotImplementedError()\",\n \"def set_position(self, pos):\\n self.ref_pos = pos\",\n \"def set_move(self, x, y):\\n self.pieces[x + (y * self.width)].set_move()\",\n \"def setCenter(self, p):\\n self.__center = p\",\n \"def setposition(self, x, y, bearing=None):\\n self.posX = x\\n self.posY = y\\n\\n # self check of position inside canvas\\n if self.posX < self._min_x:\\n self.posX = self._min_x\\n if self.posY < self._min_y:\\n self.posY = self._max_y\\n\\n if self.posX > self._max_x:\\n self.posX = self._max_x\\n if self.posY > self._max_y:\\n self.posY = self._max_y\\n\\n if bearing is None:\\n self._add_point()\\n elif isinstance(bearing, int):\\n self.setbearing(bearing)\\n else:\\n raise ValueError(\\\"Bearing must be an integer\\\")\",\n \"def respawn(self):\\n # If we are in the middle of respawning, this is non-zero.\\n self.respawning = 1\\n self.center_x = SCREEN_WIDTH / 2\\n self.center_y = SCREEN_HEIGHT / 2\\n self.angle = 0\",\n \"def positioning_ship(self):\\n self.rect.midleft = self.screen_rect.midleft\\n self.y = float(self.rect.y)\",\n \"def reposition(self, x, y):\\n self.groupx = x\\n self.groupy = y\\n self.call('reposition', x, y)\",\n \"def __set_paddle_position(self):\\n self.__window.remove(self.__paddle)\\n self.__window.add(self.__paddle, (self.__window.width - self.__paddle.width) / 2,\\n self.__window.height - self.__paddle_offset)\",\n \"def updatePos(self):\\n self.setPos(self.centerX-self.boundingRect().width()/2.0,\\n self.centerY-self.boundingRect().height()/2.0)\",\n \"def set_position(self, x: float, y: float):\\n self._shape.body.position.x = x\\n self._shape.body.position.y = y\",\n \"def _setup_move(self, position):\\n self.log.debug(\\\"%s.setpoint = %s\\\", self.name, position)\\n self.setpoint.put(position, wait=True)\\n if self.actuate is not None:\\n self.log.debug(\\\"%s.actuate = %s\\\", self.name, self.actuate_value)\\n self.actuate.put(self.actuate_value, wait=False)\",\n \"def set_position(self, pos, debug=False):\\n pos = max(pos, 0)\\n pos = min(pos, 1)\\n posrange = pos * self.range\\n pos = posrange + self.min\\n if debug:\\n print('Setting Dynamixel {} with posrange {} to position {}'.format(self.id, posrange, pos))\\n self.motor.set_position(int(pos))\",\n \"def position(self, pos: int):\\n self.__pos = pos\",\n \"def setPoint(self, point):\\n self.position = point.position\",\n \"def setBallPos(self, x: int, y: int):\\n self.x = x\\n self.y = y\",\n \"def setPosicion(self, posicion):\\r\\n\\t\\tif(isinstance(posicion, list)):\\r\\n\\t\\t\\tself._x=posicion[0]+30\\r\\n\\t\\t\\tself._y=posicion[1]+30\\r\\n\\t\\telse:\\r\\n\\t\\t\\tself._x=posicion\\r\\n\\t\\t\\r\\n\\t\\tfor objeto in self.getObjetos():\\r\\n\\t\\t\\tobjeto.setPosicion([self._x, self._y])\",\n \"def setRobotPosition(self, position):\\n self.position = position\",\n \"def setRobotPosition(self, position):\\n self.position = position\",\n \"def _updatePos(self, newTile):\\n self.pos = newTile\\n self.rect = (newTile.x * TILE_W, newTile.y * TILE_H)\",\n \"def setPosition(self, *args):\\n return _libsbml.BoundingBox_setPosition(self, *args)\",\n \"def position(x, y):\\n command([x + 0x80, y + 0x40])\",\n \"def move_to_start(self):\\n self.pos = (SCREEN_WIDTH / 2, SCREEN_HEIGHT - 64)\",\n \"async def set_position(self, pos: int) -> None:\\n return await self.relay(\\\"set_position\\\")(pos=pos)\",\n \"def setPos(self,x,y):\\n for i in self.itemType.find('parameters'):\\n paramType = i.find('type').text.strip()\\n if paramType.startswith('position-x'):\\n self.params[i.find('name').text] = x\\n if paramType.startswith('position-y'):\\n self.params[i.find('name').text] = y\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\",\n \"def position(self, position):\\n\\n self._position = position\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7676149","0.7314917","0.73105","0.7299208","0.7293732","0.722337","0.72098196","0.704315","0.70363337","0.6967169","0.6944696","0.6944696","0.6944696","0.6944696","0.6944696","0.6944696","0.6944696","0.6944696","0.6944696","0.6944696","0.6944696","0.6905733","0.6900997","0.686623","0.68578947","0.68043804","0.6775906","0.67596513","0.67434305","0.67250013","0.66691494","0.66659516","0.6652618","0.66302234","0.6616995","0.65888625","0.65753484","0.65538156","0.6550093","0.6546061","0.6534359","0.6534048","0.6495577","0.6492476","0.64830583","0.6481546","0.6469655","0.64654624","0.6462083","0.64398533","0.64390504","0.642606","0.6407466","0.6403881","0.64037615","0.63697314","0.63639873","0.63627553","0.63557494","0.6353616","0.6353616","0.6352895","0.63519156","0.6332815","0.63321906","0.6318598","0.63162506","0.6292385","0.62886626","0.62835264","0.62822133","0.6251897","0.6250571","0.62453693","0.6234455","0.6215765","0.62105817","0.6209746","0.62086904","0.620628","0.61989784","0.6195209","0.61950886","0.6194947","0.6193548","0.6191357","0.6191357","0.61814344","0.61792237","0.6159495","0.615946","0.6149791","0.6144547","0.6144499","0.6144499","0.6144499","0.6144499","0.6144499","0.6144499","0.6144499"],"string":"[\n \"0.7676149\",\n \"0.7314917\",\n \"0.73105\",\n \"0.7299208\",\n \"0.7293732\",\n \"0.722337\",\n \"0.72098196\",\n \"0.704315\",\n \"0.70363337\",\n \"0.6967169\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6944696\",\n \"0.6905733\",\n \"0.6900997\",\n \"0.686623\",\n \"0.68578947\",\n \"0.68043804\",\n \"0.6775906\",\n \"0.67596513\",\n \"0.67434305\",\n \"0.67250013\",\n \"0.66691494\",\n \"0.66659516\",\n \"0.6652618\",\n \"0.66302234\",\n \"0.6616995\",\n \"0.65888625\",\n \"0.65753484\",\n \"0.65538156\",\n \"0.6550093\",\n \"0.6546061\",\n \"0.6534359\",\n \"0.6534048\",\n \"0.6495577\",\n \"0.6492476\",\n \"0.64830583\",\n \"0.6481546\",\n \"0.6469655\",\n \"0.64654624\",\n \"0.6462083\",\n \"0.64398533\",\n \"0.64390504\",\n \"0.642606\",\n \"0.6407466\",\n \"0.6403881\",\n \"0.64037615\",\n \"0.63697314\",\n \"0.63639873\",\n \"0.63627553\",\n \"0.63557494\",\n \"0.6353616\",\n \"0.6353616\",\n \"0.6352895\",\n \"0.63519156\",\n \"0.6332815\",\n \"0.63321906\",\n \"0.6318598\",\n \"0.63162506\",\n \"0.6292385\",\n \"0.62886626\",\n \"0.62835264\",\n \"0.62822133\",\n \"0.6251897\",\n \"0.6250571\",\n \"0.62453693\",\n \"0.6234455\",\n \"0.6215765\",\n \"0.62105817\",\n \"0.6209746\",\n \"0.62086904\",\n \"0.620628\",\n \"0.61989784\",\n \"0.6195209\",\n \"0.61950886\",\n \"0.6194947\",\n \"0.6193548\",\n \"0.6191357\",\n \"0.6191357\",\n \"0.61814344\",\n \"0.61792237\",\n \"0.6159495\",\n \"0.615946\",\n \"0.6149791\",\n \"0.6144547\",\n \"0.6144499\",\n \"0.6144499\",\n \"0.6144499\",\n \"0.6144499\",\n \"0.6144499\",\n \"0.6144499\",\n \"0.6144499\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.638652"},"document_rank":{"kind":"string","value":"55"}}},{"rowIdx":94787,"cells":{"query":{"kind":"string","value":"Create a new object"},"document":{"kind":"string","value":"def __init__(self,state,player=WHITE):\n if(state==None):\n self.gameState = dict()\n for x in range(0,WIDTH):\n for y in range(0,HEIGHT):\n self.gameState[x,y] = EMPTY\n for x in range(0,WIDTH):\n self.gameState[x,BSTARTROW] = BLACK#Blacks starting row\n self.gameState[x,WSTARTROW] = WHITE#Whites starting row\n #whites.append(Board.pawn(Board.pos(x,WSTARTROW),WHITE))\n #blacks.append(Board.pawn(Board.pos(x,BSTARTROW),BLACK))\n else:\n self.gameState = state\n \n self.whoseTurn = player\n self.cachedWin = False # set to True in winFor() if\n self.cachedWinner = None"},"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 new_object(self):\r\n\t\tpass","def new(self, obj):\n pass","def create(cls, _):\n return cls","def create():","def create():","def make_object():\n return object()","def create(cls):\n pass\n return cls()","def create(self):\n pass","def create(self):\n pass","def create(self):\n pass","def new(name=None):","def create(self):","def create(self):\n\n pass","def new_object(cls):\n return cls.for_value([])","def new(cls, **kwargs):\n return cls(**kwargs)","def create(self):\n\n raise NotImplementedError","def create(self, *args, **kwargs):\n pass","def create(self):\n ...","def create(self, **kargs):\n return self(**kargs)","def new(cls):\n return cls()","def create():\n pass","def create(cls, **dictionary):\n dummy_obj = cls(1, 1)\n dummy_obj.update(**dictionary)\n return dummy_obj","def __newobj__(cls, *args):\n return cls.__new__(cls, *args)","def new(self):\n self._init()","def create_object_instance(path):\n path = utils.strip_path_string(path)\n object_config_file = utils.ConfigFile(path+\"/.config.py\")\n object_type = object_config_file.read_variable(\"object_type\")\n vobject_class = {\"algorithm\":VAlgorithm,\n \"task\":VTask,\n \"data\":VData,\n \"directory\":VDirectory,\n \"project\":VProject}\n return vobject_class[object_type](path)","def make(self):\n pass","def New():\n Self = $classname()\n Self._initialize_()\n Self._update_()\n return Self","def make(self, **kwargs):\n raise NotImplementedError","def Create(self):\n raise NotImplementedError()","def _new_instance(self):\n return self.__class__(self._vmodule)","def create(cls, **dictionary):\n new_inst = cls.__new__(cls)\n if cls.__name__ == \"Rectangle\":\n new_inst.__init__(42, 98)\n elif cls.__name__ == \"Square\":\n new_inst.__init__(42)\n new_inst.update(**dictionary)\n return new_inst","def create(cls, *args, **kwargs):\r\n return cls(*args, **kwargs).save()","def create(cls, **dictionary):\n if cls.__name__ == \"Rectangle\":\n object = cls(1, 1)\n object.update(**dictionary)\n return object\n\n if cls.__name__ == \"Square\":\n object = cls(1)\n object.update(**dictionary)\n return object","def create(cls, **dictionary):\n if cls.__name__ == 'Square':\n object = cls(1)\n object.update(**dictionary)\n return object\n\n if cls.__name__ == 'Rectangle':\n object = cls(1, 2)\n object.update(**dictionary)\n return object","def create(self, cls, data=None):\n return cls(self, initial_data=data)","def __init__(self, *args):\n this = _libsbml.new_ModelCreator(*args)\n try: self.this.append(this)\n except: self.this = this","def create(*args):","def new(self, obj):\n key = obj.__class__.__name__+'.'+obj.id\n self.__objects[key] = obj","def new(self, obj):\n if obj:\n key = obj.__class__.__name__ + \".\" + obj.id\n self.__objects[key] = obj","def createBasicObject(self):\n\n\t\treturn self._createBasicObjFunct(self)","def create(cls, **kwargs):\n instance = cls(**kwargs)\n instance.save()\n return instance","def create_instance(self,name):\n print \"INFO : new %s\" % name\n return self.get_class(name)()","def create(klass, **kw):\n m = klass(**kw)\n m._new = True\n return m","def _new_instance(self):\n return self.__class__(self._fmodule)","def _new_instance(self):\n return self.__class__(self._fmodule)","def createObject(self, *args):\n return _libsbml.Submodel_createObject(self, *args)","def create(cls, dictionary):\n return cls(**dictionary)","def create(cls, dictionary):\n return cls(**dictionary)","def create_instance(self, **kwargs):\r\n create_options = self._generate_create_dict(**kwargs)\r\n return self.guest.createObject(create_options)","def __init__(self, *args):\n this = _libsbml.new_Model(*args)\n try: self.this.append(this)\n except: self.this = this","def create(self, data):\n raise NotImplementedError","def create_instance(self, reset_data=None):\n if reset_data is None:\n log.error(f\"Cannot load Object with reset data of None.\")\n return\n\n location = reset_data.target_loc_vnum\n target_location = None\n\n log.debug(f\"Creating object[{self.vnum}] instance. \"\n f\"Target {reset_data.target_loc_is}[{reset_data.target_loc_vnum}]\")\n if reset_data.target_loc_is == \"mobile\":\n target_location = self.area.mobile_inst_by_vnum(location)\n if not target_location:\n return\n elif reset_data.target_loc_is == \"room\":\n if type(location) is int and location in self.area.roomlist:\n target_location = self.area.room_by_vnum(location)\n else:\n return\n\n new_obj = Object(self.area, self.to_json(), load_type=\"instance\")\n new_obj.aid = str(uuid.uuid4())\n\n if target_location is not None and reset_data.target_loc_is == \"room\":\n new_obj.move(target_location)\n elif target_location is not None and reset_data.target_loc_is == \"mobile\":\n target_location.contents[new_obj.aid] = new_obj\n if reset_data.target_mobile_wear:\n if 'hand' in self.default_wear_loc and self.keywords:\n comm_ = f\"hold {self.keywords[0]}\"\n target_location.interp(comm_)\n elif self.keywords:\n comm_ = f\"wear {self.keywords[0]} on {self.default_wear_loc}\"\n target_location.interp(comm_)","def do_create(self, args):\n args = args.split()\n l = len(args)\n if l < 1:\n print(\"** class name missing **\")\n else:\n if args[0] in HBNBCommand.valid_classes.keys():\n if l == 1:\n new_obj = HBNBCommand.valid_classes[args[0]]()\n else:\n result = self.__create_help(args[1:])\n if result is None:\n print(\"** Object fails **\")\n return\n new_obj = HBNBCommand.valid_classes[args[0]](**result)\n print(new_obj.id)\n new_obj.save()\n else:\n print(\"** class doesn't exist **\")","def create_object(cls: Type[\"Object\"],\n start_point: Tuple[int, int],\n end_point: Tuple[int, int],\n program: \"Program\",\n canvas: tk.Canvas) -> Type[\"Object\"]:\n pass","def _create(self, title=''):\n return ContentObject(title)","def create_ion_object(self, object_params):\n new_obj = IonObject(object_params[\"type_\"])\n\n # Iterate over the parameters to add to object; have to do this instead\n # of passing a dict to get around restrictions in object creation on setting _id, _rev params\n for param in object_params:\n self.set_object_field(new_obj, param, object_params.get(param))\n\n new_obj._validate() # verify that all of the object fields were set with proper types\n return new_obj","def create(self, class_name, attrs, session):","def _Create(self):\n pass","def make_objects(self):\n pass","def create_object(object_name):\n if object_name == 'deathstar':\n return Deathstar()\n elif object_name == 'mercury':\n return Mercury()\n elif object_name == 'venus':\n return Venus()\n elif object_name == 'mars':\n return Mars()\n elif object_name == 'earth':\n return Earth()\n elif object_name == 'moon':\n return Moon()\n elif object_name == 'tatooine':\n return Tatooine()\n elif object_name == 'mordor':\n return Mordor()\n elif object_name == 'xwing':\n return Xwing()","def createObject(self, *args):\n return _libsbml.FbcModelPlugin_createObject(self, *args)","def _instantiate(cls, **kwargs):\n return cls(**kwargs)","def from_data(cls,data):\n\n new_object = cls() # Only this line needs to be updated\n new_object.data = data\n\n return new_object","def create(cls, data=None):\n # allow create() calls with no input\n if not data:\n data = {}\n\n return cls(**data)","def new(self, obj):\n\n key = \"{}.{}\".format(obj.__class__.__name__, obj.id)\n self.__objects[key] = obj","def new(self, _def, _dict=None, **kwargs):\n\n _def = self.get_def(_def)\n obj = AnodeObjectBase(_def, _dict, **kwargs)\n self.instances.add(obj)\n self.instances_by_name[_def.type.name] = obj\n return obj","def new(name, source):","def create_instance(self, date):\n raise NotImplementedError","def make_object(self, data, **kwargs):\n if not data:\n return None\n return Note(\n title=data['title'],\n content=data['content'],\n )","def new(self, obj):\n key = '{}.{}'.format(obj.__class__.__name__, obj.id)\n self.__objects[key] = obj","def create(cls, **_params):\n cls_inst = cls()\n cls_inst = cls_inst.set(**_params)\n cls_inst.save()\n return cls_inst","def _mkObject(self):\n return ImmutableObject(\n store=self.store,\n hash=u'somehash',\n contentDigest=u'quux',\n content=self.store.newFilePath('foo'),\n contentType=u'application/octet-stream')","def create_individual(self):\n pass","def create_instance(self, **attrs):\n return self._create(_instance.Instance, **attrs)","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ...","def __new__(*args, **kwargs):\n ..."],"string":"[\n \"def new_object(self):\\r\\n\\t\\tpass\",\n \"def new(self, obj):\\n pass\",\n \"def create(cls, _):\\n return cls\",\n \"def create():\",\n \"def create():\",\n \"def make_object():\\n return object()\",\n \"def create(cls):\\n pass\\n return cls()\",\n \"def create(self):\\n pass\",\n \"def create(self):\\n pass\",\n \"def create(self):\\n pass\",\n \"def new(name=None):\",\n \"def create(self):\",\n \"def create(self):\\n\\n pass\",\n \"def new_object(cls):\\n return cls.for_value([])\",\n \"def new(cls, **kwargs):\\n return cls(**kwargs)\",\n \"def create(self):\\n\\n raise NotImplementedError\",\n \"def create(self, *args, **kwargs):\\n pass\",\n \"def create(self):\\n ...\",\n \"def create(self, **kargs):\\n return self(**kargs)\",\n \"def new(cls):\\n return cls()\",\n \"def create():\\n pass\",\n \"def create(cls, **dictionary):\\n dummy_obj = cls(1, 1)\\n dummy_obj.update(**dictionary)\\n return dummy_obj\",\n \"def __newobj__(cls, *args):\\n return cls.__new__(cls, *args)\",\n \"def new(self):\\n self._init()\",\n \"def create_object_instance(path):\\n path = utils.strip_path_string(path)\\n object_config_file = utils.ConfigFile(path+\\\"/.config.py\\\")\\n object_type = object_config_file.read_variable(\\\"object_type\\\")\\n vobject_class = {\\\"algorithm\\\":VAlgorithm,\\n \\\"task\\\":VTask,\\n \\\"data\\\":VData,\\n \\\"directory\\\":VDirectory,\\n \\\"project\\\":VProject}\\n return vobject_class[object_type](path)\",\n \"def make(self):\\n pass\",\n \"def New():\\n Self = $classname()\\n Self._initialize_()\\n Self._update_()\\n return Self\",\n \"def make(self, **kwargs):\\n raise NotImplementedError\",\n \"def Create(self):\\n raise NotImplementedError()\",\n \"def _new_instance(self):\\n return self.__class__(self._vmodule)\",\n \"def create(cls, **dictionary):\\n new_inst = cls.__new__(cls)\\n if cls.__name__ == \\\"Rectangle\\\":\\n new_inst.__init__(42, 98)\\n elif cls.__name__ == \\\"Square\\\":\\n new_inst.__init__(42)\\n new_inst.update(**dictionary)\\n return new_inst\",\n \"def create(cls, *args, **kwargs):\\r\\n return cls(*args, **kwargs).save()\",\n \"def create(cls, **dictionary):\\n if cls.__name__ == \\\"Rectangle\\\":\\n object = cls(1, 1)\\n object.update(**dictionary)\\n return object\\n\\n if cls.__name__ == \\\"Square\\\":\\n object = cls(1)\\n object.update(**dictionary)\\n return object\",\n \"def create(cls, **dictionary):\\n if cls.__name__ == 'Square':\\n object = cls(1)\\n object.update(**dictionary)\\n return object\\n\\n if cls.__name__ == 'Rectangle':\\n object = cls(1, 2)\\n object.update(**dictionary)\\n return object\",\n \"def create(self, cls, data=None):\\n return cls(self, initial_data=data)\",\n \"def __init__(self, *args):\\n this = _libsbml.new_ModelCreator(*args)\\n try: self.this.append(this)\\n except: self.this = this\",\n \"def create(*args):\",\n \"def new(self, obj):\\n key = obj.__class__.__name__+'.'+obj.id\\n self.__objects[key] = obj\",\n \"def new(self, obj):\\n if obj:\\n key = obj.__class__.__name__ + \\\".\\\" + obj.id\\n self.__objects[key] = obj\",\n \"def createBasicObject(self):\\n\\n\\t\\treturn self._createBasicObjFunct(self)\",\n \"def create(cls, **kwargs):\\n instance = cls(**kwargs)\\n instance.save()\\n return instance\",\n \"def create_instance(self,name):\\n print \\\"INFO : new %s\\\" % name\\n return self.get_class(name)()\",\n \"def create(klass, **kw):\\n m = klass(**kw)\\n m._new = True\\n return m\",\n \"def _new_instance(self):\\n return self.__class__(self._fmodule)\",\n \"def _new_instance(self):\\n return self.__class__(self._fmodule)\",\n \"def createObject(self, *args):\\n return _libsbml.Submodel_createObject(self, *args)\",\n \"def create(cls, dictionary):\\n return cls(**dictionary)\",\n \"def create(cls, dictionary):\\n return cls(**dictionary)\",\n \"def create_instance(self, **kwargs):\\r\\n create_options = self._generate_create_dict(**kwargs)\\r\\n return self.guest.createObject(create_options)\",\n \"def __init__(self, *args):\\n this = _libsbml.new_Model(*args)\\n try: self.this.append(this)\\n except: self.this = this\",\n \"def create(self, data):\\n raise NotImplementedError\",\n \"def create_instance(self, reset_data=None):\\n if reset_data is None:\\n log.error(f\\\"Cannot load Object with reset data of None.\\\")\\n return\\n\\n location = reset_data.target_loc_vnum\\n target_location = None\\n\\n log.debug(f\\\"Creating object[{self.vnum}] instance. \\\"\\n f\\\"Target {reset_data.target_loc_is}[{reset_data.target_loc_vnum}]\\\")\\n if reset_data.target_loc_is == \\\"mobile\\\":\\n target_location = self.area.mobile_inst_by_vnum(location)\\n if not target_location:\\n return\\n elif reset_data.target_loc_is == \\\"room\\\":\\n if type(location) is int and location in self.area.roomlist:\\n target_location = self.area.room_by_vnum(location)\\n else:\\n return\\n\\n new_obj = Object(self.area, self.to_json(), load_type=\\\"instance\\\")\\n new_obj.aid = str(uuid.uuid4())\\n\\n if target_location is not None and reset_data.target_loc_is == \\\"room\\\":\\n new_obj.move(target_location)\\n elif target_location is not None and reset_data.target_loc_is == \\\"mobile\\\":\\n target_location.contents[new_obj.aid] = new_obj\\n if reset_data.target_mobile_wear:\\n if 'hand' in self.default_wear_loc and self.keywords:\\n comm_ = f\\\"hold {self.keywords[0]}\\\"\\n target_location.interp(comm_)\\n elif self.keywords:\\n comm_ = f\\\"wear {self.keywords[0]} on {self.default_wear_loc}\\\"\\n target_location.interp(comm_)\",\n \"def do_create(self, args):\\n args = args.split()\\n l = len(args)\\n if l < 1:\\n print(\\\"** class name missing **\\\")\\n else:\\n if args[0] in HBNBCommand.valid_classes.keys():\\n if l == 1:\\n new_obj = HBNBCommand.valid_classes[args[0]]()\\n else:\\n result = self.__create_help(args[1:])\\n if result is None:\\n print(\\\"** Object fails **\\\")\\n return\\n new_obj = HBNBCommand.valid_classes[args[0]](**result)\\n print(new_obj.id)\\n new_obj.save()\\n else:\\n print(\\\"** class doesn't exist **\\\")\",\n \"def create_object(cls: Type[\\\"Object\\\"],\\n start_point: Tuple[int, int],\\n end_point: Tuple[int, int],\\n program: \\\"Program\\\",\\n canvas: tk.Canvas) -> Type[\\\"Object\\\"]:\\n pass\",\n \"def _create(self, title=''):\\n return ContentObject(title)\",\n \"def create_ion_object(self, object_params):\\n new_obj = IonObject(object_params[\\\"type_\\\"])\\n\\n # Iterate over the parameters to add to object; have to do this instead\\n # of passing a dict to get around restrictions in object creation on setting _id, _rev params\\n for param in object_params:\\n self.set_object_field(new_obj, param, object_params.get(param))\\n\\n new_obj._validate() # verify that all of the object fields were set with proper types\\n return new_obj\",\n \"def create(self, class_name, attrs, session):\",\n \"def _Create(self):\\n pass\",\n \"def make_objects(self):\\n pass\",\n \"def create_object(object_name):\\n if object_name == 'deathstar':\\n return Deathstar()\\n elif object_name == 'mercury':\\n return Mercury()\\n elif object_name == 'venus':\\n return Venus()\\n elif object_name == 'mars':\\n return Mars()\\n elif object_name == 'earth':\\n return Earth()\\n elif object_name == 'moon':\\n return Moon()\\n elif object_name == 'tatooine':\\n return Tatooine()\\n elif object_name == 'mordor':\\n return Mordor()\\n elif object_name == 'xwing':\\n return Xwing()\",\n \"def createObject(self, *args):\\n return _libsbml.FbcModelPlugin_createObject(self, *args)\",\n \"def _instantiate(cls, **kwargs):\\n return cls(**kwargs)\",\n \"def from_data(cls,data):\\n\\n new_object = cls() # Only this line needs to be updated\\n new_object.data = data\\n\\n return new_object\",\n \"def create(cls, data=None):\\n # allow create() calls with no input\\n if not data:\\n data = {}\\n\\n return cls(**data)\",\n \"def new(self, obj):\\n\\n key = \\\"{}.{}\\\".format(obj.__class__.__name__, obj.id)\\n self.__objects[key] = obj\",\n \"def new(self, _def, _dict=None, **kwargs):\\n\\n _def = self.get_def(_def)\\n obj = AnodeObjectBase(_def, _dict, **kwargs)\\n self.instances.add(obj)\\n self.instances_by_name[_def.type.name] = obj\\n return obj\",\n \"def new(name, source):\",\n \"def create_instance(self, date):\\n raise NotImplementedError\",\n \"def make_object(self, data, **kwargs):\\n if not data:\\n return None\\n return Note(\\n title=data['title'],\\n content=data['content'],\\n )\",\n \"def new(self, obj):\\n key = '{}.{}'.format(obj.__class__.__name__, obj.id)\\n self.__objects[key] = obj\",\n \"def create(cls, **_params):\\n cls_inst = cls()\\n cls_inst = cls_inst.set(**_params)\\n cls_inst.save()\\n return cls_inst\",\n \"def _mkObject(self):\\n return ImmutableObject(\\n store=self.store,\\n hash=u'somehash',\\n contentDigest=u'quux',\\n content=self.store.newFilePath('foo'),\\n contentType=u'application/octet-stream')\",\n \"def create_individual(self):\\n pass\",\n \"def create_instance(self, **attrs):\\n return self._create(_instance.Instance, **attrs)\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\",\n \"def __new__(*args, **kwargs):\\n ...\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8279344","0.81875837","0.76169944","0.7532984","0.7532984","0.74903953","0.7413568","0.7263086","0.7263086","0.7263086","0.7188198","0.71668696","0.7105122","0.70978415","0.7032688","0.70286256","0.69967264","0.697575","0.6942721","0.6913294","0.69061947","0.68732804","0.68594754","0.6824122","0.68045425","0.6802282","0.6800301","0.6800007","0.67886984","0.67809767","0.676915","0.6762539","0.6702267","0.6696043","0.6672337","0.66626805","0.6642999","0.66215193","0.66162497","0.6600577","0.6599635","0.65964454","0.65955216","0.6589351","0.6589351","0.6568672","0.6548489","0.6548489","0.654264","0.6535689","0.65198034","0.6516465","0.65142226","0.6495855","0.64897794","0.64868647","0.64791536","0.64777195","0.6469894","0.64573956","0.64522564","0.6450248","0.64496017","0.6441314","0.64411676","0.6440367","0.6426849","0.64216626","0.6420042","0.64192","0.641303","0.64112157","0.63947606","0.6372704","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316","0.63672316"],"string":"[\n \"0.8279344\",\n \"0.81875837\",\n \"0.76169944\",\n \"0.7532984\",\n \"0.7532984\",\n \"0.74903953\",\n \"0.7413568\",\n \"0.7263086\",\n \"0.7263086\",\n \"0.7263086\",\n \"0.7188198\",\n \"0.71668696\",\n \"0.7105122\",\n \"0.70978415\",\n \"0.7032688\",\n \"0.70286256\",\n \"0.69967264\",\n \"0.697575\",\n \"0.6942721\",\n \"0.6913294\",\n \"0.69061947\",\n \"0.68732804\",\n \"0.68594754\",\n \"0.6824122\",\n \"0.68045425\",\n \"0.6802282\",\n \"0.6800301\",\n \"0.6800007\",\n \"0.67886984\",\n \"0.67809767\",\n \"0.676915\",\n \"0.6762539\",\n \"0.6702267\",\n \"0.6696043\",\n \"0.6672337\",\n \"0.66626805\",\n \"0.6642999\",\n \"0.66215193\",\n \"0.66162497\",\n \"0.6600577\",\n \"0.6599635\",\n \"0.65964454\",\n \"0.65955216\",\n \"0.6589351\",\n \"0.6589351\",\n \"0.6568672\",\n \"0.6548489\",\n \"0.6548489\",\n \"0.654264\",\n \"0.6535689\",\n \"0.65198034\",\n \"0.6516465\",\n \"0.65142226\",\n \"0.6495855\",\n \"0.64897794\",\n \"0.64868647\",\n \"0.64791536\",\n \"0.64777195\",\n \"0.6469894\",\n \"0.64573956\",\n \"0.64522564\",\n \"0.6450248\",\n \"0.64496017\",\n \"0.6441314\",\n \"0.64411676\",\n \"0.6440367\",\n \"0.6426849\",\n \"0.64216626\",\n \"0.6420042\",\n \"0.64192\",\n \"0.641303\",\n \"0.64112157\",\n \"0.63947606\",\n \"0.6372704\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\",\n \"0.63672316\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94788,"cells":{"query":{"kind":"string","value":"Used for debugging and displaying in user friendly manner."},"document":{"kind":"string","value":"def __repr__(self):\n s = \"\"\n for y in range(0,HEIGHT):\n temp=\"\"\n for x in range(0,WIDTH):\n temp = temp+ str(self.gameState[x,y])\n s += temp+\"\\n\"\n return s"},"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 debug():","def output_debug_info(self):","def debug_string(self):\n\n raise NotImplementedError","def debug(self):\n raise NotImplementedError","def debug_print(self):\n print self.title\n print self.storyline\n print self.poster_image_url\n print self.trailer_youtube_url\n print \"------\"","def debug(self, message):\r\n pass","def debug(self) -> str:\n\n return Widget.debug(self)","def __debugInfo(self, msg):\n\t\tif self.verbosity:\n\t\t\tprint(stylize(\"[*] DEBUG: {}\".format(msg), colored.fg(\"wheat_1\")))","def debug(msg):","def _print_custom(self):\n pass","def debug(self, msg):\n debug(msg)","def _printable(self):\n pass","def debug(self, *args, **kwargs):","def debug(self):\r\n print(\"_,.-^ DEBUG ^-.,_\")\r\n print(\"state = %s %s\"%(self.state, self.error))\r\n print(\"\".join(self.memory))\r\n print ((self.pointer*\" \")+\"^\")\r\n print(\"PROGRAM\")\r\n print(\" {:16}{:7}{:7}{:7}{:16}\".format(\"State\", \"symbol\", \"write\", \"move\", \"new_state\"))\r\n for row in self.program:\r\n if row.state == self.state and row.symbol == self.memory[self.pointer]:\r\n print(\">\", end=\"\")\r\n else:\r\n print(\" \", end=\"\")\r\n print(row)","def show(self):\n self._logger.debug(\"show\")","def printMe(self):\n tempDict = self.whoAreYou()\n for key in tempDict.keys():\n self.raiseADebug(' {0:15}: {1}'.format(key,str(tempDict[key])))\n tempDict = self.getInitParams()\n self.raiseADebug(' Initialization Parameters:')\n for key in tempDict.keys():\n self.raiseADebug(' {0:15}: {1}'.format(key,str(tempDict[key])))\n tempDict = self.myCurrentSetting()\n self.raiseADebug(' Current Setting:')\n for key in tempDict.keys():\n self.raiseADebug(' {0:15}: {1}'.format(key,str(tempDict[key])))","def __debug_print__(self):\n print(self.question_data)","def print_out():\n pass","def debug(self):\n \n #path\n print('Path information:')\n for k, v in self.__path.items():\n print(k, v)\n \n #sample count\n print('Sample statistic of each phase')\n for k, v in self.__phase_sample_count.items():\n print(k, v)\n \n print('Sample statistic of each class')\n for k, v in self.__area_sample_count.items():\n print(k, v)\n \n print('Sample statistic of each train')\n for k, v in self.__train_sample_count.items():\n print(k, v)","def show_debug_msg(self) -> None:\n if self.debug_mode:\n for point in self.points:\n print(point.debug_info())","def debug(self, msg):\n if self._debug:\n print \"%s\" % (msg)","def debug(self, text):\n if self.PRINT_DEBUG:\n print('[FileHistory] ' + text)","def debug(self, msg, *args, **kwargs):\n pass","def debug() -> bool:","def pprint(self):\n # just here for defining the interface; work is done in subclasses\n pass","def debug_print(text):\r\n if settings.debug:\r\n print (text)","def debug(self, msg=\"\"):\n if self.verbose:\n print(\"Debug: \" + msg)","def visualizar(self):\n print(self.stack)","def debug(self):\n print(self.memory)\n print('r0 = %s, ip = %s' % (self.r0, self.ip))","def __str__(self):\n debug_str = \"%s ::=\" % str(self.head)\n for symbol in self.body:\n debug_str += \" %s\" % str(symbol)\n return debug_str","def debugPrint(text: str):\r\n if DEBUG:\r\n print(text)","def fullDebug():\r\n global CurrentState\r\n global CurrentInput\r\n global RESPONSEOPTIONS\r\n print(\"___________________________\")\r\n print(\"\\n*Current Input:\", CurrentInput)\r\n print(\"*Current State: \", CurrentState)\r\n print(\"\\n*Response Options: \", RESPONSEOPTIONS)\r\n print(\"___________________________\")","def print_debug(self):\n print()\n print(\"Variable names ({} total):\".format(len(self.variable_names)))\n print()\n for variable in self.variable_names:\n print(variable)\n print()\n\n print(\"Clauses:\")\n print()\n for clause in self.abstract_clauses:\n print(clause)","def __str__(self): # pragma: no cover\n return self.display()","def debug(msg):\n #print(msg)\n pass\n #end debug","def show_info(self):\n print(\"Problem number: \" + str(self.number))\n print(\"Problem name: \" + str(self.name))\n print(\"Problem description: \" + str(self.desc))","def compute_debug(self):","def __debug(msg):\n\n pass","def debug_print(self):\n os.system('cls' if os.name == 'nt' else 'clear')\n\n print('\\nPosition')\n print(self.tetromino.position())\n print('\\nBlock coordinates')\n print(self.tetromino.block_coordinates())\n print('\\nBoard')\n print(self.board)\n print('\\nBoard heights')\n print(self.board.get_height())\n\n if self.pause:\n print('\\nPaused')","def print_debug(context: str = \"\") -> None:\r\n print(context)\r\n print(\"This is the current board\")\r\n print(example)\r\n print(\"This is the conflict space\")\r\n print(conflict_space)\r\n print(\"This is the safeboard\")\r\n print(safeboard)","def display(self):\n print(self)","def _show(self, indent = 0):\n print(\" \"*indent, \"Name:\", self.name)\n print(\" \"*indent, \"Description:\", self.description)","def debug_repr(self) -> str:\n repr_string = \"{}(Confi):\\n\".format(self.__class__.__name__)\n items = list(self.entries.items())\n items.sort(key = lambda item: item[0])\n indent = ' ' * 4\n for key, entry in items:\n repr_string += f\"{indent}{key}: {repr(entry.value)}\\n\"\n return repr_string","def debug(self, input):\n # Pass the debug information that you may think is important for your\n # evaluators\n debug_info = 'debug info'\n return debug_info","def debug(self, input):\n # Pass the debug information that you may think is important for your\n # evaluators\n debug_info = 'debug info'\n return debug_info","def print(self):\r\n self.print_avec_separateur()","def display(self):\n print(str(self))","def debug_print(self, *args, **kwargs):\n print(\"APP_DEBUG_PRINT\", args, kwargs)","def debug():\n def _debug(x):\n return e.String(x.as_source())\n yield (\"(λ any . str)\", _debug)","def debug(self):\n try:\n super(FaucetTopoTestBase, self).debug()\n except Exception:\n pprint.pprint(self.host_information)\n raise","def debug(self):\n neighbors = len(self.__neighbors)\n string = self.__repr__() + f' neighbors: {self.living_neighbors()}/{neighbors}'\n for neighbor in self.__neighbors:\n string += '\\n ' + neighbor.__repr__()\n print(string)","def _debuginfo(self,suspect,message):\n suspect.debug(message)\n self.logger.debug(message)","def print(self):\n print(self.pretty_str())","def PrettyPrint(self):\r\n print(self.data)\r\n return","def display(self,message):\r\n \r\n print(message)","def print_problem(self):\n print('\\n*****************')\n print('PROBLEM: ' + self.problem)\n print('OBJECTS: ' + str(self.objects))\n print('INIT: ' + str(self.init))\n print('GOAL: ' + str(self.goal))\n print('AGENTS: ' + str(self.agents))\n print('****************')","def debugprint(self, cur_pos): \n print(\"cur_pos = \", cur_pos)\n print(\"Distance map:\")\n print(self.distance_map)\n print(\"Frontier:\")\n print(sorted(self.frontier.items(), key=lambda x:x[1] ))\n print(\"Footprint:\")\n print(self.footprint)\n print(\"--------------\")","def demo_log(self):\n self.logger.debug('This is a debug')\n self.logger.debug(self.name)\n self.logger.debug(self.doc)","def debug(self):\n #breakpoint() # infinite loop\n print(self.ttl)","def show(self):\n pass","def debug_to_console(self):\n vert = None\n horiz = None\n if self.grid.apple_is_up():\n vert = \"Up \"\n elif self.grid.apple_is_down():\n vert = \"Down\"\n else:\n vert = \"None\"\n if self.grid.apple_is_left():\n horiz = \"Left \"\n elif self.grid.apple_is_right():\n horiz = \"Right\"\n else:\n horiz = \"None \"\n print(\n \"Apple is: (\", vert, \",\", horiz,\n \")\\tProximity: \",\n str(round(self.grid.proximity_to_apple(), 2)), \"\\t[x, y]:\",\n self.grid.snake.head(),\n \" \\tUp: (\", str(round(self.grid.safe_cells_up(), 2)),\n \",\", str(round(self.grid.safe_cells_up_global(), 2)), \")\"\n \" \\tDown: (\", str(round(self.grid.safe_cells_down(), 2)),\n \",\", str(round(self.grid.safe_cells_down_global(), 2)), \")\"\n \" \\tLeft: (\", str(round(self.grid.safe_cells_left(), 2)),\n \",\", str(round(self.grid.safe_cells_left_global(), 2)), \")\"\n \" \\tRight: (\", str(round(self.grid.safe_cells_right(), 2)),\n \",\", str(round(self.grid.safe_cells_right_global(), 2)), \")\"\n )","def _print(self, text):\n\t\tif self.verbose:\n\t\t\tprint text","def write_debug_info(self):\n #path = self.request.uri.split('?')[0]\n #method = path.split('/')[-1]\n \n self.write(\"Handler: \" + str(self.__class__.__name__)+\"<br>\")\n self.write(\"<hr>\")\n self.write(str(dir(self.request)))\n self.write(\"<br><hr>\")\n self.write(\"query_arguments:\" + str(self.request.query_arguments))\n self.write(\"<br>\")\n self.write(\"uri:\" + self.uri)\n self.write(\"<br>\")\n self.write(\"path:\" + self.path)\n self.write(\"<br>\")\n self.write(\"method to call: \" + self.request.method.lower() + \"_\" + self.method)\n self.write(\"<hr>\")\n self.write(\"request method: \" + self.request.method)\n self.write(\"<hr>\")\n self.write(\"request headers: \" + str(self.request.headers))\n self.write(\"<hr>\")\n self.flush()","def print_me(self):\n return \"ID: %s Title: %s\" % (self.ID, self.title)","def __str__(self):\n return self.trace","def debug_print(self, *content):\n if self.debug:\n print(*content)","def show(self):\n\t\traise NotImplementedError()","def print(self):\n self.print_avec_separateur(\" \")","def disp(self):\r\n print('method BaseDataLogger.disp() not implemented, to be done in subclass ' + str(type(self)))","def disp(self):\r\n print('method BaseDataLogger.disp() not implemented, to be done in subclass ' + str(type(self)))","def show():\n info(str(Project))","def help_dump(self):\n print(DUMP)","def print(self):\n # Your implementation here","def debug(self, message):\r\n if self._debug:\r\n print('[Debug] %s' % message)","def debug(node):\n print \"%r\" % node","def print(self):\r\n print(\"[DEBUG] STACK: \", self.__memory.__repr__())","def __window_print(self):\n pass","def command_show(problem):\r\n print problem.get_html()","def __str__(self):\n\n desc = self.description\n if desc is not None:\n return str(desc)\n\n desc = self.debugDescription\n if desc is not None:\n return str(desc)\n\n return repr(self)","def _verbose(self,text):\n if self.verbose:\n print(text)","def print(self):\n print('Name:', self.name)\n print('Camera:', self.camera)\n print('Memory:', self.memory)\n print('Ram:', self.ram)\n print('Price:', self.price)\n print('Image:', self.image)","def printdebug(self, msg):\n if self.debug > 0:\n print(msg)","def info(self):","def info(self):","def debug(self, *args: Any, **kwargs) -> None:\n ...","def show_state(self):\n print \"I don't know how to show_state.\"","def show(self) -> None:","def debug():\r\n global CurrentState\r\n global CurrentInput\r\n global RESPONSEOPTIONS\r\n print(\"___________________________\")\r\n for state in RESPONSEOPTIONS:\r\n score = calcTotalScore(state, CurrentInput, CurrentState)\r\n print(state.id + \": \" + str(score) + \" ,\", end=\"\")\r\n print(\"\\n___________________________\")","def print_details(self):\n self.view.print_details()","def __str__(self):\n #{{{ Nicely print of elements in class\n\n if config.debug:\n\n for orid in self.event_cache:\n print \"\\nEvents(): %s(%s)\" % (orid,self.event_cache[orid])\n\n else: \n\n print \"Events(): %s\" % (self.event_cache.keys())","def show_data():","def __debug(self):\n\t\tprint \"Dumping Object Chat\"\n\t\tprint self.userA.username +' + '+ self.userB.username","def __str__(self):\n return self.printable()","def print_problem(self) -> None:\n self._assert_problem_is_valid()\n print(f\"{'*'*60}\\n{' Silent Substitution Problem ':*^60s}\\n{'*'*60}\")\n print(f\"Device: {self.name}\")\n print(f\"Observer: {self.observer}\")\n print(f\"Ignoring: {self._ignore}\")\n print(f\"Silencing: {self._silence}\")\n print(f\"Targeting: {self._target}\")\n print(f\"Target contrast: {self._target_contrast}\")\n print(f\"Background: {self._background}\")\n print(\"\\n\")","def debug(string):\n if verbose:\n print string\n return","def debug(string):\n if conf.DEBUG:\n outputs.print_debug(string)","def DebugInfo( self, request_data ):\n pass","def debug(msg):\n if settings.DEBUG:\n print \"DEBUG: cli.%(msg)s\" % locals()","def debug(state: bool, /) -> None:","def debug_print(debug_data):\n if DEBUG_MODE == \"true\":\n pp.pprint(debug_data)","def dump(self):\n self.logger.debug(self)"],"string":"[\n \"def debug():\",\n \"def output_debug_info(self):\",\n \"def debug_string(self):\\n\\n raise NotImplementedError\",\n \"def debug(self):\\n raise NotImplementedError\",\n \"def debug_print(self):\\n print self.title\\n print self.storyline\\n print self.poster_image_url\\n print self.trailer_youtube_url\\n print \\\"------\\\"\",\n \"def debug(self, message):\\r\\n pass\",\n \"def debug(self) -> str:\\n\\n return Widget.debug(self)\",\n \"def __debugInfo(self, msg):\\n\\t\\tif self.verbosity:\\n\\t\\t\\tprint(stylize(\\\"[*] DEBUG: {}\\\".format(msg), colored.fg(\\\"wheat_1\\\")))\",\n \"def debug(msg):\",\n \"def _print_custom(self):\\n pass\",\n \"def debug(self, msg):\\n debug(msg)\",\n \"def _printable(self):\\n pass\",\n \"def debug(self, *args, **kwargs):\",\n \"def debug(self):\\r\\n print(\\\"_,.-^ DEBUG ^-.,_\\\")\\r\\n print(\\\"state = %s %s\\\"%(self.state, self.error))\\r\\n print(\\\"\\\".join(self.memory))\\r\\n print ((self.pointer*\\\" \\\")+\\\"^\\\")\\r\\n print(\\\"PROGRAM\\\")\\r\\n print(\\\" {:16}{:7}{:7}{:7}{:16}\\\".format(\\\"State\\\", \\\"symbol\\\", \\\"write\\\", \\\"move\\\", \\\"new_state\\\"))\\r\\n for row in self.program:\\r\\n if row.state == self.state and row.symbol == self.memory[self.pointer]:\\r\\n print(\\\">\\\", end=\\\"\\\")\\r\\n else:\\r\\n print(\\\" \\\", end=\\\"\\\")\\r\\n print(row)\",\n \"def show(self):\\n self._logger.debug(\\\"show\\\")\",\n \"def printMe(self):\\n tempDict = self.whoAreYou()\\n for key in tempDict.keys():\\n self.raiseADebug(' {0:15}: {1}'.format(key,str(tempDict[key])))\\n tempDict = self.getInitParams()\\n self.raiseADebug(' Initialization Parameters:')\\n for key in tempDict.keys():\\n self.raiseADebug(' {0:15}: {1}'.format(key,str(tempDict[key])))\\n tempDict = self.myCurrentSetting()\\n self.raiseADebug(' Current Setting:')\\n for key in tempDict.keys():\\n self.raiseADebug(' {0:15}: {1}'.format(key,str(tempDict[key])))\",\n \"def __debug_print__(self):\\n print(self.question_data)\",\n \"def print_out():\\n pass\",\n \"def debug(self):\\n \\n #path\\n print('Path information:')\\n for k, v in self.__path.items():\\n print(k, v)\\n \\n #sample count\\n print('Sample statistic of each phase')\\n for k, v in self.__phase_sample_count.items():\\n print(k, v)\\n \\n print('Sample statistic of each class')\\n for k, v in self.__area_sample_count.items():\\n print(k, v)\\n \\n print('Sample statistic of each train')\\n for k, v in self.__train_sample_count.items():\\n print(k, v)\",\n \"def show_debug_msg(self) -> None:\\n if self.debug_mode:\\n for point in self.points:\\n print(point.debug_info())\",\n \"def debug(self, msg):\\n if self._debug:\\n print \\\"%s\\\" % (msg)\",\n \"def debug(self, text):\\n if self.PRINT_DEBUG:\\n print('[FileHistory] ' + text)\",\n \"def debug(self, msg, *args, **kwargs):\\n pass\",\n \"def debug() -> bool:\",\n \"def pprint(self):\\n # just here for defining the interface; work is done in subclasses\\n pass\",\n \"def debug_print(text):\\r\\n if settings.debug:\\r\\n print (text)\",\n \"def debug(self, msg=\\\"\\\"):\\n if self.verbose:\\n print(\\\"Debug: \\\" + msg)\",\n \"def visualizar(self):\\n print(self.stack)\",\n \"def debug(self):\\n print(self.memory)\\n print('r0 = %s, ip = %s' % (self.r0, self.ip))\",\n \"def __str__(self):\\n debug_str = \\\"%s ::=\\\" % str(self.head)\\n for symbol in self.body:\\n debug_str += \\\" %s\\\" % str(symbol)\\n return debug_str\",\n \"def debugPrint(text: str):\\r\\n if DEBUG:\\r\\n print(text)\",\n \"def fullDebug():\\r\\n global CurrentState\\r\\n global CurrentInput\\r\\n global RESPONSEOPTIONS\\r\\n print(\\\"___________________________\\\")\\r\\n print(\\\"\\\\n*Current Input:\\\", CurrentInput)\\r\\n print(\\\"*Current State: \\\", CurrentState)\\r\\n print(\\\"\\\\n*Response Options: \\\", RESPONSEOPTIONS)\\r\\n print(\\\"___________________________\\\")\",\n \"def print_debug(self):\\n print()\\n print(\\\"Variable names ({} total):\\\".format(len(self.variable_names)))\\n print()\\n for variable in self.variable_names:\\n print(variable)\\n print()\\n\\n print(\\\"Clauses:\\\")\\n print()\\n for clause in self.abstract_clauses:\\n print(clause)\",\n \"def __str__(self): # pragma: no cover\\n return self.display()\",\n \"def debug(msg):\\n #print(msg)\\n pass\\n #end debug\",\n \"def show_info(self):\\n print(\\\"Problem number: \\\" + str(self.number))\\n print(\\\"Problem name: \\\" + str(self.name))\\n print(\\\"Problem description: \\\" + str(self.desc))\",\n \"def compute_debug(self):\",\n \"def __debug(msg):\\n\\n pass\",\n \"def debug_print(self):\\n os.system('cls' if os.name == 'nt' else 'clear')\\n\\n print('\\\\nPosition')\\n print(self.tetromino.position())\\n print('\\\\nBlock coordinates')\\n print(self.tetromino.block_coordinates())\\n print('\\\\nBoard')\\n print(self.board)\\n print('\\\\nBoard heights')\\n print(self.board.get_height())\\n\\n if self.pause:\\n print('\\\\nPaused')\",\n \"def print_debug(context: str = \\\"\\\") -> None:\\r\\n print(context)\\r\\n print(\\\"This is the current board\\\")\\r\\n print(example)\\r\\n print(\\\"This is the conflict space\\\")\\r\\n print(conflict_space)\\r\\n print(\\\"This is the safeboard\\\")\\r\\n print(safeboard)\",\n \"def display(self):\\n print(self)\",\n \"def _show(self, indent = 0):\\n print(\\\" \\\"*indent, \\\"Name:\\\", self.name)\\n print(\\\" \\\"*indent, \\\"Description:\\\", self.description)\",\n \"def debug_repr(self) -> str:\\n repr_string = \\\"{}(Confi):\\\\n\\\".format(self.__class__.__name__)\\n items = list(self.entries.items())\\n items.sort(key = lambda item: item[0])\\n indent = ' ' * 4\\n for key, entry in items:\\n repr_string += f\\\"{indent}{key}: {repr(entry.value)}\\\\n\\\"\\n return repr_string\",\n \"def debug(self, input):\\n # Pass the debug information that you may think is important for your\\n # evaluators\\n debug_info = 'debug info'\\n return debug_info\",\n \"def debug(self, input):\\n # Pass the debug information that you may think is important for your\\n # evaluators\\n debug_info = 'debug info'\\n return debug_info\",\n \"def print(self):\\r\\n self.print_avec_separateur()\",\n \"def display(self):\\n print(str(self))\",\n \"def debug_print(self, *args, **kwargs):\\n print(\\\"APP_DEBUG_PRINT\\\", args, kwargs)\",\n \"def debug():\\n def _debug(x):\\n return e.String(x.as_source())\\n yield (\\\"(λ any . str)\\\", _debug)\",\n \"def debug(self):\\n try:\\n super(FaucetTopoTestBase, self).debug()\\n except Exception:\\n pprint.pprint(self.host_information)\\n raise\",\n \"def debug(self):\\n neighbors = len(self.__neighbors)\\n string = self.__repr__() + f' neighbors: {self.living_neighbors()}/{neighbors}'\\n for neighbor in self.__neighbors:\\n string += '\\\\n ' + neighbor.__repr__()\\n print(string)\",\n \"def _debuginfo(self,suspect,message):\\n suspect.debug(message)\\n self.logger.debug(message)\",\n \"def print(self):\\n print(self.pretty_str())\",\n \"def PrettyPrint(self):\\r\\n print(self.data)\\r\\n return\",\n \"def display(self,message):\\r\\n \\r\\n print(message)\",\n \"def print_problem(self):\\n print('\\\\n*****************')\\n print('PROBLEM: ' + self.problem)\\n print('OBJECTS: ' + str(self.objects))\\n print('INIT: ' + str(self.init))\\n print('GOAL: ' + str(self.goal))\\n print('AGENTS: ' + str(self.agents))\\n print('****************')\",\n \"def debugprint(self, cur_pos): \\n print(\\\"cur_pos = \\\", cur_pos)\\n print(\\\"Distance map:\\\")\\n print(self.distance_map)\\n print(\\\"Frontier:\\\")\\n print(sorted(self.frontier.items(), key=lambda x:x[1] ))\\n print(\\\"Footprint:\\\")\\n print(self.footprint)\\n print(\\\"--------------\\\")\",\n \"def demo_log(self):\\n self.logger.debug('This is a debug')\\n self.logger.debug(self.name)\\n self.logger.debug(self.doc)\",\n \"def debug(self):\\n #breakpoint() # infinite loop\\n print(self.ttl)\",\n \"def show(self):\\n pass\",\n \"def debug_to_console(self):\\n vert = None\\n horiz = None\\n if self.grid.apple_is_up():\\n vert = \\\"Up \\\"\\n elif self.grid.apple_is_down():\\n vert = \\\"Down\\\"\\n else:\\n vert = \\\"None\\\"\\n if self.grid.apple_is_left():\\n horiz = \\\"Left \\\"\\n elif self.grid.apple_is_right():\\n horiz = \\\"Right\\\"\\n else:\\n horiz = \\\"None \\\"\\n print(\\n \\\"Apple is: (\\\", vert, \\\",\\\", horiz,\\n \\\")\\\\tProximity: \\\",\\n str(round(self.grid.proximity_to_apple(), 2)), \\\"\\\\t[x, y]:\\\",\\n self.grid.snake.head(),\\n \\\" \\\\tUp: (\\\", str(round(self.grid.safe_cells_up(), 2)),\\n \\\",\\\", str(round(self.grid.safe_cells_up_global(), 2)), \\\")\\\"\\n \\\" \\\\tDown: (\\\", str(round(self.grid.safe_cells_down(), 2)),\\n \\\",\\\", str(round(self.grid.safe_cells_down_global(), 2)), \\\")\\\"\\n \\\" \\\\tLeft: (\\\", str(round(self.grid.safe_cells_left(), 2)),\\n \\\",\\\", str(round(self.grid.safe_cells_left_global(), 2)), \\\")\\\"\\n \\\" \\\\tRight: (\\\", str(round(self.grid.safe_cells_right(), 2)),\\n \\\",\\\", str(round(self.grid.safe_cells_right_global(), 2)), \\\")\\\"\\n )\",\n \"def _print(self, text):\\n\\t\\tif self.verbose:\\n\\t\\t\\tprint text\",\n \"def write_debug_info(self):\\n #path = self.request.uri.split('?')[0]\\n #method = path.split('/')[-1]\\n \\n self.write(\\\"Handler: \\\" + str(self.__class__.__name__)+\\\"<br>\\\")\\n self.write(\\\"<hr>\\\")\\n self.write(str(dir(self.request)))\\n self.write(\\\"<br><hr>\\\")\\n self.write(\\\"query_arguments:\\\" + str(self.request.query_arguments))\\n self.write(\\\"<br>\\\")\\n self.write(\\\"uri:\\\" + self.uri)\\n self.write(\\\"<br>\\\")\\n self.write(\\\"path:\\\" + self.path)\\n self.write(\\\"<br>\\\")\\n self.write(\\\"method to call: \\\" + self.request.method.lower() + \\\"_\\\" + self.method)\\n self.write(\\\"<hr>\\\")\\n self.write(\\\"request method: \\\" + self.request.method)\\n self.write(\\\"<hr>\\\")\\n self.write(\\\"request headers: \\\" + str(self.request.headers))\\n self.write(\\\"<hr>\\\")\\n self.flush()\",\n \"def print_me(self):\\n return \\\"ID: %s Title: %s\\\" % (self.ID, self.title)\",\n \"def __str__(self):\\n return self.trace\",\n \"def debug_print(self, *content):\\n if self.debug:\\n print(*content)\",\n \"def show(self):\\n\\t\\traise NotImplementedError()\",\n \"def print(self):\\n self.print_avec_separateur(\\\" \\\")\",\n \"def disp(self):\\r\\n print('method BaseDataLogger.disp() not implemented, to be done in subclass ' + str(type(self)))\",\n \"def disp(self):\\r\\n print('method BaseDataLogger.disp() not implemented, to be done in subclass ' + str(type(self)))\",\n \"def show():\\n info(str(Project))\",\n \"def help_dump(self):\\n print(DUMP)\",\n \"def print(self):\\n # Your implementation here\",\n \"def debug(self, message):\\r\\n if self._debug:\\r\\n print('[Debug] %s' % message)\",\n \"def debug(node):\\n print \\\"%r\\\" % node\",\n \"def print(self):\\r\\n print(\\\"[DEBUG] STACK: \\\", self.__memory.__repr__())\",\n \"def __window_print(self):\\n pass\",\n \"def command_show(problem):\\r\\n print problem.get_html()\",\n \"def __str__(self):\\n\\n desc = self.description\\n if desc is not None:\\n return str(desc)\\n\\n desc = self.debugDescription\\n if desc is not None:\\n return str(desc)\\n\\n return repr(self)\",\n \"def _verbose(self,text):\\n if self.verbose:\\n print(text)\",\n \"def print(self):\\n print('Name:', self.name)\\n print('Camera:', self.camera)\\n print('Memory:', self.memory)\\n print('Ram:', self.ram)\\n print('Price:', self.price)\\n print('Image:', self.image)\",\n \"def printdebug(self, msg):\\n if self.debug > 0:\\n print(msg)\",\n \"def info(self):\",\n \"def info(self):\",\n \"def debug(self, *args: Any, **kwargs) -> None:\\n ...\",\n \"def show_state(self):\\n print \\\"I don't know how to show_state.\\\"\",\n \"def show(self) -> None:\",\n \"def debug():\\r\\n global CurrentState\\r\\n global CurrentInput\\r\\n global RESPONSEOPTIONS\\r\\n print(\\\"___________________________\\\")\\r\\n for state in RESPONSEOPTIONS:\\r\\n score = calcTotalScore(state, CurrentInput, CurrentState)\\r\\n print(state.id + \\\": \\\" + str(score) + \\\" ,\\\", end=\\\"\\\")\\r\\n print(\\\"\\\\n___________________________\\\")\",\n \"def print_details(self):\\n self.view.print_details()\",\n \"def __str__(self):\\n #{{{ Nicely print of elements in class\\n\\n if config.debug:\\n\\n for orid in self.event_cache:\\n print \\\"\\\\nEvents(): %s(%s)\\\" % (orid,self.event_cache[orid])\\n\\n else: \\n\\n print \\\"Events(): %s\\\" % (self.event_cache.keys())\",\n \"def show_data():\",\n \"def __debug(self):\\n\\t\\tprint \\\"Dumping Object Chat\\\"\\n\\t\\tprint self.userA.username +' + '+ self.userB.username\",\n \"def __str__(self):\\n return self.printable()\",\n \"def print_problem(self) -> None:\\n self._assert_problem_is_valid()\\n print(f\\\"{'*'*60}\\\\n{' Silent Substitution Problem ':*^60s}\\\\n{'*'*60}\\\")\\n print(f\\\"Device: {self.name}\\\")\\n print(f\\\"Observer: {self.observer}\\\")\\n print(f\\\"Ignoring: {self._ignore}\\\")\\n print(f\\\"Silencing: {self._silence}\\\")\\n print(f\\\"Targeting: {self._target}\\\")\\n print(f\\\"Target contrast: {self._target_contrast}\\\")\\n print(f\\\"Background: {self._background}\\\")\\n print(\\\"\\\\n\\\")\",\n \"def debug(string):\\n if verbose:\\n print string\\n return\",\n \"def debug(string):\\n if conf.DEBUG:\\n outputs.print_debug(string)\",\n \"def DebugInfo( self, request_data ):\\n pass\",\n \"def debug(msg):\\n if settings.DEBUG:\\n print \\\"DEBUG: cli.%(msg)s\\\" % locals()\",\n \"def debug(state: bool, /) -> None:\",\n \"def debug_print(debug_data):\\n if DEBUG_MODE == \\\"true\\\":\\n pp.pprint(debug_data)\",\n \"def dump(self):\\n self.logger.debug(self)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7927461","0.77589476","0.74094605","0.7343519","0.73350525","0.7155053","0.7092897","0.70533305","0.70131016","0.7006562","0.69903415","0.69416094","0.69380265","0.68714195","0.6865168","0.68511516","0.6811546","0.68112475","0.6776409","0.67534703","0.67317986","0.6659786","0.6648442","0.6636242","0.663607","0.6628409","0.66189414","0.65906453","0.6590476","0.65801215","0.6578925","0.657702","0.6565381","0.6563253","0.65345895","0.65272355","0.6511501","0.65048903","0.6504079","0.6495901","0.64877975","0.64829326","0.6474352","0.646279","0.646279","0.64507574","0.6447908","0.64397144","0.64393646","0.6439086","0.64329326","0.64264077","0.6412305","0.6411126","0.6404614","0.640377","0.63864547","0.6385463","0.6376414","0.63757247","0.6361464","0.63495445","0.63433206","0.6338934","0.63320047","0.63183993","0.63117456","0.6311198","0.63081074","0.63081074","0.63012904","0.63004756","0.6289677","0.6270353","0.62696","0.62692404","0.62621194","0.6255398","0.6244141","0.6242517","0.62412685","0.6236337","0.62330276","0.62330276","0.6230348","0.62261784","0.62261266","0.62198395","0.62176734","0.6214959","0.62142897","0.61941135","0.61910516","0.61906934","0.6182579","0.61738515","0.61710185","0.61702746","0.6166147","0.6165996","0.61615247"],"string":"[\n \"0.7927461\",\n \"0.77589476\",\n \"0.74094605\",\n \"0.7343519\",\n \"0.73350525\",\n \"0.7155053\",\n \"0.7092897\",\n \"0.70533305\",\n \"0.70131016\",\n \"0.7006562\",\n \"0.69903415\",\n \"0.69416094\",\n \"0.69380265\",\n \"0.68714195\",\n \"0.6865168\",\n \"0.68511516\",\n \"0.6811546\",\n \"0.68112475\",\n \"0.6776409\",\n \"0.67534703\",\n \"0.67317986\",\n \"0.6659786\",\n \"0.6648442\",\n \"0.6636242\",\n \"0.663607\",\n \"0.6628409\",\n \"0.66189414\",\n \"0.65906453\",\n \"0.6590476\",\n \"0.65801215\",\n \"0.6578925\",\n \"0.657702\",\n \"0.6565381\",\n \"0.6563253\",\n \"0.65345895\",\n \"0.65272355\",\n \"0.6511501\",\n \"0.65048903\",\n \"0.6504079\",\n \"0.6495901\",\n \"0.64877975\",\n \"0.64829326\",\n \"0.6474352\",\n \"0.646279\",\n \"0.646279\",\n \"0.64507574\",\n \"0.6447908\",\n \"0.64397144\",\n \"0.64393646\",\n \"0.6439086\",\n \"0.64329326\",\n \"0.64264077\",\n \"0.6412305\",\n \"0.6411126\",\n \"0.6404614\",\n \"0.640377\",\n \"0.63864547\",\n \"0.6385463\",\n \"0.6376414\",\n \"0.63757247\",\n \"0.6361464\",\n \"0.63495445\",\n \"0.63433206\",\n \"0.6338934\",\n \"0.63320047\",\n \"0.63183993\",\n \"0.63117456\",\n \"0.6311198\",\n \"0.63081074\",\n \"0.63081074\",\n \"0.63012904\",\n \"0.63004756\",\n \"0.6289677\",\n \"0.6270353\",\n \"0.62696\",\n \"0.62692404\",\n \"0.62621194\",\n \"0.6255398\",\n \"0.6244141\",\n \"0.6242517\",\n \"0.62412685\",\n \"0.6236337\",\n \"0.62330276\",\n \"0.62330276\",\n \"0.6230348\",\n \"0.62261784\",\n \"0.62261266\",\n \"0.62198395\",\n \"0.62176734\",\n \"0.6214959\",\n \"0.62142897\",\n \"0.61941135\",\n \"0.61910516\",\n \"0.61906934\",\n \"0.6182579\",\n \"0.61738515\",\n \"0.61710185\",\n \"0.61702746\",\n \"0.6166147\",\n \"0.6165996\",\n \"0.61615247\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94789,"cells":{"query":{"kind":"string","value":"Translate the board description into a string. Used for a hash table."},"document":{"kind":"string","value":"def __str__(self):\n s=\"\"\n for y in range(0,HEIGHT):\n for x in range(0,WIDTH):\n s+=str(self.gameState[x,y])\n return s"},"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 StringFromBoard(board):\n\trows = []\n\tfor row in board:\n\t\trows.append('|'.join([' '+square+' ' for square in row]))\n\treturn '\\n-----------\\n'.join(rows)","def __str__(self):\n rep = \"\"\n for row in range(self._dim):\n for col in range(self._dim):\n rep += STRMAP[self._board[row][col]]\n if col == self._dim - 1:\n rep += \"\\n\"\n else:\n rep += \" | \"\n if row != self._dim - 1:\n rep += \"-\" * (4 * self._dim - 3)\n rep += \"\\n\"\n return rep","def uninterpret_board(self):\n\t\tboard_string = ''\n\t\tfor i in range(len(self.board)):\n\t\t\tfor j in range(len(self.board[i])):\n\t\t\t\tboard_string+=self.board[i][j]\n\n\t\treturn board_string","def board_string(self):\n s = \"\"\n for i, v in enumerate(self.board):\n # if i % 81 == 0:\n # s += \"\\n\"\n if v is None:\n s += \"0\"\n else:\n if v.color == StoneColor.black:\n s += \"1\"\n else:\n s += \"2\"\n return s","def __str__(self):\n\t\tboardString = \"\\n{0}|{1}|{2}\\n-----\\n{3}|{4}|{5}\\n-----\\n{6}|{7}|{8}\\n\"\n\t\treturn boardString.format(self.board[0], self.board[1], self.board[2], self.board[3],\n\t\t\tself.board[4], self.board[5], self.board[6], self.board[7], self.board[8])","def __str__(self):\n string = ''\n for row in self.board:\n for item in row:\n if item == None:\n string += \"_ \"\n else:\n string += f\"{item.name:<2}\"\n string += '\\n'\n \n return string","def __str__(self):\n board_lists = [['_']*self.__width for rows in range(self.__height)]\n for car in self.__cars:\n car_coords = car.car_coordinates()\n for item in car_coords:\n if item == (3,7):\n pass\n else:\n board_lists[item[0]][item[1]] = car.get_name()\n board_str = '\\n'.join(' '.join(sub) for sub in board_lists)\n return board_str","def convertBoard(self):\n \n board = \"\"\n \n for m in self.squares:\n board += str(convertMarker(m)) + \" \"\n \n return board","def __str__(self):\n board = ''\n for row in range(self.height):\n if row > 0:\n board += '\\n'\n for col in range(self.width):\n if self.board[row][col] == '':\n board += '| '\n else:\n board += ('|' + self.board[row][col])\n board += '|'\n board += ('\\n' + '-' * 2 * self.width + '\\n')\n for i in range(self.width):\n board += (' ' + str(i))\n return board","def __str__(self):\n\t\t\n\t\tdef mapping(x):\n\t\t\tif x == 1:\n\t\t\t\t# WHITE\n\t\t\t\treturn 'O'\n\t\t\telif x == -1:\n\t\t\t\t# BLACK\n\t\t\t\treturn 'X'\n\t\t\telse:\n\t\t\t\t# Empty\n\t\t\t\treturn '-'\n\t\t\n\t\ts = 'BLACK - X\\n'\n\t\ts += 'WHITE - O\\n\\n'\n\t\tfor j in self.rows:\n\t\t\ts += j\n\t\t\ts += ' '\n\t\t\ts += ''.join(mapping(self[i+j]) for i in self.columns)\n\t\t\ts += '\\n'\n\t\treturn s + '\\n ' + self.columns + '\\n'","def __repr__(self):\n W = self.width\n H = self.height\n\n s = '' # the string to return\n for row in range(0, H):\n s += '|'\n for col in range(0, W):\n s += self.data[row][col] + '|'\n s += '\\n'\n\n s += (2 * W + 1) * '-' # bottom of the board\n s += '\\n'\n\n x = -1\n for i in range(W):\n if x == 9:\n x = 0\n s += \" \" + str(x)\n else:\n x += 1\n s += \" \" + str(x)\n\n return s # the board is complete, return it","def __str__(self):\r\n return str(self.board)","def __str__(self) -> str:\n not_actual = self.current_board\n representation = self.current_board\n\n for index in range(len(not_actual)):\n if not_actual[index: index + 2] in ['31', '32', '33', '34', '36',\n '37', '38']:\n representation = representation.replace(\n not_actual[index: index + 2], '@')\n if not_actual[index: index + 2] in ['41', '42', '43', '44', '45',\n '46', '47', '48']:\n representation = representation.replace(\n not_actual[index: index + 2], '@')\n if not_actual[index: index + 2] in ['51', '52', '53', '54', '55',\n '56', '57', '58']:\n representation = representation.replace(\n not_actual[index: index + 2], '@')\n return representation","def __str__(self):\n board = \"\"\" 0 1 2 3 4 5\\n\"\"\"\n\n for y in range(Board.board_size):\n board += str(y) + \" \"\n for x in range(Board.board_size):\n piece = self.board[x][y] if self.board[x][y] is not None else \".\"\n\n piece = str(piece).lower() if piece in self.player_1_pieces else str(piece)\n\n board += piece\n board += \" \"\n board += \"\\n\"\n return board","def macro_str(self):\n str = '-' * (2 * self.SIZE + 1) + '\\n'\n for row in self.boards:\n str += ' '\n for board in row:\n str += board.state.value + ' '\n str += '\\n' + '-' * (2 * self.SIZE + 1) + '\\n'\n return str","def __repr__(self):\n\n # Creates a deep copy of _board and changes all None values to underscores.\n temp_board = copy.deepcopy(self.get_board())\n\n for row_index, row in enumerate(temp_board):\n\n for column_index, column in enumerate(row):\n\n if column is None:\n\n row[column_index] = '____' + self.reverse_position(column_index, row_index) + '_____'\n\n # str() with position is mapped onto each list within _board list,\n # converted to string, and then joined by a nextline character.\n return '\\n\\n'.join(map(str, temp_board))","def description(self) -> str:\r\n descrip = 'The player must aim to put the most possible units of a ' \\\r\n 'given colour c on the outer perimeter of ' \\\r\n 'the board. The ' \\\r\n 'player’s score is the total number of unit cells ' \\\r\n 'of colour ' \\\r\n 'c that are on the perimeter. There is a ' \\\r\n 'premium on corner ' \\\r\n 'cells: they count twice towards the score. '\r\n return descrip","def __str__(self) -> str:\n return self.board","def __str__(self):\n if self._active_player:\n def piece_to_index(piece):\n return (piece & 0xF)\n else:\n def piece_to_index(piece):\n return (piece & 0xE) | (0 if piece & 1 else 1)\n\n return '\\n'.join(map(\n lambda posY, row: ''.join(map(\n lambda posX, piece: self.EMOJI[\n piece_to_index(piece)\n if piece else\n 14 + ((posY + posX) % 2)],\n count(), row)),\n count(),\n self.board if self._active_player else reversed(\n [reversed(row) for row in self.board])))","def _to_string(board: Tuple[Tuple[Optional[int]]], width: int) -> str:\n display = \"\\n\"\n for i in range(width):\n for j in range(width):\n line = board[j][i * width:i * width + width]\n start = j * width ** 2 + i * width\n for k, space in enumerate(line):\n if space == 0:\n space = start + k\n else:\n space = (\"X\" if space == 1\n else \"O\" if space == -1\n else \"-\")\n display += \"{0:>4}\".format(space)\n display += \" \" * width\n display += \"\\n\"\n return display","def __str__(self):\n puzzle_string = '—' * 13 + '\\n'\n for i in range(self.PUZZLE_NUM_ROWS):\n for j in range(self.PUZZLE_NUM_COLUMNS):\n puzzle_string += '│{0: >2}'.format(str(self.position[i][j]))\n if j == self.PUZZLE_NUM_COLUMNS - 1:\n puzzle_string += '│\\n'\n\n puzzle_string += '—' * 13 + '\\n'\n return puzzle_string","def __str__(self):\r\n result = \"\"\r\n for line in self.board:\r\n for i in line:\r\n if i is None:\r\n result += \" \"\r\n else:\r\n result += i + \" \"\r\n result += \"\\n\"\r\n\r\n return result","def __str__(self):\r\n \r\n #return \"The 2048 board is \" + str(self._cells)\r\n string = \"\"\r\n for row in range(self._grid_height):\r\n for column in range(self._grid_width):\r\n if column == self._grid_width -1:\r\n string += str(self._cells[row][column]) + \"\\n\"\r\n else:\r\n string += str(self._cells[row][column]) +\", \"\r\n return \"The 2048 board is \"+ str(self._grid_height) + \"x\" + str(self._grid_width) + \" and contains: \" + \"\\n\" + string","def board_to_string(board):\n ordered_vals = []\n for r in ROW:\n for c in COL:\n ordered_vals.append(str(board[r + c]))\n return ''.join(ordered_vals)","def board_to_string(board):\n ordered_vals = []\n for r in ROW:\n for c in COL:\n ordered_vals.append(str(board[r + c]))\n return ''.join(ordered_vals)","def __str__(self):\n return f\"{self._desc:16s}\"","def __str__(self):\n return '\\n'.join(str(self._board[j]) for j in range(self._n))","def humanize(self, well_ref):\n row, col = self.decompose(well_ref)\n return \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"[row] + str(col + 1)","def boardToString(self, margins={}):\n b = self.board\n rg = range(b.size())\n left = ' '*margins.get('left', 0)\n s = '\\n'.join(\n [left + ' '.join([self.getCellStr(x, y) for x in rg]) for y in rg])\n return s","def __repr__(self):\n t = ''\n for x in range(len(self.board)):\n for y in range(len(self.board[0])):\n t += str(self.board[x][y]) + ' '\n t += '\\n'\n return t","def __str__(self):\n\t\tstring = \"\"\n\t\tfor i in self.board:\n\t\t\tfor j in i:\n\t\t\t\tstring += str(j)\n\t\t\tstring += \"\\n\"\n\t\treturn string","def __str__(self):\n board = ''\n board_2 = ''\n\n for row in self.from_grid:\n for space in row:\n board += ' ' + space\n board += '\\n'\n\n for row in self.to_grid:\n for space in row:\n board_2 += ' ' + space\n board_2 += '\\n'\n\n return 'Current State:\\n' + board + 'Target State:\\n' + board_2","def __str__(self):\n result = \"\"\n for i in range(3):\n for j in range(3):\n if self.board[i][j] == 5:\n result += \" x\"\n elif self.board[i][j] == 7:\n result += \" о\"\n else:\n result += \" #\"\n result += \"\\n\"\n return result","def __str__(self):\n return str(self.description)[:10]","def __repr__(self):\n return f'Board({ self.board !r})'","def __repr__(self):\n s = dashes = \"\".join([ ' -' for i in range(self.BoardSize) ])\n for row in range( self.BoardSize ):\n sRow = '|'\n for col in range( self.BoardSize ):\n sRow += str(self.CurrentGameboard[row][col]) + '|'\n s += '\\n' + sRow + '\\n' + dashes\n return s","def __repr__(self) -> str:\n\t\t\n\t\trepr = \"\"\n\t\tfor row in self.board:\n\t\t\tfor element in row:\n\t\t\t\tif element:\n\t\t\t\t\trepr = repr + \"o \"\n\t\t\t\telse:\n\t\t\t\t\trepr = repr + \"@ \"\n\t\t\trepr = repr + \"\\n\"\n\t\treturn repr","def __str__(self):\n s = \" 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\\n\"\n board = initial_board()\n count = 1\n for i in self.occupied:\n board[i[0]][i[1]] = self.occupied[i]\n space = ''\n for i in range(0, 16):\n space += ' '\n start = '---'.join(space)\n s += start+'\\n|'\n for row in range(1,16):\n for col in range(1,16):\n if use_color and (row, col) == self.action:\n s += '\\033[91m'\n if board[row][col] == 0:\n s += ' |'\n elif board[row][col] == 1:\n s += ' O |'\n else:\n s += ' X |'\n if use_color and (row, col) == self.action:\n s += '\\033[0m'\n s += '\\033[0m'\n s+=str(count)+'\\n'+start+'\\n|'\n count += 1\n\n s = s[:len(s)-1]\n s += \"\\n*****************************************************************************\"\n return s[:len(s)-1]","def get_description(self):\n return \"-\".join(\n map(str, (self.release, self.chromosome, self.start, self.reference, self.alternative))\n )","def _cards_to_string(self, cards):\n return repr(self._eval.card2string(map(lambda x: x & 63, cards)))\\\n #.lower().replace(\"h\", u\"\\u2761\").replace(\"s\", u\"\\u2660\").replace(\"c\", u\"\\u2663\").replace(\"d\", u\"\\u2662\")","def get_description(self, code):\n try:\n return self.message[str(code)]\n except KeyError:\n return \"Unknown (\" + str(code) + \")\"","def __str__(self):\n #formatting board correctly\n formatted_board = \"\"\n for i in range(self.size):\n formatted_board += str(self.board[i]) + \"\\n\"\n return \"Board size: \" + str(self.size) + \"\\n\" + \"Number of Queens placed: \" + str(self.num_queens_placed) + \"\\n\" + str(formatted_board)","def transferBoardToString(self,board):\n #int(False) will be 0\n outputString = str()\n for i in board:\n outputString = outputString + str(int(i))\n return outputString","def __str__(self):\r\n\t\toutStr = \"\"\r\n\t\toutStr += \"Heuristic Level: \" + str(self.heuristic)\r\n\t\toutStr += \"\\n-\" + \"-----\"*self.n\r\n\t\tfor row in self.board:\r\n\t\t\ttempStr = (\"\\n|\" + \" %2d |\" * self.n)\r\n\t\t\toutStr += tempStr % tuple(row)\r\n\t\t\toutStr += \"\\n-\" + \"-----\"*self.n\r\n\r\n\t\treturn outStr","def displayBoard(self):\n res = ''\n for i in range(0, self.size):\n res += '|'\n for j in range(0, self.size):\n res += ' ' + str(self.board[i][j])\n res += '\\n'\n res += '+'\n for i in range(0, self.size * 2):\n res += '-'\n res += '\\n '\n for i in range(1, (self.size + 1)):\n res += (' ' + str(i))\n return res","def __repr__(self):\n r = \"\"\n for row in self.board:\n for cell in row:\n if cell == \"\":\n cell = color_magenta(\"_\")\n r += cell + \" \" # for all the empty strings, we will replace it with an '_'.\n r += \"\\n\"\n return r","def __str__(self):\n if len(self.label) > 0:\n descr = [\"'%s', target='%s' [%s]\" % (self.label, self.target.name, self.target.body_type)]\n else:\n descr = [\"target='%s' [%s]\" % (self.target.name, self.target.body_type)]\n if self.baseline:\n descr[0] += ', initial baseline offset=%f' % (self.baseline.poly[-1],)\n if self.beam:\n descr[0] += ', beam height=%f' % (self.beam.height,)\n for scan_ind, scan in enumerate(self.scans):\n descr.append('%4d: %s' % (scan_ind, str(scan)))\n return '\\n'.join(descr)","def board(self) -> str:\n divider = \"+\" + \"-\" * 23 + \"+\"\n b = [divider]\n for i in range(9):\n r = []\n for j in range(3):\n s = tool.index_counter(i, j * 3)\n r.append(' '.join(str(i) if i > 0 else ' '\n for i in self.grid[s:s+3]))\n b.append(f\"| {r[0]} | {r[1]} | {r[2]} |\")\n if (i + 1) % 3 == 0:\n b.append(divider)\n return \"\\n\".join(b)","def describe_to(self, description) -> str:\n return self.matcher.describe_to(description)","def _board_detail(self, i, j, player=None):\n if self.board[i][j] is not None:\n return self.board[i][j]\n else:\n return ' '","def __str__(self):\n return \"Description(values={},data_model={})\".format(\n self._values, self.data_model\n )","def __str__(self):\n # replace with your code\n board = \"\"\n for index in range(self.grid_height):\n board += \"[\"\n for inner_index in range(self.grid_width):\n board += str(self.board[index][inner_index]) + \" \"\n else:\n board += \"]\\n\"\n return board","def __unicode__(self):\n matrix_ = self._repr_matrix(self.matrix[:20, :5])\n lines = matrix_.split('\\n')\n headers = [repr(self)[1:-1]]\n if self._item_ids.size:\n col_headers = [('%-8s' % unicode(item)[:8]) for item in self._item_ids[:5]]\n headers.append(' ' + (' '.join(col_headers)))\n\n if self._user_ids.size:\n for (i, line) in enumerate(lines):\n lines[i] = ('%-8s' % unicode(self._user_ids[i])[:8]) + line\n for (i, line) in enumerate(headers):\n if i > 0:\n headers[i] = ' ' * 8 + line\n lines = headers + lines\n if self.matrix.shape[1] > 5 and self.matrix.shape[0] > 0:\n lines[1] += ' ...'\n if self.matrix.shape[0] > 20:\n lines.append('...')\n\n return '\\n'.join(line.rstrip() for line in lines)","def __str__(self):\n \n # top row\n result = ' '\n result = '\\n ' + '-' * (self.DIM*2+5) + '\\n'\n \n # board rows\n for row in range(self.DIM):\n if row is 3 or row is 6:\n result += '|' + '-' * (self.DIM*2+5) + '|' + '\\n'\n # result += '|-------+-------+-------|\\n'\n result += '| '\n for col in range(self.DIM):\n if col is 3 or col is 6:\n result += '| '\n if self.board[row][col] == SudokuConfig.EMPTY:\n result += '.'\n else:\n result += str(str(self.board[row][col]))\n if col != self.DIM-1:\n result += ' '\n result += ' |' + '\\n'\n \n # bottom row\n result += ' ' + '-' * (self.DIM*2+5) + '\\n'\n result += ' '\n result += '\\n'\n \n return result","def __str__(self):\n def align_column(grid):\n board = \"\"\n for i in range(self.n):\n board += str(grid[i]) + \"\\n\"\n return board.strip()\n return (\"===Current Stage===\\n\"\n \"{}\\n\"\n \"====Goal Board=====\\n\"\n \"{}\".format(align_column(self.from_grid),\n align_column(self.to_grid)))","def __getAsciiString(self):\n lines = []\n horizontalLine = ('-' * (26))\n lines.append(horizontalLine)\n for row in self.board:\n rowLine = '|'\n for col in row:\n if col == -1:\n col = 'O'\n if col == 0:\n col = '-'\n if col == 1:\n col = 'X'\n rowLine = rowLine + ' ' + col.__str__() + ' |'\n lines.append(rowLine)\n lines.append(horizontalLine)\n return '\\n'.join(lines)","def board2str(board, end='\\n'):\n s = ''\n for x in range(board.shape[0]):\n for y in range(board.shape[1]):\n s += str(board[x][y]) + '\\t'\n s += end\n return s[:-len(end)]","def description() -> str:\n content = \"Demonstrates usage of blackbord remappings.\\n\"\n content += \"\\n\"\n content += \"Demonstration is via an exemplar behaviour making use of remappings..\\n\"\n\n if py_trees.console.has_colours:\n banner_line = console.green + \"*\" * 79 + \"\\n\" + console.reset\n s = banner_line\n s += console.bold_white + \"Blackboard\".center(79) + \"\\n\" + console.reset\n s += banner_line\n s += \"\\n\"\n s += content\n s += \"\\n\"\n s += banner_line\n else:\n s = content\n return s","def __str__(self) -> str:\n return self.description","def get_board_name(self):\n return \"OPP {} Board {}\".format(str(self.led.neoCard.chain_serial), \"0x%02x\" % self.led.neoCard.addr)","def description():","def ToMessageDesc(description):\n message_desc = 'The text in the keyboard overlay to explain the shortcut'\n if description:\n message_desc = '%s (%s).' % (message_desc, description)\n else:\n message_desc += '.'\n return message_desc","def __str__(self):\n str = '-' * (self.SIZE ** 2 + self.SIZE + 1) + '\\n'\n for row in self.boards:\n for i in range(self.SIZE):\n str += '|'\n for board in row:\n for square in board.export_grid()[i]:\n str += square.value\n str += '|'\n str += '\\n'\n str += '-' * (self.SIZE ** 2 + self.SIZE + 1) + '\\n'\n return str","def __repr__(self):\r\n numLetters = self.numLetters\r\n S = ''\r\n S += 3*'\\n'\r\n S += ' '\r\n for i in range(numLetters):\r\n S += self.currentBoard[i] + ' '\r\n\r\n return S","def __str__(self):\n b = ''\n for i in range(7): # 7 steps in the board\n if i == self.chaser_i: # chaser position\n b += '|' + str(i) + '| chaser |\\n'\n elif i == self.player_i: # player position\n b += '|' + str(i) + '| player |\\n'\n else:\n b += '|' + str(i) + '| |\\n'\n b += '|7| bank |\\n' # bank position\n return b","def __repr__(self):\n\n return '<Board id={id} title={title}'.format(id=self.id,\n title=self.title,\n )","def descString(self):\n return \"\".join ([self.Name, \" (\", str(self.RollCount), \"d\"\\\n , str(self.RollMax), \"; \", str(self.CritRollMin), \"-\"\\\n , str(self.CritRollMax), \"x\", str (self.CritRollMult)\\\n , \") - \", str(self.Value), \" gp\"])","def desc(self):\n return LandCell.desc(self) + \"; plant=\" + str(self.plant)","def __str__(self):\n string = \"\"\n for row in self.layout:\n for tile in row:\n string+= str(tile) + \" \"\n string+= \"\\n\"\n return string","def __str__(self):\n return \"%s\\n\" % self.text + \" \" * self.col + \"^\"","def get_description(self):\n if CONFIG_KEY not in self:\n return\n if hasattr(self[CONFIG_KEY], DESC_KEY):\n desc_str = str(self[CONFIG_KEY][DESC_KEY])\n if not isinstance(desc_str, str):\n try:\n desc_str = str(desc_str)\n except Exception as e:\n raise InvalidConfigFileException(\n \"Could not convert the specified Project description \"\n \"({}) to string. Caught exception: {}\".\n format(desc_str, getattr(e, 'message', repr(e))))\n return desc_str","def description(self) -> str:\r\n descrip = 'The player must aim for the largest “blob” of a given ' \\\r\n 'colour c. A blob is a group of connected blocks with the ' \\\r\n 'same colour. Two blocks are connected if their sides ' \\\r\n 'touch; touching corners doesn’t count. The player’s score ' \\\r\n 'is the number of unit cells in the largest blob of colour ' \\\r\n 'c. '\r\n return descrip","def __str__(self):\n return self.get_ascii_trunk() + self.get_ascii_leaves()","def __str__(self):\n\n # Create grid headers for the table\n headers = [letter for letter in string.ascii_uppercase[:self.width]]\n\n board_state = []\n board_state.extend([[value for value in row] for i, row in enumerate(self.board_state)])\n\n for idx, row in enumerate(board_state):\n row.insert(0, idx + 1)\n\n return tabulate(board_state, headers, tablefmt=\"grid\")","def get_board_name(self):\n pass","def as_string(self):\n # Remove cards which have no definition\n cards = [card for card in self if card.definition is not None]\n # Remove cards which have no word\n cards = [card for card in cards if card.word]\n return \"\\n\".join([card.get_flashcard() for card in cards])","def __str__(self) -> str:\n return self._color + str(self._value) + SudokuTile.C_END","def __str__(self) -> str:\r\n output: str = \"\"\r\n\r\n for row_i in range(Board._NUM_ROWS):\r\n for col_i in range(Board._NUM_COLS):\r\n pos: Pos2D = Pos2D(col_i, row_i)\r\n output += (\"{} \".format(self.squares[pos].get_representation()))\r\n # Finished row, add new line.\r\n output += \"\\n\"\r\n\r\n return output","def __str__(self):\n line = ''\n line += self.board_state.__str__()\n line += self.move.__str__()\n line += '\\n'\n return line","def get_descr_full(self):\n desc_text = []\n stack = [(self._desc, 0)]\n while stack:\n dl, di = stack.pop()\n while di < len(dl):\n if dl[di] == 0:\n di += 1\n elif dl[di] > 0 and dl[di] < 100000:\n desc_text.append(str(self._tables.tab_b[dl[di]]))\n di += 1\n elif dl[di] >= 100000 and dl[di] < 200000:\n lm = dl[di] // 1000 - 100\n ln = dl[di] % 1000\n desc_text.append(\"%06d : LOOP, %d desc., %d times\" % (dl[di], lm , ln))\n di += 1\n elif dl[di] >= 200000 and dl[di] < 300000:\n en = self._tables.tab_c.get(dl[di])\n am = dl[di] // 1000 - 200\n an = dl[di] % 1000\n if en is None:\n en = (str(am), \"\")\n if dl[di] < 222000:\n desc_text.append(\"%06d : OPERATOR %s: %d\" % (dl[di], en[0], an))\n else:\n desc_text.append(\"%06d : OPERATOR '%s'\" % (dl[di], en[0]))\n di += 1\n elif dl[di] >= 300000 and dl[di] < 400000:\n stack.append((dl, di + 1))\n da = dl[di]\n dl = self._tables.tab_d[dl[di]]\n di = 0\n desc_text.append(\"%06d : SEQUENCE, %d desc.\" % (da, len(dl)))\n return desc_text","def __str__(self):\n return self.description","def __str__(self):\n return self.description","def Description(self) -> str:","def Description(self) -> str:","def __str__(self):\r\n # The full representative string\r\n str_matrix = \"\"\r\n\r\n if self.matrix is not None:\r\n # Save the lenght into a variable\r\n # to send this number to the tiles method\r\n # and calculate the number of spaces\r\n spaces = len(self.matrix)\r\n for i in range(0, spaces):\r\n nums = list(filter(lambda x: x != \"_\", self.matrix[i]))\r\n str_matrix += self.tiles(nums, (i+1), (spaces - i))\r\n\r\n return str_matrix","def __str__(self):\n value = str(self.puzzle) + str(\" \") + str(self.g) + str(\" \") + str(self.h)\n return value","def board_label(board):\n # 0 draw for side-to-move, 1 win for side-to-move (more than 50 moves), 2 win for side-to-move\n # -1 loss in more than 50, -2 loss in <50\n with chess.syzygy.open_tablebase(\"./\") as tablebase:\n # board = chess.Board(\"8/2K5/4B3/3N4/8/8/4k3/8 b - - 0 1\")\n wdl = tablebase.probe_wdl(board)\n\n # 0 draw, x win in x, -x loss in x\n # counts may be off by 1\n with chess.syzygy.open_tablebase(\"./\") as tablebase:\n # board = chess.Board(\"8/2K5/4B3/3N4/8/8/4k3/8 b - - 0 1\")\n dtz = tablebase.probe_dtz(board)\n if wdl == 0:\n win = 0\n draw = 1\n loss = 0\n elif wdl > 0:\n win = 1\n draw = 0\n loss = 0\n else:\n win = 0\n draw = 0\n loss = 1\n if dtz > 0:\n quality = 2000 - dtz\n elif dtz < 0:\n quality = -2000 - dtz\n else:\n quality = 0\n\n return win, draw, loss, quality","def __str__(self):\n\n desc = self.description\n if desc is not None:\n return str(desc)\n\n desc = self.debugDescription\n if desc is not None:\n return str(desc)\n\n return repr(self)","def get_cards_as_string(self):\n return '' \\\n ' {}\\n' \\\n ' {}\\n' \\\n ' {}\\n' \\\n ' {}\\n' \\\n ' {}\\n'.format(*self.get_cards_high_to_low())","def state_to_string(board_state):\n return str(board_state)","def board_string(self, players):\n if len(self.user_guess) == 1:\n board = \"\\n-------------------\\n\"\n board += f\"Player {players[0]}: {self.user_guess[0]}, {self.applied_guess[0]}\\n\"\n board += f\"Player {players[1]}: {self.user_guess[0]}, {self.applied_guess[0]}\\n\"\n board += \"-------------------\\n\"\n\n board = \"\\n-------------------\\n\"\n board += f\"Player {players[0].get_name()}: {self.user_guess[0]}, {self.applied_guess[0]}\\n\"\n board += f\"Player {players[1].get_name()}: {self.user_guess[1]}, {self.applied_guess[1]}\\n\"\n board += \"-------------------\\n\"\n\n return board","def __str__(self):\n if self.__description:\n return self.__description\n return repr(self)","def get_board_as_string(game):\n str_board = \"\\n\" # every board starts with a blank line\n row = 0 # used to print the board\n\n # creates a board of 5 lines. 3 rows, 2 dashed.\n for line in range(1, 6):\n\n # every odd line\n if line % 2 != 0:\n\n # add a row to the string str_board\n str_board += \"{} | {} | {}\".format(game['board'][row][0], game['board'][row][1], game['board'][row][2])\n\n # increment the row\n row += 1\n\n # every even line\n else:\n str_board += \"--------------\"\n\n str_board += \"\\n\" # add line break at the end of every line\n\n return str_board","def description(self):\n active = np.nonzero([bool(p) for p in self])[0]\n last_active = active[-1] if len(active) else -1\n return ' '.join([p.value_str for p in self][:last_active + 1])","def __str__(self):\n return (\">%s\\n\" % self.name) + \\\n wrap(self.sequence, self.COLUMNS)","def __str__(self):\r\n # replace with your code\r\n return str(self._board[0]) + \"\\n\" + str(self._board[1]) + \"\\n\" + str(self._board[2]) + \"\\n\" + str(self._board[3]) + \"\\n\\n\"","def __str__(self):\n card_str = ['-' * CARD_WIDTH]\n card_str.append('{} (Game {})'.format(self.name, self.game.number).center(CARD_WIDTH))\n card_str.append('-' * CARD_WIDTH)\n card_str.append(''.center(CARD_WIDTH))\n card_str.append('Money: {}'.format(self.money).center(CARD_WIDTH))\n card_str.append('Turnover: {}'.format(self.turnover).center(CARD_WIDTH))\n card_str.append(''.center(CARD_WIDTH))\n card_str.append('-' * CARD_WIDTH)\n return '\\n'.join('|{}|'.format(l) for l in card_str)","def descString(self):\n return \"\".join ([self.Name, \" (AR \", str(self.AR), \", Max DEX \"\\\n , str(self.MaxDEXMod), \") - \", str(self.Value), \" gp\"])","def getDescription(self):\n if(self.isInit == True):\n STR=\"Map source : \"+self.source+\"\\n\"\n STR += str(self.rowsNumber) + \" rows, \"+str(self.columnsNumber)+\" columns, router range radius is \"+str(self.routerRangeRadius)+\"\\n\"\n STR +=\"backbone costs \"+str(self.backBoneCosts)+\", router costs \"+str(self.routerCosts)+\", buget is \"+str(self.budget)+\"\\n\"\n STR +=\"the initial cell connected to backbone is [\"+str(self.firstCell.row)+\",\"+str(self.firstCell.column)+\"]\"\n return STR\n else:\n return \"MAP NOT INITIALISED\"","def __str__(self):\n data_string = \"\"\n for i in range(self.height):\n row = \"\"\n for j in range(self.width):\n row += \"|\" + self.data[i][j]\n row += \"|\\n\"\n data_string += row\n data_string += \"-\" * (2 * self.width + 1)\n data_string += \"\\n\"\n\n # Column numbers are labeled modulo 10 to keep the characters\n # aligned correctly\n for i in range(self.width):\n data_string += \" \" + str(i % 10)\n\n return data_string","def print_board(self):\n board = \"\"\n for i in range(3):#need to change this in the future\n for j in range(3):#need to change this in the future\n board += self.board[i][j]\n if j != 2:#need to change this in the future\n board += \" | \"\n board += \"\\n\"\n return board"],"string":"[\n \"def StringFromBoard(board):\\n\\trows = []\\n\\tfor row in board:\\n\\t\\trows.append('|'.join([' '+square+' ' for square in row]))\\n\\treturn '\\\\n-----------\\\\n'.join(rows)\",\n \"def __str__(self):\\n rep = \\\"\\\"\\n for row in range(self._dim):\\n for col in range(self._dim):\\n rep += STRMAP[self._board[row][col]]\\n if col == self._dim - 1:\\n rep += \\\"\\\\n\\\"\\n else:\\n rep += \\\" | \\\"\\n if row != self._dim - 1:\\n rep += \\\"-\\\" * (4 * self._dim - 3)\\n rep += \\\"\\\\n\\\"\\n return rep\",\n \"def uninterpret_board(self):\\n\\t\\tboard_string = ''\\n\\t\\tfor i in range(len(self.board)):\\n\\t\\t\\tfor j in range(len(self.board[i])):\\n\\t\\t\\t\\tboard_string+=self.board[i][j]\\n\\n\\t\\treturn board_string\",\n \"def board_string(self):\\n s = \\\"\\\"\\n for i, v in enumerate(self.board):\\n # if i % 81 == 0:\\n # s += \\\"\\\\n\\\"\\n if v is None:\\n s += \\\"0\\\"\\n else:\\n if v.color == StoneColor.black:\\n s += \\\"1\\\"\\n else:\\n s += \\\"2\\\"\\n return s\",\n \"def __str__(self):\\n\\t\\tboardString = \\\"\\\\n{0}|{1}|{2}\\\\n-----\\\\n{3}|{4}|{5}\\\\n-----\\\\n{6}|{7}|{8}\\\\n\\\"\\n\\t\\treturn boardString.format(self.board[0], self.board[1], self.board[2], self.board[3],\\n\\t\\t\\tself.board[4], self.board[5], self.board[6], self.board[7], self.board[8])\",\n \"def __str__(self):\\n string = ''\\n for row in self.board:\\n for item in row:\\n if item == None:\\n string += \\\"_ \\\"\\n else:\\n string += f\\\"{item.name:<2}\\\"\\n string += '\\\\n'\\n \\n return string\",\n \"def __str__(self):\\n board_lists = [['_']*self.__width for rows in range(self.__height)]\\n for car in self.__cars:\\n car_coords = car.car_coordinates()\\n for item in car_coords:\\n if item == (3,7):\\n pass\\n else:\\n board_lists[item[0]][item[1]] = car.get_name()\\n board_str = '\\\\n'.join(' '.join(sub) for sub in board_lists)\\n return board_str\",\n \"def convertBoard(self):\\n \\n board = \\\"\\\"\\n \\n for m in self.squares:\\n board += str(convertMarker(m)) + \\\" \\\"\\n \\n return board\",\n \"def __str__(self):\\n board = ''\\n for row in range(self.height):\\n if row > 0:\\n board += '\\\\n'\\n for col in range(self.width):\\n if self.board[row][col] == '':\\n board += '| '\\n else:\\n board += ('|' + self.board[row][col])\\n board += '|'\\n board += ('\\\\n' + '-' * 2 * self.width + '\\\\n')\\n for i in range(self.width):\\n board += (' ' + str(i))\\n return board\",\n \"def __str__(self):\\n\\t\\t\\n\\t\\tdef mapping(x):\\n\\t\\t\\tif x == 1:\\n\\t\\t\\t\\t# WHITE\\n\\t\\t\\t\\treturn 'O'\\n\\t\\t\\telif x == -1:\\n\\t\\t\\t\\t# BLACK\\n\\t\\t\\t\\treturn 'X'\\n\\t\\t\\telse:\\n\\t\\t\\t\\t# Empty\\n\\t\\t\\t\\treturn '-'\\n\\t\\t\\n\\t\\ts = 'BLACK - X\\\\n'\\n\\t\\ts += 'WHITE - O\\\\n\\\\n'\\n\\t\\tfor j in self.rows:\\n\\t\\t\\ts += j\\n\\t\\t\\ts += ' '\\n\\t\\t\\ts += ''.join(mapping(self[i+j]) for i in self.columns)\\n\\t\\t\\ts += '\\\\n'\\n\\t\\treturn s + '\\\\n ' + self.columns + '\\\\n'\",\n \"def __repr__(self):\\n W = self.width\\n H = self.height\\n\\n s = '' # the string to return\\n for row in range(0, H):\\n s += '|'\\n for col in range(0, W):\\n s += self.data[row][col] + '|'\\n s += '\\\\n'\\n\\n s += (2 * W + 1) * '-' # bottom of the board\\n s += '\\\\n'\\n\\n x = -1\\n for i in range(W):\\n if x == 9:\\n x = 0\\n s += \\\" \\\" + str(x)\\n else:\\n x += 1\\n s += \\\" \\\" + str(x)\\n\\n return s # the board is complete, return it\",\n \"def __str__(self):\\r\\n return str(self.board)\",\n \"def __str__(self) -> str:\\n not_actual = self.current_board\\n representation = self.current_board\\n\\n for index in range(len(not_actual)):\\n if not_actual[index: index + 2] in ['31', '32', '33', '34', '36',\\n '37', '38']:\\n representation = representation.replace(\\n not_actual[index: index + 2], '@')\\n if not_actual[index: index + 2] in ['41', '42', '43', '44', '45',\\n '46', '47', '48']:\\n representation = representation.replace(\\n not_actual[index: index + 2], '@')\\n if not_actual[index: index + 2] in ['51', '52', '53', '54', '55',\\n '56', '57', '58']:\\n representation = representation.replace(\\n not_actual[index: index + 2], '@')\\n return representation\",\n \"def __str__(self):\\n board = \\\"\\\"\\\" 0 1 2 3 4 5\\\\n\\\"\\\"\\\"\\n\\n for y in range(Board.board_size):\\n board += str(y) + \\\" \\\"\\n for x in range(Board.board_size):\\n piece = self.board[x][y] if self.board[x][y] is not None else \\\".\\\"\\n\\n piece = str(piece).lower() if piece in self.player_1_pieces else str(piece)\\n\\n board += piece\\n board += \\\" \\\"\\n board += \\\"\\\\n\\\"\\n return board\",\n \"def macro_str(self):\\n str = '-' * (2 * self.SIZE + 1) + '\\\\n'\\n for row in self.boards:\\n str += ' '\\n for board in row:\\n str += board.state.value + ' '\\n str += '\\\\n' + '-' * (2 * self.SIZE + 1) + '\\\\n'\\n return str\",\n \"def __repr__(self):\\n\\n # Creates a deep copy of _board and changes all None values to underscores.\\n temp_board = copy.deepcopy(self.get_board())\\n\\n for row_index, row in enumerate(temp_board):\\n\\n for column_index, column in enumerate(row):\\n\\n if column is None:\\n\\n row[column_index] = '____' + self.reverse_position(column_index, row_index) + '_____'\\n\\n # str() with position is mapped onto each list within _board list,\\n # converted to string, and then joined by a nextline character.\\n return '\\\\n\\\\n'.join(map(str, temp_board))\",\n \"def description(self) -> str:\\r\\n descrip = 'The player must aim to put the most possible units of a ' \\\\\\r\\n 'given colour c on the outer perimeter of ' \\\\\\r\\n 'the board. The ' \\\\\\r\\n 'player’s score is the total number of unit cells ' \\\\\\r\\n 'of colour ' \\\\\\r\\n 'c that are on the perimeter. There is a ' \\\\\\r\\n 'premium on corner ' \\\\\\r\\n 'cells: they count twice towards the score. '\\r\\n return descrip\",\n \"def __str__(self) -> str:\\n return self.board\",\n \"def __str__(self):\\n if self._active_player:\\n def piece_to_index(piece):\\n return (piece & 0xF)\\n else:\\n def piece_to_index(piece):\\n return (piece & 0xE) | (0 if piece & 1 else 1)\\n\\n return '\\\\n'.join(map(\\n lambda posY, row: ''.join(map(\\n lambda posX, piece: self.EMOJI[\\n piece_to_index(piece)\\n if piece else\\n 14 + ((posY + posX) % 2)],\\n count(), row)),\\n count(),\\n self.board if self._active_player else reversed(\\n [reversed(row) for row in self.board])))\",\n \"def _to_string(board: Tuple[Tuple[Optional[int]]], width: int) -> str:\\n display = \\\"\\\\n\\\"\\n for i in range(width):\\n for j in range(width):\\n line = board[j][i * width:i * width + width]\\n start = j * width ** 2 + i * width\\n for k, space in enumerate(line):\\n if space == 0:\\n space = start + k\\n else:\\n space = (\\\"X\\\" if space == 1\\n else \\\"O\\\" if space == -1\\n else \\\"-\\\")\\n display += \\\"{0:>4}\\\".format(space)\\n display += \\\" \\\" * width\\n display += \\\"\\\\n\\\"\\n return display\",\n \"def __str__(self):\\n puzzle_string = '—' * 13 + '\\\\n'\\n for i in range(self.PUZZLE_NUM_ROWS):\\n for j in range(self.PUZZLE_NUM_COLUMNS):\\n puzzle_string += '│{0: >2}'.format(str(self.position[i][j]))\\n if j == self.PUZZLE_NUM_COLUMNS - 1:\\n puzzle_string += '│\\\\n'\\n\\n puzzle_string += '—' * 13 + '\\\\n'\\n return puzzle_string\",\n \"def __str__(self):\\r\\n result = \\\"\\\"\\r\\n for line in self.board:\\r\\n for i in line:\\r\\n if i is None:\\r\\n result += \\\" \\\"\\r\\n else:\\r\\n result += i + \\\" \\\"\\r\\n result += \\\"\\\\n\\\"\\r\\n\\r\\n return result\",\n \"def __str__(self):\\r\\n \\r\\n #return \\\"The 2048 board is \\\" + str(self._cells)\\r\\n string = \\\"\\\"\\r\\n for row in range(self._grid_height):\\r\\n for column in range(self._grid_width):\\r\\n if column == self._grid_width -1:\\r\\n string += str(self._cells[row][column]) + \\\"\\\\n\\\"\\r\\n else:\\r\\n string += str(self._cells[row][column]) +\\\", \\\"\\r\\n return \\\"The 2048 board is \\\"+ str(self._grid_height) + \\\"x\\\" + str(self._grid_width) + \\\" and contains: \\\" + \\\"\\\\n\\\" + string\",\n \"def board_to_string(board):\\n ordered_vals = []\\n for r in ROW:\\n for c in COL:\\n ordered_vals.append(str(board[r + c]))\\n return ''.join(ordered_vals)\",\n \"def board_to_string(board):\\n ordered_vals = []\\n for r in ROW:\\n for c in COL:\\n ordered_vals.append(str(board[r + c]))\\n return ''.join(ordered_vals)\",\n \"def __str__(self):\\n return f\\\"{self._desc:16s}\\\"\",\n \"def __str__(self):\\n return '\\\\n'.join(str(self._board[j]) for j in range(self._n))\",\n \"def humanize(self, well_ref):\\n row, col = self.decompose(well_ref)\\n return \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"[row] + str(col + 1)\",\n \"def boardToString(self, margins={}):\\n b = self.board\\n rg = range(b.size())\\n left = ' '*margins.get('left', 0)\\n s = '\\\\n'.join(\\n [left + ' '.join([self.getCellStr(x, y) for x in rg]) for y in rg])\\n return s\",\n \"def __repr__(self):\\n t = ''\\n for x in range(len(self.board)):\\n for y in range(len(self.board[0])):\\n t += str(self.board[x][y]) + ' '\\n t += '\\\\n'\\n return t\",\n \"def __str__(self):\\n\\t\\tstring = \\\"\\\"\\n\\t\\tfor i in self.board:\\n\\t\\t\\tfor j in i:\\n\\t\\t\\t\\tstring += str(j)\\n\\t\\t\\tstring += \\\"\\\\n\\\"\\n\\t\\treturn string\",\n \"def __str__(self):\\n board = ''\\n board_2 = ''\\n\\n for row in self.from_grid:\\n for space in row:\\n board += ' ' + space\\n board += '\\\\n'\\n\\n for row in self.to_grid:\\n for space in row:\\n board_2 += ' ' + space\\n board_2 += '\\\\n'\\n\\n return 'Current State:\\\\n' + board + 'Target State:\\\\n' + board_2\",\n \"def __str__(self):\\n result = \\\"\\\"\\n for i in range(3):\\n for j in range(3):\\n if self.board[i][j] == 5:\\n result += \\\" x\\\"\\n elif self.board[i][j] == 7:\\n result += \\\" о\\\"\\n else:\\n result += \\\" #\\\"\\n result += \\\"\\\\n\\\"\\n return result\",\n \"def __str__(self):\\n return str(self.description)[:10]\",\n \"def __repr__(self):\\n return f'Board({ self.board !r})'\",\n \"def __repr__(self):\\n s = dashes = \\\"\\\".join([ ' -' for i in range(self.BoardSize) ])\\n for row in range( self.BoardSize ):\\n sRow = '|'\\n for col in range( self.BoardSize ):\\n sRow += str(self.CurrentGameboard[row][col]) + '|'\\n s += '\\\\n' + sRow + '\\\\n' + dashes\\n return s\",\n \"def __repr__(self) -> str:\\n\\t\\t\\n\\t\\trepr = \\\"\\\"\\n\\t\\tfor row in self.board:\\n\\t\\t\\tfor element in row:\\n\\t\\t\\t\\tif element:\\n\\t\\t\\t\\t\\trepr = repr + \\\"o \\\"\\n\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\trepr = repr + \\\"@ \\\"\\n\\t\\t\\trepr = repr + \\\"\\\\n\\\"\\n\\t\\treturn repr\",\n \"def __str__(self):\\n s = \\\" 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\\\\n\\\"\\n board = initial_board()\\n count = 1\\n for i in self.occupied:\\n board[i[0]][i[1]] = self.occupied[i]\\n space = ''\\n for i in range(0, 16):\\n space += ' '\\n start = '---'.join(space)\\n s += start+'\\\\n|'\\n for row in range(1,16):\\n for col in range(1,16):\\n if use_color and (row, col) == self.action:\\n s += '\\\\033[91m'\\n if board[row][col] == 0:\\n s += ' |'\\n elif board[row][col] == 1:\\n s += ' O |'\\n else:\\n s += ' X |'\\n if use_color and (row, col) == self.action:\\n s += '\\\\033[0m'\\n s += '\\\\033[0m'\\n s+=str(count)+'\\\\n'+start+'\\\\n|'\\n count += 1\\n\\n s = s[:len(s)-1]\\n s += \\\"\\\\n*****************************************************************************\\\"\\n return s[:len(s)-1]\",\n \"def get_description(self):\\n return \\\"-\\\".join(\\n map(str, (self.release, self.chromosome, self.start, self.reference, self.alternative))\\n )\",\n \"def _cards_to_string(self, cards):\\n return repr(self._eval.card2string(map(lambda x: x & 63, cards)))\\\\\\n #.lower().replace(\\\"h\\\", u\\\"\\\\u2761\\\").replace(\\\"s\\\", u\\\"\\\\u2660\\\").replace(\\\"c\\\", u\\\"\\\\u2663\\\").replace(\\\"d\\\", u\\\"\\\\u2662\\\")\",\n \"def get_description(self, code):\\n try:\\n return self.message[str(code)]\\n except KeyError:\\n return \\\"Unknown (\\\" + str(code) + \\\")\\\"\",\n \"def __str__(self):\\n #formatting board correctly\\n formatted_board = \\\"\\\"\\n for i in range(self.size):\\n formatted_board += str(self.board[i]) + \\\"\\\\n\\\"\\n return \\\"Board size: \\\" + str(self.size) + \\\"\\\\n\\\" + \\\"Number of Queens placed: \\\" + str(self.num_queens_placed) + \\\"\\\\n\\\" + str(formatted_board)\",\n \"def transferBoardToString(self,board):\\n #int(False) will be 0\\n outputString = str()\\n for i in board:\\n outputString = outputString + str(int(i))\\n return outputString\",\n \"def __str__(self):\\r\\n\\t\\toutStr = \\\"\\\"\\r\\n\\t\\toutStr += \\\"Heuristic Level: \\\" + str(self.heuristic)\\r\\n\\t\\toutStr += \\\"\\\\n-\\\" + \\\"-----\\\"*self.n\\r\\n\\t\\tfor row in self.board:\\r\\n\\t\\t\\ttempStr = (\\\"\\\\n|\\\" + \\\" %2d |\\\" * self.n)\\r\\n\\t\\t\\toutStr += tempStr % tuple(row)\\r\\n\\t\\t\\toutStr += \\\"\\\\n-\\\" + \\\"-----\\\"*self.n\\r\\n\\r\\n\\t\\treturn outStr\",\n \"def displayBoard(self):\\n res = ''\\n for i in range(0, self.size):\\n res += '|'\\n for j in range(0, self.size):\\n res += ' ' + str(self.board[i][j])\\n res += '\\\\n'\\n res += '+'\\n for i in range(0, self.size * 2):\\n res += '-'\\n res += '\\\\n '\\n for i in range(1, (self.size + 1)):\\n res += (' ' + str(i))\\n return res\",\n \"def __repr__(self):\\n r = \\\"\\\"\\n for row in self.board:\\n for cell in row:\\n if cell == \\\"\\\":\\n cell = color_magenta(\\\"_\\\")\\n r += cell + \\\" \\\" # for all the empty strings, we will replace it with an '_'.\\n r += \\\"\\\\n\\\"\\n return r\",\n \"def __str__(self):\\n if len(self.label) > 0:\\n descr = [\\\"'%s', target='%s' [%s]\\\" % (self.label, self.target.name, self.target.body_type)]\\n else:\\n descr = [\\\"target='%s' [%s]\\\" % (self.target.name, self.target.body_type)]\\n if self.baseline:\\n descr[0] += ', initial baseline offset=%f' % (self.baseline.poly[-1],)\\n if self.beam:\\n descr[0] += ', beam height=%f' % (self.beam.height,)\\n for scan_ind, scan in enumerate(self.scans):\\n descr.append('%4d: %s' % (scan_ind, str(scan)))\\n return '\\\\n'.join(descr)\",\n \"def board(self) -> str:\\n divider = \\\"+\\\" + \\\"-\\\" * 23 + \\\"+\\\"\\n b = [divider]\\n for i in range(9):\\n r = []\\n for j in range(3):\\n s = tool.index_counter(i, j * 3)\\n r.append(' '.join(str(i) if i > 0 else ' '\\n for i in self.grid[s:s+3]))\\n b.append(f\\\"| {r[0]} | {r[1]} | {r[2]} |\\\")\\n if (i + 1) % 3 == 0:\\n b.append(divider)\\n return \\\"\\\\n\\\".join(b)\",\n \"def describe_to(self, description) -> str:\\n return self.matcher.describe_to(description)\",\n \"def _board_detail(self, i, j, player=None):\\n if self.board[i][j] is not None:\\n return self.board[i][j]\\n else:\\n return ' '\",\n \"def __str__(self):\\n return \\\"Description(values={},data_model={})\\\".format(\\n self._values, self.data_model\\n )\",\n \"def __str__(self):\\n # replace with your code\\n board = \\\"\\\"\\n for index in range(self.grid_height):\\n board += \\\"[\\\"\\n for inner_index in range(self.grid_width):\\n board += str(self.board[index][inner_index]) + \\\" \\\"\\n else:\\n board += \\\"]\\\\n\\\"\\n return board\",\n \"def __unicode__(self):\\n matrix_ = self._repr_matrix(self.matrix[:20, :5])\\n lines = matrix_.split('\\\\n')\\n headers = [repr(self)[1:-1]]\\n if self._item_ids.size:\\n col_headers = [('%-8s' % unicode(item)[:8]) for item in self._item_ids[:5]]\\n headers.append(' ' + (' '.join(col_headers)))\\n\\n if self._user_ids.size:\\n for (i, line) in enumerate(lines):\\n lines[i] = ('%-8s' % unicode(self._user_ids[i])[:8]) + line\\n for (i, line) in enumerate(headers):\\n if i > 0:\\n headers[i] = ' ' * 8 + line\\n lines = headers + lines\\n if self.matrix.shape[1] > 5 and self.matrix.shape[0] > 0:\\n lines[1] += ' ...'\\n if self.matrix.shape[0] > 20:\\n lines.append('...')\\n\\n return '\\\\n'.join(line.rstrip() for line in lines)\",\n \"def __str__(self):\\n \\n # top row\\n result = ' '\\n result = '\\\\n ' + '-' * (self.DIM*2+5) + '\\\\n'\\n \\n # board rows\\n for row in range(self.DIM):\\n if row is 3 or row is 6:\\n result += '|' + '-' * (self.DIM*2+5) + '|' + '\\\\n'\\n # result += '|-------+-------+-------|\\\\n'\\n result += '| '\\n for col in range(self.DIM):\\n if col is 3 or col is 6:\\n result += '| '\\n if self.board[row][col] == SudokuConfig.EMPTY:\\n result += '.'\\n else:\\n result += str(str(self.board[row][col]))\\n if col != self.DIM-1:\\n result += ' '\\n result += ' |' + '\\\\n'\\n \\n # bottom row\\n result += ' ' + '-' * (self.DIM*2+5) + '\\\\n'\\n result += ' '\\n result += '\\\\n'\\n \\n return result\",\n \"def __str__(self):\\n def align_column(grid):\\n board = \\\"\\\"\\n for i in range(self.n):\\n board += str(grid[i]) + \\\"\\\\n\\\"\\n return board.strip()\\n return (\\\"===Current Stage===\\\\n\\\"\\n \\\"{}\\\\n\\\"\\n \\\"====Goal Board=====\\\\n\\\"\\n \\\"{}\\\".format(align_column(self.from_grid),\\n align_column(self.to_grid)))\",\n \"def __getAsciiString(self):\\n lines = []\\n horizontalLine = ('-' * (26))\\n lines.append(horizontalLine)\\n for row in self.board:\\n rowLine = '|'\\n for col in row:\\n if col == -1:\\n col = 'O'\\n if col == 0:\\n col = '-'\\n if col == 1:\\n col = 'X'\\n rowLine = rowLine + ' ' + col.__str__() + ' |'\\n lines.append(rowLine)\\n lines.append(horizontalLine)\\n return '\\\\n'.join(lines)\",\n \"def board2str(board, end='\\\\n'):\\n s = ''\\n for x in range(board.shape[0]):\\n for y in range(board.shape[1]):\\n s += str(board[x][y]) + '\\\\t'\\n s += end\\n return s[:-len(end)]\",\n \"def description() -> str:\\n content = \\\"Demonstrates usage of blackbord remappings.\\\\n\\\"\\n content += \\\"\\\\n\\\"\\n content += \\\"Demonstration is via an exemplar behaviour making use of remappings..\\\\n\\\"\\n\\n if py_trees.console.has_colours:\\n banner_line = console.green + \\\"*\\\" * 79 + \\\"\\\\n\\\" + console.reset\\n s = banner_line\\n s += console.bold_white + \\\"Blackboard\\\".center(79) + \\\"\\\\n\\\" + console.reset\\n s += banner_line\\n s += \\\"\\\\n\\\"\\n s += content\\n s += \\\"\\\\n\\\"\\n s += banner_line\\n else:\\n s = content\\n return s\",\n \"def __str__(self) -> str:\\n return self.description\",\n \"def get_board_name(self):\\n return \\\"OPP {} Board {}\\\".format(str(self.led.neoCard.chain_serial), \\\"0x%02x\\\" % self.led.neoCard.addr)\",\n \"def description():\",\n \"def ToMessageDesc(description):\\n message_desc = 'The text in the keyboard overlay to explain the shortcut'\\n if description:\\n message_desc = '%s (%s).' % (message_desc, description)\\n else:\\n message_desc += '.'\\n return message_desc\",\n \"def __str__(self):\\n str = '-' * (self.SIZE ** 2 + self.SIZE + 1) + '\\\\n'\\n for row in self.boards:\\n for i in range(self.SIZE):\\n str += '|'\\n for board in row:\\n for square in board.export_grid()[i]:\\n str += square.value\\n str += '|'\\n str += '\\\\n'\\n str += '-' * (self.SIZE ** 2 + self.SIZE + 1) + '\\\\n'\\n return str\",\n \"def __repr__(self):\\r\\n numLetters = self.numLetters\\r\\n S = ''\\r\\n S += 3*'\\\\n'\\r\\n S += ' '\\r\\n for i in range(numLetters):\\r\\n S += self.currentBoard[i] + ' '\\r\\n\\r\\n return S\",\n \"def __str__(self):\\n b = ''\\n for i in range(7): # 7 steps in the board\\n if i == self.chaser_i: # chaser position\\n b += '|' + str(i) + '| chaser |\\\\n'\\n elif i == self.player_i: # player position\\n b += '|' + str(i) + '| player |\\\\n'\\n else:\\n b += '|' + str(i) + '| |\\\\n'\\n b += '|7| bank |\\\\n' # bank position\\n return b\",\n \"def __repr__(self):\\n\\n return '<Board id={id} title={title}'.format(id=self.id,\\n title=self.title,\\n )\",\n \"def descString(self):\\n return \\\"\\\".join ([self.Name, \\\" (\\\", str(self.RollCount), \\\"d\\\"\\\\\\n , str(self.RollMax), \\\"; \\\", str(self.CritRollMin), \\\"-\\\"\\\\\\n , str(self.CritRollMax), \\\"x\\\", str (self.CritRollMult)\\\\\\n , \\\") - \\\", str(self.Value), \\\" gp\\\"])\",\n \"def desc(self):\\n return LandCell.desc(self) + \\\"; plant=\\\" + str(self.plant)\",\n \"def __str__(self):\\n string = \\\"\\\"\\n for row in self.layout:\\n for tile in row:\\n string+= str(tile) + \\\" \\\"\\n string+= \\\"\\\\n\\\"\\n return string\",\n \"def __str__(self):\\n return \\\"%s\\\\n\\\" % self.text + \\\" \\\" * self.col + \\\"^\\\"\",\n \"def get_description(self):\\n if CONFIG_KEY not in self:\\n return\\n if hasattr(self[CONFIG_KEY], DESC_KEY):\\n desc_str = str(self[CONFIG_KEY][DESC_KEY])\\n if not isinstance(desc_str, str):\\n try:\\n desc_str = str(desc_str)\\n except Exception as e:\\n raise InvalidConfigFileException(\\n \\\"Could not convert the specified Project description \\\"\\n \\\"({}) to string. Caught exception: {}\\\".\\n format(desc_str, getattr(e, 'message', repr(e))))\\n return desc_str\",\n \"def description(self) -> str:\\r\\n descrip = 'The player must aim for the largest “blob” of a given ' \\\\\\r\\n 'colour c. A blob is a group of connected blocks with the ' \\\\\\r\\n 'same colour. Two blocks are connected if their sides ' \\\\\\r\\n 'touch; touching corners doesn’t count. The player’s score ' \\\\\\r\\n 'is the number of unit cells in the largest blob of colour ' \\\\\\r\\n 'c. '\\r\\n return descrip\",\n \"def __str__(self):\\n return self.get_ascii_trunk() + self.get_ascii_leaves()\",\n \"def __str__(self):\\n\\n # Create grid headers for the table\\n headers = [letter for letter in string.ascii_uppercase[:self.width]]\\n\\n board_state = []\\n board_state.extend([[value for value in row] for i, row in enumerate(self.board_state)])\\n\\n for idx, row in enumerate(board_state):\\n row.insert(0, idx + 1)\\n\\n return tabulate(board_state, headers, tablefmt=\\\"grid\\\")\",\n \"def get_board_name(self):\\n pass\",\n \"def as_string(self):\\n # Remove cards which have no definition\\n cards = [card for card in self if card.definition is not None]\\n # Remove cards which have no word\\n cards = [card for card in cards if card.word]\\n return \\\"\\\\n\\\".join([card.get_flashcard() for card in cards])\",\n \"def __str__(self) -> str:\\n return self._color + str(self._value) + SudokuTile.C_END\",\n \"def __str__(self) -> str:\\r\\n output: str = \\\"\\\"\\r\\n\\r\\n for row_i in range(Board._NUM_ROWS):\\r\\n for col_i in range(Board._NUM_COLS):\\r\\n pos: Pos2D = Pos2D(col_i, row_i)\\r\\n output += (\\\"{} \\\".format(self.squares[pos].get_representation()))\\r\\n # Finished row, add new line.\\r\\n output += \\\"\\\\n\\\"\\r\\n\\r\\n return output\",\n \"def __str__(self):\\n line = ''\\n line += self.board_state.__str__()\\n line += self.move.__str__()\\n line += '\\\\n'\\n return line\",\n \"def get_descr_full(self):\\n desc_text = []\\n stack = [(self._desc, 0)]\\n while stack:\\n dl, di = stack.pop()\\n while di < len(dl):\\n if dl[di] == 0:\\n di += 1\\n elif dl[di] > 0 and dl[di] < 100000:\\n desc_text.append(str(self._tables.tab_b[dl[di]]))\\n di += 1\\n elif dl[di] >= 100000 and dl[di] < 200000:\\n lm = dl[di] // 1000 - 100\\n ln = dl[di] % 1000\\n desc_text.append(\\\"%06d : LOOP, %d desc., %d times\\\" % (dl[di], lm , ln))\\n di += 1\\n elif dl[di] >= 200000 and dl[di] < 300000:\\n en = self._tables.tab_c.get(dl[di])\\n am = dl[di] // 1000 - 200\\n an = dl[di] % 1000\\n if en is None:\\n en = (str(am), \\\"\\\")\\n if dl[di] < 222000:\\n desc_text.append(\\\"%06d : OPERATOR %s: %d\\\" % (dl[di], en[0], an))\\n else:\\n desc_text.append(\\\"%06d : OPERATOR '%s'\\\" % (dl[di], en[0]))\\n di += 1\\n elif dl[di] >= 300000 and dl[di] < 400000:\\n stack.append((dl, di + 1))\\n da = dl[di]\\n dl = self._tables.tab_d[dl[di]]\\n di = 0\\n desc_text.append(\\\"%06d : SEQUENCE, %d desc.\\\" % (da, len(dl)))\\n return desc_text\",\n \"def __str__(self):\\n return self.description\",\n \"def __str__(self):\\n return self.description\",\n \"def Description(self) -> str:\",\n \"def Description(self) -> str:\",\n \"def __str__(self):\\r\\n # The full representative string\\r\\n str_matrix = \\\"\\\"\\r\\n\\r\\n if self.matrix is not None:\\r\\n # Save the lenght into a variable\\r\\n # to send this number to the tiles method\\r\\n # and calculate the number of spaces\\r\\n spaces = len(self.matrix)\\r\\n for i in range(0, spaces):\\r\\n nums = list(filter(lambda x: x != \\\"_\\\", self.matrix[i]))\\r\\n str_matrix += self.tiles(nums, (i+1), (spaces - i))\\r\\n\\r\\n return str_matrix\",\n \"def __str__(self):\\n value = str(self.puzzle) + str(\\\" \\\") + str(self.g) + str(\\\" \\\") + str(self.h)\\n return value\",\n \"def board_label(board):\\n # 0 draw for side-to-move, 1 win for side-to-move (more than 50 moves), 2 win for side-to-move\\n # -1 loss in more than 50, -2 loss in <50\\n with chess.syzygy.open_tablebase(\\\"./\\\") as tablebase:\\n # board = chess.Board(\\\"8/2K5/4B3/3N4/8/8/4k3/8 b - - 0 1\\\")\\n wdl = tablebase.probe_wdl(board)\\n\\n # 0 draw, x win in x, -x loss in x\\n # counts may be off by 1\\n with chess.syzygy.open_tablebase(\\\"./\\\") as tablebase:\\n # board = chess.Board(\\\"8/2K5/4B3/3N4/8/8/4k3/8 b - - 0 1\\\")\\n dtz = tablebase.probe_dtz(board)\\n if wdl == 0:\\n win = 0\\n draw = 1\\n loss = 0\\n elif wdl > 0:\\n win = 1\\n draw = 0\\n loss = 0\\n else:\\n win = 0\\n draw = 0\\n loss = 1\\n if dtz > 0:\\n quality = 2000 - dtz\\n elif dtz < 0:\\n quality = -2000 - dtz\\n else:\\n quality = 0\\n\\n return win, draw, loss, quality\",\n \"def __str__(self):\\n\\n desc = self.description\\n if desc is not None:\\n return str(desc)\\n\\n desc = self.debugDescription\\n if desc is not None:\\n return str(desc)\\n\\n return repr(self)\",\n \"def get_cards_as_string(self):\\n return '' \\\\\\n ' {}\\\\n' \\\\\\n ' {}\\\\n' \\\\\\n ' {}\\\\n' \\\\\\n ' {}\\\\n' \\\\\\n ' {}\\\\n'.format(*self.get_cards_high_to_low())\",\n \"def state_to_string(board_state):\\n return str(board_state)\",\n \"def board_string(self, players):\\n if len(self.user_guess) == 1:\\n board = \\\"\\\\n-------------------\\\\n\\\"\\n board += f\\\"Player {players[0]}: {self.user_guess[0]}, {self.applied_guess[0]}\\\\n\\\"\\n board += f\\\"Player {players[1]}: {self.user_guess[0]}, {self.applied_guess[0]}\\\\n\\\"\\n board += \\\"-------------------\\\\n\\\"\\n\\n board = \\\"\\\\n-------------------\\\\n\\\"\\n board += f\\\"Player {players[0].get_name()}: {self.user_guess[0]}, {self.applied_guess[0]}\\\\n\\\"\\n board += f\\\"Player {players[1].get_name()}: {self.user_guess[1]}, {self.applied_guess[1]}\\\\n\\\"\\n board += \\\"-------------------\\\\n\\\"\\n\\n return board\",\n \"def __str__(self):\\n if self.__description:\\n return self.__description\\n return repr(self)\",\n \"def get_board_as_string(game):\\n str_board = \\\"\\\\n\\\" # every board starts with a blank line\\n row = 0 # used to print the board\\n\\n # creates a board of 5 lines. 3 rows, 2 dashed.\\n for line in range(1, 6):\\n\\n # every odd line\\n if line % 2 != 0:\\n\\n # add a row to the string str_board\\n str_board += \\\"{} | {} | {}\\\".format(game['board'][row][0], game['board'][row][1], game['board'][row][2])\\n\\n # increment the row\\n row += 1\\n\\n # every even line\\n else:\\n str_board += \\\"--------------\\\"\\n\\n str_board += \\\"\\\\n\\\" # add line break at the end of every line\\n\\n return str_board\",\n \"def description(self):\\n active = np.nonzero([bool(p) for p in self])[0]\\n last_active = active[-1] if len(active) else -1\\n return ' '.join([p.value_str for p in self][:last_active + 1])\",\n \"def __str__(self):\\n return (\\\">%s\\\\n\\\" % self.name) + \\\\\\n wrap(self.sequence, self.COLUMNS)\",\n \"def __str__(self):\\r\\n # replace with your code\\r\\n return str(self._board[0]) + \\\"\\\\n\\\" + str(self._board[1]) + \\\"\\\\n\\\" + str(self._board[2]) + \\\"\\\\n\\\" + str(self._board[3]) + \\\"\\\\n\\\\n\\\"\",\n \"def __str__(self):\\n card_str = ['-' * CARD_WIDTH]\\n card_str.append('{} (Game {})'.format(self.name, self.game.number).center(CARD_WIDTH))\\n card_str.append('-' * CARD_WIDTH)\\n card_str.append(''.center(CARD_WIDTH))\\n card_str.append('Money: {}'.format(self.money).center(CARD_WIDTH))\\n card_str.append('Turnover: {}'.format(self.turnover).center(CARD_WIDTH))\\n card_str.append(''.center(CARD_WIDTH))\\n card_str.append('-' * CARD_WIDTH)\\n return '\\\\n'.join('|{}|'.format(l) for l in card_str)\",\n \"def descString(self):\\n return \\\"\\\".join ([self.Name, \\\" (AR \\\", str(self.AR), \\\", Max DEX \\\"\\\\\\n , str(self.MaxDEXMod), \\\") - \\\", str(self.Value), \\\" gp\\\"])\",\n \"def getDescription(self):\\n if(self.isInit == True):\\n STR=\\\"Map source : \\\"+self.source+\\\"\\\\n\\\"\\n STR += str(self.rowsNumber) + \\\" rows, \\\"+str(self.columnsNumber)+\\\" columns, router range radius is \\\"+str(self.routerRangeRadius)+\\\"\\\\n\\\"\\n STR +=\\\"backbone costs \\\"+str(self.backBoneCosts)+\\\", router costs \\\"+str(self.routerCosts)+\\\", buget is \\\"+str(self.budget)+\\\"\\\\n\\\"\\n STR +=\\\"the initial cell connected to backbone is [\\\"+str(self.firstCell.row)+\\\",\\\"+str(self.firstCell.column)+\\\"]\\\"\\n return STR\\n else:\\n return \\\"MAP NOT INITIALISED\\\"\",\n \"def __str__(self):\\n data_string = \\\"\\\"\\n for i in range(self.height):\\n row = \\\"\\\"\\n for j in range(self.width):\\n row += \\\"|\\\" + self.data[i][j]\\n row += \\\"|\\\\n\\\"\\n data_string += row\\n data_string += \\\"-\\\" * (2 * self.width + 1)\\n data_string += \\\"\\\\n\\\"\\n\\n # Column numbers are labeled modulo 10 to keep the characters\\n # aligned correctly\\n for i in range(self.width):\\n data_string += \\\" \\\" + str(i % 10)\\n\\n return data_string\",\n \"def print_board(self):\\n board = \\\"\\\"\\n for i in range(3):#need to change this in the future\\n for j in range(3):#need to change this in the future\\n board += self.board[i][j]\\n if j != 2:#need to change this in the future\\n board += \\\" | \\\"\\n board += \\\"\\\\n\\\"\\n return board\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.65844256","0.65822697","0.642821","0.6403273","0.6371313","0.6342245","0.63234556","0.62662345","0.62411314","0.623124","0.62133116","0.62067544","0.6201318","0.6192333","0.6180038","0.61786634","0.616831","0.6166834","0.61507493","0.6119286","0.6043222","0.60417575","0.60313874","0.6017458","0.6017458","0.6016843","0.59935737","0.5989846","0.59773004","0.59670496","0.5964539","0.5957519","0.59106284","0.5910254","0.59046715","0.5889854","0.58877295","0.58851564","0.58790296","0.5878066","0.5877805","0.5872732","0.5870701","0.5858251","0.5839793","0.5833439","0.5829822","0.58271646","0.58122814","0.58120835","0.57896686","0.5784467","0.57713145","0.576708","0.57640743","0.57607096","0.5748869","0.5743802","0.5742404","0.57397485","0.57314897","0.5729486","0.57285744","0.5721781","0.5710826","0.5695495","0.5692412","0.5692032","0.5689897","0.5684616","0.56731254","0.56723696","0.56594765","0.56424224","0.5639167","0.56344044","0.56163746","0.5608865","0.56048447","0.55988944","0.5597813","0.5597813","0.5588222","0.5588222","0.55830926","0.5577695","0.5576101","0.5571726","0.555814","0.55524564","0.5539906","0.5533482","0.55284107","0.55239946","0.5523124","0.5518274","0.55069476","0.550123","0.5500214","0.54984015","0.54844433"],"string":"[\n \"0.65844256\",\n \"0.65822697\",\n \"0.642821\",\n \"0.6403273\",\n \"0.6371313\",\n \"0.6342245\",\n \"0.63234556\",\n \"0.62662345\",\n \"0.62411314\",\n \"0.623124\",\n \"0.62133116\",\n \"0.62067544\",\n \"0.6201318\",\n \"0.6192333\",\n \"0.6180038\",\n \"0.61786634\",\n \"0.616831\",\n \"0.6166834\",\n \"0.61507493\",\n \"0.6119286\",\n \"0.6043222\",\n \"0.60417575\",\n \"0.60313874\",\n \"0.6017458\",\n \"0.6017458\",\n \"0.6016843\",\n \"0.59935737\",\n \"0.5989846\",\n \"0.59773004\",\n \"0.59670496\",\n \"0.5964539\",\n \"0.5957519\",\n \"0.59106284\",\n \"0.5910254\",\n \"0.59046715\",\n \"0.5889854\",\n \"0.58877295\",\n \"0.58851564\",\n \"0.58790296\",\n \"0.5878066\",\n \"0.5877805\",\n \"0.5872732\",\n \"0.5870701\",\n \"0.5858251\",\n \"0.5839793\",\n \"0.5833439\",\n \"0.5829822\",\n \"0.58271646\",\n \"0.58122814\",\n \"0.58120835\",\n \"0.57896686\",\n \"0.5784467\",\n \"0.57713145\",\n \"0.576708\",\n \"0.57640743\",\n \"0.57607096\",\n \"0.5748869\",\n \"0.5743802\",\n \"0.5742404\",\n \"0.57397485\",\n \"0.57314897\",\n \"0.5729486\",\n \"0.57285744\",\n \"0.5721781\",\n \"0.5710826\",\n \"0.5695495\",\n \"0.5692412\",\n \"0.5692032\",\n \"0.5689897\",\n \"0.5684616\",\n \"0.56731254\",\n \"0.56723696\",\n \"0.56594765\",\n \"0.56424224\",\n \"0.5639167\",\n \"0.56344044\",\n \"0.56163746\",\n \"0.5608865\",\n \"0.56048447\",\n \"0.55988944\",\n \"0.5597813\",\n \"0.5597813\",\n \"0.5588222\",\n \"0.5588222\",\n \"0.55830926\",\n \"0.5577695\",\n \"0.5576101\",\n \"0.5571726\",\n \"0.555814\",\n \"0.55524564\",\n \"0.5539906\",\n \"0.5533482\",\n \"0.55284107\",\n \"0.55239946\",\n \"0.5523124\",\n \"0.5518274\",\n \"0.55069476\",\n \"0.550123\",\n \"0.5500214\",\n \"0.54984015\",\n \"0.54844433\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":94790,"cells":{"query":{"kind":"string","value":"Gives a pawn on the position x,y or returns empty if none exists"},"document":{"kind":"string","value":"def getPawn(self,x,y):\n if(self.gameState[x,y]==EMPTY):\n return\n return Pawn(x,y,self.gameState[x,y])"},"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 add_a_pawn(self, player, pos_x, pos_y)-> bool:\n if not pos_x in range(0, len(self.grid)) \\\n or not pos_y in range(0, len(self.grid)):\n return False\n if self.grid[pos_x][pos_y].color is None:\n for index_x in range(-1, 2):\n for index_y in range(-1, 2):\n other_pos_x = pos_x + index_x\n other_pos_y = pos_y + index_y\n if other_pos_x < 0 or other_pos_y < 0:\n continue\n if other_pos_x >= self.grid_length or other_pos_y >= self.grid_length:\n continue\n if not self.grid[other_pos_x][other_pos_y].color is None:\n self.grid[other_pos_x][other_pos_y].change_color(player.color)\n self.grid[pos_x][pos_y].change_color(player.color)\n self.last_move.append((pos_x, pos_y))\n return True\n else:\n return False","def respawn(self, xrespawn, yrespawn):\n # If we are in the middle of respawning, this is non-zero.\n self.respawning = 1\n #self.center_x = SCREEN_WIDTH / 2\n #self.center_y = SCREEN_HEIGHT / 2\n\n self.center_x = xrespawn\n self.center_y = yrespawn\n\n self.angle = 0\n\n self.cur_health = self.max_health","def get_piece(self, x, y):\n if self.in_bounds(x, y) and self.piece_at(x, y):\n return self.__board[(x, y)]\n return None","def move_pawn(pos, game):\n #Convert coordinates to row and column\n row = int(pos[1]//(SQUARESIZE+FENCEWIDTH))\n col = int(pos[0]//(SQUARESIZE+FENCEWIDTH))\n #Make move\n game.move_pawn(game.get_player_turn(), (col,row))","def select_square(board: Board, n: int, pawn_value: int) -> Tuple[int, int]:\n\n print(\"Select a square where you may want to put a pawn.\")\n x = sanitized_int_input(\"Its x coordinates: \")\n y = sanitized_int_input(\"Its y coordinates: \")\n\n if square_valid(board, n, pawn_value, x, y):\n return x, y\n else:\n print(\"You can't put a pawn here, sorry. Please, retry.\")\n return select_square(board, n, pawn_value)","def random_position(self):\n while True:\n h = random.randrange(0, self.height)\n w = random.randrange(0, self.width)\n if self.grid[h, w] == 0:\n return (h, w)","def __generate_spawn_points(self):\n while True:\n p1x = random.randint(0, self.width - 1)\n p1y = random.randint(0, self.height - 1)\n p2x, p2y = self.__mirror(p1x, p1y)\n d_sq = (p1x - p2x)**2 + (p1y - p2y)**2\n if d_sq >= (self.width / 2)**2:\n break\n return (p1x, p1y), (p2x, p2y)","def locate(x, y):\n position(x * 6, y)","def spawn(self):\n (x_coord, y_coord) = (0, 0)\n grid_x = SCREEN_X // self.size\n grid_y = SCREEN_Y // self.size\n while x_coord < EDGE + 5 or x_coord > SCREEN_X - self.size - EDGE - 5:\n x_coord = random.randrange(grid_x) * self.size\n while y_coord < EDGE + 5 or y_coord > SCREEN_Y - self.size - EDGE - 5:\n y_coord = random.randrange(grid_y) * self.size\n return (x_coord, y_coord)","def respawn_player(self):\n self.rect.x = 50\n self.rect.y = 50\n \n # Specifies the Player's spawnpoint as maze_arrangement[1][1], representing\n # the tile in the top-left corner of the maze\n self.__user_x = 1\n self.__user_y = 1","def put_pawn_at(board: Board, pawn_value: int, x: int, y: int) -> None:\n\n board[y][x] = 1 if argv[2] is '0' else pawn_value","def get_clicked_tile(self, x: int, y: int) -> Optional[Point]:\n\t\ttile_x = x//(self.canvas_width//self.board_size)\n\t\ttile_y = y//(self.canvas_height//self.board_size)\n\n\t\tif tile_x < 0 or tile_x >= self.board_size or tile_y < 0 or tile_y >= self.board_size:\n\t\t\treturn None\n\t\telse:\n\t\t\treturn Point(tile_x, tile_y)","def player_location(self):\n x = 0\n y = 0\n for line in self.grid:\n for i in line:\n if i == \"P\":\n return x, y\n \n y+=1\n x += 1\n y = 0","def get_random_empty_location(player_x, player_y, min_distance_from_player):\n empty_locations = []\n for row in range(height):\n for column in range(width):\n if False: # TODO: Replace False with condition that checks that location (column, row) is empty and at least min_distance_from_player squares from the player.\n # TODO: Add the empty location tuple to the list of empty locations.\n pass\n # TODO: If the list of empty locations is empty, return None.\n # TODO: Otherwise, return one of the location tuples from the list.","def get_random_position(self):\n if self._geometry_type in ['area', 'circle']:\n geo = self.get_geometry()\n min_x, min_y, max_x, max_y = geo.bounds\n pnt = Point(\n random.uniform(min_x, max_x), \n random.uniform(min_y, max_y))\n while not geo.contains(pnt):\n pnt = Point(\n random.uniform(min_x, max_x), \n random.uniform(min_y, max_y))\n return pnt\n else:\n return None","def __get_random_player_position(self) -> Tuple[int, int]:\n no_player_position = True\n while no_player_position:\n for row in range(0, self.__labyrinth.labyrinth_height):\n for col in range(0, self.__labyrinth.labyrinth_width):\n if self.__labyrinth[row][col] == Labyrinth.FLOOR and no_player_position:\n self.__row_position = row\n self.__col_position = col\n\n if len(self.__path_to_end()) > self.__labyrinth.labyrinth_width and \\\n len(self.__path_to_end()) > self.__labyrinth.labyrinth_height:\n self.__labyrinth[row][col] = Labyrinth.START\n no_player_position = False\n\n return self.__row_position, self.__col_position","def getKickingPosition():\n pass","def _input_coords(game,player):\r\n print(Player.get_name(player)+'('+Player.get_spec(player)+')'+\" it's your turn\")\r\n coords = input(\"coords of cell? \")\r\n coords = coords.split(',')\r\n try :\r\n x = int(coords[0])\r\n y = int(coords[1])\r\n if game[x][y] == '' : \r\n return (x,y)\r\n except :\r\n return _input_coords(game,player)\r\n print('illegal play, choose an empty cell')\r\n return _input_coords(game,player)","def get_piece(self, selected_piece_coords):\n for piece in self.game_pieces:\n if selected_piece_coords[0] == piece.x and selected_piece_coords[1] == piece.y:\n return piece.clone()\n return None","def last_pos(self) -> tuple[int, int]:\n if not self.actions:\n return (self.start_x, self.start_y)\n else:\n box = self.get_hitbox_at(self.time_consumed)\n return box.pos_x, box.pos_y","def default_location(self, thing):\n if isinstance(thing, Agent):\n return (1, 1)\n else:\n get_rand = lambda arg: random.choice(range(1, arg-1))\n while True:\n xloc, yloc = (get_rand(self.width), get_rand(self.height))\n if (1, 1) == (xloc, yloc):\n continue\n break\n return (xloc, yloc)","def firstMove(board):\r\n x = board.size / 2\r\n return (x, x)","def getPoint(self):\n return Point(*self.position)","def get_absolute_pos(x, y, base):\n\n # give a small deadzone\n new_x = base[0] + (int(x / 2) if abs(x) > 2 else 0)\n new_y = base[1] - (int(y / 2) if abs(y) > 2 else 0)\n\n return (new_x, new_y)","def respawn(x,y):\n\t\tpos = Board.prev_j+1\n\t\twhile pos<y:\n\t\t\tif (Board.board[x][pos]==' ' or Board.board[x][pos]=='.') and Board.board[x+1][pos]!='-':\n\t\t\t\tBoard.board[x][pos]='M'\n\t\t\t\tbreak\n\t\t\tpos+=1","def random_position(self):\n\t\treturn (random.randint(1, self.max_x-2), random.randint(1,self.max_y-2))","def draw_X():\r\n x,y = pygame.mouse.get_pos()\r\n x = 3*x/300\r\n y = 3*y/300\r\n x = approximate(x)\r\n y = approximate(y)\r\n pos_x = 0\r\n pos_y = 0\r\n if x == 50:pos_x = 0\r\n elif x == 150:pos_x=1\r\n elif x == 250:pos_x=2\r\n if y == 50:pos_y=0\r\n elif y == 150:pos_y=1\r\n elif y == 250:pos_y=2\r\n if positions[pos_y][pos_x] == 0:\r\n positions[pos_y][pos_x] = -1\r\n pygame.draw.line(screen,(255,255,255),(x-40,y-40),(x+40,y+40),10)\r\n pygame.draw.line(screen,(255,255,255),(x+40,y-40),(x-40,y+40),10)\r\n players.reverse()\r\n else: \r\n print('the spot was occupied')\r\n time.sleep(.25)","def respawn(self):\n # If we are in the middle of respawning, this is non-zero.\n self.respawning = 1\n self.center_x = SCREEN_WIDTH / 2\n self.center_y = 600","def get_pos(self, off_w=0, off_l=0, off_h=0):\n try:\n return self.world_grid[self.w + off_w][self.l + off_l][self.h + off_h]\n except IndexError:\n return blocks['wall']","def spawn(self, y, x, h, w):\n self.pos = (np.random.randint(y, y + h), np.random.randint(x, x + w))","def get_piece(self, position):\n return self.board[position[0]][position[1]]","def respawn(self):\n # If we are in the middle of respawning, this is non-zero.\n self.respawning = 1\n self.center_x = SCREEN_WIDTH / 2\n self.center_y = SCREEN_HEIGHT / 2\n self.angle = 0","def innerSpawn( self, tCoords, result, argsList ):\n\t\tbPaint = True\n\t\tbContinue = True\n\t\tpCurrent = gc.getMap().plot(tCoords[0], tCoords[1])\n\t\tif pCurrent.isHills() or pCurrent.isFlatlands():\n\t\t\tif pCurrent.getTerrainType() != con.iWetland:\n\t\t\t\tif not pCurrent.isCity() and not pCurrent.isUnit():\n\t\t\t\t\tbClean = True\n\t\t\t\t\tfor x in range(tCoords[0] - 1, tCoords[0] + 2):\t\t# from x-1 to x+1\n\t\t\t\t\t\tfor y in range(tCoords[1] - 1, tCoords[1] + 2):\t# from y-1 to y+1\n\t\t\t\t\t\t\tif gc.getMap().plot(x,y).isUnit():\n\t\t\t\t\t\t\t\tbClean = False\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\tif bClean:\n\t\t\t\t\t\tif pCurrent.getOwner() in argsList:\n\t\t\t\t\t\t\t# this is a good plot, so paint it and continue search\n\t\t\t\t\t\t\treturn (None, bPaint, bContinue)\n\t\t# not a good plot, so don't paint it but continue search\n\t\treturn (None, not bPaint, bContinue)","def random_position(width, height):\n x = random.randrange(0, width)\n y = random.randrange(0, height)\n return x,y","def get_center_position( peg, position_on_peg):\n x = Hanoi.FIRST_TOWER_X + peg * Hanoi.DISTANCE_BETWEEN_TOWER\n y = position_on_peg * Hanoi.DISK_HEIGHT + 0.5 * Hanoi.DISK_HEIGHT\n return (x, y)","def pupil_left_coords(self):\n if self.pupils_located:\n x = self.eye_left.origin[0] + self.eye_left.pupil.x + self.x_add\n y = self.eye_left.origin[1] + self.eye_left.pupil.y + self.y_add\n return (x, y)","def get_cell(self, x, y):\n if y < 0 or y >= len(self.g): return None\n if x < 0 or x >= len(self.g[y]): return None\n return self.g[y][x]","def room_xy(room, x, y, value=None):\n return room[x][y]","def assign_spawn_point(self) -> StaticTile:\n spawn_tile = self.spawn_points[self.active_spawns]\n self.active_spawns += 1\n return spawn_tile","def board_empty_positions(self, x, y):\n board = self.boards[x][y]\n coords = [(x, y, i, j) for (i, j) in board.empty_squares]\n return self.coords_to_positions(coords)","def outerSpawn( self, tCoords, result, argsList ):\n\t\tbPaint = True\n\t\tbContinue = True\n\t\tpCurrent = gc.getMap().plot(tCoords[0], tCoords[1])\n\t\tif pCurrent.isHills() or pCurrent.isFlatlands():\n\t\t\tif pCurrent.getTerrainType() != con.iWetland:\n\t\t\t\tif not pCurrent.isCity() and not pCurrent.isUnit():\n\t\t\t\t\tbClean = True\n\t\t\t\t\tfor x in range(tCoords[0] - 1, tCoords[0] + 2):\t\t# from x-1 to x+1\n\t\t\t\t\t\tfor y in range(tCoords[1] - 1, tCoords[1] + 2):\t# from y-1 to y+1\n\t\t\t\t\t\t\tif gc.getMap().plot(x,y).isUnit():\n\t\t\t\t\t\t\t\tbClean = False\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\tif bClean:\n\t\t\t\t\t\tif pCurrent.calculateCulturalOwner() == -1: # edead: bugfix\n\t\t\t\t\t\t\t# this is a good plot, so paint it and continue search\n\t\t\t\t\t\t\treturn (None, bPaint, bContinue)\n\t\t# not a good plot, so don't paint it but continue search\n\t\treturn (None, not bPaint, bContinue)","def random_empty_position(current_animal, grid_size, all_animals):\n all_neighbors = list_neighbors(current_animal.row, current_animal.col,\n grid_size)\n\n occupied = set()\n for x in all_animals:\n occupied.add((x.row, x.col))\n\n neighbors = []\n for x in all_neighbors:\n if x not in occupied:\n neighbors.append(x)\n\n if len(neighbors) == 0:\n return None\n\n row, col = my_random_choice(neighbors)\n return (row, col)","def make_position(data) -> Position:\n return (data[\"x\"], data[\"y\"])","def _get_piece_at_opening_or_none(self, x, y):\n if self._is_valid_opening(x, y):\n return self._openings[x][y]\n else:\n return Piece.NONE","def __get_random_hotspot(self):\n x_min = self.occupancy_map.info.origin.position.x\n x_max = x_min + self.occupancy_map.info.width * self.occupancy_map.info.resolution\n y_min = self.occupancy_map.info.origin.position.y\n y_max = y_min + self.occupancy_map.info.height * \\\n self.occupancy_map.info.resolution\n # This might bes a bit strange, but we have the following problem:\n # some simulators need a square version of the same map. A square version\n # will have other x_max or y_max and thus the random hotspots will be different.\n # TO prevent this, we will always take only the max value of either x_max or y_max.\n # This will be the same for the square version and the not-square version (of the same map).\n max_value = max(x_max, y_max)\n\n # search for a not occupied position\n while True:\n # previously: x = random.uniform(x_min, x_max) # see problem description above\n x = random.uniform(x_min, max_value)\n # previously: y = random.uniform(y_min, y_max) # see problem description above\n y = random.uniform(y_min, max_value)\n # due to the workaround for the problem above, it can be that the value is out\n # of map for the not square map version. We need to skip this (the square\n # map version will skip it due to occupied cell...):\n if x <= x_max and y <= y_max:\n cell_x = min(int(\n (x - x_min) / self.occupancy_map.info.resolution), self.occupancy_map.info.width - 1)\n cell_y = min(int(\n (y - y_min) / self.occupancy_map.info.resolution), self.occupancy_map.info.height - 1)\n if not self.__cell_is_occupied(cell_x, cell_y):\n break\n spread = random.uniform(0.5, 1.0)\n return (x, y, spread)","def pickPlace(distx = 10,disty = 10, midDist = 20,defaultHeight= -70,linHeight = 10, robotHeight = -90):\n pickPlacePos = []\n yCount = [0, 1]\n xCount = [-1,0,1]\n for numx in xCount:\n for numy in yCount:\n pickPlacePos.append([numx*distx, numy*disty-midDist, robotHeight+linHeight,0,0,0,'lin'])\n pickPlacePos.append([numx*distx, numy*disty-midDist, robotHeight,0,0,0,'mov'])\n pickPlacePos.append([numx*distx, numy*disty-midDist, robotHeight+linHeight,0,0,0,'lin'])\n\n pickPlacePos.append([numx*distx, 0, defaultHeight,0,0,0,'mov'])\n\n pickPlacePos.append([numx*distx, numy*disty+midDist, robotHeight+linHeight,0,0,0,'lin'])\n pickPlacePos.append([numx*distx, numy*disty+midDist, robotHeight,0,0,0,'mov'])\n pickPlacePos.append([numx*distx, numy*disty+midDist, robotHeight+linHeight,0,0,0,'lin'])\n\n pickPlacePos.append([numx*distx, 0, defaultHeight,0,0,0,'mov'])\n\n pickPlacePos.append([0,0,-127,0,0,0,'mov'])\n return pickPlacePos","def get_pawn_moves(self, state):\n pawn_moves = []\n\n if self.color == cc.WHITE_ACTIVE:\n forward_1 = add_vectors(self.coord, cc.V_UP)\n forward_2 = add_vectors(self.coord, cc.V_UP_2)\n attacks = get_crawler_moves(self.coord, cc.W_PAWN_CAPTURE_VECTORS)\n starting_rank = cc.RANK_2\n promo_rank = cc.RANK_8\n promo_pieces = cc.WHITE_PROMO\n enemy_set = cc.BLACK_PIECES\n elif self.color == cc.BLACK_ACTIVE:\n forward_1 = add_vectors(self.coord, cc.V_DOWN)\n forward_2 = add_vectors(self.coord, cc.V_DOWN_2)\n attacks = get_crawler_moves(self.coord, cc.B_PAWN_CAPTURE_VECTORS)\n starting_rank = cc.RANK_7\n promo_rank = cc.RANK_1\n promo_pieces = cc.BLACK_PROMO\n enemy_set = cc.WHITE_PIECES\n else:\n raise Exception(\"get_pawn_moves: Invalid Piece Color\")\n\n if validate_move(forward_1) and state.board[forward_1] == cc.NO_PIECE:\n if forward_1[0] == promo_rank:\n for p in promo_pieces:\n pawn_moves.append(cc.Action(self.string, self.coord, forward_1, promo=p))\n else:\n pawn_moves.append(cc.Action(self.string, self.coord, forward_1))\n if self.coord[0] == starting_rank and validate_move(forward_2) and state.board[forward_2] == cc.NO_PIECE:\n pawn_moves.append(cc.Action(self.string, self.coord, forward_2, en_p=forward_1))\n\n for attack in attacks:\n if state.board[attack] in enemy_set:\n if attack[0] == promo_rank:\n for p in promo_pieces:\n pawn_moves.append(cc.Action(self.string, self.coord, attack, capture=True, promo=p))\n else:\n pawn_moves.append(cc.Action(self.string, self.coord, attack, capture=True))\n # Make sure Pawns can attack en_passant squares\n elif attack == state.en_passant:\n pawn_moves.append(cc.Action(self.string, self.coord, attack, capture=True))\n\n return pawn_moves","def position_to_stone(self, position):\n if len(position) != 2:\n stone = -1\n return stone\n h = position[0]\n w = position[1]\n stone = h * self.width + w\n if stone not in self.blanks:\n stone = -1 # -1 means the current position is blank.\n return stone","def getRandomPosition(self):\n\n #random.seed(1)#for repeatable results.\n #pos[0] = random.randint(0, self.width-1) # -1 since randint Returns a random integer N such that a <= N <= b.\n #pos[1] = random.randint(0, self.height-1)# -1 since randint Returns a random integer N such that a <= N <= b.\n #above solution uses ints and returns random tile positions, not random positions.\n #NB: must use init method of Potion object\n return Position(random.random()*self.width, random.random()*self.height)\n #raise NotImplementedError #refer https://docs.python.org/2/library/exceptions.html","def crearParedX(self, posx, posy):\n\n # Marco el punto como nodo y guardo\n k = (3, self.matrixMAPA[posx][posy][1])\n self.matrixMAPA[posx][posy] = k\n\n\n # Pinto hacia -x hasta que termine o hasta que encuentre un muro\n for i in range(0, posy):\n \n iterator = (posy-1) - i\n # Capturo el punto\n # Si no es pared continue\n k = self.matrixMAPA[posx][iterator]\n # Si el valor esta permitido pinte si no termine\n if k[0] != 1 and k[0] != 2 and k[0] != 3:\n # Marco como pared\n alpha = (2, self.matrixMAPA[posx][iterator][1])\n # Guardo lo marcado\n self.matrixMAPA[posx][iterator] = alpha\n else:\n break\n\n # Pinto hacia +x \n for j in range(posy+1, len(self.matrixMAPA[posx])):\n # Capturo el valor\n k = self.matrixMAPA[posx][j]\n # Si el valor esta permito pinte \n if k[0] != 1 and k[0] != 2 and k[0] != 3:\n # marco como pared\n alpha = (2, self.matrixMAPA[posx][j][1])\n # Guardo\n self.matrixMAPA[posx][j] = alpha\n else:\n break","def get_pos(self):\n return (self.x, self.y)","def return_cell(self):\n\n pos = pygame.mouse.get_pos()\n\n x = pos[1] // (self.cell_size+1)\n y = pos[0] // (self.cell_size+1)\n\n return self.grid[x][y]","def getPossibleMoves(self): # called to get possible positions this piece can go\r\n \r\n moves = {}\r\n\r\n ids = []\r\n\r\n for piece in self.board.pieces.values():\r\n if piece.name == \"empty\":\r\n piece.glow = False\r\n piece.ready = False\r\n\r\n self.piece = self\r\n\r\n def check(direction=\"left\", heading=\"north\", x=None, y=None):\r\n piece = self.piece\r\n if direction == \"left\": x -= 50\r\n else: x += 50\r\n\r\n if heading == \"north\": y -= 50\r\n else: y += 50\r\n\r\n if (x, y) in self.board.pieces: # position is empty\r\n empty = self.board.getPiece((x, y))\r\n empty.glow = True\r\n old, new, obj = (direction, heading), (x, y), piece\r\n identity = self.getRandomID(ids) # get an ID for the move\r\n moves[identity] = old, new, obj\r\n\r\n if piece.isKing: # piece is a king, so go on\r\n check(direction, heading, x, y)\r\n else: # its not empty, so check if its comrade\r\n x1, y1 = x+25, y+25\r\n piece2 = self.board.getPiece((x1, y1))\r\n try:\r\n if piece.isComrade(piece2):# piece is comrade so return\r\n return\r\n else: # piece is not comrade, so check empty\r\n if direction == \"left\": x2 = x1-25-50\r\n else: x2 = x1-25+50\r\n\r\n if heading == \"north\": y2 = y1-25-50\r\n else: y2 = y1-25+50\r\n\r\n if (x2, y2) in self.board.pieces: # its empty, so notify player\r\n empty = self.board.getPiece((x2, y2))\r\n empty.glow = True\r\n empty.ready = True\r\n\r\n old, new, obj = (direction, heading), (x2, y2), piece2\r\n identity = self.getRandomID(ids)\r\n moves[identity] = old, new, obj\r\n\r\n check(direction, heading, piece2.x-25, piece2.y-25)\r\n check(direction, heading, x2, y2)\r\n \r\n # check empty or comrade again\r\n if direction == \"left\": x3 = x2-50\r\n else: x3 = x2+50\r\n\r\n if heading == \"north\": y3 = y2-50\r\n else: y3 = y2+50\r\n\r\n if (x3, y3) in self.board.pieces: # positon(address) is empty\r\n return\r\n else: # there is a piece, so check if comrade, stop, if not comrade continue\r\n x3+=25\r\n y3+= 25\r\n\r\n piece3 = self.board.getPiece((x3, y3))\r\n if piece3.isComrade(piece2): # comrades, so stop\r\n return\r\n else: # not comrades, so continue\r\n self.piece = piece3\r\n check(direction, heading, x, y)\r\n\r\n #self.piece = piece2\r\n \r\n #check(direction, heading, x2, y2) # keep searching\r\n else: # its not empty, so return\r\n return\r\n except:\r\n pass\r\n\r\n if self.piece.name == \"white\": direction = \"north\"\r\n else: direction = \"south\"\r\n \r\n check(\"left\", direction, self.piece.x-25, self.piece.y-25)\r\n check(\"right\", direction, self.piece.x-25, self.piece.y-25)\r\n \r\n if self.piece.isKing:\r\n if self.piece.name == \"white\": heading = \"south\"\r\n else: heading = \"north\"\r\n \r\n check(\"left\", heading, self.piece.x-25, self.piece.y-25)\r\n check(\"right\", heading, self.piece.x-25, self.piece.y-25)\r\n\r\n if self.piece.name == \"white\":\r\n eatMoves = self.board.game.thinkEatMoves(moves, \"person\")\r\n if eatMoves is not None:\r\n return eatMoves\r\n\r\n return moves","def __occupy(self, x, y, player):\n queue = [(x, y)]\n area = []\n closed = True\n while closed and len(queue) > 0:\n (x, y) = queue.pop(0)\n if (x, y) in area:\n continue\n area.append((x, y))\n #print(\"Q: \", queue)\n #print(\"A: \", area)\n # try to extend in possible directions\n if not self.has_border(x, y, \"top\"):\n if y == 0: # leaving the board\n closed = False\n queue.append((x, y - 1))\n if not self.has_border(x, y, \"right\"):\n if x == self.__size - 1: # leaving the board\n closed = False\n queue.append((x + 1, y))\n if not self.has_border(x, y, \"bottom\"):\n if y == self.__size - 1: # leaving the board\n closed = False\n queue.append((x, y + 1))\n if not self.has_border(x, y, \"left\"):\n if x == 0: # leaving the board\n closed = False\n queue.append((x - 1, y))\n\n if closed: # closed area => occupy it by player\n for (x, y) in area:\n self.__board[y][x] += player * 16\n self.__colored[player - 1] += 1","def shuffle_pos(self, ):\n x, y = 0, 0\n while self.maze.structure[int(y / 40)][int(x / 40)] != \"0\" \\\n or (x, y) in self.forbiden_tulpes:\n x = random.randint(0, 14) * sprite_size\n y = random.randint(0, 14) * sprite_size\n self.forbiden_tulpes.append((x, y))\n return x, y","def get_pos(self, cx, cy):\n x = self.min_x + cx*(self.size+0.5)\n y = self.min_y + cy*(self.size+0.5)\n return (x,y)","def getpiece(self, x, y, z):\n\n for p in self.pieces:\n if (p.x, p.y, p.z) == (x, y, z):\n return p","def random_location(self):\r\n\r\n while True:\r\n pt = (random.uniform(self.worldbox.tl[0], self.worldbox.br[0]),\r\n random.uniform(self.worldbox.tl[1], self.worldbox.br[1]))\r\n if not self.is_wall(pt) and not self.is_target(pt):\r\n return pt","def pixel(self, x, y, color=None):\n if not 0 <= x <= 4:\n return None\n if not 0 <= y <= 6:\n return None\n return super()._pixel(x, y, color)","def initialCoordinates():\r\n return (-250,-250)","def put_piece(self, x: int, y: int):\n if self.game_board.board_values[x, y] != 0:\n print(x, y)\n raise exceptions.NonEmptySlotError(\"You must select a empty slot!\")\n\n self.game_board.put_piece(x, y, self.current_piece)","def firstMove(self):\n return (10, 10)","def pos_as_point(self) -> Point:\n return Point(self.x, self.y, 0)","def _get_random_position(self):\n return (random.randrange(0, self.maze.width),\n random.randrange(0, self.maze.height))","def get_penguin_placement(self, state: FishGameState):\n return self.strategy.place_penguin(state=state)","def position(x, y):\n command([x + 0x80, y + 0x40])","def get_position(self):\n position = (self.position_x * SPRITE_SIZE, self.position_y * SPRITE_SIZE)\n return position","def get_our_tile(self, x, y):\n\t\tif x >= 0 and x < self.w and y >= 0 and y < self.h:\n\t\t\treturn self.our_tiles[x][y]\n\t\treturn None","def is_pawn_move_valid(self, from_row, from_col, to_row, to_col):\n # Setup variables used\n piece = self.board.squares[from_row][from_col]\n piece_color = self.piece_color(piece)\n to_piece = self.board.squares[to_row][to_col]\n row_diff = abs(from_row - to_row)\n col_diff = abs(from_col - to_col)\n dc = 0\n\n # Set flag for first move of pawn\n first_move = True if from_row == 6 or from_row == 1 else False\n\n # If direction is not correct for white, exit\n if to_row - from_row > 0:\n dr = 1\n if self.piece_color(piece) == \"white\":\n return False\n\n # If direction is not correct for black, exit\n if to_row - from_row < 0:\n dr = -1\n if self.piece_color(piece) == \"black\":\n return False\n\n # If moving straight\n if from_col == to_col:\n # if not legal straight move, exit\n if not (row_diff == 1 or (first_move and row_diff == 2)):\n return False\n\n # make sure to move has no pieces on straight path\n dm = row_diff + 1\n\n # return value\n retVal = self._any_piece_in_way(from_row, from_col, dr, dc, dm)\n\n# if retVal and not self.testing:\n# # self.pawn_promotion(to_row, to_col, piece_color)\n# self.board.overwrite_board_square(to_row, to_col)\n# if piece_color == \"black\":\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\n# else:\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\n\n return retVal\n\n # WHITE en passant\n # move from moveHistory => (\"piece\", fromRow, fromCol, toRow, toCol)\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\n self.moveHistory[-1][0] == \"♟\" and self.moveHistory[-1][1] == 1 and\\\n self.moveHistory[-1][3] == 3 and piece_color == \"white\":\n if col_diff == 1 and row_diff == 1 and to_piece == None:\n if not self.testing:\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\n return True\n\n # BLACK en passant\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\n self.moveHistory[-1][0] == \"♙\" and self.moveHistory[-1][1] == 6 and\\\n self.moveHistory[-1][3] == 4 and piece_color == \"black\":\n if col_diff == 1 and row_diff == 1 and to_piece == None:\n if not self.testing:\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\n return True\n\n # else move must be taking piece directly move\n # if legal taking piece move and (opponent-already check for own piece) piece at to-square\n if col_diff == 1 and row_diff == 1 and to_piece != None:\n\n# if not self.testing:\n# # self.pawn_promotion(to_row, to_col, piece_color)\n# self.board.overwrite_board_square(to_row, to_col)\n# if piece_color == \"black\":\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\n# else:\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\n return True\n\n return False","def outerSeaSpawn( self, tCoords, result, argsList ):\n\t\tbPaint = True\n\t\tbContinue = True\n\t\tpCurrent = gc.getMap().plot(tCoords[0], tCoords[1])\n\t\tif pCurrent.isWater() and not pCurrent.isLake(): # edead: no barbs in lakes!\n\t\t\tif not pCurrent.isCity() and not pCurrent.isUnit():\n\t\t\t\tif pCurrent.calculateCulturalOwner() == -1: # edead: bugfix\n\t\t\t\t\tbClean = True\n\t\t\t\t\tfor x in range(tCoords[0] - 1, tCoords[0] + 2):\t\t# from x-1 to x+1\n\t\t\t\t\t\tfor y in range(tCoords[1] - 1, tCoords[1] + 2):\t# from y-1 to y+1\n\t\t\t\t\t\t\tif gc.getMap().plot(x,y).isUnit():\n\t\t\t\t\t\t\t\tbClean = False\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\tif bClean:\n\t\t\t\t\t\t# this is a good plot, so paint it and continue search\n\t\t\t\t\t\treturn (None, bPaint, bContinue)\n\t\t# not a good plot, so don't paint it but continue search\n\t\treturn (None, not bPaint, bContinue)","def xy_occupied(xy, board):\n return True if board[xy[0]][xy[1]] else False","def update(board: Board, pawn_value: int, x: int, y: int) -> None:\n\n put_pawn_at(board, pawn_value, x, y)\n block_row(board, pawn_value, y)\n block_column(board, pawn_value, x)\n block_diagonals(board, pawn_value, x, y)","def peek(self, pos_x, pos_y):\n self.validate_position(pos_x, pos_y)\n return self.map[pos_x][pos_y]","def get(self, x: int, y: int, /) -> int:","def getRandomPosition(self):\n return Position(random.random()*self.w, random.random()*self.h)","def get_tile_location(self):\n if self.rect.x == 0:\n tile_x = 0\n elif self.rect.x % 32 == 0:\n tile_x = (self.rect.x / 32)\n else:\n tile_x = 0\n\n if self.rect.y == 0:\n tile_y = 0\n elif self.rect.y % 32 == 0:\n tile_y = (self.rect.y / 32)\n else:\n tile_y = 0\n\n return [tile_x, tile_y]","def generate_point(width, height):\n x = random.randrange(0 - OFFSET, width + OFFSET, 1)\n y = random.randrange(0 - OFFSET, height + OFFSET, 1)\n return (x, y)","def _show_piece(self, x_pos, y_pos):\n piece = self.board[x_pos, y_pos]\n if isinstance(piece, Pawn): return '{}P'.format(piece.color[0])\n elif isinstance(piece, Knight): return '{}N'.format(piece.color[0])\n elif isinstance(piece, Bishop): return '{}B'.format(piece.color[0])\n elif isinstance(piece, Rook): return '{}R'.format(piece.color[0])\n elif isinstance(piece, Queen): return '{}Q'.format(piece.color[0])\n elif isinstance(piece, King): return '{}K'.format(piece.color[0])\n else: return ' '","def get_position(self):\n return (self.x_pos, self.y_pos)","def guess(self, row, col) -> Tuple[int, Optional[ship.Ship]]:\n my_ship: ship.Ship = self._board_matrix[row][col]\n\n # if my_ship is None the guess is a miss, otherwise its a hit\n\n # --------- BEGIN YOUR CODE ----------\n\n # This is exactly the same as Human.guess, just copy the code over\n\n # --------- END YOUR CODE ----------","def assgin_pos(self, range_x, range_y, n_p):\n # n_p random integers\n pos_x = random.sample(range(0, int(100*n_p)), n_p)\n # get a random number\n tmp1 = random.uniform(0, 1)\n # keep position in the range of x and looks \"very random\"\n pos_x %= range_x - tmp1\n # same procedure for y\n pos_y = random.sample(range(0, int(100*n_p)), n_p)\n tmp1 = random.uniform(0, 1)\n pos_y %= range_y - tmp1\n return pos_x, pos_y","def spawn_point(self):\n return self._spawn_point","def _checkPawn(self):\r\n pawn = self.startCell.getPawn()\r\n if(not pawn.can_go_on(self.endCell)):\r\n message = (\"This pawn (%r) cannot go on this type of cell (%r)\" %\r\n (pawn, self.endCell.type))\r\n raise IllegalMoveException(message)\r\n return True","def getRandomPosition(self):\n\t\tp = Position(random.randrange(0, self.width), random.randrange(0, self.height))\n\t\treturn p","def shoot(self, point: Point) -> Tuple[bool, bool, ShipType]:\n\n # Shot off board\n if not self.point_in_board(point):\n raise InvalidShotException(f'{point} is not on the board')\n\n # Point has already been shot\n elif self.point_is_shot(point):\n raise InvalidShotException(f'{point} has already been shot')\n\n else:\n self.shot_locations.add(point)\n is_hit = True if point in self.all_ship_locations else False\n is_sunk = False\n ship_sunk = None\n\n if is_hit:\n # find out which one of the ships was shot\n for k, v in self.individual_ship_locations.items():\n # if v was the ship that was shot\n if point in v:\n # remove the point from v\n v.remove(point)\n if len(v) == 0:\n is_sunk = True\n ship_sunk = k\n\n return is_hit, is_sunk, ship_sunk","def _coord(self, x, y):\n gridEdge = 7 # originally 5\n y = gridEdge - y\n cx = 100 * (x - 1) + 50\n cy = 100 * (y - 1) + 50\n r = 20\n return (cx - r, cy - r, cx + r, cy + r)","def position(self):\n return self.x, self.y","def get_hit_box(self):\n hit_box = self.player_image.get_rect()\n hit_box[0] = self.player_position[\"x\"]\n hit_box[1] = self.player_position[\"y\"]\n return hit_box","def getRandomPosition(self):\n x = random.randint(0, self.width - 1)\n y = random.randint(0, self.height - 1)\n return Position(x, y)","def do_unsafe(self):\r\n if(not self.isLegal()):\r\n raise IllegalMoveException(self.whyNotLegal())\r\n pawn = self.startCell.takePawn()\r\n self.endCell.placePawn(pawn)","def get_xy(self, x, y):\r\n\t\treturn self.grid[y, x]","def to_pygame(self, p):\n return int(p.x), int(-p.y+600)","def _get_piece_center(self, piece_coord, piece, terrain_centers):\r\n if piece.type == PieceType.road:\r\n # these pieces are on edges\r\n tile_id = hexgrid.nearest_tile_to_edge(piece_coord)\r\n tile_coord = hexgrid.tile_id_to_coord(tile_id)\r\n direction = hexgrid.tile_edge_offset_to_direction(piece_coord - tile_coord)\r\n terrain_x, terrain_y = terrain_centers[tile_id]\r\n angle = 60*self._edge_angle_order.index(direction)\r\n dx = math.cos(math.radians(angle)) * self.distance_tile_to_edge()\r\n dy = math.sin(math.radians(angle)) * self.distance_tile_to_edge()\r\n return terrain_x + dx, terrain_y + dy, angle + 90\r\n elif piece.type in [PieceType.settlement, PieceType.city]:\r\n # these pieces are on nodes\r\n tile_id = hexgrid.nearest_tile_to_node(piece_coord)\r\n tile_coord = hexgrid.tile_id_to_coord(tile_id)\r\n direction = hexgrid.tile_node_offset_to_direction(piece_coord - tile_coord)\r\n terrain_x, terrain_y = terrain_centers[tile_id]\r\n angle = 30 + 60*self._node_angle_order.index(direction)\r\n dx = math.cos(math.radians(angle)) * self._tile_radius\r\n dy = math.sin(math.radians(angle)) * self._tile_radius\r\n return terrain_x + dx, terrain_y + dy, 0\r\n elif piece.type == PieceType.robber:\r\n # these pieces are on tiles\r\n tile_id = hexgrid.tile_id_from_coord(piece_coord)\r\n terrain_x, terrain_y = terrain_centers[tile_id]\r\n return terrain_x, terrain_y, 0\r\n else:\r\n logging.warning('Unknown piece={}'.format(piece))","def setup_player_position(world, empty, player):\n\n position = [0, 0]\n is_valid = False\n\n while not is_valid:\n position[0] = randint(0, len(world) - 1)\n position[1] = randint(0, len(world) - 1)\n\n if world[position[0]][position[1]] == empty:\n is_valid = True\n world[position[0]][position[1]] = player\n\n return position","def _checkPlayer(self):\r\n pawn = self.startCell.getPawn()\r\n if(not pawn.owner == self.player):\r\n message = (\"Player (%r) is not allowed to move that pawn (%r)\" %\r\n (self.player, pawn))\r\n raise IllegalMoveException(message)","def get_position(self, position):","def calculate_entry_exit(self, pos_y, pos_x):\r\n return (pos_y * 70 + 35), (pos_x * 70 + 35)","def coordinate(self):\n\t\tif self.boldness_coord is None and self.price_coord is None and self.hold_coord is None:\n\t\t\treturn None\n\n\t\treturn (self.boldness_coord, self.price_coord, self.hold_coord)","def room_at(self, x, y):\r\n return self.__maze[x][y]","def input_stone_position():\n p_1 = input(\"input first co-ordinate, range 0 to 7:\")\n p_2 = input(\"input second co-ordinate, range 0 to 7:\")\n # if input is anything else but 1 2 3 4 5 6 7 8 9 0 ipython shell returns a ValueError\n\n try:\n return (int(p_1), int(p_2))\n except ValueError as val_err:\n print(\"A ValueError occured with message {}\".format(val_err))\n print(\"You should input something like 1 (then press ENTER) 5 (then press ENTER).\")\n repeat = input(\"Do you want to try again [type t] or end the game [type e] or continue [type what you want]?\")\n if repeat == 't':\n return input_stone_position()\n elif repeat == 'e':\n print(\"Press ctrl + c to end the game.\")"],"string":"[\n \"def add_a_pawn(self, player, pos_x, pos_y)-> bool:\\n if not pos_x in range(0, len(self.grid)) \\\\\\n or not pos_y in range(0, len(self.grid)):\\n return False\\n if self.grid[pos_x][pos_y].color is None:\\n for index_x in range(-1, 2):\\n for index_y in range(-1, 2):\\n other_pos_x = pos_x + index_x\\n other_pos_y = pos_y + index_y\\n if other_pos_x < 0 or other_pos_y < 0:\\n continue\\n if other_pos_x >= self.grid_length or other_pos_y >= self.grid_length:\\n continue\\n if not self.grid[other_pos_x][other_pos_y].color is None:\\n self.grid[other_pos_x][other_pos_y].change_color(player.color)\\n self.grid[pos_x][pos_y].change_color(player.color)\\n self.last_move.append((pos_x, pos_y))\\n return True\\n else:\\n return False\",\n \"def respawn(self, xrespawn, yrespawn):\\n # If we are in the middle of respawning, this is non-zero.\\n self.respawning = 1\\n #self.center_x = SCREEN_WIDTH / 2\\n #self.center_y = SCREEN_HEIGHT / 2\\n\\n self.center_x = xrespawn\\n self.center_y = yrespawn\\n\\n self.angle = 0\\n\\n self.cur_health = self.max_health\",\n \"def get_piece(self, x, y):\\n if self.in_bounds(x, y) and self.piece_at(x, y):\\n return self.__board[(x, y)]\\n return None\",\n \"def move_pawn(pos, game):\\n #Convert coordinates to row and column\\n row = int(pos[1]//(SQUARESIZE+FENCEWIDTH))\\n col = int(pos[0]//(SQUARESIZE+FENCEWIDTH))\\n #Make move\\n game.move_pawn(game.get_player_turn(), (col,row))\",\n \"def select_square(board: Board, n: int, pawn_value: int) -> Tuple[int, int]:\\n\\n print(\\\"Select a square where you may want to put a pawn.\\\")\\n x = sanitized_int_input(\\\"Its x coordinates: \\\")\\n y = sanitized_int_input(\\\"Its y coordinates: \\\")\\n\\n if square_valid(board, n, pawn_value, x, y):\\n return x, y\\n else:\\n print(\\\"You can't put a pawn here, sorry. Please, retry.\\\")\\n return select_square(board, n, pawn_value)\",\n \"def random_position(self):\\n while True:\\n h = random.randrange(0, self.height)\\n w = random.randrange(0, self.width)\\n if self.grid[h, w] == 0:\\n return (h, w)\",\n \"def __generate_spawn_points(self):\\n while True:\\n p1x = random.randint(0, self.width - 1)\\n p1y = random.randint(0, self.height - 1)\\n p2x, p2y = self.__mirror(p1x, p1y)\\n d_sq = (p1x - p2x)**2 + (p1y - p2y)**2\\n if d_sq >= (self.width / 2)**2:\\n break\\n return (p1x, p1y), (p2x, p2y)\",\n \"def locate(x, y):\\n position(x * 6, y)\",\n \"def spawn(self):\\n (x_coord, y_coord) = (0, 0)\\n grid_x = SCREEN_X // self.size\\n grid_y = SCREEN_Y // self.size\\n while x_coord < EDGE + 5 or x_coord > SCREEN_X - self.size - EDGE - 5:\\n x_coord = random.randrange(grid_x) * self.size\\n while y_coord < EDGE + 5 or y_coord > SCREEN_Y - self.size - EDGE - 5:\\n y_coord = random.randrange(grid_y) * self.size\\n return (x_coord, y_coord)\",\n \"def respawn_player(self):\\n self.rect.x = 50\\n self.rect.y = 50\\n \\n # Specifies the Player's spawnpoint as maze_arrangement[1][1], representing\\n # the tile in the top-left corner of the maze\\n self.__user_x = 1\\n self.__user_y = 1\",\n \"def put_pawn_at(board: Board, pawn_value: int, x: int, y: int) -> None:\\n\\n board[y][x] = 1 if argv[2] is '0' else pawn_value\",\n \"def get_clicked_tile(self, x: int, y: int) -> Optional[Point]:\\n\\t\\ttile_x = x//(self.canvas_width//self.board_size)\\n\\t\\ttile_y = y//(self.canvas_height//self.board_size)\\n\\n\\t\\tif tile_x < 0 or tile_x >= self.board_size or tile_y < 0 or tile_y >= self.board_size:\\n\\t\\t\\treturn None\\n\\t\\telse:\\n\\t\\t\\treturn Point(tile_x, tile_y)\",\n \"def player_location(self):\\n x = 0\\n y = 0\\n for line in self.grid:\\n for i in line:\\n if i == \\\"P\\\":\\n return x, y\\n \\n y+=1\\n x += 1\\n y = 0\",\n \"def get_random_empty_location(player_x, player_y, min_distance_from_player):\\n empty_locations = []\\n for row in range(height):\\n for column in range(width):\\n if False: # TODO: Replace False with condition that checks that location (column, row) is empty and at least min_distance_from_player squares from the player.\\n # TODO: Add the empty location tuple to the list of empty locations.\\n pass\\n # TODO: If the list of empty locations is empty, return None.\\n # TODO: Otherwise, return one of the location tuples from the list.\",\n \"def get_random_position(self):\\n if self._geometry_type in ['area', 'circle']:\\n geo = self.get_geometry()\\n min_x, min_y, max_x, max_y = geo.bounds\\n pnt = Point(\\n random.uniform(min_x, max_x), \\n random.uniform(min_y, max_y))\\n while not geo.contains(pnt):\\n pnt = Point(\\n random.uniform(min_x, max_x), \\n random.uniform(min_y, max_y))\\n return pnt\\n else:\\n return None\",\n \"def __get_random_player_position(self) -> Tuple[int, int]:\\n no_player_position = True\\n while no_player_position:\\n for row in range(0, self.__labyrinth.labyrinth_height):\\n for col in range(0, self.__labyrinth.labyrinth_width):\\n if self.__labyrinth[row][col] == Labyrinth.FLOOR and no_player_position:\\n self.__row_position = row\\n self.__col_position = col\\n\\n if len(self.__path_to_end()) > self.__labyrinth.labyrinth_width and \\\\\\n len(self.__path_to_end()) > self.__labyrinth.labyrinth_height:\\n self.__labyrinth[row][col] = Labyrinth.START\\n no_player_position = False\\n\\n return self.__row_position, self.__col_position\",\n \"def getKickingPosition():\\n pass\",\n \"def _input_coords(game,player):\\r\\n print(Player.get_name(player)+'('+Player.get_spec(player)+')'+\\\" it's your turn\\\")\\r\\n coords = input(\\\"coords of cell? \\\")\\r\\n coords = coords.split(',')\\r\\n try :\\r\\n x = int(coords[0])\\r\\n y = int(coords[1])\\r\\n if game[x][y] == '' : \\r\\n return (x,y)\\r\\n except :\\r\\n return _input_coords(game,player)\\r\\n print('illegal play, choose an empty cell')\\r\\n return _input_coords(game,player)\",\n \"def get_piece(self, selected_piece_coords):\\n for piece in self.game_pieces:\\n if selected_piece_coords[0] == piece.x and selected_piece_coords[1] == piece.y:\\n return piece.clone()\\n return None\",\n \"def last_pos(self) -> tuple[int, int]:\\n if not self.actions:\\n return (self.start_x, self.start_y)\\n else:\\n box = self.get_hitbox_at(self.time_consumed)\\n return box.pos_x, box.pos_y\",\n \"def default_location(self, thing):\\n if isinstance(thing, Agent):\\n return (1, 1)\\n else:\\n get_rand = lambda arg: random.choice(range(1, arg-1))\\n while True:\\n xloc, yloc = (get_rand(self.width), get_rand(self.height))\\n if (1, 1) == (xloc, yloc):\\n continue\\n break\\n return (xloc, yloc)\",\n \"def firstMove(board):\\r\\n x = board.size / 2\\r\\n return (x, x)\",\n \"def getPoint(self):\\n return Point(*self.position)\",\n \"def get_absolute_pos(x, y, base):\\n\\n # give a small deadzone\\n new_x = base[0] + (int(x / 2) if abs(x) > 2 else 0)\\n new_y = base[1] - (int(y / 2) if abs(y) > 2 else 0)\\n\\n return (new_x, new_y)\",\n \"def respawn(x,y):\\n\\t\\tpos = Board.prev_j+1\\n\\t\\twhile pos<y:\\n\\t\\t\\tif (Board.board[x][pos]==' ' or Board.board[x][pos]=='.') and Board.board[x+1][pos]!='-':\\n\\t\\t\\t\\tBoard.board[x][pos]='M'\\n\\t\\t\\t\\tbreak\\n\\t\\t\\tpos+=1\",\n \"def random_position(self):\\n\\t\\treturn (random.randint(1, self.max_x-2), random.randint(1,self.max_y-2))\",\n \"def draw_X():\\r\\n x,y = pygame.mouse.get_pos()\\r\\n x = 3*x/300\\r\\n y = 3*y/300\\r\\n x = approximate(x)\\r\\n y = approximate(y)\\r\\n pos_x = 0\\r\\n pos_y = 0\\r\\n if x == 50:pos_x = 0\\r\\n elif x == 150:pos_x=1\\r\\n elif x == 250:pos_x=2\\r\\n if y == 50:pos_y=0\\r\\n elif y == 150:pos_y=1\\r\\n elif y == 250:pos_y=2\\r\\n if positions[pos_y][pos_x] == 0:\\r\\n positions[pos_y][pos_x] = -1\\r\\n pygame.draw.line(screen,(255,255,255),(x-40,y-40),(x+40,y+40),10)\\r\\n pygame.draw.line(screen,(255,255,255),(x+40,y-40),(x-40,y+40),10)\\r\\n players.reverse()\\r\\n else: \\r\\n print('the spot was occupied')\\r\\n time.sleep(.25)\",\n \"def respawn(self):\\n # If we are in the middle of respawning, this is non-zero.\\n self.respawning = 1\\n self.center_x = SCREEN_WIDTH / 2\\n self.center_y = 600\",\n \"def get_pos(self, off_w=0, off_l=0, off_h=0):\\n try:\\n return self.world_grid[self.w + off_w][self.l + off_l][self.h + off_h]\\n except IndexError:\\n return blocks['wall']\",\n \"def spawn(self, y, x, h, w):\\n self.pos = (np.random.randint(y, y + h), np.random.randint(x, x + w))\",\n \"def get_piece(self, position):\\n return self.board[position[0]][position[1]]\",\n \"def respawn(self):\\n # If we are in the middle of respawning, this is non-zero.\\n self.respawning = 1\\n self.center_x = SCREEN_WIDTH / 2\\n self.center_y = SCREEN_HEIGHT / 2\\n self.angle = 0\",\n \"def innerSpawn( self, tCoords, result, argsList ):\\n\\t\\tbPaint = True\\n\\t\\tbContinue = True\\n\\t\\tpCurrent = gc.getMap().plot(tCoords[0], tCoords[1])\\n\\t\\tif pCurrent.isHills() or pCurrent.isFlatlands():\\n\\t\\t\\tif pCurrent.getTerrainType() != con.iWetland:\\n\\t\\t\\t\\tif not pCurrent.isCity() and not pCurrent.isUnit():\\n\\t\\t\\t\\t\\tbClean = True\\n\\t\\t\\t\\t\\tfor x in range(tCoords[0] - 1, tCoords[0] + 2):\\t\\t# from x-1 to x+1\\n\\t\\t\\t\\t\\t\\tfor y in range(tCoords[1] - 1, tCoords[1] + 2):\\t# from y-1 to y+1\\n\\t\\t\\t\\t\\t\\t\\tif gc.getMap().plot(x,y).isUnit():\\n\\t\\t\\t\\t\\t\\t\\t\\tbClean = False\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\tif bClean:\\n\\t\\t\\t\\t\\t\\tif pCurrent.getOwner() in argsList:\\n\\t\\t\\t\\t\\t\\t\\t# this is a good plot, so paint it and continue search\\n\\t\\t\\t\\t\\t\\t\\treturn (None, bPaint, bContinue)\\n\\t\\t# not a good plot, so don't paint it but continue search\\n\\t\\treturn (None, not bPaint, bContinue)\",\n \"def random_position(width, height):\\n x = random.randrange(0, width)\\n y = random.randrange(0, height)\\n return x,y\",\n \"def get_center_position( peg, position_on_peg):\\n x = Hanoi.FIRST_TOWER_X + peg * Hanoi.DISTANCE_BETWEEN_TOWER\\n y = position_on_peg * Hanoi.DISK_HEIGHT + 0.5 * Hanoi.DISK_HEIGHT\\n return (x, y)\",\n \"def pupil_left_coords(self):\\n if self.pupils_located:\\n x = self.eye_left.origin[0] + self.eye_left.pupil.x + self.x_add\\n y = self.eye_left.origin[1] + self.eye_left.pupil.y + self.y_add\\n return (x, y)\",\n \"def get_cell(self, x, y):\\n if y < 0 or y >= len(self.g): return None\\n if x < 0 or x >= len(self.g[y]): return None\\n return self.g[y][x]\",\n \"def room_xy(room, x, y, value=None):\\n return room[x][y]\",\n \"def assign_spawn_point(self) -> StaticTile:\\n spawn_tile = self.spawn_points[self.active_spawns]\\n self.active_spawns += 1\\n return spawn_tile\",\n \"def board_empty_positions(self, x, y):\\n board = self.boards[x][y]\\n coords = [(x, y, i, j) for (i, j) in board.empty_squares]\\n return self.coords_to_positions(coords)\",\n \"def outerSpawn( self, tCoords, result, argsList ):\\n\\t\\tbPaint = True\\n\\t\\tbContinue = True\\n\\t\\tpCurrent = gc.getMap().plot(tCoords[0], tCoords[1])\\n\\t\\tif pCurrent.isHills() or pCurrent.isFlatlands():\\n\\t\\t\\tif pCurrent.getTerrainType() != con.iWetland:\\n\\t\\t\\t\\tif not pCurrent.isCity() and not pCurrent.isUnit():\\n\\t\\t\\t\\t\\tbClean = True\\n\\t\\t\\t\\t\\tfor x in range(tCoords[0] - 1, tCoords[0] + 2):\\t\\t# from x-1 to x+1\\n\\t\\t\\t\\t\\t\\tfor y in range(tCoords[1] - 1, tCoords[1] + 2):\\t# from y-1 to y+1\\n\\t\\t\\t\\t\\t\\t\\tif gc.getMap().plot(x,y).isUnit():\\n\\t\\t\\t\\t\\t\\t\\t\\tbClean = False\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\tif bClean:\\n\\t\\t\\t\\t\\t\\tif pCurrent.calculateCulturalOwner() == -1: # edead: bugfix\\n\\t\\t\\t\\t\\t\\t\\t# this is a good plot, so paint it and continue search\\n\\t\\t\\t\\t\\t\\t\\treturn (None, bPaint, bContinue)\\n\\t\\t# not a good plot, so don't paint it but continue search\\n\\t\\treturn (None, not bPaint, bContinue)\",\n \"def random_empty_position(current_animal, grid_size, all_animals):\\n all_neighbors = list_neighbors(current_animal.row, current_animal.col,\\n grid_size)\\n\\n occupied = set()\\n for x in all_animals:\\n occupied.add((x.row, x.col))\\n\\n neighbors = []\\n for x in all_neighbors:\\n if x not in occupied:\\n neighbors.append(x)\\n\\n if len(neighbors) == 0:\\n return None\\n\\n row, col = my_random_choice(neighbors)\\n return (row, col)\",\n \"def make_position(data) -> Position:\\n return (data[\\\"x\\\"], data[\\\"y\\\"])\",\n \"def _get_piece_at_opening_or_none(self, x, y):\\n if self._is_valid_opening(x, y):\\n return self._openings[x][y]\\n else:\\n return Piece.NONE\",\n \"def __get_random_hotspot(self):\\n x_min = self.occupancy_map.info.origin.position.x\\n x_max = x_min + self.occupancy_map.info.width * self.occupancy_map.info.resolution\\n y_min = self.occupancy_map.info.origin.position.y\\n y_max = y_min + self.occupancy_map.info.height * \\\\\\n self.occupancy_map.info.resolution\\n # This might bes a bit strange, but we have the following problem:\\n # some simulators need a square version of the same map. A square version\\n # will have other x_max or y_max and thus the random hotspots will be different.\\n # TO prevent this, we will always take only the max value of either x_max or y_max.\\n # This will be the same for the square version and the not-square version (of the same map).\\n max_value = max(x_max, y_max)\\n\\n # search for a not occupied position\\n while True:\\n # previously: x = random.uniform(x_min, x_max) # see problem description above\\n x = random.uniform(x_min, max_value)\\n # previously: y = random.uniform(y_min, y_max) # see problem description above\\n y = random.uniform(y_min, max_value)\\n # due to the workaround for the problem above, it can be that the value is out\\n # of map for the not square map version. We need to skip this (the square\\n # map version will skip it due to occupied cell...):\\n if x <= x_max and y <= y_max:\\n cell_x = min(int(\\n (x - x_min) / self.occupancy_map.info.resolution), self.occupancy_map.info.width - 1)\\n cell_y = min(int(\\n (y - y_min) / self.occupancy_map.info.resolution), self.occupancy_map.info.height - 1)\\n if not self.__cell_is_occupied(cell_x, cell_y):\\n break\\n spread = random.uniform(0.5, 1.0)\\n return (x, y, spread)\",\n \"def pickPlace(distx = 10,disty = 10, midDist = 20,defaultHeight= -70,linHeight = 10, robotHeight = -90):\\n pickPlacePos = []\\n yCount = [0, 1]\\n xCount = [-1,0,1]\\n for numx in xCount:\\n for numy in yCount:\\n pickPlacePos.append([numx*distx, numy*disty-midDist, robotHeight+linHeight,0,0,0,'lin'])\\n pickPlacePos.append([numx*distx, numy*disty-midDist, robotHeight,0,0,0,'mov'])\\n pickPlacePos.append([numx*distx, numy*disty-midDist, robotHeight+linHeight,0,0,0,'lin'])\\n\\n pickPlacePos.append([numx*distx, 0, defaultHeight,0,0,0,'mov'])\\n\\n pickPlacePos.append([numx*distx, numy*disty+midDist, robotHeight+linHeight,0,0,0,'lin'])\\n pickPlacePos.append([numx*distx, numy*disty+midDist, robotHeight,0,0,0,'mov'])\\n pickPlacePos.append([numx*distx, numy*disty+midDist, robotHeight+linHeight,0,0,0,'lin'])\\n\\n pickPlacePos.append([numx*distx, 0, defaultHeight,0,0,0,'mov'])\\n\\n pickPlacePos.append([0,0,-127,0,0,0,'mov'])\\n return pickPlacePos\",\n \"def get_pawn_moves(self, state):\\n pawn_moves = []\\n\\n if self.color == cc.WHITE_ACTIVE:\\n forward_1 = add_vectors(self.coord, cc.V_UP)\\n forward_2 = add_vectors(self.coord, cc.V_UP_2)\\n attacks = get_crawler_moves(self.coord, cc.W_PAWN_CAPTURE_VECTORS)\\n starting_rank = cc.RANK_2\\n promo_rank = cc.RANK_8\\n promo_pieces = cc.WHITE_PROMO\\n enemy_set = cc.BLACK_PIECES\\n elif self.color == cc.BLACK_ACTIVE:\\n forward_1 = add_vectors(self.coord, cc.V_DOWN)\\n forward_2 = add_vectors(self.coord, cc.V_DOWN_2)\\n attacks = get_crawler_moves(self.coord, cc.B_PAWN_CAPTURE_VECTORS)\\n starting_rank = cc.RANK_7\\n promo_rank = cc.RANK_1\\n promo_pieces = cc.BLACK_PROMO\\n enemy_set = cc.WHITE_PIECES\\n else:\\n raise Exception(\\\"get_pawn_moves: Invalid Piece Color\\\")\\n\\n if validate_move(forward_1) and state.board[forward_1] == cc.NO_PIECE:\\n if forward_1[0] == promo_rank:\\n for p in promo_pieces:\\n pawn_moves.append(cc.Action(self.string, self.coord, forward_1, promo=p))\\n else:\\n pawn_moves.append(cc.Action(self.string, self.coord, forward_1))\\n if self.coord[0] == starting_rank and validate_move(forward_2) and state.board[forward_2] == cc.NO_PIECE:\\n pawn_moves.append(cc.Action(self.string, self.coord, forward_2, en_p=forward_1))\\n\\n for attack in attacks:\\n if state.board[attack] in enemy_set:\\n if attack[0] == promo_rank:\\n for p in promo_pieces:\\n pawn_moves.append(cc.Action(self.string, self.coord, attack, capture=True, promo=p))\\n else:\\n pawn_moves.append(cc.Action(self.string, self.coord, attack, capture=True))\\n # Make sure Pawns can attack en_passant squares\\n elif attack == state.en_passant:\\n pawn_moves.append(cc.Action(self.string, self.coord, attack, capture=True))\\n\\n return pawn_moves\",\n \"def position_to_stone(self, position):\\n if len(position) != 2:\\n stone = -1\\n return stone\\n h = position[0]\\n w = position[1]\\n stone = h * self.width + w\\n if stone not in self.blanks:\\n stone = -1 # -1 means the current position is blank.\\n return stone\",\n \"def getRandomPosition(self):\\n\\n #random.seed(1)#for repeatable results.\\n #pos[0] = random.randint(0, self.width-1) # -1 since randint Returns a random integer N such that a <= N <= b.\\n #pos[1] = random.randint(0, self.height-1)# -1 since randint Returns a random integer N such that a <= N <= b.\\n #above solution uses ints and returns random tile positions, not random positions.\\n #NB: must use init method of Potion object\\n return Position(random.random()*self.width, random.random()*self.height)\\n #raise NotImplementedError #refer https://docs.python.org/2/library/exceptions.html\",\n \"def crearParedX(self, posx, posy):\\n\\n # Marco el punto como nodo y guardo\\n k = (3, self.matrixMAPA[posx][posy][1])\\n self.matrixMAPA[posx][posy] = k\\n\\n\\n # Pinto hacia -x hasta que termine o hasta que encuentre un muro\\n for i in range(0, posy):\\n \\n iterator = (posy-1) - i\\n # Capturo el punto\\n # Si no es pared continue\\n k = self.matrixMAPA[posx][iterator]\\n # Si el valor esta permitido pinte si no termine\\n if k[0] != 1 and k[0] != 2 and k[0] != 3:\\n # Marco como pared\\n alpha = (2, self.matrixMAPA[posx][iterator][1])\\n # Guardo lo marcado\\n self.matrixMAPA[posx][iterator] = alpha\\n else:\\n break\\n\\n # Pinto hacia +x \\n for j in range(posy+1, len(self.matrixMAPA[posx])):\\n # Capturo el valor\\n k = self.matrixMAPA[posx][j]\\n # Si el valor esta permito pinte \\n if k[0] != 1 and k[0] != 2 and k[0] != 3:\\n # marco como pared\\n alpha = (2, self.matrixMAPA[posx][j][1])\\n # Guardo\\n self.matrixMAPA[posx][j] = alpha\\n else:\\n break\",\n \"def get_pos(self):\\n return (self.x, self.y)\",\n \"def return_cell(self):\\n\\n pos = pygame.mouse.get_pos()\\n\\n x = pos[1] // (self.cell_size+1)\\n y = pos[0] // (self.cell_size+1)\\n\\n return self.grid[x][y]\",\n \"def getPossibleMoves(self): # called to get possible positions this piece can go\\r\\n \\r\\n moves = {}\\r\\n\\r\\n ids = []\\r\\n\\r\\n for piece in self.board.pieces.values():\\r\\n if piece.name == \\\"empty\\\":\\r\\n piece.glow = False\\r\\n piece.ready = False\\r\\n\\r\\n self.piece = self\\r\\n\\r\\n def check(direction=\\\"left\\\", heading=\\\"north\\\", x=None, y=None):\\r\\n piece = self.piece\\r\\n if direction == \\\"left\\\": x -= 50\\r\\n else: x += 50\\r\\n\\r\\n if heading == \\\"north\\\": y -= 50\\r\\n else: y += 50\\r\\n\\r\\n if (x, y) in self.board.pieces: # position is empty\\r\\n empty = self.board.getPiece((x, y))\\r\\n empty.glow = True\\r\\n old, new, obj = (direction, heading), (x, y), piece\\r\\n identity = self.getRandomID(ids) # get an ID for the move\\r\\n moves[identity] = old, new, obj\\r\\n\\r\\n if piece.isKing: # piece is a king, so go on\\r\\n check(direction, heading, x, y)\\r\\n else: # its not empty, so check if its comrade\\r\\n x1, y1 = x+25, y+25\\r\\n piece2 = self.board.getPiece((x1, y1))\\r\\n try:\\r\\n if piece.isComrade(piece2):# piece is comrade so return\\r\\n return\\r\\n else: # piece is not comrade, so check empty\\r\\n if direction == \\\"left\\\": x2 = x1-25-50\\r\\n else: x2 = x1-25+50\\r\\n\\r\\n if heading == \\\"north\\\": y2 = y1-25-50\\r\\n else: y2 = y1-25+50\\r\\n\\r\\n if (x2, y2) in self.board.pieces: # its empty, so notify player\\r\\n empty = self.board.getPiece((x2, y2))\\r\\n empty.glow = True\\r\\n empty.ready = True\\r\\n\\r\\n old, new, obj = (direction, heading), (x2, y2), piece2\\r\\n identity = self.getRandomID(ids)\\r\\n moves[identity] = old, new, obj\\r\\n\\r\\n check(direction, heading, piece2.x-25, piece2.y-25)\\r\\n check(direction, heading, x2, y2)\\r\\n \\r\\n # check empty or comrade again\\r\\n if direction == \\\"left\\\": x3 = x2-50\\r\\n else: x3 = x2+50\\r\\n\\r\\n if heading == \\\"north\\\": y3 = y2-50\\r\\n else: y3 = y2+50\\r\\n\\r\\n if (x3, y3) in self.board.pieces: # positon(address) is empty\\r\\n return\\r\\n else: # there is a piece, so check if comrade, stop, if not comrade continue\\r\\n x3+=25\\r\\n y3+= 25\\r\\n\\r\\n piece3 = self.board.getPiece((x3, y3))\\r\\n if piece3.isComrade(piece2): # comrades, so stop\\r\\n return\\r\\n else: # not comrades, so continue\\r\\n self.piece = piece3\\r\\n check(direction, heading, x, y)\\r\\n\\r\\n #self.piece = piece2\\r\\n \\r\\n #check(direction, heading, x2, y2) # keep searching\\r\\n else: # its not empty, so return\\r\\n return\\r\\n except:\\r\\n pass\\r\\n\\r\\n if self.piece.name == \\\"white\\\": direction = \\\"north\\\"\\r\\n else: direction = \\\"south\\\"\\r\\n \\r\\n check(\\\"left\\\", direction, self.piece.x-25, self.piece.y-25)\\r\\n check(\\\"right\\\", direction, self.piece.x-25, self.piece.y-25)\\r\\n \\r\\n if self.piece.isKing:\\r\\n if self.piece.name == \\\"white\\\": heading = \\\"south\\\"\\r\\n else: heading = \\\"north\\\"\\r\\n \\r\\n check(\\\"left\\\", heading, self.piece.x-25, self.piece.y-25)\\r\\n check(\\\"right\\\", heading, self.piece.x-25, self.piece.y-25)\\r\\n\\r\\n if self.piece.name == \\\"white\\\":\\r\\n eatMoves = self.board.game.thinkEatMoves(moves, \\\"person\\\")\\r\\n if eatMoves is not None:\\r\\n return eatMoves\\r\\n\\r\\n return moves\",\n \"def __occupy(self, x, y, player):\\n queue = [(x, y)]\\n area = []\\n closed = True\\n while closed and len(queue) > 0:\\n (x, y) = queue.pop(0)\\n if (x, y) in area:\\n continue\\n area.append((x, y))\\n #print(\\\"Q: \\\", queue)\\n #print(\\\"A: \\\", area)\\n # try to extend in possible directions\\n if not self.has_border(x, y, \\\"top\\\"):\\n if y == 0: # leaving the board\\n closed = False\\n queue.append((x, y - 1))\\n if not self.has_border(x, y, \\\"right\\\"):\\n if x == self.__size - 1: # leaving the board\\n closed = False\\n queue.append((x + 1, y))\\n if not self.has_border(x, y, \\\"bottom\\\"):\\n if y == self.__size - 1: # leaving the board\\n closed = False\\n queue.append((x, y + 1))\\n if not self.has_border(x, y, \\\"left\\\"):\\n if x == 0: # leaving the board\\n closed = False\\n queue.append((x - 1, y))\\n\\n if closed: # closed area => occupy it by player\\n for (x, y) in area:\\n self.__board[y][x] += player * 16\\n self.__colored[player - 1] += 1\",\n \"def shuffle_pos(self, ):\\n x, y = 0, 0\\n while self.maze.structure[int(y / 40)][int(x / 40)] != \\\"0\\\" \\\\\\n or (x, y) in self.forbiden_tulpes:\\n x = random.randint(0, 14) * sprite_size\\n y = random.randint(0, 14) * sprite_size\\n self.forbiden_tulpes.append((x, y))\\n return x, y\",\n \"def get_pos(self, cx, cy):\\n x = self.min_x + cx*(self.size+0.5)\\n y = self.min_y + cy*(self.size+0.5)\\n return (x,y)\",\n \"def getpiece(self, x, y, z):\\n\\n for p in self.pieces:\\n if (p.x, p.y, p.z) == (x, y, z):\\n return p\",\n \"def random_location(self):\\r\\n\\r\\n while True:\\r\\n pt = (random.uniform(self.worldbox.tl[0], self.worldbox.br[0]),\\r\\n random.uniform(self.worldbox.tl[1], self.worldbox.br[1]))\\r\\n if not self.is_wall(pt) and not self.is_target(pt):\\r\\n return pt\",\n \"def pixel(self, x, y, color=None):\\n if not 0 <= x <= 4:\\n return None\\n if not 0 <= y <= 6:\\n return None\\n return super()._pixel(x, y, color)\",\n \"def initialCoordinates():\\r\\n return (-250,-250)\",\n \"def put_piece(self, x: int, y: int):\\n if self.game_board.board_values[x, y] != 0:\\n print(x, y)\\n raise exceptions.NonEmptySlotError(\\\"You must select a empty slot!\\\")\\n\\n self.game_board.put_piece(x, y, self.current_piece)\",\n \"def firstMove(self):\\n return (10, 10)\",\n \"def pos_as_point(self) -> Point:\\n return Point(self.x, self.y, 0)\",\n \"def _get_random_position(self):\\n return (random.randrange(0, self.maze.width),\\n random.randrange(0, self.maze.height))\",\n \"def get_penguin_placement(self, state: FishGameState):\\n return self.strategy.place_penguin(state=state)\",\n \"def position(x, y):\\n command([x + 0x80, y + 0x40])\",\n \"def get_position(self):\\n position = (self.position_x * SPRITE_SIZE, self.position_y * SPRITE_SIZE)\\n return position\",\n \"def get_our_tile(self, x, y):\\n\\t\\tif x >= 0 and x < self.w and y >= 0 and y < self.h:\\n\\t\\t\\treturn self.our_tiles[x][y]\\n\\t\\treturn None\",\n \"def is_pawn_move_valid(self, from_row, from_col, to_row, to_col):\\n # Setup variables used\\n piece = self.board.squares[from_row][from_col]\\n piece_color = self.piece_color(piece)\\n to_piece = self.board.squares[to_row][to_col]\\n row_diff = abs(from_row - to_row)\\n col_diff = abs(from_col - to_col)\\n dc = 0\\n\\n # Set flag for first move of pawn\\n first_move = True if from_row == 6 or from_row == 1 else False\\n\\n # If direction is not correct for white, exit\\n if to_row - from_row > 0:\\n dr = 1\\n if self.piece_color(piece) == \\\"white\\\":\\n return False\\n\\n # If direction is not correct for black, exit\\n if to_row - from_row < 0:\\n dr = -1\\n if self.piece_color(piece) == \\\"black\\\":\\n return False\\n\\n # If moving straight\\n if from_col == to_col:\\n # if not legal straight move, exit\\n if not (row_diff == 1 or (first_move and row_diff == 2)):\\n return False\\n\\n # make sure to move has no pieces on straight path\\n dm = row_diff + 1\\n\\n # return value\\n retVal = self._any_piece_in_way(from_row, from_col, dr, dc, dm)\\n\\n# if retVal and not self.testing:\\n# # self.pawn_promotion(to_row, to_col, piece_color)\\n# self.board.overwrite_board_square(to_row, to_col)\\n# if piece_color == \\\"black\\\":\\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\\n# else:\\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\\n\\n return retVal\\n\\n # WHITE en passant\\n # move from moveHistory => (\\\"piece\\\", fromRow, fromCol, toRow, toCol)\\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\\\\n self.moveHistory[-1][0] == \\\"♟\\\" and self.moveHistory[-1][1] == 1 and\\\\\\n self.moveHistory[-1][3] == 3 and piece_color == \\\"white\\\":\\n if col_diff == 1 and row_diff == 1 and to_piece == None:\\n if not self.testing:\\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\\n return True\\n\\n # BLACK en passant\\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\\\\n self.moveHistory[-1][0] == \\\"♙\\\" and self.moveHistory[-1][1] == 6 and\\\\\\n self.moveHistory[-1][3] == 4 and piece_color == \\\"black\\\":\\n if col_diff == 1 and row_diff == 1 and to_piece == None:\\n if not self.testing:\\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\\n return True\\n\\n # else move must be taking piece directly move\\n # if legal taking piece move and (opponent-already check for own piece) piece at to-square\\n if col_diff == 1 and row_diff == 1 and to_piece != None:\\n\\n# if not self.testing:\\n# # self.pawn_promotion(to_row, to_col, piece_color)\\n# self.board.overwrite_board_square(to_row, to_col)\\n# if piece_color == \\\"black\\\":\\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\\n# else:\\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\\n return True\\n\\n return False\",\n \"def outerSeaSpawn( self, tCoords, result, argsList ):\\n\\t\\tbPaint = True\\n\\t\\tbContinue = True\\n\\t\\tpCurrent = gc.getMap().plot(tCoords[0], tCoords[1])\\n\\t\\tif pCurrent.isWater() and not pCurrent.isLake(): # edead: no barbs in lakes!\\n\\t\\t\\tif not pCurrent.isCity() and not pCurrent.isUnit():\\n\\t\\t\\t\\tif pCurrent.calculateCulturalOwner() == -1: # edead: bugfix\\n\\t\\t\\t\\t\\tbClean = True\\n\\t\\t\\t\\t\\tfor x in range(tCoords[0] - 1, tCoords[0] + 2):\\t\\t# from x-1 to x+1\\n\\t\\t\\t\\t\\t\\tfor y in range(tCoords[1] - 1, tCoords[1] + 2):\\t# from y-1 to y+1\\n\\t\\t\\t\\t\\t\\t\\tif gc.getMap().plot(x,y).isUnit():\\n\\t\\t\\t\\t\\t\\t\\t\\tbClean = False\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\tif bClean:\\n\\t\\t\\t\\t\\t\\t# this is a good plot, so paint it and continue search\\n\\t\\t\\t\\t\\t\\treturn (None, bPaint, bContinue)\\n\\t\\t# not a good plot, so don't paint it but continue search\\n\\t\\treturn (None, not bPaint, bContinue)\",\n \"def xy_occupied(xy, board):\\n return True if board[xy[0]][xy[1]] else False\",\n \"def update(board: Board, pawn_value: int, x: int, y: int) -> None:\\n\\n put_pawn_at(board, pawn_value, x, y)\\n block_row(board, pawn_value, y)\\n block_column(board, pawn_value, x)\\n block_diagonals(board, pawn_value, x, y)\",\n \"def peek(self, pos_x, pos_y):\\n self.validate_position(pos_x, pos_y)\\n return self.map[pos_x][pos_y]\",\n \"def get(self, x: int, y: int, /) -> int:\",\n \"def getRandomPosition(self):\\n return Position(random.random()*self.w, random.random()*self.h)\",\n \"def get_tile_location(self):\\n if self.rect.x == 0:\\n tile_x = 0\\n elif self.rect.x % 32 == 0:\\n tile_x = (self.rect.x / 32)\\n else:\\n tile_x = 0\\n\\n if self.rect.y == 0:\\n tile_y = 0\\n elif self.rect.y % 32 == 0:\\n tile_y = (self.rect.y / 32)\\n else:\\n tile_y = 0\\n\\n return [tile_x, tile_y]\",\n \"def generate_point(width, height):\\n x = random.randrange(0 - OFFSET, width + OFFSET, 1)\\n y = random.randrange(0 - OFFSET, height + OFFSET, 1)\\n return (x, y)\",\n \"def _show_piece(self, x_pos, y_pos):\\n piece = self.board[x_pos, y_pos]\\n if isinstance(piece, Pawn): return '{}P'.format(piece.color[0])\\n elif isinstance(piece, Knight): return '{}N'.format(piece.color[0])\\n elif isinstance(piece, Bishop): return '{}B'.format(piece.color[0])\\n elif isinstance(piece, Rook): return '{}R'.format(piece.color[0])\\n elif isinstance(piece, Queen): return '{}Q'.format(piece.color[0])\\n elif isinstance(piece, King): return '{}K'.format(piece.color[0])\\n else: return ' '\",\n \"def get_position(self):\\n return (self.x_pos, self.y_pos)\",\n \"def guess(self, row, col) -> Tuple[int, Optional[ship.Ship]]:\\n my_ship: ship.Ship = self._board_matrix[row][col]\\n\\n # if my_ship is None the guess is a miss, otherwise its a hit\\n\\n # --------- BEGIN YOUR CODE ----------\\n\\n # This is exactly the same as Human.guess, just copy the code over\\n\\n # --------- END YOUR CODE ----------\",\n \"def assgin_pos(self, range_x, range_y, n_p):\\n # n_p random integers\\n pos_x = random.sample(range(0, int(100*n_p)), n_p)\\n # get a random number\\n tmp1 = random.uniform(0, 1)\\n # keep position in the range of x and looks \\\"very random\\\"\\n pos_x %= range_x - tmp1\\n # same procedure for y\\n pos_y = random.sample(range(0, int(100*n_p)), n_p)\\n tmp1 = random.uniform(0, 1)\\n pos_y %= range_y - tmp1\\n return pos_x, pos_y\",\n \"def spawn_point(self):\\n return self._spawn_point\",\n \"def _checkPawn(self):\\r\\n pawn = self.startCell.getPawn()\\r\\n if(not pawn.can_go_on(self.endCell)):\\r\\n message = (\\\"This pawn (%r) cannot go on this type of cell (%r)\\\" %\\r\\n (pawn, self.endCell.type))\\r\\n raise IllegalMoveException(message)\\r\\n return True\",\n \"def getRandomPosition(self):\\n\\t\\tp = Position(random.randrange(0, self.width), random.randrange(0, self.height))\\n\\t\\treturn p\",\n \"def shoot(self, point: Point) -> Tuple[bool, bool, ShipType]:\\n\\n # Shot off board\\n if not self.point_in_board(point):\\n raise InvalidShotException(f'{point} is not on the board')\\n\\n # Point has already been shot\\n elif self.point_is_shot(point):\\n raise InvalidShotException(f'{point} has already been shot')\\n\\n else:\\n self.shot_locations.add(point)\\n is_hit = True if point in self.all_ship_locations else False\\n is_sunk = False\\n ship_sunk = None\\n\\n if is_hit:\\n # find out which one of the ships was shot\\n for k, v in self.individual_ship_locations.items():\\n # if v was the ship that was shot\\n if point in v:\\n # remove the point from v\\n v.remove(point)\\n if len(v) == 0:\\n is_sunk = True\\n ship_sunk = k\\n\\n return is_hit, is_sunk, ship_sunk\",\n \"def _coord(self, x, y):\\n gridEdge = 7 # originally 5\\n y = gridEdge - y\\n cx = 100 * (x - 1) + 50\\n cy = 100 * (y - 1) + 50\\n r = 20\\n return (cx - r, cy - r, cx + r, cy + r)\",\n \"def position(self):\\n return self.x, self.y\",\n \"def get_hit_box(self):\\n hit_box = self.player_image.get_rect()\\n hit_box[0] = self.player_position[\\\"x\\\"]\\n hit_box[1] = self.player_position[\\\"y\\\"]\\n return hit_box\",\n \"def getRandomPosition(self):\\n x = random.randint(0, self.width - 1)\\n y = random.randint(0, self.height - 1)\\n return Position(x, y)\",\n \"def do_unsafe(self):\\r\\n if(not self.isLegal()):\\r\\n raise IllegalMoveException(self.whyNotLegal())\\r\\n pawn = self.startCell.takePawn()\\r\\n self.endCell.placePawn(pawn)\",\n \"def get_xy(self, x, y):\\r\\n\\t\\treturn self.grid[y, x]\",\n \"def to_pygame(self, p):\\n return int(p.x), int(-p.y+600)\",\n \"def _get_piece_center(self, piece_coord, piece, terrain_centers):\\r\\n if piece.type == PieceType.road:\\r\\n # these pieces are on edges\\r\\n tile_id = hexgrid.nearest_tile_to_edge(piece_coord)\\r\\n tile_coord = hexgrid.tile_id_to_coord(tile_id)\\r\\n direction = hexgrid.tile_edge_offset_to_direction(piece_coord - tile_coord)\\r\\n terrain_x, terrain_y = terrain_centers[tile_id]\\r\\n angle = 60*self._edge_angle_order.index(direction)\\r\\n dx = math.cos(math.radians(angle)) * self.distance_tile_to_edge()\\r\\n dy = math.sin(math.radians(angle)) * self.distance_tile_to_edge()\\r\\n return terrain_x + dx, terrain_y + dy, angle + 90\\r\\n elif piece.type in [PieceType.settlement, PieceType.city]:\\r\\n # these pieces are on nodes\\r\\n tile_id = hexgrid.nearest_tile_to_node(piece_coord)\\r\\n tile_coord = hexgrid.tile_id_to_coord(tile_id)\\r\\n direction = hexgrid.tile_node_offset_to_direction(piece_coord - tile_coord)\\r\\n terrain_x, terrain_y = terrain_centers[tile_id]\\r\\n angle = 30 + 60*self._node_angle_order.index(direction)\\r\\n dx = math.cos(math.radians(angle)) * self._tile_radius\\r\\n dy = math.sin(math.radians(angle)) * self._tile_radius\\r\\n return terrain_x + dx, terrain_y + dy, 0\\r\\n elif piece.type == PieceType.robber:\\r\\n # these pieces are on tiles\\r\\n tile_id = hexgrid.tile_id_from_coord(piece_coord)\\r\\n terrain_x, terrain_y = terrain_centers[tile_id]\\r\\n return terrain_x, terrain_y, 0\\r\\n else:\\r\\n logging.warning('Unknown piece={}'.format(piece))\",\n \"def setup_player_position(world, empty, player):\\n\\n position = [0, 0]\\n is_valid = False\\n\\n while not is_valid:\\n position[0] = randint(0, len(world) - 1)\\n position[1] = randint(0, len(world) - 1)\\n\\n if world[position[0]][position[1]] == empty:\\n is_valid = True\\n world[position[0]][position[1]] = player\\n\\n return position\",\n \"def _checkPlayer(self):\\r\\n pawn = self.startCell.getPawn()\\r\\n if(not pawn.owner == self.player):\\r\\n message = (\\\"Player (%r) is not allowed to move that pawn (%r)\\\" %\\r\\n (self.player, pawn))\\r\\n raise IllegalMoveException(message)\",\n \"def get_position(self, position):\",\n \"def calculate_entry_exit(self, pos_y, pos_x):\\r\\n return (pos_y * 70 + 35), (pos_x * 70 + 35)\",\n \"def coordinate(self):\\n\\t\\tif self.boldness_coord is None and self.price_coord is None and self.hold_coord is None:\\n\\t\\t\\treturn None\\n\\n\\t\\treturn (self.boldness_coord, self.price_coord, self.hold_coord)\",\n \"def room_at(self, x, y):\\r\\n return self.__maze[x][y]\",\n \"def input_stone_position():\\n p_1 = input(\\\"input first co-ordinate, range 0 to 7:\\\")\\n p_2 = input(\\\"input second co-ordinate, range 0 to 7:\\\")\\n # if input is anything else but 1 2 3 4 5 6 7 8 9 0 ipython shell returns a ValueError\\n\\n try:\\n return (int(p_1), int(p_2))\\n except ValueError as val_err:\\n print(\\\"A ValueError occured with message {}\\\".format(val_err))\\n print(\\\"You should input something like 1 (then press ENTER) 5 (then press ENTER).\\\")\\n repeat = input(\\\"Do you want to try again [type t] or end the game [type e] or continue [type what you want]?\\\")\\n if repeat == 't':\\n return input_stone_position()\\n elif repeat == 'e':\\n print(\\\"Press ctrl + c to end the game.\\\")\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6292175","0.628745","0.61434907","0.61041254","0.6023498","0.60125977","0.59928966","0.5978027","0.5957675","0.59455156","0.5943654","0.5890515","0.58391374","0.5811578","0.5807527","0.57815","0.57768774","0.57580405","0.5754607","0.57248765","0.5722037","0.5657106","0.5655582","0.5655443","0.56396013","0.56387126","0.5634304","0.5633164","0.5624075","0.5611899","0.56016004","0.5598816","0.5589041","0.5585464","0.5577566","0.5570165","0.5563897","0.5559242","0.5553902","0.55453914","0.55410933","0.5539457","0.5533906","0.5527768","0.5515817","0.55092305","0.5498963","0.54977894","0.5493953","0.54910046","0.54866946","0.5477511","0.5473517","0.5464037","0.54589707","0.54353225","0.54235685","0.54206485","0.53984547","0.5386559","0.5385362","0.5380641","0.53703076","0.5369765","0.5367784","0.5361226","0.5358391","0.5355636","0.5351469","0.5342905","0.53370976","0.53355694","0.5335449","0.5327614","0.53263474","0.5326228","0.5325885","0.53230554","0.5320174","0.53183126","0.53181815","0.5309922","0.5308639","0.52985597","0.52973646","0.529334","0.5292807","0.5291434","0.5289749","0.5285891","0.52831197","0.5278541","0.5276351","0.52757263","0.5273823","0.5271783","0.52709526","0.52702016","0.5268249","0.52671766"],"string":"[\n \"0.6292175\",\n \"0.628745\",\n \"0.61434907\",\n \"0.61041254\",\n \"0.6023498\",\n \"0.60125977\",\n \"0.59928966\",\n \"0.5978027\",\n \"0.5957675\",\n \"0.59455156\",\n \"0.5943654\",\n \"0.5890515\",\n \"0.58391374\",\n \"0.5811578\",\n \"0.5807527\",\n \"0.57815\",\n \"0.57768774\",\n \"0.57580405\",\n \"0.5754607\",\n \"0.57248765\",\n \"0.5722037\",\n \"0.5657106\",\n \"0.5655582\",\n \"0.5655443\",\n \"0.56396013\",\n \"0.56387126\",\n \"0.5634304\",\n \"0.5633164\",\n \"0.5624075\",\n \"0.5611899\",\n \"0.56016004\",\n \"0.5598816\",\n \"0.5589041\",\n \"0.5585464\",\n \"0.5577566\",\n \"0.5570165\",\n \"0.5563897\",\n \"0.5559242\",\n \"0.5553902\",\n \"0.55453914\",\n \"0.55410933\",\n \"0.5539457\",\n \"0.5533906\",\n \"0.5527768\",\n \"0.5515817\",\n \"0.55092305\",\n \"0.5498963\",\n \"0.54977894\",\n \"0.5493953\",\n \"0.54910046\",\n \"0.54866946\",\n \"0.5477511\",\n \"0.5473517\",\n \"0.5464037\",\n \"0.54589707\",\n \"0.54353225\",\n \"0.54235685\",\n \"0.54206485\",\n \"0.53984547\",\n \"0.5386559\",\n \"0.5385362\",\n \"0.5380641\",\n \"0.53703076\",\n \"0.5369765\",\n \"0.5367784\",\n \"0.5361226\",\n \"0.5358391\",\n \"0.5355636\",\n \"0.5351469\",\n \"0.5342905\",\n \"0.53370976\",\n \"0.53355694\",\n \"0.5335449\",\n \"0.5327614\",\n \"0.53263474\",\n \"0.5326228\",\n \"0.5325885\",\n \"0.53230554\",\n \"0.5320174\",\n \"0.53183126\",\n \"0.53181815\",\n \"0.5309922\",\n \"0.5308639\",\n \"0.52985597\",\n \"0.52973646\",\n \"0.529334\",\n \"0.5292807\",\n \"0.5291434\",\n \"0.5289749\",\n \"0.5285891\",\n \"0.52831197\",\n \"0.5278541\",\n \"0.5276351\",\n \"0.52757263\",\n \"0.5273823\",\n \"0.5271783\",\n \"0.52709526\",\n \"0.52702016\",\n \"0.5268249\",\n \"0.52671766\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.8193444"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":94791,"cells":{"query":{"kind":"string","value":"Check if it's a win for player."},"document":{"kind":"string","value":"def winFor(self,player):\n if(self.cachedWin == False):\n won = False;\n if(player==WHITE):\n for x in range(0,WIDTH):\n if(self.gameState[x,0]==WHITE):\n won = True\n \n elif(player==BLACK):\n for x in range(0,WIDTH):\n if(self.gameState[x,HEIGHT-1]==BLACK):\n won = True\n \n if(len(self.successors()) == 0):#IF there are no available moves for both players\n bCount = self.count(BLACK) #check who has the most pawns\n wCount = self.count(BLACK)\n if(bCount>wCount):\n self.cachedWin = True\n self.cachedWinner = player\n return True\n if(wCount>bCount):\n self.cachedWin = True\n self.cachedWinner = player\n return True\n \n if(won):\n self.cachedWin = True\n self.cachedWinner = player\n return True\n else:\n return False\n else:\n return player == self.cachedWinner"},"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 has_won(board, player):\r\n return False","def has_won(board, player):\n return False","def checkForWin(self):\n w = self.getWinner()\n if w == PLAYER or w == AI:\n # self.printBoard()\n # print('%d'%w + ' won!')\n return\n if w == Tie:\n # print('Tie')\n return","def check_win(self, player):\n def check_row_win(player):\n for row in self.game_state:\n if player == row[0] == row[1] == row[2]:\n return True\n return False\n\n def check_column_win(player):\n # For doing a column check, transpose the grid and do a row check\n trans_game_state = numpy.transpose(self.game_state)\n for row in trans_game_state:\n if player == row[0] == row[1] == row[2]:\n return True\n return False\n\n def check_diag_win(player):\n # Left to right diagonal\n if player == self.game_state[0][0] == self.game_state[1][1] == self.game_state[2][2]:\n return True\n # Right to left diagonal\n if player == self.game_state[0][2] == self.game_state[1][1] == self.game_state[2][0]:\n return True\n return False\n\n if check_column_win(player) or check_diag_win(player) or check_row_win(player):\n return True\n return False","def win(self, player):\n if player == 1:\n a = self.player_one.moves\n else:\n a = self.player_two.moves\n winning_moves = []\n for i in range(1, 9, 3):\n winning_moves.append(range(i, i + 3))\n for i in range(1, 4):\n winning_moves.append(range(i, i + 7, 3))\n winning_moves.append([1, 5, 9])\n winning_moves.append([3, 5, 7])\n for move in winning_moves:\n flg = True\n for index in move:\n if index not in a:\n flg = False\n break\n if flg:\n return True, player\n if len(self.player_one.moves) + len(self.player_two.moves) == 9:\n self.print_space()\n self.display_board()\n self.print_space()\n print \" Games is drawn\"\n self.logging.debug(\"Game is draw, nobody won\")\n self.logging.debug(\"Enjoy the game again :)\")\n sys.exit(100)\n return False, player","def check_win(self, player):\n for win_pos in TicTacToe.win_pos:\n # for each winning position defined we take the set difference to the positions played be player\n # if there are not elements left after resulting set after difference operator\n # we get False as return. ie he has placed his marker in the winning positions which in turn makes him\n # the winner\n if not win_pos.difference(self.player_played_pos[player]):\n return True\n\n # if after checking for every winning positions if the control still reaches here,\n # the player has not marked the winning positions. returns False\n return False","def check_winner(self):\n pass","def hasWin(self) :\n comparison = self.compareNumberUser()\n if (comparison == 'equal') :\n return True\n else :\n return False","def is_game_over(self):\r\n\r\n if self.winner != 0:\r\n return True\r\n\r\n return False","def check_win_lose(self):\n if self.b.get_player_i() == 7: # player got to the bank\n return 1 # win\n if self.b.get_chaser_i() == self.b.get_player_i(): # chaser catch the player\n return 2 # lose\n return 0 # nothing","def checkForWin(self, board, player):\n\t\tif ((board[0][0] == player and board[0][1] == player and board[0][2] == player) or\n\t\t\t(board[1][0] == player and board[1][1] == player and board[1][2] == player) or\n\t\t\t(board[2][0] == player and board[2][1] == player and board[2][2] == player) or\n\t\t\t(board[0][0] == player and board[1][1] == player and board[2][2] == player) or\n\t\t\t(board[0][2] == player and board[1][1] == player and board[2][0] == player) or\n\t\t\t(board[0][0] == player and board[1][0] == player and board[2][0] == player) or\n\t\t\t(board[0][1] == player and board[1][1] == player and board[2][1] == player) or\n\t\t\t(board[0][2] == player and board[1][2] == player and board[2][2] == player)):\n\t\t\tprint(\"----------------------------\")\n\t\t\tprint(\"Yay! Player%d is the winner!\" % player)\n\t\t\tprint(\"----------------------------\")\n\t\t\tself.win = player","def _check_for_win(self):\n slots_available = any(\n [slot.available for slot in self.board.iter_slots() if not slot.mine]\n )\n if not slots_available:\n self.status = GameStatusEnum.won\n self.end_time = datetime.utcnow()","def determine_win(self):\n if self.match.radiant_win is True and self.player_slot < 5:\n return True\n if self.match.radiant_win is False and self.player_slot > 5:\n return True\n return False","def is_winner(self, player) -> bool:\n return (self.current_state.get_current_player_name() != player\n and self.is_over(self.current_state))","def is_winner(self, player):\n return (self.current_state.get_current_player_name() != player\n and self.is_over(self.current_state))","def is_game_won(self):\n return True","def check_game(self):\n gameOver = None\n if self.turn > 4:\n gameOver = self.check_x_won()\n if gameOver is True:\n self.game_x_won()\n return\n\n gameOver = None\n if self.turn > 5:\n gameOver = self.check_o_won()\n if gameOver is True:\n self.game_o_won()\n return\n\n if self.turn >= 9:\n self.game_tie()\n return","def is_game_won(self) -> int:\n\n b = self.board\n for c1, c2, c3, c4 in _WINDOWS:\n if b[c1] and (b[c1] == b[c2] == b[c3] == b[c4]):\n print(\"win\", c1, c2, c3, c4)\n return b[c1]","def checkWinner(self, surface):\r\n winner = True\r\n \r\n # Checks for winner\r\n for point in self.points:\r\n if point.getTeam() == self.getTurn():\r\n winner = False\r\n \r\n # Displays winner message if there is a winner\r\n if winner:\r\n self.surface.fill(BLACK)\r\n winText = graphicalObjects.Text(self.getCurrentString() + ' wins!', WIN_CENTER, 20)\r\n winText.draw(self.surface)\r\n pygame.display.flip()\r\n self.won = True","def has_a_winner(self):\n return self.state in {State.X_WON, State.O_WON}","def won(self):\n if self.current_room.name == \"Victory\":\n return True\n else:\n return False","def checkWin(self, board):\n for w in self.wins:\n if board[w[0]] != ' ' and (board[w[0]] == board[w[1]] == board[w[2]]):\n self.winner = board[w[0]]\n return True","def check_win_condition(board) -> bool:\n if _check_vertical_win_condition(board) or _check_horizontal_win_condition(board) or _check_diagonal_win_condition(\n board):\n return True\n else:\n board.alternate_current_player()\n return False","def is_winner(self, player: str) -> bool:\n total_result = self.current_state.hori_result + self.current_state.left_result + self.current_state.right_result\n total_line = len(total_result)\n p1_taken = 0\n p2_taken = 0\n for item in total_result:\n if item == '1':\n p1_taken+=1\n elif item == '2':\n p2_taken += 1\n if player == \"p1\":\n return float(p1_taken) >= total_line/2\n return float(p2_taken) >= total_line/2","def check_win(self):\r\n wins = [self.check_rows(), self.check_cols(), self.check_diag()]\r\n for case, pos in wins:\r\n if case != -1:\r\n print('Game over!')\r\n if self.grid[case][-1] == self.computer:\r\n print('The computer won!')\r\n return (True, pos)\r\n print('The player won!')\r\n return (True, pos)\r\n\r\n return (self.check_draw(), None)","def checkForWin (self):\r\n\t\tw = self.getWinner()\r\n\t\tif w:\r\n\t\t\tself.printBoard()\r\n\t\t\traise Exception(w + ' won!')","def check_player_reached():\n global round_start_timer, round_over\n\n if player1.alive and player1.rect.top < (platform_width // 2):\n add_time_points()\n reset_players()\n player1.wins += 1\n return True\n\n elif player2.alive and (player2.rect.top + player2.image.get_height()) > \\\n (SCREEN_HEIGHT - platform_width):\n player2.wins += 1\n round_over = True\n add_time_points()\n reset_players()\n return True","def is_game_won(board, player):\n\n\tis_won = False\n\n\tif (\n\t\tboard[0] == board[1] == board[2] == player or\n\t\tboard[3] == board[4] == board[5] == player or\n\t\tboard[6] == board[7] == board[8] == player or\n\t\tboard[0] == board[3] == board[6] == player or\n\t\tboard[1] == board[4] == board[7] == player or\n\t\tboard[2] == board[5] == board[8] == player or\n\t\tboard[0] == board[4] == board[8] == player or\n\t\tboard[2] == board[4] == board[6] == player\n\t):\n\t\tis_won = True\n\n\treturn is_won","def is_game_win(self):\n return not self.deck and not self.hand","def winner(self):\n if self.__current_player == 1:\n if self.__fields[0].winner():\n print(self.__players[0]._Player__name + \"is winner!\")\n Game.play = False\n elif self.__current_player == 2:\n if self.__fields[1].winner():\n print(self.__players[1]._Player__name + \"is winner!\")\n Game.play = False","def uber_check_win(self):\n if self.player1.score == self.player2.score:\n print(\"It's a draw!\")\n elif self.player1.score > self.player2.score:\n print(\"Player 1 is a proper bad ass mother fucker\")\n else:\n print(\"Player numma 2 is a proper bad ass mother fucker\")","def check_if_won(self):\n if self.player_points > self.enemy_points:\n self.bHasWon = True\n else:\n self.bHasWon = False","def is_winner(self):\n return self._winner != self.NEUTRAL_PLAYER","def check_win(self):\n return UNEXPOSED not in self.get_game() and self.get_game().count(FLAG) == len(self.get_pokemon_location)","def _checkRoundOver(self):\n\n if not any(player.isAlive() for player in self.teams[0].players):\n self.endGame()","def win(player1, player2):\n if(player1 == 1 and player2 == 3) or (player1 == 2 and player2 == 1) \\\n or (player1 == 3 and player2 == 2):\n return True","def check_tie(self, player1, player2):\n if self.check_win(player1) or self.check_win(player2):\n return False\n return self.check_grid_full()","def is_over(self):\n winner = TictactoeMatch.get_winner(self.inputs_)\n if winner:\n self.result_ = winner\n if Config.USER['debug']['enabled']:\n print \"It is over! Player \"+str(self.result_)+\" (\"+str(self.player_label_[self.result_])+\") wins!\"\n return True\n for value in self.inputs_:\n if value == TictactoeMatch.EMPTY:\n if Config.USER['debug']['enabled']:\n print \"Go!\"\n return False\n self.result_ = TictactoeMatch.DRAW\n if Config.USER['debug']['enabled']:\n print \"It is over! Draw!\"\n return True","def check_for_win(self,board, player_id, action):\n\n row = 0\n\n # check which row was inserted last:\n for i in range(ROWS):\n if board[ROWS - 1 - i, action] == EMPTY_VAL:\n row = ROWS - i\n break\n\n # check horizontal:\n vec = board[row, :] == player_id\n if np.any(np.convolve(WIN_MASK, vec, mode=\"valid\") == 4):\n return True\n\n # check vertical:\n vec = board[:, action] == player_id\n if np.any(np.convolve(WIN_MASK, vec, mode=\"valid\") == 4):\n return True\n\n # check diagonals:\n vec = np.diagonal(board, action - row) == player_id\n if np.any(np.convolve(WIN_MASK, vec, mode=\"valid\") == 4):\n return True\n vec = np.diagonal(np.fliplr(board), ACTION_DIM - action - 1 - row) == player_id\n if np.any(np.convolve(WIN_MASK, vec, mode=\"valid\") == 4):\n return True\n\n return False","def has_winner(self):\n\n if self.num_black_pieces == 0 or len(self.get_all_valid_moves(Player.black)) == 0:\n return Player.white\n elif self.num_white_pieces == 0 or len(self.get_all_valid_moves(Player.white)) == 0:\n return Player.black\n elif self.repetition_happened() or self.passive_game():\n return \"Tie\"\n else:\n return None","def winning_game_player(players):\n\n # in order for there to be a winner, the game must\n # be over\n if not game_over(players):\n return None\n\n # if the game is over, it could be that there is no\n # winner\n active_players = players_with_decks(players)\n if not active_players:\n return False\n\n # if the game is over than find the winner\n return players_with_decks(players)[0]","def is_win(self, roster):\n player = roster.get_current()\n guess = player.get_move().get_guess()\n if guess == self._code:\n return True\n else:\n return False","def check_if_game_over():\n # Calling check for winners.\n check_for_winner()\n # Calling check it's tie or not.\n check_if_tie()","def check_win(players: List[Player]) -> Tuple[bool, Optional[Player]]:\n total_players = len(players)\n for player in players:\n if player.influence == 0:\n total_players -= 1\n if total_players == 1:\n for player in players:\n if player.influence >0:\n return True, player\n return False, None","def win():\r\n\r\n\tglobal turn, tile1, tile2, tile3, tile4, tile5, tile6, tile7, tile8, tile9, move1, move2, player1, player2\r\n\r\n\twin1 = tile1==tile2==tile3==1 or tile1==tile2==tile3==2\r\n\twin2 = tile4==tile5==tile6==1 or tile4==tile5==tile6==2\r\n\twin3 = tile7==tile8==tile9==1 or tile7==tile8==tile9==2\r\n\twin4 = tile1==tile4==tile7==1 or tile1==tile4==tile7==2\r\n\twin5 = tile2==tile5==tile8==1 or tile2==tile5==tile8==2\r\n\twin6 = tile3==tile6==tile9==1 or tile3==tile6==tile9==2\r\n\twin7 = tile1==tile5==tile9==1 or tile1==tile5==tile9==2\r\n\twin8 = tile3==tile5==tile7==1 or tile3==tile5==tile7==2\r\n\r\n\twin = win1 or win2 or win3 or win4 or win5 or win6 or win7 or win8\r\n\treturn win","def is_winner(self):\n return self.winner","def check_winner(self):\r\n if all(heap == 0 for heap in self.heaps):\r\n if self.misere:\r\n self.winner = self.other_player\r\n self.loser = self.current_player\r\n else:\r\n self.winner = self.current_player\r\n self.loser = self.other_player","def player_has_won(board, player):\n check = 0b000000000\n for index in range(9):\n if board[index] == player:\n check |= (1 << index)\n for pattern in config.WINNING_PATTERNS:\n if pattern & check == pattern:\n return True\n return False","def won_game(self):\n for player in self.players:\n if len(player.cards) == 0:\n\n return True\n return False","def checkWin(self):\n winstates = [(0, 1, 2),\n (3, 4, 5),\n (6, 7, 8),\n (0, 3, 6),\n (1, 4, 7),\n (2, 5, 8),\n (0, 4, 8),\n (2, 4, 6)]\n win = False\n for state in winstates:\n if (self.gameState[state[0]] + self.gameState[state[1]] + self.gameState[state[2]]) == 3:\n self.handleWin(1)\n win = True\n elif (self.gameState[state[0]] + self.gameState[state[1]] + self.gameState[state[2]]) == -3:\n self.handleWin(-1)\n win = True\n\n if len([i for i in range(9) if self.gameState[i] == 0]) == 0 and not win:\n print(\"Draw yo\")\n self.handleDraw()\n return None","def check_won(board,player):\n # X axis\n if (\n (len(set(board[1:4])) == 1 and ' ' not in set(board[1:4])) or\n (len(set(board[4:7])) == 1 and ' ' not in set(board[4:7])) or\n (len(set(board[7:10])) == 1 and ' ' not in set(board[7:10]))\n ):\n print('Player %s, you win!' % player)\n display_board(board)\n return True\n # Y axis\n if (\n (len(set(board[1::3])) == 1 and ' ' not in set(board[1::3])) or\n (len(set(board[2::3])) == 1 and ' ' not in set(board[2::3])) or\n (len(set(board[3::3])) == 1 and ' ' not in set(board[3::3]))\n ):\n print('Player %s, you win!' % player)\n display_board(board)\n return True\n # Diagonals\n if (\n (len(set(board[1::4])) == 1 and ' ' not in set(board[1::4])) or\n (len(set(board[3:9:2])) == 1 and ' ' not in set(board[3:9:2]))\n ):\n print('Player %s, you win!' % player)\n display_board(board)\n return True\n\n return False","def __check_winner(self):\n for i in range(0, 3):\n col = self.__get_col(i)\n if col.get(self.player_char) == 3:\n print('\\nYou win!')\n self.game_ended = True\n return\n if col.get(self.opponent_char) == 3:\n print('\\nYou lose.')\n self.game_ended = True\n return\n row = self.__get_row(i)\n if row.get(self.player_char) == 3:\n print('\\nYou win!')\n self.game_ended = True\n return\n if row.get(self.opponent_char) == 3:\n print('\\nYou lose.')\n self.game_ended = True\n return\n for i in range(0, 2):\n diag = self.__get_diag(i)\n if diag.get(self.player_char) == 3:\n print('\\nYou win!')\n self.game_ended = True\n return\n if diag.get(self.opponent_char) == 3:\n print('\\nYou lose.')\n self.game_ended = True\n return\n if self.state.count(' ') == 0:\n print('\\nDraw!')\n self.game_ended = True","def verify_winner(self):\r\n return self.count_pegs() == 1","def check_win(self) -> Union[Player, None]:\n\t\tfor player in self.players:\n\t\t\tif len(player.deck) == 0:\n\t\t\t\treturn player\n\t\t\n\t\treturn None","def is_game_won(self):\n if self.game_is_tied():\n return False\n my_available_steps = self.steps_available(self.loc)\n opp_available_steps = self.steps_available(self.opponent_loc)\n if my_available_steps == 0 or opp_available_steps == 0:\n return True\n else:\n return False","def winning_event(self, player):\n # vertical check\n for col in range(GameData.columns):\n if self.board[0][col] == player and self.board[1][col] == player and self.board[2][col] == player:\n self.draw_vertical_winning_line(col, player)\n print(\"Player {} has won the game!\".format(player))\n self.game_over = True\n return True\n\n # horizontal check\n for row in range(GameData.rows):\n if self.board[row][0] == player and self.board[row][1] == player and self.board[row][2] == player:\n self.draw_horizontal_winning_line(row, player)\n print(\"Player {} has won the game!\".format(player))\n self.game_over = True\n return True\n\n # ascending diagonal heck\n if self.board[2][0] == player and self.board[1][1] == player and self.board[0][2] == player:\n self.draw_asc_diagonal(player)\n print(\"Player {} has won the game!\".format(player))\n self.game_over = True\n return True\n\n # descending diagonal win chek\n if self.board[0][0] == player and self.board[1][1] == player and self.board[2][2] == player:\n self.draw_desc_diagonal(player)\n print(\"Player {} has won the game!\".format(player))\n self.game_over = True\n return True\n\n return False","def check_for_tie():\n global ongoing_game\n check_for_winner()\n if \"*\" not in board and winner is None:\n ongoing_game = False\n print(\"Game is a Tie! \\n\")\n play_again()\n return True\n else:\n return False","def is_over(self):\n alive_players = [1 if p.status == \"alive\" else 0 for p in self.players]\n # If only one player is alive, the game is over.\n if sum(alive_players) == 1:\n return True\n\n # If all rounds are finshed\n if self.round_counter >= 2:\n return True\n return False","def check_game_over(self):\n red, blue = self.board.count_piece()\n if blue == 0:\n self.ui.show_result(\"RED WIN!\")\n self.turn = RED\n elif red == 0:\n self.ui.show_result(\"BLUE WIN!\")\n self.turn = BLUE\n elif red == blue == 1:\n self.ui.show_result(\"DRAW!\")","def win_game(self):\n\n def horizontal_win():\n \"\"\"Return whether there is horizontal win\"\"\"\n\n for i in range(0, board_size):\n if set(self.board[i]) == set([o_symbol]) or set(self.board[i]) == set([x_symbol]):\n print \"horizontal win\"\n return True\n\n def vertical_win():\n \"\"\"Return whether there is vertical win\"\"\"\n\n vert_set = set()\n for i in range(0, board_size):\n for j in range(0, board_size):\n vert_set.add(self.board[j][i])\n if vert_set == set([o_symbol]) or vert_set == set([x_symbol]):\n print \"vertical win\"\n return True \n vert_set = set()\n\n def diagonal_win():\n \"\"\"Return whether there is diagonal win\"\"\"\n\n diagonal_set = set()\n for i in range(0, board_size):\n diagonal_set.add(self.board[i][i]) \n\n if diagonal_set == set([o_symbol]) or diagonal_set == set([x_symbol]):\n print \"diagonal win 1\"\n return True\n \n diagonal_set = set()\n for i in range(0, board_size):\n diagonal_set.add(self.board[i][board_size - 1 - i])\n\n if diagonal_set == set([o_symbol]) or diagonal_set == set([x_symbol]):\n print \"diagonal win 2\"\n return True\n\n if horizontal_win() or vertical_win() or diagonal_win():\n print \"You have won.\"\n return True","def check_for_game_won(self):\n all_moscuvites_captured = True\n king_captured = True\n king_escaped = True\n for piece in self.game_pieces:\n if piece.player == 2:\n all_moscuvites_captured = False\n elif piece.player == 3:\n king_captured = False\n king_coords = (piece.x,piece.y)\n escape_coords = [(0, 0), (0, 8),\n (8, 0), (8, 8)]\n if king_coords not in escape_coords:\n king_escaped = False\n if king_captured:\n return 2\n elif king_escaped or all_moscuvites_captured:\n return 1\n else:\n return 0","def check_for_win(cls, context={}):\n\t\tplayers = context.get(constants.CONTEXT.PLAYERS, [])\n\t\tfor p in players:\n\t\t\tif len(p.hand) == 0:\n\t\t\t\treturn p\n\t\treturn None","def check_winner(self):\n\t\tif self.check_diagonals() or self.check_rows() or self.check_columns():\n\t\t\treturn True\n\t\telif self.board_is_full():\n\t\t\tprint(\"There was a draw, everyone lost\")\n\t\t\treturn None\n\t\treturn False","def check_if_game_over():\n check_for_winner()\n check_for_tie()","def check_game_status(self):\n for player in (\"1\", \"2\"):\n row_win = np.apply_along_axis(\n lambda x: set(x) == {player}, 1, self.board\n ).any()\n col_win = np.apply_along_axis(\n lambda x: set(x) == {player}, 0, self.board\n ).any()\n d1_win = set(self.data[[0, 4, 8]]) == {player}\n d2_win = set(self.data[[2, 4, 6]]) == {player}\n if any([row_win, col_win, d1_win, d2_win]):\n return (\"win\", player)\n\n if self.counter[\"_\"] == 0:\n return (\"tie\", None)\n else:\n return (\"turn\", \"1\" if self.counter[\"1\"] == self.counter[\"2\"] else \"2\")","def check_win(self):\n win = None\n for pos in self.winning_pos:\n win = self.is_match(set(self.get_cells(pos)))\n if win:\n return win\n if not self.open_tiles():\n return \"Draw\"\n return win","def check_win(self):\n for pos in self.win_set:\n # s would be all 1 if all positions of a winning move is fulfilled\n # otherwise 1s and 0s\n s = set([self.grid[p] for p in pos])\n if len(s) == 1 and (0 not in s):\n return True\n return False","def event_player_wins(self) -> None:\n win_amount = self.user.bet\n print(\"Congratulations, you win:\", win_amount)\n self.user.win_balance(self.user.bet)","def check_opponent_winning(self):\n valid_actions = self.get_valid_actions()\n copy_board = np.copy(self.board)\n for action in list(valid_actions):\n height = self.get_height(action, board=copy_board)\n self.set(action, height=height, value=self.current_player * -1, board=copy_board)\n\n if self.check_winner(copy_board, action, height) != 0:\n return True\n\n self.set(action, height=height, value=0, board=copy_board)\n\n return False","def winner(self):\n return self._fetch_element('winner') == 'true'","def _checkRoundOver(self):\n\n # if we already ended it doesn't matter\n if self.hasEnded():\n return\n\n if not any(player.isAlive() for player in self.teams[0].players):\n # allow continuing after wave 1\n if self._wave > 1:\n self.continueOrEndGame()\n else:\n self.endGame()","def check_winner(self):\n if DotsAndBoxesState.score1 > 4: # Because the total score is fixed at nine, if player's score is greater than four,\n # then the player is the winner.\n return \"A\"\n else:\n return \"B\"","def check_for_win(self, row, col, player): \n\n count = 0\n for i in range(0, len(self.board[0])):\n # Check vertical\n if self.board[row][i] == player:\n count += 1\n else:\n count = 0\n \n if count == self.max_count:\n return True\n\n count = 0\n for i in range(0, len(self.board)):\n # Check horisontal\n if self.board[:, col][i] == player:\n count += 1\n else:\n count = 0\n \n if count == self.max_count:\n return True\n \n count = 0\n totoffset = col - row\n for i in np.diagonal(self.board, offset=totoffset):\n # Check diagonal\n if i == player:\n count += 1\n else:\n count = 0\n\n if count == self.max_count:\n return True\n\n count = 0\n mirrorboard = np.fliplr(self.board)\n col = self.colswitch[col]\n totoffset = col - row\n for i in np.diagonal(mirrorboard, offset=totoffset):\n # Check other diagonal\n if i == player:\n count += 1\n else:\n count = 0\n\n if count == self.max_count:\n return True","def check_if_user_won(self, board, pos, player_no):\n\n has_player_got_4 = set()\n has_player_got_4.add(pos)\n\n self.check_horizontal(has_player_got_4, board, pos, player_no)\n\n if len(has_player_got_4) >= 4:\n return True\n\n has_player_got_4 = set()\n has_player_got_4.add(pos)\n\n self.check_vertical(has_player_got_4, board, pos, player_no)\n\n if len(has_player_got_4) >= 4:\n return True\n\n has_player_got_4 = set()\n has_player_got_4.add(pos)\n\n self.check_diagonal(has_player_got_4, board, pos, player_no)\n\n if len(has_player_got_4) >= 4:\n return True\n\n has_player_got_4 = set()\n has_player_got_4.add(pos)\n\n self.check_inverted_diagonal(has_player_got_4, board, pos, player_no)\n\n if len(has_player_got_4) >= 4:\n return True\n\n if self.check_if_board_full(board):\n self.draw = True\n return True","def winner(self):\n\n if self.game_ended():\n return self.winning()\n else:\n return 0","def game_over(self):\n return bool(self.last_round and self.last_player == self.current_player)","def win_game(board :list) -> bool:\n if board == win_state:\n return True\n return False","def player_has_won(self):\n return len(self._words_guessed) == self._num_words","def is_over(self, board):\n if _winner(board) != 0:\n return True\n return False","def playerCanPlay(game, situation, player):\r\n return True","def row_win(board, player):\n for row in board:\n if check_row(row, player):\n return True\n return False","def game_over(players):\n active_players = players_with_decks(players)\n if not active_players or len(active_players) == 1:\n return True\n return False","def is_winner(self, player, cell):\n \n if len(self.moves) > 2:\n # Need at least 3 moves for a player to win. Normally\n # would be 5, but turn enforcement is not implemented here.\n \n column = cell % 3\n row = cell - (cell % 3)\n diagonal = cell % 2 == 0\n \n victory = False\n \n # For these checks, we slice the cells in question out of the\n # board, compare them all to the player, and finally check that\n # each is True.\n if diagonal:\n victory = victory or \\\n all([c == player for c in self.cells[0:9:4]]) or \\\n all([c == player for c in self.cells[2:8:2]])\n \n victory = victory or \\\n all([c == player for c in self.cells[column:9:3]]) or \\\n all([c == player for c in self.cells[row:row+3]])\n \n return victory\n return False","def check_win(self, board, move):\n for i, j, k in self.winning_cases:\n if board[i] == move and board[j] == move and board[k] == move:\n return True\n return False","def game_over(self):\n\n if self._number_of_moves == 9:\n return True\n\n return self._number_of_moves == 9 or self.winner_found()","def check_winner(self):\n for row in self.board.values():\n if all([mark == \"x\" for mark in row]):\n return self.player_1\n elif all([mark == \"o\" for mark in row]):\n return self.player_2\n\n # checks every column\n for i in range(3):\n first_row, second_row, third_row = self.board.values()\n if first_row[i] == \"x\" and second_row[i] == \"x\" and third_row[i] == \"x\":\n return self.player_1\n elif first_row[i] == \"o\" and second_row[i] == \"o\" and third_row[i] == \"o\":\n return self.player_2\n\n # checks the diagonals\n if self.board[\"a\"][0] == \"x\" and self.board[\"b\"][1] == \"x\" and self.board[\"c\"][2] == \"x\":\n return self.player_1\n if self.board[\"a\"][2] == \"o\" and self.board[\"b\"][1] == \"o\" and self.board[\"c\"][0] == \"o\":\n return self.player_2\n\n return None","def is_winning_state(self):\n return self.game.is_winning_state()","def check_for_win(self, index):\n\n\t\tpossible_comb = self.cell_combinations[index]\n\n\t\tfor comb in possible_comb:\n\n\t\t\ttokens = []\n\t\t\ttokens.append(self.player_model.grid[comb[0]].token)\n\t\t\ttokens.append(self.player_model.grid[comb[1]].token)\n\t\t\ttokens.append(self.player_model.grid[comb[2]].token)\n\n\t\t\tif all([token == self.player_model.current_player.token for token in tokens]):\n\n\t\t\t\treturn True\n\n\t\treturn False","def __check_win_condition(self,token,coordinate):\n # Check if it's even possible to win yet\n if self._turn_counter >= 8 and self._turn_counter+1 < self._board_size**2:\n # Disable win\n # return False\n\n # Up and up right vectors\n vec1=(1,0)\n vec2=(1,1)\n\n # Loop both directions of vector\n for _ in range(2):\n if self.__check_direction(vec1,coordinate):\n self.__declare_winner()\n return True\n if self.__check_direction(vec2,coordinate):\n self.__declare_winner()\n return True\n\n # Turn vector directions\n vec1 = -vec1[1], vec1[0]\n vec2 = -vec2[1], vec2[0]\n\n # Check for draw\n elif self._turn_counter+1 >= self._board_size**2:\n if (self._gui):\n self.__turn_counter_label[\"text\"] = \"Draw!\"\n self.__status[\"text\"] = \"\"\n self.__status.update()\n self.__turn_counter_label.update()\n self._winner = 3\n if (self._state == PLAY): showerror(\"Draw\",\"Draw!\")\n return True","def check_winner(self):\n if self.player1.chips <= BIG_BLIND_BET:\n return 2\n elif self.player2.chips <= BIG_BLIND_BET:\n return 1\n else:\n return 0","def player_win(self):\r\n\r\n self.summary = (\" \" * 83) + \"YOU WIN\"\r\n print(\"Player wins against opponent.\\n\")\r\n self.player_wins += 1","def check_for_winner(self):\r\n\r\n # Iterate through the rows\r\n for row in range(self.height):\r\n if self.board[row][0] == self.board[row][1] == self.board[row][2] and self.board[row][0] != None:\r\n return Board.WIN if self.board[row][0] else Board.LOSS\r\n\r\n # Iterate through the columns\r\n for col in range(self.width):\r\n if self.board[0][col] == self.board[1][col] == self.board[2][col] and self.board[0][col] != None:\r\n return Board.WIN if self.board[0][col] else Board.LOSS\r\n\r\n # Diagonals\r\n if self.board[0][0] == self.board[1][1] == self.board[2][2] and self.board[0][0] != None:\r\n return Board.WIN if self.board[0][0] else Board.LOSS\r\n if self.board[0][2] == self.board[1][1] == self.board[2][0] and self.board[0][2] != None:\r\n return Board.WIN if self.board[0][2] else Board.LOSS\r\n\r\n # No winner yet\r\n return 0","def enough_players():\n return True","def check_win(self) -> None:\n if self.word == \"\".join(self.word2):\n print(f\"You won! Word: {self.word}\")\n self.play_again()\n elif self.errors == self.attempts:\n print(f\"You lose!\\nThe word was: {self.word}\")\n self.play_again()","def has_won(self):\n return len(self.hand) == 0","def is_round_over(whose_turn,players):\n if ((len(players[whose_turn].hand.cards) == 0) and (players[whose_turn].has_discarded == True)):\n round_over = True\n else:\n round_over = False\n return round_over","def checkForWin(self, tracker):\n\n # Check damage levels for all ships in the tracker\n # 0 = Fully damaged (sunk), Non-zero otherwise\n for i in tracker.values():\n if i != 0:\n break\n else:\n return True\n return False","def is_over(self):\n winner = self.get_winner()\n status = bool(winner or not self.available_moves)\n return status, winner","def get_win_condition(self, info: Dict[str, Any]) -> bool:\n if not self.possible_to_win:\n return False\n return not info[\"lost_live\"] and info[\"terminal\"]","def winner(position, player):\n if position == 100:\n print(\"Congratulations,\",player + \", you have won.\")\n return True\n else:\n return False"],"string":"[\n \"def has_won(board, player):\\r\\n return False\",\n \"def has_won(board, player):\\n return False\",\n \"def checkForWin(self):\\n w = self.getWinner()\\n if w == PLAYER or w == AI:\\n # self.printBoard()\\n # print('%d'%w + ' won!')\\n return\\n if w == Tie:\\n # print('Tie')\\n return\",\n \"def check_win(self, player):\\n def check_row_win(player):\\n for row in self.game_state:\\n if player == row[0] == row[1] == row[2]:\\n return True\\n return False\\n\\n def check_column_win(player):\\n # For doing a column check, transpose the grid and do a row check\\n trans_game_state = numpy.transpose(self.game_state)\\n for row in trans_game_state:\\n if player == row[0] == row[1] == row[2]:\\n return True\\n return False\\n\\n def check_diag_win(player):\\n # Left to right diagonal\\n if player == self.game_state[0][0] == self.game_state[1][1] == self.game_state[2][2]:\\n return True\\n # Right to left diagonal\\n if player == self.game_state[0][2] == self.game_state[1][1] == self.game_state[2][0]:\\n return True\\n return False\\n\\n if check_column_win(player) or check_diag_win(player) or check_row_win(player):\\n return True\\n return False\",\n \"def win(self, player):\\n if player == 1:\\n a = self.player_one.moves\\n else:\\n a = self.player_two.moves\\n winning_moves = []\\n for i in range(1, 9, 3):\\n winning_moves.append(range(i, i + 3))\\n for i in range(1, 4):\\n winning_moves.append(range(i, i + 7, 3))\\n winning_moves.append([1, 5, 9])\\n winning_moves.append([3, 5, 7])\\n for move in winning_moves:\\n flg = True\\n for index in move:\\n if index not in a:\\n flg = False\\n break\\n if flg:\\n return True, player\\n if len(self.player_one.moves) + len(self.player_two.moves) == 9:\\n self.print_space()\\n self.display_board()\\n self.print_space()\\n print \\\" Games is drawn\\\"\\n self.logging.debug(\\\"Game is draw, nobody won\\\")\\n self.logging.debug(\\\"Enjoy the game again :)\\\")\\n sys.exit(100)\\n return False, player\",\n \"def check_win(self, player):\\n for win_pos in TicTacToe.win_pos:\\n # for each winning position defined we take the set difference to the positions played be player\\n # if there are not elements left after resulting set after difference operator\\n # we get False as return. ie he has placed his marker in the winning positions which in turn makes him\\n # the winner\\n if not win_pos.difference(self.player_played_pos[player]):\\n return True\\n\\n # if after checking for every winning positions if the control still reaches here,\\n # the player has not marked the winning positions. returns False\\n return False\",\n \"def check_winner(self):\\n pass\",\n \"def hasWin(self) :\\n comparison = self.compareNumberUser()\\n if (comparison == 'equal') :\\n return True\\n else :\\n return False\",\n \"def is_game_over(self):\\r\\n\\r\\n if self.winner != 0:\\r\\n return True\\r\\n\\r\\n return False\",\n \"def check_win_lose(self):\\n if self.b.get_player_i() == 7: # player got to the bank\\n return 1 # win\\n if self.b.get_chaser_i() == self.b.get_player_i(): # chaser catch the player\\n return 2 # lose\\n return 0 # nothing\",\n \"def checkForWin(self, board, player):\\n\\t\\tif ((board[0][0] == player and board[0][1] == player and board[0][2] == player) or\\n\\t\\t\\t(board[1][0] == player and board[1][1] == player and board[1][2] == player) or\\n\\t\\t\\t(board[2][0] == player and board[2][1] == player and board[2][2] == player) or\\n\\t\\t\\t(board[0][0] == player and board[1][1] == player and board[2][2] == player) or\\n\\t\\t\\t(board[0][2] == player and board[1][1] == player and board[2][0] == player) or\\n\\t\\t\\t(board[0][0] == player and board[1][0] == player and board[2][0] == player) or\\n\\t\\t\\t(board[0][1] == player and board[1][1] == player and board[2][1] == player) or\\n\\t\\t\\t(board[0][2] == player and board[1][2] == player and board[2][2] == player)):\\n\\t\\t\\tprint(\\\"----------------------------\\\")\\n\\t\\t\\tprint(\\\"Yay! Player%d is the winner!\\\" % player)\\n\\t\\t\\tprint(\\\"----------------------------\\\")\\n\\t\\t\\tself.win = player\",\n \"def _check_for_win(self):\\n slots_available = any(\\n [slot.available for slot in self.board.iter_slots() if not slot.mine]\\n )\\n if not slots_available:\\n self.status = GameStatusEnum.won\\n self.end_time = datetime.utcnow()\",\n \"def determine_win(self):\\n if self.match.radiant_win is True and self.player_slot < 5:\\n return True\\n if self.match.radiant_win is False and self.player_slot > 5:\\n return True\\n return False\",\n \"def is_winner(self, player) -> bool:\\n return (self.current_state.get_current_player_name() != player\\n and self.is_over(self.current_state))\",\n \"def is_winner(self, player):\\n return (self.current_state.get_current_player_name() != player\\n and self.is_over(self.current_state))\",\n \"def is_game_won(self):\\n return True\",\n \"def check_game(self):\\n gameOver = None\\n if self.turn > 4:\\n gameOver = self.check_x_won()\\n if gameOver is True:\\n self.game_x_won()\\n return\\n\\n gameOver = None\\n if self.turn > 5:\\n gameOver = self.check_o_won()\\n if gameOver is True:\\n self.game_o_won()\\n return\\n\\n if self.turn >= 9:\\n self.game_tie()\\n return\",\n \"def is_game_won(self) -> int:\\n\\n b = self.board\\n for c1, c2, c3, c4 in _WINDOWS:\\n if b[c1] and (b[c1] == b[c2] == b[c3] == b[c4]):\\n print(\\\"win\\\", c1, c2, c3, c4)\\n return b[c1]\",\n \"def checkWinner(self, surface):\\r\\n winner = True\\r\\n \\r\\n # Checks for winner\\r\\n for point in self.points:\\r\\n if point.getTeam() == self.getTurn():\\r\\n winner = False\\r\\n \\r\\n # Displays winner message if there is a winner\\r\\n if winner:\\r\\n self.surface.fill(BLACK)\\r\\n winText = graphicalObjects.Text(self.getCurrentString() + ' wins!', WIN_CENTER, 20)\\r\\n winText.draw(self.surface)\\r\\n pygame.display.flip()\\r\\n self.won = True\",\n \"def has_a_winner(self):\\n return self.state in {State.X_WON, State.O_WON}\",\n \"def won(self):\\n if self.current_room.name == \\\"Victory\\\":\\n return True\\n else:\\n return False\",\n \"def checkWin(self, board):\\n for w in self.wins:\\n if board[w[0]] != ' ' and (board[w[0]] == board[w[1]] == board[w[2]]):\\n self.winner = board[w[0]]\\n return True\",\n \"def check_win_condition(board) -> bool:\\n if _check_vertical_win_condition(board) or _check_horizontal_win_condition(board) or _check_diagonal_win_condition(\\n board):\\n return True\\n else:\\n board.alternate_current_player()\\n return False\",\n \"def is_winner(self, player: str) -> bool:\\n total_result = self.current_state.hori_result + self.current_state.left_result + self.current_state.right_result\\n total_line = len(total_result)\\n p1_taken = 0\\n p2_taken = 0\\n for item in total_result:\\n if item == '1':\\n p1_taken+=1\\n elif item == '2':\\n p2_taken += 1\\n if player == \\\"p1\\\":\\n return float(p1_taken) >= total_line/2\\n return float(p2_taken) >= total_line/2\",\n \"def check_win(self):\\r\\n wins = [self.check_rows(), self.check_cols(), self.check_diag()]\\r\\n for case, pos in wins:\\r\\n if case != -1:\\r\\n print('Game over!')\\r\\n if self.grid[case][-1] == self.computer:\\r\\n print('The computer won!')\\r\\n return (True, pos)\\r\\n print('The player won!')\\r\\n return (True, pos)\\r\\n\\r\\n return (self.check_draw(), None)\",\n \"def checkForWin (self):\\r\\n\\t\\tw = self.getWinner()\\r\\n\\t\\tif w:\\r\\n\\t\\t\\tself.printBoard()\\r\\n\\t\\t\\traise Exception(w + ' won!')\",\n \"def check_player_reached():\\n global round_start_timer, round_over\\n\\n if player1.alive and player1.rect.top < (platform_width // 2):\\n add_time_points()\\n reset_players()\\n player1.wins += 1\\n return True\\n\\n elif player2.alive and (player2.rect.top + player2.image.get_height()) > \\\\\\n (SCREEN_HEIGHT - platform_width):\\n player2.wins += 1\\n round_over = True\\n add_time_points()\\n reset_players()\\n return True\",\n \"def is_game_won(board, player):\\n\\n\\tis_won = False\\n\\n\\tif (\\n\\t\\tboard[0] == board[1] == board[2] == player or\\n\\t\\tboard[3] == board[4] == board[5] == player or\\n\\t\\tboard[6] == board[7] == board[8] == player or\\n\\t\\tboard[0] == board[3] == board[6] == player or\\n\\t\\tboard[1] == board[4] == board[7] == player or\\n\\t\\tboard[2] == board[5] == board[8] == player or\\n\\t\\tboard[0] == board[4] == board[8] == player or\\n\\t\\tboard[2] == board[4] == board[6] == player\\n\\t):\\n\\t\\tis_won = True\\n\\n\\treturn is_won\",\n \"def is_game_win(self):\\n return not self.deck and not self.hand\",\n \"def winner(self):\\n if self.__current_player == 1:\\n if self.__fields[0].winner():\\n print(self.__players[0]._Player__name + \\\"is winner!\\\")\\n Game.play = False\\n elif self.__current_player == 2:\\n if self.__fields[1].winner():\\n print(self.__players[1]._Player__name + \\\"is winner!\\\")\\n Game.play = False\",\n \"def uber_check_win(self):\\n if self.player1.score == self.player2.score:\\n print(\\\"It's a draw!\\\")\\n elif self.player1.score > self.player2.score:\\n print(\\\"Player 1 is a proper bad ass mother fucker\\\")\\n else:\\n print(\\\"Player numma 2 is a proper bad ass mother fucker\\\")\",\n \"def check_if_won(self):\\n if self.player_points > self.enemy_points:\\n self.bHasWon = True\\n else:\\n self.bHasWon = False\",\n \"def is_winner(self):\\n return self._winner != self.NEUTRAL_PLAYER\",\n \"def check_win(self):\\n return UNEXPOSED not in self.get_game() and self.get_game().count(FLAG) == len(self.get_pokemon_location)\",\n \"def _checkRoundOver(self):\\n\\n if not any(player.isAlive() for player in self.teams[0].players):\\n self.endGame()\",\n \"def win(player1, player2):\\n if(player1 == 1 and player2 == 3) or (player1 == 2 and player2 == 1) \\\\\\n or (player1 == 3 and player2 == 2):\\n return True\",\n \"def check_tie(self, player1, player2):\\n if self.check_win(player1) or self.check_win(player2):\\n return False\\n return self.check_grid_full()\",\n \"def is_over(self):\\n winner = TictactoeMatch.get_winner(self.inputs_)\\n if winner:\\n self.result_ = winner\\n if Config.USER['debug']['enabled']:\\n print \\\"It is over! Player \\\"+str(self.result_)+\\\" (\\\"+str(self.player_label_[self.result_])+\\\") wins!\\\"\\n return True\\n for value in self.inputs_:\\n if value == TictactoeMatch.EMPTY:\\n if Config.USER['debug']['enabled']:\\n print \\\"Go!\\\"\\n return False\\n self.result_ = TictactoeMatch.DRAW\\n if Config.USER['debug']['enabled']:\\n print \\\"It is over! Draw!\\\"\\n return True\",\n \"def check_for_win(self,board, player_id, action):\\n\\n row = 0\\n\\n # check which row was inserted last:\\n for i in range(ROWS):\\n if board[ROWS - 1 - i, action] == EMPTY_VAL:\\n row = ROWS - i\\n break\\n\\n # check horizontal:\\n vec = board[row, :] == player_id\\n if np.any(np.convolve(WIN_MASK, vec, mode=\\\"valid\\\") == 4):\\n return True\\n\\n # check vertical:\\n vec = board[:, action] == player_id\\n if np.any(np.convolve(WIN_MASK, vec, mode=\\\"valid\\\") == 4):\\n return True\\n\\n # check diagonals:\\n vec = np.diagonal(board, action - row) == player_id\\n if np.any(np.convolve(WIN_MASK, vec, mode=\\\"valid\\\") == 4):\\n return True\\n vec = np.diagonal(np.fliplr(board), ACTION_DIM - action - 1 - row) == player_id\\n if np.any(np.convolve(WIN_MASK, vec, mode=\\\"valid\\\") == 4):\\n return True\\n\\n return False\",\n \"def has_winner(self):\\n\\n if self.num_black_pieces == 0 or len(self.get_all_valid_moves(Player.black)) == 0:\\n return Player.white\\n elif self.num_white_pieces == 0 or len(self.get_all_valid_moves(Player.white)) == 0:\\n return Player.black\\n elif self.repetition_happened() or self.passive_game():\\n return \\\"Tie\\\"\\n else:\\n return None\",\n \"def winning_game_player(players):\\n\\n # in order for there to be a winner, the game must\\n # be over\\n if not game_over(players):\\n return None\\n\\n # if the game is over, it could be that there is no\\n # winner\\n active_players = players_with_decks(players)\\n if not active_players:\\n return False\\n\\n # if the game is over than find the winner\\n return players_with_decks(players)[0]\",\n \"def is_win(self, roster):\\n player = roster.get_current()\\n guess = player.get_move().get_guess()\\n if guess == self._code:\\n return True\\n else:\\n return False\",\n \"def check_if_game_over():\\n # Calling check for winners.\\n check_for_winner()\\n # Calling check it's tie or not.\\n check_if_tie()\",\n \"def check_win(players: List[Player]) -> Tuple[bool, Optional[Player]]:\\n total_players = len(players)\\n for player in players:\\n if player.influence == 0:\\n total_players -= 1\\n if total_players == 1:\\n for player in players:\\n if player.influence >0:\\n return True, player\\n return False, None\",\n \"def win():\\r\\n\\r\\n\\tglobal turn, tile1, tile2, tile3, tile4, tile5, tile6, tile7, tile8, tile9, move1, move2, player1, player2\\r\\n\\r\\n\\twin1 = tile1==tile2==tile3==1 or tile1==tile2==tile3==2\\r\\n\\twin2 = tile4==tile5==tile6==1 or tile4==tile5==tile6==2\\r\\n\\twin3 = tile7==tile8==tile9==1 or tile7==tile8==tile9==2\\r\\n\\twin4 = tile1==tile4==tile7==1 or tile1==tile4==tile7==2\\r\\n\\twin5 = tile2==tile5==tile8==1 or tile2==tile5==tile8==2\\r\\n\\twin6 = tile3==tile6==tile9==1 or tile3==tile6==tile9==2\\r\\n\\twin7 = tile1==tile5==tile9==1 or tile1==tile5==tile9==2\\r\\n\\twin8 = tile3==tile5==tile7==1 or tile3==tile5==tile7==2\\r\\n\\r\\n\\twin = win1 or win2 or win3 or win4 or win5 or win6 or win7 or win8\\r\\n\\treturn win\",\n \"def is_winner(self):\\n return self.winner\",\n \"def check_winner(self):\\r\\n if all(heap == 0 for heap in self.heaps):\\r\\n if self.misere:\\r\\n self.winner = self.other_player\\r\\n self.loser = self.current_player\\r\\n else:\\r\\n self.winner = self.current_player\\r\\n self.loser = self.other_player\",\n \"def player_has_won(board, player):\\n check = 0b000000000\\n for index in range(9):\\n if board[index] == player:\\n check |= (1 << index)\\n for pattern in config.WINNING_PATTERNS:\\n if pattern & check == pattern:\\n return True\\n return False\",\n \"def won_game(self):\\n for player in self.players:\\n if len(player.cards) == 0:\\n\\n return True\\n return False\",\n \"def checkWin(self):\\n winstates = [(0, 1, 2),\\n (3, 4, 5),\\n (6, 7, 8),\\n (0, 3, 6),\\n (1, 4, 7),\\n (2, 5, 8),\\n (0, 4, 8),\\n (2, 4, 6)]\\n win = False\\n for state in winstates:\\n if (self.gameState[state[0]] + self.gameState[state[1]] + self.gameState[state[2]]) == 3:\\n self.handleWin(1)\\n win = True\\n elif (self.gameState[state[0]] + self.gameState[state[1]] + self.gameState[state[2]]) == -3:\\n self.handleWin(-1)\\n win = True\\n\\n if len([i for i in range(9) if self.gameState[i] == 0]) == 0 and not win:\\n print(\\\"Draw yo\\\")\\n self.handleDraw()\\n return None\",\n \"def check_won(board,player):\\n # X axis\\n if (\\n (len(set(board[1:4])) == 1 and ' ' not in set(board[1:4])) or\\n (len(set(board[4:7])) == 1 and ' ' not in set(board[4:7])) or\\n (len(set(board[7:10])) == 1 and ' ' not in set(board[7:10]))\\n ):\\n print('Player %s, you win!' % player)\\n display_board(board)\\n return True\\n # Y axis\\n if (\\n (len(set(board[1::3])) == 1 and ' ' not in set(board[1::3])) or\\n (len(set(board[2::3])) == 1 and ' ' not in set(board[2::3])) or\\n (len(set(board[3::3])) == 1 and ' ' not in set(board[3::3]))\\n ):\\n print('Player %s, you win!' % player)\\n display_board(board)\\n return True\\n # Diagonals\\n if (\\n (len(set(board[1::4])) == 1 and ' ' not in set(board[1::4])) or\\n (len(set(board[3:9:2])) == 1 and ' ' not in set(board[3:9:2]))\\n ):\\n print('Player %s, you win!' % player)\\n display_board(board)\\n return True\\n\\n return False\",\n \"def __check_winner(self):\\n for i in range(0, 3):\\n col = self.__get_col(i)\\n if col.get(self.player_char) == 3:\\n print('\\\\nYou win!')\\n self.game_ended = True\\n return\\n if col.get(self.opponent_char) == 3:\\n print('\\\\nYou lose.')\\n self.game_ended = True\\n return\\n row = self.__get_row(i)\\n if row.get(self.player_char) == 3:\\n print('\\\\nYou win!')\\n self.game_ended = True\\n return\\n if row.get(self.opponent_char) == 3:\\n print('\\\\nYou lose.')\\n self.game_ended = True\\n return\\n for i in range(0, 2):\\n diag = self.__get_diag(i)\\n if diag.get(self.player_char) == 3:\\n print('\\\\nYou win!')\\n self.game_ended = True\\n return\\n if diag.get(self.opponent_char) == 3:\\n print('\\\\nYou lose.')\\n self.game_ended = True\\n return\\n if self.state.count(' ') == 0:\\n print('\\\\nDraw!')\\n self.game_ended = True\",\n \"def verify_winner(self):\\r\\n return self.count_pegs() == 1\",\n \"def check_win(self) -> Union[Player, None]:\\n\\t\\tfor player in self.players:\\n\\t\\t\\tif len(player.deck) == 0:\\n\\t\\t\\t\\treturn player\\n\\t\\t\\n\\t\\treturn None\",\n \"def is_game_won(self):\\n if self.game_is_tied():\\n return False\\n my_available_steps = self.steps_available(self.loc)\\n opp_available_steps = self.steps_available(self.opponent_loc)\\n if my_available_steps == 0 or opp_available_steps == 0:\\n return True\\n else:\\n return False\",\n \"def winning_event(self, player):\\n # vertical check\\n for col in range(GameData.columns):\\n if self.board[0][col] == player and self.board[1][col] == player and self.board[2][col] == player:\\n self.draw_vertical_winning_line(col, player)\\n print(\\\"Player {} has won the game!\\\".format(player))\\n self.game_over = True\\n return True\\n\\n # horizontal check\\n for row in range(GameData.rows):\\n if self.board[row][0] == player and self.board[row][1] == player and self.board[row][2] == player:\\n self.draw_horizontal_winning_line(row, player)\\n print(\\\"Player {} has won the game!\\\".format(player))\\n self.game_over = True\\n return True\\n\\n # ascending diagonal heck\\n if self.board[2][0] == player and self.board[1][1] == player and self.board[0][2] == player:\\n self.draw_asc_diagonal(player)\\n print(\\\"Player {} has won the game!\\\".format(player))\\n self.game_over = True\\n return True\\n\\n # descending diagonal win chek\\n if self.board[0][0] == player and self.board[1][1] == player and self.board[2][2] == player:\\n self.draw_desc_diagonal(player)\\n print(\\\"Player {} has won the game!\\\".format(player))\\n self.game_over = True\\n return True\\n\\n return False\",\n \"def check_for_tie():\\n global ongoing_game\\n check_for_winner()\\n if \\\"*\\\" not in board and winner is None:\\n ongoing_game = False\\n print(\\\"Game is a Tie! \\\\n\\\")\\n play_again()\\n return True\\n else:\\n return False\",\n \"def is_over(self):\\n alive_players = [1 if p.status == \\\"alive\\\" else 0 for p in self.players]\\n # If only one player is alive, the game is over.\\n if sum(alive_players) == 1:\\n return True\\n\\n # If all rounds are finshed\\n if self.round_counter >= 2:\\n return True\\n return False\",\n \"def check_game_over(self):\\n red, blue = self.board.count_piece()\\n if blue == 0:\\n self.ui.show_result(\\\"RED WIN!\\\")\\n self.turn = RED\\n elif red == 0:\\n self.ui.show_result(\\\"BLUE WIN!\\\")\\n self.turn = BLUE\\n elif red == blue == 1:\\n self.ui.show_result(\\\"DRAW!\\\")\",\n \"def win_game(self):\\n\\n def horizontal_win():\\n \\\"\\\"\\\"Return whether there is horizontal win\\\"\\\"\\\"\\n\\n for i in range(0, board_size):\\n if set(self.board[i]) == set([o_symbol]) or set(self.board[i]) == set([x_symbol]):\\n print \\\"horizontal win\\\"\\n return True\\n\\n def vertical_win():\\n \\\"\\\"\\\"Return whether there is vertical win\\\"\\\"\\\"\\n\\n vert_set = set()\\n for i in range(0, board_size):\\n for j in range(0, board_size):\\n vert_set.add(self.board[j][i])\\n if vert_set == set([o_symbol]) or vert_set == set([x_symbol]):\\n print \\\"vertical win\\\"\\n return True \\n vert_set = set()\\n\\n def diagonal_win():\\n \\\"\\\"\\\"Return whether there is diagonal win\\\"\\\"\\\"\\n\\n diagonal_set = set()\\n for i in range(0, board_size):\\n diagonal_set.add(self.board[i][i]) \\n\\n if diagonal_set == set([o_symbol]) or diagonal_set == set([x_symbol]):\\n print \\\"diagonal win 1\\\"\\n return True\\n \\n diagonal_set = set()\\n for i in range(0, board_size):\\n diagonal_set.add(self.board[i][board_size - 1 - i])\\n\\n if diagonal_set == set([o_symbol]) or diagonal_set == set([x_symbol]):\\n print \\\"diagonal win 2\\\"\\n return True\\n\\n if horizontal_win() or vertical_win() or diagonal_win():\\n print \\\"You have won.\\\"\\n return True\",\n \"def check_for_game_won(self):\\n all_moscuvites_captured = True\\n king_captured = True\\n king_escaped = True\\n for piece in self.game_pieces:\\n if piece.player == 2:\\n all_moscuvites_captured = False\\n elif piece.player == 3:\\n king_captured = False\\n king_coords = (piece.x,piece.y)\\n escape_coords = [(0, 0), (0, 8),\\n (8, 0), (8, 8)]\\n if king_coords not in escape_coords:\\n king_escaped = False\\n if king_captured:\\n return 2\\n elif king_escaped or all_moscuvites_captured:\\n return 1\\n else:\\n return 0\",\n \"def check_for_win(cls, context={}):\\n\\t\\tplayers = context.get(constants.CONTEXT.PLAYERS, [])\\n\\t\\tfor p in players:\\n\\t\\t\\tif len(p.hand) == 0:\\n\\t\\t\\t\\treturn p\\n\\t\\treturn None\",\n \"def check_winner(self):\\n\\t\\tif self.check_diagonals() or self.check_rows() or self.check_columns():\\n\\t\\t\\treturn True\\n\\t\\telif self.board_is_full():\\n\\t\\t\\tprint(\\\"There was a draw, everyone lost\\\")\\n\\t\\t\\treturn None\\n\\t\\treturn False\",\n \"def check_if_game_over():\\n check_for_winner()\\n check_for_tie()\",\n \"def check_game_status(self):\\n for player in (\\\"1\\\", \\\"2\\\"):\\n row_win = np.apply_along_axis(\\n lambda x: set(x) == {player}, 1, self.board\\n ).any()\\n col_win = np.apply_along_axis(\\n lambda x: set(x) == {player}, 0, self.board\\n ).any()\\n d1_win = set(self.data[[0, 4, 8]]) == {player}\\n d2_win = set(self.data[[2, 4, 6]]) == {player}\\n if any([row_win, col_win, d1_win, d2_win]):\\n return (\\\"win\\\", player)\\n\\n if self.counter[\\\"_\\\"] == 0:\\n return (\\\"tie\\\", None)\\n else:\\n return (\\\"turn\\\", \\\"1\\\" if self.counter[\\\"1\\\"] == self.counter[\\\"2\\\"] else \\\"2\\\")\",\n \"def check_win(self):\\n win = None\\n for pos in self.winning_pos:\\n win = self.is_match(set(self.get_cells(pos)))\\n if win:\\n return win\\n if not self.open_tiles():\\n return \\\"Draw\\\"\\n return win\",\n \"def check_win(self):\\n for pos in self.win_set:\\n # s would be all 1 if all positions of a winning move is fulfilled\\n # otherwise 1s and 0s\\n s = set([self.grid[p] for p in pos])\\n if len(s) == 1 and (0 not in s):\\n return True\\n return False\",\n \"def event_player_wins(self) -> None:\\n win_amount = self.user.bet\\n print(\\\"Congratulations, you win:\\\", win_amount)\\n self.user.win_balance(self.user.bet)\",\n \"def check_opponent_winning(self):\\n valid_actions = self.get_valid_actions()\\n copy_board = np.copy(self.board)\\n for action in list(valid_actions):\\n height = self.get_height(action, board=copy_board)\\n self.set(action, height=height, value=self.current_player * -1, board=copy_board)\\n\\n if self.check_winner(copy_board, action, height) != 0:\\n return True\\n\\n self.set(action, height=height, value=0, board=copy_board)\\n\\n return False\",\n \"def winner(self):\\n return self._fetch_element('winner') == 'true'\",\n \"def _checkRoundOver(self):\\n\\n # if we already ended it doesn't matter\\n if self.hasEnded():\\n return\\n\\n if not any(player.isAlive() for player in self.teams[0].players):\\n # allow continuing after wave 1\\n if self._wave > 1:\\n self.continueOrEndGame()\\n else:\\n self.endGame()\",\n \"def check_winner(self):\\n if DotsAndBoxesState.score1 > 4: # Because the total score is fixed at nine, if player's score is greater than four,\\n # then the player is the winner.\\n return \\\"A\\\"\\n else:\\n return \\\"B\\\"\",\n \"def check_for_win(self, row, col, player): \\n\\n count = 0\\n for i in range(0, len(self.board[0])):\\n # Check vertical\\n if self.board[row][i] == player:\\n count += 1\\n else:\\n count = 0\\n \\n if count == self.max_count:\\n return True\\n\\n count = 0\\n for i in range(0, len(self.board)):\\n # Check horisontal\\n if self.board[:, col][i] == player:\\n count += 1\\n else:\\n count = 0\\n \\n if count == self.max_count:\\n return True\\n \\n count = 0\\n totoffset = col - row\\n for i in np.diagonal(self.board, offset=totoffset):\\n # Check diagonal\\n if i == player:\\n count += 1\\n else:\\n count = 0\\n\\n if count == self.max_count:\\n return True\\n\\n count = 0\\n mirrorboard = np.fliplr(self.board)\\n col = self.colswitch[col]\\n totoffset = col - row\\n for i in np.diagonal(mirrorboard, offset=totoffset):\\n # Check other diagonal\\n if i == player:\\n count += 1\\n else:\\n count = 0\\n\\n if count == self.max_count:\\n return True\",\n \"def check_if_user_won(self, board, pos, player_no):\\n\\n has_player_got_4 = set()\\n has_player_got_4.add(pos)\\n\\n self.check_horizontal(has_player_got_4, board, pos, player_no)\\n\\n if len(has_player_got_4) >= 4:\\n return True\\n\\n has_player_got_4 = set()\\n has_player_got_4.add(pos)\\n\\n self.check_vertical(has_player_got_4, board, pos, player_no)\\n\\n if len(has_player_got_4) >= 4:\\n return True\\n\\n has_player_got_4 = set()\\n has_player_got_4.add(pos)\\n\\n self.check_diagonal(has_player_got_4, board, pos, player_no)\\n\\n if len(has_player_got_4) >= 4:\\n return True\\n\\n has_player_got_4 = set()\\n has_player_got_4.add(pos)\\n\\n self.check_inverted_diagonal(has_player_got_4, board, pos, player_no)\\n\\n if len(has_player_got_4) >= 4:\\n return True\\n\\n if self.check_if_board_full(board):\\n self.draw = True\\n return True\",\n \"def winner(self):\\n\\n if self.game_ended():\\n return self.winning()\\n else:\\n return 0\",\n \"def game_over(self):\\n return bool(self.last_round and self.last_player == self.current_player)\",\n \"def win_game(board :list) -> bool:\\n if board == win_state:\\n return True\\n return False\",\n \"def player_has_won(self):\\n return len(self._words_guessed) == self._num_words\",\n \"def is_over(self, board):\\n if _winner(board) != 0:\\n return True\\n return False\",\n \"def playerCanPlay(game, situation, player):\\r\\n return True\",\n \"def row_win(board, player):\\n for row in board:\\n if check_row(row, player):\\n return True\\n return False\",\n \"def game_over(players):\\n active_players = players_with_decks(players)\\n if not active_players or len(active_players) == 1:\\n return True\\n return False\",\n \"def is_winner(self, player, cell):\\n \\n if len(self.moves) > 2:\\n # Need at least 3 moves for a player to win. Normally\\n # would be 5, but turn enforcement is not implemented here.\\n \\n column = cell % 3\\n row = cell - (cell % 3)\\n diagonal = cell % 2 == 0\\n \\n victory = False\\n \\n # For these checks, we slice the cells in question out of the\\n # board, compare them all to the player, and finally check that\\n # each is True.\\n if diagonal:\\n victory = victory or \\\\\\n all([c == player for c in self.cells[0:9:4]]) or \\\\\\n all([c == player for c in self.cells[2:8:2]])\\n \\n victory = victory or \\\\\\n all([c == player for c in self.cells[column:9:3]]) or \\\\\\n all([c == player for c in self.cells[row:row+3]])\\n \\n return victory\\n return False\",\n \"def check_win(self, board, move):\\n for i, j, k in self.winning_cases:\\n if board[i] == move and board[j] == move and board[k] == move:\\n return True\\n return False\",\n \"def game_over(self):\\n\\n if self._number_of_moves == 9:\\n return True\\n\\n return self._number_of_moves == 9 or self.winner_found()\",\n \"def check_winner(self):\\n for row in self.board.values():\\n if all([mark == \\\"x\\\" for mark in row]):\\n return self.player_1\\n elif all([mark == \\\"o\\\" for mark in row]):\\n return self.player_2\\n\\n # checks every column\\n for i in range(3):\\n first_row, second_row, third_row = self.board.values()\\n if first_row[i] == \\\"x\\\" and second_row[i] == \\\"x\\\" and third_row[i] == \\\"x\\\":\\n return self.player_1\\n elif first_row[i] == \\\"o\\\" and second_row[i] == \\\"o\\\" and third_row[i] == \\\"o\\\":\\n return self.player_2\\n\\n # checks the diagonals\\n if self.board[\\\"a\\\"][0] == \\\"x\\\" and self.board[\\\"b\\\"][1] == \\\"x\\\" and self.board[\\\"c\\\"][2] == \\\"x\\\":\\n return self.player_1\\n if self.board[\\\"a\\\"][2] == \\\"o\\\" and self.board[\\\"b\\\"][1] == \\\"o\\\" and self.board[\\\"c\\\"][0] == \\\"o\\\":\\n return self.player_2\\n\\n return None\",\n \"def is_winning_state(self):\\n return self.game.is_winning_state()\",\n \"def check_for_win(self, index):\\n\\n\\t\\tpossible_comb = self.cell_combinations[index]\\n\\n\\t\\tfor comb in possible_comb:\\n\\n\\t\\t\\ttokens = []\\n\\t\\t\\ttokens.append(self.player_model.grid[comb[0]].token)\\n\\t\\t\\ttokens.append(self.player_model.grid[comb[1]].token)\\n\\t\\t\\ttokens.append(self.player_model.grid[comb[2]].token)\\n\\n\\t\\t\\tif all([token == self.player_model.current_player.token for token in tokens]):\\n\\n\\t\\t\\t\\treturn True\\n\\n\\t\\treturn False\",\n \"def __check_win_condition(self,token,coordinate):\\n # Check if it's even possible to win yet\\n if self._turn_counter >= 8 and self._turn_counter+1 < self._board_size**2:\\n # Disable win\\n # return False\\n\\n # Up and up right vectors\\n vec1=(1,0)\\n vec2=(1,1)\\n\\n # Loop both directions of vector\\n for _ in range(2):\\n if self.__check_direction(vec1,coordinate):\\n self.__declare_winner()\\n return True\\n if self.__check_direction(vec2,coordinate):\\n self.__declare_winner()\\n return True\\n\\n # Turn vector directions\\n vec1 = -vec1[1], vec1[0]\\n vec2 = -vec2[1], vec2[0]\\n\\n # Check for draw\\n elif self._turn_counter+1 >= self._board_size**2:\\n if (self._gui):\\n self.__turn_counter_label[\\\"text\\\"] = \\\"Draw!\\\"\\n self.__status[\\\"text\\\"] = \\\"\\\"\\n self.__status.update()\\n self.__turn_counter_label.update()\\n self._winner = 3\\n if (self._state == PLAY): showerror(\\\"Draw\\\",\\\"Draw!\\\")\\n return True\",\n \"def check_winner(self):\\n if self.player1.chips <= BIG_BLIND_BET:\\n return 2\\n elif self.player2.chips <= BIG_BLIND_BET:\\n return 1\\n else:\\n return 0\",\n \"def player_win(self):\\r\\n\\r\\n self.summary = (\\\" \\\" * 83) + \\\"YOU WIN\\\"\\r\\n print(\\\"Player wins against opponent.\\\\n\\\")\\r\\n self.player_wins += 1\",\n \"def check_for_winner(self):\\r\\n\\r\\n # Iterate through the rows\\r\\n for row in range(self.height):\\r\\n if self.board[row][0] == self.board[row][1] == self.board[row][2] and self.board[row][0] != None:\\r\\n return Board.WIN if self.board[row][0] else Board.LOSS\\r\\n\\r\\n # Iterate through the columns\\r\\n for col in range(self.width):\\r\\n if self.board[0][col] == self.board[1][col] == self.board[2][col] and self.board[0][col] != None:\\r\\n return Board.WIN if self.board[0][col] else Board.LOSS\\r\\n\\r\\n # Diagonals\\r\\n if self.board[0][0] == self.board[1][1] == self.board[2][2] and self.board[0][0] != None:\\r\\n return Board.WIN if self.board[0][0] else Board.LOSS\\r\\n if self.board[0][2] == self.board[1][1] == self.board[2][0] and self.board[0][2] != None:\\r\\n return Board.WIN if self.board[0][2] else Board.LOSS\\r\\n\\r\\n # No winner yet\\r\\n return 0\",\n \"def enough_players():\\n return True\",\n \"def check_win(self) -> None:\\n if self.word == \\\"\\\".join(self.word2):\\n print(f\\\"You won! Word: {self.word}\\\")\\n self.play_again()\\n elif self.errors == self.attempts:\\n print(f\\\"You lose!\\\\nThe word was: {self.word}\\\")\\n self.play_again()\",\n \"def has_won(self):\\n return len(self.hand) == 0\",\n \"def is_round_over(whose_turn,players):\\n if ((len(players[whose_turn].hand.cards) == 0) and (players[whose_turn].has_discarded == True)):\\n round_over = True\\n else:\\n round_over = False\\n return round_over\",\n \"def checkForWin(self, tracker):\\n\\n # Check damage levels for all ships in the tracker\\n # 0 = Fully damaged (sunk), Non-zero otherwise\\n for i in tracker.values():\\n if i != 0:\\n break\\n else:\\n return True\\n return False\",\n \"def is_over(self):\\n winner = self.get_winner()\\n status = bool(winner or not self.available_moves)\\n return status, winner\",\n \"def get_win_condition(self, info: Dict[str, Any]) -> bool:\\n if not self.possible_to_win:\\n return False\\n return not info[\\\"lost_live\\\"] and info[\\\"terminal\\\"]\",\n \"def winner(position, player):\\n if position == 100:\\n print(\\\"Congratulations,\\\",player + \\\", you have won.\\\")\\n return True\\n else:\\n return False\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.82665426","0.8169365","0.8155496","0.7858614","0.78276265","0.7803459","0.7798291","0.77653474","0.77357554","0.76523876","0.7650778","0.7639162","0.76185304","0.7592742","0.75793433","0.757934","0.7569485","0.75380087","0.7517126","0.74795717","0.7467015","0.7464727","0.7422103","0.73940426","0.73882407","0.7370998","0.73498994","0.7340067","0.732755","0.7325881","0.732211","0.7320684","0.73188543","0.7317892","0.7317396","0.73022884","0.7297983","0.72921306","0.7275481","0.7269435","0.72635806","0.72635365","0.7253548","0.72512376","0.7244091","0.7216195","0.7198554","0.71901447","0.71795195","0.7167977","0.7167264","0.7160922","0.7108491","0.7104755","0.709937","0.70861214","0.7084189","0.70807725","0.70732284","0.7063544","0.70584935","0.7050873","0.7038908","0.70350367","0.7033918","0.7032862","0.6996194","0.69948727","0.6988028","0.6975339","0.6972975","0.6963928","0.693865","0.69325095","0.6923861","0.6922583","0.6921967","0.6915704","0.6912867","0.69078374","0.6907316","0.6898464","0.6891929","0.688989","0.6883125","0.68608737","0.68562895","0.6855568","0.6855036","0.68531066","0.68487024","0.684503","0.6829715","0.68077207","0.68017864","0.67919403","0.67873746","0.67869467","0.67777896","0.67689145"],"string":"[\n \"0.82665426\",\n \"0.8169365\",\n \"0.8155496\",\n \"0.7858614\",\n \"0.78276265\",\n \"0.7803459\",\n \"0.7798291\",\n \"0.77653474\",\n \"0.77357554\",\n \"0.76523876\",\n \"0.7650778\",\n \"0.7639162\",\n \"0.76185304\",\n \"0.7592742\",\n \"0.75793433\",\n \"0.757934\",\n \"0.7569485\",\n \"0.75380087\",\n \"0.7517126\",\n \"0.74795717\",\n \"0.7467015\",\n \"0.7464727\",\n \"0.7422103\",\n \"0.73940426\",\n \"0.73882407\",\n \"0.7370998\",\n \"0.73498994\",\n \"0.7340067\",\n \"0.732755\",\n \"0.7325881\",\n \"0.732211\",\n \"0.7320684\",\n \"0.73188543\",\n \"0.7317892\",\n \"0.7317396\",\n \"0.73022884\",\n \"0.7297983\",\n \"0.72921306\",\n \"0.7275481\",\n \"0.7269435\",\n \"0.72635806\",\n \"0.72635365\",\n \"0.7253548\",\n \"0.72512376\",\n \"0.7244091\",\n \"0.7216195\",\n \"0.7198554\",\n \"0.71901447\",\n \"0.71795195\",\n \"0.7167977\",\n \"0.7167264\",\n \"0.7160922\",\n \"0.7108491\",\n \"0.7104755\",\n \"0.709937\",\n \"0.70861214\",\n \"0.7084189\",\n \"0.70807725\",\n \"0.70732284\",\n \"0.7063544\",\n \"0.70584935\",\n \"0.7050873\",\n \"0.7038908\",\n \"0.70350367\",\n \"0.7033918\",\n \"0.7032862\",\n \"0.6996194\",\n \"0.69948727\",\n \"0.6988028\",\n \"0.6975339\",\n \"0.6972975\",\n \"0.6963928\",\n \"0.693865\",\n \"0.69325095\",\n \"0.6923861\",\n \"0.6922583\",\n \"0.6921967\",\n \"0.6915704\",\n \"0.6912867\",\n \"0.69078374\",\n \"0.6907316\",\n \"0.6898464\",\n \"0.6891929\",\n \"0.688989\",\n \"0.6883125\",\n \"0.68608737\",\n \"0.68562895\",\n \"0.6855568\",\n \"0.6855036\",\n \"0.68531066\",\n \"0.68487024\",\n \"0.684503\",\n \"0.6829715\",\n \"0.68077207\",\n \"0.68017864\",\n \"0.67919403\",\n \"0.67873746\",\n \"0.67869467\",\n \"0.67777896\",\n \"0.67689145\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.796108"},"document_rank":{"kind":"string","value":"3"}}},{"rowIdx":94792,"cells":{"query":{"kind":"string","value":"needed for search Gets the number pawns on the board of a color."},"document":{"kind":"string","value":"def count(self,color):\n count = 0\n for y in range(0,HEIGHT):\n for x in range(0,WIDTH):\n if(self.gameState[x,y]==color):\n count+=1\n return count"},"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 count_colors(board, color):\n n = 0\n for cell in board:\n if cell == color:\n n += 1\n elif cell == cinv(color):\n n -= 1\n return n","def sum_color(self, board, color):\n sum_of_color = 0\n for i in range(board.size):\n for j in range(board.size):\n if board.board[i][j].name == color:\n sum_of_color += 1\n return sum_of_color","def currentScore(self, playerColor):\n total = 0\n for col in range(0, 8):\n for row in range(0, 8):\n if self.board[col][row].color == playerColor:\n total+=1\n return total","def get_color_count(self, color, filled):\n count = 0\n for cell in filled:\n coord_x = cell[1]\n coord_y = cell[0]\n\n # up\n if coord_y - 1 >= 0:\n new_cell = (coord_y-1, coord_x)\n cell_up_color = self.get_color(new_cell)\n if cell_up_color == color and new_cell not in filled:\n count += 1\n filled.append(new_cell)\n\n # down\n if coord_y + 1 < self.height:\n new_cell = (coord_y+1, coord_x)\n cell_down_color = self.get_color(new_cell)\n if cell_down_color == color and new_cell not in filled:\n count += 1\n filled.append(new_cell)\n\n # left\n if coord_x - 1 >= 0:\n new_cell = (coord_y, coord_x-1)\n cell_left_color = self.get_color(new_cell)\n if cell_left_color == color and new_cell not in filled:\n count += 1\n filled.append(new_cell)\n\n # right\n if coord_x + 1 < self.width:\n new_cell = (coord_y, coord_x+1)\n cell_right_color = self.get_color(new_cell)\n if cell_right_color == color and new_cell not in filled:\n count += 1\n filled.append(new_cell)\n\n return count","def getNumberPoints(self, move):\r\n (current_point_white, current_point_black) = self._board.get_nb_pieces()\r\n self._board.push(move)\r\n (new_point_white, new_point_black) = self._board.get_nb_pieces()\r\n self._board.pop()\r\n \r\n if(self._mycolor == 1): #black\r\n return (new_point_black-current_point_black) \r\n else:\r\n return (new_point_white-current_point_white)","def numerocuadrado(posicion_del_mouse):\r\n\r\n for j in range(16):\r\n if Totalcuadrados[j].collidepoint(posicion_del_mouse):\r\n return j+1","def count_legal_moves(board, color):\n return len(legal_moves(board, color))","def eval_board(self, board):\n\t\ts = 0\n\t\t\n\t\tfor i in board.columns:\n\t\t\tfor j in board.rows:\n\t\t\t\tif board[i+j] == self.color:\n\t\t\t\t\n\t\t\t\t\tif i in ['A', 'H'] or j in ['1', '8']:\n\t\t\t\t\t\tif i + j in ['A1', 'A8', 'H1', 'H8']:\n\t\t\t\t\t\t\ts += 4\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\ts += 2\n\t\t\t\t\telse:\n\t\t\t\t\t\ts += 1\n\t\treturn s","def count_neighbors(lights, r, c):\n neighbors = 0\n\n if r > 0 and c > 0: # 1\n neighbors += 1 if lights[r - 1][c - 1] == \"#\" else 0\n\n if r > 0: # 2\n neighbors += 1 if lights[r - 1][c] == \"#\" else 0\n\n if r > 0 and c < GRID_SIZE - 1: # 3\n neighbors += 1 if lights[r - 1][c + 1] == \"#\" else 0\n\n if c < GRID_SIZE - 1: # 4\n neighbors += 1 if lights[r][c + 1] == \"#\" else 0\n\n if r < GRID_SIZE - 1 and c < GRID_SIZE - 1: # 5\n neighbors += 1 if lights[r + 1][c + 1] == \"#\" else 0\n\n if r < GRID_SIZE - 1: # 6\n neighbors += 1 if lights[r + 1][c] == \"#\" else 0\n\n if r < GRID_SIZE - 1 and c > 0: # 7\n neighbors += 1 if lights[r + 1][c - 1] == \"#\" else 0\n\n if c > 0: # 8\n neighbors += 1 if lights[r][c - 1] == \"#\" else 0\n\n return neighbors","def countDiff(self, color):\n count = 0\n for y in range(self.n):\n for x in range(self.n):\n if self[x][y]==color:\n count += 1\n if self[x][y]==-color:\n count -= 1\n return count","def get_disk_count(self, self_color, board):\r\n count = 0\r\n for r in range(8):\r\n for c in range(8):\r\n if board[r][c] == self_color:\r\n count += 1\r\n return count","def get_num_moves(self, player: PlayerColor) -> int:\r\n player_squares: List[Square] = self.get_player_squares(player)\r\n count: int = 0\r\n for player_square in player_squares:\r\n adj_squares: List[Square] = \\\r\n self._get_adjacent_squares(player_square.pos)\r\n for adj_square in adj_squares:\r\n if (adj_square.state == SquareState.OPEN):\r\n count += 1\r\n elif(adj_square.state == SquareState.OCCUPIED):\r\n opposite_square: Square = \\\r\n self.squares.get(\r\n self._get_opposite_pos(player_square.pos,\r\n adj_square.pos))\r\n if (opposite_square is not None\r\n and opposite_square.state == SquareState.OPEN):\r\n count += 1\r\n\r\n return count","def count_pixels_of_certain_color(\n self, color: Tuple[int, int, int]\n ) -> int:\n image = self.image\n\n color = CVUtils.rgb_to_bgr(color)\n\n mask = cv2.inRange(image, color, color)\n return cv2.countNonZero(mask)","def get_neighbors_of(cell, board):\n count = 0\n (x, y) = cell\n for cell in board:\n if cell == (x - 1, y - 1):\n count += 1\n elif cell == (x, y - 1):\n count += 1\n elif cell == (x + 1, y - 1):\n count += 1\n elif cell == (x - 1, y):\n count += 1\n elif cell == (x + 1, y):\n count += 1\n elif cell == (x - 1, y + 1):\n count += 1\n elif cell == (x, y + 1):\n count += 1\n elif cell == (x + 1, y + 1):\n count += 1\n return count","def getAvailableMoves(self, checkColorIndex):\n checkColor = self.grid.REPRESENTATION[checkColorIndex]\n otherColor = self.grid.REPRESENTATION[1-checkColorIndex]\n emptyColor = self.grid.REPRESENTATION[2]\n\n result = 0\n for x in range(1, self.grid.width+1):\n for y in range(1, self.grid.height+1):\n if self.grid[x, y] != checkColor:\n continue\n\n if x - 2 >= 1 and self.grid[x - 1, y] == otherColor \\\n and self.grid[x - 2, y] == emptyColor:\n result += 1\n \n if x + 2 <= self.grid.width and self.grid[x + 1, y] == otherColor \\\n and self.grid[x + 2, y] == emptyColor:\n result += 1\n\n if y - 2 >= 1 and self.grid[x, y - 1] == otherColor \\\n and self.grid[x, y - 2] == emptyColor:\n result += 1\n\n if y + 2 <= self.grid.height and self.grid[x, y + 1] == otherColor \\\n and self.grid[x, y + 2] == emptyColor:\n result += 1\n return result","def getPieceCount(self, checkColorIndex):\n return self.grid.countPlayerX() if self.grid.REPRESENTATION[checkColorIndex] == 'X' \\\n else self.grid.countPlayerO()","def score(self, board: Block) -> int:\n grid = _flatten(board)\n left = grid[0]\n right = grid[-1]\n top = [i[0] for i in grid]\n bottom = [i[-1] for i in grid]\n score0 = left.count(self.colour)\n score1 = right.count(self.colour)\n score2 = top.count(self.colour)\n score3 = bottom.count(self.colour)\n return score0 + score1 + score2 + score3","def count_numbers(board: list, x: int, y: int):\n nums = []\n for i in range(9):\n # Adds number to list if it finds one in the col or row\n if not board[i][x] == 0:\n nums.append(board[i][x])\n if not board[y][i] == 0:\n nums.append(board[y][i])\n # Does the same as the find_group function, finds the group of the cell\n x_group = x - x % 3\n y_group = y - y % 3\n for i in range(3):\n for z in range(3):\n # Adds group numbers to list\n if not board[y_group + i][x_group + z] == 0:\n nums.append(board[y_group + i][x_group + z])\n # returns the length of unrepeated number in the col, row and group\n return len(set(nums))","def number_at_cell(game, pokemon_locations, grid_size, index):\n num = 0\n # number of Pokemon in neighbouring cells\n neighbours = neighbour_directions(index,grid_size)\n for neighbour in neighbours:\n if neighbour in pokemon_locations:\n num += 1\n return num","def get_player_piece_locs(self, mycolor):\n if mycolor not in (ChessGame.BLACK, ChessGame.WHITE):\n return None\n\n return self.__players[mycolor]","def neighbor(board, x, y, n, m):\n deltas = (\n (-1, -1), (-1, 0), (-1, 1),\n (0, -1), (0, 1),\n (1, -1), (1, 0), (1, 1),\n )\n count = 0\n for dx, dy in deltas:\n xx = x + dx\n yy = y + dy\n if xx >= 0 and xx < n and yy >= 0 and yy < m and board[xx][yy] % 2 == 1:\n count += 1\n\n return count","def _check_row(self, col, board) -> int:\n score = 0\n for row in range(len(board)):\n if board[col][row] == self.colour:\n score += 1\n return score","def get_carrot_count(matrix, pos, size):\n\n row, col = pos\n\n if on_board(pos, size):\n return (matrix[row][col], pos)\n\n return (0, (-1, -1))","def number_at_cell(self, pokemon_locations, grid_size, index):\n if self.get_game()[index] != UNEXPOSED:\n return int(self.get_game()[index])\n\n number = 0\n for neighbour in self.neighbour_directions(index, grid_size):\n if neighbour in pokemon_locations:\n number += 1\n\n return number","def get_neighbors(self, line, col):\n neighbors = 0\n for line_shift in [-1, 0, 1]:\n for col_shift in [-1, 0, 1]:\n if line_shift == 0 and col_shift == 0:\n continue # Do not count given cell\n # % connects left/right and up/down\n i = (line + line_shift) % self.lines\n j = (col + col_shift) % self.cols\n if self[i][j] == self.cell_state['alive']:\n neighbors += 1\n return neighbors","def count_winning_blocks(self, gameboard):\r\n count = {'red':0.1, 'blue':0.1}\r\n for x in range(gameboard.height):\r\n for y in range(gameboard.width):\r\n position = (x, y)\r\n h = gameboard.check_horizontal_state(position)\r\n v = gameboard.check_vertical_state(position)\r\n d1 = gameboard.check_diag_1_state(position)\r\n d2 = gameboard.check_diag_2_state(position)\r\n for state in [h, v, d1, d2]:\r\n if ((state.count('red') + state.count('x') == 5)\r\n and (state.count('red') > 0)):\r\n count['red'] += np.power(3, (state.count('red') - 1))\r\n elif ((state.count('blue') + state.count('x') == 5)\r\n and (state.count('blue') > 0)):\r\n count['blue'] += np.power(3, (state.count('blue') - 1))\r\n return count","def get_num_explored(self):\n return self.__num_explored","def getEgdePieceCount(self, checkColorIndex):\n return self.grid.countPlayerXEdge() if self.grid.REPRESENTATION[checkColorIndex] == 'X' \\\n else self.grid.countPlayerOEdge()","def count_neighbors(self, row, col):\n neighbors = 0\n neighbors += self.get_cell_value(row - 1, col - 1)\n neighbors += self.get_cell_value(row - 1, col)\n neighbors += self.get_cell_value(row - 1, col + 1)\n neighbors += self.get_cell_value(row, col - 1)\n neighbors += self.get_cell_value(row, col + 1)\n neighbors += self.get_cell_value(row + 1, col - 1)\n neighbors += self.get_cell_value(row + 1, col)\n neighbors += self.get_cell_value(row + 1, col + 1)\n\n return neighbors","def get_neighbour(self, y, x):\n if [y, x] in self.mine_locations:\n return Minesweeper.BOMB\n count = 0\n # (x-1, y-1), (x, y-1), (x+1, y-1),\n # (x-1, y), (x, y), (x+1, y),\n # (x-1, y+1), (x, y+1), (x+1, y+1)\n for xe in range(x - 1, x + 2):\n for ye in range(y - 1, y + 2):\n if [ye, xe] in self.mine_locations:\n count += 1\n return str(count)","def queryNumberOfColors(self):\n self._numColorsInUse = \\\n self._readInt('How many colors are available', 2, len(self._palette))\n return self._numColorsInUse","def count_neighbors(self, x, y):\n # IMPLEMENT ME\n # HINT: You do not have to use a for-loop for this method; just\n # if-statements will suffice. Also, you do not need to indent further\n # than two levels further than this comment.\n neighbours = 0\n if x > 0 and y > 0:\n if self.board[x-1][y-1] == \"x\":\n neighbours += 1\n if x > 0:\n if self.board[x-1][y] == \"x\":\n neighbours += 1\n if x > 0 and y < self.width - 1:\n if self.board[x-1][y+1] == \"x\":\n neighbours += 1\n if y > 0:\n if self.board[x][y-1] == \"x\":\n neighbours += 1\n if y < self.width - 1:\n if self.board[x][y+1] == \"x\":\n neighbours += 1\n if x < self.height - 1 and y > 0:\n if self.board[x+1][y-1] == \"x\":\n neighbours += 1\n if x < self.height - 1:\n if self.board[x+1][y] == \"x\":\n neighbours += 1\n if x < self.height - 1 and y < self.width - 1:\n if self.board[x+1][y+1] == \"x\":\n neighbours += 1\n return neighbours","def decide_color(tile, board, n, colours):\n list_c = colours.copy()\n origin_color = board[0,0]\n list_c.remove(origin_color)\n colour_2 = list_c[0]\n list_c.remove(colour_2)\n colour_3 = list_c[0]\n c2_count = 0\n c3_count = 0\n for el in tile:\n el_x = el[0]\n el_y = el[1]\n if el_x + 1 < n:\n if board[el_x+1, el[1]] == colour_2:\n c2_count += 1\n if board[el_x+1, el_y] == colour_3:\n c3_count += 1\n if el_y + 1 < n:\n if board[el_x, el_y+1] == colour_2:\n c2_count += 1\n if board[el_x, el_y+1] == colour_3:\n c3_count += 1\n\n if c2_count > c3_count:\n colour = colour_2\n\n if c2_count <c3_count:\n colour = colour_3\n\n if c2_count == c3_count:\n colour = colour_2\n return colour","def corner_score(self, size: int,\n board: List[List[Tuple[int, int, int]]]) -> int:\n score = 0\n bound = size - 1\n corners = [(0, 0), (0, bound), (bound, 0), (bound, bound)]\n for corner in corners:\n if board[corner[0]][corner[1]] == self.colour:\n score += 1\n return score","def getPlayer(board):\n count_x, count_o = 0, 0\n for row in board:\n count_x += row.count(X)\n count_o += row.count(O)\n if count_x > count_o:\n return O\n return X","def get_neighbors(arr, pos, color):\n neighbors = []\n try:\n if arr[pos[0] + 1][pos[1]] == color:\n neighbors.append((pos[0] + 1, pos[1]))\n except IndexError:\n pass\n try:\n if arr[pos[0] - 1][pos[1]] == color:\n neighbors.append((pos[0] - 1, pos[1]))\n except IndexError:\n pass\n try:\n if arr[pos[0] + 1][pos[1]] == color:\n neighbors.append((pos[0] + 1, pos[1]))\n except IndexError:\n pass\n try:\n if arr[pos[0]][pos[1] - 1] == color:\n neighbors.append((pos[0], pos[1] - 1))\n except IndexError:\n pass\n return neighbors","def get_num_black_pieces(self):\n return self.num_black_pieces","def count_chips(board, player):\n cont = 0\n for row in board:\n for col in row:\n if col == PLAYER_CHIPS[player]:\n cont += 1\n return cont","def count_island(row, col, island):\n count = 0\n for i in range(row):\n for j in range(col):\n count = count + floodfill(i, j, row, col, island)\n return count","def get_piece_type_positions_by_color(self, leading_color: chess.Color):\n\n # layers with pieces of current player will be stacked on layers of other player\n if leading_color == chess.WHITE:\n return np.vstack((self.__white, self.__black))\n elif leading_color == chess.BLACK:\n return np.vstack((self.__black, self.__white))","def checkNumNeighbors():","def player(board):\n\n if terminal(board):\n return 7\n\n numX = 0\n numO = 0\n\n for i in board:\n for j in i:\n if j == X:\n numX = numX + 1\n elif j == O:\n numO = numO + 1\n\n if numX == numO:\n return X\n else:\n return O","def _getNumcam( self, bSeed ):\n\n\t\treturn ( ( bSeed >> 20 ) & 0xF ) + 1","def h(self, node):\n count_peg = -1\n for line in node.state.board:\n count_peg += line.count(c_peg())\n return count_peg","def _count_adj_occupied(grid: List[List[str]], row: int, col: int) -> int:\n count = 0\n if row - 1 >= 0:\n if col - 1 >= 0:\n count += 1 if grid[row - 1][col - 1] == '#' else 0\n if col + 1 < len(grid[0]):\n count += 1 if grid[row - 1][col + 1] == '#' else 0\n count += 1 if grid[row - 1][col] == '#' else 0\n if row + 1 < len(grid):\n if col - 1 >= 0:\n count += 1 if grid[row + 1][col - 1] == '#' else 0\n if col + 1 < len(grid[0]):\n count += 1 if grid[row + 1][col + 1] == '#' else 0\n count += 1 if grid[row + 1][col] == '#' else 0\n if col - 1 >= 0:\n count += 1 if grid[row][col - 1] == '#' else 0\n if col + 1 < len(grid[0]):\n count += 1 if grid[row][col + 1] == '#' else 0\n return count","def get_palette_index(self, color, level):\n if self.is_leaf():\n return self.palette_index\n index = self.get_color_index_for_level(color, level)\n if self.children[index]:\n return self.children[index].get_palette_index(color, level + 1)\n else:\n # get palette index for a first found child node\n for i in range(8):\n if self.children[i]:\n return self.children[i].get_palette_index(color, level + 1)","def slot_numbers_for_cars_with_colour(self, colour):\n\n if not self._is_valid():\n return\n\n colour = colour.lower()\n\n slot_nos = []\n\n for pslot in self.slots.values():\n if not pslot.available and pslot.car and pslot.car.colour.lower() == colour:\n slot_nos.append(str(pslot.slot_no))\n\n if slot_nos:\n print(\", \".join(slot_nos))\n else:\n print(\"Not found\")\n\n return slot_nos","def num_black_neighbors(tile, tiles):\n return sum([tiles[add(tile, step)] for step in NEIGHBORS])","def match(head_list_at_crossing, wall_color_at_crossing, p):\n num_index2 = int((p-1)/2)\n indicies_of_heads = []\n # print(num_index2)\n for i in range(1, num_index2+1):\n # print(i)\n # print(indicies_of_heads)\n indicies_of_heads += find(i, head_list_at_crossing)\n # print(indicies_of_heads)\n return indicies_of_heads","def get_trump_color(self):\n color_counter = collections.Counter()\n for card in self.hand:\n color = card.color\n if color == \"White\":\n continue\n color_counter[color] += 1\n if not color_counter.most_common(1):\n return super().get_trump_color()\n else:\n return color_counter.most_common(1)[0][0]","def checkWin(color_list):\n startcolor = color_list[0][0] #Saves color of [0][0] to variable for easy access\n for i in range(15):\n for k in range(25):\n if color_list[i][k] != startcolor: #If any color is not same as color on [0][0] stop and return False since game is not won\n return False\n return True #If all colors are the same as [0][0] the game ahs been won and return Tture","def rec_count(color : str) -> int:\n return sum(\n (1 + rec_count(child)) * count\n for child, count in contents[color].items()\n )","def get_palette_index(self, color):\n return self.root.get_palette_index(color, 0)","def countOccupied(data):\n\tcounter = 0\n\n\t# loop through rows and columns and\n\t# count the number of '#'s\n\tfor r in range(len(data)):\n\t\tfor c in range(len(data[r])):\n\t\t\tif data[r][c] == '#':\n\t\t\t\tcounter += 1\n\n\treturn counter","def color_in_check(self, mycolor):\n\n opponent = self.__players[self.get_opponent_color(mycolor)]\n\n x, y = None, None\n for (u, v) in self.__players[mycolor]:\n piece = self.get_piece(u, v)\n if not piece:\n raise ValueError()\n\n if self.get_piece(u, v).name == 'king':\n x, y = u, v\n break\n\n for (u, v) in opponent:\n if (x, y) in self._get_piece_moves(u, v):\n return True\n\n return False","def __moves_available(self, board: Board):\n player_moves = self.get_num_of_moves(board, self.player_color)\n opponent_moves = self.get_num_of_moves(board, self.opponent_color)\n # print(len(player_moves), len(opponent_moves))\n\n return player_moves - opponent_moves * 3","def getNumEmptyHouses(self, prop_colour):\n colour_monopolies = database_creator.db.query(\n \"SELECT num_of_houses FROM main_property_deck WHERE property_colour = :prop_colour\", prop_colour=prop_colour)\n self.numUnbuilt = []\n for i in colour_monopolies:\n d = 5-int(i.num_of_houses)\n self.numUnbuilt.append(d)\n #print(self.numUnbuilt)\n return self.numUnbuilt","def getWinner(self):\n global vertical_win\n global done\n lines = (\n self.board, # columns\n zip(*self.board), # rows\n diagonalsPos(self.board, self.cols, self.rows), # positive diagonals\n diagonalsNeg(self.board, self.cols, self.rows) # negative diagonals\n )\n\n for sublist in self.board:\n if sublist[0] == sublist[1] == sublist[2] == sublist[3] or sublist[1] == sublist[2] == sublist[3] == \\\n sublist[4] or sublist[2] == sublist[3] == sublist[4] == sublist[5]:\n vertical_win = True\n\n for line in chain(*lines):\n for color, group in groupby(line):\n if color != 0 and len(list(group)) >= self.win:\n done = True\n return color\n counter = 0\n for sublist in self.board:\n for i in sublist:\n if i != 0:\n counter += 1\n if counter == 42:\n done = True\n return Tie","def check_up(self, i, j, board):\r\n color = board.pieceAt(i, j)\r\n\r\n row = True\r\n for k in range(4):\r\n row &= board.pieceAt(i-k, j) is color\r\n\r\n if row:\r\n return color\r\n else:\r\n return Color.EMPTY","def player(board):\n\n count_x = 0\n count_o = 0\n for i in board:\n for j in i:\n if (j == X):\n count_x += 1\n elif (j == O):\n count_o += 1\n if (count_x <= count_o):\n return X\n else:\n return O","def get_color_index(position):\n\n\t\tcolors = {\"blue\": 6,\n\t\t\t\t\t\t\t\"red\": 13,\n\t\t\t\t\t\t\t\"yellow\": 17,\n\t\t\t\t\t\t\t\"light_blue\": 18,\n\t\t\t\t\t\t\t\"pink\": 20,\n\t\t\t\t\t\t\t\"purple\": 30}\n\n\t\tpositions = {\"C\": \"yellow\",\n\t\t\t\t\t\t\t\t \"R\": \"red\",\n\t\t\t\t\t\t\t\t \"L\": \"blue\"}\n\n\t\tindex = colors.get(positions.get(position[0], None), None)\n\t\tif not index:\n\t\t\t\traise KeyError(\"Position color index '%s' not recognised.\" % position)\n\n\t\treturn index","def n_neighbors(self,n):\n return sum(1 for x in self.hex.get_neighbors_ring(n) if x is not None and x.is_occupied == 1)","def value(self):\n black, white = 0, 0\n for sq in Othello.squares():\n piece = self.__board[sq]\n if piece == BLACK: black += 1\n elif piece == WHITE: white += 1\n if black == white:\n return 0.5\n elif black > white:\n return 1\n else:\n return 0","def player(board):\n X_count = 0\n O_count = 0\n\n for row in board:\n X_count += row.count(X)\n O_count += row.count(O)\n\n if X_count <= O_count:\n return X\n else:\n return O","def get_piece_dict(self, mycolor):\n pieces = { (x, y) : self.get_piece(x, y) for (x, y) in\n self.__players[mycolor] }\n if None in pieces.values():\n raise ValueError()\n return pieces","def get_legal_moves(self, color):\n moves = [] # stores the legal moves.\n # Get all the squares with pieces of the given color.\n for x in range(self.n):\n for y in range(self.n):\n if self[x][y]==0:\n moves.append((x,y))\n return moves","def G_colour_count(self, r, b=-1):\n counts = [0 for _ in range(r)]\n for row in self.G_colour_tableau(r,b):\n for cell_colour in row:\n counts[cell_colour] += 1\n assert sum(counts) == self.size()\n return counts","def get_number(self, row, col):\r\n return self._grid[row][col]","def get_number(self, row, col):\r\n return self._grid[row][col]","def get_number(self, row, col):\r\n return self._grid[row][col]","def get_pile_size_in_col(self, col, only_faceup=False) -> int:\n cards = 0\n # return -1 if col does not exist\n if col < 0 or col >= 7:\n return 0\n # count the cards. 0 = not a card\n if only_faceup:\n for card in self.solitaire[col]:\n if card != 0 and not None and not card.is_facedown:\n cards += 1\n return cards\n else:\n for card in self.solitaire[col]:\n if card != 0:\n cards += 1\n else:\n break\n return cards","def get_neighbour_squares_idx(self, pos):\n if pos:\n possible_values = {0, 1, 2}\n col_variation = zip( [pos[0], pos[0]], possible_values - {pos[1]} )\n row_variation = zip( possible_values - {pos[0]}, [pos[1], pos[1]] )\n return list(col_variation), list(row_variation)","def color_column(self):\n return 8","def player(board):\n num_x = sum([list.count(X) for list in board])\n num_o = sum([list.count(O) for list in board])\n if num_x == num_o:\n return X\n else:\n return O","def _count_seen_occupied(grid: List[List[str]], row: int, col: int) -> int:\n count = 0\n for dx in [-1, 0, 1]:\n for dy in [-1, 0, 1]:\n if not (dx == 0 and dy == 0):\n count += 1 if _is_occupied(grid, row, col, dx, dy) else 0\n return count","def getPixelColor(self, n):\n self._logger.debug(\"getPixelColor\")","def heuristic_takeAllPiece(board, player):\n\n if player is board._WHITE:\n return board._nbWHITE - board._nbBLACK\n \n return board._nbBLACK - board._nbWHITE","def howManyNeigbors(board,row,col):\r\n\tneigbors = 0\r\n\tif board[row-1][col-1] == 1:\r\n\t\tneigbors += 1\r\n\tif board[row-1][col] == 1:\r\n\t\tneigbors += 1\r\n\tif board[row-1][col+1] == 1:\r\n\t\tneigbors += 1\r\n\tif board[row][col-1] == 1:\r\n\t\tneigbors += 1\r\n\tif board[row][col+1] == 1:\r\n\t\tneigbors += 1\r\n\tif board[row+1][col-1] == 1:\r\n\t\tneigbors += 1\r\n\tif board[row+1][col] == 1:\r\n\t\tneigbors += 1\r\n\tif board[row+1][col+1] == 1:\r\n\t\tneigbors += 1\r\n\treturn neigbors","def score(self, board: Block) -> int:\r\n target_colour = self.colour\r\n score = 0\r\n flat_list = _flatten(board)\r\n for j in range(len(flat_list)):\r\n if flat_list[0][j] == target_colour:\r\n if j in [0, len(flat_list) - 1]:\r\n score += 2\r\n else:\r\n score += 1\r\n for j in range(len(flat_list)):\r\n if flat_list[-1][j] == target_colour:\r\n if j in [0, len(flat_list) - 1]:\r\n score += 2\r\n else:\r\n score += 1\r\n for j in range(2): # first and last row\r\n for i in range(1, len(flat_list) - 1): # deduct corners\r\n if flat_list[i][-j] == target_colour:\r\n score += 1\r\n return score","def random_neighbors(self) -> int:\n return self.__random_neighbors","def count_colors(cards: np.ndarray) -> np.ndarray:\n result = np.zeros(4, np.int32)\n cards.sum()\n result[0] = (cards[0:9]).sum()\n result[1] = (cards[9:18]).sum()\n result[2] = (cards[18:27]).sum()\n result[3] = (cards[27:36]).sum()\n return result","def count_bingo_board(board_num):\n bingo_score = 0\n for row in bingoboards[board_num]:\n bingo_score += sum(list(filter(lambda x: x != \"X\", row)))\n return bingo_score","def check_neighbours(r, c, board):\n NeighboursSum = 0\n\n for x in range(r - 1, r + 1):\n for y in range(c - 1, c + 1):\n NeighboursSum = NeighboursSum * board[x][y]\n\n return NeighboursSum","def get_number(self, row, col):\n return self._grid[row][col]","def get_number(self, row, col):\n return self._grid[row][col]","def get_number(self, row, col):\n return self._grid[row][col]","def get_number(self, row, col):\n return self._grid[row][col]","def houses(self):\n num = 0\n points = 0\n # TODO: add pattern matching\n if \"s\" in self.__as_str:\n num += 1\n if \"f\" in self.__as_str:\n num += 1\n if \"1\" in self.__as_str or \"2\" in self.__as_str or \"3\" in self.__as_str or \"4\" in self.__as_str:\n num += 1\n if \"o\" in self.__as_str:\n num += 1\n if \"p\" in self.__as_str:\n num += 1\n for i in range(4):\n for j in range(4):\n if self.as_list[i][j] == 'h':\n if 'f' in self.neighbours(i, j):\n points += 1\n else:\n points += num\n return points","def player(board) -> str:\n x_amount = 0\n o_amount = 0\n for row in board:\n for column in row:\n if column == X:\n x_amount += 1\n elif column == O:\n o_amount += 1\n\n return X if x_amount == o_amount else O","def get_color_index_for_level(self, color, level):\n index = 0\n mask = 0x80 >> level\n if color.red & mask:\n index |= 4\n if color.green & mask:\n index |= 2\n if color.blue & mask:\n index |= 1\n return index","def get_counts(self):\n counts = [0, 0]\n for i in range(self._num_rows):\n for j in range(self._num_cols):\n if self._board[i][j] == \"B\":\n counts[0] += 1\n elif self._board[i][j] == \"W\":\n counts[1] += 1\n return counts","def score(self):\r\n totN = 0\r\n totB = 0\r\n for l in range(SIZE):\r\n for c in range(len(COLONNES)):\r\n if self.jeu[l][c] == NOIR:\r\n totN += 1\r\n elif self.jeu[l][c] == BLANC:\r\n totB += 1\r\n return (totN, totB)","def get(self):\n # 8 timesteps, 6 piece types per player, 64 squares #FIXME: 1 timestep\n # 1 castling (which rooks can still castle)\n # 1 player color (1 if white, 0 if black)\n # 1 total move count\n # 1 moves without progress\n # TODO: add repetions (2): repetition count for that position (3 repitions is an autmatic draw)\n pieces = np.concatenate(self.boards)[::-1]\n pieces = np.concatenate(pieces)\n if len(pieces) == MAX_PIECE_INDEX:\n return pieces\n else:\n return np.concatenate((pieces, np.zeros(MAX_PIECE_INDEX-len(pieces), )))","def get_neighbors(self, node):\r\n neighbors = set()\r\n for neighbor in ORTHOGONAL_POSITIONS[(node.pos[0], node.pos[1])]:\r\n if self.board[neighbor[0]][neighbor[1]].color == node.color:\r\n neighbors.add(neighbor)\r\n else:\r\n continue\r\n return neighbors","def match(self, color: Color) -> ColorPoint:\n results = self.tree.search_nn(color.hsl)\n if not results:\n raise KeyError('No match found for color: {}'.format(color))\n return results[0].data","def find_possible_moves(self, board, self_color):\r\n possible_moves = []\r\n delta = [(0,-1), (-1,-1), (-1,0), (-1,1), (0,1), (1,1), (1,0), (1,-1)]\r\n\r\n for r in range(len(board)):\r\n for c in range(len(board[r])):\r\n if board[r][c] == self_color:\r\n for i in range(0, 8):\r\n coords = (r, c)\r\n\r\n found_move = self.check_moves(board, self_color, coords, delta[i])\r\n\r\n if found_move is not None and found_move not in possible_moves:\r\n possible_moves.append(found_move)\r\n return possible_moves","def nbr_tours(self):\n nbr_tours = 0\n for i in range(3):\n for j in range(3):\n if self.grille[i][j] != 0:\n nbr_tours += 1\n return nbr_tours","def gen_moves_list(self,color='',dontCallIsAttacked=False):\n \n if(color==''):\n color=self.side2move\n mList=[]\n \n # For each 'piece' on the board (pos1 = 0 to 63)\n for pos1,piece in enumerate(self.cases):\n \n # Piece (or empty square) color is not the wanted ? pass\n if piece.couleur!=color:\n continue\n \n if(piece.nom=='ROI'): # KING\n mList+=piece.pos2_roi(pos1,self.oppColor(color),self,dontCallIsAttacked)\n continue\n \n elif(piece.nom=='DAME'): # QUEEN = ROOK + BISHOP moves !\n mList+=piece.pos2_tour(pos1,self.oppColor(color),self)\n mList+=piece.pos2_fou(pos1,self.oppColor(color),self)\n continue\n \n elif(piece.nom=='TOUR'): # ROOK\n mList+=piece.pos2_tour(pos1,self.oppColor(color),self)\n continue\n \n elif(piece.nom=='CAVALIER'): # KNIGHT\n mList+=piece.pos2_cavalier(pos1,self.oppColor(color),self)\n continue\n \n elif(piece.nom=='FOU'): # BISHOP\n mList+=piece.pos2_fou(pos1,self.oppColor(color),self)\n continue\n \n if(piece.nom=='PION'): # PAWN\n mList+=piece.pos2_pion(pos1,piece.couleur,self)\n continue\n \n return mList","def _count_living_neighbors(self, cell: Cell) -> int:\n count = 0\n # borders of the area in which we are trying to find neighbors\n # Let's assume y axis directs downside and x axis directs to the left\n \n for x in range(cell.x - 1, cell.x + 2):\n for y in range(cell.y - 1, cell.y + 2):\n if cell.x == x and cell.y == y:\n continue\n if (x, y) in self.living_cells.keys():\n count += 1\n \n return count","def get_pieces_left(board, piece):\r\n\tpieces = 0\r\n\tfor row in board:\r\n\t\tfor col in row:\r\n\t\t\tif col == piece:\r\n\t\t\t\tpieces += 1\r\n\r\n\treturn pieces"],"string":"[\n \"def count_colors(board, color):\\n n = 0\\n for cell in board:\\n if cell == color:\\n n += 1\\n elif cell == cinv(color):\\n n -= 1\\n return n\",\n \"def sum_color(self, board, color):\\n sum_of_color = 0\\n for i in range(board.size):\\n for j in range(board.size):\\n if board.board[i][j].name == color:\\n sum_of_color += 1\\n return sum_of_color\",\n \"def currentScore(self, playerColor):\\n total = 0\\n for col in range(0, 8):\\n for row in range(0, 8):\\n if self.board[col][row].color == playerColor:\\n total+=1\\n return total\",\n \"def get_color_count(self, color, filled):\\n count = 0\\n for cell in filled:\\n coord_x = cell[1]\\n coord_y = cell[0]\\n\\n # up\\n if coord_y - 1 >= 0:\\n new_cell = (coord_y-1, coord_x)\\n cell_up_color = self.get_color(new_cell)\\n if cell_up_color == color and new_cell not in filled:\\n count += 1\\n filled.append(new_cell)\\n\\n # down\\n if coord_y + 1 < self.height:\\n new_cell = (coord_y+1, coord_x)\\n cell_down_color = self.get_color(new_cell)\\n if cell_down_color == color and new_cell not in filled:\\n count += 1\\n filled.append(new_cell)\\n\\n # left\\n if coord_x - 1 >= 0:\\n new_cell = (coord_y, coord_x-1)\\n cell_left_color = self.get_color(new_cell)\\n if cell_left_color == color and new_cell not in filled:\\n count += 1\\n filled.append(new_cell)\\n\\n # right\\n if coord_x + 1 < self.width:\\n new_cell = (coord_y, coord_x+1)\\n cell_right_color = self.get_color(new_cell)\\n if cell_right_color == color and new_cell not in filled:\\n count += 1\\n filled.append(new_cell)\\n\\n return count\",\n \"def getNumberPoints(self, move):\\r\\n (current_point_white, current_point_black) = self._board.get_nb_pieces()\\r\\n self._board.push(move)\\r\\n (new_point_white, new_point_black) = self._board.get_nb_pieces()\\r\\n self._board.pop()\\r\\n \\r\\n if(self._mycolor == 1): #black\\r\\n return (new_point_black-current_point_black) \\r\\n else:\\r\\n return (new_point_white-current_point_white)\",\n \"def numerocuadrado(posicion_del_mouse):\\r\\n\\r\\n for j in range(16):\\r\\n if Totalcuadrados[j].collidepoint(posicion_del_mouse):\\r\\n return j+1\",\n \"def count_legal_moves(board, color):\\n return len(legal_moves(board, color))\",\n \"def eval_board(self, board):\\n\\t\\ts = 0\\n\\t\\t\\n\\t\\tfor i in board.columns:\\n\\t\\t\\tfor j in board.rows:\\n\\t\\t\\t\\tif board[i+j] == self.color:\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif i in ['A', 'H'] or j in ['1', '8']:\\n\\t\\t\\t\\t\\t\\tif i + j in ['A1', 'A8', 'H1', 'H8']:\\n\\t\\t\\t\\t\\t\\t\\ts += 4\\n\\t\\t\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\t\\t\\ts += 2\\n\\t\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\t\\ts += 1\\n\\t\\treturn s\",\n \"def count_neighbors(lights, r, c):\\n neighbors = 0\\n\\n if r > 0 and c > 0: # 1\\n neighbors += 1 if lights[r - 1][c - 1] == \\\"#\\\" else 0\\n\\n if r > 0: # 2\\n neighbors += 1 if lights[r - 1][c] == \\\"#\\\" else 0\\n\\n if r > 0 and c < GRID_SIZE - 1: # 3\\n neighbors += 1 if lights[r - 1][c + 1] == \\\"#\\\" else 0\\n\\n if c < GRID_SIZE - 1: # 4\\n neighbors += 1 if lights[r][c + 1] == \\\"#\\\" else 0\\n\\n if r < GRID_SIZE - 1 and c < GRID_SIZE - 1: # 5\\n neighbors += 1 if lights[r + 1][c + 1] == \\\"#\\\" else 0\\n\\n if r < GRID_SIZE - 1: # 6\\n neighbors += 1 if lights[r + 1][c] == \\\"#\\\" else 0\\n\\n if r < GRID_SIZE - 1 and c > 0: # 7\\n neighbors += 1 if lights[r + 1][c - 1] == \\\"#\\\" else 0\\n\\n if c > 0: # 8\\n neighbors += 1 if lights[r][c - 1] == \\\"#\\\" else 0\\n\\n return neighbors\",\n \"def countDiff(self, color):\\n count = 0\\n for y in range(self.n):\\n for x in range(self.n):\\n if self[x][y]==color:\\n count += 1\\n if self[x][y]==-color:\\n count -= 1\\n return count\",\n \"def get_disk_count(self, self_color, board):\\r\\n count = 0\\r\\n for r in range(8):\\r\\n for c in range(8):\\r\\n if board[r][c] == self_color:\\r\\n count += 1\\r\\n return count\",\n \"def get_num_moves(self, player: PlayerColor) -> int:\\r\\n player_squares: List[Square] = self.get_player_squares(player)\\r\\n count: int = 0\\r\\n for player_square in player_squares:\\r\\n adj_squares: List[Square] = \\\\\\r\\n self._get_adjacent_squares(player_square.pos)\\r\\n for adj_square in adj_squares:\\r\\n if (adj_square.state == SquareState.OPEN):\\r\\n count += 1\\r\\n elif(adj_square.state == SquareState.OCCUPIED):\\r\\n opposite_square: Square = \\\\\\r\\n self.squares.get(\\r\\n self._get_opposite_pos(player_square.pos,\\r\\n adj_square.pos))\\r\\n if (opposite_square is not None\\r\\n and opposite_square.state == SquareState.OPEN):\\r\\n count += 1\\r\\n\\r\\n return count\",\n \"def count_pixels_of_certain_color(\\n self, color: Tuple[int, int, int]\\n ) -> int:\\n image = self.image\\n\\n color = CVUtils.rgb_to_bgr(color)\\n\\n mask = cv2.inRange(image, color, color)\\n return cv2.countNonZero(mask)\",\n \"def get_neighbors_of(cell, board):\\n count = 0\\n (x, y) = cell\\n for cell in board:\\n if cell == (x - 1, y - 1):\\n count += 1\\n elif cell == (x, y - 1):\\n count += 1\\n elif cell == (x + 1, y - 1):\\n count += 1\\n elif cell == (x - 1, y):\\n count += 1\\n elif cell == (x + 1, y):\\n count += 1\\n elif cell == (x - 1, y + 1):\\n count += 1\\n elif cell == (x, y + 1):\\n count += 1\\n elif cell == (x + 1, y + 1):\\n count += 1\\n return count\",\n \"def getAvailableMoves(self, checkColorIndex):\\n checkColor = self.grid.REPRESENTATION[checkColorIndex]\\n otherColor = self.grid.REPRESENTATION[1-checkColorIndex]\\n emptyColor = self.grid.REPRESENTATION[2]\\n\\n result = 0\\n for x in range(1, self.grid.width+1):\\n for y in range(1, self.grid.height+1):\\n if self.grid[x, y] != checkColor:\\n continue\\n\\n if x - 2 >= 1 and self.grid[x - 1, y] == otherColor \\\\\\n and self.grid[x - 2, y] == emptyColor:\\n result += 1\\n \\n if x + 2 <= self.grid.width and self.grid[x + 1, y] == otherColor \\\\\\n and self.grid[x + 2, y] == emptyColor:\\n result += 1\\n\\n if y - 2 >= 1 and self.grid[x, y - 1] == otherColor \\\\\\n and self.grid[x, y - 2] == emptyColor:\\n result += 1\\n\\n if y + 2 <= self.grid.height and self.grid[x, y + 1] == otherColor \\\\\\n and self.grid[x, y + 2] == emptyColor:\\n result += 1\\n return result\",\n \"def getPieceCount(self, checkColorIndex):\\n return self.grid.countPlayerX() if self.grid.REPRESENTATION[checkColorIndex] == 'X' \\\\\\n else self.grid.countPlayerO()\",\n \"def score(self, board: Block) -> int:\\n grid = _flatten(board)\\n left = grid[0]\\n right = grid[-1]\\n top = [i[0] for i in grid]\\n bottom = [i[-1] for i in grid]\\n score0 = left.count(self.colour)\\n score1 = right.count(self.colour)\\n score2 = top.count(self.colour)\\n score3 = bottom.count(self.colour)\\n return score0 + score1 + score2 + score3\",\n \"def count_numbers(board: list, x: int, y: int):\\n nums = []\\n for i in range(9):\\n # Adds number to list if it finds one in the col or row\\n if not board[i][x] == 0:\\n nums.append(board[i][x])\\n if not board[y][i] == 0:\\n nums.append(board[y][i])\\n # Does the same as the find_group function, finds the group of the cell\\n x_group = x - x % 3\\n y_group = y - y % 3\\n for i in range(3):\\n for z in range(3):\\n # Adds group numbers to list\\n if not board[y_group + i][x_group + z] == 0:\\n nums.append(board[y_group + i][x_group + z])\\n # returns the length of unrepeated number in the col, row and group\\n return len(set(nums))\",\n \"def number_at_cell(game, pokemon_locations, grid_size, index):\\n num = 0\\n # number of Pokemon in neighbouring cells\\n neighbours = neighbour_directions(index,grid_size)\\n for neighbour in neighbours:\\n if neighbour in pokemon_locations:\\n num += 1\\n return num\",\n \"def get_player_piece_locs(self, mycolor):\\n if mycolor not in (ChessGame.BLACK, ChessGame.WHITE):\\n return None\\n\\n return self.__players[mycolor]\",\n \"def neighbor(board, x, y, n, m):\\n deltas = (\\n (-1, -1), (-1, 0), (-1, 1),\\n (0, -1), (0, 1),\\n (1, -1), (1, 0), (1, 1),\\n )\\n count = 0\\n for dx, dy in deltas:\\n xx = x + dx\\n yy = y + dy\\n if xx >= 0 and xx < n and yy >= 0 and yy < m and board[xx][yy] % 2 == 1:\\n count += 1\\n\\n return count\",\n \"def _check_row(self, col, board) -> int:\\n score = 0\\n for row in range(len(board)):\\n if board[col][row] == self.colour:\\n score += 1\\n return score\",\n \"def get_carrot_count(matrix, pos, size):\\n\\n row, col = pos\\n\\n if on_board(pos, size):\\n return (matrix[row][col], pos)\\n\\n return (0, (-1, -1))\",\n \"def number_at_cell(self, pokemon_locations, grid_size, index):\\n if self.get_game()[index] != UNEXPOSED:\\n return int(self.get_game()[index])\\n\\n number = 0\\n for neighbour in self.neighbour_directions(index, grid_size):\\n if neighbour in pokemon_locations:\\n number += 1\\n\\n return number\",\n \"def get_neighbors(self, line, col):\\n neighbors = 0\\n for line_shift in [-1, 0, 1]:\\n for col_shift in [-1, 0, 1]:\\n if line_shift == 0 and col_shift == 0:\\n continue # Do not count given cell\\n # % connects left/right and up/down\\n i = (line + line_shift) % self.lines\\n j = (col + col_shift) % self.cols\\n if self[i][j] == self.cell_state['alive']:\\n neighbors += 1\\n return neighbors\",\n \"def count_winning_blocks(self, gameboard):\\r\\n count = {'red':0.1, 'blue':0.1}\\r\\n for x in range(gameboard.height):\\r\\n for y in range(gameboard.width):\\r\\n position = (x, y)\\r\\n h = gameboard.check_horizontal_state(position)\\r\\n v = gameboard.check_vertical_state(position)\\r\\n d1 = gameboard.check_diag_1_state(position)\\r\\n d2 = gameboard.check_diag_2_state(position)\\r\\n for state in [h, v, d1, d2]:\\r\\n if ((state.count('red') + state.count('x') == 5)\\r\\n and (state.count('red') > 0)):\\r\\n count['red'] += np.power(3, (state.count('red') - 1))\\r\\n elif ((state.count('blue') + state.count('x') == 5)\\r\\n and (state.count('blue') > 0)):\\r\\n count['blue'] += np.power(3, (state.count('blue') - 1))\\r\\n return count\",\n \"def get_num_explored(self):\\n return self.__num_explored\",\n \"def getEgdePieceCount(self, checkColorIndex):\\n return self.grid.countPlayerXEdge() if self.grid.REPRESENTATION[checkColorIndex] == 'X' \\\\\\n else self.grid.countPlayerOEdge()\",\n \"def count_neighbors(self, row, col):\\n neighbors = 0\\n neighbors += self.get_cell_value(row - 1, col - 1)\\n neighbors += self.get_cell_value(row - 1, col)\\n neighbors += self.get_cell_value(row - 1, col + 1)\\n neighbors += self.get_cell_value(row, col - 1)\\n neighbors += self.get_cell_value(row, col + 1)\\n neighbors += self.get_cell_value(row + 1, col - 1)\\n neighbors += self.get_cell_value(row + 1, col)\\n neighbors += self.get_cell_value(row + 1, col + 1)\\n\\n return neighbors\",\n \"def get_neighbour(self, y, x):\\n if [y, x] in self.mine_locations:\\n return Minesweeper.BOMB\\n count = 0\\n # (x-1, y-1), (x, y-1), (x+1, y-1),\\n # (x-1, y), (x, y), (x+1, y),\\n # (x-1, y+1), (x, y+1), (x+1, y+1)\\n for xe in range(x - 1, x + 2):\\n for ye in range(y - 1, y + 2):\\n if [ye, xe] in self.mine_locations:\\n count += 1\\n return str(count)\",\n \"def queryNumberOfColors(self):\\n self._numColorsInUse = \\\\\\n self._readInt('How many colors are available', 2, len(self._palette))\\n return self._numColorsInUse\",\n \"def count_neighbors(self, x, y):\\n # IMPLEMENT ME\\n # HINT: You do not have to use a for-loop for this method; just\\n # if-statements will suffice. Also, you do not need to indent further\\n # than two levels further than this comment.\\n neighbours = 0\\n if x > 0 and y > 0:\\n if self.board[x-1][y-1] == \\\"x\\\":\\n neighbours += 1\\n if x > 0:\\n if self.board[x-1][y] == \\\"x\\\":\\n neighbours += 1\\n if x > 0 and y < self.width - 1:\\n if self.board[x-1][y+1] == \\\"x\\\":\\n neighbours += 1\\n if y > 0:\\n if self.board[x][y-1] == \\\"x\\\":\\n neighbours += 1\\n if y < self.width - 1:\\n if self.board[x][y+1] == \\\"x\\\":\\n neighbours += 1\\n if x < self.height - 1 and y > 0:\\n if self.board[x+1][y-1] == \\\"x\\\":\\n neighbours += 1\\n if x < self.height - 1:\\n if self.board[x+1][y] == \\\"x\\\":\\n neighbours += 1\\n if x < self.height - 1 and y < self.width - 1:\\n if self.board[x+1][y+1] == \\\"x\\\":\\n neighbours += 1\\n return neighbours\",\n \"def decide_color(tile, board, n, colours):\\n list_c = colours.copy()\\n origin_color = board[0,0]\\n list_c.remove(origin_color)\\n colour_2 = list_c[0]\\n list_c.remove(colour_2)\\n colour_3 = list_c[0]\\n c2_count = 0\\n c3_count = 0\\n for el in tile:\\n el_x = el[0]\\n el_y = el[1]\\n if el_x + 1 < n:\\n if board[el_x+1, el[1]] == colour_2:\\n c2_count += 1\\n if board[el_x+1, el_y] == colour_3:\\n c3_count += 1\\n if el_y + 1 < n:\\n if board[el_x, el_y+1] == colour_2:\\n c2_count += 1\\n if board[el_x, el_y+1] == colour_3:\\n c3_count += 1\\n\\n if c2_count > c3_count:\\n colour = colour_2\\n\\n if c2_count <c3_count:\\n colour = colour_3\\n\\n if c2_count == c3_count:\\n colour = colour_2\\n return colour\",\n \"def corner_score(self, size: int,\\n board: List[List[Tuple[int, int, int]]]) -> int:\\n score = 0\\n bound = size - 1\\n corners = [(0, 0), (0, bound), (bound, 0), (bound, bound)]\\n for corner in corners:\\n if board[corner[0]][corner[1]] == self.colour:\\n score += 1\\n return score\",\n \"def getPlayer(board):\\n count_x, count_o = 0, 0\\n for row in board:\\n count_x += row.count(X)\\n count_o += row.count(O)\\n if count_x > count_o:\\n return O\\n return X\",\n \"def get_neighbors(arr, pos, color):\\n neighbors = []\\n try:\\n if arr[pos[0] + 1][pos[1]] == color:\\n neighbors.append((pos[0] + 1, pos[1]))\\n except IndexError:\\n pass\\n try:\\n if arr[pos[0] - 1][pos[1]] == color:\\n neighbors.append((pos[0] - 1, pos[1]))\\n except IndexError:\\n pass\\n try:\\n if arr[pos[0] + 1][pos[1]] == color:\\n neighbors.append((pos[0] + 1, pos[1]))\\n except IndexError:\\n pass\\n try:\\n if arr[pos[0]][pos[1] - 1] == color:\\n neighbors.append((pos[0], pos[1] - 1))\\n except IndexError:\\n pass\\n return neighbors\",\n \"def get_num_black_pieces(self):\\n return self.num_black_pieces\",\n \"def count_chips(board, player):\\n cont = 0\\n for row in board:\\n for col in row:\\n if col == PLAYER_CHIPS[player]:\\n cont += 1\\n return cont\",\n \"def count_island(row, col, island):\\n count = 0\\n for i in range(row):\\n for j in range(col):\\n count = count + floodfill(i, j, row, col, island)\\n return count\",\n \"def get_piece_type_positions_by_color(self, leading_color: chess.Color):\\n\\n # layers with pieces of current player will be stacked on layers of other player\\n if leading_color == chess.WHITE:\\n return np.vstack((self.__white, self.__black))\\n elif leading_color == chess.BLACK:\\n return np.vstack((self.__black, self.__white))\",\n \"def checkNumNeighbors():\",\n \"def player(board):\\n\\n if terminal(board):\\n return 7\\n\\n numX = 0\\n numO = 0\\n\\n for i in board:\\n for j in i:\\n if j == X:\\n numX = numX + 1\\n elif j == O:\\n numO = numO + 1\\n\\n if numX == numO:\\n return X\\n else:\\n return O\",\n \"def _getNumcam( self, bSeed ):\\n\\n\\t\\treturn ( ( bSeed >> 20 ) & 0xF ) + 1\",\n \"def h(self, node):\\n count_peg = -1\\n for line in node.state.board:\\n count_peg += line.count(c_peg())\\n return count_peg\",\n \"def _count_adj_occupied(grid: List[List[str]], row: int, col: int) -> int:\\n count = 0\\n if row - 1 >= 0:\\n if col - 1 >= 0:\\n count += 1 if grid[row - 1][col - 1] == '#' else 0\\n if col + 1 < len(grid[0]):\\n count += 1 if grid[row - 1][col + 1] == '#' else 0\\n count += 1 if grid[row - 1][col] == '#' else 0\\n if row + 1 < len(grid):\\n if col - 1 >= 0:\\n count += 1 if grid[row + 1][col - 1] == '#' else 0\\n if col + 1 < len(grid[0]):\\n count += 1 if grid[row + 1][col + 1] == '#' else 0\\n count += 1 if grid[row + 1][col] == '#' else 0\\n if col - 1 >= 0:\\n count += 1 if grid[row][col - 1] == '#' else 0\\n if col + 1 < len(grid[0]):\\n count += 1 if grid[row][col + 1] == '#' else 0\\n return count\",\n \"def get_palette_index(self, color, level):\\n if self.is_leaf():\\n return self.palette_index\\n index = self.get_color_index_for_level(color, level)\\n if self.children[index]:\\n return self.children[index].get_palette_index(color, level + 1)\\n else:\\n # get palette index for a first found child node\\n for i in range(8):\\n if self.children[i]:\\n return self.children[i].get_palette_index(color, level + 1)\",\n \"def slot_numbers_for_cars_with_colour(self, colour):\\n\\n if not self._is_valid():\\n return\\n\\n colour = colour.lower()\\n\\n slot_nos = []\\n\\n for pslot in self.slots.values():\\n if not pslot.available and pslot.car and pslot.car.colour.lower() == colour:\\n slot_nos.append(str(pslot.slot_no))\\n\\n if slot_nos:\\n print(\\\", \\\".join(slot_nos))\\n else:\\n print(\\\"Not found\\\")\\n\\n return slot_nos\",\n \"def num_black_neighbors(tile, tiles):\\n return sum([tiles[add(tile, step)] for step in NEIGHBORS])\",\n \"def match(head_list_at_crossing, wall_color_at_crossing, p):\\n num_index2 = int((p-1)/2)\\n indicies_of_heads = []\\n # print(num_index2)\\n for i in range(1, num_index2+1):\\n # print(i)\\n # print(indicies_of_heads)\\n indicies_of_heads += find(i, head_list_at_crossing)\\n # print(indicies_of_heads)\\n return indicies_of_heads\",\n \"def get_trump_color(self):\\n color_counter = collections.Counter()\\n for card in self.hand:\\n color = card.color\\n if color == \\\"White\\\":\\n continue\\n color_counter[color] += 1\\n if not color_counter.most_common(1):\\n return super().get_trump_color()\\n else:\\n return color_counter.most_common(1)[0][0]\",\n \"def checkWin(color_list):\\n startcolor = color_list[0][0] #Saves color of [0][0] to variable for easy access\\n for i in range(15):\\n for k in range(25):\\n if color_list[i][k] != startcolor: #If any color is not same as color on [0][0] stop and return False since game is not won\\n return False\\n return True #If all colors are the same as [0][0] the game ahs been won and return Tture\",\n \"def rec_count(color : str) -> int:\\n return sum(\\n (1 + rec_count(child)) * count\\n for child, count in contents[color].items()\\n )\",\n \"def get_palette_index(self, color):\\n return self.root.get_palette_index(color, 0)\",\n \"def countOccupied(data):\\n\\tcounter = 0\\n\\n\\t# loop through rows and columns and\\n\\t# count the number of '#'s\\n\\tfor r in range(len(data)):\\n\\t\\tfor c in range(len(data[r])):\\n\\t\\t\\tif data[r][c] == '#':\\n\\t\\t\\t\\tcounter += 1\\n\\n\\treturn counter\",\n \"def color_in_check(self, mycolor):\\n\\n opponent = self.__players[self.get_opponent_color(mycolor)]\\n\\n x, y = None, None\\n for (u, v) in self.__players[mycolor]:\\n piece = self.get_piece(u, v)\\n if not piece:\\n raise ValueError()\\n\\n if self.get_piece(u, v).name == 'king':\\n x, y = u, v\\n break\\n\\n for (u, v) in opponent:\\n if (x, y) in self._get_piece_moves(u, v):\\n return True\\n\\n return False\",\n \"def __moves_available(self, board: Board):\\n player_moves = self.get_num_of_moves(board, self.player_color)\\n opponent_moves = self.get_num_of_moves(board, self.opponent_color)\\n # print(len(player_moves), len(opponent_moves))\\n\\n return player_moves - opponent_moves * 3\",\n \"def getNumEmptyHouses(self, prop_colour):\\n colour_monopolies = database_creator.db.query(\\n \\\"SELECT num_of_houses FROM main_property_deck WHERE property_colour = :prop_colour\\\", prop_colour=prop_colour)\\n self.numUnbuilt = []\\n for i in colour_monopolies:\\n d = 5-int(i.num_of_houses)\\n self.numUnbuilt.append(d)\\n #print(self.numUnbuilt)\\n return self.numUnbuilt\",\n \"def getWinner(self):\\n global vertical_win\\n global done\\n lines = (\\n self.board, # columns\\n zip(*self.board), # rows\\n diagonalsPos(self.board, self.cols, self.rows), # positive diagonals\\n diagonalsNeg(self.board, self.cols, self.rows) # negative diagonals\\n )\\n\\n for sublist in self.board:\\n if sublist[0] == sublist[1] == sublist[2] == sublist[3] or sublist[1] == sublist[2] == sublist[3] == \\\\\\n sublist[4] or sublist[2] == sublist[3] == sublist[4] == sublist[5]:\\n vertical_win = True\\n\\n for line in chain(*lines):\\n for color, group in groupby(line):\\n if color != 0 and len(list(group)) >= self.win:\\n done = True\\n return color\\n counter = 0\\n for sublist in self.board:\\n for i in sublist:\\n if i != 0:\\n counter += 1\\n if counter == 42:\\n done = True\\n return Tie\",\n \"def check_up(self, i, j, board):\\r\\n color = board.pieceAt(i, j)\\r\\n\\r\\n row = True\\r\\n for k in range(4):\\r\\n row &= board.pieceAt(i-k, j) is color\\r\\n\\r\\n if row:\\r\\n return color\\r\\n else:\\r\\n return Color.EMPTY\",\n \"def player(board):\\n\\n count_x = 0\\n count_o = 0\\n for i in board:\\n for j in i:\\n if (j == X):\\n count_x += 1\\n elif (j == O):\\n count_o += 1\\n if (count_x <= count_o):\\n return X\\n else:\\n return O\",\n \"def get_color_index(position):\\n\\n\\t\\tcolors = {\\\"blue\\\": 6,\\n\\t\\t\\t\\t\\t\\t\\t\\\"red\\\": 13,\\n\\t\\t\\t\\t\\t\\t\\t\\\"yellow\\\": 17,\\n\\t\\t\\t\\t\\t\\t\\t\\\"light_blue\\\": 18,\\n\\t\\t\\t\\t\\t\\t\\t\\\"pink\\\": 20,\\n\\t\\t\\t\\t\\t\\t\\t\\\"purple\\\": 30}\\n\\n\\t\\tpositions = {\\\"C\\\": \\\"yellow\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t \\\"R\\\": \\\"red\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t \\\"L\\\": \\\"blue\\\"}\\n\\n\\t\\tindex = colors.get(positions.get(position[0], None), None)\\n\\t\\tif not index:\\n\\t\\t\\t\\traise KeyError(\\\"Position color index '%s' not recognised.\\\" % position)\\n\\n\\t\\treturn index\",\n \"def n_neighbors(self,n):\\n return sum(1 for x in self.hex.get_neighbors_ring(n) if x is not None and x.is_occupied == 1)\",\n \"def value(self):\\n black, white = 0, 0\\n for sq in Othello.squares():\\n piece = self.__board[sq]\\n if piece == BLACK: black += 1\\n elif piece == WHITE: white += 1\\n if black == white:\\n return 0.5\\n elif black > white:\\n return 1\\n else:\\n return 0\",\n \"def player(board):\\n X_count = 0\\n O_count = 0\\n\\n for row in board:\\n X_count += row.count(X)\\n O_count += row.count(O)\\n\\n if X_count <= O_count:\\n return X\\n else:\\n return O\",\n \"def get_piece_dict(self, mycolor):\\n pieces = { (x, y) : self.get_piece(x, y) for (x, y) in\\n self.__players[mycolor] }\\n if None in pieces.values():\\n raise ValueError()\\n return pieces\",\n \"def get_legal_moves(self, color):\\n moves = [] # stores the legal moves.\\n # Get all the squares with pieces of the given color.\\n for x in range(self.n):\\n for y in range(self.n):\\n if self[x][y]==0:\\n moves.append((x,y))\\n return moves\",\n \"def G_colour_count(self, r, b=-1):\\n counts = [0 for _ in range(r)]\\n for row in self.G_colour_tableau(r,b):\\n for cell_colour in row:\\n counts[cell_colour] += 1\\n assert sum(counts) == self.size()\\n return counts\",\n \"def get_number(self, row, col):\\r\\n return self._grid[row][col]\",\n \"def get_number(self, row, col):\\r\\n return self._grid[row][col]\",\n \"def get_number(self, row, col):\\r\\n return self._grid[row][col]\",\n \"def get_pile_size_in_col(self, col, only_faceup=False) -> int:\\n cards = 0\\n # return -1 if col does not exist\\n if col < 0 or col >= 7:\\n return 0\\n # count the cards. 0 = not a card\\n if only_faceup:\\n for card in self.solitaire[col]:\\n if card != 0 and not None and not card.is_facedown:\\n cards += 1\\n return cards\\n else:\\n for card in self.solitaire[col]:\\n if card != 0:\\n cards += 1\\n else:\\n break\\n return cards\",\n \"def get_neighbour_squares_idx(self, pos):\\n if pos:\\n possible_values = {0, 1, 2}\\n col_variation = zip( [pos[0], pos[0]], possible_values - {pos[1]} )\\n row_variation = zip( possible_values - {pos[0]}, [pos[1], pos[1]] )\\n return list(col_variation), list(row_variation)\",\n \"def color_column(self):\\n return 8\",\n \"def player(board):\\n num_x = sum([list.count(X) for list in board])\\n num_o = sum([list.count(O) for list in board])\\n if num_x == num_o:\\n return X\\n else:\\n return O\",\n \"def _count_seen_occupied(grid: List[List[str]], row: int, col: int) -> int:\\n count = 0\\n for dx in [-1, 0, 1]:\\n for dy in [-1, 0, 1]:\\n if not (dx == 0 and dy == 0):\\n count += 1 if _is_occupied(grid, row, col, dx, dy) else 0\\n return count\",\n \"def getPixelColor(self, n):\\n self._logger.debug(\\\"getPixelColor\\\")\",\n \"def heuristic_takeAllPiece(board, player):\\n\\n if player is board._WHITE:\\n return board._nbWHITE - board._nbBLACK\\n \\n return board._nbBLACK - board._nbWHITE\",\n \"def howManyNeigbors(board,row,col):\\r\\n\\tneigbors = 0\\r\\n\\tif board[row-1][col-1] == 1:\\r\\n\\t\\tneigbors += 1\\r\\n\\tif board[row-1][col] == 1:\\r\\n\\t\\tneigbors += 1\\r\\n\\tif board[row-1][col+1] == 1:\\r\\n\\t\\tneigbors += 1\\r\\n\\tif board[row][col-1] == 1:\\r\\n\\t\\tneigbors += 1\\r\\n\\tif board[row][col+1] == 1:\\r\\n\\t\\tneigbors += 1\\r\\n\\tif board[row+1][col-1] == 1:\\r\\n\\t\\tneigbors += 1\\r\\n\\tif board[row+1][col] == 1:\\r\\n\\t\\tneigbors += 1\\r\\n\\tif board[row+1][col+1] == 1:\\r\\n\\t\\tneigbors += 1\\r\\n\\treturn neigbors\",\n \"def score(self, board: Block) -> int:\\r\\n target_colour = self.colour\\r\\n score = 0\\r\\n flat_list = _flatten(board)\\r\\n for j in range(len(flat_list)):\\r\\n if flat_list[0][j] == target_colour:\\r\\n if j in [0, len(flat_list) - 1]:\\r\\n score += 2\\r\\n else:\\r\\n score += 1\\r\\n for j in range(len(flat_list)):\\r\\n if flat_list[-1][j] == target_colour:\\r\\n if j in [0, len(flat_list) - 1]:\\r\\n score += 2\\r\\n else:\\r\\n score += 1\\r\\n for j in range(2): # first and last row\\r\\n for i in range(1, len(flat_list) - 1): # deduct corners\\r\\n if flat_list[i][-j] == target_colour:\\r\\n score += 1\\r\\n return score\",\n \"def random_neighbors(self) -> int:\\n return self.__random_neighbors\",\n \"def count_colors(cards: np.ndarray) -> np.ndarray:\\n result = np.zeros(4, np.int32)\\n cards.sum()\\n result[0] = (cards[0:9]).sum()\\n result[1] = (cards[9:18]).sum()\\n result[2] = (cards[18:27]).sum()\\n result[3] = (cards[27:36]).sum()\\n return result\",\n \"def count_bingo_board(board_num):\\n bingo_score = 0\\n for row in bingoboards[board_num]:\\n bingo_score += sum(list(filter(lambda x: x != \\\"X\\\", row)))\\n return bingo_score\",\n \"def check_neighbours(r, c, board):\\n NeighboursSum = 0\\n\\n for x in range(r - 1, r + 1):\\n for y in range(c - 1, c + 1):\\n NeighboursSum = NeighboursSum * board[x][y]\\n\\n return NeighboursSum\",\n \"def get_number(self, row, col):\\n return self._grid[row][col]\",\n \"def get_number(self, row, col):\\n return self._grid[row][col]\",\n \"def get_number(self, row, col):\\n return self._grid[row][col]\",\n \"def get_number(self, row, col):\\n return self._grid[row][col]\",\n \"def houses(self):\\n num = 0\\n points = 0\\n # TODO: add pattern matching\\n if \\\"s\\\" in self.__as_str:\\n num += 1\\n if \\\"f\\\" in self.__as_str:\\n num += 1\\n if \\\"1\\\" in self.__as_str or \\\"2\\\" in self.__as_str or \\\"3\\\" in self.__as_str or \\\"4\\\" in self.__as_str:\\n num += 1\\n if \\\"o\\\" in self.__as_str:\\n num += 1\\n if \\\"p\\\" in self.__as_str:\\n num += 1\\n for i in range(4):\\n for j in range(4):\\n if self.as_list[i][j] == 'h':\\n if 'f' in self.neighbours(i, j):\\n points += 1\\n else:\\n points += num\\n return points\",\n \"def player(board) -> str:\\n x_amount = 0\\n o_amount = 0\\n for row in board:\\n for column in row:\\n if column == X:\\n x_amount += 1\\n elif column == O:\\n o_amount += 1\\n\\n return X if x_amount == o_amount else O\",\n \"def get_color_index_for_level(self, color, level):\\n index = 0\\n mask = 0x80 >> level\\n if color.red & mask:\\n index |= 4\\n if color.green & mask:\\n index |= 2\\n if color.blue & mask:\\n index |= 1\\n return index\",\n \"def get_counts(self):\\n counts = [0, 0]\\n for i in range(self._num_rows):\\n for j in range(self._num_cols):\\n if self._board[i][j] == \\\"B\\\":\\n counts[0] += 1\\n elif self._board[i][j] == \\\"W\\\":\\n counts[1] += 1\\n return counts\",\n \"def score(self):\\r\\n totN = 0\\r\\n totB = 0\\r\\n for l in range(SIZE):\\r\\n for c in range(len(COLONNES)):\\r\\n if self.jeu[l][c] == NOIR:\\r\\n totN += 1\\r\\n elif self.jeu[l][c] == BLANC:\\r\\n totB += 1\\r\\n return (totN, totB)\",\n \"def get(self):\\n # 8 timesteps, 6 piece types per player, 64 squares #FIXME: 1 timestep\\n # 1 castling (which rooks can still castle)\\n # 1 player color (1 if white, 0 if black)\\n # 1 total move count\\n # 1 moves without progress\\n # TODO: add repetions (2): repetition count for that position (3 repitions is an autmatic draw)\\n pieces = np.concatenate(self.boards)[::-1]\\n pieces = np.concatenate(pieces)\\n if len(pieces) == MAX_PIECE_INDEX:\\n return pieces\\n else:\\n return np.concatenate((pieces, np.zeros(MAX_PIECE_INDEX-len(pieces), )))\",\n \"def get_neighbors(self, node):\\r\\n neighbors = set()\\r\\n for neighbor in ORTHOGONAL_POSITIONS[(node.pos[0], node.pos[1])]:\\r\\n if self.board[neighbor[0]][neighbor[1]].color == node.color:\\r\\n neighbors.add(neighbor)\\r\\n else:\\r\\n continue\\r\\n return neighbors\",\n \"def match(self, color: Color) -> ColorPoint:\\n results = self.tree.search_nn(color.hsl)\\n if not results:\\n raise KeyError('No match found for color: {}'.format(color))\\n return results[0].data\",\n \"def find_possible_moves(self, board, self_color):\\r\\n possible_moves = []\\r\\n delta = [(0,-1), (-1,-1), (-1,0), (-1,1), (0,1), (1,1), (1,0), (1,-1)]\\r\\n\\r\\n for r in range(len(board)):\\r\\n for c in range(len(board[r])):\\r\\n if board[r][c] == self_color:\\r\\n for i in range(0, 8):\\r\\n coords = (r, c)\\r\\n\\r\\n found_move = self.check_moves(board, self_color, coords, delta[i])\\r\\n\\r\\n if found_move is not None and found_move not in possible_moves:\\r\\n possible_moves.append(found_move)\\r\\n return possible_moves\",\n \"def nbr_tours(self):\\n nbr_tours = 0\\n for i in range(3):\\n for j in range(3):\\n if self.grille[i][j] != 0:\\n nbr_tours += 1\\n return nbr_tours\",\n \"def gen_moves_list(self,color='',dontCallIsAttacked=False):\\n \\n if(color==''):\\n color=self.side2move\\n mList=[]\\n \\n # For each 'piece' on the board (pos1 = 0 to 63)\\n for pos1,piece in enumerate(self.cases):\\n \\n # Piece (or empty square) color is not the wanted ? pass\\n if piece.couleur!=color:\\n continue\\n \\n if(piece.nom=='ROI'): # KING\\n mList+=piece.pos2_roi(pos1,self.oppColor(color),self,dontCallIsAttacked)\\n continue\\n \\n elif(piece.nom=='DAME'): # QUEEN = ROOK + BISHOP moves !\\n mList+=piece.pos2_tour(pos1,self.oppColor(color),self)\\n mList+=piece.pos2_fou(pos1,self.oppColor(color),self)\\n continue\\n \\n elif(piece.nom=='TOUR'): # ROOK\\n mList+=piece.pos2_tour(pos1,self.oppColor(color),self)\\n continue\\n \\n elif(piece.nom=='CAVALIER'): # KNIGHT\\n mList+=piece.pos2_cavalier(pos1,self.oppColor(color),self)\\n continue\\n \\n elif(piece.nom=='FOU'): # BISHOP\\n mList+=piece.pos2_fou(pos1,self.oppColor(color),self)\\n continue\\n \\n if(piece.nom=='PION'): # PAWN\\n mList+=piece.pos2_pion(pos1,piece.couleur,self)\\n continue\\n \\n return mList\",\n \"def _count_living_neighbors(self, cell: Cell) -> int:\\n count = 0\\n # borders of the area in which we are trying to find neighbors\\n # Let's assume y axis directs downside and x axis directs to the left\\n \\n for x in range(cell.x - 1, cell.x + 2):\\n for y in range(cell.y - 1, cell.y + 2):\\n if cell.x == x and cell.y == y:\\n continue\\n if (x, y) in self.living_cells.keys():\\n count += 1\\n \\n return count\",\n \"def get_pieces_left(board, piece):\\r\\n\\tpieces = 0\\r\\n\\tfor row in board:\\r\\n\\t\\tfor col in row:\\r\\n\\t\\t\\tif col == piece:\\r\\n\\t\\t\\t\\tpieces += 1\\r\\n\\r\\n\\treturn pieces\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.71357477","0.67711115","0.6714085","0.6677235","0.65223455","0.6421733","0.63733757","0.63176304","0.6308519","0.6277486","0.62195385","0.6203734","0.6190637","0.6115216","0.61102915","0.6102846","0.60874075","0.6083563","0.60525626","0.6047749","0.6038292","0.6021945","0.59981954","0.59945077","0.5979369","0.594881","0.5933531","0.5902637","0.5890151","0.5887287","0.5873161","0.58449376","0.58354115","0.5830128","0.5823101","0.5792508","0.5790537","0.5757185","0.5756808","0.5727046","0.57252973","0.5720263","0.571608","0.5700856","0.56965524","0.5692262","0.568991","0.56806624","0.56693333","0.5660685","0.56460327","0.5633886","0.5624084","0.5615689","0.5613689","0.5610581","0.5606288","0.56042737","0.5602917","0.55947906","0.55892444","0.5588708","0.5584628","0.558396","0.5567274","0.5564481","0.55609906","0.5559269","0.5559269","0.5559269","0.5554464","0.5554361","0.5553061","0.5549734","0.5542581","0.5539438","0.5537671","0.5536205","0.553154","0.55302334","0.55280477","0.5526254","0.5517963","0.5512889","0.5512889","0.5512889","0.5512889","0.54919964","0.5486476","0.54846984","0.5482698","0.5481752","0.5478684","0.5478381","0.54781544","0.54777455","0.54755133","0.54744977","0.54720384","0.5471559"],"string":"[\n \"0.71357477\",\n \"0.67711115\",\n \"0.6714085\",\n \"0.6677235\",\n \"0.65223455\",\n \"0.6421733\",\n \"0.63733757\",\n \"0.63176304\",\n \"0.6308519\",\n \"0.6277486\",\n \"0.62195385\",\n \"0.6203734\",\n \"0.6190637\",\n \"0.6115216\",\n \"0.61102915\",\n \"0.6102846\",\n \"0.60874075\",\n \"0.6083563\",\n \"0.60525626\",\n \"0.6047749\",\n \"0.6038292\",\n \"0.6021945\",\n \"0.59981954\",\n \"0.59945077\",\n \"0.5979369\",\n \"0.594881\",\n \"0.5933531\",\n \"0.5902637\",\n \"0.5890151\",\n \"0.5887287\",\n \"0.5873161\",\n \"0.58449376\",\n \"0.58354115\",\n \"0.5830128\",\n \"0.5823101\",\n \"0.5792508\",\n \"0.5790537\",\n \"0.5757185\",\n \"0.5756808\",\n \"0.5727046\",\n \"0.57252973\",\n \"0.5720263\",\n \"0.571608\",\n \"0.5700856\",\n \"0.56965524\",\n \"0.5692262\",\n \"0.568991\",\n \"0.56806624\",\n \"0.56693333\",\n \"0.5660685\",\n \"0.56460327\",\n \"0.5633886\",\n \"0.5624084\",\n \"0.5615689\",\n \"0.5613689\",\n \"0.5610581\",\n \"0.5606288\",\n \"0.56042737\",\n \"0.5602917\",\n \"0.55947906\",\n \"0.55892444\",\n \"0.5588708\",\n \"0.5584628\",\n \"0.558396\",\n \"0.5567274\",\n \"0.5564481\",\n \"0.55609906\",\n \"0.5559269\",\n \"0.5559269\",\n \"0.5559269\",\n \"0.5554464\",\n \"0.5554361\",\n \"0.5553061\",\n \"0.5549734\",\n \"0.5542581\",\n \"0.5539438\",\n \"0.5537671\",\n \"0.5536205\",\n \"0.553154\",\n \"0.55302334\",\n \"0.55280477\",\n \"0.5526254\",\n \"0.5517963\",\n \"0.5512889\",\n \"0.5512889\",\n \"0.5512889\",\n \"0.5512889\",\n \"0.54919964\",\n \"0.5486476\",\n \"0.54846984\",\n \"0.5482698\",\n \"0.5481752\",\n \"0.5478684\",\n \"0.5478381\",\n \"0.54781544\",\n \"0.54777455\",\n \"0.54755133\",\n \"0.54744977\",\n \"0.54720384\",\n \"0.5471559\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6866677"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":94793,"cells":{"query":{"kind":"string","value":"Tells if a position is in the game bounds"},"document":{"kind":"string","value":"def inBounds(self,pos):\n return ((pos.x<WIDTH) & (pos.x>=0) & (pos.y<HEIGHT) & (pos.y>=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 in_bounds(self, position):\n row, col = position\n return ((row >= 0 and row < self.height) and\n (col >= 0 and col < self.width))","def is_in_bounds(pos):\n return PLAYFIELD_PADDING[0] < pos[0] < PLAYFIELD_PADDING[0] +\\\n BLOCK_NUM_WIDTH * Block.WIDTH and PLAYFIELD_PADDING[1] < pos[1] <\\\n PLAYFIELD_PADDING[1] + BLOCK_NUM_HEIGHT * Block.HEIGHT","def detect_in_bounds(self):\n creature_x, creature_y = self.creature.current_location\n if creature_x < 0 or creature_x >= self.world_width\\\n or creature_y < 0 or creature_y >= self.world_height:\n print('The creature is out of bounds!')\n return False\n return True","def _in_bounds(self, x, y):\r\n return 0 <= x < 8 and 0 <= y < 8","def in_bounds(self, x, y):\n return x >= 0 and x < 8 and y >= 0 and y < 8","def pos_within_bounds(position):\n if type(position[0]) == int:\n row,col = position\n else:\n col,row = position\n \n if not 1<=row<=8:\n return False\n if not 65<=ord(col)<=72:\n return False\n return True","def in_bounds(self, location: tuple) -> bool:\n return 0 <= min(location) and max(location) <= 7","def inBounds(self, px, py):\n return px >= 0 and py >= 0 and px < self.w and py < self.h","def isPositionInRoom(self, pos):\n\t\tif pos.getX() >= 0.0 and pos.getX() < float(self.width):\n\t\t\tif pos.getY() >= 0.0 and pos.getY() < float(self.height):\n\t\t\t\treturn True\n\t\treturn False","def isPositionInRoom(self, pos):\n posX = pos.getX()\n posY = pos.getY()\n if posX >= 0 and posX < self.width and posY >= 0 and posY < self.height:\n return True\n return False","def check_inside(self, pos):\n x,y = pos\n return x >= self.posx and x <= self.posx + self.sizex and y >= self.posy and y <= self.posy + self.sizey","def isPositionInRoom(self, pos):\n if pos.getY() > self.height or pos.getX() > self.width or pos.getX() < 0 or pos.getY() < 0:\n return False\n else:\n return True","def bounds(self, pos):","def isPositionInRoom(self, pos):\n if pos.getX() >= 0 and pos.getX() < self.w:\n if pos.getY() >= 0 and pos.getY() < self.h:\n return True\n return False\n return False","def boundary_check(limits : tuple, coords : tuple) -> bool:\n xl,xh,yl,yh = limits\n x,y = coords\n bound_x = xl <= x and x < xh\n bound_y = yl <= y and y < yh\n return bound_x and bound_y","def in_bounds(state, map_shape):\n return 0 <= state[0] < map_shape[0] and 0 <= state[1] < map_shape[1]","def at_pos(self, pos):\n return pos-self.deadband < self.wm() < pos+self.deadband","def IsBound(self) -> bool:","def in_zone(self, bottom_left, top_right):\n return (bottom_left.x <= self.pos.x and self.pos.x <= bottom_left.x and\n top_right.y <= self.pos.y and self.pos.y <= top_right.y)","def check_pos(self, x, y):\n if x >= WINDOWWIDTH or y >= WINDOWHEIGHT or x <=0 or y <= 0:\n return True","def out_of_bounds(self):\n return self.rect.right <= 0 or self.rect.left >= self.screen_rect.width","def isPositionInRoom(self, pos):\n #note to self '&' is bitwise, 'and' is a boolean operation\n #NB: python permits the a<b<c syntax used below, doesn't need verbose 'and' tests.\n #ie: 0 <= pos.getX() and pos.getX() <= self.width and 0 <= pos.getY() and pos.getY() <= self.height\n return 0 <= pos.getX() < self.width and 0 <= pos.getY() < self.height\n #raise NotImplementedError #refer https://docs.python.org/2/library/exceptions.html","def isInRange(self, position) -> bool:\n if position.getX() >= self.node.getX() - self.radius and position.getX() <= self.node.getX() + self.radius:\n if position.getY() >= self.node.getY() - self.radius and position.getY() <= self.node.getY() + self.radius:\n return True\n return False","def check_bounds(self, row: int, col: int) -> bool:\n return 0 <= row < self.row and 0 <= col < self.col","def validate_position(position: Tuple[int, int], bound: int) -> bool:\n if position[0] < 0 or position[0] >= bound:\n return False\n if position[1] < 0 or position[1] >= bound:\n return False\n return True","def out_of_bounds(self):\n return self.rect.right <= 0","def check_position(self, position):\n x_axis, y_axis = position\n try:\n return bool(self.full_map[x_axis][y_axis] not in \"#\"\n and 0 <= x_axis <= self.x_axis\n and 0 <= y_axis <= self.y_axis)\n\n except IndexError:\n return False","def __cell_is_in_map(self, x, y) -> bool:\n return x >= 0 and y >= 0 and x < self.occupancy_map.info.width and y < self.occupancy_map.info.height","def hasSpaceAround(self,x,y):\n global gamemap\n c = 0\n for x2 in xrange(-2,2):\n for y2 in xrange(-2,2):\n if self.near(x, y,x + x2,y + y2):\n if not gamemap[x + x2][y + y2].type[0]:\n c += 1\n if c >= 8:\n return False\n else:\n return True","def isPositionInRoom(self, pos):\n if pos in self.tiles:\n return True\n else:\n return False","def check_bounds (position, size):\n \n for item in position:\n # checks whether item is out of bounds\n if item < 0 or item >= size:\n return False\n return True","def validatePosition(boardsize, pos):\n return pos.x in range(0, boardsize) and pos.y in range(0,boardsize)","def in_bounds(self, point):\n # Sanity checks\n # Check that point has same number of dimensions as graph\n if not len(point) == len(self.dimensions):\n raise Exception(\"Point has \" + str(len(point)) + \" dimensions, Coordination Space has \" + \\\n str(len(self.dimensions)) + \" dimensions.\")\n\n for i, coordinate in enumerate(point):\n if coordinate > self.dimensions[i] or coordinate < 0:\n return False\n\n return True","def isPositionInRoom(self, pos):\n #if key tuple position(x,y) is in dictionary tiles return True else return False\n posx = pos.getX()\n posy = pos.getY()\n posx = math.floor(posx)\n posy = math.floor(posy)\n if (posx >= self.width) or (posy >= self.height):\n return False\n\n if (posx,posy) in self.tiles.keys():\n return True\n else:\n return False","def has_bounds(self):\r\n bounds = self.bounds\r\n if bounds in (None, [None, None]):\r\n return False\r\n for i in xrange(bounds[0]):\r\n if bounds[0][i] is not None and bounds[0][i] > -np.inf:\r\n return True\r\n for i in xrange(bounds[1]):\r\n if bounds[1][i] is not None and bounds[1][i] < np.inf:\r\n return True\r\n return False","def is_inside(pos):\r\n\t\trow, col = pos\r\n\t\treturn 0 <= row and row < num_rows and \\\r\n\t\t\t0 <= col and col < num_cols","def is_inside(self, x: int, y: int) -> bool:\n pass","def contains ( self, pos ):\n # make sure xmin is minimum etc\n xmin = min(self.x_min,self.x_max)\n xmax = max(self.x_min,self.x_max)\n ymin = min(self.y_min,self.y_max)\n ymax = max(self.y_min,self.y_max)\n \n abs_tol = self.abs_tol\n # get pos indices inside rectangle (* == and)\n if self.include_border:\n inds = (pos[0, :] - xmin > -abs_tol) * \\\n (pos[0, :] - xmax < abs_tol) * \\\n (pos[1, :] - ymin > -abs_tol) * \\\n (pos[1, :] - ymax < abs_tol)\n else:\n inds = (pos[0, :] - xmin > abs_tol) * \\\n (pos[0, :] - xmax < -abs_tol) * \\\n (pos[1, :] - ymin > abs_tol) * \\\n (pos[1, :] - ymax < -abs_tol)\n \n \n # if none inside, take nearest\n if ~inds.any() and self.default_nearest:\n x = (xmin + xmax) / 2.0\n y = (ymin + ymax) / 2.0\n dr2 = (pos[0, :] - x)**2 + (pos[1, :] - y)**2\n inds[argmin(dr2)] = True\n \n return inds.astype(bool)","def check_bounds(self):\n\n if self.bounds_action == self.BOUNCE:\n if self.hits_left_or_right():\n self.dx = self.dx * -1\n if self.hits_top_or_bottom():\n self.dy = self.dy * -1\n\n if self.bounds_action == self.STOP:\n if self.hits_left_or_right():\n self.dx = 0\n self.dy = 0\n if self.hits_top_or_bottom():\n self.dx = 0\n self.dy = 0\n\n if self.bounds_action == self.SKID:\n if self.hits_left_or_right():\n self.dx = 0\n if self.hits_top_or_bottom():\n self.dy = 0\n\n if self.bounds_action == self.DIE:\n if self.hits_left_or_right() or self.hits_top_or_bottom():\n self.dx = 0\n self.dy = 0\n self.visible = False","def isValidPos(self, x, y, wallList, grid):\n if (x, y) not in wallList:\n return x > 0 and x < grid.width and y > 0 and y < grid.height","def checkWithinBound(rowWithinBound,colWithinBound):\n if(rowWithinBound == 0 and colWithinBound == 0):\n return True\n else:\n return False","def is_map_obstacle_in_screen_range(self):\n raise NotImplementedError","def is_position_allowed(new_x, new_y):\n\n return min_x <= new_x <= max_x and min_y <= new_y <= max_y","def within(self, x, y):\n return x >= self.top_x and x <= self.bottom_x and y >= self.bottom_y and y <= self.top_y","def inCamp(self):\n return (((self.myTeam==1) and (self.ballPos.x <= self.width/2))\n | ((self.myTeam==2) and (self.ballPos.x >= self.width/2)))","def inside_rectangle(self, x, y):\n if (self.pos.x - self.width < x < self.pos.x + self.width and\n self.pos.y - self.height < y < self.pos.y + self.height):\n return True","def is_visible(self, position, size=0):\n # return True\n size /= self.scale # size is in pixel\n in_x = (self.focus.x + self.offset.x / self.scale - size <=\n position.x <=\n self.focus.x - self.offset.x / self.scale + size)\n in_y = (self.focus.y + self.offset.y / self.scale - size <=\n position.y <=\n self.focus.y - self.offset.y / self.scale + size)\n # if name == \"earth\":\n # print(\"{:+e} {:+e} {}\".format(self.focus.y + self.offset2.y\n # , position.y, in_y))\n # print(\"{:+e} {:+e}\".format(self.focus.x, self.focus.y))\n return in_x and in_y","def in_range(x, y):\n if (x < 0 or x > width or y < 0 or y > length):\n return False\n else:\n return True","def _isInScreen(self, pos):\n if type(pos) is Vec2:\n return pos.y >= 0 and pos.y <= self.screenSize[1] and pos.x >= 0 \\\n and pos.x <= self.screenSize[0]\n\n return pos[1] >= 0 and pos[1] <= self.screenSize[1] and pos[0] >= 0 \\\n and pos[0] <= self.screenSize[0]","def can_reach(self, position: tuple) -> bool:\n x = position[0]\n y = position[1]\n dist_to_shoulder = math.sqrt(x**2 + y**2)\n max_dist = self.bicep_length + self.forearm_length\n if dist_to_shoulder > max_dist:\n return False\n return True","def square_is(position, expected, world):\n\n result = False\n size = len(world) - 1\n\n if size >= position[0] >= 0 and size >= position[1] >= 0:\n result = world[position[0]][position[1]] == expected\n\n return result","def check_boundaries(self):\n # Checks if the enemy bar has gone of the net\n if self.rect.left <= self.settings.WINDOW_WIDTH / 2:\n self.rect.left = self.settings.WINDOW_WIDTH / 2\n self.isMovingUp = False\n\n # Checks if the enemy bar has gone out of bound to the right\n if self.rect.right >= self.settings.WINDOW_WIDTH:\n self.rect.right = self.settings.WINDOW_WIDTH\n self.isMovingUp = True","def inside_limits(self, point):\n if not self.regions:\n # Use rectangle check\n lat, lon = point.latitude, point.longitude\n if (lon > self.limits[0] and lat > self.limits[1] and\n lon < self.limits[2] and lat < self.limits[3]):\n return True\n else:\n return False\n else:\n # Check inside all possible regions\n p = Point((point.longitude, point.latitude))\n print(p, point)\n # import IPython; IPython.embed()\n for name, poly in self.regions.items():\n # if poly.contains(p):\n if p.intersects(poly):\n return name\n return False","def __contains__(self,pos):\n # Permet de donner une contenance a l objet\n # Il devient comme une liste de point\n # Ainsi on peut le parcourir comme on le ferai avec une liste\n xmin=self.pos[0]\n xmax=self.pos[0]+self.dim[0]\n ymin=self.pos[1]\n ymax=self.pos[1]+self.dim[1]\n xpt=pos[0]\n ypt=pos[1]\n return (xpt>=xmin and xpt<=xmax and ypt>=ymin and ypt<=ymax)","def __contains__(self,pos):\n # Permet de donner une contenance a l objet\n # Il devient comme une liste de point\n # Ainsi on peut le parcourir comme on le ferai avec une liste\n xmin=self.pos[0]\n xmax=self.pos[0]+self.dim[0]\n ymin=self.pos[1]\n ymax=self.pos[1]+self.dim[1]\n xpt=pos[0]\n ypt=pos[1]\n return (xpt>=xmin and xpt<=xmax and ypt>=ymin and ypt<=ymax)","def _inside_bounds(A, B):\n for axis in 'xyz':\n minA, maxA = axis_bounds(A, axis)\n minB, maxB = axis_bounds(B, axis)\n if (minA <= minB) or (maxA >= maxB):\n return False\n\n return True","def point_in_map(self, x, y):\r\n return 0 <= x < self.width and 0 <= y < self.height and (x,y) not in self.walls","def _check_if_position_on_board(coord: tuple, board_size: int):\n in_row = coord[0] in range(board_size)\n in_col = coord[1] in range(board_size)\n return in_row and in_col","def in_board(self,pos : np.ndarray) -> bool:\r\n if 0 > pos[0] or pos[0] >= BOARD_SIZE:\r\n return False\r\n if 0 > pos[1] or pos[1] >= BOARD_SIZE:\r\n return False\r\n\r\n return True","def isInGoal(self):\n coordx= self.playerPos.x\n coordy= self.playerPos.y\n target = 0 if self.id_team == 1 else 1\n\n if((((target == 0)and (coordx<=5))|\n ((target == 1) and(coordx>145))) \n and (coordy<=50 and coordy>=40)):\n return True\n else:\n return False","def valid(self, pos):\n\t\tpos = Point(pos)\n\t\treturn 0 <= pos.x < self.dims.width and 0 <= pos.y < self.dims.height","def is_in_collision_point(self, pos):\n x, y = pos\n return sqrt((self.x - x)**2 + (self.y - y)**2) < self.r","def _point_within_bounds(bounds, p):\n A, B = bounds\n # we have to add epsilon since test against horizontal or vertical\n # lines may fail if the point is off by numerical precision\n eps = 1e-10\n (Ax,Ay), (Bx,By), (px,py)=A,B,p\n return (\n (min((Ax,Bx))-eps<=px<=max((Ax,Bx))+eps) and\n (min((Ay,By))-eps<=py<=max((Ay,By))+eps)\n )","def if_near_boom(self, player_pos, boom_pos):\n if player_pos[0] == boom_pos[0]:\n if player_pos[1] in range(boom_pos[1]-2*30, boom_pos[1]+3*30, 30):\n return True\n else:\n return False\n elif player_pos[1] == boom_pos[1]:\n if player_pos[0] in range(boom_pos[0]-2*30, boom_pos[0]+3*30, 30):\n return True\n else:\n return False\n else:\n return False","def checkBounds(x,y,z,center,radius):\n r2 = (x-center[0])**2 + (y-center[1])**2# + (z-center[0])**2\n if r2 < radius**2:\n return True\n else:\n return False","def is_in_field(self, x, y):\n return (self.origin_x <= x < self.width) and (self.origin_y <= y < self.height)","def is_bound(pos1, el1, pos2, el2):\n threshold = 0.1\n if el1 == 'H' or el2 == 'H':\n threshold = 0.2\n if np.linalg.norm(np.array(pos1) - np.array(pos2)) < covalence_radius[el1] + covalence_radius[el2] + threshold:\n return True\n return False","def check_boundary(self, width, height):\r\n if 0 <= self.head[0] + self.direction[0]*10 <= width - 10 and 0 <= self.head[1] + self.direction[1]*10 <= height - 10:\r\n return True\r\n else:\r\n return False","def isInside(self, position, maxDimLens):\n dim = len(position);\n deltas = [0] * dim;\n distSqr = 0;\n for i in range(0, dim):\n deltas[i] = math.fabs(position[i] - self.mSample[i]);\n if math.fabs(maxDimLens[i] - deltas[i]) < deltas[i]:\n deltas[i] = math.fabs(maxDimLens[i] - deltas[i]);\n distSqr += deltas[i]**2;\n\n if distSqr < ( self.mRadius**2 ):\n return True;\n else:\n return False;","def in_box_bounds(self, test_vec):\n above_min = np.greater(test_vec, self.lower_vertex).all()\n below_max = np.greater(self.upper_vertex, test_vec).all()\n return above_min and below_max","def check_coord_in_range(self, x, y):\n return 0 <= x < self.cols and 0 <= y < self.lines","def outOfScreen(self):\n x,y = self.currentLevel.transformToScreenCoordinate(self.position)\n w,h = cblocals.GAME_SCREEN_SIZE\n if x<0 or y<0 or x>x or y>h:\n return True\n return False","def is_valid_room(self, x, y):\r\n return 0 <= x < self.__nx and 0 <= y < self.__ny","def in_box(coords, box):\n if box[0][0] < coords[0] < box[1][0] and box[1][1] < coords[1] < box[0][1]:\n return True\n return False","def contains(self, position):\n return np.linalg.norm(position - self._center) < self._radius","def is_point_in_box(x, y, bbox):\n if x < 200 and y < 200:\n return True\n return False","def check_inside(self, person):\n p_top_x = person[0] + self.padding\n p_left_y = person[1] + self.padding\n p_bottom_x = person[2] - self.padding\n p_right_y = person[3] - self.padding\n\n return p_top_x >= self.top_x and p_left_y >= self.left_y and p_bottom_x <= self.bottom_x \\\n and p_right_y <= self.right_y","def check_bounds(self, index):\n if index < self.lower_bound or index > self.upper_bound:\n return False\n return True","def is_spot_possible(left, right, bottom, top):\n return True\n if right < 6 or bottom < 6:\n # print(\"IMPOSSIBLE\", left, right, top, bottom)\n return False\n if left > 18 or top > 18:\n # print(\"IMPOSSIBLE\", left, right, top, bottom)\n return False\n if abs(top - bottom) > 16 or abs(right - left) > 16:\n # print(\"IMPOSSIBLE\", left, right, top, bottom)\n return False\n return True","def in_box(coords, box):\n\tif box[0][0] < coords[0] < box[1][0] and box[1][1] < coords[1] < box[0][1]:\n\t\treturn True\n\treturn False","def out_of_bounds(self):\n return not 0 <= self.nodes[0].x < WIDTH * SCALE or not 0 <= self.nodes[0].y < HEIGHT * SCALE","def _is_valid_land(x, y, grid):\n return (x >= 0) and (x < len(grid)) and (y >= 0) and (y < len(grid[0])) and grid[x][y]","def in_rectangle(x, y):\n return ((self.min_x <= x <= self.max_x) and\n (self.min_y <= y <= self.max_y))","def coordinates_within_board(n: int, x: int, y: int) -> bool:\n\n return x < n and y < n and x >= 0 and y >= 0","def is_point_within(self, x, y):\n return abs(x - self._x_position) <= self._x_length / 2 and abs(y - self._y_position) <= self._y_length / 2","def in_geo_limits(args: argparse.Namespace, track_data: dict) -> bool:\n return (track_data['boundaries']['north'] <= args.north_lim and\n track_data['boundaries']['south'] >= args.south_lim and\n track_data['boundaries']['east'] <= args.east_lim and\n track_data['boundaries']['west'] >= args.west_lim)","def __contains__(self, item: 'BoundingBox2D') -> bool:\n top_left_inside = item.xmin >= self.xmin and item.ymin >= self.ymin\n bottom_right_inside = item.xmax <= self.xmax and item.ymax <= self.ymax\n return top_left_inside and bottom_right_inside","def is_pos_valid(pos, shape):\n x, y = pos\n is_valid = x >= 0 and x < shape[0] and y >= 0 and y < shape[1]\n return is_valid","def is_bound(self, point):\n return self.__begin == point or self.__end == point","def check_masked (self, pos : list,) :\n count = 0\n total = 0\n for x in range(pos[0],min(pos[0] + AUTO_width1, self.m_x)) :\n for y in range(pos[1], min(pos[1] + AUTO_width1, self.m_y)) :\n total += 1\n if self.current_grid[x][y] :\n count += 1\n if count/total > 0.5 :\n return True\n else :\n return False","def is_occupied(self, pos):\n return any([p == pos for p in self._workers.values()])","def check_edges(self):\r\n screen_rect = self.screen.get_rect()\r\n if self.rect.right >= screen_rect.right:\r\n return True\r\n elif self.rect.left <= 0:\r\n return True","def is_valid_position(self, x, y):\n if (x > self.n_cols-1 or y > self.n_rows-1) or (x < 0 or y < 0):\n return False\n\n elif self.grid[x][y] == 3:\n return False\n\n return True","def check_edges(self):\n\t\tbottom_screen_limit = 2 * self.rect.height\n\t\tscreen_rect = self.screen.get_rect()\n\t\tif (self.rect.top <= 100) or (self.rect.bottom >= self.screen_rect.bottom):\n\t\t#self.rect.bottom >= self.screen_rect.bottom:\n\t\t\treturn True","def __is_valid_position(self, position):\n return (position[0] >= 0\n and position[0] < self.config.arena_size[0]\n and position[1] >= 0\n and position[1] < self.config.arena_size[1]\n and self.arena[position[0]][position[1]] != Tile.TAIL)","def on_board(pos, size):\n\n row, col = pos\n height, width = size\n\n return 0 <= row <= width and 0 <= col <= height","def isOutsideBorder(self):\n if (self.posX < -self.myGalaxy.worldWidth or self.posX > self.myGalaxy.worldWidth or\n self.posY < -self.myGalaxy.worldHeight or self.posY > self.myGalaxy.worldHeight):\n return 1\n return 0","def g_in_bounds(x, lo, hi):\n\n return (x >= lo) and (x <= hi)","def point_in_rectangle(point: Vector, rect_min: Vector, rect_max: Vector) -> bool:\n return rect_min[0] <= point[0] <= rect_max[0] and rect_min[1] <= point[1] <= rect_max[1]","def within_boundaries(move):\n if move == ord('w') and ZERO_BASE_PLYR_POS in range(0, 10):\n return False\n elif move == ord('s') and ZERO_BASE_PLYR_POS in range(90, 100):\n return False\n elif move == ord('a') and ZERO_BASE_PLYR_POS in range(0, 91, 10):\n return False\n elif move == ord('d') and ZERO_BASE_PLYR_POS in range(9, 100, 10): \n return False\n else:\n return True"],"string":"[\n \"def in_bounds(self, position):\\n row, col = position\\n return ((row >= 0 and row < self.height) and\\n (col >= 0 and col < self.width))\",\n \"def is_in_bounds(pos):\\n return PLAYFIELD_PADDING[0] < pos[0] < PLAYFIELD_PADDING[0] +\\\\\\n BLOCK_NUM_WIDTH * Block.WIDTH and PLAYFIELD_PADDING[1] < pos[1] <\\\\\\n PLAYFIELD_PADDING[1] + BLOCK_NUM_HEIGHT * Block.HEIGHT\",\n \"def detect_in_bounds(self):\\n creature_x, creature_y = self.creature.current_location\\n if creature_x < 0 or creature_x >= self.world_width\\\\\\n or creature_y < 0 or creature_y >= self.world_height:\\n print('The creature is out of bounds!')\\n return False\\n return True\",\n \"def _in_bounds(self, x, y):\\r\\n return 0 <= x < 8 and 0 <= y < 8\",\n \"def in_bounds(self, x, y):\\n return x >= 0 and x < 8 and y >= 0 and y < 8\",\n \"def pos_within_bounds(position):\\n if type(position[0]) == int:\\n row,col = position\\n else:\\n col,row = position\\n \\n if not 1<=row<=8:\\n return False\\n if not 65<=ord(col)<=72:\\n return False\\n return True\",\n \"def in_bounds(self, location: tuple) -> bool:\\n return 0 <= min(location) and max(location) <= 7\",\n \"def inBounds(self, px, py):\\n return px >= 0 and py >= 0 and px < self.w and py < self.h\",\n \"def isPositionInRoom(self, pos):\\n\\t\\tif pos.getX() >= 0.0 and pos.getX() < float(self.width):\\n\\t\\t\\tif pos.getY() >= 0.0 and pos.getY() < float(self.height):\\n\\t\\t\\t\\treturn True\\n\\t\\treturn False\",\n \"def isPositionInRoom(self, pos):\\n posX = pos.getX()\\n posY = pos.getY()\\n if posX >= 0 and posX < self.width and posY >= 0 and posY < self.height:\\n return True\\n return False\",\n \"def check_inside(self, pos):\\n x,y = pos\\n return x >= self.posx and x <= self.posx + self.sizex and y >= self.posy and y <= self.posy + self.sizey\",\n \"def isPositionInRoom(self, pos):\\n if pos.getY() > self.height or pos.getX() > self.width or pos.getX() < 0 or pos.getY() < 0:\\n return False\\n else:\\n return True\",\n \"def bounds(self, pos):\",\n \"def isPositionInRoom(self, pos):\\n if pos.getX() >= 0 and pos.getX() < self.w:\\n if pos.getY() >= 0 and pos.getY() < self.h:\\n return True\\n return False\\n return False\",\n \"def boundary_check(limits : tuple, coords : tuple) -> bool:\\n xl,xh,yl,yh = limits\\n x,y = coords\\n bound_x = xl <= x and x < xh\\n bound_y = yl <= y and y < yh\\n return bound_x and bound_y\",\n \"def in_bounds(state, map_shape):\\n return 0 <= state[0] < map_shape[0] and 0 <= state[1] < map_shape[1]\",\n \"def at_pos(self, pos):\\n return pos-self.deadband < self.wm() < pos+self.deadband\",\n \"def IsBound(self) -> bool:\",\n \"def in_zone(self, bottom_left, top_right):\\n return (bottom_left.x <= self.pos.x and self.pos.x <= bottom_left.x and\\n top_right.y <= self.pos.y and self.pos.y <= top_right.y)\",\n \"def check_pos(self, x, y):\\n if x >= WINDOWWIDTH or y >= WINDOWHEIGHT or x <=0 or y <= 0:\\n return True\",\n \"def out_of_bounds(self):\\n return self.rect.right <= 0 or self.rect.left >= self.screen_rect.width\",\n \"def isPositionInRoom(self, pos):\\n #note to self '&' is bitwise, 'and' is a boolean operation\\n #NB: python permits the a<b<c syntax used below, doesn't need verbose 'and' tests.\\n #ie: 0 <= pos.getX() and pos.getX() <= self.width and 0 <= pos.getY() and pos.getY() <= self.height\\n return 0 <= pos.getX() < self.width and 0 <= pos.getY() < self.height\\n #raise NotImplementedError #refer https://docs.python.org/2/library/exceptions.html\",\n \"def isInRange(self, position) -> bool:\\n if position.getX() >= self.node.getX() - self.radius and position.getX() <= self.node.getX() + self.radius:\\n if position.getY() >= self.node.getY() - self.radius and position.getY() <= self.node.getY() + self.radius:\\n return True\\n return False\",\n \"def check_bounds(self, row: int, col: int) -> bool:\\n return 0 <= row < self.row and 0 <= col < self.col\",\n \"def validate_position(position: Tuple[int, int], bound: int) -> bool:\\n if position[0] < 0 or position[0] >= bound:\\n return False\\n if position[1] < 0 or position[1] >= bound:\\n return False\\n return True\",\n \"def out_of_bounds(self):\\n return self.rect.right <= 0\",\n \"def check_position(self, position):\\n x_axis, y_axis = position\\n try:\\n return bool(self.full_map[x_axis][y_axis] not in \\\"#\\\"\\n and 0 <= x_axis <= self.x_axis\\n and 0 <= y_axis <= self.y_axis)\\n\\n except IndexError:\\n return False\",\n \"def __cell_is_in_map(self, x, y) -> bool:\\n return x >= 0 and y >= 0 and x < self.occupancy_map.info.width and y < self.occupancy_map.info.height\",\n \"def hasSpaceAround(self,x,y):\\n global gamemap\\n c = 0\\n for x2 in xrange(-2,2):\\n for y2 in xrange(-2,2):\\n if self.near(x, y,x + x2,y + y2):\\n if not gamemap[x + x2][y + y2].type[0]:\\n c += 1\\n if c >= 8:\\n return False\\n else:\\n return True\",\n \"def isPositionInRoom(self, pos):\\n if pos in self.tiles:\\n return True\\n else:\\n return False\",\n \"def check_bounds (position, size):\\n \\n for item in position:\\n # checks whether item is out of bounds\\n if item < 0 or item >= size:\\n return False\\n return True\",\n \"def validatePosition(boardsize, pos):\\n return pos.x in range(0, boardsize) and pos.y in range(0,boardsize)\",\n \"def in_bounds(self, point):\\n # Sanity checks\\n # Check that point has same number of dimensions as graph\\n if not len(point) == len(self.dimensions):\\n raise Exception(\\\"Point has \\\" + str(len(point)) + \\\" dimensions, Coordination Space has \\\" + \\\\\\n str(len(self.dimensions)) + \\\" dimensions.\\\")\\n\\n for i, coordinate in enumerate(point):\\n if coordinate > self.dimensions[i] or coordinate < 0:\\n return False\\n\\n return True\",\n \"def isPositionInRoom(self, pos):\\n #if key tuple position(x,y) is in dictionary tiles return True else return False\\n posx = pos.getX()\\n posy = pos.getY()\\n posx = math.floor(posx)\\n posy = math.floor(posy)\\n if (posx >= self.width) or (posy >= self.height):\\n return False\\n\\n if (posx,posy) in self.tiles.keys():\\n return True\\n else:\\n return False\",\n \"def has_bounds(self):\\r\\n bounds = self.bounds\\r\\n if bounds in (None, [None, None]):\\r\\n return False\\r\\n for i in xrange(bounds[0]):\\r\\n if bounds[0][i] is not None and bounds[0][i] > -np.inf:\\r\\n return True\\r\\n for i in xrange(bounds[1]):\\r\\n if bounds[1][i] is not None and bounds[1][i] < np.inf:\\r\\n return True\\r\\n return False\",\n \"def is_inside(pos):\\r\\n\\t\\trow, col = pos\\r\\n\\t\\treturn 0 <= row and row < num_rows and \\\\\\r\\n\\t\\t\\t0 <= col and col < num_cols\",\n \"def is_inside(self, x: int, y: int) -> bool:\\n pass\",\n \"def contains ( self, pos ):\\n # make sure xmin is minimum etc\\n xmin = min(self.x_min,self.x_max)\\n xmax = max(self.x_min,self.x_max)\\n ymin = min(self.y_min,self.y_max)\\n ymax = max(self.y_min,self.y_max)\\n \\n abs_tol = self.abs_tol\\n # get pos indices inside rectangle (* == and)\\n if self.include_border:\\n inds = (pos[0, :] - xmin > -abs_tol) * \\\\\\n (pos[0, :] - xmax < abs_tol) * \\\\\\n (pos[1, :] - ymin > -abs_tol) * \\\\\\n (pos[1, :] - ymax < abs_tol)\\n else:\\n inds = (pos[0, :] - xmin > abs_tol) * \\\\\\n (pos[0, :] - xmax < -abs_tol) * \\\\\\n (pos[1, :] - ymin > abs_tol) * \\\\\\n (pos[1, :] - ymax < -abs_tol)\\n \\n \\n # if none inside, take nearest\\n if ~inds.any() and self.default_nearest:\\n x = (xmin + xmax) / 2.0\\n y = (ymin + ymax) / 2.0\\n dr2 = (pos[0, :] - x)**2 + (pos[1, :] - y)**2\\n inds[argmin(dr2)] = True\\n \\n return inds.astype(bool)\",\n \"def check_bounds(self):\\n\\n if self.bounds_action == self.BOUNCE:\\n if self.hits_left_or_right():\\n self.dx = self.dx * -1\\n if self.hits_top_or_bottom():\\n self.dy = self.dy * -1\\n\\n if self.bounds_action == self.STOP:\\n if self.hits_left_or_right():\\n self.dx = 0\\n self.dy = 0\\n if self.hits_top_or_bottom():\\n self.dx = 0\\n self.dy = 0\\n\\n if self.bounds_action == self.SKID:\\n if self.hits_left_or_right():\\n self.dx = 0\\n if self.hits_top_or_bottom():\\n self.dy = 0\\n\\n if self.bounds_action == self.DIE:\\n if self.hits_left_or_right() or self.hits_top_or_bottom():\\n self.dx = 0\\n self.dy = 0\\n self.visible = False\",\n \"def isValidPos(self, x, y, wallList, grid):\\n if (x, y) not in wallList:\\n return x > 0 and x < grid.width and y > 0 and y < grid.height\",\n \"def checkWithinBound(rowWithinBound,colWithinBound):\\n if(rowWithinBound == 0 and colWithinBound == 0):\\n return True\\n else:\\n return False\",\n \"def is_map_obstacle_in_screen_range(self):\\n raise NotImplementedError\",\n \"def is_position_allowed(new_x, new_y):\\n\\n return min_x <= new_x <= max_x and min_y <= new_y <= max_y\",\n \"def within(self, x, y):\\n return x >= self.top_x and x <= self.bottom_x and y >= self.bottom_y and y <= self.top_y\",\n \"def inCamp(self):\\n return (((self.myTeam==1) and (self.ballPos.x <= self.width/2))\\n | ((self.myTeam==2) and (self.ballPos.x >= self.width/2)))\",\n \"def inside_rectangle(self, x, y):\\n if (self.pos.x - self.width < x < self.pos.x + self.width and\\n self.pos.y - self.height < y < self.pos.y + self.height):\\n return True\",\n \"def is_visible(self, position, size=0):\\n # return True\\n size /= self.scale # size is in pixel\\n in_x = (self.focus.x + self.offset.x / self.scale - size <=\\n position.x <=\\n self.focus.x - self.offset.x / self.scale + size)\\n in_y = (self.focus.y + self.offset.y / self.scale - size <=\\n position.y <=\\n self.focus.y - self.offset.y / self.scale + size)\\n # if name == \\\"earth\\\":\\n # print(\\\"{:+e} {:+e} {}\\\".format(self.focus.y + self.offset2.y\\n # , position.y, in_y))\\n # print(\\\"{:+e} {:+e}\\\".format(self.focus.x, self.focus.y))\\n return in_x and in_y\",\n \"def in_range(x, y):\\n if (x < 0 or x > width or y < 0 or y > length):\\n return False\\n else:\\n return True\",\n \"def _isInScreen(self, pos):\\n if type(pos) is Vec2:\\n return pos.y >= 0 and pos.y <= self.screenSize[1] and pos.x >= 0 \\\\\\n and pos.x <= self.screenSize[0]\\n\\n return pos[1] >= 0 and pos[1] <= self.screenSize[1] and pos[0] >= 0 \\\\\\n and pos[0] <= self.screenSize[0]\",\n \"def can_reach(self, position: tuple) -> bool:\\n x = position[0]\\n y = position[1]\\n dist_to_shoulder = math.sqrt(x**2 + y**2)\\n max_dist = self.bicep_length + self.forearm_length\\n if dist_to_shoulder > max_dist:\\n return False\\n return True\",\n \"def square_is(position, expected, world):\\n\\n result = False\\n size = len(world) - 1\\n\\n if size >= position[0] >= 0 and size >= position[1] >= 0:\\n result = world[position[0]][position[1]] == expected\\n\\n return result\",\n \"def check_boundaries(self):\\n # Checks if the enemy bar has gone of the net\\n if self.rect.left <= self.settings.WINDOW_WIDTH / 2:\\n self.rect.left = self.settings.WINDOW_WIDTH / 2\\n self.isMovingUp = False\\n\\n # Checks if the enemy bar has gone out of bound to the right\\n if self.rect.right >= self.settings.WINDOW_WIDTH:\\n self.rect.right = self.settings.WINDOW_WIDTH\\n self.isMovingUp = True\",\n \"def inside_limits(self, point):\\n if not self.regions:\\n # Use rectangle check\\n lat, lon = point.latitude, point.longitude\\n if (lon > self.limits[0] and lat > self.limits[1] and\\n lon < self.limits[2] and lat < self.limits[3]):\\n return True\\n else:\\n return False\\n else:\\n # Check inside all possible regions\\n p = Point((point.longitude, point.latitude))\\n print(p, point)\\n # import IPython; IPython.embed()\\n for name, poly in self.regions.items():\\n # if poly.contains(p):\\n if p.intersects(poly):\\n return name\\n return False\",\n \"def __contains__(self,pos):\\n # Permet de donner une contenance a l objet\\n # Il devient comme une liste de point\\n # Ainsi on peut le parcourir comme on le ferai avec une liste\\n xmin=self.pos[0]\\n xmax=self.pos[0]+self.dim[0]\\n ymin=self.pos[1]\\n ymax=self.pos[1]+self.dim[1]\\n xpt=pos[0]\\n ypt=pos[1]\\n return (xpt>=xmin and xpt<=xmax and ypt>=ymin and ypt<=ymax)\",\n \"def __contains__(self,pos):\\n # Permet de donner une contenance a l objet\\n # Il devient comme une liste de point\\n # Ainsi on peut le parcourir comme on le ferai avec une liste\\n xmin=self.pos[0]\\n xmax=self.pos[0]+self.dim[0]\\n ymin=self.pos[1]\\n ymax=self.pos[1]+self.dim[1]\\n xpt=pos[0]\\n ypt=pos[1]\\n return (xpt>=xmin and xpt<=xmax and ypt>=ymin and ypt<=ymax)\",\n \"def _inside_bounds(A, B):\\n for axis in 'xyz':\\n minA, maxA = axis_bounds(A, axis)\\n minB, maxB = axis_bounds(B, axis)\\n if (minA <= minB) or (maxA >= maxB):\\n return False\\n\\n return True\",\n \"def point_in_map(self, x, y):\\r\\n return 0 <= x < self.width and 0 <= y < self.height and (x,y) not in self.walls\",\n \"def _check_if_position_on_board(coord: tuple, board_size: int):\\n in_row = coord[0] in range(board_size)\\n in_col = coord[1] in range(board_size)\\n return in_row and in_col\",\n \"def in_board(self,pos : np.ndarray) -> bool:\\r\\n if 0 > pos[0] or pos[0] >= BOARD_SIZE:\\r\\n return False\\r\\n if 0 > pos[1] or pos[1] >= BOARD_SIZE:\\r\\n return False\\r\\n\\r\\n return True\",\n \"def isInGoal(self):\\n coordx= self.playerPos.x\\n coordy= self.playerPos.y\\n target = 0 if self.id_team == 1 else 1\\n\\n if((((target == 0)and (coordx<=5))|\\n ((target == 1) and(coordx>145))) \\n and (coordy<=50 and coordy>=40)):\\n return True\\n else:\\n return False\",\n \"def valid(self, pos):\\n\\t\\tpos = Point(pos)\\n\\t\\treturn 0 <= pos.x < self.dims.width and 0 <= pos.y < self.dims.height\",\n \"def is_in_collision_point(self, pos):\\n x, y = pos\\n return sqrt((self.x - x)**2 + (self.y - y)**2) < self.r\",\n \"def _point_within_bounds(bounds, p):\\n A, B = bounds\\n # we have to add epsilon since test against horizontal or vertical\\n # lines may fail if the point is off by numerical precision\\n eps = 1e-10\\n (Ax,Ay), (Bx,By), (px,py)=A,B,p\\n return (\\n (min((Ax,Bx))-eps<=px<=max((Ax,Bx))+eps) and\\n (min((Ay,By))-eps<=py<=max((Ay,By))+eps)\\n )\",\n \"def if_near_boom(self, player_pos, boom_pos):\\n if player_pos[0] == boom_pos[0]:\\n if player_pos[1] in range(boom_pos[1]-2*30, boom_pos[1]+3*30, 30):\\n return True\\n else:\\n return False\\n elif player_pos[1] == boom_pos[1]:\\n if player_pos[0] in range(boom_pos[0]-2*30, boom_pos[0]+3*30, 30):\\n return True\\n else:\\n return False\\n else:\\n return False\",\n \"def checkBounds(x,y,z,center,radius):\\n r2 = (x-center[0])**2 + (y-center[1])**2# + (z-center[0])**2\\n if r2 < radius**2:\\n return True\\n else:\\n return False\",\n \"def is_in_field(self, x, y):\\n return (self.origin_x <= x < self.width) and (self.origin_y <= y < self.height)\",\n \"def is_bound(pos1, el1, pos2, el2):\\n threshold = 0.1\\n if el1 == 'H' or el2 == 'H':\\n threshold = 0.2\\n if np.linalg.norm(np.array(pos1) - np.array(pos2)) < covalence_radius[el1] + covalence_radius[el2] + threshold:\\n return True\\n return False\",\n \"def check_boundary(self, width, height):\\r\\n if 0 <= self.head[0] + self.direction[0]*10 <= width - 10 and 0 <= self.head[1] + self.direction[1]*10 <= height - 10:\\r\\n return True\\r\\n else:\\r\\n return False\",\n \"def isInside(self, position, maxDimLens):\\n dim = len(position);\\n deltas = [0] * dim;\\n distSqr = 0;\\n for i in range(0, dim):\\n deltas[i] = math.fabs(position[i] - self.mSample[i]);\\n if math.fabs(maxDimLens[i] - deltas[i]) < deltas[i]:\\n deltas[i] = math.fabs(maxDimLens[i] - deltas[i]);\\n distSqr += deltas[i]**2;\\n\\n if distSqr < ( self.mRadius**2 ):\\n return True;\\n else:\\n return False;\",\n \"def in_box_bounds(self, test_vec):\\n above_min = np.greater(test_vec, self.lower_vertex).all()\\n below_max = np.greater(self.upper_vertex, test_vec).all()\\n return above_min and below_max\",\n \"def check_coord_in_range(self, x, y):\\n return 0 <= x < self.cols and 0 <= y < self.lines\",\n \"def outOfScreen(self):\\n x,y = self.currentLevel.transformToScreenCoordinate(self.position)\\n w,h = cblocals.GAME_SCREEN_SIZE\\n if x<0 or y<0 or x>x or y>h:\\n return True\\n return False\",\n \"def is_valid_room(self, x, y):\\r\\n return 0 <= x < self.__nx and 0 <= y < self.__ny\",\n \"def in_box(coords, box):\\n if box[0][0] < coords[0] < box[1][0] and box[1][1] < coords[1] < box[0][1]:\\n return True\\n return False\",\n \"def contains(self, position):\\n return np.linalg.norm(position - self._center) < self._radius\",\n \"def is_point_in_box(x, y, bbox):\\n if x < 200 and y < 200:\\n return True\\n return False\",\n \"def check_inside(self, person):\\n p_top_x = person[0] + self.padding\\n p_left_y = person[1] + self.padding\\n p_bottom_x = person[2] - self.padding\\n p_right_y = person[3] - self.padding\\n\\n return p_top_x >= self.top_x and p_left_y >= self.left_y and p_bottom_x <= self.bottom_x \\\\\\n and p_right_y <= self.right_y\",\n \"def check_bounds(self, index):\\n if index < self.lower_bound or index > self.upper_bound:\\n return False\\n return True\",\n \"def is_spot_possible(left, right, bottom, top):\\n return True\\n if right < 6 or bottom < 6:\\n # print(\\\"IMPOSSIBLE\\\", left, right, top, bottom)\\n return False\\n if left > 18 or top > 18:\\n # print(\\\"IMPOSSIBLE\\\", left, right, top, bottom)\\n return False\\n if abs(top - bottom) > 16 or abs(right - left) > 16:\\n # print(\\\"IMPOSSIBLE\\\", left, right, top, bottom)\\n return False\\n return True\",\n \"def in_box(coords, box):\\n\\tif box[0][0] < coords[0] < box[1][0] and box[1][1] < coords[1] < box[0][1]:\\n\\t\\treturn True\\n\\treturn False\",\n \"def out_of_bounds(self):\\n return not 0 <= self.nodes[0].x < WIDTH * SCALE or not 0 <= self.nodes[0].y < HEIGHT * SCALE\",\n \"def _is_valid_land(x, y, grid):\\n return (x >= 0) and (x < len(grid)) and (y >= 0) and (y < len(grid[0])) and grid[x][y]\",\n \"def in_rectangle(x, y):\\n return ((self.min_x <= x <= self.max_x) and\\n (self.min_y <= y <= self.max_y))\",\n \"def coordinates_within_board(n: int, x: int, y: int) -> bool:\\n\\n return x < n and y < n and x >= 0 and y >= 0\",\n \"def is_point_within(self, x, y):\\n return abs(x - self._x_position) <= self._x_length / 2 and abs(y - self._y_position) <= self._y_length / 2\",\n \"def in_geo_limits(args: argparse.Namespace, track_data: dict) -> bool:\\n return (track_data['boundaries']['north'] <= args.north_lim and\\n track_data['boundaries']['south'] >= args.south_lim and\\n track_data['boundaries']['east'] <= args.east_lim and\\n track_data['boundaries']['west'] >= args.west_lim)\",\n \"def __contains__(self, item: 'BoundingBox2D') -> bool:\\n top_left_inside = item.xmin >= self.xmin and item.ymin >= self.ymin\\n bottom_right_inside = item.xmax <= self.xmax and item.ymax <= self.ymax\\n return top_left_inside and bottom_right_inside\",\n \"def is_pos_valid(pos, shape):\\n x, y = pos\\n is_valid = x >= 0 and x < shape[0] and y >= 0 and y < shape[1]\\n return is_valid\",\n \"def is_bound(self, point):\\n return self.__begin == point or self.__end == point\",\n \"def check_masked (self, pos : list,) :\\n count = 0\\n total = 0\\n for x in range(pos[0],min(pos[0] + AUTO_width1, self.m_x)) :\\n for y in range(pos[1], min(pos[1] + AUTO_width1, self.m_y)) :\\n total += 1\\n if self.current_grid[x][y] :\\n count += 1\\n if count/total > 0.5 :\\n return True\\n else :\\n return False\",\n \"def is_occupied(self, pos):\\n return any([p == pos for p in self._workers.values()])\",\n \"def check_edges(self):\\r\\n screen_rect = self.screen.get_rect()\\r\\n if self.rect.right >= screen_rect.right:\\r\\n return True\\r\\n elif self.rect.left <= 0:\\r\\n return True\",\n \"def is_valid_position(self, x, y):\\n if (x > self.n_cols-1 or y > self.n_rows-1) or (x < 0 or y < 0):\\n return False\\n\\n elif self.grid[x][y] == 3:\\n return False\\n\\n return True\",\n \"def check_edges(self):\\n\\t\\tbottom_screen_limit = 2 * self.rect.height\\n\\t\\tscreen_rect = self.screen.get_rect()\\n\\t\\tif (self.rect.top <= 100) or (self.rect.bottom >= self.screen_rect.bottom):\\n\\t\\t#self.rect.bottom >= self.screen_rect.bottom:\\n\\t\\t\\treturn True\",\n \"def __is_valid_position(self, position):\\n return (position[0] >= 0\\n and position[0] < self.config.arena_size[0]\\n and position[1] >= 0\\n and position[1] < self.config.arena_size[1]\\n and self.arena[position[0]][position[1]] != Tile.TAIL)\",\n \"def on_board(pos, size):\\n\\n row, col = pos\\n height, width = size\\n\\n return 0 <= row <= width and 0 <= col <= height\",\n \"def isOutsideBorder(self):\\n if (self.posX < -self.myGalaxy.worldWidth or self.posX > self.myGalaxy.worldWidth or\\n self.posY < -self.myGalaxy.worldHeight or self.posY > self.myGalaxy.worldHeight):\\n return 1\\n return 0\",\n \"def g_in_bounds(x, lo, hi):\\n\\n return (x >= lo) and (x <= hi)\",\n \"def point_in_rectangle(point: Vector, rect_min: Vector, rect_max: Vector) -> bool:\\n return rect_min[0] <= point[0] <= rect_max[0] and rect_min[1] <= point[1] <= rect_max[1]\",\n \"def within_boundaries(move):\\n if move == ord('w') and ZERO_BASE_PLYR_POS in range(0, 10):\\n return False\\n elif move == ord('s') and ZERO_BASE_PLYR_POS in range(90, 100):\\n return False\\n elif move == ord('a') and ZERO_BASE_PLYR_POS in range(0, 91, 10):\\n return False\\n elif move == ord('d') and ZERO_BASE_PLYR_POS in range(9, 100, 10): \\n return False\\n else:\\n return True\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8121233","0.78420454","0.783356","0.7815986","0.77785796","0.77391034","0.7499602","0.74738336","0.7412133","0.7395001","0.7287691","0.7282496","0.72665375","0.72362554","0.7205017","0.7162476","0.71581644","0.71300095","0.71250474","0.7091146","0.706064","0.7015256","0.6961238","0.6956712","0.694453","0.6938326","0.69321895","0.6922159","0.691907","0.6914208","0.69104975","0.688735","0.68483764","0.68429667","0.68360925","0.68247086","0.68147","0.6806319","0.68061113","0.6795453","0.6779978","0.67799133","0.676991","0.67681503","0.6754985","0.674448","0.673811","0.67067087","0.670484","0.6702484","0.6698071","0.6678058","0.6673175","0.66574454","0.66574454","0.6640769","0.66315186","0.6626822","0.662386","0.6622775","0.6618873","0.66111994","0.6600761","0.6596996","0.65873855","0.65825313","0.65792567","0.65788895","0.6572296","0.6564709","0.6538615","0.6525626","0.652221","0.6519175","0.65089583","0.65083057","0.6505923","0.650339","0.6495575","0.6494731","0.6491702","0.64915377","0.6489776","0.64868444","0.64819276","0.6478762","0.6475844","0.647382","0.6471909","0.6458758","0.6454542","0.6452559","0.6447726","0.6447524","0.642878","0.6421772","0.6418946","0.64106095","0.6409684","0.6408432"],"string":"[\n \"0.8121233\",\n \"0.78420454\",\n \"0.783356\",\n \"0.7815986\",\n \"0.77785796\",\n \"0.77391034\",\n \"0.7499602\",\n \"0.74738336\",\n \"0.7412133\",\n \"0.7395001\",\n \"0.7287691\",\n \"0.7282496\",\n \"0.72665375\",\n \"0.72362554\",\n \"0.7205017\",\n \"0.7162476\",\n \"0.71581644\",\n \"0.71300095\",\n \"0.71250474\",\n \"0.7091146\",\n \"0.706064\",\n \"0.7015256\",\n \"0.6961238\",\n \"0.6956712\",\n \"0.694453\",\n \"0.6938326\",\n \"0.69321895\",\n \"0.6922159\",\n \"0.691907\",\n \"0.6914208\",\n \"0.69104975\",\n \"0.688735\",\n \"0.68483764\",\n \"0.68429667\",\n \"0.68360925\",\n \"0.68247086\",\n \"0.68147\",\n \"0.6806319\",\n \"0.68061113\",\n \"0.6795453\",\n \"0.6779978\",\n \"0.67799133\",\n \"0.676991\",\n \"0.67681503\",\n \"0.6754985\",\n \"0.674448\",\n \"0.673811\",\n \"0.67067087\",\n \"0.670484\",\n \"0.6702484\",\n \"0.6698071\",\n \"0.6678058\",\n \"0.6673175\",\n \"0.66574454\",\n \"0.66574454\",\n \"0.6640769\",\n \"0.66315186\",\n \"0.6626822\",\n \"0.662386\",\n \"0.6622775\",\n \"0.6618873\",\n \"0.66111994\",\n \"0.6600761\",\n \"0.6596996\",\n \"0.65873855\",\n \"0.65825313\",\n \"0.65792567\",\n \"0.65788895\",\n \"0.6572296\",\n \"0.6564709\",\n \"0.6538615\",\n \"0.6525626\",\n \"0.652221\",\n \"0.6519175\",\n \"0.65089583\",\n \"0.65083057\",\n \"0.6505923\",\n \"0.650339\",\n \"0.6495575\",\n \"0.6494731\",\n \"0.6491702\",\n \"0.64915377\",\n \"0.6489776\",\n \"0.64868444\",\n \"0.64819276\",\n \"0.6478762\",\n \"0.6475844\",\n \"0.647382\",\n \"0.6471909\",\n \"0.6458758\",\n \"0.6454542\",\n \"0.6452559\",\n \"0.6447726\",\n \"0.6447524\",\n \"0.642878\",\n \"0.6421772\",\n \"0.6418946\",\n \"0.64106095\",\n \"0.6409684\",\n \"0.6408432\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.8067338"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":94794,"cells":{"query":{"kind":"string","value":"Takes a pawn and returns it's relative move position"},"document":{"kind":"string","value":"def movePos(self,p,intMove):\n return pos(p.pos.x-(intMove*self.intPlayer(p.color)),p.pos.y+self.intPlayer(p.color))"},"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 move_pawn(pos, game):\n #Convert coordinates to row and column\n row = int(pos[1]//(SQUARESIZE+FENCEWIDTH))\n col = int(pos[0]//(SQUARESIZE+FENCEWIDTH))\n #Make move\n game.move_pawn(game.get_player_turn(), (col,row))","def get_move(board, player):\r\n row, col = 0, 0\r\n return row, col","def get_move(board, player):\n row, col = 0, 0\n return row, col","def get_ai_move(board, player):\r\n row, col = 0, 0\r\n return row, col","def get_ai_move(board, player):\n row, col = 0, 0\n return row, col","def choose_absolute_move(self):\n move = self.choose_move()\n if self.player_name == 'A':\n return move\n # Player B, revert the IDs\n return (move + 6) % 12","def _get_player_move(self) -> Tile:\n if not self.game_state:\n raise RuntimeError(\"Cannot call get_player_move when the game has not started!\")\n current_player = next(player for player in self.player_list if player.name == self.current_turn.name)\n if current_player is None:\n raise RuntimeError(\"Attempted to get player move from a player who does not exist!\")\n return current_player.move()","def get_piece_jumping_position(self, captured_piece):\n row_diff = captured_piece.row - self.row # Compares the row/column numbers of the two pieces\n col_diff = captured_piece.col - self.col\n opp_row = row_diff + captured_piece.row\n opp_col = col_diff + captured_piece.col\n return {'opp_row': opp_row, 'opp_col': opp_col}","def move(self, rel_pos):\n self.pos = (self.pos[0] + rel_pos[0] * GRID, self.pos[1] + rel_pos[1] * GRID)","def relative_position(self) -> Tuple[int, int]:\n return self.position[0] - self.region.rect.x, self.position[1] - self.region.rect.y","def relative_position(self) -> Tuple[int, int]:\n return self.position[0] - self.region.rect.x, self.position[1] - self.region.rect.y","def DoMove(position, move):\n return position - move","def get_move(self):\n if self._difficulty == 0:\n return self._get_easy_move()\n else:\n # Different stategies/difficulties can be attached here\n return","def get_move(self, game):\n return","def get_move(self, game_state: BotGameState) -> BotMove:\n return","def get_move(moves):\n pass","def player_location(self):\n x = 0\n y = 0\n for line in self.grid:\n for i in line:\n if i == \"P\":\n return x, y\n \n y+=1\n x += 1\n y = 0","def move_origin(self, x, y):\n return Position(self.x - x, self.y - y)","def makeMove(self, move, player):","def is_pawn_move_valid(self, from_row, from_col, to_row, to_col):\n # Setup variables used\n piece = self.board.squares[from_row][from_col]\n piece_color = self.piece_color(piece)\n to_piece = self.board.squares[to_row][to_col]\n row_diff = abs(from_row - to_row)\n col_diff = abs(from_col - to_col)\n dc = 0\n\n # Set flag for first move of pawn\n first_move = True if from_row == 6 or from_row == 1 else False\n\n # If direction is not correct for white, exit\n if to_row - from_row > 0:\n dr = 1\n if self.piece_color(piece) == \"white\":\n return False\n\n # If direction is not correct for black, exit\n if to_row - from_row < 0:\n dr = -1\n if self.piece_color(piece) == \"black\":\n return False\n\n # If moving straight\n if from_col == to_col:\n # if not legal straight move, exit\n if not (row_diff == 1 or (first_move and row_diff == 2)):\n return False\n\n # make sure to move has no pieces on straight path\n dm = row_diff + 1\n\n # return value\n retVal = self._any_piece_in_way(from_row, from_col, dr, dc, dm)\n\n# if retVal and not self.testing:\n# # self.pawn_promotion(to_row, to_col, piece_color)\n# self.board.overwrite_board_square(to_row, to_col)\n# if piece_color == \"black\":\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\n# else:\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\n\n return retVal\n\n # WHITE en passant\n # move from moveHistory => (\"piece\", fromRow, fromCol, toRow, toCol)\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\n self.moveHistory[-1][0] == \"♟\" and self.moveHistory[-1][1] == 1 and\\\n self.moveHistory[-1][3] == 3 and piece_color == \"white\":\n if col_diff == 1 and row_diff == 1 and to_piece == None:\n if not self.testing:\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\n return True\n\n # BLACK en passant\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\n self.moveHistory[-1][0] == \"♙\" and self.moveHistory[-1][1] == 6 and\\\n self.moveHistory[-1][3] == 4 and piece_color == \"black\":\n if col_diff == 1 and row_diff == 1 and to_piece == None:\n if not self.testing:\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\n return True\n\n # else move must be taking piece directly move\n # if legal taking piece move and (opponent-already check for own piece) piece at to-square\n if col_diff == 1 and row_diff == 1 and to_piece != None:\n\n# if not self.testing:\n# # self.pawn_promotion(to_row, to_col, piece_color)\n# self.board.overwrite_board_square(to_row, to_col)\n# if piece_color == \"black\":\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\n# else:\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\n return True\n\n return False","def getKickingPosition():\n pass","def _acting_player_position(self):\n return self._env.acting_player_position","def _get_move(self) -> Tile:\n if not self.game_state:\n raise RuntimeError(\"Cannot call get_move when the game has not started!\")\n if isinstance(self.current_turn, Player):\n return self._get_player_move()\n elif isinstance(self.current_turn, Enemy):\n return self._get_enemy_move()\n else:\n raise TypeError(\"You're trying to move something that isn't a character or an adversary.\")","def getNextPosition(move, data):\n\tnextPos = {\"x\": data[\"you\"][\"body\"][0]['x'],\n\t\t\t\t\"y\": data[\"you\"][\"body\"][0]['y']}\n\n\tif move == 'up':\n\t\tnextPos[\"y\"] = nextPos[\"y\"] - 1\n\telif move == 'down':\n\t\tnextPos[\"y\"] = nextPos[\"y\"] + 1\n\telif move == 'right':\n\t\tnextPos[\"x\"] = nextPos[\"x\"] + 1\n\telif move == 'left'\t:\n\t\tnextPos[\"x\"] = nextPos[\"x\"] - 1\n\treturn nextPos","def modpos(pos,L,move):\n pos += move\n if pos == L: #moved off right or bottom\n return(0)\n if pos == -1:#moved off top or left\n return(L-1)\n return(pos) #in the middle","def get_move(board, player):\n #optimization to always pick the top-left corner on an empty board\n if set(board) == set([config.NO_PLAYER]):\n return 0\n result = minimax(board, player, 2, config.NEG_INF, config.INF)\n return result.index","def get_player_move(self, roundNum, player):\n return (self.moves[roundNum])[player]","def get_player_position(self):\n raise NotImplementedError","def move_wrapper(board, player, trials):\r\n move = mm_move(board, player)\r\n assert move[1] != (-1, -1), \"returned illegal move (-1, -1)\"\r\n return move[1]","def move_wrapper(board, player, trials):\r\n move = mm_move(board, player)\r\n assert move[1] != (-1, -1), \"returned illegal move (-1, -1)\"\r\n return move[1]","def get_move(state, player, max_time, verbose):\n # We call the player bot in a separate process.This allows us to terminate\n # if the player takes too long.\n manager = Manager()\n result = manager.dict() # result is a variable shared between our process and\n # the player's. This allows it to pass the move to us\n\n # Start a process with the function 'call_player' and the given arguments\n process = Process(target=call_player, args=(player, state, result))\n\n # Start the process\n process.start()\n\n # Rejoin at most max_time miliseconds later\n process.join(max_time / 1000)\n\n # Check if the process terminated in time\n move = None\n if process.is_alive():\n pr('! Player {} took too long, no move made.'.format(state.whose_turn()), verbose)\n\n process.terminate()\n process.join()\n\n else:\n # extract the move\n move = result['move']\n\n return move","def getOpponentMove(move, playerBoard, oppBoard, playerSeeds, oppSeeds):\r\n pass","def update(self, move):\n\n if not 0 <= move < 7:\n raise InvalidMove\n\n placed = False\n x = None\n y = None\n\n for row in reversed(xrange(self._rows)):\n if not self._board[row][move]:\n self._board[row][move] = self.current_player\n placed = True\n x = move\n y = row\n break\n\n if not placed:\n raise InvalidMove\n\n return (x, y)","def respawn_player(self):\n self.rect.x = 50\n self.rect.y = 50\n \n # Specifies the Player's spawnpoint as maze_arrangement[1][1], representing\n # the tile in the top-left corner of the maze\n self.__user_x = 1\n self.__user_y = 1","def compute_new_position_from_dice(self, player_index, thr):\r\n new_position = self.player_positions[player_index] + thr.get_amount()\r\n\r\n if new_position >= len(self.squares):\r\n new_position -= len(self.squares)\r\n\r\n return new_position","def getPawn(self,x,y):\n if(self.gameState[x,y]==EMPTY):\n return\n return Pawn(x,y,self.gameState[x,y])","def move_wrapper(board, player, trials):\n move = mm_move(board, player)\n assert move[1] != (-1, -1), \"returned illegal move (-1, -1)\"\n return move[1]","def move_wrapper(board, player, trials):\n move = mm_move(board, player)\n assert move[1] != (-1, -1), \"returned illegal move (-1, -1)\"\n return move[1]","def move_relative(self, delta):\n return self.move(delta, relative=True)","def getManipulatorPosition(transform):\n pm.select(transform)\n pm.setToolTo('Move')\n position = pm.manipMoveContext('Move', q=1, p=1)\n pm.select(clear=True)\n return position","def get_ai_move(board):\n return Connect4MiniMax.get_move(board)","def _AN_to_coords(self, move: str):\n\n orig_move = move\n\n extra_info = \"\"\n\n # remove all characters that don't matter when parsing\n for pointless_char in \"x+#\":\n move = move.replace(pointless_char, \"\")\n\n # Handle castling\n if CASTLE_QUEENSIDE in move:\n row = self._get_castling_row()\n return (row, 4), (row, 2), CASTLE_QUEENSIDE\n elif CASTLE_KINGSIDE in move:\n row = self._get_castling_row()\n return (row, 4), (row, 6), CASTLE_KINGSIDE\n\n # Pawn promotion\n if move[-2] == \"=\":\n extra_info = move[-1] if self.white_to_move else move[-1].lower()\n move = move[:-2]\n\n # Destination of move, this is the only guaranteed substring in the move\n dest_str = move[-2:]\n dest = State._EAN_coords_to_board_coords(dest_str)\n move = move[:-2]\n\n # Deduce what piece actually made the move, if there is no shown there is no pawn\n # Note in AN pieces are always uppercase and location is lowercase,\n # so this makes it simple to check if we have a piece or a location\n piece = \"P\"\n if move and move[0].isupper():\n piece = move[0]\n move = move[1:]\n if not self.white_to_move:\n piece = piece.lower()\n\n # At this point the only info the move should contain is a hint on where the piece is coming from\n loc_hint = move\n\n possible_moves = self.get_all_moves()\n possible_moves = filter(lambda x: dest_str in x, possible_moves) # Filter to only moves that land on the right destination\n possible_moves = list(filter(lambda x: loc_hint in x[0:2], possible_moves)) # Filter to only moves that match the hint in the algebraic notation\n for possible_move in possible_moves:\n row, col = State._EAN_coords_to_board_coords(possible_move[0:2])\n if self.board[row][col] == piece:\n return (row, col), dest, extra_info\n\n raise ValueError(\"Algebraic notation parsing failed, no valid move found matching the given move \" + orig_move\n + \" with board state\\n\" + str(self))","def move_me(self):\r\n\t\t#self.start_pos = self.rect.center\t\t\t\r\n\t\tif self.goal_pos is not None:\r\n\t\t\tprint(f'goal_pos: {self.goal_pos}, start_pos: {self.start_pos}')\r\n\t\t\tdx = self.goal_pos[0] - self.start_pos[0]\r\n\t\t\tdy = self.goal_pos[1] - self.start_pos[1]\r\n\r\n\t\t\tdistance = math.sqrt(dx*dx + dy*dy)\r\n\t\t\tself.shift += self.speed\r\n\r\n\t\ttry:\r\n\t\t\tif self.shift/distance < 0.99:\r\n\t\t\t\tself.rect.center = (self.start_pos[0] + self.shift/distance * dx,\r\n\t\t\t\t\t\t\t\t\t self.start_pos[1] + self.shift/distance * dy)\r\n\t\t\t\tprint(f'going to: {self.goal_pos}')\r\n\t\texcept ZeroDivisionError:\r\n\t\t\t\tpass\t\r\n\t\treturn True","def get_move(self, board):\n # First, check if we can win in the next move\n winning_move = self.get_winning_move(board, self.letter)\n if winning_move is not None:\n return winning_move\n # Check if the player could win on their next move, and block them.\n blocking_move = self.get_winning_move(board, self.opponent_letter)\n if blocking_move is not None:\n return blocking_move\n # Try to take one of the corners, if they are free.\n corner_move = self.move_in_a_corner(board)\n if corner_move is not None:\n return corner_move\n # Try to take the center, if it is free.\n if board.size % 2 == 1:\n if board.is_position_availible(board.letters[board.size // 2]\n + board.numbers[board.size // 2]):\n return board.letters[board.size // 2] + board.numbers[board.size // 2]\n # Move on one of the sides.\n return self.choose_random_move_from_list(board, list(board.positions.keys()))","def move(self, row, col, player):","def player_pos(self) -> Pt:\n return self._player","def move(self,p,intMove):\n gs = self.gameState.copy() #copy Board\n gs[p.pos.get()] = EMPTY #put position it was at as empty\n gs[self.movePos(p,intMove).get()] = p.color #set new position as filled\n return ((p,intMove),Board(gs,self.togglePlayer(self.whoseTurn)))","def _player_loc():\n return _to_my_vec3(_get_mc().player.getTilePos())","def my_location(state):\n return state['gladiators'][state['current_player']]['pos']","def determine_move_position(self):\n green_probs = []\n net_size = len(self.net)\n adjacents = self.net[self.current_pos].adjacents\n #Belief propagation:\n #Analyzes each position's probability of obtaining\n #green when measuring at a time t+1.\n for i in adjacents:\n accum = 0\n for j in range(0, net_size):\n distance = self.__get_distance(i-1, j)\n if distance == 0: #Probability of measure green at distance 0 from 'i'.\n accum += self.enemy_net[i-1].value * self.ct[0][0]\n elif distance == 1: #Probability of measure green at distance 1 from 'i'.\n accum += self.enemy_net[i-1].value * self.ct[1][0]\n elif distance == 2: #Probability of measure green at distance 2 from 'i'.\n accum += self.enemy_net[i-1].value * self.ct[2][0]\n elif distance == 3: #Probability of measure green at distance 3 from 'i'.\n accum += self.enemy_net[i-1].value * self.ct[3][0]\n else: #Probability of measure green at a distance >= 4 from 'i'.\n accum += self.enemy_net[i-1].value * self.ct[4][0]\n green_probs.append((i, accum))\n #Returns the position in which the probability of\n #obtaining green when measuring is the lowest.\n return min(green_probs, key=itemgetter(1))[0]","def getTilePos(self, pos = None):\n\n if not pos:\n pos = self.actor.getPos()\n \n for i in range(len(pos)):\n pos[i] = int(math.floor( (pos[i] + self.dimensions[i]) / 2.0))\n #pos[i] = int(math.floor( pos[i] / 2.0))\n\n return pos","def player_movement(self):","def firstMove(self):\n return (10, 10)","def tile_to_world_loc(tile, player_tile):\n relxyz = tile_to_rel_loc(tile, player_tile)\n\n return (player.X + relxyz[0], player.Y + relxyz[1], player.Z + relxyz[2])","def move(self):\r\n move = None\r\n if self.last_move is None:\r\n move = rockyman.move(self)\r\n else:\r\n index = the_moves.index(self.last_move) + 1\r\n if index >= len(the_moves):\r\n index = 0\r\n move = the_moves[index]\r\n self.last_move = move\r\n return move","def getMove(self, board):\n pass","def get_position(self):\n position = (self.position_x * SPRITE_SIZE, self.position_y * SPRITE_SIZE)\n return position","def move(self):\r\n his_move = random.randint(0, 2)\r\n return the_moves[his_move]","def move(self, row: int, col: int, player: int):\n def addup(dict_name, invalid_set, another_invalid, locx, locy):\n if locx == locy:\n diag_name = (1,1)\n if diag_name not in invalid_set:\n dict_name[diag_name] += 1\n if dict_name[diag_name] == self.tar:\n return player\n another_invalid.add(diag_name)\n if locx == self.tar-1-locy:\n diag_name = (-1, -1)\n if diag_name not in invalid_set:\n dict_name[diag_name] += 1\n if dict_name[diag_name] == self.tar:\n return player\n another_invalid.add(diag_name)\n curcol = (locy, None)\n currow = (None, locx)\n if curcol not in invalid_set:\n dict_name[curcol] += 1\n if dict_name[curcol] == self.tar:\n return player\n another_invalid.add(curcol)\n if currow not in invalid_set:\n dict_name[currow] += 1\n if dict_name[currow] == self.tar:\n return player\n another_invalid.add(currow)\n return 0\n res = 0\n if (row, col) not in self.walked:\n if player == 1:\n res = addup(self.p1, self.invalid_1, self.invalid_2, row, col)\n if player == 2:\n res = addup(self.p2, self.invalid_2, self.invalid_1, row, col)\n self.walked.add((row, col))\n return res","def position(self):\n return self.source.position + self.position_relative","def make_move(self, board: Board) -> int:\n move, evalutation = self.minimax(board, -math.inf, math.inf, self._depth, 1)\n return move","def follow(self):\n \n # create list to add with moves\n pos_list = [self.position, self.position, self.position, self.position]\n # list of surrounding indices\n moveset = add_lists(self.moves, pos_list)\n \n # checks if there is bot nearby\n for item in moveset:\n if type(item) is Bot:\n return item\n \n # if no bot found, returns original position\n return self.position","def apply_move(cell, x, y):\r\n x2 = (co_ords[cell])[0] + x\r\n y2 = (co_ords[cell])[1] + y\r\n return (x2, y2)","def relative_board(self):\n board = self.game.board\n if self.player_name == 'A':\n return board\n # Revert the board\n return board[6:] + board[:6]","def best_move(self):\n if self._move is not None:\n return self._move\n else:\n return self.pass_move","def player_position(self, player_ip, *args):\r\n\t\ttry:\r\n\t\t\tteam_type = self._teammates[player_ip]\r\n\t\texcept KeyError:\r\n\t\t\tself._comm_server.send_message(player_ip, \"position -1 -1\")\r\n\t\t\treturn\r\n\t\telse:\r\n\t\t\tmaze_pos_finder = self._teams[team_type].maze_pos_finder\r\n\t\t\tplayer_info = self._teams[team_type].get_player_info_by_IP(player_ip)\r\n\r\n\t\t\tpos = maze_pos_finder.get_maze_pos(player_info.color_bgr)\r\n\r\n\t\t\tif pos is not None:\r\n\t\t\t\tself._comm_server.send_message(player_ip, \"position {0} {1}\" \\\r\n\t\t\t\t\t.format(*pos.position))\r\n\t\t\telse:\r\n\t\t\t\tself._comm_server.send_message(player_ip, \"position -1 -1\")","def _get_position_delta(self) -> Tuple2IntType:\n rect = self.get_rect()\n if self._drawing_position == POSITION_NORTHWEST:\n return rect.topleft\n elif self._drawing_position == POSITION_NORTH:\n return rect.midtop\n elif self._drawing_position == POSITION_NORTHEAST:\n return rect.topright\n elif self._drawing_position == POSITION_WEST:\n return rect.midleft\n elif self._drawing_position == POSITION_CENTER:\n return rect.center\n elif self._drawing_position == POSITION_EAST:\n return rect.midright\n elif self._drawing_position == POSITION_SOUTHWEST:\n return rect.bottomleft\n elif self._drawing_position == POSITION_SOUTH:\n return rect.midbottom\n elif self._drawing_position == POSITION_SOUTHEAST:\n return rect.bottomright\n else:\n raise ValueError('unknown drawing position')","def make_move(self, tower):\r\n height, index = self.__find_random_moves(tower)\r\n \r\n if self.stat_brain.all_valid(tower) == 0 or self.stat_brain.is_valid(height, index, tower):\r\n return height, index\r\n else:\r\n while not self.stat_brain.is_valid(height, index, tower):\r\n height, index = self.__find_random_moves(tower)\r\n \r\n return height, index","def get_pos(self) -> tuple:\n return self.rect.center","def get_next_move(self):\n return int(input('Enter your move: '))","def get_center_position( peg, position_on_peg):\n x = Hanoi.FIRST_TOWER_X + peg * Hanoi.DISTANCE_BETWEEN_TOWER\n y = position_on_peg * Hanoi.DISK_HEIGHT + 0.5 * Hanoi.DISK_HEIGHT\n return (x, y)","def locate(x, y):\n position(x * 6, y)","def ChangePlayerPosition(PlayerAbsoluteX, PlayerAbsoluteY, MouseRelativeX, MouseRelativeY, dt) :\r\n MouseAbsoluteX, MouseAbsoluteY = RelativeToAbsolute(MouseRelativeX, MouseRelativeY)\r\n dx, dy = Normalize(PlayerAbsoluteX - MouseAbsoluteX, PlayerAbsoluteY - MouseAbsoluteY)\r\n return PlayerAbsoluteX + dx * dt, PlayerAbsoluteY + dy * dt","def move_origin(self, x, y):\n return RobotPosition(self.x - x, self.y - y, self.theta)","def position(self):\n if self.p:\n if self._finished:\n return None\n return self.p.get_position()*10","def game_move(self):\n\t\t# make a note of the player who isn't playing\n\t\tfor x in self.players.keys():\n\t\t\tif x != self.nextPlayer:\n\t\t\t\totherPlayer = x\n\t\t\t\tbreak\n\t\t\n\t\t\n\t\t# If there are no remaining moves for this player, either the other\n\t\t# player has won or it's a draw\n\t\t# self.expansions = 1\n\t\tself.expansionCounter.count = 1\n\t\tif len(self.state.successors()) == 0:\n\t\t\tif self.state.is_win(otherPlayer):\n\t\t\t\treturn (None, otherPlayer)\n\t\t\telse:\n\t\t\t\t# None, None for a draw\n\t\t\t\treturn (None, None)\n\t\t\t\n\t\t# allow the player max_expansions for this turn\n\t\t# self.expansions = self.max_expansions\n\t\tself.expansionCounter.count = self.max_expansions\n\t\t\n\t\tnextPlayer = self.players[self.nextPlayer]\n\t\tlastPlayer = None\n\t\t\n\t\t# player may throw an exception\n\t\ttry:\n\t\t\t# get player's move, make sure we don't modify the current state\n\t\t\tmove = nextPlayer.move(self.state.get_player_state(self.nextPlayer), \n\t\t\t\t\t self.visitedStates)\n\t\t\t# player may give up\n\t\t\tif move.is_forfeit():\n\t\t\t\tprint \"Player\", self.nextPlayer, \"forfeits.\"\n\t\t\t\treturn (None, otherPlayer)\n\t\t\t# player may return illegal move\n\t\t\tif not self.state.is_valid_move(move):\n\t\t\t\tprint \"Illegal move returned by player\", self.nextPlayer, \\\n\t\t\t\t\t\t\"(\", self.players[self.nextPlayer].get_name(), \")\"\n\t\t\t\treturn (move, otherPlayer)\n\t\t\t# this player is now last player\n\t\t\tlastPlayer = self.nextPlayer\n\t\t\t# get the new next player and make the indicated move\n\t\t\tself.nextPlayer, clear = self.state.move(move, True)\n\t\t\tif clear:\n\t\t\t\tself.clear_repeat()\n\t\texcept:\n\t\t\tprint \"Exception thrown by player\", self.nextPlayer, \\\n\t\t\t\t\t\t\"(\", self.players[self.nextPlayer].get_name(), \")\"\n\t\t\tprint\n\t\t\ttraceback.print_exc()\n\t\t\tprint\n\t\t\treturn (None, otherPlayer)\n\t\t\n\t\tos.chdir(self.wd)\n\t\t\n\t\t# may be a repeated state IF the game cycles\n\t\tif self.is_repeat(self.state):\n\t\t\tself.state.handle_cycle()\n\t\t# otherwise, if the game cycles, note that we've been here\n\t\telif self.state.repeats():\n\t\t\tself.visitedStates.add(self.state.repeated_rep())\n\t\t\t\n\t\t# player may have sacrificed the game\n\t\tif self.state.is_win(otherPlayer):\n\t\t\treturn (move, otherPlayer)\n\t\t\n\t\t# player may have won\n\t\tif self.state.is_win(lastPlayer):\n\t\t\treturn (move, lastPlayer)\n\t\t\n\t\t# nobody's won or lost yet\n\t\treturn (move, None)","def get_position(self, position):","def get_absolute_pos(x, y, base):\n\n # give a small deadzone\n new_x = base[0] + (int(x / 2) if abs(x) > 2 else 0)\n new_y = base[1] - (int(y / 2) if abs(y) > 2 else 0)\n\n return (new_x, new_y)","def move_relative(state, location, towards):\n move_options = util.move_options_to_list(state['move_options'])\n\n move_options = [m for m in move_options if m['type'] == 'move']\n\n if len(move_options) == 0:\n return None\n\n my_location_ = my_location(state)\n move_targets = np.array([m['target'] for m in move_options])\n target_locations = move_targets + my_location_\n\n distances_ = distances(location, target_locations)\n\n if towards:\n target_index = np.argmin(distances_)\n else:\n target_index = np.argmax(distances_)\n\n return move_options[target_index]","def get_penguin_movement(self, state: FishGameState):\n return self.strategy.choose_action_from_state(state=state)","def move(self):\n \n self.position = self.wander()","def position_tile(self, target_row, target_col, current_row, current_col):\r\n moves_str = \"\"\r\n # current target is on the upper of 0\r\n if current_col == target_col and current_row < target_row:\r\n ups = target_row - current_row\r\n for dummy_u in range(ups):\r\n moves_str += \"u\"\r\n for dummy_cycle in range(ups - 1):\r\n moves_str += CIRCLES[\"LEFT_CIRCLE\"]\r\n moves_str += \"ld\"\r\n # current target is on the left of 0\r\n elif current_row == target_row and current_col < target_col:\r\n lefts = target_col - current_col\r\n for dummy_l in range(lefts):\r\n moves_str += \"l\"\r\n for dummy_cycle in range(lefts - 1):\r\n moves_str += CIRCLES[\"UP_CIRCLE\"]\r\n # current target is on the upperleft of 0\r\n elif current_row < target_row and current_col < target_col:\r\n ups = target_row - current_row\r\n for dummy_u in range(ups):\r\n moves_str += \"u\"\r\n lefts = target_col - current_col\r\n for dummy_l in range(lefts):\r\n moves_str += \"l\"\r\n for dummy_cycle in range(lefts - 1):\r\n if current_row <= 0: # can not go up\r\n moves_str += CIRCLES[\"DOWN_CIRCLE\"]\r\n else:\r\n moves_str += CIRCLES[\"UP_CIRCLE\"]\r\n moves_str += \"dru\"\r\n for dummy_cycle in range(ups - 1):\r\n moves_str += CIRCLES[\"LEFT_CIRCLE\"]\r\n moves_str += \"ld\"\r\n # current target is on the upperright of 0\r\n elif current_col > target_col and current_row < target_row:\r\n ups = target_row - current_row\r\n for dummy_u in range(ups):\r\n moves_str += \"u\"\r\n rights = current_col - target_col\r\n for dummy_r in range(rights):\r\n moves_str += \"r\"\r\n for dummy_cycle in range(rights - 1):\r\n if current_row <= 0: # can not go up\r\n moves_str += CIRCLES[\"DOWN_LEFT_CIRCLE\"]\r\n else:\r\n moves_str += CIRCLES[\"UP_LEFT_CIRCLE\"] \r\n moves_str += \"dlu\"\r\n for dummy_cycle in range(ups - 1):\r\n moves_str += CIRCLES[\"LEFT_CIRCLE\"]\r\n moves_str += \"ld\"\r\n # current target is on the right of 0\r\n elif current_col > target_col and current_row == target_row:\r\n rights = current_col - target_col\r\n for dummy_r in range(rights):\r\n moves_str += \"r\"\r\n for dummy_cycle in range(rights - 1):\r\n if current_row <= 0: # can not go up\r\n moves_str += CIRCLES[\"DOWN_LEFT_CIRCLE\"]\r\n else:\r\n moves_str += CIRCLES[\"UP_LEFT_CIRCLE\"] \r\n moves_str += \"ulld\"\r\n return moves_str","def _calculate_move_location(self, direction):\n current_row = self._current_loc.get_row()\n current_column = self._current_loc.get_column()\n\n # Calculate the new location for a left move\n if (direction == \"l\"):\n return Location(current_row, current_column - 1)\n # Calculate the new location for an up move\n elif (direction == \"u\"):\n return Location(current_row - 1, current_column)\n # Calculate the new location for a right move\n elif (direction == \"r\"):\n return Location(current_row, current_column + 1)\n # Calculate the new location for a down move\n elif (direction == \"d\"):\n return Location(current_row + 1, current_column)\n return Location()","def get_position_on_game(self):\n return (self.peg, self.position_on_peg)","def GetSnapPosition(self):\r\n\r\n snap, hAlign, vAlign, monitor = self._is_docked\r\n \r\n display = wx.Display(monitor)\r\n area = display.GetClientArea()\r\n size = self.GetManagedWindow().GetSize()\r\n \r\n pos = wx.Point()\r\n if hAlign == wx.LEFT:\r\n pos.x = area.x\r\n elif hAlign == wx.CENTER:\r\n pos.x = area.x + (area.width - size.x)/2\r\n else:\r\n pos.x = area.x + area.width - size.x\r\n\r\n if vAlign == wx.TOP:\r\n pos.y = area.y\r\n elif vAlign == wx.CENTER:\r\n pos.y = area.y + (area.height - size.y)/2\r\n else:\r\n pos.y = area.y + area.height - size.y\r\n\r\n return pos","def find_closest_move(self, position, valid_moves):\n closest = None\n closest_value = 100\n for move in valid_moves:\n if closest:\n x_dist = abs(position[0] - move[0])\n y_dist = abs(position[1] - move[1])\n if x_dist + y_dist < closest_value:\n closest = move\n closest_value = x_dist + y_dist\n else:\n closest = move\n\n return closest","def get_move_no(self):\r\n return self.command_manager.get_move_no()","def get_pos(self):\n return self.rect.midtop","def getPosition(self):\n\tleft = self.getLeft()\n\ttop = self.getTop()\n\treturn (left,top)","def move(self, x, y, xoffset = 0, yoffset = 0):\n return (x + xoffset) % self.width, (y + yoffset) % self.height","def move(self, board):\n winning_move = self.find_winning_move(board)\n if winning_move != -1:\n return winning_move\n\n blocking_move = self.find_blocking_move(board)\n if blocking_move != -1:\n return blocking_move\n\n if board[4] == \"4\": # center square is open\n return 4\n else:\n return self.prng.choice(board.available())","def get_position():\n\n return character['Position']","def mm_move(board, player):\r\n if board.check_win() == provided.PLAYERX:\r\n return SCORES[provided.PLAYERX],(-1,-1)\r\n elif board.check_win() == provided.PLAYERO:\r\n return SCORES[provided.PLAYERO],(-1,-1)\r\n elif board.check_win() == provided.DRAW:\r\n return SCORES[provided.DRAW],(-1,-1)\r\n else:\r\n empty_tuple_list = board.get_empty_squares()\r\n score_pos_tuple_list = []\r\n best_score = None\r\n best_pos = None\r\n for idx1 in range(len(empty_tuple_list)):\r\n empty_tuple = empty_tuple_list[idx1]\r\n board_clone = board.clone()\r\n board_clone.move(empty_tuple[0],empty_tuple[1],player)\r\n score_pos_tuple = mm_move(board_clone,provided.switch_player(player))\r\n score_pos_tuple_list.append(score_pos_tuple)\r\n\r\n #decide best score and pos fast!!!\r\n if score_pos_tuple[0]*SCORES[player] == 1:\r\n return (score_pos_tuple[0],empty_tuple)\r\n\r\n #decide best score and pos\r\n for idx2 in range(len(score_pos_tuple_list)):\r\n if idx2 == 0:\r\n best_score = score_pos_tuple_list[idx2][0]\r\n best_pos = empty_tuple_list[idx2]\r\n else:\r\n if score_pos_tuple_list[idx2][0]*SCORES[player] > best_score*SCORES[player]:\r\n best_score = score_pos_tuple_list[idx2][0]\r\n best_pos = empty_tuple_list[idx2]\r\n\r\n return (best_score,best_pos)","def move(source, dest, speed=0):\n norm = normalise(source, dest)\n new_pos = (source[0] + norm[0], source[1] + norm[1])\n return new_pos","def get_current_move(self):\n x_count = self.game_board.count('X')\n o_count = self.game_board.count('O')\n if x_count <= o_count:\n return 'X'\n return 'O'","def validate_movement(self, piece, from_col, from_row, to_col, to_row):\n col_diff = abs(ord(from_col) - ord(to_col))\n row_diff = abs(from_row - to_row)\n\n # For any piece, it must actually move...\n if col_diff == 0 and row_diff == 0:\n return False\n # ...and there must be empty spaces in between the from/to squares (when on a column, row, or diagonal)\n if not self.validate_empty_between(from_col, from_row, to_col, to_row):\n return False\n\n # White pawn\n if piece == 'P':\n if col_diff == 1 and (to_row - from_row == 1):\n # Can move diagonally up one square, if taking another piece in that square or by en-passant\n return self.piece_colour(to_col, to_row) == 'B' \\\n or self.is_en_passant(from_col, from_row, to_col, to_row)\n elif col_diff != 0:\n # Otherwise, it can't change columns\n return False\n elif from_row == 2:\n # From initial position, can go up one or two rows (but can't take a piece)\n return (to_row == 3 or to_row == 4) and self.get_square(to_col, to_row) == ' '\n else:\n # Otherwise, can only move up one row (but can't take a piece)\n return to_row - from_row == 1 and self.get_square(to_col, to_row) == ' '\n # Black pawn\n elif piece == 'p':\n if col_diff == 1 and (from_row - to_row == 1):\n # Can move diagonally down one square, if taking another piece in that square or by en-passant\n return self.piece_colour(to_col, to_row) == 'W' \\\n or self.is_en_passant(from_col, from_row, to_col, to_row)\n elif col_diff != 0:\n # Otherwise, it can't change columns\n return False\n elif from_row == 7:\n # From initial position, can go down one or two rows (but can't take a piece)\n return (to_row == 6 or to_row == 5) and self.get_square(to_col, to_row) == ' '\n else:\n # Otherwise, can only move down one row (but can't take a piece)\n return from_row - to_row == 1 and self.get_square(to_col, to_row) == ' '\n # Rook\n elif piece.lower() == 'r':\n # Must remain in same column or same row\n return col_diff == 0 or row_diff == 0\n # Knight\n elif piece.lower() == 'n':\n # Jumps in a 2+1 pattern\n return (col_diff == 2 and row_diff == 1) or (col_diff == 1 and row_diff == 2)\n # Bishop\n elif piece.lower() == 'b':\n # Moves along diagonals\n return col_diff == row_diff\n # Queen\n elif piece.lower() == 'q':\n # Can move along columns, rows, or diagonals\n return col_diff == 0 or row_diff == 0 or col_diff == row_diff\n # King\n elif piece.lower() == 'k':\n # Can move a single square in any direction\n if not(0 <= col_diff <= 1) or not(0 <= row_diff <= 1):\n return False\n\n # But not next to the other king\n other_king = 'k' if piece.isupper() else 'K'\n # Get valid border squares\n border_squares = list(filter(\n lambda b_square: 'a' <= b_square[0] <= 'f' and 1 <= b_square[1] <= 8,\n [\n (chr(ord(to_col) - 1), to_row - 1), (to_col, to_row - 1), (chr(ord(to_col) + 1), to_row - 1),\n (chr(ord(to_col) - 1), to_row), (to_col, to_row), (chr(ord(to_col) + 1), to_row),\n (chr(ord(to_col) - 1), to_row + 1), (to_col, to_row + 1), (chr(ord(to_col) + 1), to_row + 1)\n ]\n ))\n # Check for the other king\n for square in border_squares:\n if self.get_square(square[0], square[1]) == other_king:\n return False\n\n return True","def firstMove(board):\r\n x = board.size / 2\r\n return (x, x)","def get_move(self):\n if self.__root.children is None:\n raise ValueError('Game has ended')\n\n children = [*sorted(self.__root.children, key=\n lambda x: x.win[0 if self.player == Board.PLAYER_0 else 1])]\n\n self.__root = children[-1]\n self.board[self.__root.position] = self.player\n self.change_player()","def to_map_pos(self, screen_pos):\n return screen_pos + self.player_pos - SCREEN.size // 2","def get_move(self, board):\n\n valid_moves = [move for move in board.legal_moves]\n is_valid_move = False\n while not is_valid_move:\n move = input(\"Enter a valid move in uci format: \").lower()\n if len(move) == 4 or len(move) == 5:\n try:\n player_move = chess.Move.from_uci(move)\n\n if board.is_legal(player_move):\n try:\n board.push(player_move)\n return player_move\n except:\n print(\"invalid move...\")\n else:\n print(\"invalid move...\")\n except:\n print(\"invalid move...\")\n else:\n print(\"invalid move...\")"],"string":"[\n \"def move_pawn(pos, game):\\n #Convert coordinates to row and column\\n row = int(pos[1]//(SQUARESIZE+FENCEWIDTH))\\n col = int(pos[0]//(SQUARESIZE+FENCEWIDTH))\\n #Make move\\n game.move_pawn(game.get_player_turn(), (col,row))\",\n \"def get_move(board, player):\\r\\n row, col = 0, 0\\r\\n return row, col\",\n \"def get_move(board, player):\\n row, col = 0, 0\\n return row, col\",\n \"def get_ai_move(board, player):\\r\\n row, col = 0, 0\\r\\n return row, col\",\n \"def get_ai_move(board, player):\\n row, col = 0, 0\\n return row, col\",\n \"def choose_absolute_move(self):\\n move = self.choose_move()\\n if self.player_name == 'A':\\n return move\\n # Player B, revert the IDs\\n return (move + 6) % 12\",\n \"def _get_player_move(self) -> Tile:\\n if not self.game_state:\\n raise RuntimeError(\\\"Cannot call get_player_move when the game has not started!\\\")\\n current_player = next(player for player in self.player_list if player.name == self.current_turn.name)\\n if current_player is None:\\n raise RuntimeError(\\\"Attempted to get player move from a player who does not exist!\\\")\\n return current_player.move()\",\n \"def get_piece_jumping_position(self, captured_piece):\\n row_diff = captured_piece.row - self.row # Compares the row/column numbers of the two pieces\\n col_diff = captured_piece.col - self.col\\n opp_row = row_diff + captured_piece.row\\n opp_col = col_diff + captured_piece.col\\n return {'opp_row': opp_row, 'opp_col': opp_col}\",\n \"def move(self, rel_pos):\\n self.pos = (self.pos[0] + rel_pos[0] * GRID, self.pos[1] + rel_pos[1] * GRID)\",\n \"def relative_position(self) -> Tuple[int, int]:\\n return self.position[0] - self.region.rect.x, self.position[1] - self.region.rect.y\",\n \"def relative_position(self) -> Tuple[int, int]:\\n return self.position[0] - self.region.rect.x, self.position[1] - self.region.rect.y\",\n \"def DoMove(position, move):\\n return position - move\",\n \"def get_move(self):\\n if self._difficulty == 0:\\n return self._get_easy_move()\\n else:\\n # Different stategies/difficulties can be attached here\\n return\",\n \"def get_move(self, game):\\n return\",\n \"def get_move(self, game_state: BotGameState) -> BotMove:\\n return\",\n \"def get_move(moves):\\n pass\",\n \"def player_location(self):\\n x = 0\\n y = 0\\n for line in self.grid:\\n for i in line:\\n if i == \\\"P\\\":\\n return x, y\\n \\n y+=1\\n x += 1\\n y = 0\",\n \"def move_origin(self, x, y):\\n return Position(self.x - x, self.y - y)\",\n \"def makeMove(self, move, player):\",\n \"def is_pawn_move_valid(self, from_row, from_col, to_row, to_col):\\n # Setup variables used\\n piece = self.board.squares[from_row][from_col]\\n piece_color = self.piece_color(piece)\\n to_piece = self.board.squares[to_row][to_col]\\n row_diff = abs(from_row - to_row)\\n col_diff = abs(from_col - to_col)\\n dc = 0\\n\\n # Set flag for first move of pawn\\n first_move = True if from_row == 6 or from_row == 1 else False\\n\\n # If direction is not correct for white, exit\\n if to_row - from_row > 0:\\n dr = 1\\n if self.piece_color(piece) == \\\"white\\\":\\n return False\\n\\n # If direction is not correct for black, exit\\n if to_row - from_row < 0:\\n dr = -1\\n if self.piece_color(piece) == \\\"black\\\":\\n return False\\n\\n # If moving straight\\n if from_col == to_col:\\n # if not legal straight move, exit\\n if not (row_diff == 1 or (first_move and row_diff == 2)):\\n return False\\n\\n # make sure to move has no pieces on straight path\\n dm = row_diff + 1\\n\\n # return value\\n retVal = self._any_piece_in_way(from_row, from_col, dr, dc, dm)\\n\\n# if retVal and not self.testing:\\n# # self.pawn_promotion(to_row, to_col, piece_color)\\n# self.board.overwrite_board_square(to_row, to_col)\\n# if piece_color == \\\"black\\\":\\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\\n# else:\\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\\n\\n return retVal\\n\\n # WHITE en passant\\n # move from moveHistory => (\\\"piece\\\", fromRow, fromCol, toRow, toCol)\\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\\\\n self.moveHistory[-1][0] == \\\"♟\\\" and self.moveHistory[-1][1] == 1 and\\\\\\n self.moveHistory[-1][3] == 3 and piece_color == \\\"white\\\":\\n if col_diff == 1 and row_diff == 1 and to_piece == None:\\n if not self.testing:\\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\\n return True\\n\\n # BLACK en passant\\n if (self.moveHistory[-1][2] == self.moveHistory[-1][4] == (to_col)) and \\\\\\n self.moveHistory[-1][0] == \\\"♙\\\" and self.moveHistory[-1][1] == 6 and\\\\\\n self.moveHistory[-1][3] == 4 and piece_color == \\\"black\\\":\\n if col_diff == 1 and row_diff == 1 and to_piece == None:\\n if not self.testing:\\n self.board.overwrite_board_square(self.moveHistory[-1][3], self.moveHistory[-1][4])\\n self.board.squares[self.moveHistory[-1][3]][self.moveHistory[-1][4]] = None\\n return True\\n\\n # else move must be taking piece directly move\\n # if legal taking piece move and (opponent-already check for own piece) piece at to-square\\n if col_diff == 1 and row_diff == 1 and to_piece != None:\\n\\n# if not self.testing:\\n# # self.pawn_promotion(to_row, to_col, piece_color)\\n# self.board.overwrite_board_square(to_row, to_col)\\n# if piece_color == \\\"black\\\":\\n# self.board.put_piece(self.B_QUEEN, to_row, to_col)\\n# else:\\n# self.board.put_piece(self.W_QUEEN, to_row, to_col)\\n return True\\n\\n return False\",\n \"def getKickingPosition():\\n pass\",\n \"def _acting_player_position(self):\\n return self._env.acting_player_position\",\n \"def _get_move(self) -> Tile:\\n if not self.game_state:\\n raise RuntimeError(\\\"Cannot call get_move when the game has not started!\\\")\\n if isinstance(self.current_turn, Player):\\n return self._get_player_move()\\n elif isinstance(self.current_turn, Enemy):\\n return self._get_enemy_move()\\n else:\\n raise TypeError(\\\"You're trying to move something that isn't a character or an adversary.\\\")\",\n \"def getNextPosition(move, data):\\n\\tnextPos = {\\\"x\\\": data[\\\"you\\\"][\\\"body\\\"][0]['x'],\\n\\t\\t\\t\\t\\\"y\\\": data[\\\"you\\\"][\\\"body\\\"][0]['y']}\\n\\n\\tif move == 'up':\\n\\t\\tnextPos[\\\"y\\\"] = nextPos[\\\"y\\\"] - 1\\n\\telif move == 'down':\\n\\t\\tnextPos[\\\"y\\\"] = nextPos[\\\"y\\\"] + 1\\n\\telif move == 'right':\\n\\t\\tnextPos[\\\"x\\\"] = nextPos[\\\"x\\\"] + 1\\n\\telif move == 'left'\\t:\\n\\t\\tnextPos[\\\"x\\\"] = nextPos[\\\"x\\\"] - 1\\n\\treturn nextPos\",\n \"def modpos(pos,L,move):\\n pos += move\\n if pos == L: #moved off right or bottom\\n return(0)\\n if pos == -1:#moved off top or left\\n return(L-1)\\n return(pos) #in the middle\",\n \"def get_move(board, player):\\n #optimization to always pick the top-left corner on an empty board\\n if set(board) == set([config.NO_PLAYER]):\\n return 0\\n result = minimax(board, player, 2, config.NEG_INF, config.INF)\\n return result.index\",\n \"def get_player_move(self, roundNum, player):\\n return (self.moves[roundNum])[player]\",\n \"def get_player_position(self):\\n raise NotImplementedError\",\n \"def move_wrapper(board, player, trials):\\r\\n move = mm_move(board, player)\\r\\n assert move[1] != (-1, -1), \\\"returned illegal move (-1, -1)\\\"\\r\\n return move[1]\",\n \"def move_wrapper(board, player, trials):\\r\\n move = mm_move(board, player)\\r\\n assert move[1] != (-1, -1), \\\"returned illegal move (-1, -1)\\\"\\r\\n return move[1]\",\n \"def get_move(state, player, max_time, verbose):\\n # We call the player bot in a separate process.This allows us to terminate\\n # if the player takes too long.\\n manager = Manager()\\n result = manager.dict() # result is a variable shared between our process and\\n # the player's. This allows it to pass the move to us\\n\\n # Start a process with the function 'call_player' and the given arguments\\n process = Process(target=call_player, args=(player, state, result))\\n\\n # Start the process\\n process.start()\\n\\n # Rejoin at most max_time miliseconds later\\n process.join(max_time / 1000)\\n\\n # Check if the process terminated in time\\n move = None\\n if process.is_alive():\\n pr('! Player {} took too long, no move made.'.format(state.whose_turn()), verbose)\\n\\n process.terminate()\\n process.join()\\n\\n else:\\n # extract the move\\n move = result['move']\\n\\n return move\",\n \"def getOpponentMove(move, playerBoard, oppBoard, playerSeeds, oppSeeds):\\r\\n pass\",\n \"def update(self, move):\\n\\n if not 0 <= move < 7:\\n raise InvalidMove\\n\\n placed = False\\n x = None\\n y = None\\n\\n for row in reversed(xrange(self._rows)):\\n if not self._board[row][move]:\\n self._board[row][move] = self.current_player\\n placed = True\\n x = move\\n y = row\\n break\\n\\n if not placed:\\n raise InvalidMove\\n\\n return (x, y)\",\n \"def respawn_player(self):\\n self.rect.x = 50\\n self.rect.y = 50\\n \\n # Specifies the Player's spawnpoint as maze_arrangement[1][1], representing\\n # the tile in the top-left corner of the maze\\n self.__user_x = 1\\n self.__user_y = 1\",\n \"def compute_new_position_from_dice(self, player_index, thr):\\r\\n new_position = self.player_positions[player_index] + thr.get_amount()\\r\\n\\r\\n if new_position >= len(self.squares):\\r\\n new_position -= len(self.squares)\\r\\n\\r\\n return new_position\",\n \"def getPawn(self,x,y):\\n if(self.gameState[x,y]==EMPTY):\\n return\\n return Pawn(x,y,self.gameState[x,y])\",\n \"def move_wrapper(board, player, trials):\\n move = mm_move(board, player)\\n assert move[1] != (-1, -1), \\\"returned illegal move (-1, -1)\\\"\\n return move[1]\",\n \"def move_wrapper(board, player, trials):\\n move = mm_move(board, player)\\n assert move[1] != (-1, -1), \\\"returned illegal move (-1, -1)\\\"\\n return move[1]\",\n \"def move_relative(self, delta):\\n return self.move(delta, relative=True)\",\n \"def getManipulatorPosition(transform):\\n pm.select(transform)\\n pm.setToolTo('Move')\\n position = pm.manipMoveContext('Move', q=1, p=1)\\n pm.select(clear=True)\\n return position\",\n \"def get_ai_move(board):\\n return Connect4MiniMax.get_move(board)\",\n \"def _AN_to_coords(self, move: str):\\n\\n orig_move = move\\n\\n extra_info = \\\"\\\"\\n\\n # remove all characters that don't matter when parsing\\n for pointless_char in \\\"x+#\\\":\\n move = move.replace(pointless_char, \\\"\\\")\\n\\n # Handle castling\\n if CASTLE_QUEENSIDE in move:\\n row = self._get_castling_row()\\n return (row, 4), (row, 2), CASTLE_QUEENSIDE\\n elif CASTLE_KINGSIDE in move:\\n row = self._get_castling_row()\\n return (row, 4), (row, 6), CASTLE_KINGSIDE\\n\\n # Pawn promotion\\n if move[-2] == \\\"=\\\":\\n extra_info = move[-1] if self.white_to_move else move[-1].lower()\\n move = move[:-2]\\n\\n # Destination of move, this is the only guaranteed substring in the move\\n dest_str = move[-2:]\\n dest = State._EAN_coords_to_board_coords(dest_str)\\n move = move[:-2]\\n\\n # Deduce what piece actually made the move, if there is no shown there is no pawn\\n # Note in AN pieces are always uppercase and location is lowercase,\\n # so this makes it simple to check if we have a piece or a location\\n piece = \\\"P\\\"\\n if move and move[0].isupper():\\n piece = move[0]\\n move = move[1:]\\n if not self.white_to_move:\\n piece = piece.lower()\\n\\n # At this point the only info the move should contain is a hint on where the piece is coming from\\n loc_hint = move\\n\\n possible_moves = self.get_all_moves()\\n possible_moves = filter(lambda x: dest_str in x, possible_moves) # Filter to only moves that land on the right destination\\n possible_moves = list(filter(lambda x: loc_hint in x[0:2], possible_moves)) # Filter to only moves that match the hint in the algebraic notation\\n for possible_move in possible_moves:\\n row, col = State._EAN_coords_to_board_coords(possible_move[0:2])\\n if self.board[row][col] == piece:\\n return (row, col), dest, extra_info\\n\\n raise ValueError(\\\"Algebraic notation parsing failed, no valid move found matching the given move \\\" + orig_move\\n + \\\" with board state\\\\n\\\" + str(self))\",\n \"def move_me(self):\\r\\n\\t\\t#self.start_pos = self.rect.center\\t\\t\\t\\r\\n\\t\\tif self.goal_pos is not None:\\r\\n\\t\\t\\tprint(f'goal_pos: {self.goal_pos}, start_pos: {self.start_pos}')\\r\\n\\t\\t\\tdx = self.goal_pos[0] - self.start_pos[0]\\r\\n\\t\\t\\tdy = self.goal_pos[1] - self.start_pos[1]\\r\\n\\r\\n\\t\\t\\tdistance = math.sqrt(dx*dx + dy*dy)\\r\\n\\t\\t\\tself.shift += self.speed\\r\\n\\r\\n\\t\\ttry:\\r\\n\\t\\t\\tif self.shift/distance < 0.99:\\r\\n\\t\\t\\t\\tself.rect.center = (self.start_pos[0] + self.shift/distance * dx,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t self.start_pos[1] + self.shift/distance * dy)\\r\\n\\t\\t\\t\\tprint(f'going to: {self.goal_pos}')\\r\\n\\t\\texcept ZeroDivisionError:\\r\\n\\t\\t\\t\\tpass\\t\\r\\n\\t\\treturn True\",\n \"def get_move(self, board):\\n # First, check if we can win in the next move\\n winning_move = self.get_winning_move(board, self.letter)\\n if winning_move is not None:\\n return winning_move\\n # Check if the player could win on their next move, and block them.\\n blocking_move = self.get_winning_move(board, self.opponent_letter)\\n if blocking_move is not None:\\n return blocking_move\\n # Try to take one of the corners, if they are free.\\n corner_move = self.move_in_a_corner(board)\\n if corner_move is not None:\\n return corner_move\\n # Try to take the center, if it is free.\\n if board.size % 2 == 1:\\n if board.is_position_availible(board.letters[board.size // 2]\\n + board.numbers[board.size // 2]):\\n return board.letters[board.size // 2] + board.numbers[board.size // 2]\\n # Move on one of the sides.\\n return self.choose_random_move_from_list(board, list(board.positions.keys()))\",\n \"def move(self, row, col, player):\",\n \"def player_pos(self) -> Pt:\\n return self._player\",\n \"def move(self,p,intMove):\\n gs = self.gameState.copy() #copy Board\\n gs[p.pos.get()] = EMPTY #put position it was at as empty\\n gs[self.movePos(p,intMove).get()] = p.color #set new position as filled\\n return ((p,intMove),Board(gs,self.togglePlayer(self.whoseTurn)))\",\n \"def _player_loc():\\n return _to_my_vec3(_get_mc().player.getTilePos())\",\n \"def my_location(state):\\n return state['gladiators'][state['current_player']]['pos']\",\n \"def determine_move_position(self):\\n green_probs = []\\n net_size = len(self.net)\\n adjacents = self.net[self.current_pos].adjacents\\n #Belief propagation:\\n #Analyzes each position's probability of obtaining\\n #green when measuring at a time t+1.\\n for i in adjacents:\\n accum = 0\\n for j in range(0, net_size):\\n distance = self.__get_distance(i-1, j)\\n if distance == 0: #Probability of measure green at distance 0 from 'i'.\\n accum += self.enemy_net[i-1].value * self.ct[0][0]\\n elif distance == 1: #Probability of measure green at distance 1 from 'i'.\\n accum += self.enemy_net[i-1].value * self.ct[1][0]\\n elif distance == 2: #Probability of measure green at distance 2 from 'i'.\\n accum += self.enemy_net[i-1].value * self.ct[2][0]\\n elif distance == 3: #Probability of measure green at distance 3 from 'i'.\\n accum += self.enemy_net[i-1].value * self.ct[3][0]\\n else: #Probability of measure green at a distance >= 4 from 'i'.\\n accum += self.enemy_net[i-1].value * self.ct[4][0]\\n green_probs.append((i, accum))\\n #Returns the position in which the probability of\\n #obtaining green when measuring is the lowest.\\n return min(green_probs, key=itemgetter(1))[0]\",\n \"def getTilePos(self, pos = None):\\n\\n if not pos:\\n pos = self.actor.getPos()\\n \\n for i in range(len(pos)):\\n pos[i] = int(math.floor( (pos[i] + self.dimensions[i]) / 2.0))\\n #pos[i] = int(math.floor( pos[i] / 2.0))\\n\\n return pos\",\n \"def player_movement(self):\",\n \"def firstMove(self):\\n return (10, 10)\",\n \"def tile_to_world_loc(tile, player_tile):\\n relxyz = tile_to_rel_loc(tile, player_tile)\\n\\n return (player.X + relxyz[0], player.Y + relxyz[1], player.Z + relxyz[2])\",\n \"def move(self):\\r\\n move = None\\r\\n if self.last_move is None:\\r\\n move = rockyman.move(self)\\r\\n else:\\r\\n index = the_moves.index(self.last_move) + 1\\r\\n if index >= len(the_moves):\\r\\n index = 0\\r\\n move = the_moves[index]\\r\\n self.last_move = move\\r\\n return move\",\n \"def getMove(self, board):\\n pass\",\n \"def get_position(self):\\n position = (self.position_x * SPRITE_SIZE, self.position_y * SPRITE_SIZE)\\n return position\",\n \"def move(self):\\r\\n his_move = random.randint(0, 2)\\r\\n return the_moves[his_move]\",\n \"def move(self, row: int, col: int, player: int):\\n def addup(dict_name, invalid_set, another_invalid, locx, locy):\\n if locx == locy:\\n diag_name = (1,1)\\n if diag_name not in invalid_set:\\n dict_name[diag_name] += 1\\n if dict_name[diag_name] == self.tar:\\n return player\\n another_invalid.add(diag_name)\\n if locx == self.tar-1-locy:\\n diag_name = (-1, -1)\\n if diag_name not in invalid_set:\\n dict_name[diag_name] += 1\\n if dict_name[diag_name] == self.tar:\\n return player\\n another_invalid.add(diag_name)\\n curcol = (locy, None)\\n currow = (None, locx)\\n if curcol not in invalid_set:\\n dict_name[curcol] += 1\\n if dict_name[curcol] == self.tar:\\n return player\\n another_invalid.add(curcol)\\n if currow not in invalid_set:\\n dict_name[currow] += 1\\n if dict_name[currow] == self.tar:\\n return player\\n another_invalid.add(currow)\\n return 0\\n res = 0\\n if (row, col) not in self.walked:\\n if player == 1:\\n res = addup(self.p1, self.invalid_1, self.invalid_2, row, col)\\n if player == 2:\\n res = addup(self.p2, self.invalid_2, self.invalid_1, row, col)\\n self.walked.add((row, col))\\n return res\",\n \"def position(self):\\n return self.source.position + self.position_relative\",\n \"def make_move(self, board: Board) -> int:\\n move, evalutation = self.minimax(board, -math.inf, math.inf, self._depth, 1)\\n return move\",\n \"def follow(self):\\n \\n # create list to add with moves\\n pos_list = [self.position, self.position, self.position, self.position]\\n # list of surrounding indices\\n moveset = add_lists(self.moves, pos_list)\\n \\n # checks if there is bot nearby\\n for item in moveset:\\n if type(item) is Bot:\\n return item\\n \\n # if no bot found, returns original position\\n return self.position\",\n \"def apply_move(cell, x, y):\\r\\n x2 = (co_ords[cell])[0] + x\\r\\n y2 = (co_ords[cell])[1] + y\\r\\n return (x2, y2)\",\n \"def relative_board(self):\\n board = self.game.board\\n if self.player_name == 'A':\\n return board\\n # Revert the board\\n return board[6:] + board[:6]\",\n \"def best_move(self):\\n if self._move is not None:\\n return self._move\\n else:\\n return self.pass_move\",\n \"def player_position(self, player_ip, *args):\\r\\n\\t\\ttry:\\r\\n\\t\\t\\tteam_type = self._teammates[player_ip]\\r\\n\\t\\texcept KeyError:\\r\\n\\t\\t\\tself._comm_server.send_message(player_ip, \\\"position -1 -1\\\")\\r\\n\\t\\t\\treturn\\r\\n\\t\\telse:\\r\\n\\t\\t\\tmaze_pos_finder = self._teams[team_type].maze_pos_finder\\r\\n\\t\\t\\tplayer_info = self._teams[team_type].get_player_info_by_IP(player_ip)\\r\\n\\r\\n\\t\\t\\tpos = maze_pos_finder.get_maze_pos(player_info.color_bgr)\\r\\n\\r\\n\\t\\t\\tif pos is not None:\\r\\n\\t\\t\\t\\tself._comm_server.send_message(player_ip, \\\"position {0} {1}\\\" \\\\\\r\\n\\t\\t\\t\\t\\t.format(*pos.position))\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tself._comm_server.send_message(player_ip, \\\"position -1 -1\\\")\",\n \"def _get_position_delta(self) -> Tuple2IntType:\\n rect = self.get_rect()\\n if self._drawing_position == POSITION_NORTHWEST:\\n return rect.topleft\\n elif self._drawing_position == POSITION_NORTH:\\n return rect.midtop\\n elif self._drawing_position == POSITION_NORTHEAST:\\n return rect.topright\\n elif self._drawing_position == POSITION_WEST:\\n return rect.midleft\\n elif self._drawing_position == POSITION_CENTER:\\n return rect.center\\n elif self._drawing_position == POSITION_EAST:\\n return rect.midright\\n elif self._drawing_position == POSITION_SOUTHWEST:\\n return rect.bottomleft\\n elif self._drawing_position == POSITION_SOUTH:\\n return rect.midbottom\\n elif self._drawing_position == POSITION_SOUTHEAST:\\n return rect.bottomright\\n else:\\n raise ValueError('unknown drawing position')\",\n \"def make_move(self, tower):\\r\\n height, index = self.__find_random_moves(tower)\\r\\n \\r\\n if self.stat_brain.all_valid(tower) == 0 or self.stat_brain.is_valid(height, index, tower):\\r\\n return height, index\\r\\n else:\\r\\n while not self.stat_brain.is_valid(height, index, tower):\\r\\n height, index = self.__find_random_moves(tower)\\r\\n \\r\\n return height, index\",\n \"def get_pos(self) -> tuple:\\n return self.rect.center\",\n \"def get_next_move(self):\\n return int(input('Enter your move: '))\",\n \"def get_center_position( peg, position_on_peg):\\n x = Hanoi.FIRST_TOWER_X + peg * Hanoi.DISTANCE_BETWEEN_TOWER\\n y = position_on_peg * Hanoi.DISK_HEIGHT + 0.5 * Hanoi.DISK_HEIGHT\\n return (x, y)\",\n \"def locate(x, y):\\n position(x * 6, y)\",\n \"def ChangePlayerPosition(PlayerAbsoluteX, PlayerAbsoluteY, MouseRelativeX, MouseRelativeY, dt) :\\r\\n MouseAbsoluteX, MouseAbsoluteY = RelativeToAbsolute(MouseRelativeX, MouseRelativeY)\\r\\n dx, dy = Normalize(PlayerAbsoluteX - MouseAbsoluteX, PlayerAbsoluteY - MouseAbsoluteY)\\r\\n return PlayerAbsoluteX + dx * dt, PlayerAbsoluteY + dy * dt\",\n \"def move_origin(self, x, y):\\n return RobotPosition(self.x - x, self.y - y, self.theta)\",\n \"def position(self):\\n if self.p:\\n if self._finished:\\n return None\\n return self.p.get_position()*10\",\n \"def game_move(self):\\n\\t\\t# make a note of the player who isn't playing\\n\\t\\tfor x in self.players.keys():\\n\\t\\t\\tif x != self.nextPlayer:\\n\\t\\t\\t\\totherPlayer = x\\n\\t\\t\\t\\tbreak\\n\\t\\t\\n\\t\\t\\n\\t\\t# If there are no remaining moves for this player, either the other\\n\\t\\t# player has won or it's a draw\\n\\t\\t# self.expansions = 1\\n\\t\\tself.expansionCounter.count = 1\\n\\t\\tif len(self.state.successors()) == 0:\\n\\t\\t\\tif self.state.is_win(otherPlayer):\\n\\t\\t\\t\\treturn (None, otherPlayer)\\n\\t\\t\\telse:\\n\\t\\t\\t\\t# None, None for a draw\\n\\t\\t\\t\\treturn (None, None)\\n\\t\\t\\t\\n\\t\\t# allow the player max_expansions for this turn\\n\\t\\t# self.expansions = self.max_expansions\\n\\t\\tself.expansionCounter.count = self.max_expansions\\n\\t\\t\\n\\t\\tnextPlayer = self.players[self.nextPlayer]\\n\\t\\tlastPlayer = None\\n\\t\\t\\n\\t\\t# player may throw an exception\\n\\t\\ttry:\\n\\t\\t\\t# get player's move, make sure we don't modify the current state\\n\\t\\t\\tmove = nextPlayer.move(self.state.get_player_state(self.nextPlayer), \\n\\t\\t\\t\\t\\t self.visitedStates)\\n\\t\\t\\t# player may give up\\n\\t\\t\\tif move.is_forfeit():\\n\\t\\t\\t\\tprint \\\"Player\\\", self.nextPlayer, \\\"forfeits.\\\"\\n\\t\\t\\t\\treturn (None, otherPlayer)\\n\\t\\t\\t# player may return illegal move\\n\\t\\t\\tif not self.state.is_valid_move(move):\\n\\t\\t\\t\\tprint \\\"Illegal move returned by player\\\", self.nextPlayer, \\\\\\n\\t\\t\\t\\t\\t\\t\\\"(\\\", self.players[self.nextPlayer].get_name(), \\\")\\\"\\n\\t\\t\\t\\treturn (move, otherPlayer)\\n\\t\\t\\t# this player is now last player\\n\\t\\t\\tlastPlayer = self.nextPlayer\\n\\t\\t\\t# get the new next player and make the indicated move\\n\\t\\t\\tself.nextPlayer, clear = self.state.move(move, True)\\n\\t\\t\\tif clear:\\n\\t\\t\\t\\tself.clear_repeat()\\n\\t\\texcept:\\n\\t\\t\\tprint \\\"Exception thrown by player\\\", self.nextPlayer, \\\\\\n\\t\\t\\t\\t\\t\\t\\\"(\\\", self.players[self.nextPlayer].get_name(), \\\")\\\"\\n\\t\\t\\tprint\\n\\t\\t\\ttraceback.print_exc()\\n\\t\\t\\tprint\\n\\t\\t\\treturn (None, otherPlayer)\\n\\t\\t\\n\\t\\tos.chdir(self.wd)\\n\\t\\t\\n\\t\\t# may be a repeated state IF the game cycles\\n\\t\\tif self.is_repeat(self.state):\\n\\t\\t\\tself.state.handle_cycle()\\n\\t\\t# otherwise, if the game cycles, note that we've been here\\n\\t\\telif self.state.repeats():\\n\\t\\t\\tself.visitedStates.add(self.state.repeated_rep())\\n\\t\\t\\t\\n\\t\\t# player may have sacrificed the game\\n\\t\\tif self.state.is_win(otherPlayer):\\n\\t\\t\\treturn (move, otherPlayer)\\n\\t\\t\\n\\t\\t# player may have won\\n\\t\\tif self.state.is_win(lastPlayer):\\n\\t\\t\\treturn (move, lastPlayer)\\n\\t\\t\\n\\t\\t# nobody's won or lost yet\\n\\t\\treturn (move, None)\",\n \"def get_position(self, position):\",\n \"def get_absolute_pos(x, y, base):\\n\\n # give a small deadzone\\n new_x = base[0] + (int(x / 2) if abs(x) > 2 else 0)\\n new_y = base[1] - (int(y / 2) if abs(y) > 2 else 0)\\n\\n return (new_x, new_y)\",\n \"def move_relative(state, location, towards):\\n move_options = util.move_options_to_list(state['move_options'])\\n\\n move_options = [m for m in move_options if m['type'] == 'move']\\n\\n if len(move_options) == 0:\\n return None\\n\\n my_location_ = my_location(state)\\n move_targets = np.array([m['target'] for m in move_options])\\n target_locations = move_targets + my_location_\\n\\n distances_ = distances(location, target_locations)\\n\\n if towards:\\n target_index = np.argmin(distances_)\\n else:\\n target_index = np.argmax(distances_)\\n\\n return move_options[target_index]\",\n \"def get_penguin_movement(self, state: FishGameState):\\n return self.strategy.choose_action_from_state(state=state)\",\n \"def move(self):\\n \\n self.position = self.wander()\",\n \"def position_tile(self, target_row, target_col, current_row, current_col):\\r\\n moves_str = \\\"\\\"\\r\\n # current target is on the upper of 0\\r\\n if current_col == target_col and current_row < target_row:\\r\\n ups = target_row - current_row\\r\\n for dummy_u in range(ups):\\r\\n moves_str += \\\"u\\\"\\r\\n for dummy_cycle in range(ups - 1):\\r\\n moves_str += CIRCLES[\\\"LEFT_CIRCLE\\\"]\\r\\n moves_str += \\\"ld\\\"\\r\\n # current target is on the left of 0\\r\\n elif current_row == target_row and current_col < target_col:\\r\\n lefts = target_col - current_col\\r\\n for dummy_l in range(lefts):\\r\\n moves_str += \\\"l\\\"\\r\\n for dummy_cycle in range(lefts - 1):\\r\\n moves_str += CIRCLES[\\\"UP_CIRCLE\\\"]\\r\\n # current target is on the upperleft of 0\\r\\n elif current_row < target_row and current_col < target_col:\\r\\n ups = target_row - current_row\\r\\n for dummy_u in range(ups):\\r\\n moves_str += \\\"u\\\"\\r\\n lefts = target_col - current_col\\r\\n for dummy_l in range(lefts):\\r\\n moves_str += \\\"l\\\"\\r\\n for dummy_cycle in range(lefts - 1):\\r\\n if current_row <= 0: # can not go up\\r\\n moves_str += CIRCLES[\\\"DOWN_CIRCLE\\\"]\\r\\n else:\\r\\n moves_str += CIRCLES[\\\"UP_CIRCLE\\\"]\\r\\n moves_str += \\\"dru\\\"\\r\\n for dummy_cycle in range(ups - 1):\\r\\n moves_str += CIRCLES[\\\"LEFT_CIRCLE\\\"]\\r\\n moves_str += \\\"ld\\\"\\r\\n # current target is on the upperright of 0\\r\\n elif current_col > target_col and current_row < target_row:\\r\\n ups = target_row - current_row\\r\\n for dummy_u in range(ups):\\r\\n moves_str += \\\"u\\\"\\r\\n rights = current_col - target_col\\r\\n for dummy_r in range(rights):\\r\\n moves_str += \\\"r\\\"\\r\\n for dummy_cycle in range(rights - 1):\\r\\n if current_row <= 0: # can not go up\\r\\n moves_str += CIRCLES[\\\"DOWN_LEFT_CIRCLE\\\"]\\r\\n else:\\r\\n moves_str += CIRCLES[\\\"UP_LEFT_CIRCLE\\\"] \\r\\n moves_str += \\\"dlu\\\"\\r\\n for dummy_cycle in range(ups - 1):\\r\\n moves_str += CIRCLES[\\\"LEFT_CIRCLE\\\"]\\r\\n moves_str += \\\"ld\\\"\\r\\n # current target is on the right of 0\\r\\n elif current_col > target_col and current_row == target_row:\\r\\n rights = current_col - target_col\\r\\n for dummy_r in range(rights):\\r\\n moves_str += \\\"r\\\"\\r\\n for dummy_cycle in range(rights - 1):\\r\\n if current_row <= 0: # can not go up\\r\\n moves_str += CIRCLES[\\\"DOWN_LEFT_CIRCLE\\\"]\\r\\n else:\\r\\n moves_str += CIRCLES[\\\"UP_LEFT_CIRCLE\\\"] \\r\\n moves_str += \\\"ulld\\\"\\r\\n return moves_str\",\n \"def _calculate_move_location(self, direction):\\n current_row = self._current_loc.get_row()\\n current_column = self._current_loc.get_column()\\n\\n # Calculate the new location for a left move\\n if (direction == \\\"l\\\"):\\n return Location(current_row, current_column - 1)\\n # Calculate the new location for an up move\\n elif (direction == \\\"u\\\"):\\n return Location(current_row - 1, current_column)\\n # Calculate the new location for a right move\\n elif (direction == \\\"r\\\"):\\n return Location(current_row, current_column + 1)\\n # Calculate the new location for a down move\\n elif (direction == \\\"d\\\"):\\n return Location(current_row + 1, current_column)\\n return Location()\",\n \"def get_position_on_game(self):\\n return (self.peg, self.position_on_peg)\",\n \"def GetSnapPosition(self):\\r\\n\\r\\n snap, hAlign, vAlign, monitor = self._is_docked\\r\\n \\r\\n display = wx.Display(monitor)\\r\\n area = display.GetClientArea()\\r\\n size = self.GetManagedWindow().GetSize()\\r\\n \\r\\n pos = wx.Point()\\r\\n if hAlign == wx.LEFT:\\r\\n pos.x = area.x\\r\\n elif hAlign == wx.CENTER:\\r\\n pos.x = area.x + (area.width - size.x)/2\\r\\n else:\\r\\n pos.x = area.x + area.width - size.x\\r\\n\\r\\n if vAlign == wx.TOP:\\r\\n pos.y = area.y\\r\\n elif vAlign == wx.CENTER:\\r\\n pos.y = area.y + (area.height - size.y)/2\\r\\n else:\\r\\n pos.y = area.y + area.height - size.y\\r\\n\\r\\n return pos\",\n \"def find_closest_move(self, position, valid_moves):\\n closest = None\\n closest_value = 100\\n for move in valid_moves:\\n if closest:\\n x_dist = abs(position[0] - move[0])\\n y_dist = abs(position[1] - move[1])\\n if x_dist + y_dist < closest_value:\\n closest = move\\n closest_value = x_dist + y_dist\\n else:\\n closest = move\\n\\n return closest\",\n \"def get_move_no(self):\\r\\n return self.command_manager.get_move_no()\",\n \"def get_pos(self):\\n return self.rect.midtop\",\n \"def getPosition(self):\\n\\tleft = self.getLeft()\\n\\ttop = self.getTop()\\n\\treturn (left,top)\",\n \"def move(self, x, y, xoffset = 0, yoffset = 0):\\n return (x + xoffset) % self.width, (y + yoffset) % self.height\",\n \"def move(self, board):\\n winning_move = self.find_winning_move(board)\\n if winning_move != -1:\\n return winning_move\\n\\n blocking_move = self.find_blocking_move(board)\\n if blocking_move != -1:\\n return blocking_move\\n\\n if board[4] == \\\"4\\\": # center square is open\\n return 4\\n else:\\n return self.prng.choice(board.available())\",\n \"def get_position():\\n\\n return character['Position']\",\n \"def mm_move(board, player):\\r\\n if board.check_win() == provided.PLAYERX:\\r\\n return SCORES[provided.PLAYERX],(-1,-1)\\r\\n elif board.check_win() == provided.PLAYERO:\\r\\n return SCORES[provided.PLAYERO],(-1,-1)\\r\\n elif board.check_win() == provided.DRAW:\\r\\n return SCORES[provided.DRAW],(-1,-1)\\r\\n else:\\r\\n empty_tuple_list = board.get_empty_squares()\\r\\n score_pos_tuple_list = []\\r\\n best_score = None\\r\\n best_pos = None\\r\\n for idx1 in range(len(empty_tuple_list)):\\r\\n empty_tuple = empty_tuple_list[idx1]\\r\\n board_clone = board.clone()\\r\\n board_clone.move(empty_tuple[0],empty_tuple[1],player)\\r\\n score_pos_tuple = mm_move(board_clone,provided.switch_player(player))\\r\\n score_pos_tuple_list.append(score_pos_tuple)\\r\\n\\r\\n #decide best score and pos fast!!!\\r\\n if score_pos_tuple[0]*SCORES[player] == 1:\\r\\n return (score_pos_tuple[0],empty_tuple)\\r\\n\\r\\n #decide best score and pos\\r\\n for idx2 in range(len(score_pos_tuple_list)):\\r\\n if idx2 == 0:\\r\\n best_score = score_pos_tuple_list[idx2][0]\\r\\n best_pos = empty_tuple_list[idx2]\\r\\n else:\\r\\n if score_pos_tuple_list[idx2][0]*SCORES[player] > best_score*SCORES[player]:\\r\\n best_score = score_pos_tuple_list[idx2][0]\\r\\n best_pos = empty_tuple_list[idx2]\\r\\n\\r\\n return (best_score,best_pos)\",\n \"def move(source, dest, speed=0):\\n norm = normalise(source, dest)\\n new_pos = (source[0] + norm[0], source[1] + norm[1])\\n return new_pos\",\n \"def get_current_move(self):\\n x_count = self.game_board.count('X')\\n o_count = self.game_board.count('O')\\n if x_count <= o_count:\\n return 'X'\\n return 'O'\",\n \"def validate_movement(self, piece, from_col, from_row, to_col, to_row):\\n col_diff = abs(ord(from_col) - ord(to_col))\\n row_diff = abs(from_row - to_row)\\n\\n # For any piece, it must actually move...\\n if col_diff == 0 and row_diff == 0:\\n return False\\n # ...and there must be empty spaces in between the from/to squares (when on a column, row, or diagonal)\\n if not self.validate_empty_between(from_col, from_row, to_col, to_row):\\n return False\\n\\n # White pawn\\n if piece == 'P':\\n if col_diff == 1 and (to_row - from_row == 1):\\n # Can move diagonally up one square, if taking another piece in that square or by en-passant\\n return self.piece_colour(to_col, to_row) == 'B' \\\\\\n or self.is_en_passant(from_col, from_row, to_col, to_row)\\n elif col_diff != 0:\\n # Otherwise, it can't change columns\\n return False\\n elif from_row == 2:\\n # From initial position, can go up one or two rows (but can't take a piece)\\n return (to_row == 3 or to_row == 4) and self.get_square(to_col, to_row) == ' '\\n else:\\n # Otherwise, can only move up one row (but can't take a piece)\\n return to_row - from_row == 1 and self.get_square(to_col, to_row) == ' '\\n # Black pawn\\n elif piece == 'p':\\n if col_diff == 1 and (from_row - to_row == 1):\\n # Can move diagonally down one square, if taking another piece in that square or by en-passant\\n return self.piece_colour(to_col, to_row) == 'W' \\\\\\n or self.is_en_passant(from_col, from_row, to_col, to_row)\\n elif col_diff != 0:\\n # Otherwise, it can't change columns\\n return False\\n elif from_row == 7:\\n # From initial position, can go down one or two rows (but can't take a piece)\\n return (to_row == 6 or to_row == 5) and self.get_square(to_col, to_row) == ' '\\n else:\\n # Otherwise, can only move down one row (but can't take a piece)\\n return from_row - to_row == 1 and self.get_square(to_col, to_row) == ' '\\n # Rook\\n elif piece.lower() == 'r':\\n # Must remain in same column or same row\\n return col_diff == 0 or row_diff == 0\\n # Knight\\n elif piece.lower() == 'n':\\n # Jumps in a 2+1 pattern\\n return (col_diff == 2 and row_diff == 1) or (col_diff == 1 and row_diff == 2)\\n # Bishop\\n elif piece.lower() == 'b':\\n # Moves along diagonals\\n return col_diff == row_diff\\n # Queen\\n elif piece.lower() == 'q':\\n # Can move along columns, rows, or diagonals\\n return col_diff == 0 or row_diff == 0 or col_diff == row_diff\\n # King\\n elif piece.lower() == 'k':\\n # Can move a single square in any direction\\n if not(0 <= col_diff <= 1) or not(0 <= row_diff <= 1):\\n return False\\n\\n # But not next to the other king\\n other_king = 'k' if piece.isupper() else 'K'\\n # Get valid border squares\\n border_squares = list(filter(\\n lambda b_square: 'a' <= b_square[0] <= 'f' and 1 <= b_square[1] <= 8,\\n [\\n (chr(ord(to_col) - 1), to_row - 1), (to_col, to_row - 1), (chr(ord(to_col) + 1), to_row - 1),\\n (chr(ord(to_col) - 1), to_row), (to_col, to_row), (chr(ord(to_col) + 1), to_row),\\n (chr(ord(to_col) - 1), to_row + 1), (to_col, to_row + 1), (chr(ord(to_col) + 1), to_row + 1)\\n ]\\n ))\\n # Check for the other king\\n for square in border_squares:\\n if self.get_square(square[0], square[1]) == other_king:\\n return False\\n\\n return True\",\n \"def firstMove(board):\\r\\n x = board.size / 2\\r\\n return (x, x)\",\n \"def get_move(self):\\n if self.__root.children is None:\\n raise ValueError('Game has ended')\\n\\n children = [*sorted(self.__root.children, key=\\n lambda x: x.win[0 if self.player == Board.PLAYER_0 else 1])]\\n\\n self.__root = children[-1]\\n self.board[self.__root.position] = self.player\\n self.change_player()\",\n \"def to_map_pos(self, screen_pos):\\n return screen_pos + self.player_pos - SCREEN.size // 2\",\n \"def get_move(self, board):\\n\\n valid_moves = [move for move in board.legal_moves]\\n is_valid_move = False\\n while not is_valid_move:\\n move = input(\\\"Enter a valid move in uci format: \\\").lower()\\n if len(move) == 4 or len(move) == 5:\\n try:\\n player_move = chess.Move.from_uci(move)\\n\\n if board.is_legal(player_move):\\n try:\\n board.push(player_move)\\n return player_move\\n except:\\n print(\\\"invalid move...\\\")\\n else:\\n print(\\\"invalid move...\\\")\\n except:\\n print(\\\"invalid move...\\\")\\n else:\\n print(\\\"invalid move...\\\")\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.70455617","0.68026656","0.6782019","0.6533234","0.6489556","0.64045006","0.63270336","0.6322109","0.6290889","0.6268482","0.6268482","0.62472296","0.6150574","0.6125518","0.61029345","0.60926723","0.6087858","0.60839784","0.60775626","0.6045745","0.60347223","0.602867","0.59942394","0.5988664","0.59633857","0.59496516","0.5937773","0.5934936","0.590294","0.590294","0.5891601","0.5888488","0.58811665","0.58809173","0.5879727","0.5863888","0.5861964","0.5861964","0.5835463","0.5827348","0.5824273","0.58055484","0.5802537","0.57986087","0.57974946","0.5792622","0.5780573","0.5772553","0.57569313","0.57501006","0.5746508","0.5737757","0.57338977","0.57299703","0.57215184","0.570349","0.5698776","0.5692156","0.5689439","0.56857604","0.56791186","0.56765133","0.56758523","0.5666474","0.56637067","0.56594497","0.56588143","0.5656915","0.5656684","0.5655458","0.56471556","0.56471497","0.56469166","0.5638722","0.56352425","0.5630575","0.56256837","0.56254435","0.561551","0.56131566","0.5613041","0.56048006","0.55967534","0.5594468","0.5592453","0.5589267","0.55882066","0.5584677","0.5583816","0.558376","0.55799466","0.55717605","0.5571696","0.5570361","0.5554319","0.55522734","0.55458087","0.553823","0.5538073","0.553166"],"string":"[\n \"0.70455617\",\n \"0.68026656\",\n \"0.6782019\",\n \"0.6533234\",\n \"0.6489556\",\n \"0.64045006\",\n \"0.63270336\",\n \"0.6322109\",\n \"0.6290889\",\n \"0.6268482\",\n \"0.6268482\",\n \"0.62472296\",\n \"0.6150574\",\n \"0.6125518\",\n \"0.61029345\",\n \"0.60926723\",\n \"0.6087858\",\n \"0.60839784\",\n \"0.60775626\",\n \"0.6045745\",\n \"0.60347223\",\n \"0.602867\",\n \"0.59942394\",\n \"0.5988664\",\n \"0.59633857\",\n \"0.59496516\",\n \"0.5937773\",\n \"0.5934936\",\n \"0.590294\",\n \"0.590294\",\n \"0.5891601\",\n \"0.5888488\",\n \"0.58811665\",\n \"0.58809173\",\n \"0.5879727\",\n \"0.5863888\",\n \"0.5861964\",\n \"0.5861964\",\n \"0.5835463\",\n \"0.5827348\",\n \"0.5824273\",\n \"0.58055484\",\n \"0.5802537\",\n \"0.57986087\",\n \"0.57974946\",\n \"0.5792622\",\n \"0.5780573\",\n \"0.5772553\",\n \"0.57569313\",\n \"0.57501006\",\n \"0.5746508\",\n \"0.5737757\",\n \"0.57338977\",\n \"0.57299703\",\n \"0.57215184\",\n \"0.570349\",\n \"0.5698776\",\n \"0.5692156\",\n \"0.5689439\",\n \"0.56857604\",\n \"0.56791186\",\n \"0.56765133\",\n \"0.56758523\",\n \"0.5666474\",\n \"0.56637067\",\n \"0.56594497\",\n \"0.56588143\",\n \"0.5656915\",\n \"0.5656684\",\n \"0.5655458\",\n \"0.56471556\",\n \"0.56471497\",\n \"0.56469166\",\n \"0.5638722\",\n \"0.56352425\",\n \"0.5630575\",\n \"0.56256837\",\n \"0.56254435\",\n \"0.561551\",\n \"0.56131566\",\n \"0.5613041\",\n \"0.56048006\",\n \"0.55967534\",\n \"0.5594468\",\n \"0.5592453\",\n \"0.5589267\",\n \"0.55882066\",\n \"0.5584677\",\n \"0.5583816\",\n \"0.558376\",\n \"0.55799466\",\n \"0.55717605\",\n \"0.5571696\",\n \"0.5570361\",\n \"0.5554319\",\n \"0.55522734\",\n \"0.55458087\",\n \"0.553823\",\n \"0.5538073\",\n \"0.553166\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6875913"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":94795,"cells":{"query":{"kind":"string","value":"Tells if a move is legal"},"document":{"kind":"string","value":"def legalMove(self,p,intMove):\n mPos = self.movePos(p,intMove)#board position of move\n if(self.inBounds(mPos)!=True):#Can't make move out of board bounds\n return False\n #if(p.color != self.whoseTurn):#Can't make move if it's not players pawn\n # return False\n if(intMove==0):#to move forward the node must be empty\n return (self.gameState[mPos.get()] == EMPTY)\n else:#to attack the node must have an enemy\n return (self.gameState[mPos.get()] == self.togglePlayer(p.color))"},"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 move_valid(move):\n return True","def valid_move(self, player, move):\n return (True)","def legal_move(self, move, state = None):\n if state is None:\n state = copy(self.state)\n else:\n state = copy(state)\n return state[move // state.shape[0], move % state.shape[0]] == 0","def validate_move(move):\n if move[0] in cc.VALID_RANKS and move[1] in cc.VALID_RANKS:\n valid = True\n else:\n valid = False\n return valid","def check_move(self, move):\n\n if str(move) in self.moves_made:\n return False\n return True","def is_valid(self, move):\r\n return move > 10 and move < 89","def test_valid_move(self, move):\n if self.game_state[move[0]][move[1]] is not None:\n return False\n return True","def is_legal_move(self, house_num):\n return True","def move_check(self):\r\n \r\n if not self.run:\r\n return False\r\n \r\n if self.get_num_legal_moves() == 0:\r\n SlTrace.lg(\"NO more legal moves!\", \"nolegalmoves\")\r\n ###return False \r\n \r\n if self.new_move:\r\n self.announce_player(\"start_move\")\r\n if SlTrace.trace(\"selected\"):\r\n self.list_selected(\"After start_move\")\r\n self.new_move = False\r\n player = self.get_player()\r\n if player is None:\r\n return False\r\n \r\n return True","def _is_valid_move(self, vector, current_piece, other_piece):\n return True","def is_valid_move(self, move: Any) -> bool:\n return move in self.get_possible_moves()","def is_legal_move(self, current_player, move):\n\t\tstarting_pos = move[0]\n\t\tending_pos = move[1]\n\t\tif ending_pos[0] not in range(self.board_size) or ending_pos[1] not in range(self.board_size):\t# Discard any generated moves that fall off of the board\n\t\t\treturn False \n\t\tif self.board.repr[starting_pos[0]][starting_pos[1]]!=self.player_symbol[current_player]:\n\t\t\tprint \"this should never trigger and is redundant\"\n\t\t\treturn False\n\t\tif self.board.repr[ending_pos[0]][ending_pos[1]]!= '.':\t# Check that landing spot is empty\n\t\t\treturn False\n\t\tmiddle_pos = (starting_pos[0]-(starting_pos[0]-ending_pos[0])/2,starting_pos[1]-(starting_pos[1]-ending_pos[1])/2)\t# Check the middle spot is the other piece - this should in theory not matter because the pieces alternate\n\t\tother_player = 1 - current_player \n\t\tif self.board.repr[middle_pos[0]][middle_pos[1]] != self.player_symbol[other_player]:\n\t\t\treturn False \n\t\treturn True","def is_valid_move(self, position, dest_square):\n if self.symbol.isupper() and position.turn != 'w':\n return False\n elif self.symbol.islower() and position.turn != 'b':\n return False\n elif dest_square not in self.calculate_scope(position):\n return False\n else:\n return True","def is_valid_move(x:int, y:int,board_length) -> bool:\n if x < 0 or y < 0 or x == board_length or y == board_length:\n return False\n return True","def _isvalidmove(self, from_, to_):\n if self.board[from_].occupant is None:\n print(\"Moving from empty square\")\n return False\n piece = self.board[from_].occupant\n\n if piece.color != self.to_move:\n print(\"Wrong color\")\n return False\n\n if self.is_checked:\n if piece.notation != 'K':\n print(\"King is checked!\")\n return False\n\n diff = (\n to_cartesian(to_)[0] - to_cartesian(from_)[0],\n to_cartesian(to_)[1] - to_cartesian(from_)[1]\n )\n if not piece.hopping:\n if self.board.isblocked(from_, to_):\n print(\"Move blocked by other pieces\")\n return False\n\n if self.board[to_].occupant is not None:\n if piece.color == self.board[to_].occupant.color:\n print(\"Cannot capture friendly\")\n return False\n\n if diff not in piece.get_captures():\n print(\"Invalid piece capture\")\n return False\n\n if diff not in piece.get_moves():\n print(\"Invalid piece move\")\n return False\n\n return True","def is_valid_move(state, move):\n row, col = move\n if row not in [1, 2, 3] or col not in [1, 2, 3]:\n print(\"Invalid move! Specify correct game square!\")\n return False\n if state[row-1][col-1] != '_':\n print('Invalid move! Place your marker on a free square!')\n return False\n return True","def is_move_valid(self, direction, reference_board=None):\n # Verify a left move does not take you off the board.\n if (direction == \"l\"):\n if (self._current_loc.get_column() == 0):\n return False\n # Verify an up move does not take you off the board.\n elif (direction == \"u\"):\n # Verify the move does not take you off the board.\n if (self._current_loc.get_row() == 0):\n return False\n # Verify a right move does not take you off the board.\n elif (direction == \"r\"):\n current_row = self._current_loc.get_row()\n max_column_number = len(self._untraversed_board[current_row])\n if self._current_loc.get_column() + 1 == max_column_number:\n return False\n # Verify a down move does not take you off the board.\n elif (direction == \"d\"):\n if self._current_loc.get_row() + 1 == len(self._untraversed_board):\n return False\n else:\n assert False, \"Invalid move direction.\"\n\n # Get the new location for a move in the specified direction.\n new_location = self._calculate_move_location(direction)\n new_row = new_location.get_row()\n new_col = new_location.get_column()\n # Verify the space is available\n if(reference_board is None):\n return BoardPath._untraversed_board[new_row][new_col] != \"#\"\n else:\n return reference_board[new_row][new_col] != \"#\"","def is_legal(self, move, player, board):\r\n if(self.is_valid(move)==False):\r\n return False\r\n if(board[move]!=core.EMPTY):\r\n return False\r\n return True","def move(self) -> bool:\n pass","def any_legal_move(self, player, board):\r\n moves = self.legal_moves(player, board)\r\n #print(moves)\r\n return len(moves)!=0","def valid_move(x, y):\r\n if [x, y] in empty_cells(board):\r\n return True\r\n else:\r\n return False","def is_valid_move(self, move):\n if type(move) == str:\n move = int(move)\n\n return move in self.get_possible_moves()","def isValidMove(self, move: Move) -> bool:\n # TODO: How do we determine the move type?\n # Some form of duck typing?\n minigame_move_classes = {\n \"BuyPrivateCompany\": \"BuyPrivateCompanyMove\",\n \"BiddingForPrivateCompany\": \"BuyPrivateCompanyMove\",\n }\n return minigame_move_classes.get(self.minigame_class) == move.__class__.__name__","def is_valid(move):\n return isinstance(move, int) and move in Othello.squares()","def op_move_preconditions(self):\n\n if(self.next_move != self.FREE):\n return False\n\n return True","def valid_move(board, row, col):\n return board[row][col] == '-'","def is_valid_move(self, position: Point) -> bool:\n\t\tif self.tiles[position.x][position.y] == 0:\n\t\t\treturn True\n\t\treturn False","def is_valid_move(self, somerow, somecol):\n bool_1 = self.board[somerow][somecol] != 1\n bool_2 = self.num_queens_placed < self.size \n bool_3 = self.attack(somerow, somecol)\n return bool_1 and bool_2 and bool_3","def valid_move(self, row, col):\n if not self._game_over:\n i_row, i_col = row-1, col-1\n #i_row and i_col wil be used to index the board (hence the i)\n (valid, flip_lst) = self._valid_placement(i_row, i_col)\n #print(\"FOR TESTING. Tiles Flipped: \", flip_lst)\n \n if valid:\n #Big Change: You decided to make determining validity\n # and flipping separate operations\n self._flip(i_row, i_col, flip_lst)\n else:\n print(\"\\nPlease enter a valid move!\")\n return False\n\n if self._board_is_full():\n self._game_over = True\n self._set_winner() \n \n self._switch_turn(self._turn)\n if not self._valid_move_exists(): #Check if the other player has any valid moves\n print(\"\\nNo valid moves exist for {0}. {0}'s turn has been skipped\".format(self._turn))\n self._switch_turn(self._turn) #Switch turn back to player before skip was determined\n if not self._valid_move_exists(): #Check if the other player has any valid moves\n print(\"No valid moves exist for {0}. {0}'s turn has been skipped\".format(self._turn))\n print(\"No moves exist for either player. GAME OVER\")\n self._game_over = True\n self._set_winner()\n return False\n\n return True\n elif self._game_over:\n print(\"The game is over. No more moves can be made!\")\n #TODO: Replace this^ with an exception later?\n return False","def validate_move(move, player_board):\n select_row = move.select_row\n select_col = move.select_col\n \n player_board_rows = player_board.shape[0]\n player_board_cols = player_board.shape[1]\n \n if select_row >= player_board_rows or select_row < 0 or \\\n select_col >= player_board_cols or select_col < 0 or \\\n player_board[select_row][select_col] != -1:\n return False\n \n return True","def validate_move(self, move_from, move_to, board):\n\n pass","def can_move(self,direction):\r\n if direction in self.current_room.return_directions():\r\n print('move into the next room')\r\n # makes next room \r\n self.next_room(direction)\r\n return True\r\n else:\r\n print(\"Can't move that way\")\r\n return False","def is_move_valid(move: Move, board: Board, whites_turn: bool) -> bool:\n if out_of_bounds(move[0]) == True or out_of_bounds(move[1]) == True:\n return False\n \n if move[0] == move[1]:\n return False\n\n if is_current_players_piece(piece_at_position(move[0], board), False) and whites_turn == True:\n return False\n elif is_current_players_piece(piece_at_position(move[0], board), True) and whites_turn == False:\n return False\n\n\n if piece_at_position(move[1], board) in WHITE_PIECES and whites_turn == True:\n return False\n elif piece_at_position(move[1], board) in BLACK_PIECES and whites_turn == False:\n return False\n\n\n if move[1] not in get_possible_moves(move[0], board):\n return False\n\n\n test_board = board\n test_board = update_board(test_board, move)\n if is_in_check(test_board, True) and whites_turn == True:\n return False\n elif is_in_check(test_board, False) and whites_turn == False:\n return False\n\n return True","def valid_move(self, player, move):\n if self.rounds < len(self.players):\n if ((False in [(self.board).in_bounds(pt) for pt in move])\n or (self.board).overlap(move)\n or not (True in [(pt in player.corners) for pt in move])):\n return (False)\n else:\n return (True)\n\n elif ((False in [(self.board).in_bounds(pt) for pt in move])\n or (self.board).overlap(move)\n or (self.board).adj(player, move)\n or not (self.board).corner(player, move)):\n return (False)\n\n else:\n return (True)","def check_move(board, move):\n\n player, spike_index, fields_to_move = Judge._validate_move(move)\n\n # 1. moving out of the bar\n # 2. check if the source is of the valid player\n # 3. check if the destination is valid\n\n board.set_player_perspective(player)\n\n # 1.\n if spike_index == OUT_OF_BAR_SPECIAL_MOVE:\n if board.bar[player] < 1:\n return False\n\n if not board.valid_dest(fields_to_move - 1):\n return False\n\n return True\n\n # 2.\n if not board.valid_source(spike_index):\n return False\n # 3.\n dest_spike_index = spike_index + fields_to_move\n\n if dest_spike_index >= len(INITIAL_SPIKES_STATE):\n return board.all_at_home()\n \n return board.valid_dest(dest_spike_index)","def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\r\n parsed_positions = self.parse_positions(start_pos, end_pos)\r\n start_row = parsed_positions[0]\r\n start_col = parsed_positions[1]\r\n end_row = parsed_positions[2]\r\n end_col = parsed_positions[3]\r\n\r\n if start_row != end_row and start_col != end_col: # Moving non-orthogonally\r\n return False\r\n\r\n if start_row == end_row: # Moving horizontally\r\n col_difference = end_col - start_col\r\n\r\n if col_difference > 0: # Moving to the right of the board\r\n for col in range(start_col + 1, end_col): # Checks if there is a piece between start_col and end_col\r\n if board[start_row][col].get_piece() is not None:\r\n return False\r\n # When there is no piece to impede path, check if position is empty or piece is enemy piece\r\n if end_piece_player_id is None or start_piece.get_player_id() != end_piece_player_id:\r\n return True\r\n\r\n if col_difference < 0: # Moving to the left of the board\r\n for col in range(start_col - 1, end_col, -1): # Checks to the left of the board\r\n # If there is a piece to block movement to the end_pos, return False\r\n if board[start_row][col].get_piece() is not None:\r\n return False\r\n if end_piece_player_id is None or start_piece.get_player_id() != end_piece_player_id:\r\n return True\r\n\r\n if start_col == end_col: # Moving verticially\r\n row_difference = end_row - start_row\r\n\r\n if row_difference > 0: # Moving down the board\r\n for row in range(start_row + 1, end_row):\r\n if board[row][start_col].get_piece() is not None: # If no piece is impeding path to end_pos\r\n return False\r\n # Checks if end_pos is empty or an enemy piece is on end_pos\r\n if end_piece_player_id is None or start_piece.get_player_id() != end_piece_player_id:\r\n return True\r\n\r\n if row_difference < 0:\r\n for row in range(start_row -1, end_row, -1):\r\n if board[row][start_col].get_piece() is not None: # If no piece is impeding path to end_pos\r\n return False\r\n # Checks if end_pos is empty or an enemy piece is on end_pos\r\n if end_piece_player_id is None or start_piece.get_player_id() != end_piece_player_id:\r\n return True","def validate_move(self, move_from, move_to, board):\n\n from_coordinates = JanggiGame.translate_to_grid(move_from)\n to_coordinates = JanggiGame.translate_to_grid(move_to)\n from_col = from_coordinates[0]\n from_row = from_coordinates[1]\n to_col = to_coordinates[0]\n to_row = to_coordinates[1]\n\n # a cannon cannot capture another cannon\n if type(board[to_col][to_row]) == Cannon:\n return False\n\n # if destination within the board and the move is strictly horizontal or vertical\n if to_col in range(9) and to_row in range(10) and (to_col == from_col or to_row == from_row):\n # if move is to the left\n if to_col < from_col:\n # make sure there is exactly one intervening piece that's not a cannon\n piece_count = 0\n for col in range(to_col + 1, from_col):\n if type(board[col][to_row]) == Cannon:\n return False\n if issubclass(type(board[col][to_row]), Piece):\n piece_count += 1\n if piece_count == 1:\n return True\n # if move is to the right\n if to_col > from_col:\n # make sure there is exactly one intervening piece that's not a cannon\n piece_count = 0\n for col in range(from_col + 1, to_col):\n if type(board[col][to_row]) == Cannon:\n return False\n if issubclass(type(board[col][to_row]), Piece):\n piece_count += 1\n if piece_count == 1:\n return True\n # if move is upward\n if to_row < from_row:\n # make sure there is exactly one intervening piece that's not a cannon\n piece_count = 0\n for row in range(to_row + 1, from_row):\n if type(board[to_col][row]) == Cannon:\n return False\n if issubclass(type(board[to_col][row]), Piece):\n piece_count += 1\n if piece_count == 1:\n return True\n # if move is downward\n if to_row > from_row:\n # make sure there is exactly one intervening piece that's not a cannon\n piece_count = 0\n for row in range(from_row + 1, to_row):\n if type(board[to_col][row]) == Cannon:\n return False\n if issubclass(type(board[to_col][row]), Piece):\n piece_count += 1\n if piece_count == 1:\n return True\n return False\n\n # for moving diagonally in the red palace\n if (from_coordinates in [[3,0],[3,2],[5,0],[5,2]] and to_coordinates in [[3,0],[3,2],[5,0],[5,2]] and\n type(board[4][1]) != Cannon and issubclass(type(board[4][1]), Piece)):\n return True\n\n # for moving diagonally in the blue palace\n if (from_coordinates in [[3,7],[3,9],[5,7],[5,9]] and to_coordinates in [[3,7],[3,9],[5,7],[5,9]] and\n type(board[4][8]) != Cannon and issubclass(type(board[4][8]), Piece)):\n return True\n\n return False","def verify_legal_move(self, direction):\n for b_x, b_y in self.get_block_positions(self.active_piece.FIGURE):\n\n if direction == \"LEFT\":\n b_x -= 1\n elif direction == \"RIGHT\":\n b_x += 1\n elif direction == \"DOWN\":\n b_y += 1\n else:\n raise ValueError\n\n if b_x < 0 or b_x >= self.WIDTH:\n return False\n\n if b_y < 0 or b_y >= self.HEIGHT:\n return False\n\n if self.board[b_y][b_x] != 0:\n return False\n return True","def check_illegal_move(self, player, action):\n available_actions = self.filter_actions(player)\n if action not in available_actions:\n print('Illegal move! Please choose another move!')\n return False\n return True","def test_check_move_with_invalid(self):\n board = [\n [\" \"] * 6,\n [\" \"] * 6,\n [\" \"] * 6,\n [\" \"] * 6,\n [\"\\u25cb\"] * 6,\n [\" \"] * 6,\n [\" \"] * 6\n ]\n valid = self.game.check_move(board, 4)\n self.assertFalse(valid)","def test_verify_move(self):\n self._verify([self.applied_commands['move']])","def legal_move(self, position_to, position_from):\n\n # Returns False if either position_to or position_from is out of bounds.\n if self.is_out_of_bounds(position_to, position_from) is True:\n\n return False\n\n # Return False if position_from does not contain a GamePiece to move.\n game_piece_object = self.get_game_piece_object_at_position(position_from)\n\n if game_piece_object is not None:\n\n game_piece_player_owner = game_piece_object.get_player()\n current_player = self.get_player_turn()\n\n # Returns False if current player does not move out of check on current\n # move or the move causes a check.\n if self.remains_in_check(current_player, position_to, position_from) is True:\n\n return False\n\n # Returns True if current player wishes to pass on their move.\n # Any position on the board will suffice, including a General's position.\n # Tested after simulated move to ensure current_player does not remain\n # in check. Bypasses following tests to make allowance for any position.\n if position_to == position_from:\n\n return True\n\n else:\n\n # Returns False if move is out of turn and GamePiece is moved by wrong\n # player.\n if current_player != game_piece_player_owner:\n\n return False\n\n # Returns False if current play is to capture General.\n # Capturing General is not allowed. Goal of game is checkmate.\n if position_to in [self.get_general_position_red(), self.get_general_position_blue()]:\n\n return False\n\n # All JangiGame rules are handled by not allowing potential moves to which\n # a player could move a GamePiece. These rules include elephant and horse\n # being blocked, cannon not having proper screen or jump/capture being another\n # cannon.\n elif position_to not in game_piece_object.get_potential_moves():\n\n return False\n\n return True\n\n else:\n\n if position_to == position_from:\n\n return True\n\n return False","def is_rook_move_valid(self, from_row, from_col, to_row, to_col):\n # if not on same column or row\n if ((from_row != to_row and from_col != to_col) or\n (from_row == to_row and from_col == to_col)):\n return False\n\n # check if any pieces are in the way of destination\n if from_row != to_row:\n dc = 0\n dr = 1 if to_row - from_row > 0 else -1\n if from_col != to_col:\n dr = 0\n dc = 1 if to_col - from_col > 0 else -1\n dm = abs(to_row - from_row)\n\n retVal = self._any_piece_in_way(from_row, from_col, dr, dc, dm, toRow=to_row, toCol=to_col)\n\n # Casting: Rook invalidation\n if retVal and (from_row == 0 or from_row == 7):\n piece = self.board.squares[from_row][from_col]\n piece_color = self.piece_color(piece)\n if piece_color == \"white\":\n if from_col == 0:\n self.whiteCanCastleQside = False\n elif from_col == 7:\n self.whiteCanCastleKside = False\n else:\n if from_col == 0:\n self.blackCanCastleQside = False\n elif from_col == 7:\n self.blackCanCastleKside = False\n\n return retVal","def is_legal_move(player, row_from, col_from, row_to, col_to):\r\n illegal_moves = [(0, 0), (2, 0), (0, 4), (2, 4)]\r\n\r\n \"\"\"special moves that are move available according to diagram\r\n List of tuples to and from values that are not possible\"\"\"\r\n moves_not_permitted = [[(0, 2), (1, 1)], [(0, 2), (1, 3)], [(1, 1), (2, 2)], [(1, 3), (2, 2)]]\r\n row_diff = abs(row_from - row_to)\r\n col_diff = abs(col_from - col_to)\r\n\r\n if player == 'hounds':\r\n\r\n if (row_to >= 0 and row_to < 3 and col_to >= 0 and col_to < 5):\r\n \"\"\"Check if the move is not out of bounds for the board with max col range 4 and row range 3\r\n and then check if it is a legal move\"\"\"\r\n\r\n if board[row_to][col_to] == 0 and (row_to, col_to) not in illegal_moves and row_diff <= 1 and col_diff <= 1:\r\n \"\"\" Check if the position is blank.\r\n Then check if the move is not one of the blank places\r\n Then check if the row difference and column difference isn't more than 1\r\n \"\"\"\r\n if (col_to - col_from) < 0: # no moves to the left of the board\r\n return False\r\n\r\n for item in moves_not_permitted:\r\n if len(set([(row_from, col_from), (row_to, col_to)]).intersection(set(item))) == 2:\r\n \"\"\" If to and from co-ordinates are present in the moves_not_permitted list then return False\"\"\"\r\n return False\r\n else:\r\n pass\r\n return True\r\n else:\r\n return False\r\n\r\n else:\r\n \"\"\"When player is a hare\"\"\"\r\n\r\n if (row_to >= 0 and row_to < 3 and col_to >= 0 and col_to < 5):\r\n \"\"\"Check if the move is not out of bounds for the board with max col range 4 and row range 3\r\n and then check if it is a legal move\"\"\"\r\n\r\n if board[row_to][col_to] == 0 and (row_to, col_to) not in illegal_moves and row_diff <= 1 and col_diff <= 1:\r\n \"\"\" Check if the position is blank.\r\n Then check if the move is not one of the blank places\r\n Then check if the row difference and column difference isn't more than 1\"\"\"\r\n\r\n for item in moves_not_permitted:\r\n if len(set([(row_from, col_from), (row_to, col_to)]).intersection(set(item))) == 2:\r\n \"\"\" If to and from co-ordinates are present in the moves_not_permitted list then return False\"\"\"\r\n return False\r\n else:\r\n pass\r\n return True\r\n\r\n else:\r\n return False","def canMove(self):\n\n if self.index == len(self.path):\n self.move = False\n return self.move","def is_legal_move(state, action, player, rewarding_move=False): # TODO: Update this function to an more\n # optimized one.\n action = action.get_action_as_dict()\n if rewarding_move:\n if player == state.get_next_player() == state.get_latest_player():\n if action['action_type'] == YoteActionType.STEAL_FROM_HAND and state.in_hand[player * -1] > 0:\n return True\n elif action['action_type'] == YoteActionType.STEAL_FROM_BOARD:\n opponent_piece = state.get_board().get_player_pieces_on_board(Color(player * -1))\n if opponent_piece and action['action']['at'] in opponent_piece:\n return True\n return False\n else:\n if state.get_next_player() == player:\n if action['action_type'] == YoteActionType.ADD and state.in_hand[player] > 0:\n empty_cells = state.get_board().get_all_empty_cells()\n if empty_cells and action['action']['to'] in empty_cells:\n return True\n elif action['action_type'] == YoteActionType.MOVE:\n if state.get_board().get_cell_color(action['action']['at']) == Color(player):\n effective_moves = YoteRules.get_effective_cell_moves(state, action['action']['at'], player)\n if effective_moves and action['action']['to'] in effective_moves:\n return True\n return False\n return False","def check_move(self, x, y):\n try:\n return self.map[self.y+y][self.x+x] == \" \" or [self.x+x, self.y+y] == self.end_pos\n except IndexError:\n return False","def can_move(self, side, number_of_turns):\n return True","def any_legal_move(player, board):\n return any(Othello.is_legal(sq, player, board) for sq in Othello.squares())","def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\r\n parsed_positions = self.parse_positions(start_pos, end_pos)\r\n start_row = parsed_positions[0]\r\n start_col = parsed_positions[1]\r\n end_row = parsed_positions[2]\r\n end_col = parsed_positions[3]\r\n\r\n # Case for Red's side\r\n if start_piece.get_player_id() == 'r':\r\n if not (3 <= end_col <= 5 and 0 <= end_row <= 2): # Returns False when is to move outside the palace\r\n return False\r\n else:\r\n if abs(start_col - end_col) == 1 and abs(start_row - end_row) == 1: # Checks if end_pos forces a move diagonally\r\n return True\r\n else:\r\n return False\r\n\r\n # Case for Black's side\r\n else:\r\n if not (3 <= end_col <= 5 and 7 <= end_row <= 9): # Returns False when is to move outside the palace\r\n return False\r\n else:\r\n if abs(start_col - end_col) == 1 and abs(start_row - end_row) == 1: # Checks if end_pos forces a move diagonally\r\n return True\r\n else:\r\n return False","def _valid_move_exists(self):\n lst = []\n for i_row in range(self._num_rows):\n for i_col in range(self._num_cols):\n if self._valid_placement(i_row, i_col)[0]:\n lst.append((i_row, i_col))\n\n return lst != [] #If lst != [], then the list has elements -> valid move(s) exist","def validate_move(board: list, character: dict, direction: str) -> bool:\n if direction.strip().upper() == \"N\":\n return (character[\"Position\"][0] - 1, character[\"Position\"][1]) in board\n elif direction.strip().upper() == \"S\":\n return (character[\"Position\"][0] + 1, character[\"Position\"][1]) in board\n elif direction.strip().upper() == \"W\":\n return (character[\"Position\"][0], character[\"Position\"][1] - 1) in board\n elif direction.strip().upper() == \"E\":\n return (character[\"Position\"][0], character[\"Position\"][1] + 1) in board\n else:\n print(\"Please enter only directions shown above\")\n return False","def is_moving(self) -> bool:\n return self.orders and self.orders[0].ability.id is AbilityId.MOVE","def valid_move(self, stone_color, index):\n if self.get(index) is not None:\n print(\"Invalid move - Space it occupied\")\n return False\n elif self.is_suicide(stone_color, index):\n print(\"Invalid move - Suicide\")\n return False\n else:\n return True","def legal_move(marker, x, y, direction):\n # first if statement determines the directions\n # second if statement checks if the \"potential move\" is within the index\n if direction == \"N\":\n if 0 <= y-2 < len(marker):\n return marker[y-2][x] == marker[y-1][x] == '*'\n if direction == \"S\":\n if 0 <= y+2 < len(marker):\n return marker[y+2][x] == marker[y+1][x] == '*'\n if direction == \"W\":\n if 0 <= x-2 < len(marker[0]):\n return marker[y][x-2] == marker[y][x-1] == '*'\n if direction == \"E\":\n if 0 <= x+2 < len(marker[0]):\n return marker[y][x+2] == marker[y][x+1] == '*'\n return False","def makeMove(self, _pos, _check_legality=True):\n\n # Check legality is an argument mainly for testing purposes; not for live gameplay.\n if _check_legality:\n legality = self.board.getMoveLegality(self, _pos)\n is_legal_move, is_capturing = legality['is_legal_move'], legality['is_capturing']\n if not is_legal_move:\n # Will need to update this line with interface update.\n # exit(\"ILLEGAL MOVE of {} at {}\".format(self.color, _pos))\n return 'illegal'\n else:\n # _is_capturing is necessary because of the not too often situation of a move with\n # no liberties, but is legal because it's capturing.\n if is_capturing: self.board.playerMakesMove(self, _pos, _is_capturing=True)\n else: self.board.playerMakesMove(self, _pos)\n else:\n self.board.playerMakesMove(self, _pos)","def can_move(self):\n return self.movement","def _is_valid_move(self, vector, current_piece, other_piece):\n # If direction is forward and the space is non-empty, break\n if vector[0] == 0 and other_piece != \"empty\":\n return False\n # If direction is diagonal and space is empty, break\n if vector[0] != 0 and other_piece == \"empty\":\n return False\n # If moving by 2 spaces, check if in starting row\n if vector[1] == 2 and current_piece.position[1] != 1:\n return False\n if vector[1] == -2 and current_piece.position[1] != 6:\n return False\n\n return True","def LegalMove(self, pos):\n\n return (0 <= pos <= BOARD_SIZE) and (self.state[pos] == EMPTY)","def validate_move(coordinates: dict, character_dict: dict, user_input: str) -> bool:\n new_coordinate = get_new_coordinate(x_y_coordinate=character_dict, move_direction=user_input)\n return new_coordinate in coordinates","def _ispinnedmove(self, from_, to_):\n return False","def move_is_valid(self, pos):\n\n if (not isinstance(pos, tuple) or len(pos) != 2 or \n not isinstance(pos[0], int) or not isinstance(pos[1], int)):\n return False\n y, x = pos\n if (y >= 0 and y < self.size and x >= 0 and x < self.size and \n self.board[pos] == HexBoard.EMPTY):\n return True\n else:\n return False","def allow_to_move(self, direction, row, column):\n if self.valid_coverage_cell(row, column):\n if self.collision(direction) is False and \\\n self.cov_grid[row][column] == NOT_VISITED:\n return True\n else:\n return False","def CheckMove(self,move):\n\t\tif(move=='w'):\n\t\t\tif(self.x==0):\n\t\t\t\treturn 0\n\t\t\treturn 1\n\t\telif(move=='s'):\n\t\t\tif(self.x==15):\n\t\t\t\treturn 0\n\t\t\treturn 1\n\t\telif(move=='d'):\n\t\t\tif(self.y==35):\n\t\t\t\treturn 0\n\t\t\treturn 1\n\t\telif(move=='a'):\n\t\t\tif(self.y==0):\n\t\t\t\treturn 0\n\t\t\treturn 1","def is_move_valid(self, from_row, from_col, to_row, to_col):\n # check is taking own piece?\n if self._is_taking_own_piece(from_row, from_col, to_row, to_col):\n return False\n\n piece = self.board.squares[from_row][from_col]\n if piece == ChessPiece.W_ROOK or piece == ChessPiece.B_ROOK:\n return self.is_rook_move_valid(from_row, from_col,\n to_row, to_col)\n if piece == ChessPiece.W_KNIGHT or piece == ChessPiece.B_KNIGHT:\n return self.is_knight_move_valid(from_row, from_col,\n to_row, to_col)\n if piece == ChessPiece.W_BISHOP or piece == ChessPiece.B_BISHOP:\n return self.is_bishop_move_valid(from_row, from_col,\n to_row, to_col)\n if piece == ChessPiece.W_QUEEN or piece == ChessPiece.B_QUEEN:\n return self.is_queen_move_valid(from_row, from_col,\n to_row, to_col)\n if piece == ChessPiece.W_KING or piece == ChessPiece.B_KING:\n return self.is_king_move_valid(from_row, from_col,\n to_row, to_col)\n if piece == ChessPiece.W_PAWN or piece == ChessPiece.B_PAWN:\n return self.is_pawn_move_valid(from_row, from_col,\n to_row, to_col)","def is_knight_move_valid(self, from_row, from_col, to_row, to_col):\n # check for valid move\n if ((abs(from_row - to_row) == 1 and abs(from_col - to_col) == 2) or\n (abs(from_row - to_row) == 2 and abs(from_col - to_col) == 1)):\n return True\n return False","def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\r\n parsed_positions = self.parse_positions(start_pos, end_pos)\r\n\r\n start_row = parsed_positions[0]\r\n start_col = parsed_positions[1]\r\n end_row = parsed_positions[2]\r\n end_col = parsed_positions[3]\r\n count = 0 # Count will track how many pieces are between start and end_pos\r\n\r\n if start_row != end_row and start_col != end_col: # Moving diagonally\r\n return False\r\n\r\n # If cannon moves to an empty position\r\n # if end_piece_player_id is None:\r\n\r\n if start_row == end_row: # Moving horizontally\r\n col_difference = end_col - start_col\r\n\r\n if col_difference > 0: # Moving to the right of the board\r\n for col in range(start_col + 1, end_col): # Checks if there is a piece between start_col and end_col\r\n if board[start_row][col].get_piece() is not None:\r\n count += 1\r\n\r\n if col_difference < 0: # Moving to the left of the board\r\n for col in range(start_col - 1, end_col, -1): # Checks to the left of the board\r\n # If there is a piece to block movement to the end_pos, return False\r\n if board[start_row][col].get_piece() is not None:\r\n count += 1\r\n\r\n if start_col == end_col: # Moving vertically\r\n row_difference = end_row - start_row\r\n\r\n if row_difference > 0: # Moving down the board\r\n for row in range(start_row + 1, end_row):\r\n if board[row][start_col].get_piece() is not None: # If no piece is impeding path to end_pos\r\n count += 1\r\n\r\n\r\n if row_difference < 0: # Moving up the board\r\n for row in range(start_row -1, end_row, -1):\r\n if board[row][start_col].get_piece() is not None: # If no piece is impeding path to end_pos\r\n count += 1\r\n\r\n # 1 piece between start_pos and end_pos and end_pos contains a chess piece\r\n if count == 1 and end_piece_player_id is not None:\r\n return True\r\n # end_pos has no piece and there are no pieces to impede path\r\n elif end_piece_player_id is None and count == 0:\r\n return True\r\n # Returns False for all other scenarios\r\n else:\r\n return False","def is_valid_move(self, board, fieldy, fieldx):\n if isinstance(board[fieldy][fieldx], Piece):\n return False\n if self.posy - fieldy == self.direction and abs(self.posx - fieldx) == 1:\n return True\n else:\n return False","def validate_move(board: list, character: list, direction: str) -> bool:\n max_x_y_coordinates = board[-1]\n valid_options = []\n if character[1] < max_x_y_coordinates[0]:\n valid_options.append(\"d\")\n if character[1] > 0:\n valid_options.append(\"a\")\n if character[0] < max_x_y_coordinates[1]:\n valid_options.append(\"s\")\n if character[0] > 0:\n valid_options.append(\"w\")\n if direction in valid_options:\n return True\n else:\n return False","def test_legalMoveP_backwards_goose(self):\n rules_obj = rules.Rules(test_mode=True)\n board = gamenode.GameNode()\n startCoordinate = coordinate.Coordinate(3, 1)\n endCoordinate = coordinate.Coordinate(3, 2)\n board.setState(startCoordinate, types.GOOSE)\n actual_result = rules_obj.legalMoveP(board,\n startCoordinate,\n endCoordinate)\n expected_result = False\n self.assertEqual(actual_result, expected_result)","def can_move(self):\r\n for wall in self.app.walls:\r\n if vec(self.grid_pos+self.direction) == wall:\r\n return False\r\n return True","def make_move(self, **move_data: typing.Dict[str, typing.Any]) -> bool:\n raise NotImplementedError","def can_move(self, relative_location: RelativeCoord) -> bool:\n\n return self.moves.can_move(relative_location)","def move_atoms(self):\n return self.abivars.ionmov != 0","def test_valid_move():\n\n board = Board()\n\n # a col outside the width of the board should be false\n assert board.valid_move(board.get_grid_size()[1] + 1) is False\n\n # only positive cols should be considered for a move\n assert board.valid_move(-2) is False\n\n # since board is empty all cols should have moves\n for i in range(board.get_grid_size()[1]):\n assert board.valid_move(i) is True\n\n # if a col is full no move can be made\n for i in range(board.get_grid_size()[1]):\n if i % 2 == 0:\n board.move(board.P1, 0)\n else:\n board.move(board.P2, 0)\n\n \"\"\"\n board now looks like this...\n \n 0 1 2 3 4 5 6 \n +-+-+-+-+-+-+-+\n 0|O|-|-|-|-|-|-|0\n +-+-+-+-+-+-+-+\n 1|X|-|-|-|-|-|-|1\n +-+-+-+-+-+-+-+\n 2|O|-|-|-|-|-|-|2\n +-+-+-+-+-+-+-+\n 3|X|-|-|-|-|-|-|3\n +-+-+-+-+-+-+-+\n 4|O|-|-|-|-|-|-|4\n +-+-+-+-+-+-+-+\n 5|X|-|-|-|-|-|-|5\n +-+-+-+-+-+-+-+\n 0 1 2 3 4 5 6 \n\n \"\"\"\n assert board.valid_move(0) is False","def make_legal_move(move, board, start, end, move_number, en_passant_square, king_w, king_b, rook_w_l, rook_w_r,\n rook_b_l,\n rook_b_r, promotion_piece):\n # this function should have essentially what i had in main at first without making the move\n test_board = board.copy()\n valid_move = False\n piece = find_piece(board, start)\n end_piece = find_piece(board, end)\n\n if switch_player(move_number): # for whites move\n if (65 <= ord(piece) <= 90) and (validate_move(board, end, move_number)):\n if piece == \"P\":\n if pawn(board, start, end, move_number):\n if end[0] == 8:\n promotion(test_board, start, end, promotion_piece)\n if not check(test_board, move_number):\n retract_move(test_board, start, end, end_piece)\n promotion(board, start, end, promotion_piece)\n return True\n else:\n valid_move = False\n else:\n valid_move = True\n else:\n if can_en_passant(board, en_passant_square, end, start, move_number):\n execute_enpassant(test_board, start, end, move_number)\n if not check(test_board, move_number):\n retract_move(test_board, start, end, end_piece)\n execute_enpassant(board, start, end, move_number)\n return True\n else:\n return False\n elif piece == \"K\":\n if king(start, end):\n if controlled_squares(board, move_number, end):\n valid_move = True\n elif piece == \"N\":\n if knight(start, end):\n valid_move = True\n elif piece == \"B\":\n if bishop(board, start, end):\n valid_move = True\n elif piece == \"Q\":\n if queen(board, start, end):\n valid_move = True\n elif piece == \"R\":\n if rook(board, start, end):\n valid_move = True\n else:\n valid_move = False\n if valid_move:\n update_board(test_board, start, end)\n if not check(test_board, move_number):\n retract_move(test_board, start, end, end_piece)\n update_board(board, start, end)\n return True\n else:\n retract_move(test_board, start, end, end_piece)\n print(\"Illegal Move\")\n return False\n if not switch_player(move_number):\n if (97 <= ord(piece) <= 122) and validate_move(board, end, move_number):\n if piece == \"p\":\n if pawn(board, start, end, move_number):\n if end[0] == 1:\n promotion(test_board, start, end, promotion_piece)\n if not check(test_board, move_number):\n retract_move(test_board, start, end, end_piece)\n promotion(board, start, end, promotion_piece)\n return True\n else:\n valid_move = False\n else:\n valid_move = True\n else:\n if can_en_passant(board, en_passant_square, end, start, move_number):\n execute_enpassant(test_board, start, end, move_number)\n if not check(test_board, move_number):\n retract_move(test_board, start, end, end_piece)\n execute_enpassant(board, start, end, move_number)\n return True\n else:\n valid_move = False\n elif piece == \"k\":\n if king(start, end):\n if controlled_squares(board, move_number, end):\n valid_move = True\n elif piece == \"n\":\n if knight(start, end):\n valid_move = True\n elif piece == \"b\":\n if bishop(board, start, end):\n valid_move = True\n elif piece == \"q\":\n if queen(board, start, end):\n valid_move = True\n elif piece == \"r\":\n if rook(board, start, end):\n valid_move = True\n else:\n valid_move = False\n if valid_move:\n update_board(test_board, start, end)\n if not check(test_board, move_number):\n retract_move(test_board, start, end, end_piece)\n update_board(board, start, end)\n return True\n else:\n retract_move(test_board, start, end, end_piece)\n print(\"Illegal Move\")\n return False","def is_valid_move(self, side_color, x, y):\n return self.disc_place(side_color, x, y, check_only=True)","def test_check_move_with_barely_valid(self):\n board = [\n [\" \"] * 6,\n [\" \"] * 6,\n [\" \"] * 6,\n [\" \"] * 6,\n [\"\\u25cb\"] * 5 + [\" \"],\n [\" \"] * 6,\n [\" \"] * 6\n ]\n valid = self.game.check_move(board, 4)\n self.assertTrue(valid)","def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\r\n parsed_positions = self.parse_positions(start_pos, end_pos)\r\n start_row = parsed_positions[0]\r\n start_col = parsed_positions[1]\r\n end_row = parsed_positions[2]\r\n end_col = parsed_positions[3]\r\n\r\n # Case for Red\r\n if start_piece.get_player_id() == 'r':\r\n\r\n # Red soldier hasn't crossed river\r\n if 3 <= start_row <= 4:\r\n if end_row - start_row == 1 and start_col == end_col:\r\n return True\r\n\r\n # Red solider has crossed river\r\n else:\r\n # Checks if movement forces a diagonal\r\n if end_row - start_row == 1 and abs(end_col - start_col) == 1:\r\n return False\r\n # Rules out the diagonal and checks if movement is valid\r\n elif end_row - start_row == 1 or abs(end_col - start_col) == 1:\r\n return True\r\n else:\r\n return False\r\n\r\n # Case for Black\r\n else:\r\n # Black soldier hasn't crossed river\r\n if 5 <= start_row <= 6:\r\n if end_row - start_row == -1 and start_col == end_col:\r\n return True\r\n else:\r\n return False\r\n\r\n # Black soldier has crossed the river\r\n else:\r\n # Checks if movement forces a diagonal\r\n if end_row - start_row == -1 and abs(end_col - start_col) == 1:\r\n return False\r\n # Rules out the diagonal and checks if movement is valid\r\n elif end_row - start_row == -1 or abs(end_col - start_col) == 1:\r\n return True\r\n\r\n else:\r\n return False","def check_valid_move(grid: np.ndarray, current_position: tuple, move: tuple) -> bool:\n # getting coordinates for moved position\n moved_position = tuple(np.add(current_position, move))\n\n def compare_coordinates(a: tuple, b: tuple) -> bool:\n \"\"\"\n Helper function to compare coordinates\n Checks if a is smaller than b\n \"\"\"\n return all(np.array(a) < np.array(b))\n\n # checking if coordinates are inside the array (between (0,0) and (N,N))\n if compare_coordinates((0, 0), moved_position) and compare_coordinates(moved_position, grid.shape):\n # checking if the coordinates are not on the obstacle\n if grid[moved_position] == 'x':\n return False\n else:\n return True\n else:\n return False","def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\r\n parsed_positions = self.parse_positions(start_pos, end_pos)\r\n\r\n start_row = parsed_positions[0]\r\n start_col = parsed_positions[1]\r\n end_row = parsed_positions[2]\r\n end_col = parsed_positions[3]\r\n\r\n # For horizontal movements for the horse\r\n if abs(end_row - start_row) == 1 and abs(end_col - start_col) == 2:\r\n # For movement going left\r\n if end_col - start_col == -2:\r\n if board[start_row][start_col-1].get_piece() is None: # Checks if horse is blocked\r\n return True\r\n else:\r\n return False\r\n # For movement going right\r\n else:\r\n if board[start_row][start_col + 1].get_piece() is None: # Checks if horse is blocked\r\n return True\r\n else:\r\n return False\r\n\r\n # For vertical movement for the horse\r\n elif abs(end_row - start_row) == 2 and abs(end_col - start_col) == 1:\r\n # For movement going down\r\n if end_row - start_row == 2:\r\n if board[start_row + 1][start_col].get_piece() is None:\r\n return True\r\n else:\r\n return False\r\n # For movement going up\r\n if end_row - start_row == -2:\r\n if board[start_row - 1][start_col].get_piece() is None:\r\n return True\r\n else:\r\n return False\r\n\r\n # Returns False if invalid end_pos for the horse\r\n else:\r\n return False","def is_legal(move, player, board):\n hasbracket = lambda direction: Othello.find_bracket(move, player, board, direction)\n return board[move] == EMPTY and any(map(hasbracket, DIRECTIONS))","def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\r\n \"\"\"General moves should only move +1 or -1 from its starting row and col\"\"\"\r\n\r\n # Checks for legality if end position contains a piece and it does not attack own side's piece\r\n parsed_positions = self.parse_positions(start_pos, end_pos)\r\n start_row = parsed_positions[0]\r\n start_col = parsed_positions[1]\r\n end_row = parsed_positions[2]\r\n end_col = parsed_positions[3]\r\n\r\n # Case for red General\r\n if start_piece.get_player_id() == 'r': # Start piece is guaranteed to contain a piece, binds red to the palace\r\n if 3 <= end_col <= 5 and 0 <= end_row <= 2:\r\n if abs(start_col - end_col) >= 1 and abs(start_row - end_row) >= 1:\r\n return False\r\n else:\r\n return True\r\n else:\r\n return False\r\n # Case for black General\r\n else:\r\n if 3 <= end_col <= 5 and 7 <= end_row <= 9: # Binds end_pos to the palace\r\n if abs(start_col - end_col) == 1 and abs(start_row - end_row) == 1: # Guarantees that diagonal movements will return false\r\n return False\r\n else:\r\n return True\r\n else:\r\n return False","def validate_movement(self, piece, from_col, from_row, to_col, to_row):\n col_diff = abs(ord(from_col) - ord(to_col))\n row_diff = abs(from_row - to_row)\n\n # For any piece, it must actually move...\n if col_diff == 0 and row_diff == 0:\n return False\n # ...and there must be empty spaces in between the from/to squares (when on a column, row, or diagonal)\n if not self.validate_empty_between(from_col, from_row, to_col, to_row):\n return False\n\n # White pawn\n if piece == 'P':\n if col_diff == 1 and (to_row - from_row == 1):\n # Can move diagonally up one square, if taking another piece in that square or by en-passant\n return self.piece_colour(to_col, to_row) == 'B' \\\n or self.is_en_passant(from_col, from_row, to_col, to_row)\n elif col_diff != 0:\n # Otherwise, it can't change columns\n return False\n elif from_row == 2:\n # From initial position, can go up one or two rows (but can't take a piece)\n return (to_row == 3 or to_row == 4) and self.get_square(to_col, to_row) == ' '\n else:\n # Otherwise, can only move up one row (but can't take a piece)\n return to_row - from_row == 1 and self.get_square(to_col, to_row) == ' '\n # Black pawn\n elif piece == 'p':\n if col_diff == 1 and (from_row - to_row == 1):\n # Can move diagonally down one square, if taking another piece in that square or by en-passant\n return self.piece_colour(to_col, to_row) == 'W' \\\n or self.is_en_passant(from_col, from_row, to_col, to_row)\n elif col_diff != 0:\n # Otherwise, it can't change columns\n return False\n elif from_row == 7:\n # From initial position, can go down one or two rows (but can't take a piece)\n return (to_row == 6 or to_row == 5) and self.get_square(to_col, to_row) == ' '\n else:\n # Otherwise, can only move down one row (but can't take a piece)\n return from_row - to_row == 1 and self.get_square(to_col, to_row) == ' '\n # Rook\n elif piece.lower() == 'r':\n # Must remain in same column or same row\n return col_diff == 0 or row_diff == 0\n # Knight\n elif piece.lower() == 'n':\n # Jumps in a 2+1 pattern\n return (col_diff == 2 and row_diff == 1) or (col_diff == 1 and row_diff == 2)\n # Bishop\n elif piece.lower() == 'b':\n # Moves along diagonals\n return col_diff == row_diff\n # Queen\n elif piece.lower() == 'q':\n # Can move along columns, rows, or diagonals\n return col_diff == 0 or row_diff == 0 or col_diff == row_diff\n # King\n elif piece.lower() == 'k':\n # Can move a single square in any direction\n if not(0 <= col_diff <= 1) or not(0 <= row_diff <= 1):\n return False\n\n # But not next to the other king\n other_king = 'k' if piece.isupper() else 'K'\n # Get valid border squares\n border_squares = list(filter(\n lambda b_square: 'a' <= b_square[0] <= 'f' and 1 <= b_square[1] <= 8,\n [\n (chr(ord(to_col) - 1), to_row - 1), (to_col, to_row - 1), (chr(ord(to_col) + 1), to_row - 1),\n (chr(ord(to_col) - 1), to_row), (to_col, to_row), (chr(ord(to_col) + 1), to_row),\n (chr(ord(to_col) - 1), to_row + 1), (to_col, to_row + 1), (chr(ord(to_col) + 1), to_row + 1)\n ]\n ))\n # Check for the other king\n for square in border_squares:\n if self.get_square(square[0], square[1]) == other_king:\n return False\n\n return True","def isLegalMove(self, column, state):\n \n for i in range(6):\n if state[i][column] == ' ':\n # once we find the first empty, we know it's a legal move\n return True\n \n # if we get here, the column is full\n return False","def validate_move(self, move_from, move_to, board):\n\n from_coordinates = JanggiGame.translate_to_grid(move_from)\n to_coordinates = JanggiGame.translate_to_grid(move_to)\n from_col = from_coordinates[0]\n from_row = from_coordinates[1]\n to_col = to_coordinates[0]\n to_row = to_coordinates[1]\n\n # if destination within the board\n if (to_col in range(9) and to_row in range(10) and\n # and the move is 1 up/down/left/right (with no other piece here) and then 1 farther out diagonally\n ((to_row - from_row == -2 and abs(to_col - from_col) == 1 and board[from_col][from_row - 1] == '') or\n (to_row - from_row == 2 and abs(to_col - from_col) == 1 and board[from_col][from_row + 1] == '') or\n (to_col - from_col == -2 and abs(to_row - from_row) == 1 and board[from_col - 1][from_row] == '') or\n (to_col - from_col == 2 and abs(to_row - from_row) == 1 and board[from_col + 1][from_row] == '')\n )\n ):\n return True\n else:\n return False","def no_more_move(self):\n if (self.p_no_move + self.c_no_move == 2):\n return True\n return False","def check4move(st, selected_unit, direction):\n return 1","def validate_move(self, move_from, move_to, board):\n\n from_coordinates = JanggiGame.translate_to_grid(move_from)\n to_coordinates = JanggiGame.translate_to_grid(move_to)\n from_col = from_coordinates[0]\n from_row = from_coordinates[1]\n to_col = to_coordinates[0]\n to_row = to_coordinates[1]\n\n # if destination within the board and the move is strictly horizontal or vertical\n if to_col in range(9) and to_row in range(10) and (to_col == from_col or to_row == from_row):\n # if move is to the left\n if to_col < from_col:\n # make sure no other piece lies between to and from\n for col in range(to_col + 1, from_col):\n if board[col][to_row] != '':\n return False\n return True\n # if move is to the right\n if to_col > from_col:\n # make sure no other piece lies between to and from\n for col in range(from_col + 1, to_col):\n if board[col][to_row] != '':\n return False\n return True\n # if move is upward\n if to_row < from_row:\n # make sure no other piece lies between to and from\n for row in range(to_row + 1, from_row):\n if board[to_col][row] != '':\n return False\n return True\n # if move is downward\n if to_row > from_row:\n # make sure no other piece lies between to and from\n for row in range(from_row + 1, to_row):\n if board[to_col][row] != '':\n return False\n return True\n\n return False\n\n # if moving along the diagonals in the red palace\n if from_coordinates in [[3,0],[3,2],[5,0],[5,2]] and to_coordinates in [[3,0],[3,2],[5,0],[5,2]] and board[4][1] == '':\n return True\n if from_coordinates in [[3,0],[3,2],[5,0],[5,2]] and to_coordinates == [4,1]:\n return True\n if from_coordinates == [4,1] and to_coordinates in [[3,0],[3,2],[5,0],[5,2]]:\n return True\n\n # if moving along the diagonals in the blue palace\n if from_coordinates in [[3,7],[3,9],[5,7],[5,9]] and to_coordinates in [[3,7],[3,9],[5,7],[5,9]] and board[4][8] == '':\n return True\n if from_coordinates in [[3,7],[3,9],[5,7],[5,9]] and to_coordinates == [4,8]:\n return True\n if from_coordinates == [4,8] and to_coordinates in [[3,7],[3,9],[5,7],[5,9]]:\n return True\n\n return False","def checkLegalMove(self, initialPosition, destinationPosition, colorIndex):\n checkColor = self.grid.REPRESENTATION[colorIndex]\n otherColor = self.grid.REPRESENTATION[1-colorIndex]\n emptyColor = self.grid.REPRESENTATION[2]\n if self.grid[initialPosition] != checkColor:\n print 'The piece you are trying to move is not yours! Please reselect your move.'\n return False\n if self.grid[destinationPosition] != emptyColor:\n print 'The destination position of your move is not empty! Please reselect your move.'\n return False\n if initialPosition == destinationPosition:\n print 'The initial and destination position of your move are the same. Please reselect your move.'\n return False\n\n if initialPosition[0] == destinationPosition[0]:\n x = initialPosition[0]\n if (destinationPosition[1] - initialPosition[1]) %2 != 0:\n print 'Invalid move! Please reselect your move.'\n return False\n if initialPosition[1] < destinationPosition[1]:\n for i in range(initialPosition[1]+1, destinationPosition[1], 2):\n if self.grid[(x, i)] != otherColor or self.grid[(x, i+1)] != emptyColor:\n print 'Invalid move! Please reselect your move.'\n return False\n return True\n else:\n for i in range(initialPosition[1]-1, destinationPosition[1], -2):\n if self.grid[(x, i)] != otherColor or self.grid[(x, i-1)] != emptyColor:\n print 'Invalid move! Please reselect your move.'\n return False\n return True\n elif initialPosition[1] == destinationPosition[1]:\n y = initialPosition[1]\n if (destinationPosition[0] - initialPosition[0])%2 != 0:\n print 'Invalid move! Please reselect your move.'\n return False\n if initialPosition[0] < destinationPosition[0]:\n for i in range(initialPosition[0]+1, destinationPosition[0], 2):\n if self.grid[(i, y)] != otherColor or self.grid[(i+1, y)] != emptyColor:\n print 'Invalid move! Please reselect your move.'\n return False\n return True\n else:\n for i in range(initialPosition[0]-1, destinationPosition[0], -2):\n if self.grid[(i, y)] != otherColor or self.grid[(i-1, y)] != emptyColor:\n print 'Invalid move! Please reselect your move.'\n return False\n return True\n # make turns\n print 'Making turns is invalid move! Please reselect your move.'\n return False","def canMove(self, direction, robot, newPosX, newPosY):\n result = False\n if (newPosY < 0 or newPosY > len(self.map)):\n print (\"Déplacement impossible\")\n elif (newPosX < 0 or newPosX > len(self.map[newPosY])):\n print (\"Déplacement impossible\")\n else:\n if (self.isThereWallInDirection(direction, robot, \\\n newPosX, newPosY)):\n print(\"Déplacement impossible (mur sur le chemin)\")\n result = False\n else:\n car = self.map[newPosY][newPosX]\n logging.info(\"self.map[{}]={}\".format(newPosY, \\\n self.map[newPosY]))\n logging.info(\"new coord X={} : Y={} :: {}\".\\\n format(newPosX, newPosY, car))\n if (car == \"O\"):\n print(\"Déplacement impossible (mur)\")\n else:\n logging.info(\"Déplacement possible\")\n result = True\n return result","def valid_bool(self):\n return bool(self.piece.validate_move(self.board, self))","def validBoard():\r\n\r\n\tglobal move1, move2\r\n\r\n\tif move1==move2 or move1-move2==1:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False","def has_moved(self):\n return self.move_count > 0","def check_move(self, y, x):\n return 0 <= y < len(self.maze) \\\n and 0 <= x < len(self.maze[y]) \\\n and self.maze[y][x] != \"#\"","def test_check_move_with_valid(self):\n board = [\n [\" \"] * 6,\n [\" \"] * 6,\n [\" \"] * 6,\n [\" \"] * 6,\n [\"\\u25cb\"] + [\" \"] * 5,\n [\" \"] * 6,\n [\" \"] * 6\n ]\n valid = self.game.check_move(board, 3)\n self.assertTrue(valid)","def validate_move(self, move_from, move_to, board):\n\n from_coordinates = JanggiGame.translate_to_grid(move_from)\n to_coordinates = JanggiGame.translate_to_grid(move_to)\n from_col = from_coordinates[0]\n from_row = from_coordinates[1]\n to_col = to_coordinates[0]\n to_row = to_coordinates[1]\n\n # for red soldiers (who can only move downward or to the side)\n if self.get_color() == 'red':\n # if destination within the board and the move is strictly one downward or to the side\n if (to_col in range(9) and to_row in range(10) and\n ((abs(to_col - from_col) == 1 and to_row == from_row) or (to_col == from_col and to_row - from_row == 1))):\n return True\n # if moving diagonally within the blue palace\n if from_coordinates in [[3,7],[5,7]] and to_coordinates == [4,8]:\n return True\n if from_coordinates == [4,8] and to_coordinates in [[3,9],[5,9]]:\n return True\n\n return False\n\n # for blue soldiers (who can only move upward or to the side)\n if self.get_color() == 'blue':\n # if destination within the board and the move is strictly one upward or to the side\n if (to_col in range(9) and to_row in range(10) and\n ((abs(to_col - from_col) == 1 and to_row == from_row) or (to_col == from_col and to_row - from_row == -1))):\n return True\n # if moving diagonally within the red palace\n if from_coordinates in [[3, 2], [5, 2]] and to_coordinates == [4, 1]:\n return True\n if from_coordinates == [4, 1] and to_coordinates in [[3, 0], [5, 0]]:\n return True\n\n return False\n\n return False","def check_legal(self, cur_pos, new_pos, board, state): \n if cur_pos and new_pos in self._special:\n new_row = self.ind(new_pos)[0]\n new_col = self.ind(new_pos)[1]\n cur_row = self.ind(cur_pos)[0]\n cur_col = self.ind(cur_pos)[1]\n\n if state == \"UNFINISHED\":\n if new_pos in self._special: # Make sure that the piece it's trying to take isn't it's own\n if board[new_row][new_col] is not None:\n if self.piece_type(new_pos, board).get_color() == self._color:\n return False\n \n if new_pos in self._special: # if its in the palace\n # Checking if the movement is left or right (one column apart) from the cur_pos\n if (new_col == cur_col + 1 or new_col == cur_col - 1) and new_row == cur_row:\n return True\n # Checking if forward or backward movement is legal\n elif (new_row == cur_row - 1 or new_row == cur_row + 1) and (new_col == cur_col):\n return True\n # Checking if diagonal lines are possible\n elif cur_pos in self._corners:\n if (new_row == cur_row + 1 or new_row == cur_row - 1) and (new_col == cur_col - 1 or new_col == cur_col + 1):\n return True\n else:\n return False\n else:\n return False","def validMove(move):\r\n\r\n\tglobal tile1, tile2, tile3, tile4, tile5, tile6, tile7, tile8, tile9\r\n\r\n\ta=eval(\"tile\"+str(move)+\"==0\")\r\n\treturn a","def checkMove(move: Card, game) -> bool:\n lastMove = game.lastMove\n\n if move.number == lastMove.number:\n return True\n\n elif move.color == lastMove.color: \n return True\n\n elif move.wild: \n return True\n\n return False"],"string":"[\n \"def move_valid(move):\\n return True\",\n \"def valid_move(self, player, move):\\n return (True)\",\n \"def legal_move(self, move, state = None):\\n if state is None:\\n state = copy(self.state)\\n else:\\n state = copy(state)\\n return state[move // state.shape[0], move % state.shape[0]] == 0\",\n \"def validate_move(move):\\n if move[0] in cc.VALID_RANKS and move[1] in cc.VALID_RANKS:\\n valid = True\\n else:\\n valid = False\\n return valid\",\n \"def check_move(self, move):\\n\\n if str(move) in self.moves_made:\\n return False\\n return True\",\n \"def is_valid(self, move):\\r\\n return move > 10 and move < 89\",\n \"def test_valid_move(self, move):\\n if self.game_state[move[0]][move[1]] is not None:\\n return False\\n return True\",\n \"def is_legal_move(self, house_num):\\n return True\",\n \"def move_check(self):\\r\\n \\r\\n if not self.run:\\r\\n return False\\r\\n \\r\\n if self.get_num_legal_moves() == 0:\\r\\n SlTrace.lg(\\\"NO more legal moves!\\\", \\\"nolegalmoves\\\")\\r\\n ###return False \\r\\n \\r\\n if self.new_move:\\r\\n self.announce_player(\\\"start_move\\\")\\r\\n if SlTrace.trace(\\\"selected\\\"):\\r\\n self.list_selected(\\\"After start_move\\\")\\r\\n self.new_move = False\\r\\n player = self.get_player()\\r\\n if player is None:\\r\\n return False\\r\\n \\r\\n return True\",\n \"def _is_valid_move(self, vector, current_piece, other_piece):\\n return True\",\n \"def is_valid_move(self, move: Any) -> bool:\\n return move in self.get_possible_moves()\",\n \"def is_legal_move(self, current_player, move):\\n\\t\\tstarting_pos = move[0]\\n\\t\\tending_pos = move[1]\\n\\t\\tif ending_pos[0] not in range(self.board_size) or ending_pos[1] not in range(self.board_size):\\t# Discard any generated moves that fall off of the board\\n\\t\\t\\treturn False \\n\\t\\tif self.board.repr[starting_pos[0]][starting_pos[1]]!=self.player_symbol[current_player]:\\n\\t\\t\\tprint \\\"this should never trigger and is redundant\\\"\\n\\t\\t\\treturn False\\n\\t\\tif self.board.repr[ending_pos[0]][ending_pos[1]]!= '.':\\t# Check that landing spot is empty\\n\\t\\t\\treturn False\\n\\t\\tmiddle_pos = (starting_pos[0]-(starting_pos[0]-ending_pos[0])/2,starting_pos[1]-(starting_pos[1]-ending_pos[1])/2)\\t# Check the middle spot is the other piece - this should in theory not matter because the pieces alternate\\n\\t\\tother_player = 1 - current_player \\n\\t\\tif self.board.repr[middle_pos[0]][middle_pos[1]] != self.player_symbol[other_player]:\\n\\t\\t\\treturn False \\n\\t\\treturn True\",\n \"def is_valid_move(self, position, dest_square):\\n if self.symbol.isupper() and position.turn != 'w':\\n return False\\n elif self.symbol.islower() and position.turn != 'b':\\n return False\\n elif dest_square not in self.calculate_scope(position):\\n return False\\n else:\\n return True\",\n \"def is_valid_move(x:int, y:int,board_length) -> bool:\\n if x < 0 or y < 0 or x == board_length or y == board_length:\\n return False\\n return True\",\n \"def _isvalidmove(self, from_, to_):\\n if self.board[from_].occupant is None:\\n print(\\\"Moving from empty square\\\")\\n return False\\n piece = self.board[from_].occupant\\n\\n if piece.color != self.to_move:\\n print(\\\"Wrong color\\\")\\n return False\\n\\n if self.is_checked:\\n if piece.notation != 'K':\\n print(\\\"King is checked!\\\")\\n return False\\n\\n diff = (\\n to_cartesian(to_)[0] - to_cartesian(from_)[0],\\n to_cartesian(to_)[1] - to_cartesian(from_)[1]\\n )\\n if not piece.hopping:\\n if self.board.isblocked(from_, to_):\\n print(\\\"Move blocked by other pieces\\\")\\n return False\\n\\n if self.board[to_].occupant is not None:\\n if piece.color == self.board[to_].occupant.color:\\n print(\\\"Cannot capture friendly\\\")\\n return False\\n\\n if diff not in piece.get_captures():\\n print(\\\"Invalid piece capture\\\")\\n return False\\n\\n if diff not in piece.get_moves():\\n print(\\\"Invalid piece move\\\")\\n return False\\n\\n return True\",\n \"def is_valid_move(state, move):\\n row, col = move\\n if row not in [1, 2, 3] or col not in [1, 2, 3]:\\n print(\\\"Invalid move! Specify correct game square!\\\")\\n return False\\n if state[row-1][col-1] != '_':\\n print('Invalid move! Place your marker on a free square!')\\n return False\\n return True\",\n \"def is_move_valid(self, direction, reference_board=None):\\n # Verify a left move does not take you off the board.\\n if (direction == \\\"l\\\"):\\n if (self._current_loc.get_column() == 0):\\n return False\\n # Verify an up move does not take you off the board.\\n elif (direction == \\\"u\\\"):\\n # Verify the move does not take you off the board.\\n if (self._current_loc.get_row() == 0):\\n return False\\n # Verify a right move does not take you off the board.\\n elif (direction == \\\"r\\\"):\\n current_row = self._current_loc.get_row()\\n max_column_number = len(self._untraversed_board[current_row])\\n if self._current_loc.get_column() + 1 == max_column_number:\\n return False\\n # Verify a down move does not take you off the board.\\n elif (direction == \\\"d\\\"):\\n if self._current_loc.get_row() + 1 == len(self._untraversed_board):\\n return False\\n else:\\n assert False, \\\"Invalid move direction.\\\"\\n\\n # Get the new location for a move in the specified direction.\\n new_location = self._calculate_move_location(direction)\\n new_row = new_location.get_row()\\n new_col = new_location.get_column()\\n # Verify the space is available\\n if(reference_board is None):\\n return BoardPath._untraversed_board[new_row][new_col] != \\\"#\\\"\\n else:\\n return reference_board[new_row][new_col] != \\\"#\\\"\",\n \"def is_legal(self, move, player, board):\\r\\n if(self.is_valid(move)==False):\\r\\n return False\\r\\n if(board[move]!=core.EMPTY):\\r\\n return False\\r\\n return True\",\n \"def move(self) -> bool:\\n pass\",\n \"def any_legal_move(self, player, board):\\r\\n moves = self.legal_moves(player, board)\\r\\n #print(moves)\\r\\n return len(moves)!=0\",\n \"def valid_move(x, y):\\r\\n if [x, y] in empty_cells(board):\\r\\n return True\\r\\n else:\\r\\n return False\",\n \"def is_valid_move(self, move):\\n if type(move) == str:\\n move = int(move)\\n\\n return move in self.get_possible_moves()\",\n \"def isValidMove(self, move: Move) -> bool:\\n # TODO: How do we determine the move type?\\n # Some form of duck typing?\\n minigame_move_classes = {\\n \\\"BuyPrivateCompany\\\": \\\"BuyPrivateCompanyMove\\\",\\n \\\"BiddingForPrivateCompany\\\": \\\"BuyPrivateCompanyMove\\\",\\n }\\n return minigame_move_classes.get(self.minigame_class) == move.__class__.__name__\",\n \"def is_valid(move):\\n return isinstance(move, int) and move in Othello.squares()\",\n \"def op_move_preconditions(self):\\n\\n if(self.next_move != self.FREE):\\n return False\\n\\n return True\",\n \"def valid_move(board, row, col):\\n return board[row][col] == '-'\",\n \"def is_valid_move(self, position: Point) -> bool:\\n\\t\\tif self.tiles[position.x][position.y] == 0:\\n\\t\\t\\treturn True\\n\\t\\treturn False\",\n \"def is_valid_move(self, somerow, somecol):\\n bool_1 = self.board[somerow][somecol] != 1\\n bool_2 = self.num_queens_placed < self.size \\n bool_3 = self.attack(somerow, somecol)\\n return bool_1 and bool_2 and bool_3\",\n \"def valid_move(self, row, col):\\n if not self._game_over:\\n i_row, i_col = row-1, col-1\\n #i_row and i_col wil be used to index the board (hence the i)\\n (valid, flip_lst) = self._valid_placement(i_row, i_col)\\n #print(\\\"FOR TESTING. Tiles Flipped: \\\", flip_lst)\\n \\n if valid:\\n #Big Change: You decided to make determining validity\\n # and flipping separate operations\\n self._flip(i_row, i_col, flip_lst)\\n else:\\n print(\\\"\\\\nPlease enter a valid move!\\\")\\n return False\\n\\n if self._board_is_full():\\n self._game_over = True\\n self._set_winner() \\n \\n self._switch_turn(self._turn)\\n if not self._valid_move_exists(): #Check if the other player has any valid moves\\n print(\\\"\\\\nNo valid moves exist for {0}. {0}'s turn has been skipped\\\".format(self._turn))\\n self._switch_turn(self._turn) #Switch turn back to player before skip was determined\\n if not self._valid_move_exists(): #Check if the other player has any valid moves\\n print(\\\"No valid moves exist for {0}. {0}'s turn has been skipped\\\".format(self._turn))\\n print(\\\"No moves exist for either player. GAME OVER\\\")\\n self._game_over = True\\n self._set_winner()\\n return False\\n\\n return True\\n elif self._game_over:\\n print(\\\"The game is over. No more moves can be made!\\\")\\n #TODO: Replace this^ with an exception later?\\n return False\",\n \"def validate_move(move, player_board):\\n select_row = move.select_row\\n select_col = move.select_col\\n \\n player_board_rows = player_board.shape[0]\\n player_board_cols = player_board.shape[1]\\n \\n if select_row >= player_board_rows or select_row < 0 or \\\\\\n select_col >= player_board_cols or select_col < 0 or \\\\\\n player_board[select_row][select_col] != -1:\\n return False\\n \\n return True\",\n \"def validate_move(self, move_from, move_to, board):\\n\\n pass\",\n \"def can_move(self,direction):\\r\\n if direction in self.current_room.return_directions():\\r\\n print('move into the next room')\\r\\n # makes next room \\r\\n self.next_room(direction)\\r\\n return True\\r\\n else:\\r\\n print(\\\"Can't move that way\\\")\\r\\n return False\",\n \"def is_move_valid(move: Move, board: Board, whites_turn: bool) -> bool:\\n if out_of_bounds(move[0]) == True or out_of_bounds(move[1]) == True:\\n return False\\n \\n if move[0] == move[1]:\\n return False\\n\\n if is_current_players_piece(piece_at_position(move[0], board), False) and whites_turn == True:\\n return False\\n elif is_current_players_piece(piece_at_position(move[0], board), True) and whites_turn == False:\\n return False\\n\\n\\n if piece_at_position(move[1], board) in WHITE_PIECES and whites_turn == True:\\n return False\\n elif piece_at_position(move[1], board) in BLACK_PIECES and whites_turn == False:\\n return False\\n\\n\\n if move[1] not in get_possible_moves(move[0], board):\\n return False\\n\\n\\n test_board = board\\n test_board = update_board(test_board, move)\\n if is_in_check(test_board, True) and whites_turn == True:\\n return False\\n elif is_in_check(test_board, False) and whites_turn == False:\\n return False\\n\\n return True\",\n \"def valid_move(self, player, move):\\n if self.rounds < len(self.players):\\n if ((False in [(self.board).in_bounds(pt) for pt in move])\\n or (self.board).overlap(move)\\n or not (True in [(pt in player.corners) for pt in move])):\\n return (False)\\n else:\\n return (True)\\n\\n elif ((False in [(self.board).in_bounds(pt) for pt in move])\\n or (self.board).overlap(move)\\n or (self.board).adj(player, move)\\n or not (self.board).corner(player, move)):\\n return (False)\\n\\n else:\\n return (True)\",\n \"def check_move(board, move):\\n\\n player, spike_index, fields_to_move = Judge._validate_move(move)\\n\\n # 1. moving out of the bar\\n # 2. check if the source is of the valid player\\n # 3. check if the destination is valid\\n\\n board.set_player_perspective(player)\\n\\n # 1.\\n if spike_index == OUT_OF_BAR_SPECIAL_MOVE:\\n if board.bar[player] < 1:\\n return False\\n\\n if not board.valid_dest(fields_to_move - 1):\\n return False\\n\\n return True\\n\\n # 2.\\n if not board.valid_source(spike_index):\\n return False\\n # 3.\\n dest_spike_index = spike_index + fields_to_move\\n\\n if dest_spike_index >= len(INITIAL_SPIKES_STATE):\\n return board.all_at_home()\\n \\n return board.valid_dest(dest_spike_index)\",\n \"def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\\r\\n parsed_positions = self.parse_positions(start_pos, end_pos)\\r\\n start_row = parsed_positions[0]\\r\\n start_col = parsed_positions[1]\\r\\n end_row = parsed_positions[2]\\r\\n end_col = parsed_positions[3]\\r\\n\\r\\n if start_row != end_row and start_col != end_col: # Moving non-orthogonally\\r\\n return False\\r\\n\\r\\n if start_row == end_row: # Moving horizontally\\r\\n col_difference = end_col - start_col\\r\\n\\r\\n if col_difference > 0: # Moving to the right of the board\\r\\n for col in range(start_col + 1, end_col): # Checks if there is a piece between start_col and end_col\\r\\n if board[start_row][col].get_piece() is not None:\\r\\n return False\\r\\n # When there is no piece to impede path, check if position is empty or piece is enemy piece\\r\\n if end_piece_player_id is None or start_piece.get_player_id() != end_piece_player_id:\\r\\n return True\\r\\n\\r\\n if col_difference < 0: # Moving to the left of the board\\r\\n for col in range(start_col - 1, end_col, -1): # Checks to the left of the board\\r\\n # If there is a piece to block movement to the end_pos, return False\\r\\n if board[start_row][col].get_piece() is not None:\\r\\n return False\\r\\n if end_piece_player_id is None or start_piece.get_player_id() != end_piece_player_id:\\r\\n return True\\r\\n\\r\\n if start_col == end_col: # Moving verticially\\r\\n row_difference = end_row - start_row\\r\\n\\r\\n if row_difference > 0: # Moving down the board\\r\\n for row in range(start_row + 1, end_row):\\r\\n if board[row][start_col].get_piece() is not None: # If no piece is impeding path to end_pos\\r\\n return False\\r\\n # Checks if end_pos is empty or an enemy piece is on end_pos\\r\\n if end_piece_player_id is None or start_piece.get_player_id() != end_piece_player_id:\\r\\n return True\\r\\n\\r\\n if row_difference < 0:\\r\\n for row in range(start_row -1, end_row, -1):\\r\\n if board[row][start_col].get_piece() is not None: # If no piece is impeding path to end_pos\\r\\n return False\\r\\n # Checks if end_pos is empty or an enemy piece is on end_pos\\r\\n if end_piece_player_id is None or start_piece.get_player_id() != end_piece_player_id:\\r\\n return True\",\n \"def validate_move(self, move_from, move_to, board):\\n\\n from_coordinates = JanggiGame.translate_to_grid(move_from)\\n to_coordinates = JanggiGame.translate_to_grid(move_to)\\n from_col = from_coordinates[0]\\n from_row = from_coordinates[1]\\n to_col = to_coordinates[0]\\n to_row = to_coordinates[1]\\n\\n # a cannon cannot capture another cannon\\n if type(board[to_col][to_row]) == Cannon:\\n return False\\n\\n # if destination within the board and the move is strictly horizontal or vertical\\n if to_col in range(9) and to_row in range(10) and (to_col == from_col or to_row == from_row):\\n # if move is to the left\\n if to_col < from_col:\\n # make sure there is exactly one intervening piece that's not a cannon\\n piece_count = 0\\n for col in range(to_col + 1, from_col):\\n if type(board[col][to_row]) == Cannon:\\n return False\\n if issubclass(type(board[col][to_row]), Piece):\\n piece_count += 1\\n if piece_count == 1:\\n return True\\n # if move is to the right\\n if to_col > from_col:\\n # make sure there is exactly one intervening piece that's not a cannon\\n piece_count = 0\\n for col in range(from_col + 1, to_col):\\n if type(board[col][to_row]) == Cannon:\\n return False\\n if issubclass(type(board[col][to_row]), Piece):\\n piece_count += 1\\n if piece_count == 1:\\n return True\\n # if move is upward\\n if to_row < from_row:\\n # make sure there is exactly one intervening piece that's not a cannon\\n piece_count = 0\\n for row in range(to_row + 1, from_row):\\n if type(board[to_col][row]) == Cannon:\\n return False\\n if issubclass(type(board[to_col][row]), Piece):\\n piece_count += 1\\n if piece_count == 1:\\n return True\\n # if move is downward\\n if to_row > from_row:\\n # make sure there is exactly one intervening piece that's not a cannon\\n piece_count = 0\\n for row in range(from_row + 1, to_row):\\n if type(board[to_col][row]) == Cannon:\\n return False\\n if issubclass(type(board[to_col][row]), Piece):\\n piece_count += 1\\n if piece_count == 1:\\n return True\\n return False\\n\\n # for moving diagonally in the red palace\\n if (from_coordinates in [[3,0],[3,2],[5,0],[5,2]] and to_coordinates in [[3,0],[3,2],[5,0],[5,2]] and\\n type(board[4][1]) != Cannon and issubclass(type(board[4][1]), Piece)):\\n return True\\n\\n # for moving diagonally in the blue palace\\n if (from_coordinates in [[3,7],[3,9],[5,7],[5,9]] and to_coordinates in [[3,7],[3,9],[5,7],[5,9]] and\\n type(board[4][8]) != Cannon and issubclass(type(board[4][8]), Piece)):\\n return True\\n\\n return False\",\n \"def verify_legal_move(self, direction):\\n for b_x, b_y in self.get_block_positions(self.active_piece.FIGURE):\\n\\n if direction == \\\"LEFT\\\":\\n b_x -= 1\\n elif direction == \\\"RIGHT\\\":\\n b_x += 1\\n elif direction == \\\"DOWN\\\":\\n b_y += 1\\n else:\\n raise ValueError\\n\\n if b_x < 0 or b_x >= self.WIDTH:\\n return False\\n\\n if b_y < 0 or b_y >= self.HEIGHT:\\n return False\\n\\n if self.board[b_y][b_x] != 0:\\n return False\\n return True\",\n \"def check_illegal_move(self, player, action):\\n available_actions = self.filter_actions(player)\\n if action not in available_actions:\\n print('Illegal move! Please choose another move!')\\n return False\\n return True\",\n \"def test_check_move_with_invalid(self):\\n board = [\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\"\\\\u25cb\\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6\\n ]\\n valid = self.game.check_move(board, 4)\\n self.assertFalse(valid)\",\n \"def test_verify_move(self):\\n self._verify([self.applied_commands['move']])\",\n \"def legal_move(self, position_to, position_from):\\n\\n # Returns False if either position_to or position_from is out of bounds.\\n if self.is_out_of_bounds(position_to, position_from) is True:\\n\\n return False\\n\\n # Return False if position_from does not contain a GamePiece to move.\\n game_piece_object = self.get_game_piece_object_at_position(position_from)\\n\\n if game_piece_object is not None:\\n\\n game_piece_player_owner = game_piece_object.get_player()\\n current_player = self.get_player_turn()\\n\\n # Returns False if current player does not move out of check on current\\n # move or the move causes a check.\\n if self.remains_in_check(current_player, position_to, position_from) is True:\\n\\n return False\\n\\n # Returns True if current player wishes to pass on their move.\\n # Any position on the board will suffice, including a General's position.\\n # Tested after simulated move to ensure current_player does not remain\\n # in check. Bypasses following tests to make allowance for any position.\\n if position_to == position_from:\\n\\n return True\\n\\n else:\\n\\n # Returns False if move is out of turn and GamePiece is moved by wrong\\n # player.\\n if current_player != game_piece_player_owner:\\n\\n return False\\n\\n # Returns False if current play is to capture General.\\n # Capturing General is not allowed. Goal of game is checkmate.\\n if position_to in [self.get_general_position_red(), self.get_general_position_blue()]:\\n\\n return False\\n\\n # All JangiGame rules are handled by not allowing potential moves to which\\n # a player could move a GamePiece. These rules include elephant and horse\\n # being blocked, cannon not having proper screen or jump/capture being another\\n # cannon.\\n elif position_to not in game_piece_object.get_potential_moves():\\n\\n return False\\n\\n return True\\n\\n else:\\n\\n if position_to == position_from:\\n\\n return True\\n\\n return False\",\n \"def is_rook_move_valid(self, from_row, from_col, to_row, to_col):\\n # if not on same column or row\\n if ((from_row != to_row and from_col != to_col) or\\n (from_row == to_row and from_col == to_col)):\\n return False\\n\\n # check if any pieces are in the way of destination\\n if from_row != to_row:\\n dc = 0\\n dr = 1 if to_row - from_row > 0 else -1\\n if from_col != to_col:\\n dr = 0\\n dc = 1 if to_col - from_col > 0 else -1\\n dm = abs(to_row - from_row)\\n\\n retVal = self._any_piece_in_way(from_row, from_col, dr, dc, dm, toRow=to_row, toCol=to_col)\\n\\n # Casting: Rook invalidation\\n if retVal and (from_row == 0 or from_row == 7):\\n piece = self.board.squares[from_row][from_col]\\n piece_color = self.piece_color(piece)\\n if piece_color == \\\"white\\\":\\n if from_col == 0:\\n self.whiteCanCastleQside = False\\n elif from_col == 7:\\n self.whiteCanCastleKside = False\\n else:\\n if from_col == 0:\\n self.blackCanCastleQside = False\\n elif from_col == 7:\\n self.blackCanCastleKside = False\\n\\n return retVal\",\n \"def is_legal_move(player, row_from, col_from, row_to, col_to):\\r\\n illegal_moves = [(0, 0), (2, 0), (0, 4), (2, 4)]\\r\\n\\r\\n \\\"\\\"\\\"special moves that are move available according to diagram\\r\\n List of tuples to and from values that are not possible\\\"\\\"\\\"\\r\\n moves_not_permitted = [[(0, 2), (1, 1)], [(0, 2), (1, 3)], [(1, 1), (2, 2)], [(1, 3), (2, 2)]]\\r\\n row_diff = abs(row_from - row_to)\\r\\n col_diff = abs(col_from - col_to)\\r\\n\\r\\n if player == 'hounds':\\r\\n\\r\\n if (row_to >= 0 and row_to < 3 and col_to >= 0 and col_to < 5):\\r\\n \\\"\\\"\\\"Check if the move is not out of bounds for the board with max col range 4 and row range 3\\r\\n and then check if it is a legal move\\\"\\\"\\\"\\r\\n\\r\\n if board[row_to][col_to] == 0 and (row_to, col_to) not in illegal_moves and row_diff <= 1 and col_diff <= 1:\\r\\n \\\"\\\"\\\" Check if the position is blank.\\r\\n Then check if the move is not one of the blank places\\r\\n Then check if the row difference and column difference isn't more than 1\\r\\n \\\"\\\"\\\"\\r\\n if (col_to - col_from) < 0: # no moves to the left of the board\\r\\n return False\\r\\n\\r\\n for item in moves_not_permitted:\\r\\n if len(set([(row_from, col_from), (row_to, col_to)]).intersection(set(item))) == 2:\\r\\n \\\"\\\"\\\" If to and from co-ordinates are present in the moves_not_permitted list then return False\\\"\\\"\\\"\\r\\n return False\\r\\n else:\\r\\n pass\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n\\r\\n else:\\r\\n \\\"\\\"\\\"When player is a hare\\\"\\\"\\\"\\r\\n\\r\\n if (row_to >= 0 and row_to < 3 and col_to >= 0 and col_to < 5):\\r\\n \\\"\\\"\\\"Check if the move is not out of bounds for the board with max col range 4 and row range 3\\r\\n and then check if it is a legal move\\\"\\\"\\\"\\r\\n\\r\\n if board[row_to][col_to] == 0 and (row_to, col_to) not in illegal_moves and row_diff <= 1 and col_diff <= 1:\\r\\n \\\"\\\"\\\" Check if the position is blank.\\r\\n Then check if the move is not one of the blank places\\r\\n Then check if the row difference and column difference isn't more than 1\\\"\\\"\\\"\\r\\n\\r\\n for item in moves_not_permitted:\\r\\n if len(set([(row_from, col_from), (row_to, col_to)]).intersection(set(item))) == 2:\\r\\n \\\"\\\"\\\" If to and from co-ordinates are present in the moves_not_permitted list then return False\\\"\\\"\\\"\\r\\n return False\\r\\n else:\\r\\n pass\\r\\n return True\\r\\n\\r\\n else:\\r\\n return False\",\n \"def canMove(self):\\n\\n if self.index == len(self.path):\\n self.move = False\\n return self.move\",\n \"def is_legal_move(state, action, player, rewarding_move=False): # TODO: Update this function to an more\\n # optimized one.\\n action = action.get_action_as_dict()\\n if rewarding_move:\\n if player == state.get_next_player() == state.get_latest_player():\\n if action['action_type'] == YoteActionType.STEAL_FROM_HAND and state.in_hand[player * -1] > 0:\\n return True\\n elif action['action_type'] == YoteActionType.STEAL_FROM_BOARD:\\n opponent_piece = state.get_board().get_player_pieces_on_board(Color(player * -1))\\n if opponent_piece and action['action']['at'] in opponent_piece:\\n return True\\n return False\\n else:\\n if state.get_next_player() == player:\\n if action['action_type'] == YoteActionType.ADD and state.in_hand[player] > 0:\\n empty_cells = state.get_board().get_all_empty_cells()\\n if empty_cells and action['action']['to'] in empty_cells:\\n return True\\n elif action['action_type'] == YoteActionType.MOVE:\\n if state.get_board().get_cell_color(action['action']['at']) == Color(player):\\n effective_moves = YoteRules.get_effective_cell_moves(state, action['action']['at'], player)\\n if effective_moves and action['action']['to'] in effective_moves:\\n return True\\n return False\\n return False\",\n \"def check_move(self, x, y):\\n try:\\n return self.map[self.y+y][self.x+x] == \\\" \\\" or [self.x+x, self.y+y] == self.end_pos\\n except IndexError:\\n return False\",\n \"def can_move(self, side, number_of_turns):\\n return True\",\n \"def any_legal_move(player, board):\\n return any(Othello.is_legal(sq, player, board) for sq in Othello.squares())\",\n \"def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\\r\\n parsed_positions = self.parse_positions(start_pos, end_pos)\\r\\n start_row = parsed_positions[0]\\r\\n start_col = parsed_positions[1]\\r\\n end_row = parsed_positions[2]\\r\\n end_col = parsed_positions[3]\\r\\n\\r\\n # Case for Red's side\\r\\n if start_piece.get_player_id() == 'r':\\r\\n if not (3 <= end_col <= 5 and 0 <= end_row <= 2): # Returns False when is to move outside the palace\\r\\n return False\\r\\n else:\\r\\n if abs(start_col - end_col) == 1 and abs(start_row - end_row) == 1: # Checks if end_pos forces a move diagonally\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n\\r\\n # Case for Black's side\\r\\n else:\\r\\n if not (3 <= end_col <= 5 and 7 <= end_row <= 9): # Returns False when is to move outside the palace\\r\\n return False\\r\\n else:\\r\\n if abs(start_col - end_col) == 1 and abs(start_row - end_row) == 1: # Checks if end_pos forces a move diagonally\\r\\n return True\\r\\n else:\\r\\n return False\",\n \"def _valid_move_exists(self):\\n lst = []\\n for i_row in range(self._num_rows):\\n for i_col in range(self._num_cols):\\n if self._valid_placement(i_row, i_col)[0]:\\n lst.append((i_row, i_col))\\n\\n return lst != [] #If lst != [], then the list has elements -> valid move(s) exist\",\n \"def validate_move(board: list, character: dict, direction: str) -> bool:\\n if direction.strip().upper() == \\\"N\\\":\\n return (character[\\\"Position\\\"][0] - 1, character[\\\"Position\\\"][1]) in board\\n elif direction.strip().upper() == \\\"S\\\":\\n return (character[\\\"Position\\\"][0] + 1, character[\\\"Position\\\"][1]) in board\\n elif direction.strip().upper() == \\\"W\\\":\\n return (character[\\\"Position\\\"][0], character[\\\"Position\\\"][1] - 1) in board\\n elif direction.strip().upper() == \\\"E\\\":\\n return (character[\\\"Position\\\"][0], character[\\\"Position\\\"][1] + 1) in board\\n else:\\n print(\\\"Please enter only directions shown above\\\")\\n return False\",\n \"def is_moving(self) -> bool:\\n return self.orders and self.orders[0].ability.id is AbilityId.MOVE\",\n \"def valid_move(self, stone_color, index):\\n if self.get(index) is not None:\\n print(\\\"Invalid move - Space it occupied\\\")\\n return False\\n elif self.is_suicide(stone_color, index):\\n print(\\\"Invalid move - Suicide\\\")\\n return False\\n else:\\n return True\",\n \"def legal_move(marker, x, y, direction):\\n # first if statement determines the directions\\n # second if statement checks if the \\\"potential move\\\" is within the index\\n if direction == \\\"N\\\":\\n if 0 <= y-2 < len(marker):\\n return marker[y-2][x] == marker[y-1][x] == '*'\\n if direction == \\\"S\\\":\\n if 0 <= y+2 < len(marker):\\n return marker[y+2][x] == marker[y+1][x] == '*'\\n if direction == \\\"W\\\":\\n if 0 <= x-2 < len(marker[0]):\\n return marker[y][x-2] == marker[y][x-1] == '*'\\n if direction == \\\"E\\\":\\n if 0 <= x+2 < len(marker[0]):\\n return marker[y][x+2] == marker[y][x+1] == '*'\\n return False\",\n \"def makeMove(self, _pos, _check_legality=True):\\n\\n # Check legality is an argument mainly for testing purposes; not for live gameplay.\\n if _check_legality:\\n legality = self.board.getMoveLegality(self, _pos)\\n is_legal_move, is_capturing = legality['is_legal_move'], legality['is_capturing']\\n if not is_legal_move:\\n # Will need to update this line with interface update.\\n # exit(\\\"ILLEGAL MOVE of {} at {}\\\".format(self.color, _pos))\\n return 'illegal'\\n else:\\n # _is_capturing is necessary because of the not too often situation of a move with\\n # no liberties, but is legal because it's capturing.\\n if is_capturing: self.board.playerMakesMove(self, _pos, _is_capturing=True)\\n else: self.board.playerMakesMove(self, _pos)\\n else:\\n self.board.playerMakesMove(self, _pos)\",\n \"def can_move(self):\\n return self.movement\",\n \"def _is_valid_move(self, vector, current_piece, other_piece):\\n # If direction is forward and the space is non-empty, break\\n if vector[0] == 0 and other_piece != \\\"empty\\\":\\n return False\\n # If direction is diagonal and space is empty, break\\n if vector[0] != 0 and other_piece == \\\"empty\\\":\\n return False\\n # If moving by 2 spaces, check if in starting row\\n if vector[1] == 2 and current_piece.position[1] != 1:\\n return False\\n if vector[1] == -2 and current_piece.position[1] != 6:\\n return False\\n\\n return True\",\n \"def LegalMove(self, pos):\\n\\n return (0 <= pos <= BOARD_SIZE) and (self.state[pos] == EMPTY)\",\n \"def validate_move(coordinates: dict, character_dict: dict, user_input: str) -> bool:\\n new_coordinate = get_new_coordinate(x_y_coordinate=character_dict, move_direction=user_input)\\n return new_coordinate in coordinates\",\n \"def _ispinnedmove(self, from_, to_):\\n return False\",\n \"def move_is_valid(self, pos):\\n\\n if (not isinstance(pos, tuple) or len(pos) != 2 or \\n not isinstance(pos[0], int) or not isinstance(pos[1], int)):\\n return False\\n y, x = pos\\n if (y >= 0 and y < self.size and x >= 0 and x < self.size and \\n self.board[pos] == HexBoard.EMPTY):\\n return True\\n else:\\n return False\",\n \"def allow_to_move(self, direction, row, column):\\n if self.valid_coverage_cell(row, column):\\n if self.collision(direction) is False and \\\\\\n self.cov_grid[row][column] == NOT_VISITED:\\n return True\\n else:\\n return False\",\n \"def CheckMove(self,move):\\n\\t\\tif(move=='w'):\\n\\t\\t\\tif(self.x==0):\\n\\t\\t\\t\\treturn 0\\n\\t\\t\\treturn 1\\n\\t\\telif(move=='s'):\\n\\t\\t\\tif(self.x==15):\\n\\t\\t\\t\\treturn 0\\n\\t\\t\\treturn 1\\n\\t\\telif(move=='d'):\\n\\t\\t\\tif(self.y==35):\\n\\t\\t\\t\\treturn 0\\n\\t\\t\\treturn 1\\n\\t\\telif(move=='a'):\\n\\t\\t\\tif(self.y==0):\\n\\t\\t\\t\\treturn 0\\n\\t\\t\\treturn 1\",\n \"def is_move_valid(self, from_row, from_col, to_row, to_col):\\n # check is taking own piece?\\n if self._is_taking_own_piece(from_row, from_col, to_row, to_col):\\n return False\\n\\n piece = self.board.squares[from_row][from_col]\\n if piece == ChessPiece.W_ROOK or piece == ChessPiece.B_ROOK:\\n return self.is_rook_move_valid(from_row, from_col,\\n to_row, to_col)\\n if piece == ChessPiece.W_KNIGHT or piece == ChessPiece.B_KNIGHT:\\n return self.is_knight_move_valid(from_row, from_col,\\n to_row, to_col)\\n if piece == ChessPiece.W_BISHOP or piece == ChessPiece.B_BISHOP:\\n return self.is_bishop_move_valid(from_row, from_col,\\n to_row, to_col)\\n if piece == ChessPiece.W_QUEEN or piece == ChessPiece.B_QUEEN:\\n return self.is_queen_move_valid(from_row, from_col,\\n to_row, to_col)\\n if piece == ChessPiece.W_KING or piece == ChessPiece.B_KING:\\n return self.is_king_move_valid(from_row, from_col,\\n to_row, to_col)\\n if piece == ChessPiece.W_PAWN or piece == ChessPiece.B_PAWN:\\n return self.is_pawn_move_valid(from_row, from_col,\\n to_row, to_col)\",\n \"def is_knight_move_valid(self, from_row, from_col, to_row, to_col):\\n # check for valid move\\n if ((abs(from_row - to_row) == 1 and abs(from_col - to_col) == 2) or\\n (abs(from_row - to_row) == 2 and abs(from_col - to_col) == 1)):\\n return True\\n return False\",\n \"def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\\r\\n parsed_positions = self.parse_positions(start_pos, end_pos)\\r\\n\\r\\n start_row = parsed_positions[0]\\r\\n start_col = parsed_positions[1]\\r\\n end_row = parsed_positions[2]\\r\\n end_col = parsed_positions[3]\\r\\n count = 0 # Count will track how many pieces are between start and end_pos\\r\\n\\r\\n if start_row != end_row and start_col != end_col: # Moving diagonally\\r\\n return False\\r\\n\\r\\n # If cannon moves to an empty position\\r\\n # if end_piece_player_id is None:\\r\\n\\r\\n if start_row == end_row: # Moving horizontally\\r\\n col_difference = end_col - start_col\\r\\n\\r\\n if col_difference > 0: # Moving to the right of the board\\r\\n for col in range(start_col + 1, end_col): # Checks if there is a piece between start_col and end_col\\r\\n if board[start_row][col].get_piece() is not None:\\r\\n count += 1\\r\\n\\r\\n if col_difference < 0: # Moving to the left of the board\\r\\n for col in range(start_col - 1, end_col, -1): # Checks to the left of the board\\r\\n # If there is a piece to block movement to the end_pos, return False\\r\\n if board[start_row][col].get_piece() is not None:\\r\\n count += 1\\r\\n\\r\\n if start_col == end_col: # Moving vertically\\r\\n row_difference = end_row - start_row\\r\\n\\r\\n if row_difference > 0: # Moving down the board\\r\\n for row in range(start_row + 1, end_row):\\r\\n if board[row][start_col].get_piece() is not None: # If no piece is impeding path to end_pos\\r\\n count += 1\\r\\n\\r\\n\\r\\n if row_difference < 0: # Moving up the board\\r\\n for row in range(start_row -1, end_row, -1):\\r\\n if board[row][start_col].get_piece() is not None: # If no piece is impeding path to end_pos\\r\\n count += 1\\r\\n\\r\\n # 1 piece between start_pos and end_pos and end_pos contains a chess piece\\r\\n if count == 1 and end_piece_player_id is not None:\\r\\n return True\\r\\n # end_pos has no piece and there are no pieces to impede path\\r\\n elif end_piece_player_id is None and count == 0:\\r\\n return True\\r\\n # Returns False for all other scenarios\\r\\n else:\\r\\n return False\",\n \"def is_valid_move(self, board, fieldy, fieldx):\\n if isinstance(board[fieldy][fieldx], Piece):\\n return False\\n if self.posy - fieldy == self.direction and abs(self.posx - fieldx) == 1:\\n return True\\n else:\\n return False\",\n \"def validate_move(board: list, character: list, direction: str) -> bool:\\n max_x_y_coordinates = board[-1]\\n valid_options = []\\n if character[1] < max_x_y_coordinates[0]:\\n valid_options.append(\\\"d\\\")\\n if character[1] > 0:\\n valid_options.append(\\\"a\\\")\\n if character[0] < max_x_y_coordinates[1]:\\n valid_options.append(\\\"s\\\")\\n if character[0] > 0:\\n valid_options.append(\\\"w\\\")\\n if direction in valid_options:\\n return True\\n else:\\n return False\",\n \"def test_legalMoveP_backwards_goose(self):\\n rules_obj = rules.Rules(test_mode=True)\\n board = gamenode.GameNode()\\n startCoordinate = coordinate.Coordinate(3, 1)\\n endCoordinate = coordinate.Coordinate(3, 2)\\n board.setState(startCoordinate, types.GOOSE)\\n actual_result = rules_obj.legalMoveP(board,\\n startCoordinate,\\n endCoordinate)\\n expected_result = False\\n self.assertEqual(actual_result, expected_result)\",\n \"def can_move(self):\\r\\n for wall in self.app.walls:\\r\\n if vec(self.grid_pos+self.direction) == wall:\\r\\n return False\\r\\n return True\",\n \"def make_move(self, **move_data: typing.Dict[str, typing.Any]) -> bool:\\n raise NotImplementedError\",\n \"def can_move(self, relative_location: RelativeCoord) -> bool:\\n\\n return self.moves.can_move(relative_location)\",\n \"def move_atoms(self):\\n return self.abivars.ionmov != 0\",\n \"def test_valid_move():\\n\\n board = Board()\\n\\n # a col outside the width of the board should be false\\n assert board.valid_move(board.get_grid_size()[1] + 1) is False\\n\\n # only positive cols should be considered for a move\\n assert board.valid_move(-2) is False\\n\\n # since board is empty all cols should have moves\\n for i in range(board.get_grid_size()[1]):\\n assert board.valid_move(i) is True\\n\\n # if a col is full no move can be made\\n for i in range(board.get_grid_size()[1]):\\n if i % 2 == 0:\\n board.move(board.P1, 0)\\n else:\\n board.move(board.P2, 0)\\n\\n \\\"\\\"\\\"\\n board now looks like this...\\n \\n 0 1 2 3 4 5 6 \\n +-+-+-+-+-+-+-+\\n 0|O|-|-|-|-|-|-|0\\n +-+-+-+-+-+-+-+\\n 1|X|-|-|-|-|-|-|1\\n +-+-+-+-+-+-+-+\\n 2|O|-|-|-|-|-|-|2\\n +-+-+-+-+-+-+-+\\n 3|X|-|-|-|-|-|-|3\\n +-+-+-+-+-+-+-+\\n 4|O|-|-|-|-|-|-|4\\n +-+-+-+-+-+-+-+\\n 5|X|-|-|-|-|-|-|5\\n +-+-+-+-+-+-+-+\\n 0 1 2 3 4 5 6 \\n\\n \\\"\\\"\\\"\\n assert board.valid_move(0) is False\",\n \"def make_legal_move(move, board, start, end, move_number, en_passant_square, king_w, king_b, rook_w_l, rook_w_r,\\n rook_b_l,\\n rook_b_r, promotion_piece):\\n # this function should have essentially what i had in main at first without making the move\\n test_board = board.copy()\\n valid_move = False\\n piece = find_piece(board, start)\\n end_piece = find_piece(board, end)\\n\\n if switch_player(move_number): # for whites move\\n if (65 <= ord(piece) <= 90) and (validate_move(board, end, move_number)):\\n if piece == \\\"P\\\":\\n if pawn(board, start, end, move_number):\\n if end[0] == 8:\\n promotion(test_board, start, end, promotion_piece)\\n if not check(test_board, move_number):\\n retract_move(test_board, start, end, end_piece)\\n promotion(board, start, end, promotion_piece)\\n return True\\n else:\\n valid_move = False\\n else:\\n valid_move = True\\n else:\\n if can_en_passant(board, en_passant_square, end, start, move_number):\\n execute_enpassant(test_board, start, end, move_number)\\n if not check(test_board, move_number):\\n retract_move(test_board, start, end, end_piece)\\n execute_enpassant(board, start, end, move_number)\\n return True\\n else:\\n return False\\n elif piece == \\\"K\\\":\\n if king(start, end):\\n if controlled_squares(board, move_number, end):\\n valid_move = True\\n elif piece == \\\"N\\\":\\n if knight(start, end):\\n valid_move = True\\n elif piece == \\\"B\\\":\\n if bishop(board, start, end):\\n valid_move = True\\n elif piece == \\\"Q\\\":\\n if queen(board, start, end):\\n valid_move = True\\n elif piece == \\\"R\\\":\\n if rook(board, start, end):\\n valid_move = True\\n else:\\n valid_move = False\\n if valid_move:\\n update_board(test_board, start, end)\\n if not check(test_board, move_number):\\n retract_move(test_board, start, end, end_piece)\\n update_board(board, start, end)\\n return True\\n else:\\n retract_move(test_board, start, end, end_piece)\\n print(\\\"Illegal Move\\\")\\n return False\\n if not switch_player(move_number):\\n if (97 <= ord(piece) <= 122) and validate_move(board, end, move_number):\\n if piece == \\\"p\\\":\\n if pawn(board, start, end, move_number):\\n if end[0] == 1:\\n promotion(test_board, start, end, promotion_piece)\\n if not check(test_board, move_number):\\n retract_move(test_board, start, end, end_piece)\\n promotion(board, start, end, promotion_piece)\\n return True\\n else:\\n valid_move = False\\n else:\\n valid_move = True\\n else:\\n if can_en_passant(board, en_passant_square, end, start, move_number):\\n execute_enpassant(test_board, start, end, move_number)\\n if not check(test_board, move_number):\\n retract_move(test_board, start, end, end_piece)\\n execute_enpassant(board, start, end, move_number)\\n return True\\n else:\\n valid_move = False\\n elif piece == \\\"k\\\":\\n if king(start, end):\\n if controlled_squares(board, move_number, end):\\n valid_move = True\\n elif piece == \\\"n\\\":\\n if knight(start, end):\\n valid_move = True\\n elif piece == \\\"b\\\":\\n if bishop(board, start, end):\\n valid_move = True\\n elif piece == \\\"q\\\":\\n if queen(board, start, end):\\n valid_move = True\\n elif piece == \\\"r\\\":\\n if rook(board, start, end):\\n valid_move = True\\n else:\\n valid_move = False\\n if valid_move:\\n update_board(test_board, start, end)\\n if not check(test_board, move_number):\\n retract_move(test_board, start, end, end_piece)\\n update_board(board, start, end)\\n return True\\n else:\\n retract_move(test_board, start, end, end_piece)\\n print(\\\"Illegal Move\\\")\\n return False\",\n \"def is_valid_move(self, side_color, x, y):\\n return self.disc_place(side_color, x, y, check_only=True)\",\n \"def test_check_move_with_barely_valid(self):\\n board = [\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\"\\\\u25cb\\\"] * 5 + [\\\" \\\"],\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6\\n ]\\n valid = self.game.check_move(board, 4)\\n self.assertTrue(valid)\",\n \"def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\\r\\n parsed_positions = self.parse_positions(start_pos, end_pos)\\r\\n start_row = parsed_positions[0]\\r\\n start_col = parsed_positions[1]\\r\\n end_row = parsed_positions[2]\\r\\n end_col = parsed_positions[3]\\r\\n\\r\\n # Case for Red\\r\\n if start_piece.get_player_id() == 'r':\\r\\n\\r\\n # Red soldier hasn't crossed river\\r\\n if 3 <= start_row <= 4:\\r\\n if end_row - start_row == 1 and start_col == end_col:\\r\\n return True\\r\\n\\r\\n # Red solider has crossed river\\r\\n else:\\r\\n # Checks if movement forces a diagonal\\r\\n if end_row - start_row == 1 and abs(end_col - start_col) == 1:\\r\\n return False\\r\\n # Rules out the diagonal and checks if movement is valid\\r\\n elif end_row - start_row == 1 or abs(end_col - start_col) == 1:\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n\\r\\n # Case for Black\\r\\n else:\\r\\n # Black soldier hasn't crossed river\\r\\n if 5 <= start_row <= 6:\\r\\n if end_row - start_row == -1 and start_col == end_col:\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n\\r\\n # Black soldier has crossed the river\\r\\n else:\\r\\n # Checks if movement forces a diagonal\\r\\n if end_row - start_row == -1 and abs(end_col - start_col) == 1:\\r\\n return False\\r\\n # Rules out the diagonal and checks if movement is valid\\r\\n elif end_row - start_row == -1 or abs(end_col - start_col) == 1:\\r\\n return True\\r\\n\\r\\n else:\\r\\n return False\",\n \"def check_valid_move(grid: np.ndarray, current_position: tuple, move: tuple) -> bool:\\n # getting coordinates for moved position\\n moved_position = tuple(np.add(current_position, move))\\n\\n def compare_coordinates(a: tuple, b: tuple) -> bool:\\n \\\"\\\"\\\"\\n Helper function to compare coordinates\\n Checks if a is smaller than b\\n \\\"\\\"\\\"\\n return all(np.array(a) < np.array(b))\\n\\n # checking if coordinates are inside the array (between (0,0) and (N,N))\\n if compare_coordinates((0, 0), moved_position) and compare_coordinates(moved_position, grid.shape):\\n # checking if the coordinates are not on the obstacle\\n if grid[moved_position] == 'x':\\n return False\\n else:\\n return True\\n else:\\n return False\",\n \"def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\\r\\n parsed_positions = self.parse_positions(start_pos, end_pos)\\r\\n\\r\\n start_row = parsed_positions[0]\\r\\n start_col = parsed_positions[1]\\r\\n end_row = parsed_positions[2]\\r\\n end_col = parsed_positions[3]\\r\\n\\r\\n # For horizontal movements for the horse\\r\\n if abs(end_row - start_row) == 1 and abs(end_col - start_col) == 2:\\r\\n # For movement going left\\r\\n if end_col - start_col == -2:\\r\\n if board[start_row][start_col-1].get_piece() is None: # Checks if horse is blocked\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n # For movement going right\\r\\n else:\\r\\n if board[start_row][start_col + 1].get_piece() is None: # Checks if horse is blocked\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n\\r\\n # For vertical movement for the horse\\r\\n elif abs(end_row - start_row) == 2 and abs(end_col - start_col) == 1:\\r\\n # For movement going down\\r\\n if end_row - start_row == 2:\\r\\n if board[start_row + 1][start_col].get_piece() is None:\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n # For movement going up\\r\\n if end_row - start_row == -2:\\r\\n if board[start_row - 1][start_col].get_piece() is None:\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n\\r\\n # Returns False if invalid end_pos for the horse\\r\\n else:\\r\\n return False\",\n \"def is_legal(move, player, board):\\n hasbracket = lambda direction: Othello.find_bracket(move, player, board, direction)\\n return board[move] == EMPTY and any(map(hasbracket, DIRECTIONS))\",\n \"def is_legal_move(self, start_pos, end_pos, start_piece, end_piece_player_id, board):\\r\\n \\\"\\\"\\\"General moves should only move +1 or -1 from its starting row and col\\\"\\\"\\\"\\r\\n\\r\\n # Checks for legality if end position contains a piece and it does not attack own side's piece\\r\\n parsed_positions = self.parse_positions(start_pos, end_pos)\\r\\n start_row = parsed_positions[0]\\r\\n start_col = parsed_positions[1]\\r\\n end_row = parsed_positions[2]\\r\\n end_col = parsed_positions[3]\\r\\n\\r\\n # Case for red General\\r\\n if start_piece.get_player_id() == 'r': # Start piece is guaranteed to contain a piece, binds red to the palace\\r\\n if 3 <= end_col <= 5 and 0 <= end_row <= 2:\\r\\n if abs(start_col - end_col) >= 1 and abs(start_row - end_row) >= 1:\\r\\n return False\\r\\n else:\\r\\n return True\\r\\n else:\\r\\n return False\\r\\n # Case for black General\\r\\n else:\\r\\n if 3 <= end_col <= 5 and 7 <= end_row <= 9: # Binds end_pos to the palace\\r\\n if abs(start_col - end_col) == 1 and abs(start_row - end_row) == 1: # Guarantees that diagonal movements will return false\\r\\n return False\\r\\n else:\\r\\n return True\\r\\n else:\\r\\n return False\",\n \"def validate_movement(self, piece, from_col, from_row, to_col, to_row):\\n col_diff = abs(ord(from_col) - ord(to_col))\\n row_diff = abs(from_row - to_row)\\n\\n # For any piece, it must actually move...\\n if col_diff == 0 and row_diff == 0:\\n return False\\n # ...and there must be empty spaces in between the from/to squares (when on a column, row, or diagonal)\\n if not self.validate_empty_between(from_col, from_row, to_col, to_row):\\n return False\\n\\n # White pawn\\n if piece == 'P':\\n if col_diff == 1 and (to_row - from_row == 1):\\n # Can move diagonally up one square, if taking another piece in that square or by en-passant\\n return self.piece_colour(to_col, to_row) == 'B' \\\\\\n or self.is_en_passant(from_col, from_row, to_col, to_row)\\n elif col_diff != 0:\\n # Otherwise, it can't change columns\\n return False\\n elif from_row == 2:\\n # From initial position, can go up one or two rows (but can't take a piece)\\n return (to_row == 3 or to_row == 4) and self.get_square(to_col, to_row) == ' '\\n else:\\n # Otherwise, can only move up one row (but can't take a piece)\\n return to_row - from_row == 1 and self.get_square(to_col, to_row) == ' '\\n # Black pawn\\n elif piece == 'p':\\n if col_diff == 1 and (from_row - to_row == 1):\\n # Can move diagonally down one square, if taking another piece in that square or by en-passant\\n return self.piece_colour(to_col, to_row) == 'W' \\\\\\n or self.is_en_passant(from_col, from_row, to_col, to_row)\\n elif col_diff != 0:\\n # Otherwise, it can't change columns\\n return False\\n elif from_row == 7:\\n # From initial position, can go down one or two rows (but can't take a piece)\\n return (to_row == 6 or to_row == 5) and self.get_square(to_col, to_row) == ' '\\n else:\\n # Otherwise, can only move down one row (but can't take a piece)\\n return from_row - to_row == 1 and self.get_square(to_col, to_row) == ' '\\n # Rook\\n elif piece.lower() == 'r':\\n # Must remain in same column or same row\\n return col_diff == 0 or row_diff == 0\\n # Knight\\n elif piece.lower() == 'n':\\n # Jumps in a 2+1 pattern\\n return (col_diff == 2 and row_diff == 1) or (col_diff == 1 and row_diff == 2)\\n # Bishop\\n elif piece.lower() == 'b':\\n # Moves along diagonals\\n return col_diff == row_diff\\n # Queen\\n elif piece.lower() == 'q':\\n # Can move along columns, rows, or diagonals\\n return col_diff == 0 or row_diff == 0 or col_diff == row_diff\\n # King\\n elif piece.lower() == 'k':\\n # Can move a single square in any direction\\n if not(0 <= col_diff <= 1) or not(0 <= row_diff <= 1):\\n return False\\n\\n # But not next to the other king\\n other_king = 'k' if piece.isupper() else 'K'\\n # Get valid border squares\\n border_squares = list(filter(\\n lambda b_square: 'a' <= b_square[0] <= 'f' and 1 <= b_square[1] <= 8,\\n [\\n (chr(ord(to_col) - 1), to_row - 1), (to_col, to_row - 1), (chr(ord(to_col) + 1), to_row - 1),\\n (chr(ord(to_col) - 1), to_row), (to_col, to_row), (chr(ord(to_col) + 1), to_row),\\n (chr(ord(to_col) - 1), to_row + 1), (to_col, to_row + 1), (chr(ord(to_col) + 1), to_row + 1)\\n ]\\n ))\\n # Check for the other king\\n for square in border_squares:\\n if self.get_square(square[0], square[1]) == other_king:\\n return False\\n\\n return True\",\n \"def isLegalMove(self, column, state):\\n \\n for i in range(6):\\n if state[i][column] == ' ':\\n # once we find the first empty, we know it's a legal move\\n return True\\n \\n # if we get here, the column is full\\n return False\",\n \"def validate_move(self, move_from, move_to, board):\\n\\n from_coordinates = JanggiGame.translate_to_grid(move_from)\\n to_coordinates = JanggiGame.translate_to_grid(move_to)\\n from_col = from_coordinates[0]\\n from_row = from_coordinates[1]\\n to_col = to_coordinates[0]\\n to_row = to_coordinates[1]\\n\\n # if destination within the board\\n if (to_col in range(9) and to_row in range(10) and\\n # and the move is 1 up/down/left/right (with no other piece here) and then 1 farther out diagonally\\n ((to_row - from_row == -2 and abs(to_col - from_col) == 1 and board[from_col][from_row - 1] == '') or\\n (to_row - from_row == 2 and abs(to_col - from_col) == 1 and board[from_col][from_row + 1] == '') or\\n (to_col - from_col == -2 and abs(to_row - from_row) == 1 and board[from_col - 1][from_row] == '') or\\n (to_col - from_col == 2 and abs(to_row - from_row) == 1 and board[from_col + 1][from_row] == '')\\n )\\n ):\\n return True\\n else:\\n return False\",\n \"def no_more_move(self):\\n if (self.p_no_move + self.c_no_move == 2):\\n return True\\n return False\",\n \"def check4move(st, selected_unit, direction):\\n return 1\",\n \"def validate_move(self, move_from, move_to, board):\\n\\n from_coordinates = JanggiGame.translate_to_grid(move_from)\\n to_coordinates = JanggiGame.translate_to_grid(move_to)\\n from_col = from_coordinates[0]\\n from_row = from_coordinates[1]\\n to_col = to_coordinates[0]\\n to_row = to_coordinates[1]\\n\\n # if destination within the board and the move is strictly horizontal or vertical\\n if to_col in range(9) and to_row in range(10) and (to_col == from_col or to_row == from_row):\\n # if move is to the left\\n if to_col < from_col:\\n # make sure no other piece lies between to and from\\n for col in range(to_col + 1, from_col):\\n if board[col][to_row] != '':\\n return False\\n return True\\n # if move is to the right\\n if to_col > from_col:\\n # make sure no other piece lies between to and from\\n for col in range(from_col + 1, to_col):\\n if board[col][to_row] != '':\\n return False\\n return True\\n # if move is upward\\n if to_row < from_row:\\n # make sure no other piece lies between to and from\\n for row in range(to_row + 1, from_row):\\n if board[to_col][row] != '':\\n return False\\n return True\\n # if move is downward\\n if to_row > from_row:\\n # make sure no other piece lies between to and from\\n for row in range(from_row + 1, to_row):\\n if board[to_col][row] != '':\\n return False\\n return True\\n\\n return False\\n\\n # if moving along the diagonals in the red palace\\n if from_coordinates in [[3,0],[3,2],[5,0],[5,2]] and to_coordinates in [[3,0],[3,2],[5,0],[5,2]] and board[4][1] == '':\\n return True\\n if from_coordinates in [[3,0],[3,2],[5,0],[5,2]] and to_coordinates == [4,1]:\\n return True\\n if from_coordinates == [4,1] and to_coordinates in [[3,0],[3,2],[5,0],[5,2]]:\\n return True\\n\\n # if moving along the diagonals in the blue palace\\n if from_coordinates in [[3,7],[3,9],[5,7],[5,9]] and to_coordinates in [[3,7],[3,9],[5,7],[5,9]] and board[4][8] == '':\\n return True\\n if from_coordinates in [[3,7],[3,9],[5,7],[5,9]] and to_coordinates == [4,8]:\\n return True\\n if from_coordinates == [4,8] and to_coordinates in [[3,7],[3,9],[5,7],[5,9]]:\\n return True\\n\\n return False\",\n \"def checkLegalMove(self, initialPosition, destinationPosition, colorIndex):\\n checkColor = self.grid.REPRESENTATION[colorIndex]\\n otherColor = self.grid.REPRESENTATION[1-colorIndex]\\n emptyColor = self.grid.REPRESENTATION[2]\\n if self.grid[initialPosition] != checkColor:\\n print 'The piece you are trying to move is not yours! Please reselect your move.'\\n return False\\n if self.grid[destinationPosition] != emptyColor:\\n print 'The destination position of your move is not empty! Please reselect your move.'\\n return False\\n if initialPosition == destinationPosition:\\n print 'The initial and destination position of your move are the same. Please reselect your move.'\\n return False\\n\\n if initialPosition[0] == destinationPosition[0]:\\n x = initialPosition[0]\\n if (destinationPosition[1] - initialPosition[1]) %2 != 0:\\n print 'Invalid move! Please reselect your move.'\\n return False\\n if initialPosition[1] < destinationPosition[1]:\\n for i in range(initialPosition[1]+1, destinationPosition[1], 2):\\n if self.grid[(x, i)] != otherColor or self.grid[(x, i+1)] != emptyColor:\\n print 'Invalid move! Please reselect your move.'\\n return False\\n return True\\n else:\\n for i in range(initialPosition[1]-1, destinationPosition[1], -2):\\n if self.grid[(x, i)] != otherColor or self.grid[(x, i-1)] != emptyColor:\\n print 'Invalid move! Please reselect your move.'\\n return False\\n return True\\n elif initialPosition[1] == destinationPosition[1]:\\n y = initialPosition[1]\\n if (destinationPosition[0] - initialPosition[0])%2 != 0:\\n print 'Invalid move! Please reselect your move.'\\n return False\\n if initialPosition[0] < destinationPosition[0]:\\n for i in range(initialPosition[0]+1, destinationPosition[0], 2):\\n if self.grid[(i, y)] != otherColor or self.grid[(i+1, y)] != emptyColor:\\n print 'Invalid move! Please reselect your move.'\\n return False\\n return True\\n else:\\n for i in range(initialPosition[0]-1, destinationPosition[0], -2):\\n if self.grid[(i, y)] != otherColor or self.grid[(i-1, y)] != emptyColor:\\n print 'Invalid move! Please reselect your move.'\\n return False\\n return True\\n # make turns\\n print 'Making turns is invalid move! Please reselect your move.'\\n return False\",\n \"def canMove(self, direction, robot, newPosX, newPosY):\\n result = False\\n if (newPosY < 0 or newPosY > len(self.map)):\\n print (\\\"Déplacement impossible\\\")\\n elif (newPosX < 0 or newPosX > len(self.map[newPosY])):\\n print (\\\"Déplacement impossible\\\")\\n else:\\n if (self.isThereWallInDirection(direction, robot, \\\\\\n newPosX, newPosY)):\\n print(\\\"Déplacement impossible (mur sur le chemin)\\\")\\n result = False\\n else:\\n car = self.map[newPosY][newPosX]\\n logging.info(\\\"self.map[{}]={}\\\".format(newPosY, \\\\\\n self.map[newPosY]))\\n logging.info(\\\"new coord X={} : Y={} :: {}\\\".\\\\\\n format(newPosX, newPosY, car))\\n if (car == \\\"O\\\"):\\n print(\\\"Déplacement impossible (mur)\\\")\\n else:\\n logging.info(\\\"Déplacement possible\\\")\\n result = True\\n return result\",\n \"def valid_bool(self):\\n return bool(self.piece.validate_move(self.board, self))\",\n \"def validBoard():\\r\\n\\r\\n\\tglobal move1, move2\\r\\n\\r\\n\\tif move1==move2 or move1-move2==1:\\r\\n\\t\\treturn True\\r\\n\\telse:\\r\\n\\t\\treturn False\",\n \"def has_moved(self):\\n return self.move_count > 0\",\n \"def check_move(self, y, x):\\n return 0 <= y < len(self.maze) \\\\\\n and 0 <= x < len(self.maze[y]) \\\\\\n and self.maze[y][x] != \\\"#\\\"\",\n \"def test_check_move_with_valid(self):\\n board = [\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6,\\n [\\\"\\\\u25cb\\\"] + [\\\" \\\"] * 5,\\n [\\\" \\\"] * 6,\\n [\\\" \\\"] * 6\\n ]\\n valid = self.game.check_move(board, 3)\\n self.assertTrue(valid)\",\n \"def validate_move(self, move_from, move_to, board):\\n\\n from_coordinates = JanggiGame.translate_to_grid(move_from)\\n to_coordinates = JanggiGame.translate_to_grid(move_to)\\n from_col = from_coordinates[0]\\n from_row = from_coordinates[1]\\n to_col = to_coordinates[0]\\n to_row = to_coordinates[1]\\n\\n # for red soldiers (who can only move downward or to the side)\\n if self.get_color() == 'red':\\n # if destination within the board and the move is strictly one downward or to the side\\n if (to_col in range(9) and to_row in range(10) and\\n ((abs(to_col - from_col) == 1 and to_row == from_row) or (to_col == from_col and to_row - from_row == 1))):\\n return True\\n # if moving diagonally within the blue palace\\n if from_coordinates in [[3,7],[5,7]] and to_coordinates == [4,8]:\\n return True\\n if from_coordinates == [4,8] and to_coordinates in [[3,9],[5,9]]:\\n return True\\n\\n return False\\n\\n # for blue soldiers (who can only move upward or to the side)\\n if self.get_color() == 'blue':\\n # if destination within the board and the move is strictly one upward or to the side\\n if (to_col in range(9) and to_row in range(10) and\\n ((abs(to_col - from_col) == 1 and to_row == from_row) or (to_col == from_col and to_row - from_row == -1))):\\n return True\\n # if moving diagonally within the red palace\\n if from_coordinates in [[3, 2], [5, 2]] and to_coordinates == [4, 1]:\\n return True\\n if from_coordinates == [4, 1] and to_coordinates in [[3, 0], [5, 0]]:\\n return True\\n\\n return False\\n\\n return False\",\n \"def check_legal(self, cur_pos, new_pos, board, state): \\n if cur_pos and new_pos in self._special:\\n new_row = self.ind(new_pos)[0]\\n new_col = self.ind(new_pos)[1]\\n cur_row = self.ind(cur_pos)[0]\\n cur_col = self.ind(cur_pos)[1]\\n\\n if state == \\\"UNFINISHED\\\":\\n if new_pos in self._special: # Make sure that the piece it's trying to take isn't it's own\\n if board[new_row][new_col] is not None:\\n if self.piece_type(new_pos, board).get_color() == self._color:\\n return False\\n \\n if new_pos in self._special: # if its in the palace\\n # Checking if the movement is left or right (one column apart) from the cur_pos\\n if (new_col == cur_col + 1 or new_col == cur_col - 1) and new_row == cur_row:\\n return True\\n # Checking if forward or backward movement is legal\\n elif (new_row == cur_row - 1 or new_row == cur_row + 1) and (new_col == cur_col):\\n return True\\n # Checking if diagonal lines are possible\\n elif cur_pos in self._corners:\\n if (new_row == cur_row + 1 or new_row == cur_row - 1) and (new_col == cur_col - 1 or new_col == cur_col + 1):\\n return True\\n else:\\n return False\\n else:\\n return False\",\n \"def validMove(move):\\r\\n\\r\\n\\tglobal tile1, tile2, tile3, tile4, tile5, tile6, tile7, tile8, tile9\\r\\n\\r\\n\\ta=eval(\\\"tile\\\"+str(move)+\\\"==0\\\")\\r\\n\\treturn a\",\n \"def checkMove(move: Card, game) -> bool:\\n lastMove = game.lastMove\\n\\n if move.number == lastMove.number:\\n return True\\n\\n elif move.color == lastMove.color: \\n return True\\n\\n elif move.wild: \\n return True\\n\\n return False\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.86168677","0.78282213","0.78129864","0.7796619","0.7645074","0.76316094","0.762242","0.75282884","0.74927366","0.7453383","0.7452425","0.73305404","0.72937834","0.7274391","0.7266397","0.7234366","0.71924216","0.7192144","0.7192","0.71551216","0.714581","0.7145095","0.71425706","0.7142265","0.7113649","0.70628214","0.7060886","0.7051618","0.70410365","0.70318425","0.70190585","0.7012234","0.7002369","0.6999567","0.6987857","0.69853216","0.6959404","0.6952135","0.6945241","0.69265854","0.69238746","0.6916593","0.6891209","0.68905425","0.68864095","0.68796384","0.6879628","0.6876595","0.6854337","0.6830468","0.6827206","0.68124354","0.6808859","0.6806946","0.6806838","0.6798952","0.6782463","0.6767816","0.6761351","0.67592525","0.67267376","0.6725823","0.67161494","0.671029","0.6708849","0.67067766","0.6701182","0.67002404","0.66964984","0.66812265","0.66780245","0.6670656","0.66637266","0.6663569","0.66619027","0.66614807","0.66593397","0.6650084","0.6647372","0.66409683","0.66268647","0.66137147","0.66094995","0.65720373","0.6569931","0.6564301","0.6562264","0.6555668","0.65528804","0.6548294","0.6547696","0.65457463","0.65381235","0.6535448","0.65341604","0.65322506","0.6526687","0.65058947","0.6487632","0.64755374"],"string":"[\n \"0.86168677\",\n \"0.78282213\",\n \"0.78129864\",\n \"0.7796619\",\n \"0.7645074\",\n \"0.76316094\",\n \"0.762242\",\n \"0.75282884\",\n \"0.74927366\",\n \"0.7453383\",\n \"0.7452425\",\n \"0.73305404\",\n \"0.72937834\",\n \"0.7274391\",\n \"0.7266397\",\n \"0.7234366\",\n \"0.71924216\",\n \"0.7192144\",\n \"0.7192\",\n \"0.71551216\",\n \"0.714581\",\n \"0.7145095\",\n \"0.71425706\",\n \"0.7142265\",\n \"0.7113649\",\n \"0.70628214\",\n \"0.7060886\",\n \"0.7051618\",\n \"0.70410365\",\n \"0.70318425\",\n \"0.70190585\",\n \"0.7012234\",\n \"0.7002369\",\n \"0.6999567\",\n \"0.6987857\",\n \"0.69853216\",\n \"0.6959404\",\n \"0.6952135\",\n \"0.6945241\",\n \"0.69265854\",\n \"0.69238746\",\n \"0.6916593\",\n \"0.6891209\",\n \"0.68905425\",\n \"0.68864095\",\n \"0.68796384\",\n \"0.6879628\",\n \"0.6876595\",\n \"0.6854337\",\n \"0.6830468\",\n \"0.6827206\",\n \"0.68124354\",\n \"0.6808859\",\n \"0.6806946\",\n \"0.6806838\",\n \"0.6798952\",\n \"0.6782463\",\n \"0.6767816\",\n \"0.6761351\",\n \"0.67592525\",\n \"0.67267376\",\n \"0.6725823\",\n \"0.67161494\",\n \"0.671029\",\n \"0.6708849\",\n \"0.67067766\",\n \"0.6701182\",\n \"0.67002404\",\n \"0.66964984\",\n \"0.66812265\",\n \"0.66780245\",\n \"0.6670656\",\n \"0.66637266\",\n \"0.6663569\",\n \"0.66619027\",\n \"0.66614807\",\n \"0.66593397\",\n \"0.6650084\",\n \"0.6647372\",\n \"0.66409683\",\n \"0.66268647\",\n \"0.66137147\",\n \"0.66094995\",\n \"0.65720373\",\n \"0.6569931\",\n \"0.6564301\",\n \"0.6562264\",\n \"0.6555668\",\n \"0.65528804\",\n \"0.6548294\",\n \"0.6547696\",\n \"0.65457463\",\n \"0.65381235\",\n \"0.6535448\",\n \"0.65341604\",\n \"0.65322506\",\n \"0.6526687\",\n \"0.65058947\",\n \"0.6487632\",\n \"0.64755374\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.69171023"},"document_rank":{"kind":"string","value":"41"}}},{"rowIdx":94796,"cells":{"query":{"kind":"string","value":"needed for search Gets all legal available moves including those for the oppenent"},"document":{"kind":"string","value":"def openMoves(self):\n arr = []\n for y in range(0,HEIGHT):\n for x in range(0,WIDTH):\n t = self.getPawn(x,y)\n if(t!=None):\n for z in range(-1,2):\n if(self.legalMove(t,z)):\n #move , #newState\n arr.append((t,z))\n return arr"},"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_moves(self, board):\n self.available_moves = [move for move in board.legal_moves]","def get_available_moves(self, board):\n pass","def get_legal_moves(self):\n # for each square in the castle figure out if an moves can occur from it.\n moves = []\n allowed = [self.turn]\n if self.turn == DEFENDER:\n allowed.extend((KING, CASTLE_OCCUPIED))\n it = np.nditer(self.board_state, flags=['multi_index'])\n while not it.finished:\n index = it.multi_index\n curr_loc = it[0]\n if curr_loc in allowed:\n moves.extend(self.get_legal_move_piece(curr_loc, index))\n it.iternext()\n return moves","def availablemoves(moves):\n useravailablemoves = []\n for move in moves:\n useravailablemoves.append(move['move'])\n return(useravailablemoves)","def legal_moves():\n\tlegal_moves = (\"r\", \"p\", \"s\")\n\treturn legal_moves","def get_legal_moves(self):\n moves = []\n if self.player_locations[self.whose_turn] is None:\n return self.get_blank_locations()\n matrix = [(1,0), (-1,0), (0,1), (0,-1), (1,1), (1,-1), (-1, 1), (-1,-1)]\n\n for dx, dy in matrix:\n x,y = self.player_locations[self.whose_turn]\n while x+dx <= xdim and x+dx >= 0 and y+dy <= ydim and y+dy >= 0:\n x = x+dx\n y = y+dx\n if self.board[x][y] : break\n moves.append((x,y))\n return moves","def get_legal_moves(self):\n\n return self._legal_moves","def get_all_moves(self, board, player):\n result = []\n for startx in range(8):\n for starty in range(8):\n for destx in range(8):\n for desty in range(8):\n if self.is_legal_move(board, [startx, starty], [destx, desty], player):\n result.append([[startx, starty], [destx, desty]])\n return result","def get_legal_moves(self, pos: Position, game_board: GameBoard) -> PossibleMoveSet:\n pass","def get_available_moves(self):\n available = []\n row, col = tuple(self.current_pos)\n if row - 1 >= 0 and self.maze[row - 1][col] != 'x':\n available.append('n')\n if row + 1 < len(self.maze) and self.maze[row + 1][col] != 'x':\n available.append('s')\n if col - 1 >= 0 and self.maze[row][col - 1] != 'x':\n available.append('w')\n if col + 1 < len(self.maze[row]) and self.maze[row][col + 1] != 'x':\n available.append('e')\n return available","def get_valid_moves(self):\r\n # castling and en-passant rights are stored, because move affects these values\r\n temp_enpassant_possible = self.enpas_pos\r\n temp_castle = CastleRights(self.cr_castle_r.wks, self.cr_castle_r.bks,\r\n self.cr_castle_r.wqs, self.cr_castle_r.bqs)\r\n\r\n # for validating a possible move\r\n #1 all possibile moves are generated\r\n #2 each pos moves are made\r\n #3 generate opponent move\r\n #4 check if any of those moves let the king attacked\r\n #5 moves which let the king in chess are eliminated\r\n #6 the moves are undone\r\n moves = self.get_all_possible_moves() # 1\r\n\r\n # castle moves are directly introduced in valid moves\r\n if not self.turn_white:\r\n self.get_castle_moves(self.bKingPos[0], self.bKingPos[1], moves)\r\n else:\r\n self.get_castle_moves(self.wKingPos[0], self.wKingPos[1], moves)\r\n\r\n for i in range(len(moves) - 1, -1, -1): # 2\r\n self.make_move(moves[i])\r\n # 3 #4\r\n self.turn_white = not self.turn_white\r\n if self.in_check():\r\n moves.remove(moves[i]) # 5\r\n self.turn_white = not self.turn_white\r\n self.undo_move()\r\n\r\n # game ending possibilities\r\n if len(moves) == 0:\r\n if self.in_check():\r\n self.checkMate = True\r\n print(\"Checkmate !\")\r\n else:\r\n self.staleMate = True\r\n print(\"Stalemate !\")\r\n else:\r\n self.checkMate = False\r\n self.staleMate = False\r\n\r\n # the rigths are restored, and the values are not affected\r\n self.enpas_pos = temp_enpassant_possible\r\n self.cr_castle_r = temp_castle\r\n\r\n return moves","def get_available_moves(self, board):\n available_moves = []\n for fieldx in range(len(board)):\n column = []\n for fieldy in range(len(board)):\n legit_move = board[self.posy][self.posx].is_valid_move(board, fieldx, fieldy)\n column.append(legit_move)\n available_moves.append(column)\n return available_moves","def get_legal_moves(self, current_player):\n\t\tlegal_moves = []\n\t\tfor row in range(self.board_size):\n\t\t\tfor col in range(self.board_size):\n\t\t\t\tif self.board.repr[row][col] == self.player_symbol[current_player]:\n\t\t\t\t\tposition = (row,col)\n\t\t\t\t\tmove_fn_list = [self.north_move,\n\t\t\t\t\t\t\t\t self.east_move,\n\t\t\t\t\t\t\t\t self.south_move,\n\t\t\t\t\t\t\t\t self.west_move]\n\t\t\t\t\tfor move_fn in move_fn_list:\n\t\t\t\t\t\tmove = move_fn(position)\n\t\t\t\t\t\tif self.is_legal_move(current_player,move):\n\t\t\t\t\t \t\tlegal_moves.append(move)\n\t\t\t\t\t \t\t# now we are going to check for a double jump!\n\t\t\t\t\t \t\tstart = move[0]\n\t\t\t\t\t \t\tcur_end = move[1]\n\t\t\t\t\t \t\tnew_board = copy.deepcopy(self.board)\t# Make a copy of the board, and then make the move on that board\n\t\t\t\t\t \t\tnew_board.movePiece(start,cur_end)\n\t\t\t\t\t \t\tcontinue_move = move_fn(cur_end)\t\t# Try to move again in the same direction\n\t\t\t\t\t \t\tnew_game_state = Game(self.board_size,new_board,current_player)\t\t\t# make a whole new game state and check if our move is legal on that \n\t\t\t\t\t \t\twhile(new_game_state.is_legal_move(current_player, continue_move)):\n\t\t\t\t\t \t\t\tstart_cur = cur_end\n\t\t\t\t\t \t\t\tcur_end = continue_move[1]\n\t\t\t\t\t \t\t\tlegal_moves.append((start,cur_end))\n\t\t\t\t\t\t \t\tnew_board = copy.deepcopy(new_board)\n\t\t\t\t\t \t\t\tnew_board.movePiece(start_cur,cur_end)\n\t\t\t\t\t \t\t\tcontinue_move = move_fn(cur_end)\n\t\t\t\t\t \t\t\tnew_game_state = Game(new_game_state.board_size,new_board,current_player)\n\t\treturn legal_moves","def get_moves(self):","def available_moves(self):\n moves = []\n for x, y in self.available_boards:\n moves.extend([self.to_position(x, y, i, j) for (i, j)\n in self.boards[x][y].empty_squares])\n return moves","def legal_moves(player, board):\n return [sq for sq in Othello.squares() if Othello.is_legal(sq, player, board)]","def legal_moves_in_uci(self):\n\n # get all legal moves. 'legal_moves' is inherited attribute from super class that returns all possible moves\n return [m.uci() for m in list(self.legal_moves)]","def get_all_available_moves(self, board):\n available_attacks = self.get_available_attacks(board)\n if any(True in sublist for sublist in available_attacks):\n attack = True\n return available_attacks, attack\n else:\n available_moves = self.get_available_moves(board)\n attack = False\n return available_moves, attack","def find_moves(self):\n\n from itertools import product\n free_position = self.find_free()\n return [list(free_position+i) for i in [[0,1],[1,0],[-1,0],[0,-1]] if tuple(i+free_position) in product(range(self.size),repeat=2)]","def get_goat_possible_moves(self) -> List:\n moves = []\n for pos in self.get_all_positions():\n if pos.is_goat():\n addr_from = pos.address\n for addr_to in pos.piece.get_valid_moves():\n moves.append((addr_from, addr_to))\n\n return moves","def get_legal_moves(self, board):\n moves = set()\n capture_moves = set()\n for move in self.pot_moves:\n target_row = self.field_row + move[0]\n target_col = self.field_col + move[1]\n if not (target_row > 7 or target_row < 0 or target_col > 7 or target_col < 0):\n if board.status[target_row, target_col] == 0:\n moves.add(move)\n if board.status[target_row, target_col] * self.color_value < 0:\n capture_moves.add(move)\n self.legal_moves = moves\n self.legal_capture_moves = capture_moves","def legal_moves(self, player, board):\r\n #go through the whole board and check whether the piece is on the board or not\r\n #num/row size - num%col == num2/row size - num@%col\r\n #num/row size + num%col\r\n moves = list()\r\n opp = self.opponent(player)\r\n #print(board)\r\n for i in self.squares():\r\n if board[i] == core.EMPTY:\r\n for d in core.DIRECTIONS:\r\n endPt = self.find_bracket(i, player, board, d)\r\n if endPt!= None:\r\n moves.append(i)\r\n break\r\n\r\n return moves","def get_all_moves(self):\n # 2d matrix of true/false, true if something can be placed\n legal_move_board = []\n possible_move_list = []\n for row in range(self.size):\n move_row = []\n for col in range(self.size):\n empty = self.board[row][col].state == PegState.EMPTY\n move_row.append(empty)\n if empty:\n possible_move_list.append((row, col))\n legal_move_board.append(move_row)\n \n # every position where something can be placed (list of tuples) (Combined with above)\n \"\"\" possible_move_list = []\n for row in range(self.size):\n for col in range(self.size):\n if legal_move_board[row][col] == True:\n possible_move_list.append((row, col))\n \"\"\"\n return legal_move_board, possible_move_list","def get_legal_moves(self, board):\n moves = set()\n capture_moves = set()\n if not (self.field_row*self.color_value == 1 or self.field_row*self.color_value == -6):\n self.pot_moves = {(1*self.color_value, 0)}\n\n for move in self.pot_moves:\n target_row = self.field_row + move[0]\n target_col = self.field_col + move[1]\n if self.path_clear(board, move, target_row, target_col):\n if board.status[target_row, target_col] * self.color_value == 0:\n moves.add(move)\n\n for move in self.pot_capture_moves:\n target_row = self.field_row + move[0]\n target_col = self.field_col + move[1]\n if self.path_clear(board, move, target_row, target_col):\n if board.status[target_row, target_col] * self.color_value < 0:\n capture_moves.add(move)\n self.legal_moves = moves\n self.legal_capture_moves = capture_moves","def get_legal_moves(self, player):\r\n move_list = []\r\n if self._phase == GamePhase.SETUP:\r\n return self._setup_legal_moves(player)\r\n elif self._phase == GamePhase.MOVE:\r\n return self._move_legal_moves(player)\r\n elif self._phase == GamePhase.BUILD:\r\n return self._build_legal_moves(player)\r\n return move_list","def get_moves(self):\n grid = self.model.grid\n # List of agents we can't overlap with\n no_overlap = [\"wall\", \"human\", \"zombie\"]\n\n if self.agent_type == \"zombie\" or \\\n (\"AvoidingZombie\" not in self.states and os.environ[\"mode\"] == \"5\"):\n no_overlap.append(\"road\")\n\n # Always give the option to stay on your current location(stand still)\n all_cells = self.neighbors()\n free_cells = [self.pos]\n\n # Get rid of cells that we may not move to by iterating through all\n # cells next to the agent, and only adding non-occupied cells\n for cell in all_cells:\n cell_occupied = False\n x, y = cell.pos\n # If there are agents in the current cell, and we are not allowed\n # to overlap with any of those agents, the cell is occupied.\n # Only add cells which are not occupied.\n if not grid.is_cell_empty((x, y)):\n for agent in grid[x][y]:\n if agent.agent_type in no_overlap:\n cell_occupied = True\n break\n if not cell_occupied:\n free_cells.append((x, y))\n return free_cells","def get_legal_moves(self, color):\n moves = [] # stores the legal moves.\n # Get all the squares with pieces of the given color.\n for x in range(self.n):\n for y in range(self.n):\n if self[x][y]==0:\n moves.append((x,y))\n return moves","def get_all_game_pieces_potential_moves(self):\n\n board = self.get_board()\n\n for row in board:\n\n for column in row:\n\n if column is not None:\n\n print(column.get_label(), ': ' , column.get_potential_moves())","def get_legal_moves(self, board):\n moves = set()\n capture_moves = set()\n for move in self.pot_moves:\n target_row = self.field_row + move[0]\n target_col = self.field_col + move[1]\n if self.path_clear(board, move, target_row, target_col):\n if board.status[target_row, target_col] * self.color_value == 0:\n moves.add(move)\n if board.status[target_row, target_col] * self.color_value < 0:\n capture_moves.add(move)\n self.legal_moves = moves\n self.legal_capture_moves = capture_moves","def all_valid_moves(self, cur_board, all_english_words):\r\n rack_to_str = self.convert_rack_to_str()\r\n if len(rack_to_str) == 0:\r\n return [] \r\n \r\n moves_made = cur_board.find_words_on_board()\r\n actual_words = []\r\n\r\n if cur_board.board_empty: #no one has played yet.\r\n return Utils.get_all_legal_combos([\"\"], rack_to_str, all_english_words)\r\n\r\n\r\n\r\n \r\n for move in moves_made:\r\n actual_words.append(move[0]) #the first element is a string, representing the actual move made.\r\n \r\n \r\n return Utils.get_all_legal_combos(actual_words, rack_to_str, all_english_words)","def available_moves(self):\n available_moves = []\n for i in range(self.quadrants_count):\n quadrant_positions = self.play_area[i].available_positions()\n for p in quadrant_positions:\n position = p + i * 9\n for j in range(self.quadrants_count):\n move1 = [str(position), str(j + 1), \"l\"]\n move2 = [str(position), str(j + 1), \"r\"]\n available_moves.append(\" \".join(move1))\n available_moves.append(\" \".join(move2))\n return available_moves","def get_all_legal_moves(\n old_board, current_board, player: int\n) -> List[Tuple[Tuple, Tuple]]:\n possible_pieces_to_move, open_position = _check_open_rule(\n old_board=old_board, new_board=current_board, player=player\n )\n if open_position and len(possible_pieces_to_move) > 0:\n return [(pos, open_position) for pos in possible_pieces_to_move]\n else:\n # list[tuple[int,int]]\n owned_positions = [\n (r, c) for r in range(5) for c in range(5) if current_board[r][c] == player\n ]\n # list[tuple[tuple,tuple]]\n return [\n (pos, new_pos)\n for pos in owned_positions\n for new_pos in _get_empty_neighbors(pos, current_board)\n ]","def get_legal_moves(self, i, j):\r\n legal_moves = list()\r\n for action in self.action_dic.keys():\r\n coordinate_change = self.action_dic[action]\r\n new_i = coordinate_change[0] + i\r\n new_j = coordinate_change[1] + j\r\n if (new_i >= 0 and new_i < 3) and (new_j >= 0 and new_j < 3):\r\n legal_moves.append(self.reflection_dic[action])\r\n return legal_moves","def get_valid_moves(self):\n if self.king:\n valid_moves = [[self.row + 1, self.col + 1],\n [self.row + 1, self.col - 1],\n [self.row - 1, self.col - 1],\n [self.row - 1, self.col + 1]]\n else:\n if self.player == 1:\n valid_moves = [[self.row + 1, self.col + 1],\n [self.row + 1, self.col - 1]]\n else:\n valid_moves = [[self.row - 1, self.col - 1],\n [self.row - 1, self.col + 1]]\n return valid_moves","def get_legal_nearby_moves(self, nearby_length=1):\n moves = []\n for row, col in self.get_legal_moves():\n if not self._is_nearby_empty(nearby_length, row, col):\n moves.append((row, col))\n\n return moves or None","def get_next_moves(board, player):\r\n\r\n if player == 'hare':\r\n moves = []\r\n next_moves = []\r\n\r\n (row_from, col_from) = get_hare_positions(board)\r\n moves = possible_moves_list(row_from, col_from)\r\n\r\n for move in moves:\r\n row_to = move[0]\r\n col_to = move[1]\r\n\r\n if is_legal_move(player, row_from, col_from, row_to, col_to):\r\n \"\"\" if move is allowed then add to list of next moves\"\"\"\r\n next_moves.append(move)\r\n\r\n return next_moves\r\n\r\n else:\r\n \"\"\" for individual hounds\r\n get next moves\"\"\"\r\n moves = []\r\n next_moves_hound1 = []\r\n next_moves_hound2 = []\r\n next_moves_hound3 = []\r\n\r\n (row_hound_1, col_hound_1), (row_hound_2, col_hound_2), (row_hound_3, col_hound_3) = get_hound_positions(board)\r\n moves_hound1 = possible_moves_list(row_hound_1, col_hound_1)\r\n moves_hound2 = possible_moves_list(row_hound_2, col_hound_2)\r\n moves_hound3 = possible_moves_list(row_hound_3, col_hound_3)\r\n\r\n for move in moves_hound1:\r\n row_to = move[0]\r\n col_to = move[1]\r\n\r\n if is_legal_move(player, row_hound_1, col_hound_1, row_to, col_to):\r\n next_moves_hound1.append(move)\r\n\r\n for move in moves_hound2:\r\n row_to = move[0]\r\n col_to = move[1]\r\n\r\n if is_legal_move(player, row_hound_2, col_hound_2, row_to, col_to):\r\n next_moves_hound2.append(move)\r\n\r\n for move in moves_hound3:\r\n row_to = move[0]\r\n col_to = move[1]\r\n\r\n if is_legal_move(player, row_hound_3, col_hound_3, row_to, col_to):\r\n next_moves_hound3.append(move)\r\n\r\n return (next_moves_hound1, next_moves_hound2, next_moves_hound3)","def test_get_legal_moves():\n board = Board(*TEST_AGRU2)\n comp = Computer(board, COMP_DISK, HUMAN_DISK)\n comp.b.columns_list = [\n [HUMAN_DISK],\n [HUMAN_DISK, HUMAN_DISK],\n [HUMAN_DISK, HUMAN_DISK, HUMAN_DISK]\n ]\n comp.b.new_disk = (MOVE2)\n assert set(comp.get_legal_moves(comp.b)) == {(1, 0), (0, 1)}","def __find_all_moves(self, tower) -> list:\r\n choice = []\r\n for height in range(1,len(tower.tower)-2):\r\n for index in range(1,4):\r\n if self.stat_brain.is_valid(height, index, tower):\r\n choice.append((height, index))\r\n \r\n r.shuffle(choice)\r\n return choice","def get_possible_moves(self) -> list:\n if self.p1_turn:\n name = '2'\n else:\n name = '1'\n\n count = 0\n for i in self.claim:\n if i == name:\n count += 1\n over = count >= 0.5 * len(self.claim)\n\n moves = []\n if not over:\n for i in self.letters:\n if i.isalpha():\n moves.append(i)\n return moves","def possible_moves(self):\n lst_of_direcs = []\n for a_car in self.__cars:\n good_moves = a_car.possible_moves()\n new = [(a_car.get_name(),dire, des) for dire, des\\\n in good_moves.items()]\n lst_of_direcs.append(new[0])\n lst_of_direcs.append(new[1])\n return lst_of_direcs","def get_possible_moves(self) -> list:\n p1_count = 0\n p2_count = 0\n ley_line_total = (self.side_length + 1) * 3\n for itype in self.current_ley_lines:\n for line in itype:\n if line[0] == '1':\n p1_count += 1\n if line[0] == '2':\n p2_count += 1\n if p1_count >= ley_line_total / 2 or p2_count >= ley_line_total / 2:\n return []\n moves = []\n for letter in self.current_board:\n if letter.isalpha():\n moves.append(letter)\n return moves","def get_all_possible_moves(self, state):\n move_list = []\n done_finding_moves = False\n any_non_pass_moves = False\n while not done_finding_moves:\n try:\n m = next(self.move_generator) # Gets a (move, state) pair.\n # print(\"next returns: \",m[0]) # Prints out the move. For debugging.\n if m[0] != 'p':\n any_non_pass_moves = True\n move_list.append(m) # Add the move to the list.\n except StopIteration as e:\n done_finding_moves = True\n if not any_non_pass_moves:\n move_list.append(('p',state))\n return move_list","def possible_moves(self, pos: Point) -> List[Point]:\n # logger.debug(f\"inside possible_moves {pos}\")\n available_squares = []\n for direction in Direction.cardinal():\n # logger.debug(f\"direction = {direction}\")\n neighbor = pos + direction\n # logger.debug(f\"neighbor = {neighbor}\")\n if neighbor.x < 1 or self.width - 2 < neighbor.x or neighbor.y < 1 or self.height - 2 < neighbor.y:\n # logger.debug(f\"{neighbor} not in bounds\")\n continue\n if self.can_carve(pos, direction):\n # logger.debug(f\"can_carve returned True pos={pos}, direction={direction}\")\n available_squares.append(neighbor)\n # logger.debug(f\"available squares:\")\n # for square in available_squares:\n # logger.debug(f\"square={square}\")\n # logger.add(\"debug.log\")\n return available_squares","def get_all_moves(self, castling_allowed=True):\n\n can_move = str.isupper if self.white_to_move else str.islower\n\n valid_moves = set()\n\n for row_num, row in enumerate(self.board):\n for col_num, piece in enumerate(row):\n if piece != EMPTY_SPACE and can_move(piece):\n\n location = (row_num, col_num)\n\n # Everything except the pawn movement\n if piece.lower() in NAME_TO_PIECE:\n valid_moves = valid_moves.union(self._get_standard_moves_for_piece(location, piece))\n\n # Pawn moves\n if piece.lower() == PAWN:\n valid_moves = valid_moves.union(self._get_pawn_moves(location, piece))\n\n # Castling\n if castling_allowed and piece.lower() == KING:\n valid_moves = valid_moves.union(self._get_possible_castles(piece))\n\n return valid_moves","def legal_moves(board,player=None):\r\n \r\n possible_moves = []\r\n moves = []\r\n if player == None:\r\n moves += board.white + board.black\r\n elif player == -1:\r\n moves += board.black\r\n elif player == 1:\r\n moves += board.white\r\n \r\n captured = False\r\n for pos in moves:\r\n if pos[0] == 'A':\r\n m = [-8,-7,1,8,9]\r\n elif pos[0] == 'H':\r\n m = [-9,-8,-1,7,8]\r\n else:\r\n m = [-9,-8,-7,-1,1,7,8,9]\r\n loc = decode(pos)\r\n for i in m:\r\n captured = capture(board, player, possible_moves, pos, loc, i)\r\n canter(board, player, possible_moves, pos, loc, i)\r\n plain(board, player, possible_moves, pos, loc, i)\r\n \r\n if captured:\r\n enemy_list = []\r\n for capturing_move in possible_moves:\r\n if len(capturing_move) == 3:\r\n enemy_list.append(capturing_move)\r\n possible_moves = list(enemy_list)\r\n\r\n return possible_moves","def legalMoves(self):\n moves = []\n indexOfZero = self.tiles.index(0)\n \n if indexOfZero == 0:\n moves.append('Down')\n moves.append('Right')\n elif indexOfZero == 1:\n moves.append('Down')\n moves.append('Left')\n moves.append('Right')\n elif indexOfZero == 2:\n moves.append('Down')\n moves.append('Left')\n elif indexOfZero == 3:\n moves.append('Up')\n moves.append('Down')\n moves.append('Right')\n elif indexOfZero == 4:\n moves.append('Up')\n moves.append('Down')\n moves.append('Left')\n moves.append('Right')\n elif indexOfZero == 5:\n moves.append('Up')\n moves.append('Down')\n moves.append('Left')\n elif indexOfZero == 6:\n moves.append('Up')\n moves.append('Right')\n elif indexOfZero == 7:\n moves.append('Up')\n moves.append('Left')\n moves.append('Right')\n elif indexOfZero == 8:\n moves.append('Up')\n moves.append('Left')\n else:\n print('something wrong with board')\n return moves","def getPossibleMoves(self): # called to get possible positions this piece can go\r\n \r\n moves = {}\r\n\r\n ids = []\r\n\r\n for piece in self.board.pieces.values():\r\n if piece.name == \"empty\":\r\n piece.glow = False\r\n piece.ready = False\r\n\r\n self.piece = self\r\n\r\n def check(direction=\"left\", heading=\"north\", x=None, y=None):\r\n piece = self.piece\r\n if direction == \"left\": x -= 50\r\n else: x += 50\r\n\r\n if heading == \"north\": y -= 50\r\n else: y += 50\r\n\r\n if (x, y) in self.board.pieces: # position is empty\r\n empty = self.board.getPiece((x, y))\r\n empty.glow = True\r\n old, new, obj = (direction, heading), (x, y), piece\r\n identity = self.getRandomID(ids) # get an ID for the move\r\n moves[identity] = old, new, obj\r\n\r\n if piece.isKing: # piece is a king, so go on\r\n check(direction, heading, x, y)\r\n else: # its not empty, so check if its comrade\r\n x1, y1 = x+25, y+25\r\n piece2 = self.board.getPiece((x1, y1))\r\n try:\r\n if piece.isComrade(piece2):# piece is comrade so return\r\n return\r\n else: # piece is not comrade, so check empty\r\n if direction == \"left\": x2 = x1-25-50\r\n else: x2 = x1-25+50\r\n\r\n if heading == \"north\": y2 = y1-25-50\r\n else: y2 = y1-25+50\r\n\r\n if (x2, y2) in self.board.pieces: # its empty, so notify player\r\n empty = self.board.getPiece((x2, y2))\r\n empty.glow = True\r\n empty.ready = True\r\n\r\n old, new, obj = (direction, heading), (x2, y2), piece2\r\n identity = self.getRandomID(ids)\r\n moves[identity] = old, new, obj\r\n\r\n check(direction, heading, piece2.x-25, piece2.y-25)\r\n check(direction, heading, x2, y2)\r\n \r\n # check empty or comrade again\r\n if direction == \"left\": x3 = x2-50\r\n else: x3 = x2+50\r\n\r\n if heading == \"north\": y3 = y2-50\r\n else: y3 = y2+50\r\n\r\n if (x3, y3) in self.board.pieces: # positon(address) is empty\r\n return\r\n else: # there is a piece, so check if comrade, stop, if not comrade continue\r\n x3+=25\r\n y3+= 25\r\n\r\n piece3 = self.board.getPiece((x3, y3))\r\n if piece3.isComrade(piece2): # comrades, so stop\r\n return\r\n else: # not comrades, so continue\r\n self.piece = piece3\r\n check(direction, heading, x, y)\r\n\r\n #self.piece = piece2\r\n \r\n #check(direction, heading, x2, y2) # keep searching\r\n else: # its not empty, so return\r\n return\r\n except:\r\n pass\r\n\r\n if self.piece.name == \"white\": direction = \"north\"\r\n else: direction = \"south\"\r\n \r\n check(\"left\", direction, self.piece.x-25, self.piece.y-25)\r\n check(\"right\", direction, self.piece.x-25, self.piece.y-25)\r\n \r\n if self.piece.isKing:\r\n if self.piece.name == \"white\": heading = \"south\"\r\n else: heading = \"north\"\r\n \r\n check(\"left\", heading, self.piece.x-25, self.piece.y-25)\r\n check(\"right\", heading, self.piece.x-25, self.piece.y-25)\r\n\r\n if self.piece.name == \"white\":\r\n eatMoves = self.board.game.thinkEatMoves(moves, \"person\")\r\n if eatMoves is not None:\r\n return eatMoves\r\n\r\n return moves","def get_legal_moves(self, player: int) -> np.ndarray:\n stage2 = self.is_stage2()\n action_mask = np.zeros((24, 5, 25), dtype=bool)\n # if stage 1 add set options\n array_board = np.array(self.board)\n if not stage2:\n legal_pos = np.where(array_board == 0)[0]\n for pos in legal_pos:\n if self.is_mill(player, pos, self.board): # current selection completes a mill\n opp_pos = np.where(array_board == -player)[0]\n opp_pos = [opp_p for opp_p in opp_pos if\n not self.is_mill(-player, opp_p, self.board)] # can't remove opponent in mill\n if len(opp_pos) == 0: # exception for the case where all opponents pieces are in mills\n opp_pos = np.where(array_board == -player)[0]\n action_mask[pos, -1, opp_pos] = True\n else:\n action_mask[pos, -1, -1] = True # place piece on board\n else:\n from_pos_cands = np.where(array_board == player)[0]\n for from_pos in from_pos_cands:\n mill_cands = [(orient, adj) for orient, adj in enumerate(self.adjacent[from_pos]) if\n adj is not None and self.board[adj] == 0] # TODO added not, need to validate\n if_played_board = self.board.copy()\n if_played_board[from_pos] = 0\n for (orient, adj) in mill_cands:\n if self.is_mill(player, adj, if_played_board):\n opp_pos = np.where(array_board == -player)[0]\n opp_pos = [opp_p for opp_p in opp_pos if not self.is_mill(-player, opp_p, if_played_board)]\n if len(opp_pos) == 0: # exception for the case where all opponents pieces are in mills\n opp_pos = np.where(array_board == -player)[0]\n action_mask[from_pos, orient, opp_pos] = True\n else:\n action_mask[from_pos, orient, -1] = True\n\n return action_mask","def check_for_moves(self) -> list:\r\n avail_moves = []\r\n for x in range(self.size):\r\n for y in range(self.size):\r\n if self.tags[x][y] is None:\r\n avail_moves.append((x, y))\r\n return avail_moves","def get_moves(self, board, position):\n current_piece = board.grid[position[1]][position[0]]\n\n moves = []\n\n # For each direction in which the piece can move...\n for direction in self.directions:\n # for each vector in that direction...\n # (once a piece is encountered in a direction,\n # further positions in that direction are unaccessible,\n # therefore break out of inner FOR loop)\n for vector in direction:\n new_position = (position[0] + vector[0], position[1] + vector[1])\n\n # Check if the proposed destination is inbounds\n if board._inbounds(new_position) is False:\n break\n\n other_piece = board.grid[new_position[1]][new_position[0]]\n\n # Check if the proposed destination is occupied by a friendly piece\n if other_piece != \"empty\" and other_piece.player == current_piece.player:\n break\n\n # Check other validity conditions, mainly for pawn\n if self._is_valid_move(vector, current_piece, other_piece) is False:\n break\n\n # The destination is viable, add the move\n moves.append(Move(position, current_piece, new_position, other_piece))\n\n # If there was an enemy piece on the square\n if other_piece != \"empty\":\n break\n\n return moves","def mappossiblemoves(self,nodeStart):\n destinations = [set() for ix in range(game.DICEMAX+1)]\n destinations[0] = set([nodeStart])\n routes = [[nodeStart]]\n #\n # TODO: Not convinced this adds anything more than it harms in this fn.\n #if self.hasEnteredRoomYet:\n # GAMEBOARD = game.TRIMMEDNODES\n #else:\n GAMEBOARD = game.BOARDNODES\n #\n for diceRoll in range(1,game.DICEMAX+1):\n newRoutes = []\n for route in routes:\n for nextLoc in GAMEBOARD[route[-1]]:\n if not nextLoc in route:\n # This location has not yet been visited by this route\n if nextLoc in game.ALLOWEDROOMNODES:\n # Location is a room - can move into it regardless\n # of population, but not move further. We can also\n # use any longer roll to move here by this route\n for thisRoll in range(diceRoll,game.DICEMAX+1):\n destinations[thisRoll].add(nextLoc)\n else:\n # Location is a square - can only move into it if\n # unoccupied, but can move further once there.\n if not nextLoc in self.charLocations:\n # Unoccupied (could check against \n # charLocations[1:] since we're the piece moving\n # but a nextLoc = charLocations[0] would be\n # rejected by being already in the route anyway)\n newRoute = list(route)\n newRoute.append(nextLoc)\n newRoutes.append(newRoute)\n destinations[diceRoll].add(nextLoc)\n routes = newRoutes\n #\n return [list(destSet) for destSet in destinations]","def get_possible_moves(self):\n moves = []\n for i in range(1, self.current_total + 1):\n if i ** 2 <= self.current_total:\n moves.append(i ** 2)\n\n return moves","def find_moveable_pieces(self, die, p1): \n moveable = []\n if (p1):\n #must we re-enter?\n if (self.p1vec[0] > 0):\n if (self.free_spot(0, die, p1)):\n b = Board(self.p1vec[:],self.p2vec[:])\n b.move(0, die, p1)\n moveable.append(b)\n #no? ok then generate the moves\n else:\n for i in range(1, 25):\n if (self.p1vec[i] > 0):\n if (self.free_spot(i, die, p1)):\n b = Board(self.p1vec[:],self.p2vec[:])\n b.move(i, die, p1)\n moveable.append(b)\n else:\n #must we re-enter?\n if (self.p2vec[0] > 0):\n if (self.free_spot(0, die, p1)):\n b = Board(self.p1vec[:],self.p2vec[:])\n b.move(0, die, p1)\n moveable.append(b)\n #no? ok then generate the moves\n else:\n for i in range(1, 25):\n if (self.p2vec[i] > 0):\n if (self.free_spot(i, die, p1)):\n b = Board(self.p1vec[:],self.p2vec[:])\n b.move(i, die, p1)\n moveable.append(b)\n return moveable","def getPossibleMovesOutCheck(player, board):\n possibleMoves = []\n for col in board:\n for piece in col:\n if type(piece) != int and piece.player == player:\n pieceMoves = piece.availableMoves(board)\n piecePosX = piece.posx\n piecePosY = piece.posy\n for move in pieceMoves:\n copyBoard = copy.deepcopy(board)\n #Do the move on the copied board\n copyBoard[piecePosX][piecePosY] = 1\n newPiece = copy.deepcopy(piece)\n newPiece.posx = move[0]\n newPiece.posy = move[1]\n copyBoard[move[0]][move[1]] = newPiece\n #Check if the copied board is now in check...\n #if not then it is a valid move to do to get out of check\n if not isInCheck(player, copyBoard):\n possibleMoves.append(((piecePosX,piecePosY), move))\n\n return possibleMoves","def possibleMoves(self,i,j):\n piece = self.board[i][j].piece\n if(piece.pieceCode == \"None\"):\n return []\n \n if(piece.name == \"pawn\"):\n return self.pawnMoves(piece,self.board)\n elif(piece.name == \"king\"):\n return self.kingSteps(self.board,piece.color)\n else:\n return self.pieceMoves(piece,self.board)","def available_moves(board_state):\n for x, y in itertools.product(range(len(board_state)), range(len(board_state[0]))):\n if board_state[x][y] == 0:\n yield (x, y)","def get_move(self, game, legal_moves, time_left):\n\n self.time_left = time_left\n \n options = game.get_legal_moves()\n assert options == legal_moves, \"Mismatched moves\"\n\n # Perform any required initializations, including selecting an initial\n # move from the game board (i.e., an opening book), or returning\n # immediately if there are no legal moves\n\n score, move = None, random.choice(legal_moves) if len(legal_moves) > 0 else None\n try:\n # Iterative deepening with Quiessance search:\n if self.iterative is True:\n results = deque(maxlen=3)\n for depth in range (self.search_depth, 25):\n score, move = self.dosearch(game, depth)\n results.append((score, move))\n if self.quiessant_search is True:\n if len(results) >=3 and all(x[1] == move for x in results):\n break\n elif score == float('-inf') or score == float ('inf'):\n break\n if self.time_left() < self.TIMER_THRESHOLD:\n break\n else:\n score, move = self.dosearch(game, self.search_depth)\n assert score is not None\n \n if len (options) > 0:\n assert not (move is None or move is (-1,-1)), \"Move ({}, {}) for '{}/{}' cannot be None or (-1,-1) if options ({}) exist\".format(move, score, self.method, self.score, options)\n assert move in options, \"Move ({}, {}) for '{}/{}' not from existing list of moves ({})\".format(move, score, self.method, self.score, options)\n except Timeout:\n # Handle any actions required at timeout, if necessary\n pass\n\n # Return the best move from the last completed search\n # (or iterative-deepening search iteration)\n return move","def get_king_moves(self, state):\n #king_moves = []\n possible_moves = []\n if self.color == cc.WHITE_ACTIVE:\n enemy_color = cc.BLACK_ACTIVE\n enemy_pieces = cc.BLACK_PIECES\n elif self.color == cc.BLACK_ACTIVE:\n enemy_color = cc.WHITE_ACTIVE\n enemy_pieces = cc.WHITE_PIECES\n else:\n raise Exception(\"GameState: Invalid Active Color\")\n\n for vector in cc.KING_VECTORS:\n rank = self.coord[0] + vector[0]\n column = self.coord[1] + vector[1]\n if rank in cc.VALID_RANKS and column in cc.VALID_RANKS:\n if state.board[rank, column] == cc.NO_PIECE:\n possible_moves.append(cc.Action(self.string, self.coord, (rank, column)))\n elif state.board[rank, column] in enemy_pieces:\n possible_moves.append(cc.Action(self.string, self.coord, (rank, column), capture=True))\n \n # # Iterate over list of king moves, removing ones that are under attack\n # for move in possible_moves:\n # if not check.space_under_attack(state, move.end, enemy_color):\n # king_moves.append(move)\n\n return possible_moves","def generate_possible_moves(self):\r\n\t\t# Moves:\r\n\t\t# 0 - North\r\n\t\t# 1 - East\r\n\t\t# 2 - South\r\n\t\t# 3 - West\r\n\r\n\t\tmoves = []\r\n\r\n\t\tif self.x != 0:\r\n\t\t\tmoves.append(0)\r\n\t\tif self.y != self.n-1:\r\n\t\t\tmoves.append(1)\r\n\t\tif self.x != self.n-1:\r\n\t\t\tmoves.append(2)\r\n\t\tif self.y != 0:\r\n\t\t\tmoves.append(3)\r\n\r\n\t\treturn moves","def checkPossibleMoves(self):\n possibleMovesArray = []\n\n for j in range(self.nrOfCars):\n minMaxChange = self.gridSize - self.length[j] + 1\n possibleMoves = []\n\n for i in range(1,minMaxChange):\n if self.checkMove(j, i) == 0:\n possibleMoves.append(i)\n else:\n break\n for i in range(1,minMaxChange):\n if self.checkMove(j, -i) == 0:\n possibleMoves.append(-i)\n else:\n break\n\n possibleMovesArray.append(possibleMoves)\n\n return possibleMovesArray","def GenerateMoves(position):\n return [move for move in POSSIBLE_MOVES if move <= position]","def get_legal_moves(self, color):\n moves = set() # stores the legal moves.\n color = max(0, color)\n\n # Get all the squares with pieces of the given color.\n for y in range(self.n):\n for x in range(self.n):\n if self[x][y]==color:\n newmoves = self.get_moves_for_square((x,y))\n moves.update(newmoves)\n return list(moves)","def get_all_possible_moves(self):\r\n moves = []\r\n for i in range(8):\r\n for j in range(8):\r\n color = self.board[i][j][0]\r\n if (color == 'b' and not self.turn_white) or (color == 'w' and self.turn_white):\r\n p_type = self.board[i][j][1]\r\n if p_type == 'r':\r\n self.get_rook_moves(i, j, moves)\r\n elif p_type == 'k':\r\n self.get_king_moves(i, j, moves)\r\n elif p_type == 'q':\r\n self.get_queen_moves(i, j, moves)\r\n elif p_type == 'p':\r\n self.get_pawn_moves(i, j, moves)\r\n elif p_type == 'b':\r\n self.get_bishop_moves(i, j, moves)\r\n elif p_type == 'n':\r\n self.get_knight_moves(i, j, moves)\r\n return moves","def legalMoves(self):\n return [c for c in range(self.getWidth()) if len([r for r in range(self.getHeight()) if self.cell[c][r]==EMPTY])>0 ]","def get_possible_moves(board):\n\tpossible_moves = []\n\n\tfor count, player in enumerate(board):\n\t\tif player is not server_player and player is not user_player:\n\t\t\tpossible_moves.append(count)\n\n\treturn possible_moves","def findPlacesToMove():\n movesDestinations = [];\n \n curY = curBlank[0];\n curX = curBlank[1];\n\n if(curY-1 >= 1): #UP\n movesDestinations.append((curY-1, curX));\n if(curY+1 <= n): #DOWN\n movesDestinations.append((curY+1, curX));\n if(curX-1 >= 1): #LEFT\n movesDestinations.append((curY, curX-1));\n if(curX+1 <= n): #RIGHT\n movesDestinations.append((curY, curX+1));\n \n return movesDestinations;","def get_moves(self, x, y):\n\n if not self.piece_at(x, y):\n return set()\n\n moves = self._get_piece_moves(x, y)\n legal = set(moves)\n at = x, y\n for to in moves:\n res, captured = self._make_move(at, to)\n if not res:\n legal.remove(to)\n else:\n self._unmake_move(to, at, captured)\n\n self._check_integrity()\n return legal","def moveAvailable(self, to):\n\t\tmoves = self.getAvailableMoves()\n\t\tprint(moves)\n\t\tif to in moves: return True\n\t\treturn False","def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\n pass","def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\n pass","def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\n pass","def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\n pass","def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\n pass","def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\n pass","def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\n pass","def possible(state_board,turn):\n\tlegal_moves = [] # list of legal moves as Move objects\n\tfor i in range(1,9):\n\t\tfor j in range(1,9):\n\t\t\tif state_board[i][j] == 0:\n\t\t\t\tif flipper([i,j],turn,state_board) != []:\n\t\t\t\t\t# if there are flipped pieces, it appends this move to\n\t\t\t\t\t# the legal moves and draws it in light greens\n\t\t\t\t\tlegal_moves.append((i,j))\n\t\t\t\t\tdrawPiece((i,j),3)\n\t\t\t\telse:\n\t\t\t\t\t# if it is 0 and is not legal, make sure it is of bgcolor\n\t\t\t\t\tdrawPiece((i,j),0)\n\t\n\treturn legal_moves","def get_possible_moves(board):\n\n possible_moves = []\n\n ret_tuple_left = move_left(board)\n ret_tuple_right = move_right(board)\n ret_tuple_up = move_up(board)\n ret_tuple_down = move_down(board)\n\n if ret_tuple_left[0]:\n possible_moves.append(ret_tuple_left[1])\n if ret_tuple_right[0]:\n possible_moves.append(ret_tuple_right[1])\n if ret_tuple_up[0]:\n possible_moves.append(ret_tuple_up[1])\n if ret_tuple_down[0]:\n possible_moves.append(ret_tuple_down[1])\n\n return possible_moves","def get_move(self, game, legal_moves, time_left):\n\n self.time_left = time_left\n move = (-1, -1) #Default\n\n # Perform any required initializations, including selecting an initial\n # move from the game board (i.e., an opening book), or returning\n # immediately if there are no legal moves\n\n max_depth = 0\n try:\n # The search method call (alpha beta or minimax) should happen in\n # here in order to avoid timeout. The try/except block will\n # automatically catch the exception raised by the search method\n # when the timer gets close to expiring\n if self.iterative:\n #Perform iterative search\n num_of_remaining_moves = len(game.get_blank_spaces())\n for depth in range(1,num_of_remaining_moves):\n if self.time_left() <= self.TIMER_THRESHOLD:\n return move\n\n if self.method == 'alphabeta':\n iterative_best_score, iterative_best_move = self.alphabeta(game, depth)\n else:\n iterative_best_score, iterative_best_move = self.minimax(game, depth)\n\n #Stores score and move of the deepest search\n score = iterative_best_score\n move = iterative_best_move\n max_depth = depth\n else:\n #Perform fixed-depth search\n if self.method == 'alphabeta':\n score, move = self.alphabeta(game, self.search_depth)\n else:\n score, move = self.minimax(game, self.search_depth)\n\n except Timeout:\n # Handle any actions required at timeout, if necessary\n pass\n\n return move","def getLegalMoves(cls, piece, layout):\n color = cls._getColorAt(piece, layout)\n if color == \"w\":\n direction = \"b\"\n else:\n direction = \"f\"\n\n unfiltered_moves = []\n\n if cls._isKing(piece, layout):\n left, right = cls.adjacency_matrix[piece][\"b\"]\n unfiltered_moves.extend([left, right])\n left, right = cls.adjacency_matrix[piece][\"f\"]\n unfiltered_moves.extend([left, right])\n else:\n left, right = cls._getMoves(piece, direction)\n unfiltered_moves.extend([left, right])\n\n # remove None destinations from the list (board edges)\n filtered_moves = list(filter(lambda x: x != None, unfiltered_moves))\n\n # move destination is an opponent\n possible_jumps = list(\n filter(lambda x: cls._isOpponent(color, x, layout), filtered_moves)\n )\n if possible_jumps:\n # process jumps first because you MUST jump\n unfiltered_jumps = list(\n map(lambda x: cls._canJump(x, piece, layout), possible_jumps)\n )\n jumps = list(filter(lambda x: x != None, unfiltered_jumps))\n # we don't care about moves if we have jumps\n if jumps:\n return {\"jumps\": jumps}\n\n # if we got here, process moves\n moves = list(\n filter(\n lambda x: cls.Pieces.NONE == cls._getColorAt(\n x, layout), filtered_moves\n )\n )\n return {\"moves\": list(moves)}","def available_moves(self):\n\n heaps = range(len(self.heaps))\n return [(h, take) for h in range(len(self.heaps))\n for take in range(1, self.heaps[h] + 1)]","def GetMoves(self):\n return [(source, target) for source in self.scores.keys() for target in self.fullGraph.neighbors_iter(source) if target not in self.pathes[source].nodes]","def get_potential_moves(self):\n\n return self._potential_moves","def _get_piece_moves(self, x, y):\n\n piece = self.get_piece(x, y)\n moves = []\n\n if not piece:\n return moves\n\n if piece.name == 'rook' or piece.name == 'queen':\n direcs = ['up', 'down', 'left', 'right']\n moves = [self._get_moves_indirection(x, y, direc) for direc in\n direcs]\n\n elif piece.name == 'bishop' or piece.name == 'queen':\n direcs = ['d1', 'd2', 'd3', 'd4']\n for direc in direcs:\n moves += self._get_moves_indirection(x, y, direc)\n\n elif piece.name == 'king':\n moves = [(x-1, y-1), (x-1, y), (x-1, y+1), (x, y-1),\n (x, y+1), (x+1, y-1), (x+1, y), (x+1, y+1)]\n\n elif piece.name == 'knight':\n moves = [(x-1, y-2), (x-2, y-1), (x-2, y+1), (x-1, y+2),\n (x+1, y+2), (x+2, y+1), (x+1, y-2), (x+2, y-1)]\n\n elif piece.name == 'pawn':\n if piece.color == ChessGame.BLACK:\n moves = [(x-1, y), (x-1, y-1), (x-1, y+1)]\n else:\n moves = [(x+1, y), (x+1, y-1), (x+1, y+1)]\n\n tmp = list(moves)\n for u, v in tmp:\n if v != y and not self.is_enemy(u, v, piece.color):\n moves.remove((u, v))\n\n if v == y and self.is_enemy(u, v, piece.color):\n moves.remove((u, v))\n\n mycolor = piece.color\n valid = set()\n for (u, v) in moves:\n if not self.in_bounds(u, v):\n continue\n\n if not self.get_piece(u, v): # board is blank\n valid.add((u, v))\n\n if self.is_enemy(u, v, mycolor):\n valid.add((u, v))\n\n return valid","def get_untried_moves(self, legal_moves):\n\n\t\t# Find all moves for which this node *does* have children\n\t\ttried_moves = [child.move for child in self.child_nodes]\n\n\t\t# Return all moves that are legal but have not been tried yet\n\t\treturn [move for move in legal_moves if move not in tried_moves]","def get_available_moves(self, team_color):\n squares = self.squares_with_pieces_of_color(team_color)\n moves = []\n for square in squares:\n moves.extend(square.get_moves(self))\n return moves","def get_possible_moves(self) -> list:\n result = []\n for lst in self.hori_lst:\n for item in lst:\n if item.isalpha():\n result.append(item)\n\n # add nodes to result if it's not taken and its line is not taken\n # for i in range(len(self.hori_lst)):\n # if not self.hori_result[i].isdigit():\n # for item in self.hori_lst[i]:\n # if not item.isdigit():\n # result.append(item)\n # # remove the node from result if its line has been taken\n # for i in range(len(self.left_lst)):\n # if self.left_result[i].isdigit():\n # for item in self.left_lst[i]:\n # if item in result:\n # result.remove(item)\n # # remove the node from result if its line has been taken\n # for i in range(len(self.right_lst)):\n # if self.right_result[i].isdigit():\n # for item in self.right_lst[i]:\n # if item in result:\n # result.remove(item)\n return result","def get_all_moves(board, player):\n moves = []\n if not (player_has_won(board, player) or\n player_has_won(board, utils.get_opponent(player)) or\n (not is_valid_board(board))):\n for index in range(9):\n if board[index] == config.NO_PLAYER:\n moves += [index]\n return moves","def __moves_available(self, board: Board):\n player_moves = self.get_num_of_moves(board, self.player_color)\n opponent_moves = self.get_num_of_moves(board, self.opponent_color)\n # print(len(player_moves), len(opponent_moves))\n\n return player_moves - opponent_moves * 3","def get_tiger_possible_moves(self) -> List:\n moves = []\n for pos in self.get_all_positions():\n if pos.is_tiger():\n addr_from = pos.address\n for addr_to in pos.piece.get_valid_moves():\n moves.append((addr_from, addr_to))\n\n return moves","def get_legal(self, player):\n for start in map(tuple, np.argwhere(self._board == player)):\n yield from (\n (start, end)\n for end in self.paths(start)\n if self._check_zone_locks(start, end)\n )","def ai_move():\n\tinitial_state = map(get_filled_edges, rects)\n\tpossible_moves = []\n\tfor index, filled_edges in enumerate(initial_state):\n\t\tif filled_edges == 0:\n\t\t\tpossible_moves.extend([(index, i) for i in 'ltrb'])\n\t\telif filled_edges == 1:\n\t\t\tpossible_moves.extend(one_filled_edge(index))\n\t\telif filled_edges == 2:\n\t\t\tpossible_moves.extend(two_filled_edge(index))\n\t\telif filled_edges == 3:\n\t\t\tpossible_moves.extend(three_filled_edge(index))\n\tprint possible_moves\n\tpossible_decisions = []\n\tfor move in possible_moves:\n\t\tfinal_state = apply_move(move)\n\t\tpossible_decisions.append(is_feasible(initial_state, final_state))\n\tprint possible_decisions\n\t# randomizing when some decisions have the same weight\n\tmax_weight = max(possible_decisions)\n\t# list of indices which have the same weight\n\tmax_indices = []\n\tfor index, weight in enumerate(possible_decisions):\n\t\tif weight == max_weight:\n\t\t\tmax_indices.append(index)\n\tx = choice(max_indices)\n\tprint x\n\treturn possible_moves[x]\n\t# return possible_moves[possible_decisions.index(max(possible_decisions))]","def get_move(self, game, legal_moves, time_left):\n logging.debug(\"get_move - legal moves: %s\", str(legal_moves))\n \n self.time_left = time_left\n\n\n # Check if we have any legal moves\n if not legal_moves:\n return (-1, -1)\n\n # Let's set best move so far to be the first legal move so we always \n # have something to return in case of timeout\n self.best_move_so_far = legal_moves[0]\n \n \n # Perform any required initializations, including selecting an initial\n # move from the game board (i.e., an opening book), or returning\n # immediately if there are no legal moves\n\n try:\n # The search method call (alpha beta or minimax) should happen in\n # here in order to avoid timeout. The try/except block will\n # automatically catch the exception raised by the search method\n # when the timer gets close to expiring\n if self.iterative:\n it = 1\n while True:\n if self.method == 'minimax':\n _, self.best_move_so_far = self.minimax(game, it)\n else:\n _, self.best_move_so_far = self.alphabeta(game, it)\n it += 1\n else: \n if self.method == 'minimax':\n _, self.best_move_so_far = self.minimax(game, self.search_depth)\n else:\n _, self.best_move_so_far = self.alphabeta(game, self.search_depth)\n\n except Timeout:\n # Handle any actions required at timeout, if necessary\n logging.debug(\"Time is up - get_move returning: %s\", str(self.best_move_so_far))\n return self.best_move_so_far\n\n # Return the best move from the last completed search iteration\n logging.debug(\"get_move returning: %s\", str(self.best_move_so_far))\n\n return self.best_move_so_far","def get_valid_moves(self):\r\n validMoves = []\r\n\r\n for x in range(BOARD_SIZE):\r\n for y in range(BOARD_SIZE):\r\n pos = np.array([x,y])\r\n if self.board[pos[0],pos[1]] == 0:\r\n if(self.update_board(pos,_testing=True)):\r\n validMoves.append(pos)\r\n\r\n return validMoves","def possible_moves(self, side: models.Side) -> typing.Iterator[\n typing.Tuple[models.Piece, int, int]]:\n raise NotImplementedError","def get_move(self, game, legal_moves, time_left):\n\n self.time_left = time_left\n\n # TODO: finish this function!\n\n # Perform any required initializations, including selecting an initial\n # move from the game board (i.e., an opening book), or returning\n # immediately if there are no legal moves\n moves = game.get_legal_moves()\n best_move = (-1, -1)\n best_score = float(\"-inf\")\n depth = 1\n if moves:\n best_move = moves[0]\n else :\n return best_move\n \n\n try:\n # The search method call (alpha beta or minimax) should happen in\n # here in order to avoid timeout. The try/except block will\n # automatically catch the exception raised by the search method\n # when the timer gets close to expiring\n if not self.iterative:\n if self.method == 'minimax':\n _, best_move = self.minimax(game, self.search_depth)\n elif self.method == 'alphabeta':\n _, best_move = self.alphabeta(game, self.search_depth) \n else:\n while self.time_left() > self.TIMER_THRESHOLD:\n if self.method == 'minimax':\n score, move = self.minimax(game, depth)\n elif self.method == 'alphabeta':\n score, move = self.alphabeta(game, depth)\n if score > best_score:\n best_move = move\n depth += 1 \n\n\n except Timeout:\n # Handle any actions required at timeout, if necessary\n pass\n\n # Return the best move from the last completed search iteration\n return best_move","def get_best_moves(self):\n return self.best_moves","def checkMoves(self,board):\n possibleMoves = []\n\n for c in xrange(0,8):\n for r in xrange(0,8):\n if board.isValidMove(self.tile,c,r):\n possibleMoves.append(c+r*8)\n\n return possibleMoves","def get_all_valid_moves(self, player):\n moves = [] # Stores the possible moves\n capture_move_exists = False # Indicates if a capturing move is possible\n\n for piece in self.get_all_pieces(player):\n valid_moves = self._get_valid_moves(piece)\n\n for move, skip in valid_moves.items():\n moves.append([(piece.row, piece.col), move, skip])\n\n if len(skip) > 0:\n # Checks if there is a move that can capture a piece\n capture_move_exists = True\n\n if capture_move_exists:\n # Only gets the capturing moves if there is one\n eating_moves = []\n for move in moves:\n if len(move[2]) != 0:\n eating_moves.append(move)\n\n moves = eating_moves\n\n return moves","def possible_moves(self):\n states = []\n possible_floors = self.possible_floors()\n possible_items = self.possible_items()\n\n for fl in possible_floors:\n for items in possible_items:\n new_floors = deepcopy(self.floors)\n for item in items:\n new_floors[self.lift_floor].remove(item)\n new_floors[fl].append(item)\n\n if self.validate_floors(new_floors):\n states.append(\n GameState(new_floors, lift_floor=fl, moves=self.moves+1)\n )\n\n return states","def actions(board):\n avail_moves = set()\n\n for i in range(3):\n for j in range(3):\n if board[i][j] == EMPTY:\n avail_moves.add((i,j))\n \n if len(avail_moves) == 0:\n return 0\n\n return avail_moves"],"string":"[\n \"def get_moves(self, board):\\n self.available_moves = [move for move in board.legal_moves]\",\n \"def get_available_moves(self, board):\\n pass\",\n \"def get_legal_moves(self):\\n # for each square in the castle figure out if an moves can occur from it.\\n moves = []\\n allowed = [self.turn]\\n if self.turn == DEFENDER:\\n allowed.extend((KING, CASTLE_OCCUPIED))\\n it = np.nditer(self.board_state, flags=['multi_index'])\\n while not it.finished:\\n index = it.multi_index\\n curr_loc = it[0]\\n if curr_loc in allowed:\\n moves.extend(self.get_legal_move_piece(curr_loc, index))\\n it.iternext()\\n return moves\",\n \"def availablemoves(moves):\\n useravailablemoves = []\\n for move in moves:\\n useravailablemoves.append(move['move'])\\n return(useravailablemoves)\",\n \"def legal_moves():\\n\\tlegal_moves = (\\\"r\\\", \\\"p\\\", \\\"s\\\")\\n\\treturn legal_moves\",\n \"def get_legal_moves(self):\\n moves = []\\n if self.player_locations[self.whose_turn] is None:\\n return self.get_blank_locations()\\n matrix = [(1,0), (-1,0), (0,1), (0,-1), (1,1), (1,-1), (-1, 1), (-1,-1)]\\n\\n for dx, dy in matrix:\\n x,y = self.player_locations[self.whose_turn]\\n while x+dx <= xdim and x+dx >= 0 and y+dy <= ydim and y+dy >= 0:\\n x = x+dx\\n y = y+dx\\n if self.board[x][y] : break\\n moves.append((x,y))\\n return moves\",\n \"def get_legal_moves(self):\\n\\n return self._legal_moves\",\n \"def get_all_moves(self, board, player):\\n result = []\\n for startx in range(8):\\n for starty in range(8):\\n for destx in range(8):\\n for desty in range(8):\\n if self.is_legal_move(board, [startx, starty], [destx, desty], player):\\n result.append([[startx, starty], [destx, desty]])\\n return result\",\n \"def get_legal_moves(self, pos: Position, game_board: GameBoard) -> PossibleMoveSet:\\n pass\",\n \"def get_available_moves(self):\\n available = []\\n row, col = tuple(self.current_pos)\\n if row - 1 >= 0 and self.maze[row - 1][col] != 'x':\\n available.append('n')\\n if row + 1 < len(self.maze) and self.maze[row + 1][col] != 'x':\\n available.append('s')\\n if col - 1 >= 0 and self.maze[row][col - 1] != 'x':\\n available.append('w')\\n if col + 1 < len(self.maze[row]) and self.maze[row][col + 1] != 'x':\\n available.append('e')\\n return available\",\n \"def get_valid_moves(self):\\r\\n # castling and en-passant rights are stored, because move affects these values\\r\\n temp_enpassant_possible = self.enpas_pos\\r\\n temp_castle = CastleRights(self.cr_castle_r.wks, self.cr_castle_r.bks,\\r\\n self.cr_castle_r.wqs, self.cr_castle_r.bqs)\\r\\n\\r\\n # for validating a possible move\\r\\n #1 all possibile moves are generated\\r\\n #2 each pos moves are made\\r\\n #3 generate opponent move\\r\\n #4 check if any of those moves let the king attacked\\r\\n #5 moves which let the king in chess are eliminated\\r\\n #6 the moves are undone\\r\\n moves = self.get_all_possible_moves() # 1\\r\\n\\r\\n # castle moves are directly introduced in valid moves\\r\\n if not self.turn_white:\\r\\n self.get_castle_moves(self.bKingPos[0], self.bKingPos[1], moves)\\r\\n else:\\r\\n self.get_castle_moves(self.wKingPos[0], self.wKingPos[1], moves)\\r\\n\\r\\n for i in range(len(moves) - 1, -1, -1): # 2\\r\\n self.make_move(moves[i])\\r\\n # 3 #4\\r\\n self.turn_white = not self.turn_white\\r\\n if self.in_check():\\r\\n moves.remove(moves[i]) # 5\\r\\n self.turn_white = not self.turn_white\\r\\n self.undo_move()\\r\\n\\r\\n # game ending possibilities\\r\\n if len(moves) == 0:\\r\\n if self.in_check():\\r\\n self.checkMate = True\\r\\n print(\\\"Checkmate !\\\")\\r\\n else:\\r\\n self.staleMate = True\\r\\n print(\\\"Stalemate !\\\")\\r\\n else:\\r\\n self.checkMate = False\\r\\n self.staleMate = False\\r\\n\\r\\n # the rigths are restored, and the values are not affected\\r\\n self.enpas_pos = temp_enpassant_possible\\r\\n self.cr_castle_r = temp_castle\\r\\n\\r\\n return moves\",\n \"def get_available_moves(self, board):\\n available_moves = []\\n for fieldx in range(len(board)):\\n column = []\\n for fieldy in range(len(board)):\\n legit_move = board[self.posy][self.posx].is_valid_move(board, fieldx, fieldy)\\n column.append(legit_move)\\n available_moves.append(column)\\n return available_moves\",\n \"def get_legal_moves(self, current_player):\\n\\t\\tlegal_moves = []\\n\\t\\tfor row in range(self.board_size):\\n\\t\\t\\tfor col in range(self.board_size):\\n\\t\\t\\t\\tif self.board.repr[row][col] == self.player_symbol[current_player]:\\n\\t\\t\\t\\t\\tposition = (row,col)\\n\\t\\t\\t\\t\\tmove_fn_list = [self.north_move,\\n\\t\\t\\t\\t\\t\\t\\t\\t self.east_move,\\n\\t\\t\\t\\t\\t\\t\\t\\t self.south_move,\\n\\t\\t\\t\\t\\t\\t\\t\\t self.west_move]\\n\\t\\t\\t\\t\\tfor move_fn in move_fn_list:\\n\\t\\t\\t\\t\\t\\tmove = move_fn(position)\\n\\t\\t\\t\\t\\t\\tif self.is_legal_move(current_player,move):\\n\\t\\t\\t\\t\\t \\t\\tlegal_moves.append(move)\\n\\t\\t\\t\\t\\t \\t\\t# now we are going to check for a double jump!\\n\\t\\t\\t\\t\\t \\t\\tstart = move[0]\\n\\t\\t\\t\\t\\t \\t\\tcur_end = move[1]\\n\\t\\t\\t\\t\\t \\t\\tnew_board = copy.deepcopy(self.board)\\t# Make a copy of the board, and then make the move on that board\\n\\t\\t\\t\\t\\t \\t\\tnew_board.movePiece(start,cur_end)\\n\\t\\t\\t\\t\\t \\t\\tcontinue_move = move_fn(cur_end)\\t\\t# Try to move again in the same direction\\n\\t\\t\\t\\t\\t \\t\\tnew_game_state = Game(self.board_size,new_board,current_player)\\t\\t\\t# make a whole new game state and check if our move is legal on that \\n\\t\\t\\t\\t\\t \\t\\twhile(new_game_state.is_legal_move(current_player, continue_move)):\\n\\t\\t\\t\\t\\t \\t\\t\\tstart_cur = cur_end\\n\\t\\t\\t\\t\\t \\t\\t\\tcur_end = continue_move[1]\\n\\t\\t\\t\\t\\t \\t\\t\\tlegal_moves.append((start,cur_end))\\n\\t\\t\\t\\t\\t\\t \\t\\tnew_board = copy.deepcopy(new_board)\\n\\t\\t\\t\\t\\t \\t\\t\\tnew_board.movePiece(start_cur,cur_end)\\n\\t\\t\\t\\t\\t \\t\\t\\tcontinue_move = move_fn(cur_end)\\n\\t\\t\\t\\t\\t \\t\\t\\tnew_game_state = Game(new_game_state.board_size,new_board,current_player)\\n\\t\\treturn legal_moves\",\n \"def get_moves(self):\",\n \"def available_moves(self):\\n moves = []\\n for x, y in self.available_boards:\\n moves.extend([self.to_position(x, y, i, j) for (i, j)\\n in self.boards[x][y].empty_squares])\\n return moves\",\n \"def legal_moves(player, board):\\n return [sq for sq in Othello.squares() if Othello.is_legal(sq, player, board)]\",\n \"def legal_moves_in_uci(self):\\n\\n # get all legal moves. 'legal_moves' is inherited attribute from super class that returns all possible moves\\n return [m.uci() for m in list(self.legal_moves)]\",\n \"def get_all_available_moves(self, board):\\n available_attacks = self.get_available_attacks(board)\\n if any(True in sublist for sublist in available_attacks):\\n attack = True\\n return available_attacks, attack\\n else:\\n available_moves = self.get_available_moves(board)\\n attack = False\\n return available_moves, attack\",\n \"def find_moves(self):\\n\\n from itertools import product\\n free_position = self.find_free()\\n return [list(free_position+i) for i in [[0,1],[1,0],[-1,0],[0,-1]] if tuple(i+free_position) in product(range(self.size),repeat=2)]\",\n \"def get_goat_possible_moves(self) -> List:\\n moves = []\\n for pos in self.get_all_positions():\\n if pos.is_goat():\\n addr_from = pos.address\\n for addr_to in pos.piece.get_valid_moves():\\n moves.append((addr_from, addr_to))\\n\\n return moves\",\n \"def get_legal_moves(self, board):\\n moves = set()\\n capture_moves = set()\\n for move in self.pot_moves:\\n target_row = self.field_row + move[0]\\n target_col = self.field_col + move[1]\\n if not (target_row > 7 or target_row < 0 or target_col > 7 or target_col < 0):\\n if board.status[target_row, target_col] == 0:\\n moves.add(move)\\n if board.status[target_row, target_col] * self.color_value < 0:\\n capture_moves.add(move)\\n self.legal_moves = moves\\n self.legal_capture_moves = capture_moves\",\n \"def legal_moves(self, player, board):\\r\\n #go through the whole board and check whether the piece is on the board or not\\r\\n #num/row size - num%col == num2/row size - num@%col\\r\\n #num/row size + num%col\\r\\n moves = list()\\r\\n opp = self.opponent(player)\\r\\n #print(board)\\r\\n for i in self.squares():\\r\\n if board[i] == core.EMPTY:\\r\\n for d in core.DIRECTIONS:\\r\\n endPt = self.find_bracket(i, player, board, d)\\r\\n if endPt!= None:\\r\\n moves.append(i)\\r\\n break\\r\\n\\r\\n return moves\",\n \"def get_all_moves(self):\\n # 2d matrix of true/false, true if something can be placed\\n legal_move_board = []\\n possible_move_list = []\\n for row in range(self.size):\\n move_row = []\\n for col in range(self.size):\\n empty = self.board[row][col].state == PegState.EMPTY\\n move_row.append(empty)\\n if empty:\\n possible_move_list.append((row, col))\\n legal_move_board.append(move_row)\\n \\n # every position where something can be placed (list of tuples) (Combined with above)\\n \\\"\\\"\\\" possible_move_list = []\\n for row in range(self.size):\\n for col in range(self.size):\\n if legal_move_board[row][col] == True:\\n possible_move_list.append((row, col))\\n \\\"\\\"\\\"\\n return legal_move_board, possible_move_list\",\n \"def get_legal_moves(self, board):\\n moves = set()\\n capture_moves = set()\\n if not (self.field_row*self.color_value == 1 or self.field_row*self.color_value == -6):\\n self.pot_moves = {(1*self.color_value, 0)}\\n\\n for move in self.pot_moves:\\n target_row = self.field_row + move[0]\\n target_col = self.field_col + move[1]\\n if self.path_clear(board, move, target_row, target_col):\\n if board.status[target_row, target_col] * self.color_value == 0:\\n moves.add(move)\\n\\n for move in self.pot_capture_moves:\\n target_row = self.field_row + move[0]\\n target_col = self.field_col + move[1]\\n if self.path_clear(board, move, target_row, target_col):\\n if board.status[target_row, target_col] * self.color_value < 0:\\n capture_moves.add(move)\\n self.legal_moves = moves\\n self.legal_capture_moves = capture_moves\",\n \"def get_legal_moves(self, player):\\r\\n move_list = []\\r\\n if self._phase == GamePhase.SETUP:\\r\\n return self._setup_legal_moves(player)\\r\\n elif self._phase == GamePhase.MOVE:\\r\\n return self._move_legal_moves(player)\\r\\n elif self._phase == GamePhase.BUILD:\\r\\n return self._build_legal_moves(player)\\r\\n return move_list\",\n \"def get_moves(self):\\n grid = self.model.grid\\n # List of agents we can't overlap with\\n no_overlap = [\\\"wall\\\", \\\"human\\\", \\\"zombie\\\"]\\n\\n if self.agent_type == \\\"zombie\\\" or \\\\\\n (\\\"AvoidingZombie\\\" not in self.states and os.environ[\\\"mode\\\"] == \\\"5\\\"):\\n no_overlap.append(\\\"road\\\")\\n\\n # Always give the option to stay on your current location(stand still)\\n all_cells = self.neighbors()\\n free_cells = [self.pos]\\n\\n # Get rid of cells that we may not move to by iterating through all\\n # cells next to the agent, and only adding non-occupied cells\\n for cell in all_cells:\\n cell_occupied = False\\n x, y = cell.pos\\n # If there are agents in the current cell, and we are not allowed\\n # to overlap with any of those agents, the cell is occupied.\\n # Only add cells which are not occupied.\\n if not grid.is_cell_empty((x, y)):\\n for agent in grid[x][y]:\\n if agent.agent_type in no_overlap:\\n cell_occupied = True\\n break\\n if not cell_occupied:\\n free_cells.append((x, y))\\n return free_cells\",\n \"def get_legal_moves(self, color):\\n moves = [] # stores the legal moves.\\n # Get all the squares with pieces of the given color.\\n for x in range(self.n):\\n for y in range(self.n):\\n if self[x][y]==0:\\n moves.append((x,y))\\n return moves\",\n \"def get_all_game_pieces_potential_moves(self):\\n\\n board = self.get_board()\\n\\n for row in board:\\n\\n for column in row:\\n\\n if column is not None:\\n\\n print(column.get_label(), ': ' , column.get_potential_moves())\",\n \"def get_legal_moves(self, board):\\n moves = set()\\n capture_moves = set()\\n for move in self.pot_moves:\\n target_row = self.field_row + move[0]\\n target_col = self.field_col + move[1]\\n if self.path_clear(board, move, target_row, target_col):\\n if board.status[target_row, target_col] * self.color_value == 0:\\n moves.add(move)\\n if board.status[target_row, target_col] * self.color_value < 0:\\n capture_moves.add(move)\\n self.legal_moves = moves\\n self.legal_capture_moves = capture_moves\",\n \"def all_valid_moves(self, cur_board, all_english_words):\\r\\n rack_to_str = self.convert_rack_to_str()\\r\\n if len(rack_to_str) == 0:\\r\\n return [] \\r\\n \\r\\n moves_made = cur_board.find_words_on_board()\\r\\n actual_words = []\\r\\n\\r\\n if cur_board.board_empty: #no one has played yet.\\r\\n return Utils.get_all_legal_combos([\\\"\\\"], rack_to_str, all_english_words)\\r\\n\\r\\n\\r\\n\\r\\n \\r\\n for move in moves_made:\\r\\n actual_words.append(move[0]) #the first element is a string, representing the actual move made.\\r\\n \\r\\n \\r\\n return Utils.get_all_legal_combos(actual_words, rack_to_str, all_english_words)\",\n \"def available_moves(self):\\n available_moves = []\\n for i in range(self.quadrants_count):\\n quadrant_positions = self.play_area[i].available_positions()\\n for p in quadrant_positions:\\n position = p + i * 9\\n for j in range(self.quadrants_count):\\n move1 = [str(position), str(j + 1), \\\"l\\\"]\\n move2 = [str(position), str(j + 1), \\\"r\\\"]\\n available_moves.append(\\\" \\\".join(move1))\\n available_moves.append(\\\" \\\".join(move2))\\n return available_moves\",\n \"def get_all_legal_moves(\\n old_board, current_board, player: int\\n) -> List[Tuple[Tuple, Tuple]]:\\n possible_pieces_to_move, open_position = _check_open_rule(\\n old_board=old_board, new_board=current_board, player=player\\n )\\n if open_position and len(possible_pieces_to_move) > 0:\\n return [(pos, open_position) for pos in possible_pieces_to_move]\\n else:\\n # list[tuple[int,int]]\\n owned_positions = [\\n (r, c) for r in range(5) for c in range(5) if current_board[r][c] == player\\n ]\\n # list[tuple[tuple,tuple]]\\n return [\\n (pos, new_pos)\\n for pos in owned_positions\\n for new_pos in _get_empty_neighbors(pos, current_board)\\n ]\",\n \"def get_legal_moves(self, i, j):\\r\\n legal_moves = list()\\r\\n for action in self.action_dic.keys():\\r\\n coordinate_change = self.action_dic[action]\\r\\n new_i = coordinate_change[0] + i\\r\\n new_j = coordinate_change[1] + j\\r\\n if (new_i >= 0 and new_i < 3) and (new_j >= 0 and new_j < 3):\\r\\n legal_moves.append(self.reflection_dic[action])\\r\\n return legal_moves\",\n \"def get_valid_moves(self):\\n if self.king:\\n valid_moves = [[self.row + 1, self.col + 1],\\n [self.row + 1, self.col - 1],\\n [self.row - 1, self.col - 1],\\n [self.row - 1, self.col + 1]]\\n else:\\n if self.player == 1:\\n valid_moves = [[self.row + 1, self.col + 1],\\n [self.row + 1, self.col - 1]]\\n else:\\n valid_moves = [[self.row - 1, self.col - 1],\\n [self.row - 1, self.col + 1]]\\n return valid_moves\",\n \"def get_legal_nearby_moves(self, nearby_length=1):\\n moves = []\\n for row, col in self.get_legal_moves():\\n if not self._is_nearby_empty(nearby_length, row, col):\\n moves.append((row, col))\\n\\n return moves or None\",\n \"def get_next_moves(board, player):\\r\\n\\r\\n if player == 'hare':\\r\\n moves = []\\r\\n next_moves = []\\r\\n\\r\\n (row_from, col_from) = get_hare_positions(board)\\r\\n moves = possible_moves_list(row_from, col_from)\\r\\n\\r\\n for move in moves:\\r\\n row_to = move[0]\\r\\n col_to = move[1]\\r\\n\\r\\n if is_legal_move(player, row_from, col_from, row_to, col_to):\\r\\n \\\"\\\"\\\" if move is allowed then add to list of next moves\\\"\\\"\\\"\\r\\n next_moves.append(move)\\r\\n\\r\\n return next_moves\\r\\n\\r\\n else:\\r\\n \\\"\\\"\\\" for individual hounds\\r\\n get next moves\\\"\\\"\\\"\\r\\n moves = []\\r\\n next_moves_hound1 = []\\r\\n next_moves_hound2 = []\\r\\n next_moves_hound3 = []\\r\\n\\r\\n (row_hound_1, col_hound_1), (row_hound_2, col_hound_2), (row_hound_3, col_hound_3) = get_hound_positions(board)\\r\\n moves_hound1 = possible_moves_list(row_hound_1, col_hound_1)\\r\\n moves_hound2 = possible_moves_list(row_hound_2, col_hound_2)\\r\\n moves_hound3 = possible_moves_list(row_hound_3, col_hound_3)\\r\\n\\r\\n for move in moves_hound1:\\r\\n row_to = move[0]\\r\\n col_to = move[1]\\r\\n\\r\\n if is_legal_move(player, row_hound_1, col_hound_1, row_to, col_to):\\r\\n next_moves_hound1.append(move)\\r\\n\\r\\n for move in moves_hound2:\\r\\n row_to = move[0]\\r\\n col_to = move[1]\\r\\n\\r\\n if is_legal_move(player, row_hound_2, col_hound_2, row_to, col_to):\\r\\n next_moves_hound2.append(move)\\r\\n\\r\\n for move in moves_hound3:\\r\\n row_to = move[0]\\r\\n col_to = move[1]\\r\\n\\r\\n if is_legal_move(player, row_hound_3, col_hound_3, row_to, col_to):\\r\\n next_moves_hound3.append(move)\\r\\n\\r\\n return (next_moves_hound1, next_moves_hound2, next_moves_hound3)\",\n \"def test_get_legal_moves():\\n board = Board(*TEST_AGRU2)\\n comp = Computer(board, COMP_DISK, HUMAN_DISK)\\n comp.b.columns_list = [\\n [HUMAN_DISK],\\n [HUMAN_DISK, HUMAN_DISK],\\n [HUMAN_DISK, HUMAN_DISK, HUMAN_DISK]\\n ]\\n comp.b.new_disk = (MOVE2)\\n assert set(comp.get_legal_moves(comp.b)) == {(1, 0), (0, 1)}\",\n \"def __find_all_moves(self, tower) -> list:\\r\\n choice = []\\r\\n for height in range(1,len(tower.tower)-2):\\r\\n for index in range(1,4):\\r\\n if self.stat_brain.is_valid(height, index, tower):\\r\\n choice.append((height, index))\\r\\n \\r\\n r.shuffle(choice)\\r\\n return choice\",\n \"def get_possible_moves(self) -> list:\\n if self.p1_turn:\\n name = '2'\\n else:\\n name = '1'\\n\\n count = 0\\n for i in self.claim:\\n if i == name:\\n count += 1\\n over = count >= 0.5 * len(self.claim)\\n\\n moves = []\\n if not over:\\n for i in self.letters:\\n if i.isalpha():\\n moves.append(i)\\n return moves\",\n \"def possible_moves(self):\\n lst_of_direcs = []\\n for a_car in self.__cars:\\n good_moves = a_car.possible_moves()\\n new = [(a_car.get_name(),dire, des) for dire, des\\\\\\n in good_moves.items()]\\n lst_of_direcs.append(new[0])\\n lst_of_direcs.append(new[1])\\n return lst_of_direcs\",\n \"def get_possible_moves(self) -> list:\\n p1_count = 0\\n p2_count = 0\\n ley_line_total = (self.side_length + 1) * 3\\n for itype in self.current_ley_lines:\\n for line in itype:\\n if line[0] == '1':\\n p1_count += 1\\n if line[0] == '2':\\n p2_count += 1\\n if p1_count >= ley_line_total / 2 or p2_count >= ley_line_total / 2:\\n return []\\n moves = []\\n for letter in self.current_board:\\n if letter.isalpha():\\n moves.append(letter)\\n return moves\",\n \"def get_all_possible_moves(self, state):\\n move_list = []\\n done_finding_moves = False\\n any_non_pass_moves = False\\n while not done_finding_moves:\\n try:\\n m = next(self.move_generator) # Gets a (move, state) pair.\\n # print(\\\"next returns: \\\",m[0]) # Prints out the move. For debugging.\\n if m[0] != 'p':\\n any_non_pass_moves = True\\n move_list.append(m) # Add the move to the list.\\n except StopIteration as e:\\n done_finding_moves = True\\n if not any_non_pass_moves:\\n move_list.append(('p',state))\\n return move_list\",\n \"def possible_moves(self, pos: Point) -> List[Point]:\\n # logger.debug(f\\\"inside possible_moves {pos}\\\")\\n available_squares = []\\n for direction in Direction.cardinal():\\n # logger.debug(f\\\"direction = {direction}\\\")\\n neighbor = pos + direction\\n # logger.debug(f\\\"neighbor = {neighbor}\\\")\\n if neighbor.x < 1 or self.width - 2 < neighbor.x or neighbor.y < 1 or self.height - 2 < neighbor.y:\\n # logger.debug(f\\\"{neighbor} not in bounds\\\")\\n continue\\n if self.can_carve(pos, direction):\\n # logger.debug(f\\\"can_carve returned True pos={pos}, direction={direction}\\\")\\n available_squares.append(neighbor)\\n # logger.debug(f\\\"available squares:\\\")\\n # for square in available_squares:\\n # logger.debug(f\\\"square={square}\\\")\\n # logger.add(\\\"debug.log\\\")\\n return available_squares\",\n \"def get_all_moves(self, castling_allowed=True):\\n\\n can_move = str.isupper if self.white_to_move else str.islower\\n\\n valid_moves = set()\\n\\n for row_num, row in enumerate(self.board):\\n for col_num, piece in enumerate(row):\\n if piece != EMPTY_SPACE and can_move(piece):\\n\\n location = (row_num, col_num)\\n\\n # Everything except the pawn movement\\n if piece.lower() in NAME_TO_PIECE:\\n valid_moves = valid_moves.union(self._get_standard_moves_for_piece(location, piece))\\n\\n # Pawn moves\\n if piece.lower() == PAWN:\\n valid_moves = valid_moves.union(self._get_pawn_moves(location, piece))\\n\\n # Castling\\n if castling_allowed and piece.lower() == KING:\\n valid_moves = valid_moves.union(self._get_possible_castles(piece))\\n\\n return valid_moves\",\n \"def legal_moves(board,player=None):\\r\\n \\r\\n possible_moves = []\\r\\n moves = []\\r\\n if player == None:\\r\\n moves += board.white + board.black\\r\\n elif player == -1:\\r\\n moves += board.black\\r\\n elif player == 1:\\r\\n moves += board.white\\r\\n \\r\\n captured = False\\r\\n for pos in moves:\\r\\n if pos[0] == 'A':\\r\\n m = [-8,-7,1,8,9]\\r\\n elif pos[0] == 'H':\\r\\n m = [-9,-8,-1,7,8]\\r\\n else:\\r\\n m = [-9,-8,-7,-1,1,7,8,9]\\r\\n loc = decode(pos)\\r\\n for i in m:\\r\\n captured = capture(board, player, possible_moves, pos, loc, i)\\r\\n canter(board, player, possible_moves, pos, loc, i)\\r\\n plain(board, player, possible_moves, pos, loc, i)\\r\\n \\r\\n if captured:\\r\\n enemy_list = []\\r\\n for capturing_move in possible_moves:\\r\\n if len(capturing_move) == 3:\\r\\n enemy_list.append(capturing_move)\\r\\n possible_moves = list(enemy_list)\\r\\n\\r\\n return possible_moves\",\n \"def legalMoves(self):\\n moves = []\\n indexOfZero = self.tiles.index(0)\\n \\n if indexOfZero == 0:\\n moves.append('Down')\\n moves.append('Right')\\n elif indexOfZero == 1:\\n moves.append('Down')\\n moves.append('Left')\\n moves.append('Right')\\n elif indexOfZero == 2:\\n moves.append('Down')\\n moves.append('Left')\\n elif indexOfZero == 3:\\n moves.append('Up')\\n moves.append('Down')\\n moves.append('Right')\\n elif indexOfZero == 4:\\n moves.append('Up')\\n moves.append('Down')\\n moves.append('Left')\\n moves.append('Right')\\n elif indexOfZero == 5:\\n moves.append('Up')\\n moves.append('Down')\\n moves.append('Left')\\n elif indexOfZero == 6:\\n moves.append('Up')\\n moves.append('Right')\\n elif indexOfZero == 7:\\n moves.append('Up')\\n moves.append('Left')\\n moves.append('Right')\\n elif indexOfZero == 8:\\n moves.append('Up')\\n moves.append('Left')\\n else:\\n print('something wrong with board')\\n return moves\",\n \"def getPossibleMoves(self): # called to get possible positions this piece can go\\r\\n \\r\\n moves = {}\\r\\n\\r\\n ids = []\\r\\n\\r\\n for piece in self.board.pieces.values():\\r\\n if piece.name == \\\"empty\\\":\\r\\n piece.glow = False\\r\\n piece.ready = False\\r\\n\\r\\n self.piece = self\\r\\n\\r\\n def check(direction=\\\"left\\\", heading=\\\"north\\\", x=None, y=None):\\r\\n piece = self.piece\\r\\n if direction == \\\"left\\\": x -= 50\\r\\n else: x += 50\\r\\n\\r\\n if heading == \\\"north\\\": y -= 50\\r\\n else: y += 50\\r\\n\\r\\n if (x, y) in self.board.pieces: # position is empty\\r\\n empty = self.board.getPiece((x, y))\\r\\n empty.glow = True\\r\\n old, new, obj = (direction, heading), (x, y), piece\\r\\n identity = self.getRandomID(ids) # get an ID for the move\\r\\n moves[identity] = old, new, obj\\r\\n\\r\\n if piece.isKing: # piece is a king, so go on\\r\\n check(direction, heading, x, y)\\r\\n else: # its not empty, so check if its comrade\\r\\n x1, y1 = x+25, y+25\\r\\n piece2 = self.board.getPiece((x1, y1))\\r\\n try:\\r\\n if piece.isComrade(piece2):# piece is comrade so return\\r\\n return\\r\\n else: # piece is not comrade, so check empty\\r\\n if direction == \\\"left\\\": x2 = x1-25-50\\r\\n else: x2 = x1-25+50\\r\\n\\r\\n if heading == \\\"north\\\": y2 = y1-25-50\\r\\n else: y2 = y1-25+50\\r\\n\\r\\n if (x2, y2) in self.board.pieces: # its empty, so notify player\\r\\n empty = self.board.getPiece((x2, y2))\\r\\n empty.glow = True\\r\\n empty.ready = True\\r\\n\\r\\n old, new, obj = (direction, heading), (x2, y2), piece2\\r\\n identity = self.getRandomID(ids)\\r\\n moves[identity] = old, new, obj\\r\\n\\r\\n check(direction, heading, piece2.x-25, piece2.y-25)\\r\\n check(direction, heading, x2, y2)\\r\\n \\r\\n # check empty or comrade again\\r\\n if direction == \\\"left\\\": x3 = x2-50\\r\\n else: x3 = x2+50\\r\\n\\r\\n if heading == \\\"north\\\": y3 = y2-50\\r\\n else: y3 = y2+50\\r\\n\\r\\n if (x3, y3) in self.board.pieces: # positon(address) is empty\\r\\n return\\r\\n else: # there is a piece, so check if comrade, stop, if not comrade continue\\r\\n x3+=25\\r\\n y3+= 25\\r\\n\\r\\n piece3 = self.board.getPiece((x3, y3))\\r\\n if piece3.isComrade(piece2): # comrades, so stop\\r\\n return\\r\\n else: # not comrades, so continue\\r\\n self.piece = piece3\\r\\n check(direction, heading, x, y)\\r\\n\\r\\n #self.piece = piece2\\r\\n \\r\\n #check(direction, heading, x2, y2) # keep searching\\r\\n else: # its not empty, so return\\r\\n return\\r\\n except:\\r\\n pass\\r\\n\\r\\n if self.piece.name == \\\"white\\\": direction = \\\"north\\\"\\r\\n else: direction = \\\"south\\\"\\r\\n \\r\\n check(\\\"left\\\", direction, self.piece.x-25, self.piece.y-25)\\r\\n check(\\\"right\\\", direction, self.piece.x-25, self.piece.y-25)\\r\\n \\r\\n if self.piece.isKing:\\r\\n if self.piece.name == \\\"white\\\": heading = \\\"south\\\"\\r\\n else: heading = \\\"north\\\"\\r\\n \\r\\n check(\\\"left\\\", heading, self.piece.x-25, self.piece.y-25)\\r\\n check(\\\"right\\\", heading, self.piece.x-25, self.piece.y-25)\\r\\n\\r\\n if self.piece.name == \\\"white\\\":\\r\\n eatMoves = self.board.game.thinkEatMoves(moves, \\\"person\\\")\\r\\n if eatMoves is not None:\\r\\n return eatMoves\\r\\n\\r\\n return moves\",\n \"def get_legal_moves(self, player: int) -> np.ndarray:\\n stage2 = self.is_stage2()\\n action_mask = np.zeros((24, 5, 25), dtype=bool)\\n # if stage 1 add set options\\n array_board = np.array(self.board)\\n if not stage2:\\n legal_pos = np.where(array_board == 0)[0]\\n for pos in legal_pos:\\n if self.is_mill(player, pos, self.board): # current selection completes a mill\\n opp_pos = np.where(array_board == -player)[0]\\n opp_pos = [opp_p for opp_p in opp_pos if\\n not self.is_mill(-player, opp_p, self.board)] # can't remove opponent in mill\\n if len(opp_pos) == 0: # exception for the case where all opponents pieces are in mills\\n opp_pos = np.where(array_board == -player)[0]\\n action_mask[pos, -1, opp_pos] = True\\n else:\\n action_mask[pos, -1, -1] = True # place piece on board\\n else:\\n from_pos_cands = np.where(array_board == player)[0]\\n for from_pos in from_pos_cands:\\n mill_cands = [(orient, adj) for orient, adj in enumerate(self.adjacent[from_pos]) if\\n adj is not None and self.board[adj] == 0] # TODO added not, need to validate\\n if_played_board = self.board.copy()\\n if_played_board[from_pos] = 0\\n for (orient, adj) in mill_cands:\\n if self.is_mill(player, adj, if_played_board):\\n opp_pos = np.where(array_board == -player)[0]\\n opp_pos = [opp_p for opp_p in opp_pos if not self.is_mill(-player, opp_p, if_played_board)]\\n if len(opp_pos) == 0: # exception for the case where all opponents pieces are in mills\\n opp_pos = np.where(array_board == -player)[0]\\n action_mask[from_pos, orient, opp_pos] = True\\n else:\\n action_mask[from_pos, orient, -1] = True\\n\\n return action_mask\",\n \"def check_for_moves(self) -> list:\\r\\n avail_moves = []\\r\\n for x in range(self.size):\\r\\n for y in range(self.size):\\r\\n if self.tags[x][y] is None:\\r\\n avail_moves.append((x, y))\\r\\n return avail_moves\",\n \"def get_moves(self, board, position):\\n current_piece = board.grid[position[1]][position[0]]\\n\\n moves = []\\n\\n # For each direction in which the piece can move...\\n for direction in self.directions:\\n # for each vector in that direction...\\n # (once a piece is encountered in a direction,\\n # further positions in that direction are unaccessible,\\n # therefore break out of inner FOR loop)\\n for vector in direction:\\n new_position = (position[0] + vector[0], position[1] + vector[1])\\n\\n # Check if the proposed destination is inbounds\\n if board._inbounds(new_position) is False:\\n break\\n\\n other_piece = board.grid[new_position[1]][new_position[0]]\\n\\n # Check if the proposed destination is occupied by a friendly piece\\n if other_piece != \\\"empty\\\" and other_piece.player == current_piece.player:\\n break\\n\\n # Check other validity conditions, mainly for pawn\\n if self._is_valid_move(vector, current_piece, other_piece) is False:\\n break\\n\\n # The destination is viable, add the move\\n moves.append(Move(position, current_piece, new_position, other_piece))\\n\\n # If there was an enemy piece on the square\\n if other_piece != \\\"empty\\\":\\n break\\n\\n return moves\",\n \"def mappossiblemoves(self,nodeStart):\\n destinations = [set() for ix in range(game.DICEMAX+1)]\\n destinations[0] = set([nodeStart])\\n routes = [[nodeStart]]\\n #\\n # TODO: Not convinced this adds anything more than it harms in this fn.\\n #if self.hasEnteredRoomYet:\\n # GAMEBOARD = game.TRIMMEDNODES\\n #else:\\n GAMEBOARD = game.BOARDNODES\\n #\\n for diceRoll in range(1,game.DICEMAX+1):\\n newRoutes = []\\n for route in routes:\\n for nextLoc in GAMEBOARD[route[-1]]:\\n if not nextLoc in route:\\n # This location has not yet been visited by this route\\n if nextLoc in game.ALLOWEDROOMNODES:\\n # Location is a room - can move into it regardless\\n # of population, but not move further. We can also\\n # use any longer roll to move here by this route\\n for thisRoll in range(diceRoll,game.DICEMAX+1):\\n destinations[thisRoll].add(nextLoc)\\n else:\\n # Location is a square - can only move into it if\\n # unoccupied, but can move further once there.\\n if not nextLoc in self.charLocations:\\n # Unoccupied (could check against \\n # charLocations[1:] since we're the piece moving\\n # but a nextLoc = charLocations[0] would be\\n # rejected by being already in the route anyway)\\n newRoute = list(route)\\n newRoute.append(nextLoc)\\n newRoutes.append(newRoute)\\n destinations[diceRoll].add(nextLoc)\\n routes = newRoutes\\n #\\n return [list(destSet) for destSet in destinations]\",\n \"def get_possible_moves(self):\\n moves = []\\n for i in range(1, self.current_total + 1):\\n if i ** 2 <= self.current_total:\\n moves.append(i ** 2)\\n\\n return moves\",\n \"def find_moveable_pieces(self, die, p1): \\n moveable = []\\n if (p1):\\n #must we re-enter?\\n if (self.p1vec[0] > 0):\\n if (self.free_spot(0, die, p1)):\\n b = Board(self.p1vec[:],self.p2vec[:])\\n b.move(0, die, p1)\\n moveable.append(b)\\n #no? ok then generate the moves\\n else:\\n for i in range(1, 25):\\n if (self.p1vec[i] > 0):\\n if (self.free_spot(i, die, p1)):\\n b = Board(self.p1vec[:],self.p2vec[:])\\n b.move(i, die, p1)\\n moveable.append(b)\\n else:\\n #must we re-enter?\\n if (self.p2vec[0] > 0):\\n if (self.free_spot(0, die, p1)):\\n b = Board(self.p1vec[:],self.p2vec[:])\\n b.move(0, die, p1)\\n moveable.append(b)\\n #no? ok then generate the moves\\n else:\\n for i in range(1, 25):\\n if (self.p2vec[i] > 0):\\n if (self.free_spot(i, die, p1)):\\n b = Board(self.p1vec[:],self.p2vec[:])\\n b.move(i, die, p1)\\n moveable.append(b)\\n return moveable\",\n \"def getPossibleMovesOutCheck(player, board):\\n possibleMoves = []\\n for col in board:\\n for piece in col:\\n if type(piece) != int and piece.player == player:\\n pieceMoves = piece.availableMoves(board)\\n piecePosX = piece.posx\\n piecePosY = piece.posy\\n for move in pieceMoves:\\n copyBoard = copy.deepcopy(board)\\n #Do the move on the copied board\\n copyBoard[piecePosX][piecePosY] = 1\\n newPiece = copy.deepcopy(piece)\\n newPiece.posx = move[0]\\n newPiece.posy = move[1]\\n copyBoard[move[0]][move[1]] = newPiece\\n #Check if the copied board is now in check...\\n #if not then it is a valid move to do to get out of check\\n if not isInCheck(player, copyBoard):\\n possibleMoves.append(((piecePosX,piecePosY), move))\\n\\n return possibleMoves\",\n \"def possibleMoves(self,i,j):\\n piece = self.board[i][j].piece\\n if(piece.pieceCode == \\\"None\\\"):\\n return []\\n \\n if(piece.name == \\\"pawn\\\"):\\n return self.pawnMoves(piece,self.board)\\n elif(piece.name == \\\"king\\\"):\\n return self.kingSteps(self.board,piece.color)\\n else:\\n return self.pieceMoves(piece,self.board)\",\n \"def available_moves(board_state):\\n for x, y in itertools.product(range(len(board_state)), range(len(board_state[0]))):\\n if board_state[x][y] == 0:\\n yield (x, y)\",\n \"def get_move(self, game, legal_moves, time_left):\\n\\n self.time_left = time_left\\n \\n options = game.get_legal_moves()\\n assert options == legal_moves, \\\"Mismatched moves\\\"\\n\\n # Perform any required initializations, including selecting an initial\\n # move from the game board (i.e., an opening book), or returning\\n # immediately if there are no legal moves\\n\\n score, move = None, random.choice(legal_moves) if len(legal_moves) > 0 else None\\n try:\\n # Iterative deepening with Quiessance search:\\n if self.iterative is True:\\n results = deque(maxlen=3)\\n for depth in range (self.search_depth, 25):\\n score, move = self.dosearch(game, depth)\\n results.append((score, move))\\n if self.quiessant_search is True:\\n if len(results) >=3 and all(x[1] == move for x in results):\\n break\\n elif score == float('-inf') or score == float ('inf'):\\n break\\n if self.time_left() < self.TIMER_THRESHOLD:\\n break\\n else:\\n score, move = self.dosearch(game, self.search_depth)\\n assert score is not None\\n \\n if len (options) > 0:\\n assert not (move is None or move is (-1,-1)), \\\"Move ({}, {}) for '{}/{}' cannot be None or (-1,-1) if options ({}) exist\\\".format(move, score, self.method, self.score, options)\\n assert move in options, \\\"Move ({}, {}) for '{}/{}' not from existing list of moves ({})\\\".format(move, score, self.method, self.score, options)\\n except Timeout:\\n # Handle any actions required at timeout, if necessary\\n pass\\n\\n # Return the best move from the last completed search\\n # (or iterative-deepening search iteration)\\n return move\",\n \"def get_king_moves(self, state):\\n #king_moves = []\\n possible_moves = []\\n if self.color == cc.WHITE_ACTIVE:\\n enemy_color = cc.BLACK_ACTIVE\\n enemy_pieces = cc.BLACK_PIECES\\n elif self.color == cc.BLACK_ACTIVE:\\n enemy_color = cc.WHITE_ACTIVE\\n enemy_pieces = cc.WHITE_PIECES\\n else:\\n raise Exception(\\\"GameState: Invalid Active Color\\\")\\n\\n for vector in cc.KING_VECTORS:\\n rank = self.coord[0] + vector[0]\\n column = self.coord[1] + vector[1]\\n if rank in cc.VALID_RANKS and column in cc.VALID_RANKS:\\n if state.board[rank, column] == cc.NO_PIECE:\\n possible_moves.append(cc.Action(self.string, self.coord, (rank, column)))\\n elif state.board[rank, column] in enemy_pieces:\\n possible_moves.append(cc.Action(self.string, self.coord, (rank, column), capture=True))\\n \\n # # Iterate over list of king moves, removing ones that are under attack\\n # for move in possible_moves:\\n # if not check.space_under_attack(state, move.end, enemy_color):\\n # king_moves.append(move)\\n\\n return possible_moves\",\n \"def generate_possible_moves(self):\\r\\n\\t\\t# Moves:\\r\\n\\t\\t# 0 - North\\r\\n\\t\\t# 1 - East\\r\\n\\t\\t# 2 - South\\r\\n\\t\\t# 3 - West\\r\\n\\r\\n\\t\\tmoves = []\\r\\n\\r\\n\\t\\tif self.x != 0:\\r\\n\\t\\t\\tmoves.append(0)\\r\\n\\t\\tif self.y != self.n-1:\\r\\n\\t\\t\\tmoves.append(1)\\r\\n\\t\\tif self.x != self.n-1:\\r\\n\\t\\t\\tmoves.append(2)\\r\\n\\t\\tif self.y != 0:\\r\\n\\t\\t\\tmoves.append(3)\\r\\n\\r\\n\\t\\treturn moves\",\n \"def checkPossibleMoves(self):\\n possibleMovesArray = []\\n\\n for j in range(self.nrOfCars):\\n minMaxChange = self.gridSize - self.length[j] + 1\\n possibleMoves = []\\n\\n for i in range(1,minMaxChange):\\n if self.checkMove(j, i) == 0:\\n possibleMoves.append(i)\\n else:\\n break\\n for i in range(1,minMaxChange):\\n if self.checkMove(j, -i) == 0:\\n possibleMoves.append(-i)\\n else:\\n break\\n\\n possibleMovesArray.append(possibleMoves)\\n\\n return possibleMovesArray\",\n \"def GenerateMoves(position):\\n return [move for move in POSSIBLE_MOVES if move <= position]\",\n \"def get_legal_moves(self, color):\\n moves = set() # stores the legal moves.\\n color = max(0, color)\\n\\n # Get all the squares with pieces of the given color.\\n for y in range(self.n):\\n for x in range(self.n):\\n if self[x][y]==color:\\n newmoves = self.get_moves_for_square((x,y))\\n moves.update(newmoves)\\n return list(moves)\",\n \"def get_all_possible_moves(self):\\r\\n moves = []\\r\\n for i in range(8):\\r\\n for j in range(8):\\r\\n color = self.board[i][j][0]\\r\\n if (color == 'b' and not self.turn_white) or (color == 'w' and self.turn_white):\\r\\n p_type = self.board[i][j][1]\\r\\n if p_type == 'r':\\r\\n self.get_rook_moves(i, j, moves)\\r\\n elif p_type == 'k':\\r\\n self.get_king_moves(i, j, moves)\\r\\n elif p_type == 'q':\\r\\n self.get_queen_moves(i, j, moves)\\r\\n elif p_type == 'p':\\r\\n self.get_pawn_moves(i, j, moves)\\r\\n elif p_type == 'b':\\r\\n self.get_bishop_moves(i, j, moves)\\r\\n elif p_type == 'n':\\r\\n self.get_knight_moves(i, j, moves)\\r\\n return moves\",\n \"def legalMoves(self):\\n return [c for c in range(self.getWidth()) if len([r for r in range(self.getHeight()) if self.cell[c][r]==EMPTY])>0 ]\",\n \"def get_possible_moves(board):\\n\\tpossible_moves = []\\n\\n\\tfor count, player in enumerate(board):\\n\\t\\tif player is not server_player and player is not user_player:\\n\\t\\t\\tpossible_moves.append(count)\\n\\n\\treturn possible_moves\",\n \"def findPlacesToMove():\\n movesDestinations = [];\\n \\n curY = curBlank[0];\\n curX = curBlank[1];\\n\\n if(curY-1 >= 1): #UP\\n movesDestinations.append((curY-1, curX));\\n if(curY+1 <= n): #DOWN\\n movesDestinations.append((curY+1, curX));\\n if(curX-1 >= 1): #LEFT\\n movesDestinations.append((curY, curX-1));\\n if(curX+1 <= n): #RIGHT\\n movesDestinations.append((curY, curX+1));\\n \\n return movesDestinations;\",\n \"def get_moves(self, x, y):\\n\\n if not self.piece_at(x, y):\\n return set()\\n\\n moves = self._get_piece_moves(x, y)\\n legal = set(moves)\\n at = x, y\\n for to in moves:\\n res, captured = self._make_move(at, to)\\n if not res:\\n legal.remove(to)\\n else:\\n self._unmake_move(to, at, captured)\\n\\n self._check_integrity()\\n return legal\",\n \"def moveAvailable(self, to):\\n\\t\\tmoves = self.getAvailableMoves()\\n\\t\\tprint(moves)\\n\\t\\tif to in moves: return True\\n\\t\\treturn False\",\n \"def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\\n pass\",\n \"def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\\n pass\",\n \"def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\\n pass\",\n \"def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\\n pass\",\n \"def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\\n pass\",\n \"def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\\n pass\",\n \"def get_possible_moves(self, current_x: int, current_y: int) -> List[(int, int)]:\\n pass\",\n \"def possible(state_board,turn):\\n\\tlegal_moves = [] # list of legal moves as Move objects\\n\\tfor i in range(1,9):\\n\\t\\tfor j in range(1,9):\\n\\t\\t\\tif state_board[i][j] == 0:\\n\\t\\t\\t\\tif flipper([i,j],turn,state_board) != []:\\n\\t\\t\\t\\t\\t# if there are flipped pieces, it appends this move to\\n\\t\\t\\t\\t\\t# the legal moves and draws it in light greens\\n\\t\\t\\t\\t\\tlegal_moves.append((i,j))\\n\\t\\t\\t\\t\\tdrawPiece((i,j),3)\\n\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\t# if it is 0 and is not legal, make sure it is of bgcolor\\n\\t\\t\\t\\t\\tdrawPiece((i,j),0)\\n\\t\\n\\treturn legal_moves\",\n \"def get_possible_moves(board):\\n\\n possible_moves = []\\n\\n ret_tuple_left = move_left(board)\\n ret_tuple_right = move_right(board)\\n ret_tuple_up = move_up(board)\\n ret_tuple_down = move_down(board)\\n\\n if ret_tuple_left[0]:\\n possible_moves.append(ret_tuple_left[1])\\n if ret_tuple_right[0]:\\n possible_moves.append(ret_tuple_right[1])\\n if ret_tuple_up[0]:\\n possible_moves.append(ret_tuple_up[1])\\n if ret_tuple_down[0]:\\n possible_moves.append(ret_tuple_down[1])\\n\\n return possible_moves\",\n \"def get_move(self, game, legal_moves, time_left):\\n\\n self.time_left = time_left\\n move = (-1, -1) #Default\\n\\n # Perform any required initializations, including selecting an initial\\n # move from the game board (i.e., an opening book), or returning\\n # immediately if there are no legal moves\\n\\n max_depth = 0\\n try:\\n # The search method call (alpha beta or minimax) should happen in\\n # here in order to avoid timeout. The try/except block will\\n # automatically catch the exception raised by the search method\\n # when the timer gets close to expiring\\n if self.iterative:\\n #Perform iterative search\\n num_of_remaining_moves = len(game.get_blank_spaces())\\n for depth in range(1,num_of_remaining_moves):\\n if self.time_left() <= self.TIMER_THRESHOLD:\\n return move\\n\\n if self.method == 'alphabeta':\\n iterative_best_score, iterative_best_move = self.alphabeta(game, depth)\\n else:\\n iterative_best_score, iterative_best_move = self.minimax(game, depth)\\n\\n #Stores score and move of the deepest search\\n score = iterative_best_score\\n move = iterative_best_move\\n max_depth = depth\\n else:\\n #Perform fixed-depth search\\n if self.method == 'alphabeta':\\n score, move = self.alphabeta(game, self.search_depth)\\n else:\\n score, move = self.minimax(game, self.search_depth)\\n\\n except Timeout:\\n # Handle any actions required at timeout, if necessary\\n pass\\n\\n return move\",\n \"def getLegalMoves(cls, piece, layout):\\n color = cls._getColorAt(piece, layout)\\n if color == \\\"w\\\":\\n direction = \\\"b\\\"\\n else:\\n direction = \\\"f\\\"\\n\\n unfiltered_moves = []\\n\\n if cls._isKing(piece, layout):\\n left, right = cls.adjacency_matrix[piece][\\\"b\\\"]\\n unfiltered_moves.extend([left, right])\\n left, right = cls.adjacency_matrix[piece][\\\"f\\\"]\\n unfiltered_moves.extend([left, right])\\n else:\\n left, right = cls._getMoves(piece, direction)\\n unfiltered_moves.extend([left, right])\\n\\n # remove None destinations from the list (board edges)\\n filtered_moves = list(filter(lambda x: x != None, unfiltered_moves))\\n\\n # move destination is an opponent\\n possible_jumps = list(\\n filter(lambda x: cls._isOpponent(color, x, layout), filtered_moves)\\n )\\n if possible_jumps:\\n # process jumps first because you MUST jump\\n unfiltered_jumps = list(\\n map(lambda x: cls._canJump(x, piece, layout), possible_jumps)\\n )\\n jumps = list(filter(lambda x: x != None, unfiltered_jumps))\\n # we don't care about moves if we have jumps\\n if jumps:\\n return {\\\"jumps\\\": jumps}\\n\\n # if we got here, process moves\\n moves = list(\\n filter(\\n lambda x: cls.Pieces.NONE == cls._getColorAt(\\n x, layout), filtered_moves\\n )\\n )\\n return {\\\"moves\\\": list(moves)}\",\n \"def available_moves(self):\\n\\n heaps = range(len(self.heaps))\\n return [(h, take) for h in range(len(self.heaps))\\n for take in range(1, self.heaps[h] + 1)]\",\n \"def GetMoves(self):\\n return [(source, target) for source in self.scores.keys() for target in self.fullGraph.neighbors_iter(source) if target not in self.pathes[source].nodes]\",\n \"def get_potential_moves(self):\\n\\n return self._potential_moves\",\n \"def _get_piece_moves(self, x, y):\\n\\n piece = self.get_piece(x, y)\\n moves = []\\n\\n if not piece:\\n return moves\\n\\n if piece.name == 'rook' or piece.name == 'queen':\\n direcs = ['up', 'down', 'left', 'right']\\n moves = [self._get_moves_indirection(x, y, direc) for direc in\\n direcs]\\n\\n elif piece.name == 'bishop' or piece.name == 'queen':\\n direcs = ['d1', 'd2', 'd3', 'd4']\\n for direc in direcs:\\n moves += self._get_moves_indirection(x, y, direc)\\n\\n elif piece.name == 'king':\\n moves = [(x-1, y-1), (x-1, y), (x-1, y+1), (x, y-1),\\n (x, y+1), (x+1, y-1), (x+1, y), (x+1, y+1)]\\n\\n elif piece.name == 'knight':\\n moves = [(x-1, y-2), (x-2, y-1), (x-2, y+1), (x-1, y+2),\\n (x+1, y+2), (x+2, y+1), (x+1, y-2), (x+2, y-1)]\\n\\n elif piece.name == 'pawn':\\n if piece.color == ChessGame.BLACK:\\n moves = [(x-1, y), (x-1, y-1), (x-1, y+1)]\\n else:\\n moves = [(x+1, y), (x+1, y-1), (x+1, y+1)]\\n\\n tmp = list(moves)\\n for u, v in tmp:\\n if v != y and not self.is_enemy(u, v, piece.color):\\n moves.remove((u, v))\\n\\n if v == y and self.is_enemy(u, v, piece.color):\\n moves.remove((u, v))\\n\\n mycolor = piece.color\\n valid = set()\\n for (u, v) in moves:\\n if not self.in_bounds(u, v):\\n continue\\n\\n if not self.get_piece(u, v): # board is blank\\n valid.add((u, v))\\n\\n if self.is_enemy(u, v, mycolor):\\n valid.add((u, v))\\n\\n return valid\",\n \"def get_untried_moves(self, legal_moves):\\n\\n\\t\\t# Find all moves for which this node *does* have children\\n\\t\\ttried_moves = [child.move for child in self.child_nodes]\\n\\n\\t\\t# Return all moves that are legal but have not been tried yet\\n\\t\\treturn [move for move in legal_moves if move not in tried_moves]\",\n \"def get_available_moves(self, team_color):\\n squares = self.squares_with_pieces_of_color(team_color)\\n moves = []\\n for square in squares:\\n moves.extend(square.get_moves(self))\\n return moves\",\n \"def get_possible_moves(self) -> list:\\n result = []\\n for lst in self.hori_lst:\\n for item in lst:\\n if item.isalpha():\\n result.append(item)\\n\\n # add nodes to result if it's not taken and its line is not taken\\n # for i in range(len(self.hori_lst)):\\n # if not self.hori_result[i].isdigit():\\n # for item in self.hori_lst[i]:\\n # if not item.isdigit():\\n # result.append(item)\\n # # remove the node from result if its line has been taken\\n # for i in range(len(self.left_lst)):\\n # if self.left_result[i].isdigit():\\n # for item in self.left_lst[i]:\\n # if item in result:\\n # result.remove(item)\\n # # remove the node from result if its line has been taken\\n # for i in range(len(self.right_lst)):\\n # if self.right_result[i].isdigit():\\n # for item in self.right_lst[i]:\\n # if item in result:\\n # result.remove(item)\\n return result\",\n \"def get_all_moves(board, player):\\n moves = []\\n if not (player_has_won(board, player) or\\n player_has_won(board, utils.get_opponent(player)) or\\n (not is_valid_board(board))):\\n for index in range(9):\\n if board[index] == config.NO_PLAYER:\\n moves += [index]\\n return moves\",\n \"def __moves_available(self, board: Board):\\n player_moves = self.get_num_of_moves(board, self.player_color)\\n opponent_moves = self.get_num_of_moves(board, self.opponent_color)\\n # print(len(player_moves), len(opponent_moves))\\n\\n return player_moves - opponent_moves * 3\",\n \"def get_tiger_possible_moves(self) -> List:\\n moves = []\\n for pos in self.get_all_positions():\\n if pos.is_tiger():\\n addr_from = pos.address\\n for addr_to in pos.piece.get_valid_moves():\\n moves.append((addr_from, addr_to))\\n\\n return moves\",\n \"def get_legal(self, player):\\n for start in map(tuple, np.argwhere(self._board == player)):\\n yield from (\\n (start, end)\\n for end in self.paths(start)\\n if self._check_zone_locks(start, end)\\n )\",\n \"def ai_move():\\n\\tinitial_state = map(get_filled_edges, rects)\\n\\tpossible_moves = []\\n\\tfor index, filled_edges in enumerate(initial_state):\\n\\t\\tif filled_edges == 0:\\n\\t\\t\\tpossible_moves.extend([(index, i) for i in 'ltrb'])\\n\\t\\telif filled_edges == 1:\\n\\t\\t\\tpossible_moves.extend(one_filled_edge(index))\\n\\t\\telif filled_edges == 2:\\n\\t\\t\\tpossible_moves.extend(two_filled_edge(index))\\n\\t\\telif filled_edges == 3:\\n\\t\\t\\tpossible_moves.extend(three_filled_edge(index))\\n\\tprint possible_moves\\n\\tpossible_decisions = []\\n\\tfor move in possible_moves:\\n\\t\\tfinal_state = apply_move(move)\\n\\t\\tpossible_decisions.append(is_feasible(initial_state, final_state))\\n\\tprint possible_decisions\\n\\t# randomizing when some decisions have the same weight\\n\\tmax_weight = max(possible_decisions)\\n\\t# list of indices which have the same weight\\n\\tmax_indices = []\\n\\tfor index, weight in enumerate(possible_decisions):\\n\\t\\tif weight == max_weight:\\n\\t\\t\\tmax_indices.append(index)\\n\\tx = choice(max_indices)\\n\\tprint x\\n\\treturn possible_moves[x]\\n\\t# return possible_moves[possible_decisions.index(max(possible_decisions))]\",\n \"def get_move(self, game, legal_moves, time_left):\\n logging.debug(\\\"get_move - legal moves: %s\\\", str(legal_moves))\\n \\n self.time_left = time_left\\n\\n\\n # Check if we have any legal moves\\n if not legal_moves:\\n return (-1, -1)\\n\\n # Let's set best move so far to be the first legal move so we always \\n # have something to return in case of timeout\\n self.best_move_so_far = legal_moves[0]\\n \\n \\n # Perform any required initializations, including selecting an initial\\n # move from the game board (i.e., an opening book), or returning\\n # immediately if there are no legal moves\\n\\n try:\\n # The search method call (alpha beta or minimax) should happen in\\n # here in order to avoid timeout. The try/except block will\\n # automatically catch the exception raised by the search method\\n # when the timer gets close to expiring\\n if self.iterative:\\n it = 1\\n while True:\\n if self.method == 'minimax':\\n _, self.best_move_so_far = self.minimax(game, it)\\n else:\\n _, self.best_move_so_far = self.alphabeta(game, it)\\n it += 1\\n else: \\n if self.method == 'minimax':\\n _, self.best_move_so_far = self.minimax(game, self.search_depth)\\n else:\\n _, self.best_move_so_far = self.alphabeta(game, self.search_depth)\\n\\n except Timeout:\\n # Handle any actions required at timeout, if necessary\\n logging.debug(\\\"Time is up - get_move returning: %s\\\", str(self.best_move_so_far))\\n return self.best_move_so_far\\n\\n # Return the best move from the last completed search iteration\\n logging.debug(\\\"get_move returning: %s\\\", str(self.best_move_so_far))\\n\\n return self.best_move_so_far\",\n \"def get_valid_moves(self):\\r\\n validMoves = []\\r\\n\\r\\n for x in range(BOARD_SIZE):\\r\\n for y in range(BOARD_SIZE):\\r\\n pos = np.array([x,y])\\r\\n if self.board[pos[0],pos[1]] == 0:\\r\\n if(self.update_board(pos,_testing=True)):\\r\\n validMoves.append(pos)\\r\\n\\r\\n return validMoves\",\n \"def possible_moves(self, side: models.Side) -> typing.Iterator[\\n typing.Tuple[models.Piece, int, int]]:\\n raise NotImplementedError\",\n \"def get_move(self, game, legal_moves, time_left):\\n\\n self.time_left = time_left\\n\\n # TODO: finish this function!\\n\\n # Perform any required initializations, including selecting an initial\\n # move from the game board (i.e., an opening book), or returning\\n # immediately if there are no legal moves\\n moves = game.get_legal_moves()\\n best_move = (-1, -1)\\n best_score = float(\\\"-inf\\\")\\n depth = 1\\n if moves:\\n best_move = moves[0]\\n else :\\n return best_move\\n \\n\\n try:\\n # The search method call (alpha beta or minimax) should happen in\\n # here in order to avoid timeout. The try/except block will\\n # automatically catch the exception raised by the search method\\n # when the timer gets close to expiring\\n if not self.iterative:\\n if self.method == 'minimax':\\n _, best_move = self.minimax(game, self.search_depth)\\n elif self.method == 'alphabeta':\\n _, best_move = self.alphabeta(game, self.search_depth) \\n else:\\n while self.time_left() > self.TIMER_THRESHOLD:\\n if self.method == 'minimax':\\n score, move = self.minimax(game, depth)\\n elif self.method == 'alphabeta':\\n score, move = self.alphabeta(game, depth)\\n if score > best_score:\\n best_move = move\\n depth += 1 \\n\\n\\n except Timeout:\\n # Handle any actions required at timeout, if necessary\\n pass\\n\\n # Return the best move from the last completed search iteration\\n return best_move\",\n \"def get_best_moves(self):\\n return self.best_moves\",\n \"def checkMoves(self,board):\\n possibleMoves = []\\n\\n for c in xrange(0,8):\\n for r in xrange(0,8):\\n if board.isValidMove(self.tile,c,r):\\n possibleMoves.append(c+r*8)\\n\\n return possibleMoves\",\n \"def get_all_valid_moves(self, player):\\n moves = [] # Stores the possible moves\\n capture_move_exists = False # Indicates if a capturing move is possible\\n\\n for piece in self.get_all_pieces(player):\\n valid_moves = self._get_valid_moves(piece)\\n\\n for move, skip in valid_moves.items():\\n moves.append([(piece.row, piece.col), move, skip])\\n\\n if len(skip) > 0:\\n # Checks if there is a move that can capture a piece\\n capture_move_exists = True\\n\\n if capture_move_exists:\\n # Only gets the capturing moves if there is one\\n eating_moves = []\\n for move in moves:\\n if len(move[2]) != 0:\\n eating_moves.append(move)\\n\\n moves = eating_moves\\n\\n return moves\",\n \"def possible_moves(self):\\n states = []\\n possible_floors = self.possible_floors()\\n possible_items = self.possible_items()\\n\\n for fl in possible_floors:\\n for items in possible_items:\\n new_floors = deepcopy(self.floors)\\n for item in items:\\n new_floors[self.lift_floor].remove(item)\\n new_floors[fl].append(item)\\n\\n if self.validate_floors(new_floors):\\n states.append(\\n GameState(new_floors, lift_floor=fl, moves=self.moves+1)\\n )\\n\\n return states\",\n \"def actions(board):\\n avail_moves = set()\\n\\n for i in range(3):\\n for j in range(3):\\n if board[i][j] == EMPTY:\\n avail_moves.add((i,j))\\n \\n if len(avail_moves) == 0:\\n return 0\\n\\n return avail_moves\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7495228","0.7211233","0.7106526","0.6994656","0.68828064","0.6859793","0.6845441","0.6823255","0.68220854","0.6766067","0.6720792","0.6693552","0.6690474","0.6682","0.6669322","0.66576886","0.6649769","0.66284806","0.6552528","0.6523163","0.6483351","0.64750797","0.64672947","0.64568913","0.6421841","0.64002156","0.6379737","0.63709116","0.6366173","0.63627136","0.6355597","0.63452965","0.63386893","0.63212574","0.63209224","0.6315063","0.63134336","0.62796193","0.62717366","0.626261","0.6222694","0.61953133","0.6194773","0.61675","0.61653376","0.61603606","0.61440843","0.6138285","0.6137138","0.6132093","0.61272323","0.61114275","0.6110081","0.60962886","0.607672","0.60703653","0.605995","0.60588396","0.6056324","0.60504067","0.60247695","0.6023153","0.6019059","0.60031694","0.60008293","0.599931","0.5992458","0.598784","0.59823716","0.59823716","0.59823716","0.59823716","0.59823716","0.59823716","0.59823716","0.5980818","0.5978216","0.5973922","0.5968626","0.5968436","0.59676224","0.59647095","0.5962298","0.5959459","0.59577215","0.5953524","0.59372157","0.59299046","0.5928245","0.59205383","0.59201515","0.5916984","0.59127396","0.5904953","0.59046066","0.59043676","0.5902298","0.5874908","0.5864457","0.58520806"],"string":"[\n \"0.7495228\",\n \"0.7211233\",\n \"0.7106526\",\n \"0.6994656\",\n \"0.68828064\",\n \"0.6859793\",\n \"0.6845441\",\n \"0.6823255\",\n \"0.68220854\",\n \"0.6766067\",\n \"0.6720792\",\n \"0.6693552\",\n \"0.6690474\",\n \"0.6682\",\n \"0.6669322\",\n \"0.66576886\",\n \"0.6649769\",\n \"0.66284806\",\n \"0.6552528\",\n \"0.6523163\",\n \"0.6483351\",\n \"0.64750797\",\n \"0.64672947\",\n \"0.64568913\",\n \"0.6421841\",\n \"0.64002156\",\n \"0.6379737\",\n \"0.63709116\",\n \"0.6366173\",\n \"0.63627136\",\n \"0.6355597\",\n \"0.63452965\",\n \"0.63386893\",\n \"0.63212574\",\n \"0.63209224\",\n \"0.6315063\",\n \"0.63134336\",\n \"0.62796193\",\n \"0.62717366\",\n \"0.626261\",\n \"0.6222694\",\n \"0.61953133\",\n \"0.6194773\",\n \"0.61675\",\n \"0.61653376\",\n \"0.61603606\",\n \"0.61440843\",\n \"0.6138285\",\n \"0.6137138\",\n \"0.6132093\",\n \"0.61272323\",\n \"0.61114275\",\n \"0.6110081\",\n \"0.60962886\",\n \"0.607672\",\n \"0.60703653\",\n \"0.605995\",\n \"0.60588396\",\n \"0.6056324\",\n \"0.60504067\",\n \"0.60247695\",\n \"0.6023153\",\n \"0.6019059\",\n \"0.60031694\",\n \"0.60008293\",\n \"0.599931\",\n \"0.5992458\",\n \"0.598784\",\n \"0.59823716\",\n \"0.59823716\",\n \"0.59823716\",\n \"0.59823716\",\n \"0.59823716\",\n \"0.59823716\",\n \"0.59823716\",\n \"0.5980818\",\n \"0.5978216\",\n \"0.5973922\",\n \"0.5968626\",\n \"0.5968436\",\n \"0.59676224\",\n \"0.59647095\",\n \"0.5962298\",\n \"0.5959459\",\n \"0.59577215\",\n \"0.5953524\",\n \"0.59372157\",\n \"0.59299046\",\n \"0.5928245\",\n \"0.59205383\",\n \"0.59201515\",\n \"0.5916984\",\n \"0.59127396\",\n \"0.5904953\",\n \"0.59046066\",\n \"0.59043676\",\n \"0.5902298\",\n \"0.5874908\",\n \"0.5864457\",\n \"0.58520806\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6491643"},"document_rank":{"kind":"string","value":"20"}}},{"rowIdx":94797,"cells":{"query":{"kind":"string","value":"needed for search Create a new board state with the given move"},"document":{"kind":"string","value":"def move(self,p,intMove):\n gs = self.gameState.copy() #copy Board\n gs[p.pos.get()] = EMPTY #put position it was at as empty\n gs[self.movePos(p,intMove).get()] = p.color #set new position as filled\n return ((p,intMove),Board(gs,self.togglePlayer(self.whoseTurn)))"},"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 make_move(self, move: Any) -> 'StonehengeState':\n if type(move) == str:\n new_state = StonehengeState(not self.p1_turn, self.side_length)\n # copy the board information from current state\n # make copy of current state information\n hori_lst_copy = []\n for lst in self.hori_lst:\n temp = []\n for item in lst:\n temp.append(item)\n hori_lst_copy.append(temp)\n left_lst_copy = []\n for lst in self.left_lst:\n temp = []\n for item in lst:\n temp.append(item)\n left_lst_copy.append(temp)\n right_lst_copy = []\n for lst in self.right_lst:\n temp = []\n for item in lst:\n temp.append(item)\n right_lst_copy.append(temp)\n\n hori_result_copy = []\n for item in self.hori_result:\n hori_result_copy.append(item)\n left_result_copy = []\n for item in self.left_result:\n left_result_copy.append(item)\n right_result_copy = []\n for item in self.right_result:\n right_result_copy.append(item)\n\n new_state.hori_lst = hori_lst_copy\n new_state.hori_result = hori_result_copy\n new_state.left_lst = left_lst_copy\n new_state.left_result = left_result_copy\n new_state.right_lst = right_lst_copy\n new_state.right_result = right_result_copy\n # update the new state with str move\n # parallel nested list data structure\n lst = [new_state.hori_lst, new_state.left_lst, new_state.right_lst]\n result = [new_state.hori_result, new_state.left_result, new_state.right_result]\n # update the cell\n for i in range(len(lst)):\n for j in range(len(lst[i])):\n for k in range(len(lst[i][j])):\n if lst[i][j][k] == move:\n # should use the player name of last state, so opposite names\n if new_state.p1_turn:\n lst[i][j][k] = \"2\"\n else:\n lst[i][j][k] = \"1\"\n # update ley-line marks\n # the ley-line may belong to a player after this move\n p1_taken = 0\n p2_taken = 0\n if result[i][j] != \"@\":\n continue\n for item in lst[i][j]:\n if item == \"1\":\n p1_taken += 1\n if item == \"2\":\n p2_taken += 1\n if float(p1_taken) >= len(lst[i][j]) / 2:\n result[i][j] = \"1\"\n if float(p2_taken) >= len(lst[i][j]) / 2:\n result[i][j] = \"2\"\n ###### CHECK FOR SHALLOW COPY PROBLEM, IF ATTRIBUTE IS UPDATE IN NEW STATE\n return new_state","def make_move(self, move: Any) -> \"StonehengeState\":\n new_board = deepcopy(self.current_board)\n for index in range(len(self.current_board)):\n if self.current_board[index] == move:\n if self.p1_turn:\n new_board = new_board.replace(\n self.current_board[index], '1')\n else:\n new_board = new_board.replace(\n self.current_board[index], '2')\n new_ley_lines = deepcopy(self.current_ley_lines)\n for item in new_ley_lines:\n for key in item:\n for index in range(len(key[1])):\n if key[1][index] == move:\n if self.p1_turn:\n key[1][index] = '1'\n else:\n key[1][index] = '2'\n change_dict = {}\n for item in new_ley_lines:\n for key in item:\n p1_count = 0\n p2_count = 0\n for string in key[1]:\n if string == '1':\n p1_count += 1\n if string == '2':\n p2_count += 1\n\n\n if p1_count >= len(key[1])/2 and p1_count > p2_count:\n\n change_dict[key[0]] = '1'\n if p2_count >= len(key[1])/2 and p2_count > p1_count:\n\n change_dict[key[0]] = '2'\n for key in change_dict:\n if not (key == '1' or key == '2'):\n if str(key) in new_board:\n new_board = new_board.replace(str(key), change_dict[key])\n for item in new_ley_lines:\n for key1 in item:\n if key == key1[0]:\n key1[0] = change_dict[key]\n\n new_state = StonehengeState(not self.p1_turn, self.side_length,\n new_board, new_ley_lines)\n return new_state","def apply_move(self, move):\r\n next_board = copy.deepcopy(self.board)\r\n next_board.place(self.next_player, move)\r\n return GameState(next_board, self.next_player.other, move)","def make_move(self, move: Any) -> \"StonehengeState\":\n new_state = StonehengeState(self.p1_turn, self.length,\n self.letters[:], self.claim[:])\n state = new_state\n if new_state.length == 1:\n state = self.move_length_1(move, new_state)\n if new_state.length == 2:\n state = self.move_length_2(move, new_state)\n if new_state.length == 3:\n state = self.move_length_3(move, new_state)\n if new_state.length == 4:\n if move in [\"A\", \"B\", \"J\", \"O\", \"N\", \"R\",\n \"C\", \"F\", \"E\", \"I\", \"P\", \"Q\"]:\n state = self.move_length_4(move, new_state)\n else:\n state = self.move_length_41(move, new_state)\n if new_state.length == 5:\n if move in [\"A\", \"B\", \"U\", \"O\", \"T\", \"Y\",\n \"C\", \"J\", \"E\", \"N\", \"V\", \"X\"]:\n state = self.move_length_5(move, new_state)\n elif move in [\"F\", \"I\", \"W\"]:\n state = self.move_length_51(move, new_state)\n else:\n state = self.move_length_52(move, new_state)\n return state","def makeMove(self, board, move):\n\t\trotation, this_board = self.__getNormalizedAndRotatedBoard(board)\n\t\tthis_state = TicTacToeHelper.serializeBoard(this_board)\n\n\t\tthis_move = TicTacToeHelper.rotateMove(move, rotation)\n\n\t\tself.__state_history.append((this_state, this_move))","def make_move(self, move, player, board):\r\n #nBoard = board.copy()\r\n board[move] = player\r\n for d in core.DIRECTIONS:\r\n if self.find_bracket(move, player, board, d)!=None:\r\n self.make_flips(move, player, board, d)\r\n return board","def make_move(self, state):\r\n # intially set drop phase to true\r\n drop_phase = True\r\n move = [] # list to make moves with to return\r\n succ = self.succ(state) # get the successor of this state\r\n # intial postion of board to set up most advantagous spot if its empty\r\n if sum(x.count(self.my_piece) for x in self.board) == 0 and self.board[2][2] == ' ':\r\n move.insert(0, (2, 2))\r\n return move\r\n \r\n # check the number of 'r' and 'b' on board if theres 4 of each drop phase is false\r\n if sum(x.count('r') for x in self.board) == 4 and sum(x.count('b') for x in self.board) == 4:\r\n drop_phase = False\r\n\r\n # if not during drop phase use minimax to make next move from one postion to next\r\n if not drop_phase:\r\n move = []\r\n d = self.Max_value(state, 0)\r\n val = d['val']\r\n m = d['move']\r\n p = d['pos']\r\n f = d['from']\r\n s = sorted(succ, key=lambda e: e['f'])\r\n moveto = s[-1]\r\n move.insert(1, (moveto['from'][0], moveto['from'][1]))\r\n move.insert(0, (moveto['pos'][0], moveto['pos'][1]))\r\n return move # return the from, to move\r\n\r\n else: #else use minimax and to make move during drop phase selecting spot to place AI piece\r\n d = self.Max_value(state, 0)\r\n val = d['val']\r\n m = d['move']\r\n p = d['pos']\r\n hold = []\r\n move = []\r\n n = None\r\n hold = []\r\n for s in succ:\r\n p = s['pos'][0]\r\n p1 = s['pos'][1]\r\n if s['f'] == val and state[p][p1] == ' ':\r\n hold.append(s)\r\n if len(hold) == 1:\r\n row = hold[0]['pos'][0]\r\n col = hold[0]['pos'][1]\r\n else:\r\n f = sorted(hold, key=lambda e: e['pos'])\r\n row = f[0]['pos'][0]\r\n col = f[0]['pos'][1]\r\n\r\n move.insert(0, (row, col)) # return the move \r\n return move","def make_move(self, move):\n if int(move) < 0 or int(move) > 48 or self.board[int(move) // 7][int(move) % 7] != \"\" or int(move) % 2 == 0:\n raise ValueError(\"{} is not a valid move for {}\".format(move, self.board))\n DotsAndBoxesState.score1 += self.check_score(move)\n self.board[int(move) // 7][int(move) % 7] = colors[self.turn] + self.turn + \"\\u001b[0m\"\n self.turn = get_opponent(self.turn) #change into another player's trun","def make_move(self, move: int) -> None:\n if move not in self._valid_moves:\n raise ValueError(f'Move \"{move}\" is not valid')\n\n self._update_board(move)\n\n self._win_state = self._check_winner()\n self._is_red_active = not self._is_red_active\n self.move_number += 1","def make_move(self, state):\n emptySpaces = 0\n for row in state:\n emptySpaces = emptySpaces + row.count(' ')\n if emptySpaces > 17:\n drop_phase = True\n else:\n drop_phase = False\n\n move = []\n if not drop_phase:\n best_value = float('-inf')\n best_state = None\n for s in self.succ(state, False, self.my_piece):\n if self.game_value(s) == -1 or self.game_value(s) == 1:\n best_state = s\n break\n currValue = self.Min_Value(state, 0)\n if currValue>best_value:\n best_value = currValue\n best_state = s\n for i in range(len(state)):\n for j in range(len(state[i])):\n if state[i][j]!= ' ' and best_state[i][j]== ' ':\n move.append((i,j))\n if state[i][j]== ' ' and best_state[i][j]!= ' ':\n move.insert(0, (i,j))\n \n # TODO: choose a piece to move and remove it from the board\n # (You may move this condition anywhere, just be sure to handle it)\n #\n # Until this part is implemented and the move list is updated\n # accordingly, the AI will not follow the rules after the drop phase!\n \n\n # select an unoccupied space randomly\n # TODO: implement a minimax algorithm to play better\n \n else:\n best_value = float('-inf')\n best_state = None\n for s in self.succ(state, True, self.my_piece):\n if self.game_value(s) == -1 or self.game_value(s) == 1:\n best_state = s\n break\n currValue = self.Min_Value(state, 0)\n if currValue>best_value:\n best_value = currValue\n best_state = s\n for i in range(len(state)):\n for j in range(len(state[i])):\n if state[i][j]== ' ' and best_state[i][j]!= ' ':\n move.insert(0, (i,j))\n \n return move","def make_move(board, move, ch):\n board[move['row']][move['col']] = ch\n \n winner = board_winner(board)\n \n if winner is not None:\n return True, winner\n \n if not board_has_move(board):\n return True, None\n \n return False, None","def move(state=None, actual_move=None):\n copy = state.copy()\n copy.push(chess.Move.from_uci(uci=actual_move))\n return copy","def make_move(self, move):\n self.board[int(move) - 1] = self.nplayer","def make_move(self, move, player):\n if not self.test_valid_move( move):\n return False\n self.game_state[move[0]][move[1]] = player","def apply_move(self, start_move, move):\n\t\t# check that the start move and the move are Move objects\n\t\tif not isinstance(move, Move):\n\t\t\tmove = Move(move)\n\t\tif not isinstance(start_move, Move):\n\t\t\tstart_move = Move(start_move)\n\t\t# copy the board\n\t\tnext_board = copy.deepcopy(self.board)\n\t\t# place the move on the next board\n\t\tnext_board.place(self.next_player, start_move.point, move.point)\n\t\treturn GameState(next_board, self.next_player.other, move)","def make_move(move, player, board):\n board[move] = player\n for d in DIRECTIONS:\n Othello.make_flips(move, player, board, d)\n return board","def make_move(self, current_state):\n\n\t\tbatch_size = 192\n\n\t\ttest_board = np.zeros((batch_size, 3, 3, 3))\n\t\ttest_cows = np.zeros((batch_size, 2))\n\t\ttest_labels = np.zeros((batch_size, 1)) \n\n\t\tnew_states = current_state.expand_states()\n\n\t\tif len(new_states) == 0:\n\t\t\treturn None\n\n\t\tfor i, state in enumerate(new_states):\n\n\t\t\tdesc = self.state_descriptor(state, self.player_index)\n\t\t\ttest_board[i] = np.asarray(desc[0])\n\t\t\ttest_cows[i] = np.asarray([desc[1], desc[2]])\n\n\t\treturn new_states[self.train_value_function_approximation(\n\t\t\tTrue, (test_board, test_cows, test_labels), len(new_states))]","def forecast_move(self, move):\n if move not in get_legal_moves(self):\n raise RuntimeError(\"Attempted forecast of illegal move\")\n newGameState = deepcopy(self)\n newGameState[move[0]][move[1]] = 1\n newGameState.player_locations[whose_turn] = move\n newGameState.whose_turn ^= 1\n return newGameState","def add_move(self, move):\n \n self.current_board[move.position[0]][move.position[1]] = move.player.char","def makeMove(self, move):\n\t\ttry:\n\t\t\tif (self.board[int(move) - 1] is Piece.BLANK):\n\t\t\t\tself.board[int(move) - 1] = self.current\n\t\t\t\treturn 1\n\t\t\telse:\n\t\t\t\treturn 0\n\t\texcept:\n\t\t\treturn 0","def result(self, board_state, move):\n # Create a copy of the current board state\n output_state = BoardState(other_state=board_state)\n # Swap pieces\n output_state.move_piece(move)\n # Eliminate pieces\n output_state.eliminate_piece()\n return output_state","def make_move(self, move):\n if type(move) == str:\n move = int(move)\n\n new_state = SubtractSquareState(not self.p1_turn,\n self.current_total - move)\n return new_state","def make_move(self, board):\n user_input = self.get_user_input(\n 'coordinates of next move (x,y): '\n )\n move = self.transform_user_input(user_input)\n\n valid = board.move_is_valid(move)\n while not valid:\n user_input = self.get_user_input(\n 'Invalid move, coordinate of next move: '\n )\n move = self.transform_user_input(user_input)\n valid = board.move_is_valid(move)\n board.set_piece(move, color=self.color)","def make_move(self, move):\n # Unpack the information from the move\n piece = self.get_piece(move[0])\n row = move[1][0]\n col = move[1][1]\n eliminated_pieces = move[2]\n\n # Move the piece and eliminate the captured pieces\n self.board[piece.row][piece.col] = None\n self.board[row][col] = piece\n piece.row = row\n piece.col = col\n self.remove(eliminated_pieces)\n\n # Checks if the piece has been promoted\n if piece.get_player() == Player.black and \\\n piece.row == constant.BOARD_DIMENSION - 1 \\\n and not piece.is_king():\n piece.make_king()\n self.num_black_kings += 1\n\n elif piece.get_player() == Player.white and \\\n piece.row == 0 \\\n and not piece.is_king():\n piece.make_king()\n self.num_white_kings += 1\n\n # Add the move performed to the history of the game\n self.moves.append(move)","def _makeAMove(self, prev_move, board: str) -> int:\n\n (myWins, otherWins, _, _) = self.winsBlocksForks(board)\n move = choice([self.findEmptyCell(board, myWin) for myWin in myWins] if myWins else\n [self.findEmptyCell(board, otherWin) for otherWin in otherWins] if otherWins else\n list(self.otherMove(board, emptyCellsCount(board)))\n )\n return move","def make_move(self):\n self.owner = self.game.current_turn\n self.status = 'X' if self.owner == self.game.creator else 'O'\n ####\n #Random turn??\n ####\n self.save(update_fields=['status', 'owner'])\n\n # Add log entry for move\n self.game.add_log(f'cell made at ({self.row}, {self.col}) by {self.owner}')\n\n # Set the current turn for the other player if game is not over\n # Check if find winner\n if self.game.check_win(cell=self) or\\\n self.game.get_all_game_cells().filter(status='EMPTY').count() == 0:\n print(\"Winnnnnnnn\")\n self.game.mark_complete(winner=self.owner)\n\n # Switch player turn\n self.game.switch_turn()\n\n # Let the game know about the move and result\n self.send_game_update()","def __make_move(self, user):\n if user:\n pos = int(input('Make your move (1-9): '))\n print('\\033[2A\\r ')\n while self.state[pos-1] != ' ':\n pos = int(input('\\rSeat\\'s taken. Make your move (1-9): '))\n print('\\033[2A\\r ')\n self.state[pos-1] = self.player_char\n else:\n time.sleep(.5)\n pos = random.randint(1, 9)\n if self.difficulty == 1:\n best = self.__find_best()\n pos = best+1 if best else pos\n while self.state[pos-1] != ' ':\n pos = random.randint(1, 9)\n self.state[pos-1] = self.opponent_char\n self.history.append(self.state[:])","def move(self, board):\n\n # We record all game positions to feed them into the NN for training with the corresponding updated Q\n # values.\n self.board_position_log.append(board.getState().copy())\n\n nn_input = self.board_state_to_nn_input(board.getState())\n probs, _ = self.get_valid_probs([nn_input], self.q_net, [board])\n probs = probs[0]\n # print(probs)\n # print(type(probs))\n # print(probs.shape)\n # input()\n # print(probs)\n # Most of the time our next move is the one with the highest probability after removing all illegal ones.\n # Occasionally, however we randomly chose a random move to encourage exploration\n if (self.training is True) and \\\n ((self.game_counter < self.pre_training_games) or (np.random.rand(1) < self.random_move_prob)):\n available = []\n for index in range(6):\n if probs[index] != -1.0:\n available.append(index)\n randomOne = random.randint(0,len(available)-1)\n move = available[randomOne]\n else:\n move = np.argmax(probs)\n # We record the action we selected as well as the Q values of the current state for later use when\n # adjusting NN weights.\n self.action_log.append(move)\n\n # We execute the move and return the result\n board.makeMove(move)\n return board.getState(), board.isOver()","def apply_move(board_state, move, side):\n move_x, move_y = move\n\n def get_tuples():\n for x in range(len(board_state)):\n if move_x == x:\n temp = list(board_state[x])\n temp[move_y] = side\n yield tuple(temp)\n else:\n yield board_state[x]\n\n return tuple(get_tuples())","def _update_board(self, move: int) -> None:\n row = self._column_to_row[move] # Find what row to place the disk in\n if self._is_red_active:\n self.board_array[row][move] = 1\n self.hash = self.hash ^ int(self._red_hash_keys[row][move]) # Update hash\n else:\n self.board_array[row][move] = -1\n self.hash = self.hash ^ int(self._yellow_hash_keys[row][move]) # # Update hash\n\n self._column_to_row[move] += 1\n if self._column_to_row[move] == 6:\n self._valid_moves.remove(move)","def action(new_board, move, player):\r\n \r\n global nodes_generated \r\n global min_prune\r\n global max_prune\r\n global max_depth\r\n \r\n if player == 1:\r\n for i in range(0,len(new_board.white)):\r\n if new_board.white[i] == move[0]:\r\n new_board.white[i] = move[1]\r\n if len(move) == 3:\r\n new_board.black.remove(move[2])\r\n elif player == -1:\r\n for i in range(0,len(new_board.black)):\r\n if new_board.black[i] == move[0]:\r\n new_board.black[i] = move[1]\r\n if len(move) == 3:\r\n new_board.white.remove(move[2])\r\n return new_board","def make_move(self):\n\n # get relavent information\n affinity = self.get_affinity()\n sample_space = self.get_game_space()\n depth_limit = self.__search_depth\n\n # run a minimax search and get the best value\n bestval = MinimaxTree.minimax(self, sample_space, affinity, depth_limit, True)\n if bestval[0] is None: bestval = ((0,6),'x', 0)\n\n # print the number of nodes expanded \n print(self.nodes_expanded)\n\n # make the move found by the search \n self.get_game_space().set_tile(bestval[0][0], bestval[0][1], affinity)","def moves(self, board_state):\n # pos_moves = generate_moves(board_state) # Naive moves function here\n blacks = board_state.search_board('B')\n # Generate the possible moves required to kill the first black piece\n # on the board\n pos_moves = sorted_generate_moves_piece(board_state, blacks[0])\n return pos_moves","def make_move(state: str, section_num: int, move: str) -> str:\n if move == wf.CHECK:\n check_result = wf.check_section(state, section_num)\n if check_result:\n print('The section is correct')\n else:\n print('The section is incorrect')\n else:\n state = wf.change_state(state, section_num, move) \n return state","def move(self, state, move_cmd, i, j):\r\n new_state = self.clone_state(state)\r\n coordinate_change = self.action_dic[self.reflection_dic[move_cmd]]\r\n new_state[i][j], new_state[i + coordinate_change[0]][j + coordinate_change[1]] = \\\r\n new_state[i + coordinate_change[0]][j + coordinate_change[1]]\\\r\n , new_state[i][j]\r\n return new_state","def make_move(self,board, action, player_id):\n row = np.max(np.where(board[:, action] == EMPTY_VAL))\n new_board = np.copy(board)\n new_board[row, action] = player_id\n\n return new_board","def api_make_move(self, move_input):\n return self.board.attempt_move(move_input)","def apply_move(self, move, state):\n x, y , heading, grid_data = state\n map_data = [row[:] for row in grid_data]\n if move == self.MOVE_FORWARD:\n # get coordinates for next cell\n if heading == self.UP:\n next_y = y - 1\n next_x = x\n elif heading == self.DOWN:\n next_y = y + 1\n next_x = x\n elif heading == self.LEFT:\n next_y = y\n next_x = x - 1\n else:\n next_y = y\n next_x = x + 1\n\n # handle special tile types\n if map_data[next_y][next_x] == self.ICE_SYMBOL:\n # handle ice tile - slide until first non-ice tile or blocked\n if heading == self.UP:\n for i in range(next_y, -1, -1):\n if map_data[i][next_x] != self.ICE_SYMBOL:\n if map_data[i][next_x] == self.WATER_SYMBOL:\n # slide into water - game over\n return self.GAME_OVER\n elif self.cell_is_blocked(i, next_x, map_data):\n # if blocked, stop on last ice cell\n next_y = i + 1\n break\n else:\n next_y = i\n break\n elif heading == self.DOWN:\n for i in range(next_y, self.y_size):\n if map_data[i][next_x] != self.ICE_SYMBOL:\n if map_data[i][next_x] == self.WATER_SYMBOL:\n # slide into water - game over\n return self.GAME_OVER\n elif self.cell_is_blocked(i, next_x, map_data):\n # if blocked, stop on last ice cell\n next_y = i - 1\n break\n else:\n next_y = i\n break\n elif heading == self.LEFT:\n for i in range(next_x, -1, -1):\n if map_data[next_y][i] != self.ICE_SYMBOL:\n if map_data[next_y][i] == self.WATER_SYMBOL:\n # slide into water - game over\n return self.GAME_OVER\n elif self.cell_is_blocked(next_y, i, map_data):\n # if blocked, stop on last ice cell\n next_x = i + 1\n break\n else:\n next_x = i\n break\n else:\n for i in range(next_x, self.x_size):\n if map_data[next_y][i] != self.ICE_SYMBOL:\n if map_data[next_y][i] == self.WATER_SYMBOL:\n # slide into water - game over\n return self.GAME_OVER\n elif self.cell_is_blocked(next_y, i, map_data):\n # if blocked, stop on last ice cell\n next_x = i - 1\n break\n else:\n next_x = i\n break\n if map_data[next_y][next_x] == self.TELEPORT_SYMBOL:\n # handle teleport - find the other teleporter\n tpy, tpx = (None, None)\n for i in range(self.y_size):\n for j in range(self.x_size):\n if map_data[i][j] == self.TELEPORT_SYMBOL and (i != next_y or j != next_x):\n tpy, tpx = (i, j)\n break\n if tpy is not None:\n break\n if tpy is None:\n raise Exception(\"LaserTank Map Error: Unmatched teleport symbol\")\n next_y, next_x = (tpy, tpx)\n else:\n # if not ice or teleport, perform collision check\n if self.cell_is_blocked(next_y, next_x, map_data):\n return self.COLLISION\n\n # check for game over conditions\n if self.cell_is_game_over(next_y, next_x, map_data):\n return self.GAME_OVER\n\n # no collision and no game over - update player position\n y = next_y\n x = next_x\n return (x, y, heading, map_data)\n\n elif move == self.TURN_LEFT:\n # no collision or game over possible\n if heading == self.UP:\n heading = self.LEFT\n elif heading == self.DOWN:\n heading = self.RIGHT\n elif heading == self.LEFT:\n heading = self.DOWN\n else:\n heading = self.UP\n return (x, y, heading, map_data)\n\n elif move == self.TURN_RIGHT:\n # no collision or game over possible\n if heading == self.UP:\n heading = self.RIGHT\n elif heading == self.DOWN:\n heading = self.LEFT\n elif heading == self.LEFT:\n heading = self.UP\n else:\n heading = self.DOWN\n return (x, y, heading, map_data)\n\n elif move == self.SHOOT_LASER:\n # set laser direction\n if heading == self.UP:\n laserheading = self.UP\n dy, dx = (-1, 0)\n elif heading == self.DOWN:\n laserheading = self.DOWN\n dy, dx = (1, 0)\n elif heading == self.LEFT:\n laserheading = self.LEFT\n dy, dx = (0, -1)\n else:\n laserheading = self.RIGHT\n dy, dx = (0, 1)\n\n # loop until laser blocking object reached\n ly, lx = (y, x)\n while True:\n ly += dy\n lx += dx\n\n # handle boundary and immovable obstacles\n if ly < 0 or ly >= self.y_size or \\\n lx < 0 or lx >= self.x_size or \\\n map_data[ly][lx] == self.OBSTACLE_SYMBOL:\n # laser stopped without effect\n return self.COLLISION\n\n # handle movable objects\n elif self.cell_is_laser_movable(ly, lx, laserheading, map_data):\n # check if tile can be moved without collision\n if self.cell_is_blocked(ly + dy, lx + dx, map_data) or \\\n map_data[ly + dy][lx + dx] == self.ICE_SYMBOL or \\\n map_data[ly + dy][lx + dx] == self.TELEPORT_SYMBOL or \\\n map_data[ly + dy][lx + dx] == self.FLAG_SYMBOL or \\\n (ly + dy == y and lx + dx == x):\n # tile cannot be moved\n return self.COLLISION\n else:\n old_symbol = map_data[ly][lx]\n map_data[ly][lx] = self.LAND_SYMBOL\n if map_data[ly + dy][lx + dx] == self.WATER_SYMBOL:\n # if new bridge position is water, convert to land tile\n if old_symbol == self.BRIDGE_SYMBOL:\n map_data[ly + dy][lx + dx] = self.LAND_SYMBOL\n # otherwise, do not replace the old symbol\n else:\n # otherwise, move the tile forward\n map_data[ly + dy][lx + dx] = old_symbol\n break\n\n # handle bricks\n elif map_data[ly][lx] == self.BRICK_SYMBOL:\n # remove brick, replace with land\n map_data[ly][lx] = self.LAND_SYMBOL\n break\n\n # handle facing anti-tanks\n elif (map_data[ly][lx] == self.ANTI_TANK_UP_SYMBOL and laserheading == self.DOWN) or \\\n (map_data[ly][lx] == self.ANTI_TANK_DOWN_SYMBOL and laserheading == self.UP) or \\\n (map_data[ly][lx] == self.ANTI_TANK_LEFT_SYMBOL and laserheading == self.RIGHT) or \\\n (map_data[ly][lx] == self.ANTI_TANK_RIGHT_SYMBOL and laserheading == self.LEFT):\n # mark anti-tank as destroyed\n map_data[ly][lx] = self.ANTI_TANK_DESTROYED_SYMBOL\n break\n\n # handle player laser collision\n elif ly == y and lx == x:\n return self.GAME_OVER\n\n # handle facing mirrors\n elif (map_data[ly][lx] == self.MIRROR_UL_SYMBOL and laserheading == self.RIGHT) or \\\n (map_data[ly][lx] == self.MIRROR_UR_SYMBOL and laserheading == self.LEFT):\n # new direction is up\n dy, dx = (-1, 0)\n laserheading = self.UP\n elif (map_data[ly][lx] == self.MIRROR_DL_SYMBOL and laserheading == self.RIGHT) or \\\n (self.grid_data[ly][lx] == self.MIRROR_DR_SYMBOL and laserheading == self.LEFT):\n # new direction is down\n dy, dx = (1, 0)\n laserheading = self.DOWN\n elif (map_data[ly][lx] == self.MIRROR_UL_SYMBOL and laserheading == self.DOWN) or \\\n (map_data[ly][lx] == self.MIRROR_DL_SYMBOL and laserheading == self.UP):\n # new direction is left\n dy, dx = (0, -1)\n laserheading = self.LEFT\n elif (map_data[ly][lx] == self.MIRROR_UR_SYMBOL and laserheading == self.DOWN) or \\\n (map_data[ly][lx] == self.MIRROR_DR_SYMBOL and laserheading == self.UP):\n # new direction is right\n dy, dx = (0, 1)\n laserheading = self.RIGHT\n # do not terminate laser on facing mirror - keep looping\n\n # check for game over condition after effect of laser\n if self.cell_is_game_over(y, x, map_data):\n return self.GAME_OVER\n return (x, y, heading, map_data)\n return self.SUCCESS","def make_move(self, board: Board) -> int:\n raise NotImplementedError","def make_move(self, board: Block) -> int:\n raise NotImplementedError","def board_from_move(self, move, color):\n new_board = KhetBoard(self.color_pieces[TeamColor.silver] + self.color_pieces[TeamColor.red])\n new_board.apply_move(move)\n new_board.apply_laser(color)\n return new_board","def move(self, action: Action) -> State:\n new_state = State(self.size_h, self.size_v, self.wall_squares, self.boxes, self.storage_locations,\n self.current_location, action)\n\n if action == Action.DOWN:\n down_loc = (new_state.current_location[0] + 1, new_state.current_location[1])\n two_away = (down_loc[0] + 1, down_loc[1])\n new_state.current_location = down_loc\n if down_loc in new_state.boxes:\n new_state.boxes.remove(down_loc)\n new_state.boxes.append(two_away)\n\n elif action == Action.UP:\n up_loc = (new_state.current_location[0] - 1, new_state.current_location[1])\n two_away = (up_loc[0] - 1, up_loc[1])\n new_state.current_location = up_loc\n if up_loc in new_state.boxes:\n new_state.boxes.remove(up_loc)\n new_state.boxes.append(two_away)\n\n elif action == Action.RIGHT:\n right_loc = (new_state.current_location[0], new_state.current_location[1] + 1)\n two_away = (right_loc[0], right_loc[1] + 1)\n new_state.current_location = right_loc\n if right_loc in new_state.boxes:\n new_state.boxes.remove(right_loc)\n new_state.boxes.append(two_away)\n\n elif action == Action.LEFT:\n left_loc = (new_state.current_location[0], new_state.current_location[1] - 1)\n two_away = (left_loc[0], left_loc[1] - 1)\n new_state.current_location = left_loc\n if left_loc in new_state.boxes:\n new_state.boxes.remove(left_loc)\n new_state.boxes.append(two_away)\n\n new_state._validate() # TODO: Remove me for the final product.\n return new_state","def make_move(state, action, player, rewarding_move=False): # TODO : done and next_is_reward can be removed as\n # they are in the state object\n board = state.get_board()\n json_action = action.get_json_action()\n action = action.get_action_as_dict()\n captured = None\n reward = 0\n next_is_reward = False\n previous_is_reward = False\n if rewarding_move:\n state.boring_moves = 0\n previous_is_reward = True\n if action['action_type'] == YoteActionType.STEAL_FROM_HAND:\n reward += 1\n state.in_hand[player * -1] -= 1\n elif action['action_type'] == YoteActionType.STEAL_FROM_BOARD:\n board.empty_cell(action['action']['at'])\n reward += 1\n else:\n if action['action_type'] == YoteActionType.ADD:\n state.boring_moves += 1\n state.in_hand[player] -= 1\n board.fill_cell(action['action']['to'], Color(player))\n elif action['action_type'] == YoteActionType.MOVE:\n at = action['action']['at']\n to = action['action']['to']\n\n def distance(cell_1, cell_2):\n import math\n return math.sqrt((cell_1[0] - cell_2[0]) ** 2 + (cell_1[1] - cell_2[1]) ** 2)\n\n board.empty_cell(at)\n board.fill_cell(to, Color(player))\n if int(distance(at, to)) == 1:\n state.boring_moves += 1\n elif int(distance(at, to)) > 1:\n state.boring_moves = 0\n next_is_reward = True\n board.fill_cell(to, Color(player))\n if at[0] == to[0] and at[1] < to[1]:\n board.empty_cell((at[0], at[1] + 1))\n captured = (at[0], at[1] + 1)\n elif at[0] == to[0] and at[1] > to[1]:\n board.empty_cell((at[0], at[1] - 1))\n captured = (at[0], at[1] - 1)\n elif at[1] == to[1] and at[0] < to[0]:\n board.empty_cell((at[0] + 1, at[1]))\n captured = (at[0] + 1, at[1])\n elif at[1] == to[1] and at[0] > to[0]:\n board.empty_cell((at[0] - 1, at[1]))\n captured = (at[0] - 1, at[1])\n reward += 1\n\n state.set_board(board)\n state.score[player] += reward\n state.captured = captured\n state.rewarding_move = next_is_reward\n state.previous_is_reward = previous_is_reward\n state.set_latest_player(player)\n state.set_latest_move(json_action)\n if next_is_reward:\n state.set_next_player(player)\n else:\n state.set_next_player(player * -1)\n\n done = YoteRules.is_end_game(state)\n return state, done, next_is_reward","def make_move(self):\n\n # get relavent information\n affinity = self.get_affinity()\n sample_space = self.get_game_space()\n depth_limit = self.__search_depth\n\n # run a minimax search and get the best value\n bestval = MinimaxTree.alphabeta(self, sample_space, affinity, depth_limit, -10000, 10001, True)\n if bestval[0] is None: bestval = ((0,6),'x', 0)\n\n # print the number of nodes expanded \n print(self.nodes_expanded)\n\n # make the move found by the search \n self.get_game_space().set_tile(bestval[0][0], bestval[0][1], affinity)","def request_move(self, board):\n pass","def make_move(self, move: Tuple[int, int]) -> MoveError:\n\n # Make sure our move is going to be valid\n if self.is_winner():\n return MoveError.GAME_WON\n\n elif move[0] >= self._board_size or move[0] < 0 or move[1] >= self._board_size or move[1] < 0:\n return MoveError.OUT_OF_RANGE\n\n elif self._board[move[1]][move[0]] != self.NEUTRAL_PLAYER:\n return MoveError.TAKEN\n\n # If we make it to here, then it is valid to make the move\n self._board[move[1]][move[0]] = self._players[self._current_player]\n self._number_of_moves = self._number_of_moves + 1\n self._last_move = move\n\n self._check_for_winner()\n\n # Only change who the player is if we didn't get a winner,\n # otherwise the final board's color will be wrong\n if not self.is_winner():\n self._current_player = (self._current_player + 1) % len(self._players)\n\n return MoveError.OKAY","def move_to(self, board, new_pos, next_turn):\n board.get_covered_squares(next_turn)\n self.get_legal_moves(board)\n legal_pos = {(self.field_row + move[0], self.field_col + move[1])\n for move in self.legal_moves | self.legal_capture_moves}\n if (FIELD_ROW_DICT[new_pos[1]], FIELD_COL_DICT[new_pos[0]]) in legal_pos:\n for piece in board.figures:\n if (piece.field_row == FIELD_ROW_DICT[new_pos[1]]\n and piece.field_col == FIELD_COL_DICT[new_pos[0]]):\n piece.get_captured(board)\n old_pos_row = copy.deepcopy(self.field_row)\n old_pos_col = copy.deepcopy(self.field_col)\n self.field_row = FIELD_ROW_DICT[new_pos[1]]\n self.field_col = FIELD_COL_DICT[new_pos[0]]\n board.create_board()\n board.king_in_check(self.color)\n if board.in_check == self.color:\n self.field_row = old_pos_row\n self.field_col = old_pos_col\n board.create_board()\n return False, \"illegal move: king in check\"\n else:\n return True, \"legal move carried out\"\n else:\n return False, f\"illegal move: {self.short_name} cannot move to {new_pos}\"","def make_move(self, move_to_play, color_to_move, return_capture=False):\r\n captures = 0\r\n if move_to_play == 'PASS':\r\n board_copy = Board(self.state, self.previous_state, self.to_move)\r\n if self.to_move == 1:\r\n board_copy.to_move = 2\r\n else:\r\n board_copy.to_move = 1\r\n if return_capture:\r\n return board_copy, captures\r\n else:\r\n return board_copy\r\n\r\n current_state = np.array(self.state)\r\n ptemp_state = np.array(current_state)\r\n\r\n for p in ORTHOGONAL_POSITIONS[move_to_play]:\r\n if self.board[p[0]][p[1]].chain_liberty == 1 and self.board[p[0]][p[1]].color != color_to_move:\r\n captures += len(self.chains[(self.board[p[0]][p[1]].chain_num, self.board[p[0]][p[1]].color)])\r\n current_state = self.remove_chain(self.board[p[0]][p[1]].chain_num, self.board[p[0]][p[1]].color,\r\n current_state)\r\n\r\n elif self.board[p[0]][p[1]].liberty == 1 and self.board[p[0]][p[1]].color != color_to_move:\r\n captures += 1\r\n current_state[p[0]][p[1]] = 0\r\n\r\n current_state[move_to_play[0]][move_to_play[1]] = color_to_move\r\n if color_to_move == 1:\r\n temp_board = Board(current_state, ptemp_state, 2)\r\n else:\r\n temp_board = Board(current_state, ptemp_state, 1)\r\n if return_capture:\r\n return temp_board, captures\r\n else:\r\n return temp_board","def applyMove(self, (from_row,from_col), (to_row,to_col)):\n newboard = deepcopy(self)\n piece = newboard.board[from_row][from_col]\n newboard.board[from_row][from_col] = None\n newboard.board[to_row][to_col] = piece\n newboard.toplay = 'BLACK' if self.toplay == 'WHITE' else 'WHITE'\n return newboard","def execute_move(self, move, color):\n\n #Much like move generation, start at the new piece's square and\n #follow it on all 8 directions to look for a piece allowing flipping.\n\n # Add the piece to the empty square.\n # print(move)\n flips = [flip for direction in self.__directions\n for flip in self._get_flips(move, direction, color)]\n assert len(list(flips))>0\n for x, y in flips:\n #print(self[x][y],color)\n self[x][y] = color","def make_move(self, move, check_valid=True):\r\n self.board[move.sr][move.sc] = \"--\"\r\n self.board[move.er][move.ec] = move.pieceMoved\r\n self.moveLog.append(move)\r\n self.turn_white = not self.turn_white\r\n if move.pieceMoved == 'wk':\r\n self.wKingPos = (move.er, move.ec)\r\n elif move.pieceMoved == 'bk':\r\n self.bKingPos = (move.er, move.ec)\r\n\r\n if move.isEnpassantMove:\r\n self.board[move.sr][move.ec] = \"--\"\r\n\r\n if move.pieceMoved[1] == 'p' and abs(move.sr - move.er) == 2:\r\n self.enpas_pos = ((move.er + move.sr) // 2, move.ec)\r\n else:\r\n self.enpas_pos = ()\r\n\r\n if move.isPawnPromotion and not check_valid:\r\n promoted_piece = \"a\"\r\n while promoted_piece not in ('q', 'r', 'b', 'n'):\r\n promoted_piece = input(\"Promote to q, r, b, or n: \")\r\n self.board[move.er][move.ec] = move.pieceMoved[0] + promoted_piece\r\n\r\n # castle\r\n if move.castle:\r\n if move.ec - move.sc == 2:\r\n self.board[move.er][move.ec - 1] = self.board[move.er][move.ec + 1]\r\n self.board[move.er][move.ec + 1] = '--'\r\n else:\r\n self.board[move.er][move.ec + 1] = self.board[move.er][move.ec - 2]\r\n self.board[move.er][move.ec - 2] = '--'\r\n\r\n # castle rights on rook, king move\r\n self.update_castle_rights(move)\r\n self.castleRightsLog.append(CastleRights(self.cr_castle_r.wks, self.cr_castle_r.bks,\r\n self.cr_castle_r.wqs, self.cr_castle_r.bqs))","def make_move(self, px, py):\n if self.state != State.IN_PROGRESS:\n raise GameEndedError('Cannot make move. The game has ended.')\n x, y, i, j = self.to_coords(px, py)\n board = self.boards[x][y]\n if (x, y) not in self.available_boards:\n raise IllegalMoveError('Illegal move. Board is unavailable.')\n board.set_square(i, j, self.__on_turn)\n self.__on_turn = Square.X if self.__on_turn == Square.O else Square.O\n self.last_move = (x, y, i, j)\n self.history.append(self.last_move)","def simulate(state: GameState) -> int:\n moves = list(state.moves)\n #print(\" moves available: \", moves)\n for i in range(len(state.moves)):\n move = random.choice(moves)\n #print(\" move making: \", move)\n move_idx = moves.index(move)\n #print(\" index of move: \", move_idx)\n moves.pop(move_idx)\n #print(\" new moves available: \", moves)\n state = state.traverse(move)\n #print(\" Winner: \", state.util)\n #print(\" New Board: \", state.display)\n return state.util","def move(self, board):\n\n if board.get_number_of_moves() == 0:\n random_row = randint(0, 2)\n random_column = randint(0, 2)\n\n if random_row == 1 or random_column == 1:\n random_row = 1\n random_column = 1\n elif random_row == 2:\n random_row = board.get_dimension()-1\n\n if random_column == 2:\n random_column = board.get_dimension()-1\n\n move = (random_row, random_column)\n elif board.get_number_of_moves() == 1 or board.get_number_of_moves() == 2:\n if board.get_piece(1,1) == ' ':\n move = (1, 1)\n else:\n board_dimension = board.get_dimension()-1\n corners = [(0, 0), (0, board_dimension), (board_dimension, 0), (board_dimension, board_dimension)]\n corners = self.remove_filled_positions(corners, board)\n\n move = corners[randint(0, len(corners)-1)]\n else:\n move = self.check_for_winner(board)\n\n if move == (-1, -1):\n board_dimension = board.get_dimension()-1\n corner1_moves = self.remove_filled_positions([(0, 0), (2, 2)], board)\n corner2_moves = self.remove_filled_positions([(0, 2), (2, 0)], board)\n\n non_corner_moves = self.remove_filled_positions([(1, 0), (2, 1), (1, 2), (0, 1)], board)\n\n center_piece = board.get_piece(1, 1)\n corner_pieces = [board.get_piece(0, 0), board.get_piece(board_dimension, 0), board.get_piece(0, board_dimension), board.get_piece(board_dimension, board_dimension)]\n\n if corner_pieces[0] != self._piece and corner_pieces[0] != ' ' and corner_pieces[0] == corner_pieces[3]:\n move = non_corner_moves[randint(0, 3)]\n elif corner_pieces[1] != self._piece and corner_pieces[1] != ' ' and corner_pieces[1] == corner_pieces[2]:\n move = non_corner_moves[randint(0, 3)]\n elif len(corner2_moves) > 0 and corner_pieces[0] != self._piece and corner_pieces[0] == center_piece and corner_pieces[3] == self._piece:\n move = corner2_moves[0]\n elif len(corner1_moves) > 0 and corner_pieces[1] != self._piece and corner_pieces[1] == center_piece and corner_pieces[2] == self._piece:\n move = corner1_moves[0]\n elif len(corner1_moves) > 0 and corner_pieces[2] != self._piece and corner_pieces[2] == center_piece and corner_pieces[1] == self._piece:\n move = corner1_moves[0]\n elif len(corner2_moves) > 0 and corner_pieces[3] != self._piece and corner_pieces[3] == center_piece and corner_pieces[0] == self._piece:\n move = corner2_moves[0]\n else:\n move = self.can_complete_two_in_row(board)\n\n if move == (-1, -1):\n move = (randint(0, board.get_dimension()-1), randint(0, board.get_dimension()-1))\n\n while not board.check_move(move[0], move[1]):\n move = (randint(0, board.get_dimension()-1), randint(0, board.get_dimension()-1))\n\n return move","def get_move(moves):\n pass","def make_move(self, board: Board) -> int:\n return random.choice(board.get_valid_moves())","def _next_state(self, state, action):\n\n # Transition table to define movement for each action\n if self.action_type == 'VonNeumann':\n transitions = {0: [-1, 0], 1: [+1, 0], 2: [0, -1], 3: [0, +1]}\n elif self.action_type == 'Moore':\n transitions = {0: [-1, 0], 1: [+1, 0], 2: [0, -1], 3: [0, +1],\n 4: [-1, +1], 5: [+1, +1], 6: [-1, -1], 7: [+1, -1]}\n\n new_state = [state[0] + transitions[action][0], state[1] + transitions[action][1]]\n if self.maze[new_state[0]][new_state[1]] == 1: # Hit wall, stay there\n return state\n else: # Valid move for 0, 2, 3, 4\n return new_state","def make_move(board, index, p):\n if not utils.is_valid_player(p) or p == config.NO_PLAYER:\n raise Exception('Input p must = {0} or {1}. p = {3}'.format(config.HUMAN, config.COMPUTER, p))\n result = copy.deepcopy(board)\n result[index] = p\n if not is_valid_board(result):\n raise Exception('Move for {0} at {1} is invalid.'.format(p, index))\n return result","def make_move(board, position, player):\n # only valid moves are passed in here\n board[position-1] = player","def makeMove(self, colour, move):\n emptyCellList = [r for r in range(self.getHeight()) if self.cell[move][r]==EMPTY]\n self.cell[move][emptyCellList[0]] = colour # put the stone in the first empty cell of column 'move'","def make_move(self, board: Board) -> int:\n\n move = input()\n move = int(move)\n\n while move not in board.get_valid_moves():\n print(\"That is not a valid move\")\n move = input()\n move = int(move)\n\n return move","def calculate_next_move(self, visit):\n self.depth += 1\n new_boards = []\n for vehicle_id in range(len(self.vehicles)):\n vehicle = self.vehicles[vehicle_id]\n state = self.get_board()\n if vehicle.orientation == 0: #horizontal\n if vehicle.x > 0: #left\n if state[vehicle.y][vehicle.x-1] == \"..\":\n self.vehicles[vehicle_id].x -=1\n if not self.get_board().tostring() in visit:\n if not self.get_board().all in new_boards:\n new_board = deepcopy(self)\n self.vehicles[vehicle_id].x += 1\n new_board.parent = self\n new_boards.append(new_board)\n else:\n self.vehicles[vehicle_id].x += 1\n\n if vehicle.x + vehicle.length <= (len(state)-1): #right\n if state[vehicle.y][vehicle.x+vehicle.length] == \"..\":\n self.vehicles[vehicle_id].x += 1\n if not self.get_board().tostring() in visit:\n if not self.get_board().all in new_boards:\n new_board = deepcopy(self)\n self.vehicles[vehicle_id].x -= 1\n new_board.parent = self\n new_boards.append(new_board)\n else:\n self.vehicles[vehicle_id].x -= 1\n\n else: #vertical\n if vehicle.y - 1 >= 0: #up\n if state[vehicle.y-1][vehicle.x] == \"..\":\n self.vehicles[vehicle_id].y -= 1\n if not self.get_board().tostring() in visit:\n if not self.get_board().all in new_boards:\n new_board = deepcopy(self)\n self.vehicles[vehicle_id].y += 1\n new_board.parent = self\n new_boards.append(new_board)\n else:\n self.vehicles[vehicle_id].y += 1\n\n if vehicle.y + vehicle.length <= (len(state)-1):\n if state[vehicle.y + vehicle.length][vehicle.x] == \"..\":#down\n self.vehicles[vehicle_id].y += 1\n if not self.get_board().tostring() in visit:\n if not self.get_board().all in new_boards:\n new_board = deepcopy(self)\n self.vehicles[vehicle_id].y -= 1\n new_board.parent = self\n new_boards.append(new_board)\n else:\n self.vehicles[vehicle_id].y -= 1\n self.depth -= 1\n return new_boards","def make_move(self, move_from, move_to):\n\n from_coordinates = self.translate_to_grid(move_from)\n to_coordinates = self.translate_to_grid(move_to)\n from_col = from_coordinates[0]\n from_row = from_coordinates[1]\n to_col = to_coordinates[0]\n to_row = to_coordinates[1]\n value_at_from = self._board[from_col][from_row]\n value_at_to = self._board[to_col][to_row]\n\n # if player passes the same square value for both move_from and move_to, then they are passing their turn\n # which they however cannot do if they are in check\n if not self.is_in_check(self._turn) and move_from == move_to:\n if self._turn == 'red':\n self._turn = 'blue'\n else:\n self._turn = 'red'\n return True\n\n # if game isn't over yet and move_from location holds a piece\n if (self.get_game_state() == 'UNFINISHED' and issubclass(type(value_at_from), Piece) and\n # and that piece belongs to the player whose turn it is\n self._turn == value_at_from.get_color() and\n # and the movement pattern is valid for that piece\n value_at_from.validate_move(move_from, move_to, self._board)):\n # if there's a piece belonging to the player whose turn it is at move_to (attempting to capture own piece)\n if issubclass(type(value_at_to), Piece) and self._turn == value_at_to.get_color():\n return False\n else:\n # Make the move\n # if move_to holds an opposing piece, it gets captured\n if issubclass(type(value_at_to), Piece):\n self.remove_piece(value_at_to)\n value_at_from.set_location(move_to)\n self._board[to_col][to_row] = value_at_from\n self._board[from_col][from_row] = ''\n # whether the player was already in check or this move placed them in check, they cannot now be in check\n if type(self.is_a_player_in_check(self._turn)) is General and self.is_a_player_in_check(self._turn).get_color() == self._turn:\n # Revert the move and return False since the player did not bring themself out of check\n self._board[from_col][from_row] = value_at_from\n self._board[to_col][to_row] = value_at_to\n value_at_from.set_location(move_from)\n if issubclass(type(value_at_to), Piece):\n self._active_pieces[value_at_to.get_color()].append(value_at_to)\n return False\n # the player either already wasn't or now isn't in check, so set its General to not in check\n self.get_general(self._turn).set_in_check(False)\n # if opposing general was put in check, set its in_check status to True and see if checkmate\n if type(self.is_a_player_in_check(self._turn)) is General:\n self.is_a_player_in_check(self._turn).set_in_check(True)\n if self.checkmate(self.is_a_player_in_check(self._turn)):\n if self._turn == 'red':\n self._game_state = 'RED_WON'\n else:\n self._game_state = 'BLUE_WON'\n # turn complete, change to other player's turn\n if self._turn == 'red':\n self._turn = 'blue'\n else:\n self._turn = 'red'\n return True\n return False","def make_move(self): \n if self.counter == 0:\n #AI makes a random move to start\n ai_move = random.randrange(0,((self.size[0] * self.size[1]) - 1)) \n \n #Number to coordinate conversion\n row = ai_move % self.size[0]\n column = ai_move % self.size[0]\n self.start_game((row, column))\n self.counter = 1\n\n if (self.board[(row, column)] == 'm'):\n #print() \"\\n\", \"First move RIP!, what are the odds...\"\n self.found_mine()\n self.gameover = 1\n \n else:\n row, column = self.find_move()\n \n #0.25 second wait \n #time.sleep(0.25)\n\n #Prints out to the terminal the move and type of move\n print(row, \",\", column)\n\n #Updates the GUI\n root.update()\n \n if (self.board[(row, column)] == 'm'):\n print(\"RIP!\") \n self.found_mine() \n self.gameover = 1\n \n elif self.board[(row, column)] == '0':\n print(\"No mines in sight\") \n self.found_space((row, column))\n\n elif self.board[(row, column)] == '1':\n print(\"There is 1 mine next to this spot\") \n self.found_border((row, column))\n else:\n print(\"There are\", self.board[(row, column)], \"mines next to this spot\") \n self.found_border((row, column))","def make_move(self, position_from, position_to):\n\n # Returns False if position_from or position_to are not an actual position\n # ranging from 'a1' to 'i10' for columns 'a' through 'i' and rows '1' \n # through '10'.\n if not isinstance(position_to, str) or\\\n not isinstance(position_from,str) or\\\n len(position_to) > 3 or len(position_to) < 2 or\\\n len(position_from) > 3 or len(position_from) < 2:\n\n return False \n\n # Returns False if game has been won.\n elif self.get_game_state() != 'UNFINISHED':\n\n return False\n\n position_to = position_to.lower()\n position_from = position_from.lower()\n current_player = self.get_player_turn()\n\n # Returns False if move is not legal based on Janggi game rules.\n if self.legal_move(position_to, position_from) is not True:\n\n return False\n\n # Returns True if current player wishes to pass on their move.\n # Any position on the board will suffice, including a General's position.\n # Tested in legal_move to exit legal_move safely. The second test for pass\n # updates player turn and returns True, so long as the player is not\n # currently in check.\n if position_to == position_from:\n\n if self.is_in_check(current_player) is True:\n \n return False\n\n self.update_player_turn()\n return True\n\n # Move is valid. Adjusted board, update potential moves for all GamePieces,\n # test checkmate (change game_state if True), update player turn, and\n # return True.\n else:\n\n game_piece_object = self.get_game_piece_object_at_position(position_from)\n self.adjust_board(game_piece_object, position_to, position_from)\n self.update_potential_moves()\n \n # Sets the General's Board position attribute if the position has\n # changed.\n if isinstance(game_piece_object, General):\n\n if current_player == 'BLUE':\n\n self.set_general_position_blue(position_to)\n\n else:\n\n self.set_general_position_red(position_to)\n\n # Sets game_state to the player who won if checkmate is detected.\n if self.is_checkmate() is True:\n\n if current_player == 'BLUE':\n\n self.set_game_state('BLUE_WON')\n \n else:\n\n self.set_game_state('RED_WON')\n\n self.update_player_turn()\n return True","def apply_move(self, move):\n if self.check_move(move=move):\n self.board_list[move] = self.current_player.marker # changes value in the board to player which is either X or O\n self.moves_made += str(move) # keeps track of all moves\n return True\n else:\n return False","def is_new_move(my_board, x, y):\n return my_board[x, y] == CLOSED","def update(self, move):\n\n if not 0 <= move < 7:\n raise InvalidMove\n\n placed = False\n x = None\n y = None\n\n for row in reversed(xrange(self._rows)):\n if not self._board[row][move]:\n self._board[row][move] = self.current_player\n placed = True\n x = move\n y = row\n break\n\n if not placed:\n raise InvalidMove\n\n return (x, y)","def make_move(move):\n global manatee_pos\n global hyacinths\n global hyacinth_pos\n\n # Ends the program if movement is out of bounds\n if move == (0, 0):\n return None\n new_pos = (manatee_pos[0] + move[0], manatee_pos[1] + move[1])\n if new_pos[0] < 0 or new_pos[0] >= len(map):\n return None\n if new_pos[1] < 0 or new_pos[1] >= len(map[new_pos[0]]):\n return None\n\n entity = map[new_pos[0]][new_pos[1]]\n if entity == \"#\" or entity == \"G\":\n # Runs if movement is impossible\n return None\n if entity == \" \" or entity == \".\":\n # Runs if normal movement is possible\n map[new_pos[0]][new_pos[1]] = \"M\"\n map[manatee_pos[0]][manatee_pos[1]] = \" \"\n manatee_pos = new_pos\n return None\n if entity == \"O\":\n # Runs if manatee wins game\n map[new_pos[0]][new_pos[1]] = \"M\"\n map[manatee_pos[0]][manatee_pos[1]] = \" \"\n manatee_pos = new_pos\n return \"win\"\n if entity == \"\\\\\":\n # Runs if manatee eats hyacinth\n map[new_pos[0]][new_pos[1]] = \"M\"\n map[manatee_pos[0]][manatee_pos[1]] = \" \"\n manatee_pos = new_pos\n hyacinths += 1\n if len(hyacinth_pos) == hyacinths:\n map[grate_pos[0]][grate_pos[1]] = \"O\"\n return None\n if entity == \"*\":\n # Checks if manatee can push boat\n if move[0] == 0:\n new_boat_pos = (new_pos[0] + move[0], new_pos[1] + move[1])\n if new_boat_pos[0] < 0 or new_boat_pos[0] >= len(map):\n return None\n if new_boat_pos[1] < 0 \\\n or new_boat_pos[1] >= len(map[new_boat_pos[0]]):\n return None\n if map[new_boat_pos[0]][new_boat_pos[1]] == \" \":\n map[new_boat_pos[0]][new_boat_pos[1]] = \"*\"\n map[new_pos[0]][new_pos[1]] = \"M\"\n map[manatee_pos[0]][manatee_pos[1]] = \" \"\n manatee_pos = new_pos\n return None\n return None","def move(self, movement):\n index = self.state.index(0)\n\n new_state = self.state.copy()\n\n if movement == 'up':\n new_state[index], new_state[index - 3] = new_state[index - 3], new_state[index]\n elif movement == 'down':\n new_state[index], new_state[index + 3] = new_state[index + 3], new_state[index]\n elif movement == 'left':\n new_state[index], new_state[index - 1] = new_state[index - 1], new_state[index]\n else:\n # movement == 'right'\n new_state[index], new_state[index + 1] = new_state[index + 1], new_state[index]\n \n return new_state","def make_move(self, request):\n\n player = Player.query(Player.name == request.player_name).get()\n\n \"\"\"we validate that the player is in the Data Base\"\"\"\n if not player:\n raise endpoints.NotFoundException('player not found')\n\n game = gameutils.get_by_urlsafe(request.urlsafe_key, Game)\n \"\"\"we validate that the game where we want to create the board exists\"\"\"\n if not game:\n raise endpoints.NotFoundException(\n 'Game not found in the DB, please start a new game')\n\n board = Board.query(Board.key == player.board).get()\n \"\"\"we validate that the board where we want to create the board exists\"\"\"\n if not board:\n raise endpoints.NotFoundException('board not found')\n\n \"\"\"we validate that the board of the player is active, the player can't create\n multiple boards for the same Game\"\"\"\n if not player.board and not player.board_active:\n raise endpoints.ConflictException(\n 'This player has already an empty board have already a board')\n\n if player.board != board.key:\n raise endpoints.ConflictException('the board for this player is not the proper')\n\n if not gameutils.valid_target_pointed(request.x_position, request.y_position):\n raise endpoints.ConflictException('the targeted position is not ok')\n\n\n try:\n result = gameutils.search_in_board(board, request.x_position, request.y_position)\n\n if result == \"error\":\n raise endpoints.ConflictException('there is a problem with the BOARD')\n else:\n score = Score.query(Score.player_name == player.name, Score.board == board, Score.game == game)\n board.add_target(request.x_position, request.y_position)\n game.add_move_to_history(request.x_position, request.y_position, player.name)\n message = score.target_hitted(player,request.x_position, request.y_position, board, game)\n if score.check_if_win():\n message = \"You sunk the last Boat, you win!!!\"\n board.deactivate()\n return StringMessage(message=message)\n\n except ValueError:\n raise endpoints.BadRequestException('please verify the information ')","def makeMove(self, move, player):","def respond_to_move(self, move):\n\n # this will get the piece at the queried position,\n # will notify user if there is no piece there\n current_algebraic, new_algebraic = move\n row, column = self.algebraic_mapped_to_position[current_algebraic]\n if self.board[row][column] == empty_square:\n print(\"There is no piece at %s\" % (current_algebraic,))\n return\n piece, location = self.board[row][column]\n\n # this will get all possible moves from this position\n # and will make the move if the new position is a\n # valid move\n piece_name = self.piece_names[piece]\n moves = self.moves[piece_name]((row, column))\n \n new_row, new_column = self.algebraic_mapped_to_position[new_algebraic]\n print(\"old position %s, %s\" % (row, column))\n print(\"new algebraic %s\" % new_algebraic)\n print(\"new position %s, %s\" % (new_row, new_column))\n print(\"moves %s\" % moves)\n if (new_row, new_column) in moves:\n # this will change the game board to reflect the move\n self.board[row][column] = empty_square\n self.board[new_row][new_column] = piece+location","def make_move(self, time_limit, players_score):\n \n start_time = time.time()\n d = 1 \n \n reach_the_end = False\n best_direction = None\n chosen_state = None\n \n time_limit = (2 * self.game_time * float(self.player_turns - self.turns + 1)) / ((self.player_turns + 1) * self.player_turns)\n time_limit += self.spaire_time\n\n if time_limit >= 5:\n TIME_ESTIMATION = 0.9 \n else:\n TIME_ESTIMATION = 0.85\n\n while not reach_the_end: \n \n iter_time_limit = TIME_ESTIMATION * ( time_limit - (time.time() - start_time) )\n \n state = State(get_directions(),self.board,self.locations,self.fruits_on_board_dict,PLAYER,players_score,self.penalty_score,self.fruits_ttl,self.turns)\n\n try:\n _, best_direction, reach_the_end,chosen_state = self.alphabeta.search(state,d,True,iter_time_limit,alpha=float('-inf'), beta=float('inf'))\n d += 1\n except Exception as e:\n self.spaire_time = time_limit - (time.time() - start_time)\n break\n \n # Set new location \n if best_direction == None:\n best_direction = self.get_random_move() \n self.set_player_location(best_direction)\n \n self.turns += 1\n return best_direction","def updated_board(board_w, board_h, piece_list, board, position):\n board_state = board.state\n new_board = Board(board_w, board_h, 1, piece_list, position)\n new_board.state = board_state\n return new_board","def makeMove(self, state, column, color):\n \n temp = [x[:] for x in state]\n for i in range(6):\n if temp[i][column] == ' ':\n temp[i][column] = color\n return temp","def is_valid_move(state, move):\n row, col = move\n if row not in [1, 2, 3] or col not in [1, 2, 3]:\n print(\"Invalid move! Specify correct game square!\")\n return False\n if state[row-1][col-1] != '_':\n print('Invalid move! Place your marker on a free square!')\n return False\n return True","def update_board(board: Board, move: Move) -> Board:\n old_position = move[0]\n new_position = move[1]\n character = board[old_position[0]][old_position[1]]\n board = change_position(board, new_position, character)\n board = clear_position(board, old_position)\n \n return board","def exploreNext(neighbor, move):\n if (neighbor != None and tuple(neighbor) not in explored):\n nextState = State(neighbor)\n nextState.path = currentState.path.copy()\n nextState.path.append(move)\n stateQueue.append(nextState)","def select_move(self, game_state, return_visit_counts=False):\n \n # Start with a tree consisting of a root node only. The root node\n # is associated with the given board position.\n root = self.create_node(game_state)\n \n # If no legal moves can be made from the given board position, pass \n # the turn. This happens when all of the players pieces are surrounded,\n # if the player has no pieces left or if the game is over. \n if not root.branches:\n if return_visit_counts:\n return Act.pass_turn(), {}\n return Act.pass_turn()\n \n for i in range(self.num_rounds):\n # On each iteration, walk down the tree to a leaf node and select\n # a move to make from the corresponding leaf game state.\n node = root\n next_move = self.select_branch(node)\n while node.has_child(next_move):\n node = node.get_child(next_move)\n next_move = self.select_branch(node)\n \n # Create a new tree node for the selected move and add it to\n # the tree. If the leaf node corresponds to a finished game\n # then don't create a new node and assign a value to the node\n # based on who won.\n if node.state.is_not_over():\n if next_move:\n new_state = copy.deepcopy(node.state)\n new_state.take_turn_with_no_checks(Act.play(next_move))\n child_node = self.create_node(new_state, \n move=next_move, parent=node)\n move = next_move\n value = -1 * child_node.value \n else:\n # If the current player can't make any moves from the\n # selected gamestate then next_move will be 'None' meaning\n # the player passes the turn.\n new_state = copy.deepcopy(node.state)\n new_state.take_turn_with_no_checks(Act.pass_turn())\n child_node = self.create_node(new_state, \n move=next_move, parent=node)\n move = next_move\n value = -1 * child_node.value\n else:\n # If the game in the current state is over, then the last\n # player must have won the game. Thus the value/reward for the\n # other player is 1. The current node is not updated with\n # the new reward as no branches can stem from a finished game\n # state.\n move = node.last_move\n node = node.parent\n value = 1\n \n # Update the nodes traversed to get to the leaf node with the \n # new value for the new move.\n while node is not None:\n node.record_visit(move, value)\n move = node.last_move\n node = node.parent\n value *= -1\n \n # Get the visit counts of the branches if they were requested.\n if return_visit_counts:\n visit_counts = {}\n for move in root.branches.keys():\n visit_counts[move] = root.branches[move].visit_count\n \n # Get a list of possible moves sorted according to visit count,\n # the move with the highest visit count should be first in the list.\n moves = [move for move in root.moves()]\n moves = sorted(moves, key=root.visit_count, reverse=True)\n \n # Loop through the sorted moves and return the first legal one.\n for move in moves:\n if not game_state.is_move_illegal(move):\n if return_visit_counts:\n return Act.play(move), visit_counts\n return Act.play(move)\n \n # If no legal move is found then pass the turn.\n if return_visit_counts:\n return Act.pass_turn(), visit_counts\n return Act.pass_turn()","def make_move(grid, n_columns, n_rows):\r\n # Generate the game grid to be manipulated\r\n new_grid = [[0] * (n_columns + 1) for i in range(n_rows + 1)]\r\n\r\n\r\n for i in range(n_rows):\r\n for j in range(n_columns):\r\n upper_left = grid[i-1][j-1] # neighbor to upper left of cell of interest\r\n upper = grid[i-1][j] # neighbor above cell of interest\r\n upper_right = grid[i-1][j+1] # neighbor to upper right of cell of interest\r\n left = grid[i][j-1] # neighbor to left of cell of interest\r\n right = grid[i][j+1] # neighbor to right of cell of interest\r\n bot_left = grid[i+1][j-1] # neighbor to bottom left cell of interest\r\n bot = grid[i+1][j] # neighbor below cell of interest\r\n bot_right = grid[i+1][j+1] # neighbor to bottom right of cell of interest\r\n\r\n # sum of the state of all neighbors\r\n on_neighbors = upper_left + upper + upper_right + left + right + bot_left + bot + bot_right\r\n\r\n # Any ON cell with fewer than two ON neighbors turns OFF\r\n if grid[i][j] == 1 and on_neighbors < 2:\r\n new_grid[i][j] = 0\r\n\r\n # Any ON cell with two or three ON neighbours stays ON\r\n elif grid[i][j] == 1 and (on_neighbors == 2 or on_neighbors == 3):\r\n new_grid[i][j] = 1\r\n\r\n # Any ON cell with more than three ON neighbors turns OFF\r\n elif grid[i][j] == 1 and on_neighbors > 3:\r\n new_grid[i][j] = 0\r\n\r\n # Any OFF cell with three ON neighbors turns ON\r\n elif grid[i][j] == 0 and on_neighbors == 3:\r\n new_grid[i][j] = 1\r\n\r\n return new_grid #manipulated game grid\r","def start_state():\n return chess.Board()","def result(board, action):\n\n # Create completely new board\n temp_board = copy.deepcopy(board)\n # Location of move to be made\n row_index = action[0]\n col_index = action[1]\n\n # Check for valid action\n if not 0 <= row_index <= 2 or not 0 <= col_index <= 2:\n raise Exception(\"Invalid Action\")\n\n # Make move and update board\n if board[row_index][col_index] is None:\n temp_board[row_index][col_index] = player(board)\n else:\n raise Exception(\"Invalid Action\")\n\n return temp_board","def make_move(self, index):\n if self.board[index] is None and self.get_winner() is None:\n self.board[index] = self.player\n self.player = 'O' if self.player == 'X' else 'X'\n self.winner = self.get_winner()","def move(self, board):\n\n move = (randint(0, board.get_dimension()-1), randint(0, board.get_dimension()-1))\n\n while not board.check_move(move[0], move[1]):\n move = (randint(0, board.get_dimension()-1), randint(0, board.get_dimension()-1))\n\n return move","def getMove(self, board):\n pass","def move(self, move):\n out = ''\n for val in self.moves[move]:\n out += self.state[val]\n self.state = out","def make_move(json):\n res = result(json[\"board\"], tuple(json[\"move\"]))\n emit(\"update\", res)","def result(self, state, action):\r\n\r\n sc = copy.deepcopy(state)\r\n new_piece, player = self.new_or_old_piece(state)\r\n current_player, to_action, from_action = action\r\n\r\n # Make the move\r\n sc[to_action[0]][to_action[1]] = current_player\r\n\r\n # There can't be more than 6 pieces in any state.\r\n if not new_piece:\r\n # Now making from place as null again\r\n sc[from_action[0]][from_action[1]] = '-'\r\n\r\n return sc","def makeState(*args,**kwargs):\n \n cells = []\n\n for item in args:\n #print item\n cells.append(item)\n \n newState = State(cells)\n #newState.printBoard()\n return newState","def next_move(self, board):\n self.num_moves += 1\n \n \n ################### TODO: ######################################\n # Implement your strategy here. \n # Feel free to call as many as helper functions as you want.\n # We only cares the return of this function\n ################################################################","def result(board, action):\n #we start by creating a deep copy of me board for me not to modify the original\n new_board = copy.deepcopy(board)\n #I get the player's turn in the current board.\n action_token = player(new_board)\n #If I the corresponding spot on my board is available\n if (new_board[action[0]][action[1]] == EMPTY):\n #then I will make that move with the current player\n new_board[action[0]][action[1]] = action_token\n return new_board\n else:\n #else, I raise a not a valid action error because the place is already taken or does not exist.\n raise Exception('Not a valid action')","def move(self, board):\r\n self.start_time = time.time()\r\n disk_total = self.get_disk_count(self.my_color, board) + self.get_disk_count(self.opponent_color, board)\r\n\r\n if disk_total < 15:\r\n # In early-game, we can allow a deeper minimax search since there's not too many possible moves.\r\n self.minimax_max_depth = 7\r\n\r\n elif disk_total < 45:\r\n # In mid-game, minimax tree has the most branches. Therefore, we must give it space to breathe.\r\n self.minimax_max_depth = 5\r\n else:\r\n # In the very end-game, minimax tree has the least branches, so we can allow a full search.\r\n self.minimax_max_depth = 8\r\n\r\n possible_moves = self.find_possible_moves(board, self.my_color)\r\n\r\n # If there's only one move available, return it\r\n if len(possible_moves) == 1:\r\n return possible_moves[0]\r\n\r\n # If we can take a corner, take it and don't consider any other options.\r\n # This rarely backfires and allows to save a tiny bit of time\r\n corners = [(0,0), (0,7), (7,0), (7,7)]\r\n for corner in corners:\r\n if corner in possible_moves:\r\n return corner\r\n\r\n # Grow a minimax tree to find the best available move\r\n alpha_init = -10000000\r\n beta_init = 10000000\r\n\r\n available_moves = self.minimax(board, 0, self.my_color, alpha_init, beta_init)\r\n print(available_moves)\r\n if available_moves != 0:\r\n best_value = max(available_moves.values())\r\n for move in available_moves:\r\n if available_moves[move] == best_value:\r\n return move\r\n\r\n return None","def make(self,state_board):\n\t\tstate_board[self.column][self.line] = self.couleur #place the piece\n\t\tdrawPiece((self.column,self.line),self.couleur) #draws it on the board\n\t\tfor pos in self.flips: #flips all the pieces in flips\n\t\t\tstate_board[pos[0]][pos[1]] = self.couleur\n\t\t\tdrawPiece(pos,self.couleur) #draws it on the board","def make_move(self, board: Board) -> int:\n move, evalutation = self.minimax(board, -math.inf, math.inf, self._depth, 1)\n return move","def find_best_move(state: GameState) -> None:","def make_move(self, start, end):\r\n start_pos = self.parse_pos(start) # Start and end position are lists that contain column and row\r\n end_pos = self.parse_pos(end)\r\n\r\n start_row = start_pos[0] # Position of row and columns are assigned to variables\r\n start_col = start_pos[1]\r\n end_row = end_pos[0]\r\n end_col = end_pos[1]\r\n\r\n board = self._board.get_board()\r\n start_piece = board[start_row][start_col].get_piece()\r\n end_piece = board[end_row][end_col].get_piece()\r\n\r\n\r\n # If there is no piece to be moved or game is over or piece is to be moved to its original location\r\n if start_piece is None or self._game_state != \"UNFINISHED\"\\\r\n or (start_row == end_row and start_col == end_col):\r\n return False\r\n\r\n start_piece_id = start_piece.get_player_id() # Contains the player id associated with the piece\r\n end_piece_player_id = None\r\n if end_piece is not None: # Executes if end piece contains a piece object\r\n end_piece_player_id = end_piece.get_player_id()\r\n\r\n # If Red's turn\r\n if self._player_turn == 1:\r\n if start_piece_id != 'r': # If red moves a black piece\r\n return False\r\n if start_piece.is_legal_move(start, end, start_piece, end_piece_player_id, board) : # Checks the legal move conditions\r\n if self.move_piece(start, end): # Returns False if move is invalid\r\n # Checks if move violates flying general and puts self in check\r\n if self.is_not_flying_general() is True and self.is_in_check(\"red\") is False:\r\n self.change_player_turn()\r\n self.is_in_checkmate()\r\n return True\r\n else: # Reverses the move if violates flying general rule\r\n self.reverse_move(start, end, board,end_piece_player_id, end_piece)\r\n return False\r\n\r\n else:\r\n return False\r\n else:\r\n return False\r\n\r\n # If Black's turn\r\n elif self._player_turn == -1:\r\n if start_piece_id != 'b': # If black moves a red piece\r\n return False\r\n if start_piece.is_legal_move(start, end, start_piece, end_piece_player_id, board): # Checks the legal move conditions\r\n if self.move_piece(start, end): # Returns False if move is invalid\r\n if self.is_not_flying_general() is True and self.is_in_check(\"black\") is False:\r\n self.change_player_turn()\r\n self.is_in_checkmate()\r\n return True\r\n else: # Reverses the move if violates flying general rule\r\n self.reverse_move(start, end, board, end_piece_player_id, end_piece)\r\n return False\r\n else:\r\n return False\r\n else:\r\n return False","def newGame(self):\n self.last_move = \"go\"\n self.values = [None for i in range(64)]\n for i in range(8):\n self.setPiece(i, 2, self.makePiece(ChessPiece.WHITE_PAWN, i, 2, \"wpawn\"+str(i)))\n self.setPiece(i, 7, self.makePiece(ChessPiece.BLACK_PAWN, i, 7, \"bpawn\"+str(i)))\n\n self.setPiece('a', 1, self.makePiece(ChessPiece.WHITE_ROOK, 'a', 1, \"wrook0\"))\n self.setPiece('b', 1, self.makePiece(ChessPiece.WHITE_KNIGHT, 'b', 1, \"wknight0\"))\n self.setPiece('c', 1, self.makePiece(ChessPiece.WHITE_BISHOP, 'c', 1, \"wbishop0\"))\n self.setPiece('d', 1, self.makePiece(ChessPiece.WHITE_QUEEN, 'd', 1, \"wqueen\"))\n self.setPiece('e', 1, self.makePiece(ChessPiece.WHITE_KING, 'e', 1, \"wking\"))\n self.setPiece('f', 1, self.makePiece(ChessPiece.WHITE_BISHOP, 'f', 1, \"wbishop1\"))\n self.setPiece('g', 1, self.makePiece(ChessPiece.WHITE_KNIGHT, 'g', 1, \"wknight1\"))\n self.setPiece('h', 1, self.makePiece(ChessPiece.WHITE_ROOK, 'h', 1, \"wrook1\"))\n\n self.setPiece('a', 8, self.makePiece(ChessPiece.BLACK_ROOK, 'a', 8, \"brook0\"))\n self.setPiece('b', 8, self.makePiece(ChessPiece.BLACK_KNIGHT, 'b', 8, \"bknight0\"))\n self.setPiece('c', 8, self.makePiece(ChessPiece.BLACK_BISHOP, 'c', 8, \"bbishop0\"))\n self.setPiece('d', 8, self.makePiece(ChessPiece.BLACK_QUEEN, 'd', 8, \"bqueen\"))\n self.setPiece('e', 8, self.makePiece(ChessPiece.BLACK_KING, 'e', 8, \"bking\"))\n self.setPiece('f', 8, self.makePiece(ChessPiece.BLACK_BISHOP, 'f', 8, \"bbishop1\"))\n self.setPiece('g', 8, self.makePiece(ChessPiece.BLACK_KNIGHT, 'g', 8, \"bknight1\"))\n self.setPiece('h', 8, self.makePiece(ChessPiece.BLACK_ROOK, 'h', 8, \"brook1\"))","def find_best_move(board):\n new_board = board.get_board()\n\n # X | X | X <-- Check for win on this row\n # ---------\n # 3 | 4 | 5\n # ---------\n # 6 | 7 | 9\n if new_board[0] == new_board[1] and new_board[2] == \"2\":\n return 2\n elif new_board[0] == new_board[2] and new_board[1] == \"1\":\n return 1\n elif new_board[1] == new_board[2] and new_board[0] == \"0\":\n return 0\n\n # 0 | 1 | 2\n # ---------\n # X | X | X <-- Check for win on this row\n # ---------\n # 6 | 7 | 9\n elif new_board[3] == new_board[4] and new_board[5] == \"5\":\n return 5\n elif new_board[3] == new_board[5] and new_board[4] == \"4\":\n return 4\n elif new_board[4] == new_board[5] and new_board[3] == \"3\":\n return 3\n\n # 0 | 1 | 2\n # ---------\n # 3 | 4 | 5\n # ---------\n # X | X | X <-- Check for win on this row\n elif new_board[6] == new_board[7] and new_board[8] == \"8\":\n return 8\n elif new_board[6] == new_board[8] and new_board[7] == \"7\":\n return 7\n elif new_board[7] == new_board[8] and new_board[6] == \"6\":\n return 6\n\n # X | 1 | 2 Check for win on column one\n # ---------\n # X | 4 | 5\n # ---------\n # X | 7 | 9\n elif new_board[0] == new_board[3] and new_board[6] == \"6\":\n return 6\n elif new_board[0] == new_board[6] and new_board[3] == \"3\":\n return 3\n elif new_board[6] == new_board[3] and new_board[0] == \"0\":\n return 0\n\n # 0 | X | 2 Checks for win on column two\n # ---------\n # 3 | X | 5\n # ---------\n # 6 | X | 9\n elif new_board[1] == new_board[4] and new_board[7] == \"7\":\n return 7\n elif new_board[1] == new_board[7] and new_board[4] == \"4\":\n return 4\n elif new_board[7] == new_board[4] and new_board[0] == \"0\":\n return 0\n\n # 0 | 1 | X\n # ---------\n # 3 | 4 | X\n # ---------\n # 6 | 7 | X\n elif new_board[2] == new_board[5] and new_board[8] == \"8\":\n return 8\n elif new_board[2] == new_board[8] and new_board[5] == \"5\":\n return 5\n elif new_board[8] == new_board[5] and new_board[2] == \"2\":\n return 2\n\n # X | 1 | 2\n # ---------\n # 3 | X | 5\n # ---------\n # 6 | 7 | X\n elif new_board[0] == new_board[4] and new_board[8] == \"8\":\n return 8\n elif new_board[0] == new_board[8] and new_board[4] == \"4\":\n return 4\n elif new_board[8] == new_board[4] and new_board[0] == \"0\":\n return 0\n\n # 0 | 1 | X\n # ---------\n # 3 | X | 5\n # ---------\n # X | 7 | 9\n elif new_board[2] == new_board[4] and new_board[6] == \"6\":\n return 6\n elif new_board[2] == new_board[6] and new_board[4] == \"4\":\n return 4\n elif new_board[6] == new_board[4] and new_board[2] == \"2\":\n return 2\n\n # If corners are empty, play there\n elif new_board[0] == \"0\" or new_board[2] == \"2\" or new_board[6] == \"6\" or new_board[8] == \"8\":\n try_spot = 0\n while True:\n if new_board[try_spot] != \"X\" and new_board[try_spot] != \"O\":\n return try_spot\n else:\n try_spot = try_spot + 2\n\n # If middle is empty, play there\n elif new_board[4] == \"4\":\n return 4\n\n # Finally if edges are empty try there\n elif new_board[1] == \"1\" or new_board[3] == \"3\" or new_board[5] == \"5\" or new_board[7] == \"7\":\n try_spot = 1\n while True:\n if new_board[try_spot] != \"X\" and new_board[try_spot] != \"O\":\n return try_spot\n else:\n try_spot = try_spot + 2","def next_state(s_curr, action, params):\n P_dist = params['P_dist']\n R = params['R']\n n_rows = params['n_rows']\n n_cols = params['n_cols']\n occ_grid = params['occ_grid']\n\n rnd = np.random.uniform()\n\n s_next = s_curr\n\n # Actions - ['left','right','up','down']\n\n if rnd <= P_dist:\n if action == 0:\n move = 2\n elif action == 1:\n move = 2\n elif action == 2:\n move = 1\n else:\n move = 0\n elif rnd < 2*P_dist:\n if action == 0:\n move = 3\n elif action == 1:\n move = 3\n elif action == 2:\n move = 1\n else:\n move = 1\n else:\n move = action\n\n # Move left\n if move == 0:\n row_next = s_curr[0]\n col_next = s_curr[1] - 1\n if col_next >= 0 and occ_grid[row_next, col_next] == 0:\n s_next = [row_next, col_next]\n\n # Move right\n if move == 1:\n row_next = s_curr[0]\n col_next = s_curr[1] + 1\n if col_next < n_cols and occ_grid[row_next, col_next] == 0:\n s_next = [row_next, col_next]\n\n # Move up\n if move == 2:\n row_next = s_curr[0] - 1\n col_next = s_curr[1]\n if row_next >= 0 and occ_grid[row_next, col_next] == 0:\n s_next = [row_next, col_next]\n\n # Move down\n if move == 3:\n row_next = s_curr[0] + 1\n col_next = s_curr[1]\n if row_next < n_rows and occ_grid[row_next, col_next] == 0:\n s_next = [row_next, col_next]\n\n r = R[s_next[0], s_next[1]]\n return s_next, r"],"string":"[\n \"def make_move(self, move: Any) -> 'StonehengeState':\\n if type(move) == str:\\n new_state = StonehengeState(not self.p1_turn, self.side_length)\\n # copy the board information from current state\\n # make copy of current state information\\n hori_lst_copy = []\\n for lst in self.hori_lst:\\n temp = []\\n for item in lst:\\n temp.append(item)\\n hori_lst_copy.append(temp)\\n left_lst_copy = []\\n for lst in self.left_lst:\\n temp = []\\n for item in lst:\\n temp.append(item)\\n left_lst_copy.append(temp)\\n right_lst_copy = []\\n for lst in self.right_lst:\\n temp = []\\n for item in lst:\\n temp.append(item)\\n right_lst_copy.append(temp)\\n\\n hori_result_copy = []\\n for item in self.hori_result:\\n hori_result_copy.append(item)\\n left_result_copy = []\\n for item in self.left_result:\\n left_result_copy.append(item)\\n right_result_copy = []\\n for item in self.right_result:\\n right_result_copy.append(item)\\n\\n new_state.hori_lst = hori_lst_copy\\n new_state.hori_result = hori_result_copy\\n new_state.left_lst = left_lst_copy\\n new_state.left_result = left_result_copy\\n new_state.right_lst = right_lst_copy\\n new_state.right_result = right_result_copy\\n # update the new state with str move\\n # parallel nested list data structure\\n lst = [new_state.hori_lst, new_state.left_lst, new_state.right_lst]\\n result = [new_state.hori_result, new_state.left_result, new_state.right_result]\\n # update the cell\\n for i in range(len(lst)):\\n for j in range(len(lst[i])):\\n for k in range(len(lst[i][j])):\\n if lst[i][j][k] == move:\\n # should use the player name of last state, so opposite names\\n if new_state.p1_turn:\\n lst[i][j][k] = \\\"2\\\"\\n else:\\n lst[i][j][k] = \\\"1\\\"\\n # update ley-line marks\\n # the ley-line may belong to a player after this move\\n p1_taken = 0\\n p2_taken = 0\\n if result[i][j] != \\\"@\\\":\\n continue\\n for item in lst[i][j]:\\n if item == \\\"1\\\":\\n p1_taken += 1\\n if item == \\\"2\\\":\\n p2_taken += 1\\n if float(p1_taken) >= len(lst[i][j]) / 2:\\n result[i][j] = \\\"1\\\"\\n if float(p2_taken) >= len(lst[i][j]) / 2:\\n result[i][j] = \\\"2\\\"\\n ###### CHECK FOR SHALLOW COPY PROBLEM, IF ATTRIBUTE IS UPDATE IN NEW STATE\\n return new_state\",\n \"def make_move(self, move: Any) -> \\\"StonehengeState\\\":\\n new_board = deepcopy(self.current_board)\\n for index in range(len(self.current_board)):\\n if self.current_board[index] == move:\\n if self.p1_turn:\\n new_board = new_board.replace(\\n self.current_board[index], '1')\\n else:\\n new_board = new_board.replace(\\n self.current_board[index], '2')\\n new_ley_lines = deepcopy(self.current_ley_lines)\\n for item in new_ley_lines:\\n for key in item:\\n for index in range(len(key[1])):\\n if key[1][index] == move:\\n if self.p1_turn:\\n key[1][index] = '1'\\n else:\\n key[1][index] = '2'\\n change_dict = {}\\n for item in new_ley_lines:\\n for key in item:\\n p1_count = 0\\n p2_count = 0\\n for string in key[1]:\\n if string == '1':\\n p1_count += 1\\n if string == '2':\\n p2_count += 1\\n\\n\\n if p1_count >= len(key[1])/2 and p1_count > p2_count:\\n\\n change_dict[key[0]] = '1'\\n if p2_count >= len(key[1])/2 and p2_count > p1_count:\\n\\n change_dict[key[0]] = '2'\\n for key in change_dict:\\n if not (key == '1' or key == '2'):\\n if str(key) in new_board:\\n new_board = new_board.replace(str(key), change_dict[key])\\n for item in new_ley_lines:\\n for key1 in item:\\n if key == key1[0]:\\n key1[0] = change_dict[key]\\n\\n new_state = StonehengeState(not self.p1_turn, self.side_length,\\n new_board, new_ley_lines)\\n return new_state\",\n \"def apply_move(self, move):\\r\\n next_board = copy.deepcopy(self.board)\\r\\n next_board.place(self.next_player, move)\\r\\n return GameState(next_board, self.next_player.other, move)\",\n \"def make_move(self, move: Any) -> \\\"StonehengeState\\\":\\n new_state = StonehengeState(self.p1_turn, self.length,\\n self.letters[:], self.claim[:])\\n state = new_state\\n if new_state.length == 1:\\n state = self.move_length_1(move, new_state)\\n if new_state.length == 2:\\n state = self.move_length_2(move, new_state)\\n if new_state.length == 3:\\n state = self.move_length_3(move, new_state)\\n if new_state.length == 4:\\n if move in [\\\"A\\\", \\\"B\\\", \\\"J\\\", \\\"O\\\", \\\"N\\\", \\\"R\\\",\\n \\\"C\\\", \\\"F\\\", \\\"E\\\", \\\"I\\\", \\\"P\\\", \\\"Q\\\"]:\\n state = self.move_length_4(move, new_state)\\n else:\\n state = self.move_length_41(move, new_state)\\n if new_state.length == 5:\\n if move in [\\\"A\\\", \\\"B\\\", \\\"U\\\", \\\"O\\\", \\\"T\\\", \\\"Y\\\",\\n \\\"C\\\", \\\"J\\\", \\\"E\\\", \\\"N\\\", \\\"V\\\", \\\"X\\\"]:\\n state = self.move_length_5(move, new_state)\\n elif move in [\\\"F\\\", \\\"I\\\", \\\"W\\\"]:\\n state = self.move_length_51(move, new_state)\\n else:\\n state = self.move_length_52(move, new_state)\\n return state\",\n \"def makeMove(self, board, move):\\n\\t\\trotation, this_board = self.__getNormalizedAndRotatedBoard(board)\\n\\t\\tthis_state = TicTacToeHelper.serializeBoard(this_board)\\n\\n\\t\\tthis_move = TicTacToeHelper.rotateMove(move, rotation)\\n\\n\\t\\tself.__state_history.append((this_state, this_move))\",\n \"def make_move(self, move, player, board):\\r\\n #nBoard = board.copy()\\r\\n board[move] = player\\r\\n for d in core.DIRECTIONS:\\r\\n if self.find_bracket(move, player, board, d)!=None:\\r\\n self.make_flips(move, player, board, d)\\r\\n return board\",\n \"def make_move(self, state):\\r\\n # intially set drop phase to true\\r\\n drop_phase = True\\r\\n move = [] # list to make moves with to return\\r\\n succ = self.succ(state) # get the successor of this state\\r\\n # intial postion of board to set up most advantagous spot if its empty\\r\\n if sum(x.count(self.my_piece) for x in self.board) == 0 and self.board[2][2] == ' ':\\r\\n move.insert(0, (2, 2))\\r\\n return move\\r\\n \\r\\n # check the number of 'r' and 'b' on board if theres 4 of each drop phase is false\\r\\n if sum(x.count('r') for x in self.board) == 4 and sum(x.count('b') for x in self.board) == 4:\\r\\n drop_phase = False\\r\\n\\r\\n # if not during drop phase use minimax to make next move from one postion to next\\r\\n if not drop_phase:\\r\\n move = []\\r\\n d = self.Max_value(state, 0)\\r\\n val = d['val']\\r\\n m = d['move']\\r\\n p = d['pos']\\r\\n f = d['from']\\r\\n s = sorted(succ, key=lambda e: e['f'])\\r\\n moveto = s[-1]\\r\\n move.insert(1, (moveto['from'][0], moveto['from'][1]))\\r\\n move.insert(0, (moveto['pos'][0], moveto['pos'][1]))\\r\\n return move # return the from, to move\\r\\n\\r\\n else: #else use minimax and to make move during drop phase selecting spot to place AI piece\\r\\n d = self.Max_value(state, 0)\\r\\n val = d['val']\\r\\n m = d['move']\\r\\n p = d['pos']\\r\\n hold = []\\r\\n move = []\\r\\n n = None\\r\\n hold = []\\r\\n for s in succ:\\r\\n p = s['pos'][0]\\r\\n p1 = s['pos'][1]\\r\\n if s['f'] == val and state[p][p1] == ' ':\\r\\n hold.append(s)\\r\\n if len(hold) == 1:\\r\\n row = hold[0]['pos'][0]\\r\\n col = hold[0]['pos'][1]\\r\\n else:\\r\\n f = sorted(hold, key=lambda e: e['pos'])\\r\\n row = f[0]['pos'][0]\\r\\n col = f[0]['pos'][1]\\r\\n\\r\\n move.insert(0, (row, col)) # return the move \\r\\n return move\",\n \"def make_move(self, move):\\n if int(move) < 0 or int(move) > 48 or self.board[int(move) // 7][int(move) % 7] != \\\"\\\" or int(move) % 2 == 0:\\n raise ValueError(\\\"{} is not a valid move for {}\\\".format(move, self.board))\\n DotsAndBoxesState.score1 += self.check_score(move)\\n self.board[int(move) // 7][int(move) % 7] = colors[self.turn] + self.turn + \\\"\\\\u001b[0m\\\"\\n self.turn = get_opponent(self.turn) #change into another player's trun\",\n \"def make_move(self, move: int) -> None:\\n if move not in self._valid_moves:\\n raise ValueError(f'Move \\\"{move}\\\" is not valid')\\n\\n self._update_board(move)\\n\\n self._win_state = self._check_winner()\\n self._is_red_active = not self._is_red_active\\n self.move_number += 1\",\n \"def make_move(self, state):\\n emptySpaces = 0\\n for row in state:\\n emptySpaces = emptySpaces + row.count(' ')\\n if emptySpaces > 17:\\n drop_phase = True\\n else:\\n drop_phase = False\\n\\n move = []\\n if not drop_phase:\\n best_value = float('-inf')\\n best_state = None\\n for s in self.succ(state, False, self.my_piece):\\n if self.game_value(s) == -1 or self.game_value(s) == 1:\\n best_state = s\\n break\\n currValue = self.Min_Value(state, 0)\\n if currValue>best_value:\\n best_value = currValue\\n best_state = s\\n for i in range(len(state)):\\n for j in range(len(state[i])):\\n if state[i][j]!= ' ' and best_state[i][j]== ' ':\\n move.append((i,j))\\n if state[i][j]== ' ' and best_state[i][j]!= ' ':\\n move.insert(0, (i,j))\\n \\n # TODO: choose a piece to move and remove it from the board\\n # (You may move this condition anywhere, just be sure to handle it)\\n #\\n # Until this part is implemented and the move list is updated\\n # accordingly, the AI will not follow the rules after the drop phase!\\n \\n\\n # select an unoccupied space randomly\\n # TODO: implement a minimax algorithm to play better\\n \\n else:\\n best_value = float('-inf')\\n best_state = None\\n for s in self.succ(state, True, self.my_piece):\\n if self.game_value(s) == -1 or self.game_value(s) == 1:\\n best_state = s\\n break\\n currValue = self.Min_Value(state, 0)\\n if currValue>best_value:\\n best_value = currValue\\n best_state = s\\n for i in range(len(state)):\\n for j in range(len(state[i])):\\n if state[i][j]== ' ' and best_state[i][j]!= ' ':\\n move.insert(0, (i,j))\\n \\n return move\",\n \"def make_move(board, move, ch):\\n board[move['row']][move['col']] = ch\\n \\n winner = board_winner(board)\\n \\n if winner is not None:\\n return True, winner\\n \\n if not board_has_move(board):\\n return True, None\\n \\n return False, None\",\n \"def move(state=None, actual_move=None):\\n copy = state.copy()\\n copy.push(chess.Move.from_uci(uci=actual_move))\\n return copy\",\n \"def make_move(self, move):\\n self.board[int(move) - 1] = self.nplayer\",\n \"def make_move(self, move, player):\\n if not self.test_valid_move( move):\\n return False\\n self.game_state[move[0]][move[1]] = player\",\n \"def apply_move(self, start_move, move):\\n\\t\\t# check that the start move and the move are Move objects\\n\\t\\tif not isinstance(move, Move):\\n\\t\\t\\tmove = Move(move)\\n\\t\\tif not isinstance(start_move, Move):\\n\\t\\t\\tstart_move = Move(start_move)\\n\\t\\t# copy the board\\n\\t\\tnext_board = copy.deepcopy(self.board)\\n\\t\\t# place the move on the next board\\n\\t\\tnext_board.place(self.next_player, start_move.point, move.point)\\n\\t\\treturn GameState(next_board, self.next_player.other, move)\",\n \"def make_move(move, player, board):\\n board[move] = player\\n for d in DIRECTIONS:\\n Othello.make_flips(move, player, board, d)\\n return board\",\n \"def make_move(self, current_state):\\n\\n\\t\\tbatch_size = 192\\n\\n\\t\\ttest_board = np.zeros((batch_size, 3, 3, 3))\\n\\t\\ttest_cows = np.zeros((batch_size, 2))\\n\\t\\ttest_labels = np.zeros((batch_size, 1)) \\n\\n\\t\\tnew_states = current_state.expand_states()\\n\\n\\t\\tif len(new_states) == 0:\\n\\t\\t\\treturn None\\n\\n\\t\\tfor i, state in enumerate(new_states):\\n\\n\\t\\t\\tdesc = self.state_descriptor(state, self.player_index)\\n\\t\\t\\ttest_board[i] = np.asarray(desc[0])\\n\\t\\t\\ttest_cows[i] = np.asarray([desc[1], desc[2]])\\n\\n\\t\\treturn new_states[self.train_value_function_approximation(\\n\\t\\t\\tTrue, (test_board, test_cows, test_labels), len(new_states))]\",\n \"def forecast_move(self, move):\\n if move not in get_legal_moves(self):\\n raise RuntimeError(\\\"Attempted forecast of illegal move\\\")\\n newGameState = deepcopy(self)\\n newGameState[move[0]][move[1]] = 1\\n newGameState.player_locations[whose_turn] = move\\n newGameState.whose_turn ^= 1\\n return newGameState\",\n \"def add_move(self, move):\\n \\n self.current_board[move.position[0]][move.position[1]] = move.player.char\",\n \"def makeMove(self, move):\\n\\t\\ttry:\\n\\t\\t\\tif (self.board[int(move) - 1] is Piece.BLANK):\\n\\t\\t\\t\\tself.board[int(move) - 1] = self.current\\n\\t\\t\\t\\treturn 1\\n\\t\\t\\telse:\\n\\t\\t\\t\\treturn 0\\n\\t\\texcept:\\n\\t\\t\\treturn 0\",\n \"def result(self, board_state, move):\\n # Create a copy of the current board state\\n output_state = BoardState(other_state=board_state)\\n # Swap pieces\\n output_state.move_piece(move)\\n # Eliminate pieces\\n output_state.eliminate_piece()\\n return output_state\",\n \"def make_move(self, move):\\n if type(move) == str:\\n move = int(move)\\n\\n new_state = SubtractSquareState(not self.p1_turn,\\n self.current_total - move)\\n return new_state\",\n \"def make_move(self, board):\\n user_input = self.get_user_input(\\n 'coordinates of next move (x,y): '\\n )\\n move = self.transform_user_input(user_input)\\n\\n valid = board.move_is_valid(move)\\n while not valid:\\n user_input = self.get_user_input(\\n 'Invalid move, coordinate of next move: '\\n )\\n move = self.transform_user_input(user_input)\\n valid = board.move_is_valid(move)\\n board.set_piece(move, color=self.color)\",\n \"def make_move(self, move):\\n # Unpack the information from the move\\n piece = self.get_piece(move[0])\\n row = move[1][0]\\n col = move[1][1]\\n eliminated_pieces = move[2]\\n\\n # Move the piece and eliminate the captured pieces\\n self.board[piece.row][piece.col] = None\\n self.board[row][col] = piece\\n piece.row = row\\n piece.col = col\\n self.remove(eliminated_pieces)\\n\\n # Checks if the piece has been promoted\\n if piece.get_player() == Player.black and \\\\\\n piece.row == constant.BOARD_DIMENSION - 1 \\\\\\n and not piece.is_king():\\n piece.make_king()\\n self.num_black_kings += 1\\n\\n elif piece.get_player() == Player.white and \\\\\\n piece.row == 0 \\\\\\n and not piece.is_king():\\n piece.make_king()\\n self.num_white_kings += 1\\n\\n # Add the move performed to the history of the game\\n self.moves.append(move)\",\n \"def _makeAMove(self, prev_move, board: str) -> int:\\n\\n (myWins, otherWins, _, _) = self.winsBlocksForks(board)\\n move = choice([self.findEmptyCell(board, myWin) for myWin in myWins] if myWins else\\n [self.findEmptyCell(board, otherWin) for otherWin in otherWins] if otherWins else\\n list(self.otherMove(board, emptyCellsCount(board)))\\n )\\n return move\",\n \"def make_move(self):\\n self.owner = self.game.current_turn\\n self.status = 'X' if self.owner == self.game.creator else 'O'\\n ####\\n #Random turn??\\n ####\\n self.save(update_fields=['status', 'owner'])\\n\\n # Add log entry for move\\n self.game.add_log(f'cell made at ({self.row}, {self.col}) by {self.owner}')\\n\\n # Set the current turn for the other player if game is not over\\n # Check if find winner\\n if self.game.check_win(cell=self) or\\\\\\n self.game.get_all_game_cells().filter(status='EMPTY').count() == 0:\\n print(\\\"Winnnnnnnn\\\")\\n self.game.mark_complete(winner=self.owner)\\n\\n # Switch player turn\\n self.game.switch_turn()\\n\\n # Let the game know about the move and result\\n self.send_game_update()\",\n \"def __make_move(self, user):\\n if user:\\n pos = int(input('Make your move (1-9): '))\\n print('\\\\033[2A\\\\r ')\\n while self.state[pos-1] != ' ':\\n pos = int(input('\\\\rSeat\\\\'s taken. Make your move (1-9): '))\\n print('\\\\033[2A\\\\r ')\\n self.state[pos-1] = self.player_char\\n else:\\n time.sleep(.5)\\n pos = random.randint(1, 9)\\n if self.difficulty == 1:\\n best = self.__find_best()\\n pos = best+1 if best else pos\\n while self.state[pos-1] != ' ':\\n pos = random.randint(1, 9)\\n self.state[pos-1] = self.opponent_char\\n self.history.append(self.state[:])\",\n \"def move(self, board):\\n\\n # We record all game positions to feed them into the NN for training with the corresponding updated Q\\n # values.\\n self.board_position_log.append(board.getState().copy())\\n\\n nn_input = self.board_state_to_nn_input(board.getState())\\n probs, _ = self.get_valid_probs([nn_input], self.q_net, [board])\\n probs = probs[0]\\n # print(probs)\\n # print(type(probs))\\n # print(probs.shape)\\n # input()\\n # print(probs)\\n # Most of the time our next move is the one with the highest probability after removing all illegal ones.\\n # Occasionally, however we randomly chose a random move to encourage exploration\\n if (self.training is True) and \\\\\\n ((self.game_counter < self.pre_training_games) or (np.random.rand(1) < self.random_move_prob)):\\n available = []\\n for index in range(6):\\n if probs[index] != -1.0:\\n available.append(index)\\n randomOne = random.randint(0,len(available)-1)\\n move = available[randomOne]\\n else:\\n move = np.argmax(probs)\\n # We record the action we selected as well as the Q values of the current state for later use when\\n # adjusting NN weights.\\n self.action_log.append(move)\\n\\n # We execute the move and return the result\\n board.makeMove(move)\\n return board.getState(), board.isOver()\",\n \"def apply_move(board_state, move, side):\\n move_x, move_y = move\\n\\n def get_tuples():\\n for x in range(len(board_state)):\\n if move_x == x:\\n temp = list(board_state[x])\\n temp[move_y] = side\\n yield tuple(temp)\\n else:\\n yield board_state[x]\\n\\n return tuple(get_tuples())\",\n \"def _update_board(self, move: int) -> None:\\n row = self._column_to_row[move] # Find what row to place the disk in\\n if self._is_red_active:\\n self.board_array[row][move] = 1\\n self.hash = self.hash ^ int(self._red_hash_keys[row][move]) # Update hash\\n else:\\n self.board_array[row][move] = -1\\n self.hash = self.hash ^ int(self._yellow_hash_keys[row][move]) # # Update hash\\n\\n self._column_to_row[move] += 1\\n if self._column_to_row[move] == 6:\\n self._valid_moves.remove(move)\",\n \"def action(new_board, move, player):\\r\\n \\r\\n global nodes_generated \\r\\n global min_prune\\r\\n global max_prune\\r\\n global max_depth\\r\\n \\r\\n if player == 1:\\r\\n for i in range(0,len(new_board.white)):\\r\\n if new_board.white[i] == move[0]:\\r\\n new_board.white[i] = move[1]\\r\\n if len(move) == 3:\\r\\n new_board.black.remove(move[2])\\r\\n elif player == -1:\\r\\n for i in range(0,len(new_board.black)):\\r\\n if new_board.black[i] == move[0]:\\r\\n new_board.black[i] = move[1]\\r\\n if len(move) == 3:\\r\\n new_board.white.remove(move[2])\\r\\n return new_board\",\n \"def make_move(self):\\n\\n # get relavent information\\n affinity = self.get_affinity()\\n sample_space = self.get_game_space()\\n depth_limit = self.__search_depth\\n\\n # run a minimax search and get the best value\\n bestval = MinimaxTree.minimax(self, sample_space, affinity, depth_limit, True)\\n if bestval[0] is None: bestval = ((0,6),'x', 0)\\n\\n # print the number of nodes expanded \\n print(self.nodes_expanded)\\n\\n # make the move found by the search \\n self.get_game_space().set_tile(bestval[0][0], bestval[0][1], affinity)\",\n \"def moves(self, board_state):\\n # pos_moves = generate_moves(board_state) # Naive moves function here\\n blacks = board_state.search_board('B')\\n # Generate the possible moves required to kill the first black piece\\n # on the board\\n pos_moves = sorted_generate_moves_piece(board_state, blacks[0])\\n return pos_moves\",\n \"def make_move(state: str, section_num: int, move: str) -> str:\\n if move == wf.CHECK:\\n check_result = wf.check_section(state, section_num)\\n if check_result:\\n print('The section is correct')\\n else:\\n print('The section is incorrect')\\n else:\\n state = wf.change_state(state, section_num, move) \\n return state\",\n \"def move(self, state, move_cmd, i, j):\\r\\n new_state = self.clone_state(state)\\r\\n coordinate_change = self.action_dic[self.reflection_dic[move_cmd]]\\r\\n new_state[i][j], new_state[i + coordinate_change[0]][j + coordinate_change[1]] = \\\\\\r\\n new_state[i + coordinate_change[0]][j + coordinate_change[1]]\\\\\\r\\n , new_state[i][j]\\r\\n return new_state\",\n \"def make_move(self,board, action, player_id):\\n row = np.max(np.where(board[:, action] == EMPTY_VAL))\\n new_board = np.copy(board)\\n new_board[row, action] = player_id\\n\\n return new_board\",\n \"def api_make_move(self, move_input):\\n return self.board.attempt_move(move_input)\",\n \"def apply_move(self, move, state):\\n x, y , heading, grid_data = state\\n map_data = [row[:] for row in grid_data]\\n if move == self.MOVE_FORWARD:\\n # get coordinates for next cell\\n if heading == self.UP:\\n next_y = y - 1\\n next_x = x\\n elif heading == self.DOWN:\\n next_y = y + 1\\n next_x = x\\n elif heading == self.LEFT:\\n next_y = y\\n next_x = x - 1\\n else:\\n next_y = y\\n next_x = x + 1\\n\\n # handle special tile types\\n if map_data[next_y][next_x] == self.ICE_SYMBOL:\\n # handle ice tile - slide until first non-ice tile or blocked\\n if heading == self.UP:\\n for i in range(next_y, -1, -1):\\n if map_data[i][next_x] != self.ICE_SYMBOL:\\n if map_data[i][next_x] == self.WATER_SYMBOL:\\n # slide into water - game over\\n return self.GAME_OVER\\n elif self.cell_is_blocked(i, next_x, map_data):\\n # if blocked, stop on last ice cell\\n next_y = i + 1\\n break\\n else:\\n next_y = i\\n break\\n elif heading == self.DOWN:\\n for i in range(next_y, self.y_size):\\n if map_data[i][next_x] != self.ICE_SYMBOL:\\n if map_data[i][next_x] == self.WATER_SYMBOL:\\n # slide into water - game over\\n return self.GAME_OVER\\n elif self.cell_is_blocked(i, next_x, map_data):\\n # if blocked, stop on last ice cell\\n next_y = i - 1\\n break\\n else:\\n next_y = i\\n break\\n elif heading == self.LEFT:\\n for i in range(next_x, -1, -1):\\n if map_data[next_y][i] != self.ICE_SYMBOL:\\n if map_data[next_y][i] == self.WATER_SYMBOL:\\n # slide into water - game over\\n return self.GAME_OVER\\n elif self.cell_is_blocked(next_y, i, map_data):\\n # if blocked, stop on last ice cell\\n next_x = i + 1\\n break\\n else:\\n next_x = i\\n break\\n else:\\n for i in range(next_x, self.x_size):\\n if map_data[next_y][i] != self.ICE_SYMBOL:\\n if map_data[next_y][i] == self.WATER_SYMBOL:\\n # slide into water - game over\\n return self.GAME_OVER\\n elif self.cell_is_blocked(next_y, i, map_data):\\n # if blocked, stop on last ice cell\\n next_x = i - 1\\n break\\n else:\\n next_x = i\\n break\\n if map_data[next_y][next_x] == self.TELEPORT_SYMBOL:\\n # handle teleport - find the other teleporter\\n tpy, tpx = (None, None)\\n for i in range(self.y_size):\\n for j in range(self.x_size):\\n if map_data[i][j] == self.TELEPORT_SYMBOL and (i != next_y or j != next_x):\\n tpy, tpx = (i, j)\\n break\\n if tpy is not None:\\n break\\n if tpy is None:\\n raise Exception(\\\"LaserTank Map Error: Unmatched teleport symbol\\\")\\n next_y, next_x = (tpy, tpx)\\n else:\\n # if not ice or teleport, perform collision check\\n if self.cell_is_blocked(next_y, next_x, map_data):\\n return self.COLLISION\\n\\n # check for game over conditions\\n if self.cell_is_game_over(next_y, next_x, map_data):\\n return self.GAME_OVER\\n\\n # no collision and no game over - update player position\\n y = next_y\\n x = next_x\\n return (x, y, heading, map_data)\\n\\n elif move == self.TURN_LEFT:\\n # no collision or game over possible\\n if heading == self.UP:\\n heading = self.LEFT\\n elif heading == self.DOWN:\\n heading = self.RIGHT\\n elif heading == self.LEFT:\\n heading = self.DOWN\\n else:\\n heading = self.UP\\n return (x, y, heading, map_data)\\n\\n elif move == self.TURN_RIGHT:\\n # no collision or game over possible\\n if heading == self.UP:\\n heading = self.RIGHT\\n elif heading == self.DOWN:\\n heading = self.LEFT\\n elif heading == self.LEFT:\\n heading = self.UP\\n else:\\n heading = self.DOWN\\n return (x, y, heading, map_data)\\n\\n elif move == self.SHOOT_LASER:\\n # set laser direction\\n if heading == self.UP:\\n laserheading = self.UP\\n dy, dx = (-1, 0)\\n elif heading == self.DOWN:\\n laserheading = self.DOWN\\n dy, dx = (1, 0)\\n elif heading == self.LEFT:\\n laserheading = self.LEFT\\n dy, dx = (0, -1)\\n else:\\n laserheading = self.RIGHT\\n dy, dx = (0, 1)\\n\\n # loop until laser blocking object reached\\n ly, lx = (y, x)\\n while True:\\n ly += dy\\n lx += dx\\n\\n # handle boundary and immovable obstacles\\n if ly < 0 or ly >= self.y_size or \\\\\\n lx < 0 or lx >= self.x_size or \\\\\\n map_data[ly][lx] == self.OBSTACLE_SYMBOL:\\n # laser stopped without effect\\n return self.COLLISION\\n\\n # handle movable objects\\n elif self.cell_is_laser_movable(ly, lx, laserheading, map_data):\\n # check if tile can be moved without collision\\n if self.cell_is_blocked(ly + dy, lx + dx, map_data) or \\\\\\n map_data[ly + dy][lx + dx] == self.ICE_SYMBOL or \\\\\\n map_data[ly + dy][lx + dx] == self.TELEPORT_SYMBOL or \\\\\\n map_data[ly + dy][lx + dx] == self.FLAG_SYMBOL or \\\\\\n (ly + dy == y and lx + dx == x):\\n # tile cannot be moved\\n return self.COLLISION\\n else:\\n old_symbol = map_data[ly][lx]\\n map_data[ly][lx] = self.LAND_SYMBOL\\n if map_data[ly + dy][lx + dx] == self.WATER_SYMBOL:\\n # if new bridge position is water, convert to land tile\\n if old_symbol == self.BRIDGE_SYMBOL:\\n map_data[ly + dy][lx + dx] = self.LAND_SYMBOL\\n # otherwise, do not replace the old symbol\\n else:\\n # otherwise, move the tile forward\\n map_data[ly + dy][lx + dx] = old_symbol\\n break\\n\\n # handle bricks\\n elif map_data[ly][lx] == self.BRICK_SYMBOL:\\n # remove brick, replace with land\\n map_data[ly][lx] = self.LAND_SYMBOL\\n break\\n\\n # handle facing anti-tanks\\n elif (map_data[ly][lx] == self.ANTI_TANK_UP_SYMBOL and laserheading == self.DOWN) or \\\\\\n (map_data[ly][lx] == self.ANTI_TANK_DOWN_SYMBOL and laserheading == self.UP) or \\\\\\n (map_data[ly][lx] == self.ANTI_TANK_LEFT_SYMBOL and laserheading == self.RIGHT) or \\\\\\n (map_data[ly][lx] == self.ANTI_TANK_RIGHT_SYMBOL and laserheading == self.LEFT):\\n # mark anti-tank as destroyed\\n map_data[ly][lx] = self.ANTI_TANK_DESTROYED_SYMBOL\\n break\\n\\n # handle player laser collision\\n elif ly == y and lx == x:\\n return self.GAME_OVER\\n\\n # handle facing mirrors\\n elif (map_data[ly][lx] == self.MIRROR_UL_SYMBOL and laserheading == self.RIGHT) or \\\\\\n (map_data[ly][lx] == self.MIRROR_UR_SYMBOL and laserheading == self.LEFT):\\n # new direction is up\\n dy, dx = (-1, 0)\\n laserheading = self.UP\\n elif (map_data[ly][lx] == self.MIRROR_DL_SYMBOL and laserheading == self.RIGHT) or \\\\\\n (self.grid_data[ly][lx] == self.MIRROR_DR_SYMBOL and laserheading == self.LEFT):\\n # new direction is down\\n dy, dx = (1, 0)\\n laserheading = self.DOWN\\n elif (map_data[ly][lx] == self.MIRROR_UL_SYMBOL and laserheading == self.DOWN) or \\\\\\n (map_data[ly][lx] == self.MIRROR_DL_SYMBOL and laserheading == self.UP):\\n # new direction is left\\n dy, dx = (0, -1)\\n laserheading = self.LEFT\\n elif (map_data[ly][lx] == self.MIRROR_UR_SYMBOL and laserheading == self.DOWN) or \\\\\\n (map_data[ly][lx] == self.MIRROR_DR_SYMBOL and laserheading == self.UP):\\n # new direction is right\\n dy, dx = (0, 1)\\n laserheading = self.RIGHT\\n # do not terminate laser on facing mirror - keep looping\\n\\n # check for game over condition after effect of laser\\n if self.cell_is_game_over(y, x, map_data):\\n return self.GAME_OVER\\n return (x, y, heading, map_data)\\n return self.SUCCESS\",\n \"def make_move(self, board: Board) -> int:\\n raise NotImplementedError\",\n \"def make_move(self, board: Block) -> int:\\n raise NotImplementedError\",\n \"def board_from_move(self, move, color):\\n new_board = KhetBoard(self.color_pieces[TeamColor.silver] + self.color_pieces[TeamColor.red])\\n new_board.apply_move(move)\\n new_board.apply_laser(color)\\n return new_board\",\n \"def move(self, action: Action) -> State:\\n new_state = State(self.size_h, self.size_v, self.wall_squares, self.boxes, self.storage_locations,\\n self.current_location, action)\\n\\n if action == Action.DOWN:\\n down_loc = (new_state.current_location[0] + 1, new_state.current_location[1])\\n two_away = (down_loc[0] + 1, down_loc[1])\\n new_state.current_location = down_loc\\n if down_loc in new_state.boxes:\\n new_state.boxes.remove(down_loc)\\n new_state.boxes.append(two_away)\\n\\n elif action == Action.UP:\\n up_loc = (new_state.current_location[0] - 1, new_state.current_location[1])\\n two_away = (up_loc[0] - 1, up_loc[1])\\n new_state.current_location = up_loc\\n if up_loc in new_state.boxes:\\n new_state.boxes.remove(up_loc)\\n new_state.boxes.append(two_away)\\n\\n elif action == Action.RIGHT:\\n right_loc = (new_state.current_location[0], new_state.current_location[1] + 1)\\n two_away = (right_loc[0], right_loc[1] + 1)\\n new_state.current_location = right_loc\\n if right_loc in new_state.boxes:\\n new_state.boxes.remove(right_loc)\\n new_state.boxes.append(two_away)\\n\\n elif action == Action.LEFT:\\n left_loc = (new_state.current_location[0], new_state.current_location[1] - 1)\\n two_away = (left_loc[0], left_loc[1] - 1)\\n new_state.current_location = left_loc\\n if left_loc in new_state.boxes:\\n new_state.boxes.remove(left_loc)\\n new_state.boxes.append(two_away)\\n\\n new_state._validate() # TODO: Remove me for the final product.\\n return new_state\",\n \"def make_move(state, action, player, rewarding_move=False): # TODO : done and next_is_reward can be removed as\\n # they are in the state object\\n board = state.get_board()\\n json_action = action.get_json_action()\\n action = action.get_action_as_dict()\\n captured = None\\n reward = 0\\n next_is_reward = False\\n previous_is_reward = False\\n if rewarding_move:\\n state.boring_moves = 0\\n previous_is_reward = True\\n if action['action_type'] == YoteActionType.STEAL_FROM_HAND:\\n reward += 1\\n state.in_hand[player * -1] -= 1\\n elif action['action_type'] == YoteActionType.STEAL_FROM_BOARD:\\n board.empty_cell(action['action']['at'])\\n reward += 1\\n else:\\n if action['action_type'] == YoteActionType.ADD:\\n state.boring_moves += 1\\n state.in_hand[player] -= 1\\n board.fill_cell(action['action']['to'], Color(player))\\n elif action['action_type'] == YoteActionType.MOVE:\\n at = action['action']['at']\\n to = action['action']['to']\\n\\n def distance(cell_1, cell_2):\\n import math\\n return math.sqrt((cell_1[0] - cell_2[0]) ** 2 + (cell_1[1] - cell_2[1]) ** 2)\\n\\n board.empty_cell(at)\\n board.fill_cell(to, Color(player))\\n if int(distance(at, to)) == 1:\\n state.boring_moves += 1\\n elif int(distance(at, to)) > 1:\\n state.boring_moves = 0\\n next_is_reward = True\\n board.fill_cell(to, Color(player))\\n if at[0] == to[0] and at[1] < to[1]:\\n board.empty_cell((at[0], at[1] + 1))\\n captured = (at[0], at[1] + 1)\\n elif at[0] == to[0] and at[1] > to[1]:\\n board.empty_cell((at[0], at[1] - 1))\\n captured = (at[0], at[1] - 1)\\n elif at[1] == to[1] and at[0] < to[0]:\\n board.empty_cell((at[0] + 1, at[1]))\\n captured = (at[0] + 1, at[1])\\n elif at[1] == to[1] and at[0] > to[0]:\\n board.empty_cell((at[0] - 1, at[1]))\\n captured = (at[0] - 1, at[1])\\n reward += 1\\n\\n state.set_board(board)\\n state.score[player] += reward\\n state.captured = captured\\n state.rewarding_move = next_is_reward\\n state.previous_is_reward = previous_is_reward\\n state.set_latest_player(player)\\n state.set_latest_move(json_action)\\n if next_is_reward:\\n state.set_next_player(player)\\n else:\\n state.set_next_player(player * -1)\\n\\n done = YoteRules.is_end_game(state)\\n return state, done, next_is_reward\",\n \"def make_move(self):\\n\\n # get relavent information\\n affinity = self.get_affinity()\\n sample_space = self.get_game_space()\\n depth_limit = self.__search_depth\\n\\n # run a minimax search and get the best value\\n bestval = MinimaxTree.alphabeta(self, sample_space, affinity, depth_limit, -10000, 10001, True)\\n if bestval[0] is None: bestval = ((0,6),'x', 0)\\n\\n # print the number of nodes expanded \\n print(self.nodes_expanded)\\n\\n # make the move found by the search \\n self.get_game_space().set_tile(bestval[0][0], bestval[0][1], affinity)\",\n \"def request_move(self, board):\\n pass\",\n \"def make_move(self, move: Tuple[int, int]) -> MoveError:\\n\\n # Make sure our move is going to be valid\\n if self.is_winner():\\n return MoveError.GAME_WON\\n\\n elif move[0] >= self._board_size or move[0] < 0 or move[1] >= self._board_size or move[1] < 0:\\n return MoveError.OUT_OF_RANGE\\n\\n elif self._board[move[1]][move[0]] != self.NEUTRAL_PLAYER:\\n return MoveError.TAKEN\\n\\n # If we make it to here, then it is valid to make the move\\n self._board[move[1]][move[0]] = self._players[self._current_player]\\n self._number_of_moves = self._number_of_moves + 1\\n self._last_move = move\\n\\n self._check_for_winner()\\n\\n # Only change who the player is if we didn't get a winner,\\n # otherwise the final board's color will be wrong\\n if not self.is_winner():\\n self._current_player = (self._current_player + 1) % len(self._players)\\n\\n return MoveError.OKAY\",\n \"def move_to(self, board, new_pos, next_turn):\\n board.get_covered_squares(next_turn)\\n self.get_legal_moves(board)\\n legal_pos = {(self.field_row + move[0], self.field_col + move[1])\\n for move in self.legal_moves | self.legal_capture_moves}\\n if (FIELD_ROW_DICT[new_pos[1]], FIELD_COL_DICT[new_pos[0]]) in legal_pos:\\n for piece in board.figures:\\n if (piece.field_row == FIELD_ROW_DICT[new_pos[1]]\\n and piece.field_col == FIELD_COL_DICT[new_pos[0]]):\\n piece.get_captured(board)\\n old_pos_row = copy.deepcopy(self.field_row)\\n old_pos_col = copy.deepcopy(self.field_col)\\n self.field_row = FIELD_ROW_DICT[new_pos[1]]\\n self.field_col = FIELD_COL_DICT[new_pos[0]]\\n board.create_board()\\n board.king_in_check(self.color)\\n if board.in_check == self.color:\\n self.field_row = old_pos_row\\n self.field_col = old_pos_col\\n board.create_board()\\n return False, \\\"illegal move: king in check\\\"\\n else:\\n return True, \\\"legal move carried out\\\"\\n else:\\n return False, f\\\"illegal move: {self.short_name} cannot move to {new_pos}\\\"\",\n \"def make_move(self, move_to_play, color_to_move, return_capture=False):\\r\\n captures = 0\\r\\n if move_to_play == 'PASS':\\r\\n board_copy = Board(self.state, self.previous_state, self.to_move)\\r\\n if self.to_move == 1:\\r\\n board_copy.to_move = 2\\r\\n else:\\r\\n board_copy.to_move = 1\\r\\n if return_capture:\\r\\n return board_copy, captures\\r\\n else:\\r\\n return board_copy\\r\\n\\r\\n current_state = np.array(self.state)\\r\\n ptemp_state = np.array(current_state)\\r\\n\\r\\n for p in ORTHOGONAL_POSITIONS[move_to_play]:\\r\\n if self.board[p[0]][p[1]].chain_liberty == 1 and self.board[p[0]][p[1]].color != color_to_move:\\r\\n captures += len(self.chains[(self.board[p[0]][p[1]].chain_num, self.board[p[0]][p[1]].color)])\\r\\n current_state = self.remove_chain(self.board[p[0]][p[1]].chain_num, self.board[p[0]][p[1]].color,\\r\\n current_state)\\r\\n\\r\\n elif self.board[p[0]][p[1]].liberty == 1 and self.board[p[0]][p[1]].color != color_to_move:\\r\\n captures += 1\\r\\n current_state[p[0]][p[1]] = 0\\r\\n\\r\\n current_state[move_to_play[0]][move_to_play[1]] = color_to_move\\r\\n if color_to_move == 1:\\r\\n temp_board = Board(current_state, ptemp_state, 2)\\r\\n else:\\r\\n temp_board = Board(current_state, ptemp_state, 1)\\r\\n if return_capture:\\r\\n return temp_board, captures\\r\\n else:\\r\\n return temp_board\",\n \"def applyMove(self, (from_row,from_col), (to_row,to_col)):\\n newboard = deepcopy(self)\\n piece = newboard.board[from_row][from_col]\\n newboard.board[from_row][from_col] = None\\n newboard.board[to_row][to_col] = piece\\n newboard.toplay = 'BLACK' if self.toplay == 'WHITE' else 'WHITE'\\n return newboard\",\n \"def execute_move(self, move, color):\\n\\n #Much like move generation, start at the new piece's square and\\n #follow it on all 8 directions to look for a piece allowing flipping.\\n\\n # Add the piece to the empty square.\\n # print(move)\\n flips = [flip for direction in self.__directions\\n for flip in self._get_flips(move, direction, color)]\\n assert len(list(flips))>0\\n for x, y in flips:\\n #print(self[x][y],color)\\n self[x][y] = color\",\n \"def make_move(self, move, check_valid=True):\\r\\n self.board[move.sr][move.sc] = \\\"--\\\"\\r\\n self.board[move.er][move.ec] = move.pieceMoved\\r\\n self.moveLog.append(move)\\r\\n self.turn_white = not self.turn_white\\r\\n if move.pieceMoved == 'wk':\\r\\n self.wKingPos = (move.er, move.ec)\\r\\n elif move.pieceMoved == 'bk':\\r\\n self.bKingPos = (move.er, move.ec)\\r\\n\\r\\n if move.isEnpassantMove:\\r\\n self.board[move.sr][move.ec] = \\\"--\\\"\\r\\n\\r\\n if move.pieceMoved[1] == 'p' and abs(move.sr - move.er) == 2:\\r\\n self.enpas_pos = ((move.er + move.sr) // 2, move.ec)\\r\\n else:\\r\\n self.enpas_pos = ()\\r\\n\\r\\n if move.isPawnPromotion and not check_valid:\\r\\n promoted_piece = \\\"a\\\"\\r\\n while promoted_piece not in ('q', 'r', 'b', 'n'):\\r\\n promoted_piece = input(\\\"Promote to q, r, b, or n: \\\")\\r\\n self.board[move.er][move.ec] = move.pieceMoved[0] + promoted_piece\\r\\n\\r\\n # castle\\r\\n if move.castle:\\r\\n if move.ec - move.sc == 2:\\r\\n self.board[move.er][move.ec - 1] = self.board[move.er][move.ec + 1]\\r\\n self.board[move.er][move.ec + 1] = '--'\\r\\n else:\\r\\n self.board[move.er][move.ec + 1] = self.board[move.er][move.ec - 2]\\r\\n self.board[move.er][move.ec - 2] = '--'\\r\\n\\r\\n # castle rights on rook, king move\\r\\n self.update_castle_rights(move)\\r\\n self.castleRightsLog.append(CastleRights(self.cr_castle_r.wks, self.cr_castle_r.bks,\\r\\n self.cr_castle_r.wqs, self.cr_castle_r.bqs))\",\n \"def make_move(self, px, py):\\n if self.state != State.IN_PROGRESS:\\n raise GameEndedError('Cannot make move. The game has ended.')\\n x, y, i, j = self.to_coords(px, py)\\n board = self.boards[x][y]\\n if (x, y) not in self.available_boards:\\n raise IllegalMoveError('Illegal move. Board is unavailable.')\\n board.set_square(i, j, self.__on_turn)\\n self.__on_turn = Square.X if self.__on_turn == Square.O else Square.O\\n self.last_move = (x, y, i, j)\\n self.history.append(self.last_move)\",\n \"def simulate(state: GameState) -> int:\\n moves = list(state.moves)\\n #print(\\\" moves available: \\\", moves)\\n for i in range(len(state.moves)):\\n move = random.choice(moves)\\n #print(\\\" move making: \\\", move)\\n move_idx = moves.index(move)\\n #print(\\\" index of move: \\\", move_idx)\\n moves.pop(move_idx)\\n #print(\\\" new moves available: \\\", moves)\\n state = state.traverse(move)\\n #print(\\\" Winner: \\\", state.util)\\n #print(\\\" New Board: \\\", state.display)\\n return state.util\",\n \"def move(self, board):\\n\\n if board.get_number_of_moves() == 0:\\n random_row = randint(0, 2)\\n random_column = randint(0, 2)\\n\\n if random_row == 1 or random_column == 1:\\n random_row = 1\\n random_column = 1\\n elif random_row == 2:\\n random_row = board.get_dimension()-1\\n\\n if random_column == 2:\\n random_column = board.get_dimension()-1\\n\\n move = (random_row, random_column)\\n elif board.get_number_of_moves() == 1 or board.get_number_of_moves() == 2:\\n if board.get_piece(1,1) == ' ':\\n move = (1, 1)\\n else:\\n board_dimension = board.get_dimension()-1\\n corners = [(0, 0), (0, board_dimension), (board_dimension, 0), (board_dimension, board_dimension)]\\n corners = self.remove_filled_positions(corners, board)\\n\\n move = corners[randint(0, len(corners)-1)]\\n else:\\n move = self.check_for_winner(board)\\n\\n if move == (-1, -1):\\n board_dimension = board.get_dimension()-1\\n corner1_moves = self.remove_filled_positions([(0, 0), (2, 2)], board)\\n corner2_moves = self.remove_filled_positions([(0, 2), (2, 0)], board)\\n\\n non_corner_moves = self.remove_filled_positions([(1, 0), (2, 1), (1, 2), (0, 1)], board)\\n\\n center_piece = board.get_piece(1, 1)\\n corner_pieces = [board.get_piece(0, 0), board.get_piece(board_dimension, 0), board.get_piece(0, board_dimension), board.get_piece(board_dimension, board_dimension)]\\n\\n if corner_pieces[0] != self._piece and corner_pieces[0] != ' ' and corner_pieces[0] == corner_pieces[3]:\\n move = non_corner_moves[randint(0, 3)]\\n elif corner_pieces[1] != self._piece and corner_pieces[1] != ' ' and corner_pieces[1] == corner_pieces[2]:\\n move = non_corner_moves[randint(0, 3)]\\n elif len(corner2_moves) > 0 and corner_pieces[0] != self._piece and corner_pieces[0] == center_piece and corner_pieces[3] == self._piece:\\n move = corner2_moves[0]\\n elif len(corner1_moves) > 0 and corner_pieces[1] != self._piece and corner_pieces[1] == center_piece and corner_pieces[2] == self._piece:\\n move = corner1_moves[0]\\n elif len(corner1_moves) > 0 and corner_pieces[2] != self._piece and corner_pieces[2] == center_piece and corner_pieces[1] == self._piece:\\n move = corner1_moves[0]\\n elif len(corner2_moves) > 0 and corner_pieces[3] != self._piece and corner_pieces[3] == center_piece and corner_pieces[0] == self._piece:\\n move = corner2_moves[0]\\n else:\\n move = self.can_complete_two_in_row(board)\\n\\n if move == (-1, -1):\\n move = (randint(0, board.get_dimension()-1), randint(0, board.get_dimension()-1))\\n\\n while not board.check_move(move[0], move[1]):\\n move = (randint(0, board.get_dimension()-1), randint(0, board.get_dimension()-1))\\n\\n return move\",\n \"def get_move(moves):\\n pass\",\n \"def make_move(self, board: Board) -> int:\\n return random.choice(board.get_valid_moves())\",\n \"def _next_state(self, state, action):\\n\\n # Transition table to define movement for each action\\n if self.action_type == 'VonNeumann':\\n transitions = {0: [-1, 0], 1: [+1, 0], 2: [0, -1], 3: [0, +1]}\\n elif self.action_type == 'Moore':\\n transitions = {0: [-1, 0], 1: [+1, 0], 2: [0, -1], 3: [0, +1],\\n 4: [-1, +1], 5: [+1, +1], 6: [-1, -1], 7: [+1, -1]}\\n\\n new_state = [state[0] + transitions[action][0], state[1] + transitions[action][1]]\\n if self.maze[new_state[0]][new_state[1]] == 1: # Hit wall, stay there\\n return state\\n else: # Valid move for 0, 2, 3, 4\\n return new_state\",\n \"def make_move(board, index, p):\\n if not utils.is_valid_player(p) or p == config.NO_PLAYER:\\n raise Exception('Input p must = {0} or {1}. p = {3}'.format(config.HUMAN, config.COMPUTER, p))\\n result = copy.deepcopy(board)\\n result[index] = p\\n if not is_valid_board(result):\\n raise Exception('Move for {0} at {1} is invalid.'.format(p, index))\\n return result\",\n \"def make_move(board, position, player):\\n # only valid moves are passed in here\\n board[position-1] = player\",\n \"def makeMove(self, colour, move):\\n emptyCellList = [r for r in range(self.getHeight()) if self.cell[move][r]==EMPTY]\\n self.cell[move][emptyCellList[0]] = colour # put the stone in the first empty cell of column 'move'\",\n \"def make_move(self, board: Board) -> int:\\n\\n move = input()\\n move = int(move)\\n\\n while move not in board.get_valid_moves():\\n print(\\\"That is not a valid move\\\")\\n move = input()\\n move = int(move)\\n\\n return move\",\n \"def calculate_next_move(self, visit):\\n self.depth += 1\\n new_boards = []\\n for vehicle_id in range(len(self.vehicles)):\\n vehicle = self.vehicles[vehicle_id]\\n state = self.get_board()\\n if vehicle.orientation == 0: #horizontal\\n if vehicle.x > 0: #left\\n if state[vehicle.y][vehicle.x-1] == \\\"..\\\":\\n self.vehicles[vehicle_id].x -=1\\n if not self.get_board().tostring() in visit:\\n if not self.get_board().all in new_boards:\\n new_board = deepcopy(self)\\n self.vehicles[vehicle_id].x += 1\\n new_board.parent = self\\n new_boards.append(new_board)\\n else:\\n self.vehicles[vehicle_id].x += 1\\n\\n if vehicle.x + vehicle.length <= (len(state)-1): #right\\n if state[vehicle.y][vehicle.x+vehicle.length] == \\\"..\\\":\\n self.vehicles[vehicle_id].x += 1\\n if not self.get_board().tostring() in visit:\\n if not self.get_board().all in new_boards:\\n new_board = deepcopy(self)\\n self.vehicles[vehicle_id].x -= 1\\n new_board.parent = self\\n new_boards.append(new_board)\\n else:\\n self.vehicles[vehicle_id].x -= 1\\n\\n else: #vertical\\n if vehicle.y - 1 >= 0: #up\\n if state[vehicle.y-1][vehicle.x] == \\\"..\\\":\\n self.vehicles[vehicle_id].y -= 1\\n if not self.get_board().tostring() in visit:\\n if not self.get_board().all in new_boards:\\n new_board = deepcopy(self)\\n self.vehicles[vehicle_id].y += 1\\n new_board.parent = self\\n new_boards.append(new_board)\\n else:\\n self.vehicles[vehicle_id].y += 1\\n\\n if vehicle.y + vehicle.length <= (len(state)-1):\\n if state[vehicle.y + vehicle.length][vehicle.x] == \\\"..\\\":#down\\n self.vehicles[vehicle_id].y += 1\\n if not self.get_board().tostring() in visit:\\n if not self.get_board().all in new_boards:\\n new_board = deepcopy(self)\\n self.vehicles[vehicle_id].y -= 1\\n new_board.parent = self\\n new_boards.append(new_board)\\n else:\\n self.vehicles[vehicle_id].y -= 1\\n self.depth -= 1\\n return new_boards\",\n \"def make_move(self, move_from, move_to):\\n\\n from_coordinates = self.translate_to_grid(move_from)\\n to_coordinates = self.translate_to_grid(move_to)\\n from_col = from_coordinates[0]\\n from_row = from_coordinates[1]\\n to_col = to_coordinates[0]\\n to_row = to_coordinates[1]\\n value_at_from = self._board[from_col][from_row]\\n value_at_to = self._board[to_col][to_row]\\n\\n # if player passes the same square value for both move_from and move_to, then they are passing their turn\\n # which they however cannot do if they are in check\\n if not self.is_in_check(self._turn) and move_from == move_to:\\n if self._turn == 'red':\\n self._turn = 'blue'\\n else:\\n self._turn = 'red'\\n return True\\n\\n # if game isn't over yet and move_from location holds a piece\\n if (self.get_game_state() == 'UNFINISHED' and issubclass(type(value_at_from), Piece) and\\n # and that piece belongs to the player whose turn it is\\n self._turn == value_at_from.get_color() and\\n # and the movement pattern is valid for that piece\\n value_at_from.validate_move(move_from, move_to, self._board)):\\n # if there's a piece belonging to the player whose turn it is at move_to (attempting to capture own piece)\\n if issubclass(type(value_at_to), Piece) and self._turn == value_at_to.get_color():\\n return False\\n else:\\n # Make the move\\n # if move_to holds an opposing piece, it gets captured\\n if issubclass(type(value_at_to), Piece):\\n self.remove_piece(value_at_to)\\n value_at_from.set_location(move_to)\\n self._board[to_col][to_row] = value_at_from\\n self._board[from_col][from_row] = ''\\n # whether the player was already in check or this move placed them in check, they cannot now be in check\\n if type(self.is_a_player_in_check(self._turn)) is General and self.is_a_player_in_check(self._turn).get_color() == self._turn:\\n # Revert the move and return False since the player did not bring themself out of check\\n self._board[from_col][from_row] = value_at_from\\n self._board[to_col][to_row] = value_at_to\\n value_at_from.set_location(move_from)\\n if issubclass(type(value_at_to), Piece):\\n self._active_pieces[value_at_to.get_color()].append(value_at_to)\\n return False\\n # the player either already wasn't or now isn't in check, so set its General to not in check\\n self.get_general(self._turn).set_in_check(False)\\n # if opposing general was put in check, set its in_check status to True and see if checkmate\\n if type(self.is_a_player_in_check(self._turn)) is General:\\n self.is_a_player_in_check(self._turn).set_in_check(True)\\n if self.checkmate(self.is_a_player_in_check(self._turn)):\\n if self._turn == 'red':\\n self._game_state = 'RED_WON'\\n else:\\n self._game_state = 'BLUE_WON'\\n # turn complete, change to other player's turn\\n if self._turn == 'red':\\n self._turn = 'blue'\\n else:\\n self._turn = 'red'\\n return True\\n return False\",\n \"def make_move(self): \\n if self.counter == 0:\\n #AI makes a random move to start\\n ai_move = random.randrange(0,((self.size[0] * self.size[1]) - 1)) \\n \\n #Number to coordinate conversion\\n row = ai_move % self.size[0]\\n column = ai_move % self.size[0]\\n self.start_game((row, column))\\n self.counter = 1\\n\\n if (self.board[(row, column)] == 'm'):\\n #print() \\\"\\\\n\\\", \\\"First move RIP!, what are the odds...\\\"\\n self.found_mine()\\n self.gameover = 1\\n \\n else:\\n row, column = self.find_move()\\n \\n #0.25 second wait \\n #time.sleep(0.25)\\n\\n #Prints out to the terminal the move and type of move\\n print(row, \\\",\\\", column)\\n\\n #Updates the GUI\\n root.update()\\n \\n if (self.board[(row, column)] == 'm'):\\n print(\\\"RIP!\\\") \\n self.found_mine() \\n self.gameover = 1\\n \\n elif self.board[(row, column)] == '0':\\n print(\\\"No mines in sight\\\") \\n self.found_space((row, column))\\n\\n elif self.board[(row, column)] == '1':\\n print(\\\"There is 1 mine next to this spot\\\") \\n self.found_border((row, column))\\n else:\\n print(\\\"There are\\\", self.board[(row, column)], \\\"mines next to this spot\\\") \\n self.found_border((row, column))\",\n \"def make_move(self, position_from, position_to):\\n\\n # Returns False if position_from or position_to are not an actual position\\n # ranging from 'a1' to 'i10' for columns 'a' through 'i' and rows '1' \\n # through '10'.\\n if not isinstance(position_to, str) or\\\\\\n not isinstance(position_from,str) or\\\\\\n len(position_to) > 3 or len(position_to) < 2 or\\\\\\n len(position_from) > 3 or len(position_from) < 2:\\n\\n return False \\n\\n # Returns False if game has been won.\\n elif self.get_game_state() != 'UNFINISHED':\\n\\n return False\\n\\n position_to = position_to.lower()\\n position_from = position_from.lower()\\n current_player = self.get_player_turn()\\n\\n # Returns False if move is not legal based on Janggi game rules.\\n if self.legal_move(position_to, position_from) is not True:\\n\\n return False\\n\\n # Returns True if current player wishes to pass on their move.\\n # Any position on the board will suffice, including a General's position.\\n # Tested in legal_move to exit legal_move safely. The second test for pass\\n # updates player turn and returns True, so long as the player is not\\n # currently in check.\\n if position_to == position_from:\\n\\n if self.is_in_check(current_player) is True:\\n \\n return False\\n\\n self.update_player_turn()\\n return True\\n\\n # Move is valid. Adjusted board, update potential moves for all GamePieces,\\n # test checkmate (change game_state if True), update player turn, and\\n # return True.\\n else:\\n\\n game_piece_object = self.get_game_piece_object_at_position(position_from)\\n self.adjust_board(game_piece_object, position_to, position_from)\\n self.update_potential_moves()\\n \\n # Sets the General's Board position attribute if the position has\\n # changed.\\n if isinstance(game_piece_object, General):\\n\\n if current_player == 'BLUE':\\n\\n self.set_general_position_blue(position_to)\\n\\n else:\\n\\n self.set_general_position_red(position_to)\\n\\n # Sets game_state to the player who won if checkmate is detected.\\n if self.is_checkmate() is True:\\n\\n if current_player == 'BLUE':\\n\\n self.set_game_state('BLUE_WON')\\n \\n else:\\n\\n self.set_game_state('RED_WON')\\n\\n self.update_player_turn()\\n return True\",\n \"def apply_move(self, move):\\n if self.check_move(move=move):\\n self.board_list[move] = self.current_player.marker # changes value in the board to player which is either X or O\\n self.moves_made += str(move) # keeps track of all moves\\n return True\\n else:\\n return False\",\n \"def is_new_move(my_board, x, y):\\n return my_board[x, y] == CLOSED\",\n \"def update(self, move):\\n\\n if not 0 <= move < 7:\\n raise InvalidMove\\n\\n placed = False\\n x = None\\n y = None\\n\\n for row in reversed(xrange(self._rows)):\\n if not self._board[row][move]:\\n self._board[row][move] = self.current_player\\n placed = True\\n x = move\\n y = row\\n break\\n\\n if not placed:\\n raise InvalidMove\\n\\n return (x, y)\",\n \"def make_move(move):\\n global manatee_pos\\n global hyacinths\\n global hyacinth_pos\\n\\n # Ends the program if movement is out of bounds\\n if move == (0, 0):\\n return None\\n new_pos = (manatee_pos[0] + move[0], manatee_pos[1] + move[1])\\n if new_pos[0] < 0 or new_pos[0] >= len(map):\\n return None\\n if new_pos[1] < 0 or new_pos[1] >= len(map[new_pos[0]]):\\n return None\\n\\n entity = map[new_pos[0]][new_pos[1]]\\n if entity == \\\"#\\\" or entity == \\\"G\\\":\\n # Runs if movement is impossible\\n return None\\n if entity == \\\" \\\" or entity == \\\".\\\":\\n # Runs if normal movement is possible\\n map[new_pos[0]][new_pos[1]] = \\\"M\\\"\\n map[manatee_pos[0]][manatee_pos[1]] = \\\" \\\"\\n manatee_pos = new_pos\\n return None\\n if entity == \\\"O\\\":\\n # Runs if manatee wins game\\n map[new_pos[0]][new_pos[1]] = \\\"M\\\"\\n map[manatee_pos[0]][manatee_pos[1]] = \\\" \\\"\\n manatee_pos = new_pos\\n return \\\"win\\\"\\n if entity == \\\"\\\\\\\\\\\":\\n # Runs if manatee eats hyacinth\\n map[new_pos[0]][new_pos[1]] = \\\"M\\\"\\n map[manatee_pos[0]][manatee_pos[1]] = \\\" \\\"\\n manatee_pos = new_pos\\n hyacinths += 1\\n if len(hyacinth_pos) == hyacinths:\\n map[grate_pos[0]][grate_pos[1]] = \\\"O\\\"\\n return None\\n if entity == \\\"*\\\":\\n # Checks if manatee can push boat\\n if move[0] == 0:\\n new_boat_pos = (new_pos[0] + move[0], new_pos[1] + move[1])\\n if new_boat_pos[0] < 0 or new_boat_pos[0] >= len(map):\\n return None\\n if new_boat_pos[1] < 0 \\\\\\n or new_boat_pos[1] >= len(map[new_boat_pos[0]]):\\n return None\\n if map[new_boat_pos[0]][new_boat_pos[1]] == \\\" \\\":\\n map[new_boat_pos[0]][new_boat_pos[1]] = \\\"*\\\"\\n map[new_pos[0]][new_pos[1]] = \\\"M\\\"\\n map[manatee_pos[0]][manatee_pos[1]] = \\\" \\\"\\n manatee_pos = new_pos\\n return None\\n return None\",\n \"def move(self, movement):\\n index = self.state.index(0)\\n\\n new_state = self.state.copy()\\n\\n if movement == 'up':\\n new_state[index], new_state[index - 3] = new_state[index - 3], new_state[index]\\n elif movement == 'down':\\n new_state[index], new_state[index + 3] = new_state[index + 3], new_state[index]\\n elif movement == 'left':\\n new_state[index], new_state[index - 1] = new_state[index - 1], new_state[index]\\n else:\\n # movement == 'right'\\n new_state[index], new_state[index + 1] = new_state[index + 1], new_state[index]\\n \\n return new_state\",\n \"def make_move(self, request):\\n\\n player = Player.query(Player.name == request.player_name).get()\\n\\n \\\"\\\"\\\"we validate that the player is in the Data Base\\\"\\\"\\\"\\n if not player:\\n raise endpoints.NotFoundException('player not found')\\n\\n game = gameutils.get_by_urlsafe(request.urlsafe_key, Game)\\n \\\"\\\"\\\"we validate that the game where we want to create the board exists\\\"\\\"\\\"\\n if not game:\\n raise endpoints.NotFoundException(\\n 'Game not found in the DB, please start a new game')\\n\\n board = Board.query(Board.key == player.board).get()\\n \\\"\\\"\\\"we validate that the board where we want to create the board exists\\\"\\\"\\\"\\n if not board:\\n raise endpoints.NotFoundException('board not found')\\n\\n \\\"\\\"\\\"we validate that the board of the player is active, the player can't create\\n multiple boards for the same Game\\\"\\\"\\\"\\n if not player.board and not player.board_active:\\n raise endpoints.ConflictException(\\n 'This player has already an empty board have already a board')\\n\\n if player.board != board.key:\\n raise endpoints.ConflictException('the board for this player is not the proper')\\n\\n if not gameutils.valid_target_pointed(request.x_position, request.y_position):\\n raise endpoints.ConflictException('the targeted position is not ok')\\n\\n\\n try:\\n result = gameutils.search_in_board(board, request.x_position, request.y_position)\\n\\n if result == \\\"error\\\":\\n raise endpoints.ConflictException('there is a problem with the BOARD')\\n else:\\n score = Score.query(Score.player_name == player.name, Score.board == board, Score.game == game)\\n board.add_target(request.x_position, request.y_position)\\n game.add_move_to_history(request.x_position, request.y_position, player.name)\\n message = score.target_hitted(player,request.x_position, request.y_position, board, game)\\n if score.check_if_win():\\n message = \\\"You sunk the last Boat, you win!!!\\\"\\n board.deactivate()\\n return StringMessage(message=message)\\n\\n except ValueError:\\n raise endpoints.BadRequestException('please verify the information ')\",\n \"def makeMove(self, move, player):\",\n \"def respond_to_move(self, move):\\n\\n # this will get the piece at the queried position,\\n # will notify user if there is no piece there\\n current_algebraic, new_algebraic = move\\n row, column = self.algebraic_mapped_to_position[current_algebraic]\\n if self.board[row][column] == empty_square:\\n print(\\\"There is no piece at %s\\\" % (current_algebraic,))\\n return\\n piece, location = self.board[row][column]\\n\\n # this will get all possible moves from this position\\n # and will make the move if the new position is a\\n # valid move\\n piece_name = self.piece_names[piece]\\n moves = self.moves[piece_name]((row, column))\\n \\n new_row, new_column = self.algebraic_mapped_to_position[new_algebraic]\\n print(\\\"old position %s, %s\\\" % (row, column))\\n print(\\\"new algebraic %s\\\" % new_algebraic)\\n print(\\\"new position %s, %s\\\" % (new_row, new_column))\\n print(\\\"moves %s\\\" % moves)\\n if (new_row, new_column) in moves:\\n # this will change the game board to reflect the move\\n self.board[row][column] = empty_square\\n self.board[new_row][new_column] = piece+location\",\n \"def make_move(self, time_limit, players_score):\\n \\n start_time = time.time()\\n d = 1 \\n \\n reach_the_end = False\\n best_direction = None\\n chosen_state = None\\n \\n time_limit = (2 * self.game_time * float(self.player_turns - self.turns + 1)) / ((self.player_turns + 1) * self.player_turns)\\n time_limit += self.spaire_time\\n\\n if time_limit >= 5:\\n TIME_ESTIMATION = 0.9 \\n else:\\n TIME_ESTIMATION = 0.85\\n\\n while not reach_the_end: \\n \\n iter_time_limit = TIME_ESTIMATION * ( time_limit - (time.time() - start_time) )\\n \\n state = State(get_directions(),self.board,self.locations,self.fruits_on_board_dict,PLAYER,players_score,self.penalty_score,self.fruits_ttl,self.turns)\\n\\n try:\\n _, best_direction, reach_the_end,chosen_state = self.alphabeta.search(state,d,True,iter_time_limit,alpha=float('-inf'), beta=float('inf'))\\n d += 1\\n except Exception as e:\\n self.spaire_time = time_limit - (time.time() - start_time)\\n break\\n \\n # Set new location \\n if best_direction == None:\\n best_direction = self.get_random_move() \\n self.set_player_location(best_direction)\\n \\n self.turns += 1\\n return best_direction\",\n \"def updated_board(board_w, board_h, piece_list, board, position):\\n board_state = board.state\\n new_board = Board(board_w, board_h, 1, piece_list, position)\\n new_board.state = board_state\\n return new_board\",\n \"def makeMove(self, state, column, color):\\n \\n temp = [x[:] for x in state]\\n for i in range(6):\\n if temp[i][column] == ' ':\\n temp[i][column] = color\\n return temp\",\n \"def is_valid_move(state, move):\\n row, col = move\\n if row not in [1, 2, 3] or col not in [1, 2, 3]:\\n print(\\\"Invalid move! Specify correct game square!\\\")\\n return False\\n if state[row-1][col-1] != '_':\\n print('Invalid move! Place your marker on a free square!')\\n return False\\n return True\",\n \"def update_board(board: Board, move: Move) -> Board:\\n old_position = move[0]\\n new_position = move[1]\\n character = board[old_position[0]][old_position[1]]\\n board = change_position(board, new_position, character)\\n board = clear_position(board, old_position)\\n \\n return board\",\n \"def exploreNext(neighbor, move):\\n if (neighbor != None and tuple(neighbor) not in explored):\\n nextState = State(neighbor)\\n nextState.path = currentState.path.copy()\\n nextState.path.append(move)\\n stateQueue.append(nextState)\",\n \"def select_move(self, game_state, return_visit_counts=False):\\n \\n # Start with a tree consisting of a root node only. The root node\\n # is associated with the given board position.\\n root = self.create_node(game_state)\\n \\n # If no legal moves can be made from the given board position, pass \\n # the turn. This happens when all of the players pieces are surrounded,\\n # if the player has no pieces left or if the game is over. \\n if not root.branches:\\n if return_visit_counts:\\n return Act.pass_turn(), {}\\n return Act.pass_turn()\\n \\n for i in range(self.num_rounds):\\n # On each iteration, walk down the tree to a leaf node and select\\n # a move to make from the corresponding leaf game state.\\n node = root\\n next_move = self.select_branch(node)\\n while node.has_child(next_move):\\n node = node.get_child(next_move)\\n next_move = self.select_branch(node)\\n \\n # Create a new tree node for the selected move and add it to\\n # the tree. If the leaf node corresponds to a finished game\\n # then don't create a new node and assign a value to the node\\n # based on who won.\\n if node.state.is_not_over():\\n if next_move:\\n new_state = copy.deepcopy(node.state)\\n new_state.take_turn_with_no_checks(Act.play(next_move))\\n child_node = self.create_node(new_state, \\n move=next_move, parent=node)\\n move = next_move\\n value = -1 * child_node.value \\n else:\\n # If the current player can't make any moves from the\\n # selected gamestate then next_move will be 'None' meaning\\n # the player passes the turn.\\n new_state = copy.deepcopy(node.state)\\n new_state.take_turn_with_no_checks(Act.pass_turn())\\n child_node = self.create_node(new_state, \\n move=next_move, parent=node)\\n move = next_move\\n value = -1 * child_node.value\\n else:\\n # If the game in the current state is over, then the last\\n # player must have won the game. Thus the value/reward for the\\n # other player is 1. The current node is not updated with\\n # the new reward as no branches can stem from a finished game\\n # state.\\n move = node.last_move\\n node = node.parent\\n value = 1\\n \\n # Update the nodes traversed to get to the leaf node with the \\n # new value for the new move.\\n while node is not None:\\n node.record_visit(move, value)\\n move = node.last_move\\n node = node.parent\\n value *= -1\\n \\n # Get the visit counts of the branches if they were requested.\\n if return_visit_counts:\\n visit_counts = {}\\n for move in root.branches.keys():\\n visit_counts[move] = root.branches[move].visit_count\\n \\n # Get a list of possible moves sorted according to visit count,\\n # the move with the highest visit count should be first in the list.\\n moves = [move for move in root.moves()]\\n moves = sorted(moves, key=root.visit_count, reverse=True)\\n \\n # Loop through the sorted moves and return the first legal one.\\n for move in moves:\\n if not game_state.is_move_illegal(move):\\n if return_visit_counts:\\n return Act.play(move), visit_counts\\n return Act.play(move)\\n \\n # If no legal move is found then pass the turn.\\n if return_visit_counts:\\n return Act.pass_turn(), visit_counts\\n return Act.pass_turn()\",\n \"def make_move(grid, n_columns, n_rows):\\r\\n # Generate the game grid to be manipulated\\r\\n new_grid = [[0] * (n_columns + 1) for i in range(n_rows + 1)]\\r\\n\\r\\n\\r\\n for i in range(n_rows):\\r\\n for j in range(n_columns):\\r\\n upper_left = grid[i-1][j-1] # neighbor to upper left of cell of interest\\r\\n upper = grid[i-1][j] # neighbor above cell of interest\\r\\n upper_right = grid[i-1][j+1] # neighbor to upper right of cell of interest\\r\\n left = grid[i][j-1] # neighbor to left of cell of interest\\r\\n right = grid[i][j+1] # neighbor to right of cell of interest\\r\\n bot_left = grid[i+1][j-1] # neighbor to bottom left cell of interest\\r\\n bot = grid[i+1][j] # neighbor below cell of interest\\r\\n bot_right = grid[i+1][j+1] # neighbor to bottom right of cell of interest\\r\\n\\r\\n # sum of the state of all neighbors\\r\\n on_neighbors = upper_left + upper + upper_right + left + right + bot_left + bot + bot_right\\r\\n\\r\\n # Any ON cell with fewer than two ON neighbors turns OFF\\r\\n if grid[i][j] == 1 and on_neighbors < 2:\\r\\n new_grid[i][j] = 0\\r\\n\\r\\n # Any ON cell with two or three ON neighbours stays ON\\r\\n elif grid[i][j] == 1 and (on_neighbors == 2 or on_neighbors == 3):\\r\\n new_grid[i][j] = 1\\r\\n\\r\\n # Any ON cell with more than three ON neighbors turns OFF\\r\\n elif grid[i][j] == 1 and on_neighbors > 3:\\r\\n new_grid[i][j] = 0\\r\\n\\r\\n # Any OFF cell with three ON neighbors turns ON\\r\\n elif grid[i][j] == 0 and on_neighbors == 3:\\r\\n new_grid[i][j] = 1\\r\\n\\r\\n return new_grid #manipulated game grid\\r\",\n \"def start_state():\\n return chess.Board()\",\n \"def result(board, action):\\n\\n # Create completely new board\\n temp_board = copy.deepcopy(board)\\n # Location of move to be made\\n row_index = action[0]\\n col_index = action[1]\\n\\n # Check for valid action\\n if not 0 <= row_index <= 2 or not 0 <= col_index <= 2:\\n raise Exception(\\\"Invalid Action\\\")\\n\\n # Make move and update board\\n if board[row_index][col_index] is None:\\n temp_board[row_index][col_index] = player(board)\\n else:\\n raise Exception(\\\"Invalid Action\\\")\\n\\n return temp_board\",\n \"def make_move(self, index):\\n if self.board[index] is None and self.get_winner() is None:\\n self.board[index] = self.player\\n self.player = 'O' if self.player == 'X' else 'X'\\n self.winner = self.get_winner()\",\n \"def move(self, board):\\n\\n move = (randint(0, board.get_dimension()-1), randint(0, board.get_dimension()-1))\\n\\n while not board.check_move(move[0], move[1]):\\n move = (randint(0, board.get_dimension()-1), randint(0, board.get_dimension()-1))\\n\\n return move\",\n \"def getMove(self, board):\\n pass\",\n \"def move(self, move):\\n out = ''\\n for val in self.moves[move]:\\n out += self.state[val]\\n self.state = out\",\n \"def make_move(json):\\n res = result(json[\\\"board\\\"], tuple(json[\\\"move\\\"]))\\n emit(\\\"update\\\", res)\",\n \"def result(self, state, action):\\r\\n\\r\\n sc = copy.deepcopy(state)\\r\\n new_piece, player = self.new_or_old_piece(state)\\r\\n current_player, to_action, from_action = action\\r\\n\\r\\n # Make the move\\r\\n sc[to_action[0]][to_action[1]] = current_player\\r\\n\\r\\n # There can't be more than 6 pieces in any state.\\r\\n if not new_piece:\\r\\n # Now making from place as null again\\r\\n sc[from_action[0]][from_action[1]] = '-'\\r\\n\\r\\n return sc\",\n \"def makeState(*args,**kwargs):\\n \\n cells = []\\n\\n for item in args:\\n #print item\\n cells.append(item)\\n \\n newState = State(cells)\\n #newState.printBoard()\\n return newState\",\n \"def next_move(self, board):\\n self.num_moves += 1\\n \\n \\n ################### TODO: ######################################\\n # Implement your strategy here. \\n # Feel free to call as many as helper functions as you want.\\n # We only cares the return of this function\\n ################################################################\",\n \"def result(board, action):\\n #we start by creating a deep copy of me board for me not to modify the original\\n new_board = copy.deepcopy(board)\\n #I get the player's turn in the current board.\\n action_token = player(new_board)\\n #If I the corresponding spot on my board is available\\n if (new_board[action[0]][action[1]] == EMPTY):\\n #then I will make that move with the current player\\n new_board[action[0]][action[1]] = action_token\\n return new_board\\n else:\\n #else, I raise a not a valid action error because the place is already taken or does not exist.\\n raise Exception('Not a valid action')\",\n \"def move(self, board):\\r\\n self.start_time = time.time()\\r\\n disk_total = self.get_disk_count(self.my_color, board) + self.get_disk_count(self.opponent_color, board)\\r\\n\\r\\n if disk_total < 15:\\r\\n # In early-game, we can allow a deeper minimax search since there's not too many possible moves.\\r\\n self.minimax_max_depth = 7\\r\\n\\r\\n elif disk_total < 45:\\r\\n # In mid-game, minimax tree has the most branches. Therefore, we must give it space to breathe.\\r\\n self.minimax_max_depth = 5\\r\\n else:\\r\\n # In the very end-game, minimax tree has the least branches, so we can allow a full search.\\r\\n self.minimax_max_depth = 8\\r\\n\\r\\n possible_moves = self.find_possible_moves(board, self.my_color)\\r\\n\\r\\n # If there's only one move available, return it\\r\\n if len(possible_moves) == 1:\\r\\n return possible_moves[0]\\r\\n\\r\\n # If we can take a corner, take it and don't consider any other options.\\r\\n # This rarely backfires and allows to save a tiny bit of time\\r\\n corners = [(0,0), (0,7), (7,0), (7,7)]\\r\\n for corner in corners:\\r\\n if corner in possible_moves:\\r\\n return corner\\r\\n\\r\\n # Grow a minimax tree to find the best available move\\r\\n alpha_init = -10000000\\r\\n beta_init = 10000000\\r\\n\\r\\n available_moves = self.minimax(board, 0, self.my_color, alpha_init, beta_init)\\r\\n print(available_moves)\\r\\n if available_moves != 0:\\r\\n best_value = max(available_moves.values())\\r\\n for move in available_moves:\\r\\n if available_moves[move] == best_value:\\r\\n return move\\r\\n\\r\\n return None\",\n \"def make(self,state_board):\\n\\t\\tstate_board[self.column][self.line] = self.couleur #place the piece\\n\\t\\tdrawPiece((self.column,self.line),self.couleur) #draws it on the board\\n\\t\\tfor pos in self.flips: #flips all the pieces in flips\\n\\t\\t\\tstate_board[pos[0]][pos[1]] = self.couleur\\n\\t\\t\\tdrawPiece(pos,self.couleur) #draws it on the board\",\n \"def make_move(self, board: Board) -> int:\\n move, evalutation = self.minimax(board, -math.inf, math.inf, self._depth, 1)\\n return move\",\n \"def find_best_move(state: GameState) -> None:\",\n \"def make_move(self, start, end):\\r\\n start_pos = self.parse_pos(start) # Start and end position are lists that contain column and row\\r\\n end_pos = self.parse_pos(end)\\r\\n\\r\\n start_row = start_pos[0] # Position of row and columns are assigned to variables\\r\\n start_col = start_pos[1]\\r\\n end_row = end_pos[0]\\r\\n end_col = end_pos[1]\\r\\n\\r\\n board = self._board.get_board()\\r\\n start_piece = board[start_row][start_col].get_piece()\\r\\n end_piece = board[end_row][end_col].get_piece()\\r\\n\\r\\n\\r\\n # If there is no piece to be moved or game is over or piece is to be moved to its original location\\r\\n if start_piece is None or self._game_state != \\\"UNFINISHED\\\"\\\\\\r\\n or (start_row == end_row and start_col == end_col):\\r\\n return False\\r\\n\\r\\n start_piece_id = start_piece.get_player_id() # Contains the player id associated with the piece\\r\\n end_piece_player_id = None\\r\\n if end_piece is not None: # Executes if end piece contains a piece object\\r\\n end_piece_player_id = end_piece.get_player_id()\\r\\n\\r\\n # If Red's turn\\r\\n if self._player_turn == 1:\\r\\n if start_piece_id != 'r': # If red moves a black piece\\r\\n return False\\r\\n if start_piece.is_legal_move(start, end, start_piece, end_piece_player_id, board) : # Checks the legal move conditions\\r\\n if self.move_piece(start, end): # Returns False if move is invalid\\r\\n # Checks if move violates flying general and puts self in check\\r\\n if self.is_not_flying_general() is True and self.is_in_check(\\\"red\\\") is False:\\r\\n self.change_player_turn()\\r\\n self.is_in_checkmate()\\r\\n return True\\r\\n else: # Reverses the move if violates flying general rule\\r\\n self.reverse_move(start, end, board,end_piece_player_id, end_piece)\\r\\n return False\\r\\n\\r\\n else:\\r\\n return False\\r\\n else:\\r\\n return False\\r\\n\\r\\n # If Black's turn\\r\\n elif self._player_turn == -1:\\r\\n if start_piece_id != 'b': # If black moves a red piece\\r\\n return False\\r\\n if start_piece.is_legal_move(start, end, start_piece, end_piece_player_id, board): # Checks the legal move conditions\\r\\n if self.move_piece(start, end): # Returns False if move is invalid\\r\\n if self.is_not_flying_general() is True and self.is_in_check(\\\"black\\\") is False:\\r\\n self.change_player_turn()\\r\\n self.is_in_checkmate()\\r\\n return True\\r\\n else: # Reverses the move if violates flying general rule\\r\\n self.reverse_move(start, end, board, end_piece_player_id, end_piece)\\r\\n return False\\r\\n else:\\r\\n return False\\r\\n else:\\r\\n return False\",\n \"def newGame(self):\\n self.last_move = \\\"go\\\"\\n self.values = [None for i in range(64)]\\n for i in range(8):\\n self.setPiece(i, 2, self.makePiece(ChessPiece.WHITE_PAWN, i, 2, \\\"wpawn\\\"+str(i)))\\n self.setPiece(i, 7, self.makePiece(ChessPiece.BLACK_PAWN, i, 7, \\\"bpawn\\\"+str(i)))\\n\\n self.setPiece('a', 1, self.makePiece(ChessPiece.WHITE_ROOK, 'a', 1, \\\"wrook0\\\"))\\n self.setPiece('b', 1, self.makePiece(ChessPiece.WHITE_KNIGHT, 'b', 1, \\\"wknight0\\\"))\\n self.setPiece('c', 1, self.makePiece(ChessPiece.WHITE_BISHOP, 'c', 1, \\\"wbishop0\\\"))\\n self.setPiece('d', 1, self.makePiece(ChessPiece.WHITE_QUEEN, 'd', 1, \\\"wqueen\\\"))\\n self.setPiece('e', 1, self.makePiece(ChessPiece.WHITE_KING, 'e', 1, \\\"wking\\\"))\\n self.setPiece('f', 1, self.makePiece(ChessPiece.WHITE_BISHOP, 'f', 1, \\\"wbishop1\\\"))\\n self.setPiece('g', 1, self.makePiece(ChessPiece.WHITE_KNIGHT, 'g', 1, \\\"wknight1\\\"))\\n self.setPiece('h', 1, self.makePiece(ChessPiece.WHITE_ROOK, 'h', 1, \\\"wrook1\\\"))\\n\\n self.setPiece('a', 8, self.makePiece(ChessPiece.BLACK_ROOK, 'a', 8, \\\"brook0\\\"))\\n self.setPiece('b', 8, self.makePiece(ChessPiece.BLACK_KNIGHT, 'b', 8, \\\"bknight0\\\"))\\n self.setPiece('c', 8, self.makePiece(ChessPiece.BLACK_BISHOP, 'c', 8, \\\"bbishop0\\\"))\\n self.setPiece('d', 8, self.makePiece(ChessPiece.BLACK_QUEEN, 'd', 8, \\\"bqueen\\\"))\\n self.setPiece('e', 8, self.makePiece(ChessPiece.BLACK_KING, 'e', 8, \\\"bking\\\"))\\n self.setPiece('f', 8, self.makePiece(ChessPiece.BLACK_BISHOP, 'f', 8, \\\"bbishop1\\\"))\\n self.setPiece('g', 8, self.makePiece(ChessPiece.BLACK_KNIGHT, 'g', 8, \\\"bknight1\\\"))\\n self.setPiece('h', 8, self.makePiece(ChessPiece.BLACK_ROOK, 'h', 8, \\\"brook1\\\"))\",\n \"def find_best_move(board):\\n new_board = board.get_board()\\n\\n # X | X | X <-- Check for win on this row\\n # ---------\\n # 3 | 4 | 5\\n # ---------\\n # 6 | 7 | 9\\n if new_board[0] == new_board[1] and new_board[2] == \\\"2\\\":\\n return 2\\n elif new_board[0] == new_board[2] and new_board[1] == \\\"1\\\":\\n return 1\\n elif new_board[1] == new_board[2] and new_board[0] == \\\"0\\\":\\n return 0\\n\\n # 0 | 1 | 2\\n # ---------\\n # X | X | X <-- Check for win on this row\\n # ---------\\n # 6 | 7 | 9\\n elif new_board[3] == new_board[4] and new_board[5] == \\\"5\\\":\\n return 5\\n elif new_board[3] == new_board[5] and new_board[4] == \\\"4\\\":\\n return 4\\n elif new_board[4] == new_board[5] and new_board[3] == \\\"3\\\":\\n return 3\\n\\n # 0 | 1 | 2\\n # ---------\\n # 3 | 4 | 5\\n # ---------\\n # X | X | X <-- Check for win on this row\\n elif new_board[6] == new_board[7] and new_board[8] == \\\"8\\\":\\n return 8\\n elif new_board[6] == new_board[8] and new_board[7] == \\\"7\\\":\\n return 7\\n elif new_board[7] == new_board[8] and new_board[6] == \\\"6\\\":\\n return 6\\n\\n # X | 1 | 2 Check for win on column one\\n # ---------\\n # X | 4 | 5\\n # ---------\\n # X | 7 | 9\\n elif new_board[0] == new_board[3] and new_board[6] == \\\"6\\\":\\n return 6\\n elif new_board[0] == new_board[6] and new_board[3] == \\\"3\\\":\\n return 3\\n elif new_board[6] == new_board[3] and new_board[0] == \\\"0\\\":\\n return 0\\n\\n # 0 | X | 2 Checks for win on column two\\n # ---------\\n # 3 | X | 5\\n # ---------\\n # 6 | X | 9\\n elif new_board[1] == new_board[4] and new_board[7] == \\\"7\\\":\\n return 7\\n elif new_board[1] == new_board[7] and new_board[4] == \\\"4\\\":\\n return 4\\n elif new_board[7] == new_board[4] and new_board[0] == \\\"0\\\":\\n return 0\\n\\n # 0 | 1 | X\\n # ---------\\n # 3 | 4 | X\\n # ---------\\n # 6 | 7 | X\\n elif new_board[2] == new_board[5] and new_board[8] == \\\"8\\\":\\n return 8\\n elif new_board[2] == new_board[8] and new_board[5] == \\\"5\\\":\\n return 5\\n elif new_board[8] == new_board[5] and new_board[2] == \\\"2\\\":\\n return 2\\n\\n # X | 1 | 2\\n # ---------\\n # 3 | X | 5\\n # ---------\\n # 6 | 7 | X\\n elif new_board[0] == new_board[4] and new_board[8] == \\\"8\\\":\\n return 8\\n elif new_board[0] == new_board[8] and new_board[4] == \\\"4\\\":\\n return 4\\n elif new_board[8] == new_board[4] and new_board[0] == \\\"0\\\":\\n return 0\\n\\n # 0 | 1 | X\\n # ---------\\n # 3 | X | 5\\n # ---------\\n # X | 7 | 9\\n elif new_board[2] == new_board[4] and new_board[6] == \\\"6\\\":\\n return 6\\n elif new_board[2] == new_board[6] and new_board[4] == \\\"4\\\":\\n return 4\\n elif new_board[6] == new_board[4] and new_board[2] == \\\"2\\\":\\n return 2\\n\\n # If corners are empty, play there\\n elif new_board[0] == \\\"0\\\" or new_board[2] == \\\"2\\\" or new_board[6] == \\\"6\\\" or new_board[8] == \\\"8\\\":\\n try_spot = 0\\n while True:\\n if new_board[try_spot] != \\\"X\\\" and new_board[try_spot] != \\\"O\\\":\\n return try_spot\\n else:\\n try_spot = try_spot + 2\\n\\n # If middle is empty, play there\\n elif new_board[4] == \\\"4\\\":\\n return 4\\n\\n # Finally if edges are empty try there\\n elif new_board[1] == \\\"1\\\" or new_board[3] == \\\"3\\\" or new_board[5] == \\\"5\\\" or new_board[7] == \\\"7\\\":\\n try_spot = 1\\n while True:\\n if new_board[try_spot] != \\\"X\\\" and new_board[try_spot] != \\\"O\\\":\\n return try_spot\\n else:\\n try_spot = try_spot + 2\",\n \"def next_state(s_curr, action, params):\\n P_dist = params['P_dist']\\n R = params['R']\\n n_rows = params['n_rows']\\n n_cols = params['n_cols']\\n occ_grid = params['occ_grid']\\n\\n rnd = np.random.uniform()\\n\\n s_next = s_curr\\n\\n # Actions - ['left','right','up','down']\\n\\n if rnd <= P_dist:\\n if action == 0:\\n move = 2\\n elif action == 1:\\n move = 2\\n elif action == 2:\\n move = 1\\n else:\\n move = 0\\n elif rnd < 2*P_dist:\\n if action == 0:\\n move = 3\\n elif action == 1:\\n move = 3\\n elif action == 2:\\n move = 1\\n else:\\n move = 1\\n else:\\n move = action\\n\\n # Move left\\n if move == 0:\\n row_next = s_curr[0]\\n col_next = s_curr[1] - 1\\n if col_next >= 0 and occ_grid[row_next, col_next] == 0:\\n s_next = [row_next, col_next]\\n\\n # Move right\\n if move == 1:\\n row_next = s_curr[0]\\n col_next = s_curr[1] + 1\\n if col_next < n_cols and occ_grid[row_next, col_next] == 0:\\n s_next = [row_next, col_next]\\n\\n # Move up\\n if move == 2:\\n row_next = s_curr[0] - 1\\n col_next = s_curr[1]\\n if row_next >= 0 and occ_grid[row_next, col_next] == 0:\\n s_next = [row_next, col_next]\\n\\n # Move down\\n if move == 3:\\n row_next = s_curr[0] + 1\\n col_next = s_curr[1]\\n if row_next < n_rows and occ_grid[row_next, col_next] == 0:\\n s_next = [row_next, col_next]\\n\\n r = R[s_next[0], s_next[1]]\\n return s_next, r\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.76256883","0.7569273","0.7310993","0.7211619","0.72101855","0.7194801","0.7156599","0.7146737","0.7015209","0.695439","0.6947784","0.69166005","0.68700886","0.68499726","0.68240017","0.68005484","0.6775084","0.677143","0.6759415","0.6757112","0.6747905","0.67469174","0.6725215","0.6722685","0.6694036","0.66837233","0.6666776","0.66548693","0.66170526","0.66025776","0.6575576","0.65568334","0.65539306","0.6542836","0.65365756","0.65276855","0.6522291","0.6520904","0.6507446","0.6502272","0.6499487","0.64907026","0.6489363","0.648773","0.6471291","0.6453185","0.64527863","0.64466745","0.64246523","0.641948","0.64181113","0.6416431","0.6409723","0.63979197","0.63915026","0.63831913","0.63800514","0.63698554","0.6364695","0.63605505","0.6353994","0.6347889","0.63364255","0.6335118","0.6308442","0.63058","0.630155","0.6291477","0.62749046","0.6268776","0.62664443","0.62645197","0.6260608","0.62576747","0.62552875","0.6255119","0.6244211","0.6241727","0.6236889","0.62319416","0.62109816","0.6209435","0.6207664","0.62055564","0.620226","0.6200814","0.6199905","0.6199102","0.6198061","0.61903983","0.6188637","0.6185589","0.6182482","0.61814076","0.61750054","0.6173348","0.617186","0.6169439","0.6166761","0.61640996"],"string":"[\n \"0.76256883\",\n \"0.7569273\",\n \"0.7310993\",\n \"0.7211619\",\n \"0.72101855\",\n \"0.7194801\",\n \"0.7156599\",\n \"0.7146737\",\n \"0.7015209\",\n \"0.695439\",\n \"0.6947784\",\n \"0.69166005\",\n \"0.68700886\",\n \"0.68499726\",\n \"0.68240017\",\n \"0.68005484\",\n \"0.6775084\",\n \"0.677143\",\n \"0.6759415\",\n \"0.6757112\",\n \"0.6747905\",\n \"0.67469174\",\n \"0.6725215\",\n \"0.6722685\",\n \"0.6694036\",\n \"0.66837233\",\n \"0.6666776\",\n \"0.66548693\",\n \"0.66170526\",\n \"0.66025776\",\n \"0.6575576\",\n \"0.65568334\",\n \"0.65539306\",\n \"0.6542836\",\n \"0.65365756\",\n \"0.65276855\",\n \"0.6522291\",\n \"0.6520904\",\n \"0.6507446\",\n \"0.6502272\",\n \"0.6499487\",\n \"0.64907026\",\n \"0.6489363\",\n \"0.648773\",\n \"0.6471291\",\n \"0.6453185\",\n \"0.64527863\",\n \"0.64466745\",\n \"0.64246523\",\n \"0.641948\",\n \"0.64181113\",\n \"0.6416431\",\n \"0.6409723\",\n \"0.63979197\",\n \"0.63915026\",\n \"0.63831913\",\n \"0.63800514\",\n \"0.63698554\",\n \"0.6364695\",\n \"0.63605505\",\n \"0.6353994\",\n \"0.6347889\",\n \"0.63364255\",\n \"0.6335118\",\n \"0.6308442\",\n \"0.63058\",\n \"0.630155\",\n \"0.6291477\",\n \"0.62749046\",\n \"0.6268776\",\n \"0.62664443\",\n \"0.62645197\",\n \"0.6260608\",\n \"0.62576747\",\n \"0.62552875\",\n \"0.6255119\",\n \"0.6244211\",\n \"0.6241727\",\n \"0.6236889\",\n \"0.62319416\",\n \"0.62109816\",\n \"0.6209435\",\n \"0.6207664\",\n \"0.62055564\",\n \"0.620226\",\n \"0.6200814\",\n \"0.6199905\",\n \"0.6199102\",\n \"0.6198061\",\n \"0.61903983\",\n \"0.6188637\",\n \"0.6185589\",\n \"0.6182482\",\n \"0.61814076\",\n \"0.61750054\",\n \"0.6173348\",\n \"0.617186\",\n \"0.6169439\",\n \"0.6166761\",\n \"0.61640996\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6648307"},"document_rank":{"kind":"string","value":"28"}}},{"rowIdx":94798,"cells":{"query":{"kind":"string","value":"A custom Django template tag for encoding URL query string parameters."},"document":{"kind":"string","value":"def urlparams(*_, **kwargs):\n non_empty = {k: v for k, v in kwargs.items() if v is not None}\n if non_empty:\n return '?{}'.format(urlencode(non_empty))\n return ''"},"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 url_replace(context, **kwargs):\n query = context['request'].GET.dict()\n query.update(kwargs)\n return urlencode(query)","def url_replace(context, **kwargs):\n query = context['request'].GET.dict()\n query.update(kwargs)\n return urlencode(query)","def encoded_query_str(request):\n return updated_query_str(request)","def queryparams(*args, **kwargs):\n args = dict(args)\n args.update(kwargs)\n return urllib.urlencode(args)","def _render_tag(self, tag, query_str):\n t = Template('{%% load djblets_utils %%}'\n '{%% autoescape off %%}%s{%% endautoescape %%}'\n % tag)\n\n request = HttpRequest()\n\n if query_str:\n request.GET = QueryDict(query_str)\n\n return t.render(Context({\n 'request': request,\n })).replace('&', '&')","def querystring_replace(context, **kwargs):\n # borrowed as-is from derrida codebase\n # inspired by https://stackoverflow.com/questions/2047622/how-to-paginate-django-with-other-get-variables\n\n # get a mutable copy of the current request\n querystring = context[\"request\"].GET.copy()\n # update with any parameters passed in\n # NOTE: needs to *set* fields rather than using update,\n # because QueryDict update appends to field rather than replacing\n for key, val in kwargs.items():\n querystring[key] = val\n # return urlencoded query string\n return querystring.urlencode()","def urlencode(query):\n\n if hasattr(query, 'items'):\n # mapping objects\n query = query.items()\n l = []\n for k, v in query:\n k = quote_plus(k)\n if isinstance(v, basestring):\n v = quote_plus(v)\n l.append(k + '=' + v)\n else:\n v = quote_plus(unicode(v))\n l.append(k + '=' + v)\n return '&'.join(l)","def url_replace(request, field, value):\n _dict = request.GET.copy()\n _dict[field] = value\n return _dict.urlencode()","def append_query_param(url: str, key: str, value: str) -> str:\n template = '?' in url and '{}&{}={}' or '{}?{}={}'\n return template.format(url, key, value)","def this_url_replace(context, **kwargs):\n query = context['request'].GET.dict()\n query.update(kwargs)\n return '{}?{}'.format(\n context['view'].request.META['PATH_INFO'],\n urlencode(query)\n )","def url_with_querystring(url, **kwargs):\n return url + '?' + urlencode(kwargs)","def do_urlencode(value):\n return urllib.quote(value.encode('utf8'))","def _generate_query_string(self):\n \n query_items = {}\n \n for key, val in self.__dict__.iteritems():\n if not key.startswith('_'):\n query_items[key] = val.encode('utf-8')\n \n return urllib.urlencode(query_items)","def param_replace(context, **kwargs):\n d = context['request'].GET.copy()\n for k,v in kwargs.items():\n d[k] = v\n for k in [k for k,v in d.items() if not v]:\n del d[k]\n return d.urlencode()","def add_query_param(request, key, val):\n iri = request.get_full_path()\n uri = iri_to_uri(iri)\n return escape(replace_query_param(uri, key, val))","def add_querystring(context, **kwargs):\n\n updated = context['request'].GET.copy()\n\n # have to iterate over and not use .update as it's a QueryDict not a dict\n for k, v in kwargs.items():\n updated[k] = v\n\n return '?{}'.format(updated.urlencode()) if updated else ''","def query_options_to_url(self):\n return '&'.join(['$%s=%s' % (key, value) for (key, value) in self.query_options.items()])","def modify_query_params(context, **kwargs):\n request = context['request']\n params = request.GET.copy()\n for key, value in kwargs.items():\n if value == '':\n if key in params:\n del params[key]\n else:\n params[key] = value\n return ('?' + params.urlencode()) if params else ''","def get_query_string(self):\r\n pass","def smart_encode(**kwargs):\r\n args = dict(kwargs)\r\n for k, v in args.items():\r\n if v is None:\r\n del args[k]\r\n if not args:\r\n return ''\r\n return urlencode(args)","def urlencode(self, value):\n if isinstance(value, unicode):\n value = value.encode(\"utf-8\")\n elif value is None:\n return \"\"\n\n assert isinstance(value, str)\n\n return urllib.quote_plus(value)","def urlencode(query, doseq=0):\r\n if hasattr(query, 'items'):\r\n query = query.items()\r\n\r\n return original_urlencode(\r\n [(force_str(k),\r\n [force_str(i) for i in v] if isinstance(v, (list,tuple)) else force_str(v))\r\n for k, v in query],\r\n doseq)","def updated_querystring(request, params):\n original_params = request.GET.copy()\n for key in params:\n if key in original_params:\n original_params.pop(key)\n original_params.update(params)\n return original_params.urlencode()","def updated_querystring(request, params):\n original_params = request.GET.copy()\n for key in params:\n if key in original_params:\n original_params.pop(key)\n original_params.update(params)\n return original_params.urlencode()","def updated_query_str(request, *args):\n\n return urllib.urlencode(updated_query(request, *args))","def query_string(context, add=None, remove=None):\n # Written as an inclusion tag to simplify getting the context.\n add = string_to_dict(add)\n remove = string_to_list(remove)\n params = dict(context['request'].GET.items())\n response = get_query_string(params, add, remove)\n return {'response': response}","def __str__(self):\n options = {}\n\n if self.marker:\n options['marker'] = self.marker\n\n if self.direction:\n options['direction'] = self.direction\n\n if self.limit:\n options['limit'] = self.limit\n\n if self.search:\n options['search'] = self.search\n\n return urllib.urlencode(options)","def _unicode_urlencode(params):\r\n if isinstance(params, dict):\r\n params = params.items()\r\n return urllib.parse.urlencode([(k, v.encode('utf-8') or v) for k, v in params])","def _url(path, **kwargs):\n if kwargs:\n encoded_parameters = urllib.urlencode(kwargs)\n if path.endswith('?'):\n # Trailing ? on path. Append parameters to end.\n return '%s%s' % (path, encoded_parameters)\n elif '?' in path:\n # Append additional parameters to existing query parameters.\n return '%s&%s' % (path, encoded_parameters)\n else:\n # Add query parameters to path with no query parameters.\n return '%s?%s' % (path, encoded_parameters)\n else:\n return path","def toURLEncoded(self):\n args = sorted(self.toPostArgs().items())\n return urllib.parse.urlencode(args)","def query_string(source=None, **kwargs):\n q = QueryDict('', True)\n if source:\n q.update(source)\n for k, v in kwargs.items():\n if v not in ['']:\n q.update({k: v})\n if q:\n return \"{}\".format('?' + q.urlencode())\n return q.urlencode()","def aws_urlquote(value):\n if isinstance(value, unicode):\n value = value.encode(\"utf-8\")\n return quote(value, \"/\")","def create_query_sting(param_dict):\n params = \"&\".join([f\"{key}={value}\" for key, value in param_dict.items()])\n return params.replace(\"#\", \"%23\")","def get_url(**kwargs):\r\n valid_kwargs = {key: value.encode('utf-8') for key, value in kwargs.iteritems() if value is not None}\r\n return u'{0}?{1}'.format(_url, urlencode(valid_kwargs))","def reverse_add_get_parameters(url_name, *args, **kwargs):\n from django.core.urlresolvers import reverse \n import urllib\n url = reverse(url_name, args = args)\n params = urllib.parse.urlencode(kwargs)\n return url + \"?%s\" % params","def encode_parameters(self, text):\n return quote_plus(text, safe='=:&\"')","def test_additional_query_args():\n assert (normalize_url(\"http://example.com?c=d\", [(\"a\", \"b\")]) ==\n \"http://example.com/?a=b&c=d\")\n assert (normalize_url(\"http://example.com\", [(\"a\", \"b\")]) ==\n \"http://example.com/?a=b\")\n assert (normalize_url(\"http://example.com\", [(\"résumé\", \"résumé\")]) ==\n \"http://example.com/?r%C3%A9sum%C3%A9=r%C3%A9sum%C3%A9\")","def url_escape(value, plus=True):\r\n quote = urllib_parse.quote_plus if plus else urllib_parse.quote\r\n return quote(utf8(value))","def urlencode_s(query_params, allow_func=None):\n return \"&\".join([k + \"=\" + v for k, v in\n urlencode_sl(query_params, allow_func=allow_func)])","def querystring(data, exclude=(), **kwargs):\n items = reduce(operator.add, (\n list((k, v) for v in values)\n for k, values in data.lists() if k not in exclude\n ), [])\n\n for key, value in kwargs.items():\n items.append((key, force_text(value)))\n\n return urlencode(sorted(items))","def add_parameters_to_url(path, **kwargs):\n return path + \"?\" + urllib.urlencode(kwargs)","def urlencode(query, doseq=False):\n if isinstance(query, MultiValueDict):\n query = query.lists()\n elif hasattr(query, \"items\"):\n query = query.items()\n query_params = []\n for key, value in query:\n if value is None:\n raise TypeError(\n \"Cannot encode None for key '%s' in a query string. Did you \"\n \"mean to pass an empty string or omit the value?\" % key\n )\n elif not doseq or isinstance(value, (str, bytes)):\n query_val = value\n else:\n try:\n itr = iter(value)\n except TypeError:\n query_val = value\n else:\n # Consume generators and iterators, when doseq=True, to\n # work around https://bugs.python.org/issue31706.\n query_val = []\n for item in itr:\n if item is None:\n raise TypeError(\n \"Cannot encode None for key '%s' in a query \"\n \"string. Did you mean to pass an empty string or \"\n \"omit the value?\" % key\n )\n elif not isinstance(item, bytes):\n item = str(item)\n query_val.append(item)\n query_params.append((key, query_val))\n return original_urlencode(query_params, doseq)","def _url_encode(self, text):\n try:\n return (urllib.quote(text.replace(u'and', u'&'), safe='')\n .replace(u'%20', u'+'))\n except:\n print('Using python3')\n return (urllib.parse.quote(text.replace(u'and', u'&'), safe='')\n .replace(u'%20', u'+'))","def to_url(request):\r\n scheme, netloc, path, query, fragment = urlsplit(to_utf8(request.url))\r\n query = parse_qs(query)\r\n\r\n for key, value in request.data_and_params.iteritems():\r\n query.setdefault(key, []).append(value)\r\n\r\n query = urllib.urlencode(query, True)\r\n return urlunsplit((scheme, netloc, path, query, fragment))","def unicode_urlencode(params):\n if isinstance(params, dict):\n params = params.items()\n return urlencode([(k, isinstance(v, unicode) and v.encode('utf-8') or v)\n for k, v in params])","def composeQueryUrl(self, params):\n\t\ttextparams = urllib.urlencode(params)\n\t\treturn self.api_url + \"?\" + textparams","def _other_page_querystring(self, page_number):\n if self.paginator.request:\n self.base_queryset['page'] = page_number\n return self.base_queryset.urlencode()\n\n # raise Warning(\"You must supply Paginator() with the request object for a proper querystring.\")\n return 'page=%s' % page_number","def bob_export_url(query, value, export_variable_name='export'):\n if not query:\n return '%s=%s' % (export_variable_name, value)\n query = query.copy()\n if value:\n query[export_variable_name] = value\n else:\n try:\n del query[export_variable_name]\n except KeyError:\n pass\n return query.urlencode()","def fixup_parameters(url, backend):\n result = url\n if backend == \"django\":\n result = url.replace(\"{\", \"(?P<\").replace(\"}\", \">.+)\")\n\n return result","def _get_query_part(params: dict) -> str:\n params_cleaned = {k: v for k, v in params.items() if v is not None}\n return ('?' + urlencode(params_cleaned, quote_via=quote, safe=\"/,\")) if params_cleaned else \"\"","def _prepare_params(self, params):\n if isinstance(params, six.string_types):\n return params\n return urllib.urlencode(params)","def unicode_urlencode(self, params):\n if isinstance(params, dict):\n params = params.items()\n for i, param in enumerate(params):\n if isinstance(param[1], list):\n params[i] = (param[0], json.dumps(param[1]),)\n\n return urllib.urlencode(\n [(k, isinstance(v, unicode) and v.encode('utf-8') or v) for k, v in params]\n )","def bob_sort_url(query, field, sort_variable_name, type):\n query = query.copy()\n if type == 'desc':\n query[sort_variable_name] = '-' + field\n elif type == 'asc':\n query[sort_variable_name] = field\n return query.urlencode()","def _url(path, **kwargs):\n if kwargs:\n if isinstance(kwargs.get('owner'), users.User):\n kwargs['owner'] = kwargs['owner'].email()\n encoded_parameters = urllib.urlencode(kwargs)\n if path.endswith('?'):\n # Trailing ? on path. Append parameters to end.\n return '%s%s' % (path, encoded_parameters)\n elif '?' in path:\n # Append additional parameters to existing query parameters.\n return '%s&%s' % (path, encoded_parameters)\n else:\n # Add query parameters to path with no query parameters.\n return '%s?%s' % (path, encoded_parameters)\n else:\n return path","def _unicode_urlencode(params):\n if isinstance(params, dict):\n params = list(params.items())\n for i, param in enumerate(params):\n if isinstance(param[1], list):\n params[i] = (param[0], json.dumps(param[1]),)\n\n result = urllib.parse.urlencode([(k, isinstance(v, str) and v.encode('utf-8') or v) for k, v in params])\n return result","def unicode_urlencode(self, params):\n if isinstance(params, dict):\n params = params.items()\n for i, param in enumerate(params):\n if isinstance(param[1] , list):\n params[i] = (param[0], json.dumps(param[1]),)\n\n if maj_ver == 2:\n return urllib.urlencode(\n [(k, isinstance(v, unicode) and v.encode('utf-8') or v) for k, v in params]\n )\n\n if maj_ver == 3:\n return urllib.parse.urlencode(\n [(k, isinstance(v, str) and v.encode('utf-8') or v) for k, v in params]\n )\n\n return","def test_percent_encode_querystring():\n assert (normalize_url(\"http://example.com/?a=hello{}\") ==\n \"http://example.com/?a=hello%7B%7D\")","def append_to_query_string(url, key, value) -> str:\n url = list(urlparse(url))\n query = dict(parse_qsl(url[4]))\n query[key] = value\n url[4] = '&'.join(f'{p}={v}' for p, v in query.items())\n\n return urlunparse(url)","def _FormatUrlParams(self, params):\n param_fragments = []\n for param in sorted(params.iteritems(), key=lambda x: x[0]):\n param_fragments.append('%s=%s' % (param[0], self._UrlEscape(param[1])))\n\n return '&'.join(param_fragments)","def unicode_urlencode(self, params):\n if isinstance(params , dict):\n params = params.items()\n for i, param in enumerate(params):\n if isinstance(param[1] , list):\n params[i] = (param[0], json.dumps(param[1]),)\n\n if maj_ver == 2:\n return urllib.urlencode(\n [(k , isinstance(v, unicode) and v.encode('utf-8') or v) for k, v in params]\n )\n\n if maj_ver == 3:\n return urllib.parse.urlencode(\n [(k, isinstance(v, str) and v.encode('utf-8') or v) for k, v in params]\n )\n\n return","def test_append_with_basic_usage(self):\n rendered_result = self._render_tag(\n tag='{% querystring \"append\" \"foo=baz\" %}',\n query_str='foo=foo&bar=bar')\n\n self.assertTrue(rendered_result.startswith('?'))\n self.assertEqual(QueryDict(rendered_result[1:]),\n QueryDict('foo=foo&foo=baz&bar=bar'))","def toQueryString(self):\n return self.__str__()","def test_update_with_querystring_key_overide(self):\n rendered_result = self._render_tag(\n tag='{% querystring \"update\" \"a=1\" \"a=2\" %}',\n query_str='foo=foo')\n\n self.assertTrue(rendered_result.startswith('?'))\n self.assertEqual(QueryDict(rendered_result[1:]),\n QueryDict('foo=foo&a=2'))","def construct_url(self):\n path = [self.path]\n path.extend([str(x) for x in self.params])\n\n url = self.client.base_url + '/'.join(x for x in path if x)\n query = self.kwargs.get('query')\n\n if query:\n # Dict -> List\n if type(query) is dict:\n query = query.items()\n\n # Remove items with `None` value\n query = [\n (k, v) for (k, v) in query\n if v is not None\n ]\n\n # Encode query, append to URL\n url += '?' + urlencode(query)\n\n return url","def FormatUrl(params):\n input_list = []\n for item in sorted(params.iteritems(), key=lambda x: x[0]):\n input_list.append('%s=%s' % (item[0], UrlEscape(item[1])))\n return '&'.join(input_list)","def __str__(self):\r\n self.query = urllib.urlencode(self.args)\r\n self.query = urllib.unquote(self.query)\r\n return urlparse.urlunparse((self.scheme, self.netloc, self.path, self.params, self.query, self.fragment))","def querystring(parser, token):\r\n bits = token.split_contents()\r\n tag = bits.pop(0)\r\n updates = token_kwargs(bits, parser)\r\n # ``bits`` should now be empty of a=b pairs, it should either be empty, or\r\n # have ``without`` arguments.\r\n if bits and bits.pop(0) != \"without\":\r\n raise TemplateSyntaxError(\"Malformed arguments to '%s'\" % tag)\r\n removals = [parser.compile_filter(bit) for bit in bits]\r\n return QuerystringNode(updates, removals)","def _encode_url(data: str) -> str:\n return urllib.parse.quote(data, safe=\"\")","def _extend_url(self, url, params):\n # filter out None parameters\n params = {k:v for k,v in params.items() if v is not None}\n for key in params:\n url = url + \"&{}={}\".format(key, params[key])\n return url","def redirect_add_get_parameters(url_name, *args, **kwargs):\n from django.urls import reverse \n from django.http import HttpResponseRedirect\n import urllib\n url = reverse(url_name, args = args)\n params = urllib.parse.urlencode(kwargs)\n return HttpResponseRedirect(url + \"?%s\" % params)","def replace_query_params(cls, url: str, **params: Mapping[str, str]) -> str:\n url, _ = cls.separate_query_params(url, params.keys())\n return cls.add_query_params(url, **params)","def _encode_query_value(text, maximal=True):\n if maximal:\n bytestr = normalize('NFC', text).encode('utf8')\n return u''.join([_QUERY_VALUE_QUOTE_MAP[b] for b in bytestr])\n return u''.join([_QUERY_VALUE_QUOTE_MAP[t]\n if t in _QUERY_VALUE_DELIMS else t for t in text])","def urlencode_sl(query_params, allow_func=None):\n query_params = query_params or {}\n encoded_pairs = []\n for k, v in query_params.items():\n # Keys are also percent-encoded according to OAuth spec.\n k = percent_encode(unicode_to_utf8(k))\n if allow_func and not allow_func(k, v):\n continue\n elif is_bytes_or_unicode(v):\n encoded_pairs.append((k, percent_encode(v),))\n else:\n if is_sequence(v):\n # Loop over the sequence.\n if len(v) > 0:\n for i in v:\n encoded_pairs.append((k, percent_encode(i), ))\n # ``urllib.urlencode()`` doesn't preserve blank lists.\n # Therefore, we're discarding them.\n #else:\n # # Preserve blank list values.\n # encoded_pairs.append((k, \"\", ))\n else:\n encoded_pairs.append((k, percent_encode(v),))\n # Sort after encoding according to the OAuth spec.\n return sorted(encoded_pairs)","def url_with_query_str(url, *args, **kwargs):\n if len(args):\n d = args[0]\n elif len(kwargs):\n d = kwargs\n else:\n raise Exception('not found dict')\n if any(\"%\" in k for k in d.keys()):\n query = \"&\".join([\"{}={}\".format(k, v) for k, v in d.items()])\n else:\n query = urlencode(d)\n url = url.split('?')[0]\n return \"{}?{}\".format(url, query)","def test_append_with_multiple_values_and_same_key(self):\n rendered_result = self._render_tag(\n tag='{% querystring \"append\" \"a=1&a=2&a=3\" %}',\n query_str='a=0&&b=2&c=3')\n\n self.assertTrue(rendered_result.startswith('?'))\n self.assertEqual(QueryDict(rendered_result[1:]),\n QueryDict('a=0&a=1&a=2&a=3&b=2&c=3'))","def url_filter(val):\n if isinstance(val, Undefined):\n return UNDEFINED_LABEL\n return quote(str(val))","def encode(self, url):\n\n # Escape ()\n return url.replace(\"(\", \"%28\").replace(\")\", \"%29\") if url else url","def make_url(params, add_plugin_path=True):\r\n pairs = []\r\n for k, v in params.items():\r\n k = urllib.parse.quote_plus(str(k))\r\n v = urllib.parse.quote_plus(str(v))\r\n pairs.append(\"%s=%s\" % (k, v))\r\n params_str = \"&\".join(pairs)\r\n if add_plugin_path:\r\n return \"%s?%s\" % (sys.argv[0], params_str)\r\n return params_str","def url(self, **kwargs) -> str:\n return self._pattern.format(**kwargs)","def modify_query(**values):\n args = request.args.copy()\n\n for attr, new_value in values.items():\n if new_value is not None:\n args[attr] = new_value\n elif attr in args:\n del args[attr]\n\n if args:\n return request.base_url + \"?\" + url_encode(args)\n else:\n return request.base_url","def add_query_params(url: str, additional_params: dict) -> str:\n url_components = urlparse(url)\n original_params = parse_qs(url_components.query)\n # Before Python 3.5 you could update original_params with\n # additional_params, but here all the variables are immutable.\n merged_params = {**original_params, **additional_params}\n updated_query = urlencode(merged_params, doseq=True)\n # _replace() is how you can create a new NamedTuple with a changed field\n return url_components._replace(query=updated_query).geturl()","def url(self):\n return url_search_posts(self.parameters, url_domain=self.url_domain)","def get_querystring_for_page(request, page_number, querystring_key,\n default_number=1, prefix=\"?\"):\n querydict = request.GET.copy()\n querydict[querystring_key] = page_number\n # for page number 1 there is no need for querystring\n if page_number == default_number:\n del querydict[querystring_key]\n if \"querystring_key\" in querydict:\n del querydict[\"querystring_key\"]\n if querydict:\n return \"%s%s\" % (prefix, querydict.urlencode())\n return \"\"","def urlQuote(string):\r\n return quote(string.encode(\"utf-8\"))","def _create_query_str(data):\n params = []\n for name, value in data.items():\n params.append(name + '=' + str(value))\n\n return '?' + '&'.join(params)","def safe_urlencode(params, doseq=0):\n if IS_PY3:\n return urlencode(params, doseq)\n\n if hasattr(params, \"items\"):\n params = params.items()\n\n new_params = []\n\n for k, v in params:\n k = k.encode(\"utf-8\")\n\n if isinstance(v, (list, tuple)):\n new_params.append((k, [force_bytes(i) for i in v]))\n else:\n new_params.append((k, force_bytes(v)))\n\n return urlencode(new_params, doseq)","def url(self, suffix: str, *, version: Optional[str] = None,\n query: Union[None, dict, MultiValueDict] = None,\n **kwargs: Any) -> str:\n name = self.url_name_format.format(\n version=version,\n app_label=self.app_label,\n basename=self.basename,\n suffix=suffix,\n )\n url = reverse(name, kwargs=kwargs)\n\n # support multiple values for same param: \"id=1&id=2&id=3\"\n if isinstance(query, MultiValueDict):\n params = []\n for key, value in query.lists():\n if isinstance(value, list):\n params.append('&'.join([f'{key}={x}' for x in value]))\n else:\n params.append(f'{key}={value}')\n\n url += f\"?{'&'.join(params)}\"\n elif query:\n # simple dict query params\n url += '?%s' % urlencode(query)\n return url","def _encode_url(full_url):\n return urllib.parse.quote(full_url, safe=\"%/:=&?~#+!$,;'@()*[]|\")","def append_query_params(original_url, **kwargs):\n scheme, netloc, path, query_string, fragment = urlsplit(original_url)\n query_params = parse_qs(query_string)\n if kwargs is not None:\n for key, value in kwargs.items():\n query_params[key] = [value]\n\n new_query_string = urlencode(query_params, doseq=True)\n new_url = urlunsplit((scheme, netloc, path, new_query_string, fragment))\n return new_url","def append_query_params(original_url, **kwargs):\n scheme, netloc, path, query_string, fragment = urlsplit(original_url)\n query_params = parse_qs(query_string)\n if kwargs is not None:\n for key, value in kwargs.items():\n query_params[key] = [value]\n\n new_query_string = urlencode(query_params, doseq=True)\n new_url = urlunsplit((scheme, netloc, path, new_query_string, fragment))\n return new_url","def test_append_with_multiple_values_and_same_key_seperated(self):\n rendered_result = self._render_tag(\n tag='{% querystring \"append\" \"a=1\" \"a=2\" \"a=3\" %}',\n query_str='a=0&&b=2&c=3')\n\n self.assertTrue(rendered_result.startswith('?'))\n self.assertEqual(QueryDict(rendered_result[1:]),\n QueryDict('a=0&a=1&a=2&a=3&b=2&c=3'))","def _build_url_exact(self, q: str, **kwargs: Dict) -> str:\n url = f\"{self._URL}?where=\"\n if kwargs.get('doi'):\n input_doi = kwargs.get('doi')\n url += f'''{{\"doi\":\"{input_doi}\"}}'''\n return url","def t(param):\n return '<' + param + '>'","def encodeToURL(self):\n return self.fields.toURL(self.request.return_to)","def test_append_with_new_key(self):\n rendered_result = self._render_tag(\n tag='{% querystring \"append\" \"d=4\" %}',\n query_str='a=1&b=2&c=3')\n\n self.assertTrue(rendered_result.startswith('?'))\n self.assertEqual(QueryDict(rendered_result[1:]),\n QueryDict('a=1&b=2&c=3&d=4'))","def html_quote(v):\n if v is None:\n return ''\n return cgi.escape(str(v), 1)","def _override_tourl(self):\n base_url = urlparse.urlparse(self.url)\n try:\n query = base_url.query\n except AttributeError:\n # must be python <2.5\n query = base_url[4]\n query = parse_qs(query)\n for k, v in self.items():\n query.setdefault(k, []).append(v)\n\n try:\n scheme = base_url.scheme\n netloc = base_url.netloc\n path = base_url.path\n params = base_url.params\n fragment = base_url.fragment\n except AttributeError:\n # must be python <2.5\n scheme = base_url[0]\n netloc = base_url[1]\n path = base_url[2]\n params = base_url[3]\n fragment = base_url[5]\n\n url = (scheme, netloc, path, params,\n urllib.urlencode(query, True), fragment)\n return urlparse.urlunparse(url)","def make_query_string(query, params):\n query_string = query\n\n index = 1\n for param in params:\n if param:\n to_replace = \"%%param%d%%\" % index\n query_string = query_string.replace(to_replace, param)\n index += 1\n\n return query_string","def urlsafe(self):\n return urllib.quote(self.normalized())","def b2_url_encode(s):\n return quote(s.encode('utf-8'))"],"string":"[\n \"def url_replace(context, **kwargs):\\n query = context['request'].GET.dict()\\n query.update(kwargs)\\n return urlencode(query)\",\n \"def url_replace(context, **kwargs):\\n query = context['request'].GET.dict()\\n query.update(kwargs)\\n return urlencode(query)\",\n \"def encoded_query_str(request):\\n return updated_query_str(request)\",\n \"def queryparams(*args, **kwargs):\\n args = dict(args)\\n args.update(kwargs)\\n return urllib.urlencode(args)\",\n \"def _render_tag(self, tag, query_str):\\n t = Template('{%% load djblets_utils %%}'\\n '{%% autoescape off %%}%s{%% endautoescape %%}'\\n % tag)\\n\\n request = HttpRequest()\\n\\n if query_str:\\n request.GET = QueryDict(query_str)\\n\\n return t.render(Context({\\n 'request': request,\\n })).replace('&', '&')\",\n \"def querystring_replace(context, **kwargs):\\n # borrowed as-is from derrida codebase\\n # inspired by https://stackoverflow.com/questions/2047622/how-to-paginate-django-with-other-get-variables\\n\\n # get a mutable copy of the current request\\n querystring = context[\\\"request\\\"].GET.copy()\\n # update with any parameters passed in\\n # NOTE: needs to *set* fields rather than using update,\\n # because QueryDict update appends to field rather than replacing\\n for key, val in kwargs.items():\\n querystring[key] = val\\n # return urlencoded query string\\n return querystring.urlencode()\",\n \"def urlencode(query):\\n\\n if hasattr(query, 'items'):\\n # mapping objects\\n query = query.items()\\n l = []\\n for k, v in query:\\n k = quote_plus(k)\\n if isinstance(v, basestring):\\n v = quote_plus(v)\\n l.append(k + '=' + v)\\n else:\\n v = quote_plus(unicode(v))\\n l.append(k + '=' + v)\\n return '&'.join(l)\",\n \"def url_replace(request, field, value):\\n _dict = request.GET.copy()\\n _dict[field] = value\\n return _dict.urlencode()\",\n \"def append_query_param(url: str, key: str, value: str) -> str:\\n template = '?' in url and '{}&{}={}' or '{}?{}={}'\\n return template.format(url, key, value)\",\n \"def this_url_replace(context, **kwargs):\\n query = context['request'].GET.dict()\\n query.update(kwargs)\\n return '{}?{}'.format(\\n context['view'].request.META['PATH_INFO'],\\n urlencode(query)\\n )\",\n \"def url_with_querystring(url, **kwargs):\\n return url + '?' + urlencode(kwargs)\",\n \"def do_urlencode(value):\\n return urllib.quote(value.encode('utf8'))\",\n \"def _generate_query_string(self):\\n \\n query_items = {}\\n \\n for key, val in self.__dict__.iteritems():\\n if not key.startswith('_'):\\n query_items[key] = val.encode('utf-8')\\n \\n return urllib.urlencode(query_items)\",\n \"def param_replace(context, **kwargs):\\n d = context['request'].GET.copy()\\n for k,v in kwargs.items():\\n d[k] = v\\n for k in [k for k,v in d.items() if not v]:\\n del d[k]\\n return d.urlencode()\",\n \"def add_query_param(request, key, val):\\n iri = request.get_full_path()\\n uri = iri_to_uri(iri)\\n return escape(replace_query_param(uri, key, val))\",\n \"def add_querystring(context, **kwargs):\\n\\n updated = context['request'].GET.copy()\\n\\n # have to iterate over and not use .update as it's a QueryDict not a dict\\n for k, v in kwargs.items():\\n updated[k] = v\\n\\n return '?{}'.format(updated.urlencode()) if updated else ''\",\n \"def query_options_to_url(self):\\n return '&'.join(['$%s=%s' % (key, value) for (key, value) in self.query_options.items()])\",\n \"def modify_query_params(context, **kwargs):\\n request = context['request']\\n params = request.GET.copy()\\n for key, value in kwargs.items():\\n if value == '':\\n if key in params:\\n del params[key]\\n else:\\n params[key] = value\\n return ('?' + params.urlencode()) if params else ''\",\n \"def get_query_string(self):\\r\\n pass\",\n \"def smart_encode(**kwargs):\\r\\n args = dict(kwargs)\\r\\n for k, v in args.items():\\r\\n if v is None:\\r\\n del args[k]\\r\\n if not args:\\r\\n return ''\\r\\n return urlencode(args)\",\n \"def urlencode(self, value):\\n if isinstance(value, unicode):\\n value = value.encode(\\\"utf-8\\\")\\n elif value is None:\\n return \\\"\\\"\\n\\n assert isinstance(value, str)\\n\\n return urllib.quote_plus(value)\",\n \"def urlencode(query, doseq=0):\\r\\n if hasattr(query, 'items'):\\r\\n query = query.items()\\r\\n\\r\\n return original_urlencode(\\r\\n [(force_str(k),\\r\\n [force_str(i) for i in v] if isinstance(v, (list,tuple)) else force_str(v))\\r\\n for k, v in query],\\r\\n doseq)\",\n \"def updated_querystring(request, params):\\n original_params = request.GET.copy()\\n for key in params:\\n if key in original_params:\\n original_params.pop(key)\\n original_params.update(params)\\n return original_params.urlencode()\",\n \"def updated_querystring(request, params):\\n original_params = request.GET.copy()\\n for key in params:\\n if key in original_params:\\n original_params.pop(key)\\n original_params.update(params)\\n return original_params.urlencode()\",\n \"def updated_query_str(request, *args):\\n\\n return urllib.urlencode(updated_query(request, *args))\",\n \"def query_string(context, add=None, remove=None):\\n # Written as an inclusion tag to simplify getting the context.\\n add = string_to_dict(add)\\n remove = string_to_list(remove)\\n params = dict(context['request'].GET.items())\\n response = get_query_string(params, add, remove)\\n return {'response': response}\",\n \"def __str__(self):\\n options = {}\\n\\n if self.marker:\\n options['marker'] = self.marker\\n\\n if self.direction:\\n options['direction'] = self.direction\\n\\n if self.limit:\\n options['limit'] = self.limit\\n\\n if self.search:\\n options['search'] = self.search\\n\\n return urllib.urlencode(options)\",\n \"def _unicode_urlencode(params):\\r\\n if isinstance(params, dict):\\r\\n params = params.items()\\r\\n return urllib.parse.urlencode([(k, v.encode('utf-8') or v) for k, v in params])\",\n \"def _url(path, **kwargs):\\n if kwargs:\\n encoded_parameters = urllib.urlencode(kwargs)\\n if path.endswith('?'):\\n # Trailing ? on path. Append parameters to end.\\n return '%s%s' % (path, encoded_parameters)\\n elif '?' in path:\\n # Append additional parameters to existing query parameters.\\n return '%s&%s' % (path, encoded_parameters)\\n else:\\n # Add query parameters to path with no query parameters.\\n return '%s?%s' % (path, encoded_parameters)\\n else:\\n return path\",\n \"def toURLEncoded(self):\\n args = sorted(self.toPostArgs().items())\\n return urllib.parse.urlencode(args)\",\n \"def query_string(source=None, **kwargs):\\n q = QueryDict('', True)\\n if source:\\n q.update(source)\\n for k, v in kwargs.items():\\n if v not in ['']:\\n q.update({k: v})\\n if q:\\n return \\\"{}\\\".format('?' + q.urlencode())\\n return q.urlencode()\",\n \"def aws_urlquote(value):\\n if isinstance(value, unicode):\\n value = value.encode(\\\"utf-8\\\")\\n return quote(value, \\\"/\\\")\",\n \"def create_query_sting(param_dict):\\n params = \\\"&\\\".join([f\\\"{key}={value}\\\" for key, value in param_dict.items()])\\n return params.replace(\\\"#\\\", \\\"%23\\\")\",\n \"def get_url(**kwargs):\\r\\n valid_kwargs = {key: value.encode('utf-8') for key, value in kwargs.iteritems() if value is not None}\\r\\n return u'{0}?{1}'.format(_url, urlencode(valid_kwargs))\",\n \"def reverse_add_get_parameters(url_name, *args, **kwargs):\\n from django.core.urlresolvers import reverse \\n import urllib\\n url = reverse(url_name, args = args)\\n params = urllib.parse.urlencode(kwargs)\\n return url + \\\"?%s\\\" % params\",\n \"def encode_parameters(self, text):\\n return quote_plus(text, safe='=:&\\\"')\",\n \"def test_additional_query_args():\\n assert (normalize_url(\\\"http://example.com?c=d\\\", [(\\\"a\\\", \\\"b\\\")]) ==\\n \\\"http://example.com/?a=b&c=d\\\")\\n assert (normalize_url(\\\"http://example.com\\\", [(\\\"a\\\", \\\"b\\\")]) ==\\n \\\"http://example.com/?a=b\\\")\\n assert (normalize_url(\\\"http://example.com\\\", [(\\\"résumé\\\", \\\"résumé\\\")]) ==\\n \\\"http://example.com/?r%C3%A9sum%C3%A9=r%C3%A9sum%C3%A9\\\")\",\n \"def url_escape(value, plus=True):\\r\\n quote = urllib_parse.quote_plus if plus else urllib_parse.quote\\r\\n return quote(utf8(value))\",\n \"def urlencode_s(query_params, allow_func=None):\\n return \\\"&\\\".join([k + \\\"=\\\" + v for k, v in\\n urlencode_sl(query_params, allow_func=allow_func)])\",\n \"def querystring(data, exclude=(), **kwargs):\\n items = reduce(operator.add, (\\n list((k, v) for v in values)\\n for k, values in data.lists() if k not in exclude\\n ), [])\\n\\n for key, value in kwargs.items():\\n items.append((key, force_text(value)))\\n\\n return urlencode(sorted(items))\",\n \"def add_parameters_to_url(path, **kwargs):\\n return path + \\\"?\\\" + urllib.urlencode(kwargs)\",\n \"def urlencode(query, doseq=False):\\n if isinstance(query, MultiValueDict):\\n query = query.lists()\\n elif hasattr(query, \\\"items\\\"):\\n query = query.items()\\n query_params = []\\n for key, value in query:\\n if value is None:\\n raise TypeError(\\n \\\"Cannot encode None for key '%s' in a query string. Did you \\\"\\n \\\"mean to pass an empty string or omit the value?\\\" % key\\n )\\n elif not doseq or isinstance(value, (str, bytes)):\\n query_val = value\\n else:\\n try:\\n itr = iter(value)\\n except TypeError:\\n query_val = value\\n else:\\n # Consume generators and iterators, when doseq=True, to\\n # work around https://bugs.python.org/issue31706.\\n query_val = []\\n for item in itr:\\n if item is None:\\n raise TypeError(\\n \\\"Cannot encode None for key '%s' in a query \\\"\\n \\\"string. Did you mean to pass an empty string or \\\"\\n \\\"omit the value?\\\" % key\\n )\\n elif not isinstance(item, bytes):\\n item = str(item)\\n query_val.append(item)\\n query_params.append((key, query_val))\\n return original_urlencode(query_params, doseq)\",\n \"def _url_encode(self, text):\\n try:\\n return (urllib.quote(text.replace(u'and', u'&'), safe='')\\n .replace(u'%20', u'+'))\\n except:\\n print('Using python3')\\n return (urllib.parse.quote(text.replace(u'and', u'&'), safe='')\\n .replace(u'%20', u'+'))\",\n \"def to_url(request):\\r\\n scheme, netloc, path, query, fragment = urlsplit(to_utf8(request.url))\\r\\n query = parse_qs(query)\\r\\n\\r\\n for key, value in request.data_and_params.iteritems():\\r\\n query.setdefault(key, []).append(value)\\r\\n\\r\\n query = urllib.urlencode(query, True)\\r\\n return urlunsplit((scheme, netloc, path, query, fragment))\",\n \"def unicode_urlencode(params):\\n if isinstance(params, dict):\\n params = params.items()\\n return urlencode([(k, isinstance(v, unicode) and v.encode('utf-8') or v)\\n for k, v in params])\",\n \"def composeQueryUrl(self, params):\\n\\t\\ttextparams = urllib.urlencode(params)\\n\\t\\treturn self.api_url + \\\"?\\\" + textparams\",\n \"def _other_page_querystring(self, page_number):\\n if self.paginator.request:\\n self.base_queryset['page'] = page_number\\n return self.base_queryset.urlencode()\\n\\n # raise Warning(\\\"You must supply Paginator() with the request object for a proper querystring.\\\")\\n return 'page=%s' % page_number\",\n \"def bob_export_url(query, value, export_variable_name='export'):\\n if not query:\\n return '%s=%s' % (export_variable_name, value)\\n query = query.copy()\\n if value:\\n query[export_variable_name] = value\\n else:\\n try:\\n del query[export_variable_name]\\n except KeyError:\\n pass\\n return query.urlencode()\",\n \"def fixup_parameters(url, backend):\\n result = url\\n if backend == \\\"django\\\":\\n result = url.replace(\\\"{\\\", \\\"(?P<\\\").replace(\\\"}\\\", \\\">.+)\\\")\\n\\n return result\",\n \"def _get_query_part(params: dict) -> str:\\n params_cleaned = {k: v for k, v in params.items() if v is not None}\\n return ('?' + urlencode(params_cleaned, quote_via=quote, safe=\\\"/,\\\")) if params_cleaned else \\\"\\\"\",\n \"def _prepare_params(self, params):\\n if isinstance(params, six.string_types):\\n return params\\n return urllib.urlencode(params)\",\n \"def unicode_urlencode(self, params):\\n if isinstance(params, dict):\\n params = params.items()\\n for i, param in enumerate(params):\\n if isinstance(param[1], list):\\n params[i] = (param[0], json.dumps(param[1]),)\\n\\n return urllib.urlencode(\\n [(k, isinstance(v, unicode) and v.encode('utf-8') or v) for k, v in params]\\n )\",\n \"def bob_sort_url(query, field, sort_variable_name, type):\\n query = query.copy()\\n if type == 'desc':\\n query[sort_variable_name] = '-' + field\\n elif type == 'asc':\\n query[sort_variable_name] = field\\n return query.urlencode()\",\n \"def _url(path, **kwargs):\\n if kwargs:\\n if isinstance(kwargs.get('owner'), users.User):\\n kwargs['owner'] = kwargs['owner'].email()\\n encoded_parameters = urllib.urlencode(kwargs)\\n if path.endswith('?'):\\n # Trailing ? on path. Append parameters to end.\\n return '%s%s' % (path, encoded_parameters)\\n elif '?' in path:\\n # Append additional parameters to existing query parameters.\\n return '%s&%s' % (path, encoded_parameters)\\n else:\\n # Add query parameters to path with no query parameters.\\n return '%s?%s' % (path, encoded_parameters)\\n else:\\n return path\",\n \"def _unicode_urlencode(params):\\n if isinstance(params, dict):\\n params = list(params.items())\\n for i, param in enumerate(params):\\n if isinstance(param[1], list):\\n params[i] = (param[0], json.dumps(param[1]),)\\n\\n result = urllib.parse.urlencode([(k, isinstance(v, str) and v.encode('utf-8') or v) for k, v in params])\\n return result\",\n \"def unicode_urlencode(self, params):\\n if isinstance(params, dict):\\n params = params.items()\\n for i, param in enumerate(params):\\n if isinstance(param[1] , list):\\n params[i] = (param[0], json.dumps(param[1]),)\\n\\n if maj_ver == 2:\\n return urllib.urlencode(\\n [(k, isinstance(v, unicode) and v.encode('utf-8') or v) for k, v in params]\\n )\\n\\n if maj_ver == 3:\\n return urllib.parse.urlencode(\\n [(k, isinstance(v, str) and v.encode('utf-8') or v) for k, v in params]\\n )\\n\\n return\",\n \"def test_percent_encode_querystring():\\n assert (normalize_url(\\\"http://example.com/?a=hello{}\\\") ==\\n \\\"http://example.com/?a=hello%7B%7D\\\")\",\n \"def append_to_query_string(url, key, value) -> str:\\n url = list(urlparse(url))\\n query = dict(parse_qsl(url[4]))\\n query[key] = value\\n url[4] = '&'.join(f'{p}={v}' for p, v in query.items())\\n\\n return urlunparse(url)\",\n \"def _FormatUrlParams(self, params):\\n param_fragments = []\\n for param in sorted(params.iteritems(), key=lambda x: x[0]):\\n param_fragments.append('%s=%s' % (param[0], self._UrlEscape(param[1])))\\n\\n return '&'.join(param_fragments)\",\n \"def unicode_urlencode(self, params):\\n if isinstance(params , dict):\\n params = params.items()\\n for i, param in enumerate(params):\\n if isinstance(param[1] , list):\\n params[i] = (param[0], json.dumps(param[1]),)\\n\\n if maj_ver == 2:\\n return urllib.urlencode(\\n [(k , isinstance(v, unicode) and v.encode('utf-8') or v) for k, v in params]\\n )\\n\\n if maj_ver == 3:\\n return urllib.parse.urlencode(\\n [(k, isinstance(v, str) and v.encode('utf-8') or v) for k, v in params]\\n )\\n\\n return\",\n \"def test_append_with_basic_usage(self):\\n rendered_result = self._render_tag(\\n tag='{% querystring \\\"append\\\" \\\"foo=baz\\\" %}',\\n query_str='foo=foo&bar=bar')\\n\\n self.assertTrue(rendered_result.startswith('?'))\\n self.assertEqual(QueryDict(rendered_result[1:]),\\n QueryDict('foo=foo&foo=baz&bar=bar'))\",\n \"def toQueryString(self):\\n return self.__str__()\",\n \"def test_update_with_querystring_key_overide(self):\\n rendered_result = self._render_tag(\\n tag='{% querystring \\\"update\\\" \\\"a=1\\\" \\\"a=2\\\" %}',\\n query_str='foo=foo')\\n\\n self.assertTrue(rendered_result.startswith('?'))\\n self.assertEqual(QueryDict(rendered_result[1:]),\\n QueryDict('foo=foo&a=2'))\",\n \"def construct_url(self):\\n path = [self.path]\\n path.extend([str(x) for x in self.params])\\n\\n url = self.client.base_url + '/'.join(x for x in path if x)\\n query = self.kwargs.get('query')\\n\\n if query:\\n # Dict -> List\\n if type(query) is dict:\\n query = query.items()\\n\\n # Remove items with `None` value\\n query = [\\n (k, v) for (k, v) in query\\n if v is not None\\n ]\\n\\n # Encode query, append to URL\\n url += '?' + urlencode(query)\\n\\n return url\",\n \"def FormatUrl(params):\\n input_list = []\\n for item in sorted(params.iteritems(), key=lambda x: x[0]):\\n input_list.append('%s=%s' % (item[0], UrlEscape(item[1])))\\n return '&'.join(input_list)\",\n \"def __str__(self):\\r\\n self.query = urllib.urlencode(self.args)\\r\\n self.query = urllib.unquote(self.query)\\r\\n return urlparse.urlunparse((self.scheme, self.netloc, self.path, self.params, self.query, self.fragment))\",\n \"def querystring(parser, token):\\r\\n bits = token.split_contents()\\r\\n tag = bits.pop(0)\\r\\n updates = token_kwargs(bits, parser)\\r\\n # ``bits`` should now be empty of a=b pairs, it should either be empty, or\\r\\n # have ``without`` arguments.\\r\\n if bits and bits.pop(0) != \\\"without\\\":\\r\\n raise TemplateSyntaxError(\\\"Malformed arguments to '%s'\\\" % tag)\\r\\n removals = [parser.compile_filter(bit) for bit in bits]\\r\\n return QuerystringNode(updates, removals)\",\n \"def _encode_url(data: str) -> str:\\n return urllib.parse.quote(data, safe=\\\"\\\")\",\n \"def _extend_url(self, url, params):\\n # filter out None parameters\\n params = {k:v for k,v in params.items() if v is not None}\\n for key in params:\\n url = url + \\\"&{}={}\\\".format(key, params[key])\\n return url\",\n \"def redirect_add_get_parameters(url_name, *args, **kwargs):\\n from django.urls import reverse \\n from django.http import HttpResponseRedirect\\n import urllib\\n url = reverse(url_name, args = args)\\n params = urllib.parse.urlencode(kwargs)\\n return HttpResponseRedirect(url + \\\"?%s\\\" % params)\",\n \"def replace_query_params(cls, url: str, **params: Mapping[str, str]) -> str:\\n url, _ = cls.separate_query_params(url, params.keys())\\n return cls.add_query_params(url, **params)\",\n \"def _encode_query_value(text, maximal=True):\\n if maximal:\\n bytestr = normalize('NFC', text).encode('utf8')\\n return u''.join([_QUERY_VALUE_QUOTE_MAP[b] for b in bytestr])\\n return u''.join([_QUERY_VALUE_QUOTE_MAP[t]\\n if t in _QUERY_VALUE_DELIMS else t for t in text])\",\n \"def urlencode_sl(query_params, allow_func=None):\\n query_params = query_params or {}\\n encoded_pairs = []\\n for k, v in query_params.items():\\n # Keys are also percent-encoded according to OAuth spec.\\n k = percent_encode(unicode_to_utf8(k))\\n if allow_func and not allow_func(k, v):\\n continue\\n elif is_bytes_or_unicode(v):\\n encoded_pairs.append((k, percent_encode(v),))\\n else:\\n if is_sequence(v):\\n # Loop over the sequence.\\n if len(v) > 0:\\n for i in v:\\n encoded_pairs.append((k, percent_encode(i), ))\\n # ``urllib.urlencode()`` doesn't preserve blank lists.\\n # Therefore, we're discarding them.\\n #else:\\n # # Preserve blank list values.\\n # encoded_pairs.append((k, \\\"\\\", ))\\n else:\\n encoded_pairs.append((k, percent_encode(v),))\\n # Sort after encoding according to the OAuth spec.\\n return sorted(encoded_pairs)\",\n \"def url_with_query_str(url, *args, **kwargs):\\n if len(args):\\n d = args[0]\\n elif len(kwargs):\\n d = kwargs\\n else:\\n raise Exception('not found dict')\\n if any(\\\"%\\\" in k for k in d.keys()):\\n query = \\\"&\\\".join([\\\"{}={}\\\".format(k, v) for k, v in d.items()])\\n else:\\n query = urlencode(d)\\n url = url.split('?')[0]\\n return \\\"{}?{}\\\".format(url, query)\",\n \"def test_append_with_multiple_values_and_same_key(self):\\n rendered_result = self._render_tag(\\n tag='{% querystring \\\"append\\\" \\\"a=1&a=2&a=3\\\" %}',\\n query_str='a=0&&b=2&c=3')\\n\\n self.assertTrue(rendered_result.startswith('?'))\\n self.assertEqual(QueryDict(rendered_result[1:]),\\n QueryDict('a=0&a=1&a=2&a=3&b=2&c=3'))\",\n \"def url_filter(val):\\n if isinstance(val, Undefined):\\n return UNDEFINED_LABEL\\n return quote(str(val))\",\n \"def encode(self, url):\\n\\n # Escape ()\\n return url.replace(\\\"(\\\", \\\"%28\\\").replace(\\\")\\\", \\\"%29\\\") if url else url\",\n \"def make_url(params, add_plugin_path=True):\\r\\n pairs = []\\r\\n for k, v in params.items():\\r\\n k = urllib.parse.quote_plus(str(k))\\r\\n v = urllib.parse.quote_plus(str(v))\\r\\n pairs.append(\\\"%s=%s\\\" % (k, v))\\r\\n params_str = \\\"&\\\".join(pairs)\\r\\n if add_plugin_path:\\r\\n return \\\"%s?%s\\\" % (sys.argv[0], params_str)\\r\\n return params_str\",\n \"def url(self, **kwargs) -> str:\\n return self._pattern.format(**kwargs)\",\n \"def modify_query(**values):\\n args = request.args.copy()\\n\\n for attr, new_value in values.items():\\n if new_value is not None:\\n args[attr] = new_value\\n elif attr in args:\\n del args[attr]\\n\\n if args:\\n return request.base_url + \\\"?\\\" + url_encode(args)\\n else:\\n return request.base_url\",\n \"def add_query_params(url: str, additional_params: dict) -> str:\\n url_components = urlparse(url)\\n original_params = parse_qs(url_components.query)\\n # Before Python 3.5 you could update original_params with\\n # additional_params, but here all the variables are immutable.\\n merged_params = {**original_params, **additional_params}\\n updated_query = urlencode(merged_params, doseq=True)\\n # _replace() is how you can create a new NamedTuple with a changed field\\n return url_components._replace(query=updated_query).geturl()\",\n \"def url(self):\\n return url_search_posts(self.parameters, url_domain=self.url_domain)\",\n \"def get_querystring_for_page(request, page_number, querystring_key,\\n default_number=1, prefix=\\\"?\\\"):\\n querydict = request.GET.copy()\\n querydict[querystring_key] = page_number\\n # for page number 1 there is no need for querystring\\n if page_number == default_number:\\n del querydict[querystring_key]\\n if \\\"querystring_key\\\" in querydict:\\n del querydict[\\\"querystring_key\\\"]\\n if querydict:\\n return \\\"%s%s\\\" % (prefix, querydict.urlencode())\\n return \\\"\\\"\",\n \"def urlQuote(string):\\r\\n return quote(string.encode(\\\"utf-8\\\"))\",\n \"def _create_query_str(data):\\n params = []\\n for name, value in data.items():\\n params.append(name + '=' + str(value))\\n\\n return '?' + '&'.join(params)\",\n \"def safe_urlencode(params, doseq=0):\\n if IS_PY3:\\n return urlencode(params, doseq)\\n\\n if hasattr(params, \\\"items\\\"):\\n params = params.items()\\n\\n new_params = []\\n\\n for k, v in params:\\n k = k.encode(\\\"utf-8\\\")\\n\\n if isinstance(v, (list, tuple)):\\n new_params.append((k, [force_bytes(i) for i in v]))\\n else:\\n new_params.append((k, force_bytes(v)))\\n\\n return urlencode(new_params, doseq)\",\n \"def url(self, suffix: str, *, version: Optional[str] = None,\\n query: Union[None, dict, MultiValueDict] = None,\\n **kwargs: Any) -> str:\\n name = self.url_name_format.format(\\n version=version,\\n app_label=self.app_label,\\n basename=self.basename,\\n suffix=suffix,\\n )\\n url = reverse(name, kwargs=kwargs)\\n\\n # support multiple values for same param: \\\"id=1&id=2&id=3\\\"\\n if isinstance(query, MultiValueDict):\\n params = []\\n for key, value in query.lists():\\n if isinstance(value, list):\\n params.append('&'.join([f'{key}={x}' for x in value]))\\n else:\\n params.append(f'{key}={value}')\\n\\n url += f\\\"?{'&'.join(params)}\\\"\\n elif query:\\n # simple dict query params\\n url += '?%s' % urlencode(query)\\n return url\",\n \"def _encode_url(full_url):\\n return urllib.parse.quote(full_url, safe=\\\"%/:=&?~#+!$,;'@()*[]|\\\")\",\n \"def append_query_params(original_url, **kwargs):\\n scheme, netloc, path, query_string, fragment = urlsplit(original_url)\\n query_params = parse_qs(query_string)\\n if kwargs is not None:\\n for key, value in kwargs.items():\\n query_params[key] = [value]\\n\\n new_query_string = urlencode(query_params, doseq=True)\\n new_url = urlunsplit((scheme, netloc, path, new_query_string, fragment))\\n return new_url\",\n \"def append_query_params(original_url, **kwargs):\\n scheme, netloc, path, query_string, fragment = urlsplit(original_url)\\n query_params = parse_qs(query_string)\\n if kwargs is not None:\\n for key, value in kwargs.items():\\n query_params[key] = [value]\\n\\n new_query_string = urlencode(query_params, doseq=True)\\n new_url = urlunsplit((scheme, netloc, path, new_query_string, fragment))\\n return new_url\",\n \"def test_append_with_multiple_values_and_same_key_seperated(self):\\n rendered_result = self._render_tag(\\n tag='{% querystring \\\"append\\\" \\\"a=1\\\" \\\"a=2\\\" \\\"a=3\\\" %}',\\n query_str='a=0&&b=2&c=3')\\n\\n self.assertTrue(rendered_result.startswith('?'))\\n self.assertEqual(QueryDict(rendered_result[1:]),\\n QueryDict('a=0&a=1&a=2&a=3&b=2&c=3'))\",\n \"def _build_url_exact(self, q: str, **kwargs: Dict) -> str:\\n url = f\\\"{self._URL}?where=\\\"\\n if kwargs.get('doi'):\\n input_doi = kwargs.get('doi')\\n url += f'''{{\\\"doi\\\":\\\"{input_doi}\\\"}}'''\\n return url\",\n \"def t(param):\\n return '<' + param + '>'\",\n \"def encodeToURL(self):\\n return self.fields.toURL(self.request.return_to)\",\n \"def test_append_with_new_key(self):\\n rendered_result = self._render_tag(\\n tag='{% querystring \\\"append\\\" \\\"d=4\\\" %}',\\n query_str='a=1&b=2&c=3')\\n\\n self.assertTrue(rendered_result.startswith('?'))\\n self.assertEqual(QueryDict(rendered_result[1:]),\\n QueryDict('a=1&b=2&c=3&d=4'))\",\n \"def html_quote(v):\\n if v is None:\\n return ''\\n return cgi.escape(str(v), 1)\",\n \"def _override_tourl(self):\\n base_url = urlparse.urlparse(self.url)\\n try:\\n query = base_url.query\\n except AttributeError:\\n # must be python <2.5\\n query = base_url[4]\\n query = parse_qs(query)\\n for k, v in self.items():\\n query.setdefault(k, []).append(v)\\n\\n try:\\n scheme = base_url.scheme\\n netloc = base_url.netloc\\n path = base_url.path\\n params = base_url.params\\n fragment = base_url.fragment\\n except AttributeError:\\n # must be python <2.5\\n scheme = base_url[0]\\n netloc = base_url[1]\\n path = base_url[2]\\n params = base_url[3]\\n fragment = base_url[5]\\n\\n url = (scheme, netloc, path, params,\\n urllib.urlencode(query, True), fragment)\\n return urlparse.urlunparse(url)\",\n \"def make_query_string(query, params):\\n query_string = query\\n\\n index = 1\\n for param in params:\\n if param:\\n to_replace = \\\"%%param%d%%\\\" % index\\n query_string = query_string.replace(to_replace, param)\\n index += 1\\n\\n return query_string\",\n \"def urlsafe(self):\\n return urllib.quote(self.normalized())\",\n \"def b2_url_encode(s):\\n return quote(s.encode('utf-8'))\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6936687","0.6936687","0.65685886","0.6343588","0.62395805","0.6233473","0.6176143","0.61670446","0.6154101","0.6131022","0.60958886","0.60618484","0.6031017","0.6029763","0.5963693","0.59559804","0.59069306","0.57844955","0.57651424","0.5763139","0.5728873","0.57060605","0.56999815","0.56999815","0.55883867","0.5585684","0.5564089","0.5551775","0.5533645","0.55259657","0.5511073","0.55026597","0.5470186","0.54468286","0.54097944","0.5405995","0.53902274","0.53782004","0.53738534","0.5360476","0.53586245","0.53322583","0.5330078","0.5312329","0.53088534","0.5274674","0.5261749","0.5230577","0.52088964","0.520818","0.52006286","0.5192988","0.5190362","0.51561683","0.5152566","0.51485443","0.5147419","0.5143158","0.5139034","0.5137799","0.5133955","0.5127543","0.51150626","0.5113676","0.50909173","0.5085674","0.5082483","0.50496","0.50287384","0.5015965","0.5014243","0.50061566","0.50029474","0.4984317","0.49716085","0.4964267","0.4962956","0.49608755","0.49554542","0.4951263","0.49317554","0.4925175","0.4913354","0.49011457","0.48946765","0.48900545","0.48860005","0.488376","0.4875362","0.4875362","0.48731586","0.48718345","0.48356816","0.48266312","0.48220795","0.48189834","0.48147604","0.4811169","0.48047033","0.48023114"],"string":"[\n \"0.6936687\",\n \"0.6936687\",\n \"0.65685886\",\n \"0.6343588\",\n \"0.62395805\",\n \"0.6233473\",\n \"0.6176143\",\n \"0.61670446\",\n \"0.6154101\",\n \"0.6131022\",\n \"0.60958886\",\n \"0.60618484\",\n \"0.6031017\",\n \"0.6029763\",\n \"0.5963693\",\n \"0.59559804\",\n \"0.59069306\",\n \"0.57844955\",\n \"0.57651424\",\n \"0.5763139\",\n \"0.5728873\",\n \"0.57060605\",\n \"0.56999815\",\n \"0.56999815\",\n \"0.55883867\",\n \"0.5585684\",\n \"0.5564089\",\n \"0.5551775\",\n \"0.5533645\",\n \"0.55259657\",\n \"0.5511073\",\n \"0.55026597\",\n \"0.5470186\",\n \"0.54468286\",\n \"0.54097944\",\n \"0.5405995\",\n \"0.53902274\",\n \"0.53782004\",\n \"0.53738534\",\n \"0.5360476\",\n \"0.53586245\",\n \"0.53322583\",\n \"0.5330078\",\n \"0.5312329\",\n \"0.53088534\",\n \"0.5274674\",\n \"0.5261749\",\n \"0.5230577\",\n \"0.52088964\",\n \"0.520818\",\n \"0.52006286\",\n \"0.5192988\",\n \"0.5190362\",\n \"0.51561683\",\n \"0.5152566\",\n \"0.51485443\",\n \"0.5147419\",\n \"0.5143158\",\n \"0.5139034\",\n \"0.5137799\",\n \"0.5133955\",\n \"0.5127543\",\n \"0.51150626\",\n \"0.5113676\",\n \"0.50909173\",\n \"0.5085674\",\n \"0.5082483\",\n \"0.50496\",\n \"0.50287384\",\n \"0.5015965\",\n \"0.5014243\",\n \"0.50061566\",\n \"0.50029474\",\n \"0.4984317\",\n \"0.49716085\",\n \"0.4964267\",\n \"0.4962956\",\n \"0.49608755\",\n \"0.49554542\",\n \"0.4951263\",\n \"0.49317554\",\n \"0.4925175\",\n \"0.4913354\",\n \"0.49011457\",\n \"0.48946765\",\n \"0.48900545\",\n \"0.48860005\",\n \"0.488376\",\n \"0.4875362\",\n \"0.4875362\",\n \"0.48731586\",\n \"0.48718345\",\n \"0.48356816\",\n \"0.48266312\",\n \"0.48220795\",\n \"0.48189834\",\n \"0.48147604\",\n \"0.4811169\",\n \"0.48047033\",\n \"0.48023114\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5674797"},"document_rank":{"kind":"string","value":"24"}}},{"rowIdx":94799,"cells":{"query":{"kind":"string","value":"Used by all TalkChannels when logging messages to preserve messages order"},"document":{"kind":"string","value":"def _mc_gen():\r\n n = 1\r\n while True:\r\n yield n\r\n n += 1"},"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 _log(self, msg):\n self.telegram_queue.put(f\"{__name__.split('.')[-1]}: {msg}\")","def log(self, message):","def _log(self, message):\n pass","def log_message(self, fmt, *args):\r\n pass\r\n # log_message\r","def lastMessageReceived():","def on_message(self, msg):\n self.log.info(msg)","def on_message(client, userdata, msg):\n sortLight(msg)","def log_message(self, format, *args):","def onMessage(self, msg):\n log.msg(str(msg))","def patchMessages():\n import OnlineEnv as Online\n app=Gaudi.ApplicationMgr()\n Configs.AuditorSvc().Auditors = []\n app.MessageSvcType = 'LHCb::FmcMessageSvc'\n if Gaudi.allConfigurables.has_key('MessageSvc'):\n del Gaudi.allConfigurables['MessageSvc']\n msg = Configs.LHCb__FmcMessageSvc('MessageSvc')\n msg.fifoPath = os.environ['LOGFIFO']\n msg.LoggerOnly = True\n msg.doPrintAlways = False\n# msg.OutputLevel = MSG_WARNING\n# msg.OutputLevel = Online.OutputLevel\n msg.OutputLevel = MSG_INFO","def do_handle_log(self, workunit, level, *msg_elements):\r\n pass","def consolidate_messages(self, msg):","def log(self, msg):\n print(msg)","def process_messages(self):\n pass","def privmsg(self, user, channel, msg):\n self.logger.log(msg)","def log(self, message: str):","def on_log(self, mqtt_client, userdata, level, buf):\n logging.debug(\"DEBUG - on_log received\")","def msg_handler(self, msg):\n self.view.frame.log.append(msg)","def replay_log(self):\n logs = self.logger.read_logs()\n for log in logs:\n self.parse_message(log)","def on_sync(self):\r\n self.log()","def log(self, level, msg, *args, **kwargs):\n pass","def log_message(self, fmt, *args):\n pass","def SetLogMessages() -> None:\n caller = previousframe(2)\n caller_path = Path(caller.filename)\n caller_name, caller_dir = caller_path.stem, caller_path.parent\n msgs = (caller_dir / \"messages.json\").read_text(\"utf-8\")\n msg = AttrDict(json.loads(msgs)[caller_name])\n for name, obj in caller.frame.f_locals.items():\n if (isfunction(obj) or isclass(obj)) and name in msg:\n if hasattr(obj, \"_log_msg\"):\n obj._log_msg = AttrDict(obj._log_msg)\n obj._log_msg.update(msg[name])\n else:\n obj._log_msg = msg[name]","def sub_callbackmsg(self, msg):\n\n print (msg.message)\n self.received_msg = self.received_msg + [msg.message]\n print (self.received_msg)","def logIt(self, msg):\n\n\t\tif( self.logger ): self.logger.logIt( msg )","def logline(msg):\n print msg","def logIt(self, msg):\n\n if (self.logger): self.logger.logIt(msg)","def extra_log(self, string):\n if hasattr(self.parent, \"log\"):\n self.parent.log += \"\\r\\n[%s] \" % time.process_time()\n self.parent.log += string + \"\\r\\n\"","def event_log(self):\n pass","def handle_message(self, msg):\n self.messages.append({\n 'type': msg.category,\n 'module': msg.module,\n 'obj': msg.obj,\n 'line': msg.line,\n 'column': msg.column,\n 'path': msg.path,\n 'symbol': msg.symbol,\n 'message': msg.msg,\n 'message-id': msg.msg_id,\n })","def process_chatter(self, msg):\n # note, nothing in here is ROS specific, it's just python code that\n # runs when new info appears\n\n print msg.data # print the recieved message\n\n self.msgs_recieved += 1 # increase msg count\n self.msgs_recieved %= 500 # mod 500 so we don't get enormous numbers\n self.msg = \"%d messages recieved\" % self.msgs_recieved # set message","def testIgnoreMessage(self):\n\n self.logger.accept('c',self.logger.foo)\n self.logger.accept('c',self.logger.bar)\n self.logger.ignore('c')\n messager.send('c')\n # No methods should have been called.\n self.assertEqual(self.logger.log,[])","def log_message(self, msg):\n\t\tself.logView.log_message(msg)","def _log_prepend(self, msg):\n\t\tp = self._edit.get_buffer()\n\t\tstart = p.get_start_iter()\n\t\tp.insert(start, msg)\n\t\tself._trunc_lines()\n\t\tself._edit.scroll_to_iter(p.get_start_iter(), 0.0)","def on_message(self, message):\n obj = json_decode(message)\n self.writing_logs(obj)\n return","def on_received(self, order):\n self.received_messages.append(order)\n self.bm.on_interesting_shit()","def send_messages(messages, sent_messages):\n while messages:\n current_message = messages.pop()\n print(f\"Sending message: {current_message}\")\n sent_messages.append(current_message)","def test_order_of_loaded_messages():\n app = HelperApp(server.message_app)\n app.post('/login/', {'username': 'jessie', 'password': 'frog'})\n\n # Add a bunch of messages\n for i, l in enumerate(\"abcd\"):\n # Sleep a second so that our messages have different timestamps\n if i != 0:\n time.sleep(1)\n\n app.get('/compose/')\n app.post('/compose/', {'to': 'james', 'subject': l, 'body': l.upper()})\n\n all_messages = message.load_all_messages()\n sent_messages = message.load_sent_messages('jessie')\n received_messages = message.load_sent_messages('james')\n\n # Check that we're loading messages correctly\n for messages in (all_messages, sent_messages, received_messages):\n for prev, current in zip(messages, messages[1:]):\n assert prev['time'] > current['time']","def log_message(self, formate, *args):\n return","def log(self, msg=\"\"):\n if len(msg):\n msg = \"[%.03fs] %s\" % (time.time()-self.timeStart, msg)\n print(msg)\n self.logLines.append(msg)","def _onLog(self, client:mqtt.Client, userdata:Any, level:int, buf:str) -> None:\n\t\tself.lowLevelLogging and self.messageHandler and self.messageHandler.logging(self, mqtt.LOGGING_LEVEL[level], f'MQTT: {buf}')","def after_rotate_hindcast_logs(msg, config, checklist):\n return []","def appendMsg(self, msg):\n # self.message += msg\n theTime = self.logger.mytime()\n # self.message += theTime + \" \" + str( msg )\n self.message = str(self.message) + str(theTime) + \" \" + str(msg)","def on_message(self, context, payload):\n values = []\n\n if len(payload):\n if self.show_remaining:\n context['remaining-payload'] = self.toHex(payload)\n\n if self.orderedKeyList is not None:\n keyList = self.orderedKeyList\n elif self.sortByKey:\n keyList = sorted(context.keys())\n else:\n keyList = context.keys()\n\n for key in keyList:\n if key[0] == '$' or key[0] == '#':\n continue\n\n excluded = self.excludeAll\n\n if key in self.exclusions:\n excluded = True\n if key in self.inclusions:\n excluded = False\n\n if key not in context:\n excluded = True\n \n if not excluded:\n if not self.squelch_key:\n values.append('{0}={1}'.format(key, context[key]))\n else:\n values.append('{0}'.format(context[key]))\n\n if len(values):\n line = ','.join(values)\n if self.out_file is not None and len(line) > 0:\n self.out_file.write('{0}\\n'.format(line))\n self.out_file.flush()\n if self.verbosity() >= Verbosity.Verbose:\n print line\n else:\n print line\n\n self.dispatch_to_next(context, payload)","def handleMessage(msg):","def log(self, _strMessage=\"\"):\n self.edLogging.log(_strMessage)","def order_log_results(self, log_search_order):\n raise errors.Unimplemented()","def write(self, msg):\n self._current_stream.write(msg)\n if type(self._log) == list:\n self._log.append(msg)","def emit(self, record):\n priority = self.getPriority(record.levelname)\n\n for line in record.getMessage().split('\\n'):\n line = line.strip()\n if line:\n self.syslog(priority, line)","def __init__(self):\n self.msg_dict = dict() # msg: last_print_time_stamp","def do_timestamp_messages(self, messages):\n timestamp = self.env.now\n self.reception_records[timestamp] = messages\n log.debug(\"{} recorded {}\".format(self, self.reception_records))","def _msg_cb(self, main_loop, msg):\n self._msg_hdr(msg)","def log(msg):\n print msg","def log(self, msg):\n logging.info(\"Logging Message\")\n ml = self.monk_logs\n today = datetime.datetime.now().strftime(\"%Y-%m-%d %H:%M\")\n ml.insert({today: {\"log\": msg,\n \"sentiment\": self.get_sentiment(msg),\n \"weather\": Weather.get_weather()}})","def log(self, string):\n if self.PRINT:\n print(string)\n sys.stdout.flush()\n self.message_list.append(string)","def flag_messages(self, org, messages):\n pass","def extra_log(self, string):\n if hasattr(self.parent, \"log\"):\n self.parent.log += f\"\\r\\n[{time.process_time()}] \"\n self.parent.log += string + \"\\r\\n\"","def handle_message(self, message):","def log(self, msg):\n\n\t\tself.eyetribe.log_message(msg)","def show_messages(self):\n self.masterlog.revealme()","def list_messages(self):","def logs_add_message(self, level, message):\n pass","def on_log( client, userdata, level, buf ):\n print( \"MQTTClient log: \", buf )","def handle_log(self, workunit, level, *msg_elements):\r\n if level <= self.settings.log_level:\r\n self.do_handle_log(workunit, level, *msg_elements)","def messages(self, messages):\r\n\r\n self._messages = messages","def _handle_ordered_packet(self, packet):\n pass","def define_log_post_format_hooks(self):\n # TODO remove this once structlog supports hooks or handlers\n # these hooks accept a 'msg' and do not return anything\n return []","def log(self, message):\n #logs.logger.debug(\"asyncore log: %s\" % message)","def archive_messages(self, org, messages):\n pass","def comsume_msg(self, msg_type):","def tracker_print(msg: Any) -> None:\n collective.communicator_print(msg)","def log( cls, level, msg, *args, **kwargs ):\n arg_set = ( level, msg, ) # not clear how to get rest, for now discard\n print( f\"{arg_set[0]} >> {arg_set[1]}\" )\n cls.__log_later.append( arg_set )","def log(self, message):\n #logs.logger.debug(\"asyncore log: %s\" % message)\n pass","def massage_addinfo(self) -> str:\n self.message_str= \"{}, {}\\n\".format(self.sent_by, self.time)","def logger(self, message):\n if hasattr(self.log, '__call__'):\n self.log(message.strip())","def _log_message(self, *msgs,\n sep=' ',\n extra_indent_level=1,\n prefix_with_name=False,\n _prefix='',\n _suffix=''):\n if not msgs:\n return\n\n # do nothing unless enabled! if disabled, the other 'stack' accesses will blow up\n if self._enabled_stack[-1] <= 0: # disabled\n return\n\n # 0.3.0\n logging_state = self.logging_state_stack[-1]\n # Write nothing if output is stifled (caller is NOT _deco_base_f_wrapper_)\n # NOTE: only check global_mute() IN REALTIME, like so:\n mute = max(logging_state.mute, self.global_mute())\n if mute == self.MUTE.ALL:\n return\n # adjust for calls not being logged -- don't indent an extra level\n # (no 'log_calls frame', no 'arguments:' to align with),\n # and prefix with display name cuz there's no log_calls \"frame\"\n # NOTE, In this case we force \"prefix_with_name = True\" <<<\n ####if mute == self.MUTE.CALLS:\n if mute >= self.log_message_auto_prefix_threshold():\n extra_indent_level -= 1\n prefix_with_name = True\n\n indent_len = (logging_state.indent_len\n + (extra_indent_level * self.INDENT)\n )\n if indent_len < 0:\n indent_len = 0 # clamp\n\n the_msg = sep.join(map(str, msgs))\n if prefix_with_name:\n the_msg = logging_state.output_fname + ': ' + the_msg\n assert isinstance(_prefix, str) and isinstance(_suffix, str)\n the_msg = _prefix + the_msg + _suffix\n\n logging_state.logging_fn(prefix_multiline_str(' ' * indent_len, the_msg))","def test(self):\n self.info(\"LOGGING: Testing log messages\")\n self.debug(\"This is a debugging message\")\n self.info(\"This is an informational message\")\n self.warning(\"This is a warning message\")\n self.error(\"This is an error message\")\n self.critical(\"This is a critical message\")\n self.info(\"LOGGING: Testing log messages COMPLETE\")\n return","def test_logger(self):\n from workflow import engine\n\n logging.root.handlers = []\n engine.LOG.handlers = []\n\n other_logger = logging.getLogger('other')\n wf_logger = engine.get_logger('workflow.test')\n\n test_io = StringIO()\n root_io = StringIO()\n other_io = StringIO()\n\n logging.root.addHandler(logging.StreamHandler(root_io))\n other_logger.addHandler(logging.StreamHandler(other_io))\n wf_logger.addHandler(logging.StreamHandler(test_io))\n\n # set the root level to WARNING; wf should honour parent level\n logging.root.setLevel(logging.WARNING)\n\n logging.warn('root warn')\n other_logger.warn('other warn')\n wf_logger.warn('wf warn')\n\n logging.info('root info')\n other_logger.info('other info')\n wf_logger.info('wf info')\n\n assert root_io.getvalue() == \"root warn\\nother warn\\n\" # Root logger should have two msgs\n assert other_io.getvalue() == \"other warn\\n\" # Other logger should have one msg\n assert test_io.getvalue() == \"wf warn\\n\" # Wf logger should have one msg\n\n root_io.seek(0)\n other_io.seek(0)\n test_io.seek(0)\n\n # now set too to DEBUG and wf to INFO\n logging.root.setLevel(logging.DEBUG)\n engine.reset_all_loggers(logging.WARNING)\n\n logging.warn('root warn')\n other_logger.warn('other warn')\n wf_logger.warn('wf warn')\n\n logging.info('root info')\n other_logger.info('other info')\n wf_logger.info('wf info')\n\n assert root_io.getvalue() == \"root warn\\nother warn\\n\" \"root info\\nother info\\n\" # Root logger should have four msgs\n assert other_io.getvalue() == \"other warn\\nother info\\n\" # Other logger should have two msg\n assert test_io.getvalue() == \"wf warn\\n\" # Wf logger should have one msg","def __call__(self,message):\n if self.header != self.prevHeader:\n if self.prevHeader:\n self.writeFooter()\n if self.header:\n self.writeHeader(self.header)\n self.prevHeader = self.header\n self.writeMessage(message)","def _stdlog(self, msg):\n print msg\n logger.info(msg)","def _log_message(self, message):\n\t\tif message not in self._logged_messages:\n\t\t\twith open(self._logfile, \"a\") as f:\n\t\t\t\tf.write(message + \"\\n\")\n\t\tself._logged_messages.append(message)","def _log2mylog(self, msg):\n time_str = mod_time.strftime(\n \"%Y-%m-%d %H:%M:%S\", mod_time.localtime(mod_time.time())\n )\n msg = str(msg)\n content = \"%s [%s]\\n\" % (time_str, msg)\n fa = open(self.mylogfile, \"a\")\n fa.write(content)\n fa.close()","def send_messages(messages):\n while messages:\n msg = messages.pop()\n sent_messages.append(msg)","def test_hl_message(self):\n utcmock = MagicMock()\n utcmock.utcnow = MagicMock(return_value=datetime.datetime.utcfromtimestamp(0))\n with patch(\"datetime.datetime\", utcmock):\n out = saltsupport.LogCollector()\n out.highlight(\"The {} TTYs became {} TTYs and vice versa\", \"real\", \"pseudo\")\n assert saltsupport.LogCollector.INFO in out.messages\n assert (\n type(out.messages[saltsupport.LogCollector.INFO])\n == saltsupport.LogCollector.MessagesList\n )\n assert out.messages[saltsupport.LogCollector.INFO] == [\n \"00:00:00.000 - The real TTYs became \" \"pseudo TTYs and vice versa\"\n ]","def log(message):\n print(\"{0}: {1}\".format(acm.Time.TimeNow(), message))","def log(self, message):\n if VERBOSE:\n print self, message","def log(msg):\n print(str(msg))","def logIt(self, astr, prefix=\" [D] \"):\n self.protocol.logIt(astr, prefix=prefix)","def write_message(self, payload):\n self.messages.append(payload)","def after_rotate_logs(msg, config, checklist):\n return []","def trace(msg):\n import datetime\n print('[{:%Y-%m-%d %H:%M:%S}]: '.format(datetime.datetime.now()) + msg)","def horde_message(self, message):","def msg_callback(self, *args, **kwargs):\n log(*args, name=self.idf.name, **kwargs)","def log(content):\n\n now = datetime.datetime.now().strftime(\"%c\")\n now_time = time.time()\n # msg_last = '{} - {: >5.1f} seconds - {}'.format(now, now_time - TIME_LAST, content)\n\n if Logger._time_last is not None:\n msg_last = Logger.human_seconds(now_time - Logger._time_last)\n else:\n msg_last = ' ' * 13\n\n msgs = [now, msg_last, content]\n\n msg = \" │ \".join(msgs)\n\n msg_lines = [\"─\" * len(content) for content in msgs]\n\n msg_top = \"─┬─\".join(msg_lines)\n msg_lower = \"─┴─\".join(msg_lines)\n\n print(\" ┌─{}─┐\".format(msg_top))\n print(\" │ {} │\".format(msg))\n print(\" └─{}─┘\".format(msg_lower))\n\n Logger._time_last = time.time()","def log(self, msg):\n self.ansible.log(msg)","def _send(self, message):\n logger.info(message)\n self.buffer.put(message)","def event_logged(self, event):\n prefix = termcolor.colored(\">>>\", \"yellow\")\n logging.info(\"%s %s\" % (prefix, event.colored_str()))\n if event.to:\n subject = \"%s: %s\" % (self.name, event.phase)\n self.send_message(event.to, subject, event_email(event, parser=self.parser))","def test_nth_log_post(self):\n self.conveyer.execute(self.conveyer.log(\"{message: \\\"first\\\"}\"))\n commands = self.conveyer.log(\"{message: \\\"second\\\"}\")\n self.assertEquals(len(commands), 1)\n self.assertEquals(type(commands[0]), AppendLogCmd)\n self.assertEquals(commands[0].event, \"{message: \\\"second\\\"}\")\n self.assertEquals(self.events_out.getvalue(), \"{message: \\\"first\\\"}\")","def send_messages(self):\n if self.messages:\n messages, self.messages = self.messages, []\n self.mpub(\"events.%s\" % config.pool, messages)","def print_messages(sent_msgs):\n\tprint(\"\\nHere is the initial list of messages\")\n\tfor message in messages:\n\t\tprint(message)\n\tprint(\"\\nHere is a list of printed messages\")\n\tfor sent_msg in sorted(sent_msgs):\n\t\tprint(sent_msg)","def print_messages(sent_msgs):\n\tprint(\"\\nHere is the initial list of messages\")\n\tfor message in messages:\n\t\tprint(message)\n\tprint(\"\\nHere is a list of printed messages\")\n\tfor sent_msg in sorted(sent_msgs):\n\t\tprint(sent_msg)"],"string":"[\n \"def _log(self, msg):\\n self.telegram_queue.put(f\\\"{__name__.split('.')[-1]}: {msg}\\\")\",\n \"def log(self, message):\",\n \"def _log(self, message):\\n pass\",\n \"def log_message(self, fmt, *args):\\r\\n pass\\r\\n # log_message\\r\",\n \"def lastMessageReceived():\",\n \"def on_message(self, msg):\\n self.log.info(msg)\",\n \"def on_message(client, userdata, msg):\\n sortLight(msg)\",\n \"def log_message(self, format, *args):\",\n \"def onMessage(self, msg):\\n log.msg(str(msg))\",\n \"def patchMessages():\\n import OnlineEnv as Online\\n app=Gaudi.ApplicationMgr()\\n Configs.AuditorSvc().Auditors = []\\n app.MessageSvcType = 'LHCb::FmcMessageSvc'\\n if Gaudi.allConfigurables.has_key('MessageSvc'):\\n del Gaudi.allConfigurables['MessageSvc']\\n msg = Configs.LHCb__FmcMessageSvc('MessageSvc')\\n msg.fifoPath = os.environ['LOGFIFO']\\n msg.LoggerOnly = True\\n msg.doPrintAlways = False\\n# msg.OutputLevel = MSG_WARNING\\n# msg.OutputLevel = Online.OutputLevel\\n msg.OutputLevel = MSG_INFO\",\n \"def do_handle_log(self, workunit, level, *msg_elements):\\r\\n pass\",\n \"def consolidate_messages(self, msg):\",\n \"def log(self, msg):\\n print(msg)\",\n \"def process_messages(self):\\n pass\",\n \"def privmsg(self, user, channel, msg):\\n self.logger.log(msg)\",\n \"def log(self, message: str):\",\n \"def on_log(self, mqtt_client, userdata, level, buf):\\n logging.debug(\\\"DEBUG - on_log received\\\")\",\n \"def msg_handler(self, msg):\\n self.view.frame.log.append(msg)\",\n \"def replay_log(self):\\n logs = self.logger.read_logs()\\n for log in logs:\\n self.parse_message(log)\",\n \"def on_sync(self):\\r\\n self.log()\",\n \"def log(self, level, msg, *args, **kwargs):\\n pass\",\n \"def log_message(self, fmt, *args):\\n pass\",\n \"def SetLogMessages() -> None:\\n caller = previousframe(2)\\n caller_path = Path(caller.filename)\\n caller_name, caller_dir = caller_path.stem, caller_path.parent\\n msgs = (caller_dir / \\\"messages.json\\\").read_text(\\\"utf-8\\\")\\n msg = AttrDict(json.loads(msgs)[caller_name])\\n for name, obj in caller.frame.f_locals.items():\\n if (isfunction(obj) or isclass(obj)) and name in msg:\\n if hasattr(obj, \\\"_log_msg\\\"):\\n obj._log_msg = AttrDict(obj._log_msg)\\n obj._log_msg.update(msg[name])\\n else:\\n obj._log_msg = msg[name]\",\n \"def sub_callbackmsg(self, msg):\\n\\n print (msg.message)\\n self.received_msg = self.received_msg + [msg.message]\\n print (self.received_msg)\",\n \"def logIt(self, msg):\\n\\n\\t\\tif( self.logger ): self.logger.logIt( msg )\",\n \"def logline(msg):\\n print msg\",\n \"def logIt(self, msg):\\n\\n if (self.logger): self.logger.logIt(msg)\",\n \"def extra_log(self, string):\\n if hasattr(self.parent, \\\"log\\\"):\\n self.parent.log += \\\"\\\\r\\\\n[%s] \\\" % time.process_time()\\n self.parent.log += string + \\\"\\\\r\\\\n\\\"\",\n \"def event_log(self):\\n pass\",\n \"def handle_message(self, msg):\\n self.messages.append({\\n 'type': msg.category,\\n 'module': msg.module,\\n 'obj': msg.obj,\\n 'line': msg.line,\\n 'column': msg.column,\\n 'path': msg.path,\\n 'symbol': msg.symbol,\\n 'message': msg.msg,\\n 'message-id': msg.msg_id,\\n })\",\n \"def process_chatter(self, msg):\\n # note, nothing in here is ROS specific, it's just python code that\\n # runs when new info appears\\n\\n print msg.data # print the recieved message\\n\\n self.msgs_recieved += 1 # increase msg count\\n self.msgs_recieved %= 500 # mod 500 so we don't get enormous numbers\\n self.msg = \\\"%d messages recieved\\\" % self.msgs_recieved # set message\",\n \"def testIgnoreMessage(self):\\n\\n self.logger.accept('c',self.logger.foo)\\n self.logger.accept('c',self.logger.bar)\\n self.logger.ignore('c')\\n messager.send('c')\\n # No methods should have been called.\\n self.assertEqual(self.logger.log,[])\",\n \"def log_message(self, msg):\\n\\t\\tself.logView.log_message(msg)\",\n \"def _log_prepend(self, msg):\\n\\t\\tp = self._edit.get_buffer()\\n\\t\\tstart = p.get_start_iter()\\n\\t\\tp.insert(start, msg)\\n\\t\\tself._trunc_lines()\\n\\t\\tself._edit.scroll_to_iter(p.get_start_iter(), 0.0)\",\n \"def on_message(self, message):\\n obj = json_decode(message)\\n self.writing_logs(obj)\\n return\",\n \"def on_received(self, order):\\n self.received_messages.append(order)\\n self.bm.on_interesting_shit()\",\n \"def send_messages(messages, sent_messages):\\n while messages:\\n current_message = messages.pop()\\n print(f\\\"Sending message: {current_message}\\\")\\n sent_messages.append(current_message)\",\n \"def test_order_of_loaded_messages():\\n app = HelperApp(server.message_app)\\n app.post('/login/', {'username': 'jessie', 'password': 'frog'})\\n\\n # Add a bunch of messages\\n for i, l in enumerate(\\\"abcd\\\"):\\n # Sleep a second so that our messages have different timestamps\\n if i != 0:\\n time.sleep(1)\\n\\n app.get('/compose/')\\n app.post('/compose/', {'to': 'james', 'subject': l, 'body': l.upper()})\\n\\n all_messages = message.load_all_messages()\\n sent_messages = message.load_sent_messages('jessie')\\n received_messages = message.load_sent_messages('james')\\n\\n # Check that we're loading messages correctly\\n for messages in (all_messages, sent_messages, received_messages):\\n for prev, current in zip(messages, messages[1:]):\\n assert prev['time'] > current['time']\",\n \"def log_message(self, formate, *args):\\n return\",\n \"def log(self, msg=\\\"\\\"):\\n if len(msg):\\n msg = \\\"[%.03fs] %s\\\" % (time.time()-self.timeStart, msg)\\n print(msg)\\n self.logLines.append(msg)\",\n \"def _onLog(self, client:mqtt.Client, userdata:Any, level:int, buf:str) -> None:\\n\\t\\tself.lowLevelLogging and self.messageHandler and self.messageHandler.logging(self, mqtt.LOGGING_LEVEL[level], f'MQTT: {buf}')\",\n \"def after_rotate_hindcast_logs(msg, config, checklist):\\n return []\",\n \"def appendMsg(self, msg):\\n # self.message += msg\\n theTime = self.logger.mytime()\\n # self.message += theTime + \\\" \\\" + str( msg )\\n self.message = str(self.message) + str(theTime) + \\\" \\\" + str(msg)\",\n \"def on_message(self, context, payload):\\n values = []\\n\\n if len(payload):\\n if self.show_remaining:\\n context['remaining-payload'] = self.toHex(payload)\\n\\n if self.orderedKeyList is not None:\\n keyList = self.orderedKeyList\\n elif self.sortByKey:\\n keyList = sorted(context.keys())\\n else:\\n keyList = context.keys()\\n\\n for key in keyList:\\n if key[0] == '$' or key[0] == '#':\\n continue\\n\\n excluded = self.excludeAll\\n\\n if key in self.exclusions:\\n excluded = True\\n if key in self.inclusions:\\n excluded = False\\n\\n if key not in context:\\n excluded = True\\n \\n if not excluded:\\n if not self.squelch_key:\\n values.append('{0}={1}'.format(key, context[key]))\\n else:\\n values.append('{0}'.format(context[key]))\\n\\n if len(values):\\n line = ','.join(values)\\n if self.out_file is not None and len(line) > 0:\\n self.out_file.write('{0}\\\\n'.format(line))\\n self.out_file.flush()\\n if self.verbosity() >= Verbosity.Verbose:\\n print line\\n else:\\n print line\\n\\n self.dispatch_to_next(context, payload)\",\n \"def handleMessage(msg):\",\n \"def log(self, _strMessage=\\\"\\\"):\\n self.edLogging.log(_strMessage)\",\n \"def order_log_results(self, log_search_order):\\n raise errors.Unimplemented()\",\n \"def write(self, msg):\\n self._current_stream.write(msg)\\n if type(self._log) == list:\\n self._log.append(msg)\",\n \"def emit(self, record):\\n priority = self.getPriority(record.levelname)\\n\\n for line in record.getMessage().split('\\\\n'):\\n line = line.strip()\\n if line:\\n self.syslog(priority, line)\",\n \"def __init__(self):\\n self.msg_dict = dict() # msg: last_print_time_stamp\",\n \"def do_timestamp_messages(self, messages):\\n timestamp = self.env.now\\n self.reception_records[timestamp] = messages\\n log.debug(\\\"{} recorded {}\\\".format(self, self.reception_records))\",\n \"def _msg_cb(self, main_loop, msg):\\n self._msg_hdr(msg)\",\n \"def log(msg):\\n print msg\",\n \"def log(self, msg):\\n logging.info(\\\"Logging Message\\\")\\n ml = self.monk_logs\\n today = datetime.datetime.now().strftime(\\\"%Y-%m-%d %H:%M\\\")\\n ml.insert({today: {\\\"log\\\": msg,\\n \\\"sentiment\\\": self.get_sentiment(msg),\\n \\\"weather\\\": Weather.get_weather()}})\",\n \"def log(self, string):\\n if self.PRINT:\\n print(string)\\n sys.stdout.flush()\\n self.message_list.append(string)\",\n \"def flag_messages(self, org, messages):\\n pass\",\n \"def extra_log(self, string):\\n if hasattr(self.parent, \\\"log\\\"):\\n self.parent.log += f\\\"\\\\r\\\\n[{time.process_time()}] \\\"\\n self.parent.log += string + \\\"\\\\r\\\\n\\\"\",\n \"def handle_message(self, message):\",\n \"def log(self, msg):\\n\\n\\t\\tself.eyetribe.log_message(msg)\",\n \"def show_messages(self):\\n self.masterlog.revealme()\",\n \"def list_messages(self):\",\n \"def logs_add_message(self, level, message):\\n pass\",\n \"def on_log( client, userdata, level, buf ):\\n print( \\\"MQTTClient log: \\\", buf )\",\n \"def handle_log(self, workunit, level, *msg_elements):\\r\\n if level <= self.settings.log_level:\\r\\n self.do_handle_log(workunit, level, *msg_elements)\",\n \"def messages(self, messages):\\r\\n\\r\\n self._messages = messages\",\n \"def _handle_ordered_packet(self, packet):\\n pass\",\n \"def define_log_post_format_hooks(self):\\n # TODO remove this once structlog supports hooks or handlers\\n # these hooks accept a 'msg' and do not return anything\\n return []\",\n \"def log(self, message):\\n #logs.logger.debug(\\\"asyncore log: %s\\\" % message)\",\n \"def archive_messages(self, org, messages):\\n pass\",\n \"def comsume_msg(self, msg_type):\",\n \"def tracker_print(msg: Any) -> None:\\n collective.communicator_print(msg)\",\n \"def log( cls, level, msg, *args, **kwargs ):\\n arg_set = ( level, msg, ) # not clear how to get rest, for now discard\\n print( f\\\"{arg_set[0]} >> {arg_set[1]}\\\" )\\n cls.__log_later.append( arg_set )\",\n \"def log(self, message):\\n #logs.logger.debug(\\\"asyncore log: %s\\\" % message)\\n pass\",\n \"def massage_addinfo(self) -> str:\\n self.message_str= \\\"{}, {}\\\\n\\\".format(self.sent_by, self.time)\",\n \"def logger(self, message):\\n if hasattr(self.log, '__call__'):\\n self.log(message.strip())\",\n \"def _log_message(self, *msgs,\\n sep=' ',\\n extra_indent_level=1,\\n prefix_with_name=False,\\n _prefix='',\\n _suffix=''):\\n if not msgs:\\n return\\n\\n # do nothing unless enabled! if disabled, the other 'stack' accesses will blow up\\n if self._enabled_stack[-1] <= 0: # disabled\\n return\\n\\n # 0.3.0\\n logging_state = self.logging_state_stack[-1]\\n # Write nothing if output is stifled (caller is NOT _deco_base_f_wrapper_)\\n # NOTE: only check global_mute() IN REALTIME, like so:\\n mute = max(logging_state.mute, self.global_mute())\\n if mute == self.MUTE.ALL:\\n return\\n # adjust for calls not being logged -- don't indent an extra level\\n # (no 'log_calls frame', no 'arguments:' to align with),\\n # and prefix with display name cuz there's no log_calls \\\"frame\\\"\\n # NOTE, In this case we force \\\"prefix_with_name = True\\\" <<<\\n ####if mute == self.MUTE.CALLS:\\n if mute >= self.log_message_auto_prefix_threshold():\\n extra_indent_level -= 1\\n prefix_with_name = True\\n\\n indent_len = (logging_state.indent_len\\n + (extra_indent_level * self.INDENT)\\n )\\n if indent_len < 0:\\n indent_len = 0 # clamp\\n\\n the_msg = sep.join(map(str, msgs))\\n if prefix_with_name:\\n the_msg = logging_state.output_fname + ': ' + the_msg\\n assert isinstance(_prefix, str) and isinstance(_suffix, str)\\n the_msg = _prefix + the_msg + _suffix\\n\\n logging_state.logging_fn(prefix_multiline_str(' ' * indent_len, the_msg))\",\n \"def test(self):\\n self.info(\\\"LOGGING: Testing log messages\\\")\\n self.debug(\\\"This is a debugging message\\\")\\n self.info(\\\"This is an informational message\\\")\\n self.warning(\\\"This is a warning message\\\")\\n self.error(\\\"This is an error message\\\")\\n self.critical(\\\"This is a critical message\\\")\\n self.info(\\\"LOGGING: Testing log messages COMPLETE\\\")\\n return\",\n \"def test_logger(self):\\n from workflow import engine\\n\\n logging.root.handlers = []\\n engine.LOG.handlers = []\\n\\n other_logger = logging.getLogger('other')\\n wf_logger = engine.get_logger('workflow.test')\\n\\n test_io = StringIO()\\n root_io = StringIO()\\n other_io = StringIO()\\n\\n logging.root.addHandler(logging.StreamHandler(root_io))\\n other_logger.addHandler(logging.StreamHandler(other_io))\\n wf_logger.addHandler(logging.StreamHandler(test_io))\\n\\n # set the root level to WARNING; wf should honour parent level\\n logging.root.setLevel(logging.WARNING)\\n\\n logging.warn('root warn')\\n other_logger.warn('other warn')\\n wf_logger.warn('wf warn')\\n\\n logging.info('root info')\\n other_logger.info('other info')\\n wf_logger.info('wf info')\\n\\n assert root_io.getvalue() == \\\"root warn\\\\nother warn\\\\n\\\" # Root logger should have two msgs\\n assert other_io.getvalue() == \\\"other warn\\\\n\\\" # Other logger should have one msg\\n assert test_io.getvalue() == \\\"wf warn\\\\n\\\" # Wf logger should have one msg\\n\\n root_io.seek(0)\\n other_io.seek(0)\\n test_io.seek(0)\\n\\n # now set too to DEBUG and wf to INFO\\n logging.root.setLevel(logging.DEBUG)\\n engine.reset_all_loggers(logging.WARNING)\\n\\n logging.warn('root warn')\\n other_logger.warn('other warn')\\n wf_logger.warn('wf warn')\\n\\n logging.info('root info')\\n other_logger.info('other info')\\n wf_logger.info('wf info')\\n\\n assert root_io.getvalue() == \\\"root warn\\\\nother warn\\\\n\\\" \\\"root info\\\\nother info\\\\n\\\" # Root logger should have four msgs\\n assert other_io.getvalue() == \\\"other warn\\\\nother info\\\\n\\\" # Other logger should have two msg\\n assert test_io.getvalue() == \\\"wf warn\\\\n\\\" # Wf logger should have one msg\",\n \"def __call__(self,message):\\n if self.header != self.prevHeader:\\n if self.prevHeader:\\n self.writeFooter()\\n if self.header:\\n self.writeHeader(self.header)\\n self.prevHeader = self.header\\n self.writeMessage(message)\",\n \"def _stdlog(self, msg):\\n print msg\\n logger.info(msg)\",\n \"def _log_message(self, message):\\n\\t\\tif message not in self._logged_messages:\\n\\t\\t\\twith open(self._logfile, \\\"a\\\") as f:\\n\\t\\t\\t\\tf.write(message + \\\"\\\\n\\\")\\n\\t\\tself._logged_messages.append(message)\",\n \"def _log2mylog(self, msg):\\n time_str = mod_time.strftime(\\n \\\"%Y-%m-%d %H:%M:%S\\\", mod_time.localtime(mod_time.time())\\n )\\n msg = str(msg)\\n content = \\\"%s [%s]\\\\n\\\" % (time_str, msg)\\n fa = open(self.mylogfile, \\\"a\\\")\\n fa.write(content)\\n fa.close()\",\n \"def send_messages(messages):\\n while messages:\\n msg = messages.pop()\\n sent_messages.append(msg)\",\n \"def test_hl_message(self):\\n utcmock = MagicMock()\\n utcmock.utcnow = MagicMock(return_value=datetime.datetime.utcfromtimestamp(0))\\n with patch(\\\"datetime.datetime\\\", utcmock):\\n out = saltsupport.LogCollector()\\n out.highlight(\\\"The {} TTYs became {} TTYs and vice versa\\\", \\\"real\\\", \\\"pseudo\\\")\\n assert saltsupport.LogCollector.INFO in out.messages\\n assert (\\n type(out.messages[saltsupport.LogCollector.INFO])\\n == saltsupport.LogCollector.MessagesList\\n )\\n assert out.messages[saltsupport.LogCollector.INFO] == [\\n \\\"00:00:00.000 - The real TTYs became \\\" \\\"pseudo TTYs and vice versa\\\"\\n ]\",\n \"def log(message):\\n print(\\\"{0}: {1}\\\".format(acm.Time.TimeNow(), message))\",\n \"def log(self, message):\\n if VERBOSE:\\n print self, message\",\n \"def log(msg):\\n print(str(msg))\",\n \"def logIt(self, astr, prefix=\\\" [D] \\\"):\\n self.protocol.logIt(astr, prefix=prefix)\",\n \"def write_message(self, payload):\\n self.messages.append(payload)\",\n \"def after_rotate_logs(msg, config, checklist):\\n return []\",\n \"def trace(msg):\\n import datetime\\n print('[{:%Y-%m-%d %H:%M:%S}]: '.format(datetime.datetime.now()) + msg)\",\n \"def horde_message(self, message):\",\n \"def msg_callback(self, *args, **kwargs):\\n log(*args, name=self.idf.name, **kwargs)\",\n \"def log(content):\\n\\n now = datetime.datetime.now().strftime(\\\"%c\\\")\\n now_time = time.time()\\n # msg_last = '{} - {: >5.1f} seconds - {}'.format(now, now_time - TIME_LAST, content)\\n\\n if Logger._time_last is not None:\\n msg_last = Logger.human_seconds(now_time - Logger._time_last)\\n else:\\n msg_last = ' ' * 13\\n\\n msgs = [now, msg_last, content]\\n\\n msg = \\\" │ \\\".join(msgs)\\n\\n msg_lines = [\\\"─\\\" * len(content) for content in msgs]\\n\\n msg_top = \\\"─┬─\\\".join(msg_lines)\\n msg_lower = \\\"─┴─\\\".join(msg_lines)\\n\\n print(\\\" ┌─{}─┐\\\".format(msg_top))\\n print(\\\" │ {} │\\\".format(msg))\\n print(\\\" └─{}─┘\\\".format(msg_lower))\\n\\n Logger._time_last = time.time()\",\n \"def log(self, msg):\\n self.ansible.log(msg)\",\n \"def _send(self, message):\\n logger.info(message)\\n self.buffer.put(message)\",\n \"def event_logged(self, event):\\n prefix = termcolor.colored(\\\">>>\\\", \\\"yellow\\\")\\n logging.info(\\\"%s %s\\\" % (prefix, event.colored_str()))\\n if event.to:\\n subject = \\\"%s: %s\\\" % (self.name, event.phase)\\n self.send_message(event.to, subject, event_email(event, parser=self.parser))\",\n \"def test_nth_log_post(self):\\n self.conveyer.execute(self.conveyer.log(\\\"{message: \\\\\\\"first\\\\\\\"}\\\"))\\n commands = self.conveyer.log(\\\"{message: \\\\\\\"second\\\\\\\"}\\\")\\n self.assertEquals(len(commands), 1)\\n self.assertEquals(type(commands[0]), AppendLogCmd)\\n self.assertEquals(commands[0].event, \\\"{message: \\\\\\\"second\\\\\\\"}\\\")\\n self.assertEquals(self.events_out.getvalue(), \\\"{message: \\\\\\\"first\\\\\\\"}\\\")\",\n \"def send_messages(self):\\n if self.messages:\\n messages, self.messages = self.messages, []\\n self.mpub(\\\"events.%s\\\" % config.pool, messages)\",\n \"def print_messages(sent_msgs):\\n\\tprint(\\\"\\\\nHere is the initial list of messages\\\")\\n\\tfor message in messages:\\n\\t\\tprint(message)\\n\\tprint(\\\"\\\\nHere is a list of printed messages\\\")\\n\\tfor sent_msg in sorted(sent_msgs):\\n\\t\\tprint(sent_msg)\",\n \"def print_messages(sent_msgs):\\n\\tprint(\\\"\\\\nHere is the initial list of messages\\\")\\n\\tfor message in messages:\\n\\t\\tprint(message)\\n\\tprint(\\\"\\\\nHere is a list of printed messages\\\")\\n\\tfor sent_msg in sorted(sent_msgs):\\n\\t\\tprint(sent_msg)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6550122","0.63551664","0.6192797","0.601406","0.5984528","0.5872652","0.58380395","0.5811983","0.5803327","0.5792493","0.5775632","0.57648224","0.57644266","0.57573664","0.57374674","0.5730767","0.5729119","0.5690887","0.568535","0.56792635","0.56616557","0.5650943","0.5650082","0.56198496","0.56136715","0.5603306","0.55897695","0.5579788","0.55775046","0.55666727","0.5564892","0.5554616","0.5538817","0.55308205","0.54993165","0.54963595","0.54891664","0.5474408","0.54649407","0.54605126","0.54544234","0.54529893","0.5451919","0.54452515","0.54406184","0.54353756","0.54221064","0.5411409","0.54003626","0.5395716","0.53917027","0.5386291","0.53787076","0.53775364","0.537268","0.53721243","0.53670955","0.53669566","0.5365537","0.535564","0.5351785","0.5351357","0.5344319","0.53367233","0.533458","0.5331575","0.53273815","0.53264534","0.5322779","0.531684","0.5316674","0.5314442","0.52963996","0.529253","0.5288012","0.52865064","0.5272735","0.5268481","0.5267604","0.52671695","0.52573013","0.5254527","0.52511775","0.5249698","0.5249687","0.523774","0.52374357","0.5234942","0.5229257","0.52291334","0.5224798","0.5214193","0.5212675","0.52110875","0.5208654","0.52052385","0.5204766","0.520468","0.5195922","0.51942706","0.51942706"],"string":"[\n \"0.6550122\",\n \"0.63551664\",\n \"0.6192797\",\n \"0.601406\",\n \"0.5984528\",\n \"0.5872652\",\n \"0.58380395\",\n \"0.5811983\",\n \"0.5803327\",\n \"0.5792493\",\n \"0.5775632\",\n \"0.57648224\",\n \"0.57644266\",\n \"0.57573664\",\n \"0.57374674\",\n \"0.5730767\",\n \"0.5729119\",\n \"0.5690887\",\n \"0.568535\",\n \"0.56792635\",\n \"0.56616557\",\n \"0.5650943\",\n \"0.5650082\",\n \"0.56198496\",\n \"0.56136715\",\n \"0.5603306\",\n \"0.55897695\",\n \"0.5579788\",\n \"0.55775046\",\n \"0.55666727\",\n \"0.5564892\",\n \"0.5554616\",\n \"0.5538817\",\n \"0.55308205\",\n \"0.54993165\",\n \"0.54963595\",\n \"0.54891664\",\n \"0.5474408\",\n \"0.54649407\",\n \"0.54605126\",\n \"0.54544234\",\n \"0.54529893\",\n \"0.5451919\",\n \"0.54452515\",\n \"0.54406184\",\n \"0.54353756\",\n \"0.54221064\",\n \"0.5411409\",\n \"0.54003626\",\n \"0.5395716\",\n \"0.53917027\",\n \"0.5386291\",\n \"0.53787076\",\n \"0.53775364\",\n \"0.537268\",\n \"0.53721243\",\n \"0.53670955\",\n \"0.53669566\",\n \"0.5365537\",\n \"0.535564\",\n \"0.5351785\",\n \"0.5351357\",\n \"0.5344319\",\n \"0.53367233\",\n \"0.533458\",\n \"0.5331575\",\n \"0.53273815\",\n \"0.53264534\",\n \"0.5322779\",\n \"0.531684\",\n \"0.5316674\",\n \"0.5314442\",\n \"0.52963996\",\n \"0.529253\",\n \"0.5288012\",\n \"0.52865064\",\n \"0.5272735\",\n \"0.5268481\",\n \"0.5267604\",\n \"0.52671695\",\n \"0.52573013\",\n \"0.5254527\",\n \"0.52511775\",\n \"0.5249698\",\n \"0.5249687\",\n \"0.523774\",\n \"0.52374357\",\n \"0.5234942\",\n \"0.5229257\",\n \"0.52291334\",\n \"0.5224798\",\n \"0.5214193\",\n \"0.5212675\",\n \"0.52110875\",\n \"0.5208654\",\n \"0.52052385\",\n \"0.5204766\",\n \"0.520468\",\n \"0.5195922\",\n \"0.51942706\",\n \"0.51942706\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":947,"numItemsPerPage":100,"numTotalItems":95772,"offset":94700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3ODI1NzcwNywic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1weXRob24tdjEiLCJleHAiOjE3NzgyNjEzMDcsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.hGu1tnbnekFV0uHHtqILGzhoDtC82Kl-3brYMNnnh8R17mWm-FWUwIj-l_Hm3m2s3UzCEYg78LkEtDJXmrhvCA","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 |
|---|---|---|---|---|---|---|
Compute one step of the map for a score (of the given axis and with given neighbours) as a function of the opposite score | def _one_step(self, gamma, axis, opp_scores):
opp_exp = opp_scores**gamma
s = _np.array([])
for i in range(self.d[axis]):
s = _np.append(s, _np.take(opp_exp, self._neighb[axis][i]).sum())
return s/_np.mean(s) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _score_to_distance_map(y_grid, x_grid, heatmap, points_y, points_x,\n score_distance_offset):\n y_diff = y_grid[:, :, tf.newaxis] - points_y\n x_diff = x_grid[:, :, tf.newaxis] - points_x\n distance = tf.math.sqrt(y_diff**2 + x_diff**2)\n return tf.math.divide(heatmap, distance + ... | [
"0.58188856",
"0.5598756",
"0.5585042",
"0.55513406",
"0.5534682",
"0.5500189",
"0.5466905",
"0.541867",
"0.54055065",
"0.5333235",
"0.53182185",
"0.5281047",
"0.5278096",
"0.52513933",
"0.5239409",
"0.5227734",
"0.5214485",
"0.5214058",
"0.5212882",
"0.520227",
"0.5186105",
... | 0.50255334 | 43 |
Given the scores s, the list of nodes that already reached the low boundary and the ranking computed so far, check if new nodes have reached the low boundary, and, if so, updated the ranking with those | def _update_zero_rank(self, s, zero_ind, rank):
lb = self.params['low_bound']
new_zeros_ind = _np.setdiff1d(_np.nonzero(s <= lb), zero_ind)
if len(new_zeros_ind) > 0:
sorted_zeros_ind = new_zeros_ind[_np.argsort(s[new_zeros_ind])]
rank = _np.append(rank, sorted_zeros_ind)... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def rerank_candidates(s, pred2sub_rank, all_predictions, rerank_top=20):\n predicted_smiles = []\n model_input = []\n for (predict_smi, label), _ in Counter(all_predictions).most_common(rerank_top):\n if predict_smi == s:\n continue\n features = get_all_features(\n get_... | [
"0.5954974",
"0.59247744",
"0.5833818",
"0.56625795",
"0.56450963",
"0.5566416",
"0.55646116",
"0.5558839",
"0.5552098",
"0.5540993",
"0.55369794",
"0.5497016",
"0.546615",
"0.54586864",
"0.5453142",
"0.54514194",
"0.54451036",
"0.5403085",
"0.53968745",
"0.53879005",
"0.5386... | 0.6555181 | 0 |
Update the class variables after the algorithm execution | def _update_vars(self, axis, traj_s, traj_o, rank_s, rank_o, t):
if axis == 0:
self.x_traj = traj_s
self.x_ranking = rank_s
self.x_scores = traj_s[-1]
self.inverse_y_traj = traj_o
self.inverse_y_ranking = rank_o
self.inverse_y_scores = traj... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def updateData(self, *args):\n # if self.move_next_option == \"R\":\n # self.restSampling()\n # elif self.move_next_option == \"A\":\n # self.addExtra()\n # else:\n # self.continueReview()\n for name, value in self.parameter_inputs.items():\n ... | [
"0.6898461",
"0.6669482",
"0.6625015",
"0.6544939",
"0.6408313",
"0.6408313",
"0.6408313",
"0.6405048",
"0.6306032",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"0.6305308",
"... | 0.0 | -1 |
Get two lists (for rows and columns) where the row/col index gives the list of col/row indexes of the nonzero elements. | def _get_index_lists(self, mat):
n_row, n_col = mat.shape
col_ind_at_row, row_ind_at_col = [],[]
for i in range(n_row):
aux_ind = _np.where(mat[i]>0)[0]
if len(aux_ind) == 0:
raise Exception('Row {} is composed of zeros'.format(i))
col... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_empty_cells(state):\n cells = []\n for row_index, row in enumerate(state.board):\n for col_index, cell in enumerate(row):\n if cell == 0:\n cells.append([row_index, col_index])\n return cells",
"def empty_cells(state):\n cells = []\n\n for i, row in enumera... | [
"0.70034736",
"0.6999915",
"0.6924702",
"0.6525192",
"0.6505699",
"0.6490474",
"0.64878106",
"0.6456846",
"0.6356905",
"0.63506573",
"0.6348926",
"0.62902606",
"0.6273074",
"0.62722355",
"0.6267735",
"0.62005794",
"0.6167228",
"0.61156595",
"0.6083813",
"0.6070011",
"0.606649... | 0.72458094 | 0 |
Check if the algorithm has been run. It also return the trajectories and the ranking of the associated axis | def _check_run(self, axis):
if (self.x_traj, self.y_traj)[axis] is None:
if (self.inverse_x_traj, self.inverse_y_traj)[axis] is None:
raise Exception('The algorithm has not been run.')
else:
if self.params['print_info']:
print('Warning:... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def run(self, axis, gamma):\n \n # Trajectories of the main score to compute and the opposite one\n traj_s, traj_o = [_np.ones(self.d[axis])], [_np.ones(self.d[1-axis])]\n # Ranked indices of the scores\n rank_s, rank_o = _np.array([], dtype=int), _np.array([], dtype=int)\n # ... | [
"0.57092583",
"0.5609589",
"0.5562583",
"0.5543754",
"0.54045916",
"0.5378096",
"0.5376567",
"0.5344754",
"0.53006",
"0.52756476",
"0.5219423",
"0.51986915",
"0.51444024",
"0.51367295",
"0.51324886",
"0.50954634",
"0.50765365",
"0.506339",
"0.50485265",
"0.50454706",
"0.50318... | 0.7411444 | 0 |
Compute the extinction area of a binary matrix formatted as a "indexes_lists" (see "_get_index_lists"), given a ranking of the nodes and the axis (0 for row removing, 1 for column removing). | def _ext_area(axis, ranking, row_ind_at_col, col_ind_at_row):
if axis == 0:
indexes_lists = _np.array([col_ind_at_row[:], row_ind_at_col[:]])
else:
indexes_lists = _np.array([row_ind_at_col[:], col_ind_at_row[:]])
if len(ranking) != len(indexes_lists[0]):
print ('Dimensions do not ma... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def independendentColumns(matrix, rank, threshold):\n\n index = [None]*rank\n norms = [None]*rank\n\n if rank == 0:\n return index\n\n # select the first column\n index[0] = 0\n norms[0] = np.linalg.norm(matrix[:, 0])\n idx = 1\n\n if rank == 1:\n return index\n\n for i in rang... | [
"0.5215772",
"0.4802194",
"0.47601265",
"0.47544992",
"0.47510993",
"0.4719506",
"0.46831623",
"0.46391895",
"0.46330476",
"0.46060845",
"0.4589925",
"0.4584294",
"0.45521936",
"0.45242146",
"0.45011955",
"0.4497215",
"0.44914553",
"0.44876465",
"0.44790936",
"0.44733527",
"0... | 0.75243336 | 0 |
Return an ndarray having row per element in data and one column | def make_data(self, data):
return array(data, dtype=float32) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_data(data):\n\n np_data = np.array(data)\n array = []\n\n for i in range(0, np_data.shape[1]):\n array.append(np_data[:, i])\n\n return np.array(array)",
"def get_data(data):\n\n np_data = np.array(data)\n array = []\n\n for i in range(0, np_data.shape[1]):\n array.appe... | [
"0.7534442",
"0.7534442",
"0.70013255",
"0.6785662",
"0.6688916",
"0.6645851",
"0.6567787",
"0.65319115",
"0.6462152",
"0.6382598",
"0.63573694",
"0.62963057",
"0.6281688",
"0.627003",
"0.623539",
"0.62131137",
"0.61992896",
"0.6181052",
"0.6180269",
"0.616434",
"0.6149688",
... | 0.573665 | 41 |
VGG16 construct for training backbone | def __init__(self, num_classes):
super(VGG16, self).__init__()
self.vgg16_feature_extractor = VGG16FeatureExtraction(weights_update=True)
self.max_pool = nn.MaxPool2d(kernel_size=2, stride=2)
self.classifier = VGG16Classfier()
self.fc3 = _fc(in_channels=4096, out_channels=num_cla... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def build_vgg():\n input_shape = (256, 256, 3)\n\n vgg = keras.applications.VGG19(include_top = False , input_shape = input_shape , weights=\"imagenet\")\n features = vgg.get_layer(index = 9).output\n\n model = keras.Model(inputs=[vgg.inputs], outputs=[features])\n return model",
"def vgg16(pretr... | [
"0.7914276",
"0.7741606",
"0.7713254",
"0.7710423",
"0.766079",
"0.7593987",
"0.75367546",
"0.7439226",
"0.7426811",
"0.7363272",
"0.7344508",
"0.73206055",
"0.7303242",
"0.7245254",
"0.72279394",
"0.7205576",
"0.71928155",
"0.7183653",
"0.71666634",
"0.7141517",
"0.7109456",... | 0.7155615 | 19 |
This function helps find coordinates of parallel lines. It uses an orthogonal vector to work out offsets to calculate coordinates of lines parallel to (x1,y1) > (x2,y2), with a given magnitude | def offset(x1,y1,x2,y2,magnitude):
norm = math.sqrt((y2-y1)**2 + (x1-x2)**2) / magnitude
offset_x = (y2-y1)/norm
offset_y = (x1-x2)/norm
return offset_x, offset_y | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def direction_coordinates(self, gc_lines):\n lins = [(_line[0][mid], _line[0][mid + 1], _line[1][mid], _line[1][mid + 1])\n for _line, mid in zip(gc_lines, [len(_line[0]) // 2 for _line in gc_lines])\n if len(_line[0]) > 2]\n lens = [np.hypot(_line[0][0] - _line[0][-1], ... | [
"0.62555534",
"0.6251809",
"0.62259203",
"0.619858",
"0.6193819",
"0.6192046",
"0.61712044",
"0.61675787",
"0.6118712",
"0.61126447",
"0.60862005",
"0.60712665",
"0.60499895",
"0.6047329",
"0.60366255",
"0.602664",
"0.59670717",
"0.5939942",
"0.59200275",
"0.5916448",
"0.5909... | 0.6228341 | 2 |
This algorithm creates a cut list for a cut of depth z_thickness between (x1,y1)>(x2,y2). | def line(x1,y1,x2,y2,z_thickness,laser):
#Global variables that are used by all algorithms
layers = int(z_thickness/laser["z_spacing"])
#Works out offset when beginning on a new layer
taper = math.tan(math.radians(laser["kerf_angle"]/2)) * laser["z_spacing"]
taper_x,taper_y = offset(x1,y1,x2,y2,taper)
#... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def pyramid_slice(x1,y1,x2,y2,z,delta,deltaz,taper_x,taper_y,taper_straight,layers):\r\n\tcutlist = []\r\n\ty_max = abs(y1-y2)\r\n\tfor a in range(layers):\r\n\t\ti = 0\r\n\t\tnew_x1, new_y1, new_x2, new_y2 = x1 - a*taper_x, y1-a*taper_straight, x2+a*taper_x, y2+a*taper_y\r\n\t\twhile abs(new_y1 - (y1 - a*taper_st... | [
"0.6802484",
"0.639531",
"0.570502",
"0.55743366",
"0.5564015",
"0.54822946",
"0.54609275",
"0.54286385",
"0.541968",
"0.54144114",
"0.5410887",
"0.5384912",
"0.5378323",
"0.53586614",
"0.53429186",
"0.53311557",
"0.53209656",
"0.52847123",
"0.52787846",
"0.5276502",
"0.52765... | 0.555994 | 5 |
This algorithm returns a cutlist which describes a series of parallel lines, each with a different z value, to calibrate the z value for the laser. | def z_focus(block,cut,laser):
cutlist = []
iterations = int(cut["final_dimension_z"]/laser["z_spacing"])
#Currently x,y is decided to take up a good amount of the block, rather than having set distances and sizes
y = cut["final_dimension_y"]/2
offset = laser["xy_spacing"]
x = 0
cutlist.append(["z_abs","... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def buildcutlineset():\r\n cutlineset=[[[-3.2697,-3.2697],[-4.3304,-4.3304]],[[-3.2697,-4.3304],[-4.3304,-3.2697]]]\r\n cutlineset.extend([[[-3.2697,176.0104],[-4.3304,174.9497]],[[-3.2697,174.9497],[-4.3304,176.0104]]])\r\n cutlineset.extend([[[176.0104,176.0104],[174.9497,174.9497]],[[176.0104,174.9497]... | [
"0.6449699",
"0.6432063",
"0.59427017",
"0.5941269",
"0.5936059",
"0.5897232",
"0.5840504",
"0.5797004",
"0.57667243",
"0.57253015",
"0.5718147",
"0.5635782",
"0.56259125",
"0.5621187",
"0.55818194",
"0.5545392",
"0.5544098",
"0.5543384",
"0.55397063",
"0.553851",
"0.55319935... | 0.5417235 | 28 |
This algorithm returns a cutlist which performs a simple core operation. The laser runs race track style around the specified core, going around all 4 sides before the laser moves down to the next layer. The poly is expected to fall off the core at the end of the entire cutting operation. | def simple_core(block,cut,laser):
layers = int(block["thickness"]/laser["z_spacing"])
#Since all cuts are square, the offsets are more obvious than in the general linear case.
taper = math.tan(math.radians(laser["kerf_angle"]/2)) * laser["z_spacing"]
max_delta = math.tan(math.radians(laser["kerf_angle"]/2))... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_traces_for_core(traces, traces_per_core, core_num):\n start = traces_per_core * core_num\n end = min(len(traces), traces_per_core * (core_num + 1))\n return traces[start:end]",
"def minimize_core(s, core):\n for i in range(len(core)):\n new_core = core[:i] + core[i+1:]\n print \... | [
"0.5738572",
"0.5688451",
"0.547744",
"0.52396184",
"0.52205116",
"0.51830083",
"0.5107131",
"0.50293916",
"0.50252926",
"0.5000583",
"0.49980915",
"0.49932697",
"0.49482554",
"0.49387234",
"0.49366552",
"0.49193186",
"0.49054828",
"0.48359147",
"0.48309058",
"0.48211256",
"0... | 0.5529602 | 2 |
This algorithm returns a cutlist which performs a vertical core operation. The laser cuts off one side of poly at a time, rotating the block such that the edge of the laser "cone" is parallel to the SCD core. After one side of the block has been removed, the block is rotated 90 degrees and the algorithm repeats until a... | def vertical_core(block,cut,laser):
layers = int(block["thickness"]/laser["z_spacing"])
angle = math.radians(laser["kerf_angle"]/2)
taper = math.tan(angle) * laser["z_spacing"]
u = math.tan(2 * angle) * (block["thickness"] + laser["z_final_overshoot"])
z_0 = block["thickness"]*math.cos(angle) + math.sin(a... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def GetContourValuesLengthsAndSubContoursAndOrderOfSubContoursByFrame(\n watershed, allValsByFrame\n):\n scListByFrame, orderOfSCsByValueByFrame = GetSubContoursAndOrderingByFrame(\n watershed, allValsByFrame\n )\n cVLSByFrame = [[sc.cVLS() for sc in scList] for scList in scListByFrame]\n ret... | [
"0.5736482",
"0.54933506",
"0.5457592",
"0.5425763",
"0.5424649",
"0.54244435",
"0.5406228",
"0.5358565",
"0.53265375",
"0.5317147",
"0.5295013",
"0.5287533",
"0.5257076",
"0.524541",
"0.51966155",
"0.51694214",
"0.5141546",
"0.51079696",
"0.51050085",
"0.5099054",
"0.5085029... | 0.6428014 | 0 |
This algorithm returns a cutlist which performs a cut which is a quarter of the total slicing required to create a pyramid top, while ensuring a flat bottom above it, both of which is required for an OG seed. | def pyramid_slice(x1,y1,x2,y2,z,delta,deltaz,taper_x,taper_y,taper_straight,layers):
cutlist = []
y_max = abs(y1-y2)
for a in range(layers):
i = 0
new_x1, new_y1, new_x2, new_y2 = x1 - a*taper_x, y1-a*taper_straight, x2+a*taper_x, y2+a*taper_y
while abs(new_y1 - (y1 - a*taper_straight)) < y_max and x1 > ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_cuts(l, step, size):\n ncuts= (len(l)-size)/step + 1\n cuts= [None]*ncuts\n for i in xrange(ncuts): \n cuts[i]= l[i*step:i*step+size]\n if ncuts*step < len(l):\n cuts.append(l[ncuts*step:])\n return cuts",
"def generate_possible_slices(L, H):\n n_min = 2 * L\n n_max = H... | [
"0.6510405",
"0.6228084",
"0.60608464",
"0.60395974",
"0.5939082",
"0.59373015",
"0.5816045",
"0.5764991",
"0.5731781",
"0.5705467",
"0.57034826",
"0.57019746",
"0.5698488",
"0.56911135",
"0.56729025",
"0.5668522",
"0.56589216",
"0.5610545",
"0.56084186",
"0.5563644",
"0.5558... | 0.67580295 | 0 |
This algorithm returns a cutlist which performs OG slicing. It begins with an optional core, then cuts out slices until as many OG seeds as specified are removed from the block. | def oss_stacked(block, cut, laser):
x0_1, x1_1, z0_1, taper_x_1, taper_y_1, layers_1, pyramid_angle_1 = oss_helper(block, cut, laser, cut["final_dimension_x"]/2)
x0_2, x1_2, z0_2, taper_x_2, taper_y_2, layers_2, pyramid_angle_2 = oss_helper(block, cut, laser, cut["final_dimension_y"]/2)
angle = math.radians(laser... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _iterative_cutting(g, p):\n\n to_be_processed = [g]\n K = math.ceil(len(g.nodes()) / p)\n\n res = []\n while len(to_be_processed) > 0:\n\n g = to_be_processed.pop()\n g_l, g_r = kernighan_lin_bisection(g, weight=\"rate\")\n\n ... | [
"0.55150145",
"0.5500191",
"0.5455198",
"0.5378894",
"0.53707415",
"0.5246031",
"0.5238846",
"0.5228055",
"0.51568055",
"0.51228464",
"0.51081675",
"0.51019835",
"0.5090313",
"0.5088919",
"0.50825244",
"0.5066888",
"0.50596964",
"0.5026915",
"0.5015684",
"0.5010477",
"0.50010... | 0.5538502 | 0 |
This algorithm takes a cutlist and returns an estimate for the time | def time_taken(json_cutlist, laser):
cutlist = json.loads(json_cutlist)
time = 0
coordinate_array = [0, 0]
for a in cutlist:
if a[0] == "jump" or a[0] == "mark":
coordinate_array = [float(a[1]) - coordinate_array[0], float(a[2]) - coordinate_array[1]]
mag = math.sqrt(coordinate_array[0]**2 + coordina... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def hit_time(tmat,start_list,targ_list,ntraj = 1000, cutoff=1000):\n \n # get state names\n nstates = tmat.shape[0]\n states = array([ii for ii in range(nstates)])\n \n times = list()\n \n for ii in range(ntraj):\n curr = choice(start_list)\n tm = 0\n while curr not in ... | [
"0.627223",
"0.5568012",
"0.55149806",
"0.542661",
"0.54003626",
"0.5371899",
"0.5357149",
"0.5351884",
"0.5332691",
"0.53161633",
"0.52837616",
"0.52747995",
"0.5273911",
"0.52718514",
"0.52711356",
"0.5226085",
"0.5219191",
"0.51971257",
"0.51944643",
"0.5190102",
"0.518243... | 0.6458329 | 0 |
This function takes a cut_configuration json object and calls the function corresponding to the desired cut, thereby returning the cutlist. | def generateCutList(cut_configuration):
#Check that this line reads json.loads(cut_configuration)
input_json = json.load(cut_configuration)
#Currently only desired_cut and laser_cut_config are required
try:
block = input_json["block"]
except:
pass
try:
cut = input_json["desired_cut"]
laser = i... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def loadCutFolder(config):\n cutfolder = QFramework.TQFolder(\"__baseCut__\") #not a name any user should use but still sort of readable\n cutfolder.setTagString(\".cutExpression\",\"1.\") #pass all events, this is only a common handle for all actual (sub)cuts\n cutfolder.setTagBool(\".skipJobs\",True) #d... | [
"0.6149866",
"0.5558365",
"0.55202043",
"0.52206475",
"0.5109341",
"0.49454144",
"0.4927624",
"0.49099135",
"0.49094042",
"0.48717844",
"0.4865596",
"0.4846522",
"0.47562224",
"0.471486",
"0.47056",
"0.46879908",
"0.4677999",
"0.46680018",
"0.46643007",
"0.4607456",
"0.454606... | 0.71448123 | 0 |
Get updated learning rate. | def get_lr(self):
# HACK: We need to check if this is the first time ``self.get_lr()`` was called,
# since ``torch.optim.lr_scheduler._LRScheduler`` will call ``self.get_lr()``
# when first initialized, but the learning rate should remain unchanged
# for the first epoch.
if not s... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_learning_rate(self):\n config = self.config\n cur_lr = Train_model_pipeline.adjust_learning_rate(\n self.optimizer,\n self.epoch,\n config[\"training\"][\"learning_rate\"],\n decay=config[\"training\"][\"lr_decay_rate\"],\n step=config[\"... | [
"0.79935455",
"0.79565597",
"0.78638303",
"0.76802355",
"0.7612205",
"0.7602973",
"0.7580131",
"0.74478555",
"0.7442717",
"0.74091333",
"0.7381036",
"0.7336032",
"0.7336032",
"0.7331142",
"0.72541714",
"0.72166234",
"0.72166234",
"0.71983415",
"0.7194819",
"0.70593596",
"0.70... | 0.61572826 | 75 |
check it has a solution | def has_solution(self) -> bool:
pass | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def did_solve(self) -> bool:\n pass",
"def is_solved(self):\n if not self._find_empty():\n return True\n else:\n return False",
"def did_solve(self):\n return self._solution[\"status\"] == \"optimal\"",
"def has_solution(self) -> bool:\n if self in [se... | [
"0.7137686",
"0.7136563",
"0.7095094",
"0.70714545",
"0.7049462",
"0.7029765",
"0.6964778",
"0.6960238",
"0.6939422",
"0.68836486",
"0.6876838",
"0.6864891",
"0.68153703",
"0.6815134",
"0.6724094",
"0.6690701",
"0.66641307",
"0.6656697",
"0.6656075",
"0.65969825",
"0.65919304... | 0.8243674 | 0 |
Define the menu layout | def get_html(self) -> List[ComponentMeta]:
menu = dbc.DropdownMenu(
children=[
dbc.DropdownMenuItem(_menu_settings["header"], header=True),
dbc.DropdownMenuItem(
_menu_settings["item-0"][0],
_menu_settings["item-0"][1],
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def create_menus( self ):",
"def create_menu():",
"def create_layout() -> None:\n\n st.sidebar.title(\"Menu\")\n app_mode = st.sidebar.selectbox(\"Please select a page\", [' I. Homepage',\n \"II. Download data\" ,\n ... | [
"0.7228054",
"0.7096764",
"0.70145935",
"0.6930015",
"0.6892374",
"0.68760407",
"0.67835313",
"0.66314065",
"0.66196865",
"0.65105206",
"0.6458277",
"0.6445279",
"0.6445256",
"0.6438403",
"0.64325565",
"0.63978887",
"0.6381949",
"0.637196",
"0.63675284",
"0.6361078",
"0.63495... | 0.0 | -1 |
Initialize the navigation bar | def get_html(self) -> List[ComponentMeta]:
nav = dbc.Navbar(
className="penn-medicine-header px-0",
children=html.Div(
className="d-flex align-items-center w-100",
children=[
html.Div(
className="px-3",
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def initialize(self):\n super(QtMainWindow, self).initialize()\n self.update_menu_bar()",
"def init_menu_bar(self):\n # Load from file action\n load_action = QtGui.QAction(QtGui.QIcon('open.png'), '&From File...', self)\n load_action.setShortcut('Ctrl+L')\n load_action.s... | [
"0.68171155",
"0.6107692",
"0.6052145",
"0.60315436",
"0.60225713",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6012156",
"0.6007548",
"0.5998332",
"0.59736603",
"0.59092045",
"0.5872221"... | 0.0 | -1 |
Reads Images in base directory DIR using 'classes' (computed from sub directories ) | def preprocess_from_dir(DIR,
classes=None,
IMG_SIZE=(224,224),
channels=3,
per_class_size=None,
normalize_train=False,
mean_subtraction=None,
isS... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def process_images():\n create_dirs()\n for root, dirs, files in os.walk(IN):\n for name in files:\n if name[0] == '.':\n continue\n process_image(name)",
"def _get_filenames_and_classes(dataset_dir):\n # print 'DATASET DIR:', dataset_dir\n # print 'subdir:', [name for name in os.list... | [
"0.7321848",
"0.68896234",
"0.6826946",
"0.66698617",
"0.6657406",
"0.6633416",
"0.65999025",
"0.6553935",
"0.6523276",
"0.6521498",
"0.64866954",
"0.64619726",
"0.6459432",
"0.6443935",
"0.6438473",
"0.64238954",
"0.64133865",
"0.6406419",
"0.6398897",
"0.63965183",
"0.63886... | 0.5859994 | 92 |
Normalizes the data to mean 0 and standard deviation 1 | def normalize(x, dtype='float32'):
# x/=255.0 raises a TypeError
# x = x/255.0
# Converting to float32 and normalizing (float32 saves memory)
x = x.astype(dtype) / 255
return x | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def normalize(data):\n data = numpy.asmatrix(data)\n std_devs = numpy.std(data, axis=1)\n std_devs[std_devs == 0] = 1 # prevent div by 0\n return (data - numpy.mean(data, axis=1)) / std_devs",
"def normalize_data(data):\n mean = np.mean(data)\n std = np.std(data)\n return (data - mean) / std... | [
"0.8334346",
"0.8145812",
"0.8115416",
"0.80993706",
"0.80993706",
"0.8077115",
"0.7967708",
"0.78944945",
"0.78458416",
"0.78052527",
"0.7734523",
"0.7707518",
"0.770103",
"0.76728106",
"0.76322484",
"0.75377613",
"0.75027645",
"0.74743336",
"0.7383516",
"0.7299807",
"0.7280... | 0.0 | -1 |
Step O must be finished before step C can begin. | def convert_input_text(text):
steps = defaultdict(list)
predecessors = set()
for line in text:
regex = search(r"Step (.) must be finished before step (.) can begin.", line)
# steps[step] = [list of predecessors]
steps[regex.group(2)].append(regex.group(1))
predecessors.add(re... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def do_step(self) -> None:",
"def _step(self) -> None:",
"def _step(self):\n pass",
"def step(self):\n #1. Time progresses\n self.time_operator.step()\n \n #2. Form and dissolve relationships\"\n self.relationship_operator.step()\n\n #3. HIV transmission\n ... | [
"0.63544285",
"0.63411146",
"0.6261979",
"0.61237234",
"0.59484553",
"0.58107793",
"0.5798005",
"0.5778751",
"0.57389134",
"0.56745815",
"0.56745815",
"0.56745815",
"0.5651764",
"0.56497353",
"0.5640354",
"0.5634729",
"0.5625408",
"0.55929816",
"0.55789346",
"0.5559355",
"0.5... | 0.0 | -1 |
Make sure that we can pop from the dictionary's value. | def test_remove_predecessors():
assert remove_predecessors({"A": ["B", "C"]}, "B") == {"A": ["C"]}
assert remove_predecessors({"A": ["B", "C"]}, "D") == {"A": ["B", "C"]} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def pop(self, key, *args):\n return super(ReadOnlyDict, self).pop(key, *args) # pragma: no cover",
"def popitem(self):\n return super(ReadOnlyDict, self).popitem()",
"def pop(self, key):\n pass",
"def remove_value(self, thing_key, dkey):\n if thing_key in self.things_dict:\n ... | [
"0.7131473",
"0.7101309",
"0.67752934",
"0.67436886",
"0.6718935",
"0.6602139",
"0.6528528",
"0.64869654",
"0.648454",
"0.6478647",
"0.6470268",
"0.6445865",
"0.64151543",
"0.64034253",
"0.6395446",
"0.62999696",
"0.6270913",
"0.62059563",
"0.6182744",
"0.61714023",
"0.616790... | 0.0 | -1 |
Compare the sort to the example. | def test_find_sequential_ordering():
example = {
"C": [],
"A": ["C"],
"F": ["C"],
"B": ["A"],
"D": ["A"],
"E": ["B", "D", "F"],
}
assert find_sequential_ordering(example) == "CABDFE" | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_sort_array(self):\r\n self.assertEqual(sort_array([6, 4, 9, 10]), [4, 6, 9, 10])",
"def test_insertSort(self):\n\t\tsortObj=insertSort()\n\t\tself.assertEqual(sortObj.run_sort(self.test_1[0]),self.test_1[1])",
"def test_sort(self):\n expected = [\n self.TDTT(when=self.dt_when ... | [
"0.67170554",
"0.6628306",
"0.6544598",
"0.65049016",
"0.64927745",
"0.64916337",
"0.64914834",
"0.6488707",
"0.64275587",
"0.64019525",
"0.6396425",
"0.6384852",
"0.6351696",
"0.6299925",
"0.6294106",
"0.62695056",
"0.62650406",
"0.62421703",
"0.6240233",
"0.6208013",
"0.620... | 0.0 | -1 |
Compare the duration to the example. | def test_find_parallel_duration():
pt2_example = {
"C": [],
"A": ["C"],
"F": ["C"],
"B": ["A"],
"D": ["A"],
"E": ["B", "D", "F"],
}
assert find_parallel_duration(pt2_example, 2, 0) == 15 | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_duration(self):\n for duration_, _, _ in self.test_cases:\n self.assertEqual(Rest(duration_).duration, duration_)",
"def test_duration_property(self):\n recording_dt = 0.1\n recording_shape = {\n 'no_timesteps': 1000,\n 'no_sweeps': 10,\n ... | [
"0.6993373",
"0.64634085",
"0.6261238",
"0.6072691",
"0.6072691",
"0.60668623",
"0.60171825",
"0.58592576",
"0.58530915",
"0.58014023",
"0.56802076",
"0.5668855",
"0.5660802",
"0.55880255",
"0.55880255",
"0.55513406",
"0.5545389",
"0.5539826",
"0.55272925",
"0.55245674",
"0.5... | 0.5158579 | 75 |
obtain a time duration between the recent events of the same bizLocation | def obtain_time_duration(collection, new_document):
# Obtain the previously existing two document for the incoming bizLocation
# Sort them in descending order
# The first in the list is the newly inserted document detected by Change Streams
# the second document is of interest
prev_documents ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def duration(self):\r\n return self.t2 - self.t1",
"def duration(self):\r\n return (self.end_time or time.time()) - self.start_time",
"def duration(self):\n return self._end - self._begin",
"def GetDuration(self):\n return _gmat_py.LocatedEvent_GetDuration(self)",
"def compute_go_duration(s... | [
"0.6247451",
"0.6066179",
"0.59149534",
"0.587591",
"0.58055454",
"0.57777333",
"0.57665247",
"0.5748646",
"0.5732722",
"0.572424",
"0.571313",
"0.5707432",
"0.56868815",
"0.5675801",
"0.565217",
"0.5647044",
"0.56372106",
"0.56028074",
"0.5601279",
"0.5599238",
"0.5544639",
... | 0.6420903 | 0 |
Objective function to maximize total score over matches. | def objective_score(me, other, turns, noise, repetitions, match_attributes=None):
match = axl.Match((me, other), turns=turns, noise=noise,
match_attributes=match_attributes)
if not match._stochastic:
repetitions = 1
scores_for_this_opponent = []
for _ in range(repetitions)... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def judge(self):\n self.bounds = 0.0\n self.best = self.lives[0]\n for life in self.lives:\n life.score = self.matchFun(life)\n self.bounds += life.score\n if self.best.score < life.score:\n self.best = life",
"def j... | [
"0.6647923",
"0.6647923",
"0.6601076",
"0.653043",
"0.6438808",
"0.63390124",
"0.6311056",
"0.62663805",
"0.62656355",
"0.6254761",
"0.6223245",
"0.62063557",
"0.6162101",
"0.61386317",
"0.6135826",
"0.61111224",
"0.6108157",
"0.61070305",
"0.60964113",
"0.608142",
"0.607549"... | 0.6370619 | 5 |
Objective function to maximize total score difference over matches. | def objective_score_diff(me, other, turns, noise, repetitions,
match_attributes=None):
match = axl.Match((me, other), turns=turns, noise=noise,
match_attributes=match_attributes)
if not match._stochastic:
repetitions = 1
scores_for_this_opponent = []
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def judge(self):\n self.bounds = 0.0\n self.best = self.lives[0]\n for life in self.lives:\n life.score = self.matchFun(life)\n self.bounds += life.score\n if self.best.score < life.score:\n self.best = life",
"def j... | [
"0.6714346",
"0.6714346",
"0.65570205",
"0.64613044",
"0.6316741",
"0.62868387",
"0.6236504",
"0.62348974",
"0.6215959",
"0.6197578",
"0.61927944",
"0.61494",
"0.61126816",
"0.6108994",
"0.61036104",
"0.60992247",
"0.60669684",
"0.6046158",
"0.60387737",
"0.6037669",
"0.60316... | 0.6550279 | 3 |
Objective function to maximize Moran fixations over N=4 matches | def objective_moran_win(me, other, turns, noise, repetitions, N=5,
match_attributes=None):
population = []
for _ in range(N):
population.append(me.clone())
population.append(other.clone())
mp = axl.MoranProcess(population, turns=turns, noise=noise)
scores_for_thi... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def perform_mindmatch(\n A: np.array, n_trim: int = None,\n n_match: int = 6, cois: list = None\n):\n # setting distance in the diagonal\n A[np.arange(len(A)), np.arange(len(A))] = -1000 \n\n # if conflict of interest (COIs) is available, add to the matrix\n cois = [(c1, c2) for (c1, c2) in cois\... | [
"0.6166018",
"0.582967",
"0.58052844",
"0.58043885",
"0.569874",
"0.5562046",
"0.5560261",
"0.55063146",
"0.5504146",
"0.54418087",
"0.5436338",
"0.543598",
"0.54290164",
"0.539945",
"0.53978187",
"0.53978187",
"0.5395617",
"0.5393824",
"0.53581244",
"0.5314676",
"0.53036773"... | 0.5245856 | 30 |
Return the overall mean score of a Player | def score_player(player, objective, opponents_information, weights=None, sample_count=None):
scores_for_all_opponents = []
if sample_count is not None:
indices = np.random.choice(len(opponents_information), sample_count)
opponents_information = [opponents_information[i] for i in indices]
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_mean_score(rating_scores):\n return sum(rating_scores) / len(rating_scores)",
"def getAverage(self):\n return sum(self.scores) / len(self.scores)",
"def get_total_score(self):\n\n # Return the player's total score\n return self._total_score",
"def calc_mean_score(movies: List[Mo... | [
"0.7505888",
"0.7412792",
"0.7344528",
"0.72962356",
"0.713673",
"0.7091335",
"0.7069279",
"0.68148583",
"0.68021953",
"0.6720858",
"0.6720858",
"0.6720858",
"0.6719883",
"0.670838",
"0.6703316",
"0.66747105",
"0.66253746",
"0.66124016",
"0.65976983",
"0.6594148",
"0.65919864... | 0.61413795 | 86 |
Load the best num parameters from the given file. | def load_params(player_class, filename, num):
parser = player_class.deserialize_parameters
all_params = []
with open(filename) as datafile:
reader = csv.reader(datafile)
for line in reader:
score, rep = float(line[-2]), line[-1]
all_params.append((score, rep))
al... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def loadBestFit(self):\n bestFit, err = [], []\n row = 0\n with open(self.filename) as f:\n for lines in f.readlines():\n line = lines.strip(\"\\n\")\n data = line.split(\" \")\n if row == self.Npar:\n for kk in range(s... | [
"0.6628179",
"0.6617545",
"0.6580962",
"0.64695466",
"0.64075434",
"0.62310404",
"0.6230305",
"0.62199324",
"0.61862564",
"0.61166227",
"0.6109736",
"0.6079469",
"0.5998742",
"0.5996682",
"0.5978318",
"0.59457254",
"0.5927295",
"0.5894868",
"0.5883919",
"0.58676887",
"0.58008... | 0.73936313 | 0 |
Update UserCreate instance firstname | def update_firstname(state: UserCreate, firstname: str) -> None:
state.name.first = firstname
state.slug = slugify(f"super-user: {state.name.first} {state.name.last}") | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def signup(self, request, user):\n user.first_name = self.cleaned_data['first_name']\n user.last_name = self.cleaned_data['last_name']\n user.save()\n\n return user",
"def first_name(self, instance):\r\n return instance.user.first_name",
"def register_user_first_name(self, me... | [
"0.7218886",
"0.72107047",
"0.7091783",
"0.70805126",
"0.68391097",
"0.6802234",
"0.6792022",
"0.6786857",
"0.668164",
"0.66436106",
"0.6567716",
"0.65634876",
"0.65209407",
"0.64976525",
"0.64976525",
"0.6494254",
"0.6456594",
"0.6450713",
"0.642974",
"0.6408176",
"0.6386372... | 0.81902975 | 0 |
Build User response instance | def build_user(data: Dict[Any, Any]) -> User:
return User(**data) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get():\n return prepare_response(get_user_info())",
"def get_user_details(self, response):\n fullname, first_name, last_name = self.get_user_names(\n response.get(\"fullName\"),\n response.get(\"firstName\"),\n response.get(\"lastName\"),\n )\n ret... | [
"0.6529011",
"0.6426592",
"0.6373598",
"0.63219744",
"0.61717933",
"0.6141898",
"0.61418366",
"0.6088162",
"0.6084343",
"0.6070999",
"0.60210335",
"0.6011697",
"0.60002035",
"0.5984306",
"0.5978686",
"0.59628445",
"0.59532416",
"0.5891522",
"0.5889954",
"0.58876634",
"0.58819... | 0.6766939 | 0 |
This methods runs one episode for a gym environment. deterministic == True => agent executes only greedy actions according the Q function approximator (no random actions). do_training == True => train agent | def run_episode(env, agent, deterministic, skip_frames=0, do_training=True, rendering=True, max_timesteps=10000,
history_length=0, manual=False):
stats = utils.EpisodeStats()
# Save history
image_hist = []
step = 0
state = env.reset()
env.viewer.window.on_key_press = utils.k... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _train_simulate(self, env, train_episode=None):\n # The initial observation\n o_r_d_i = [env.reset()] + [None]*3 # o_r_d_i means \"Observation_Reward_Done_Info\"\n # Reset all the manager parameters\n self.reset(o_r_d_i[0][\"manager\"])\n done = False\n current_option... | [
"0.75989807",
"0.7317887",
"0.731042",
"0.72842157",
"0.72729677",
"0.7271064",
"0.71605587",
"0.70899516",
"0.70623356",
"0.70282584",
"0.70133144",
"0.69955355",
"0.6992601",
"0.69857806",
"0.6981672",
"0.69651085",
"0.69529545",
"0.6945286",
"0.6932808",
"0.69287926",
"0.6... | 0.7439519 | 1 |
Split the course string in to a course number and a course postfix Expects all strings to be in the format numpostfix. For instance, | def _split_course_string(course_string):
course_num = ''
course_postfix = ''
count = 0
for indx, char in enumerate(course_string):
if not char.isdigit():
break
course_num += char
count += 1
try:
course_num = int(course_num)
except ValueError:
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def space_coursecodes(input_string):\n\n coursecode_pattern = re.compile(r\"[A-Z]{2,6}\\s{,1}-{,1}/{,1}[0-9]{2,6}-{,1}/{,1}([0-9]{2,6}){,1}\")\n\n # for any coursecodes in string, find beginning and end index of each\n ind_pairs = [(m.start(0), m.end(0)) for m in re.finditer(coursecode_pattern, input_stri... | [
"0.59728956",
"0.5590606",
"0.5450177",
"0.533765",
"0.5325984",
"0.51580155",
"0.5109719",
"0.5105101",
"0.5051153",
"0.5044799",
"0.49115965",
"0.48173293",
"0.48144338",
"0.48039567",
"0.47931984",
"0.47742018",
"0.4764439",
"0.47197244",
"0.47027755",
"0.46838984",
"0.462... | 0.7670243 | 0 |
Add a new column named placeholder fill with the arg_1 value | def main(dataframe: pd.DataFrame, arg_1: str='nothing') -> pd.DataFrame:
dataframe["placeholder"] = arg_1
return dataframe | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def insert_column(df, colTitle, colIndex, fillValue):\n if colTitle not in df.columns:\n df.insert(colIndex, colTitle, fillValue, True)\n return df",
"def add_column_parameter(params, name, dataset, args, key):\n column_id = args.get_value(key, raise_error=False)\n if column_id is None:\n ... | [
"0.61651623",
"0.60531425",
"0.5932682",
"0.55233854",
"0.53711224",
"0.5348192",
"0.5308065",
"0.52713895",
"0.5266658",
"0.51256454",
"0.5117017",
"0.51092947",
"0.510111",
"0.5097036",
"0.5096841",
"0.50488573",
"0.50472313",
"0.50351626",
"0.50323486",
"0.5029519",
"0.502... | 0.6702973 | 0 |
Insert a new node. | def insert(self, val):
node = Node(val)
current = self.root
if self.root is None:
self.root = node
return node
while current:
if val >= current.val:
if current.right is not None:
current = current.right
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __insert(self, node, value):\n #if DEBUG: print('\\t__insert({})'.format(value))\n\n new = Node(value, node.next)\n node.next = new\n return new",
"def insert_node(self, data):\n\t\tif self.root is None:\n\t\t\tself.root = Node(data)\n\t\telse:\n\t\t\tcurrent_node = self.root\n\t\... | [
"0.7825037",
"0.7765275",
"0.7721343",
"0.7457422",
"0.74511695",
"0.74140745",
"0.73851484",
"0.7339789",
"0.7339789",
"0.73216206",
"0.73207855",
"0.7279264",
"0.72762483",
"0.72737384",
"0.72505534",
"0.7235147",
"0.7235147",
"0.7208238",
"0.719422",
"0.71857184",
"0.71846... | 0.0 | -1 |
Endpoint qui permet d'envoyer la convention de partenariat par mail pour une perm d'id {id}. | def send_convention(request, id):
perm = perm_models.Perm.objects.get(pk=id)
convention_template = get_template('convention_partenariat.html')
convention_context = {
'perm': perm,
'articles': perm.get_convention_information()['perm_articles'],
'montant': round(perm.get_montant_deco_max(), ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def envoi_par_mail(self):\n cr , uid, context = self.env.args\n if not self.pool['res.users'].has_group(cr, uid, 'is_plastigray.is_comptable_group'):\n raise Warning(u\"Accès non autorisé !\")\n ids=[]\n for obj in self:\n ids.append(str(obj.id))\n if len(id... | [
"0.6005149",
"0.5587609",
"0.5556423",
"0.5496287",
"0.52939004",
"0.5288747",
"0.52882147",
"0.52684224",
"0.52666515",
"0.5243778",
"0.5187994",
"0.5171401",
"0.51496404",
"0.5147281",
"0.5110905",
"0.50985926",
"0.5092945",
"0.50828236",
"0.50735444",
"0.5072316",
"0.50681... | 0.6470842 | 0 |
Endpoint qui permet d'envoyer le justificatif de paiement par mail pour une perm d'id {id}. | def send_justificatif(request, id):
perm = perm_models.Perm.objects.get(pk=id)
info = perm.get_justificatif_information()
justificatif_template = get_template('justificatif_paiement.html')
justificatif_context = {
'perm': perm, 'articles': info['perm_articles'], 'total_ht': info['total_ht'],
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def send_convention(request, id):\n perm = perm_models.Perm.objects.get(pk=id)\n convention_template = get_template('convention_partenariat.html')\n convention_context = {\n 'perm': perm,\n 'articles': perm.get_convention_information()['perm_articles'],\n 'montant': round(perm.get_montant_d... | [
"0.57655394",
"0.5716651",
"0.56478196",
"0.56307864",
"0.55586624",
"0.5510274",
"0.54520583",
"0.54152286",
"0.5387207",
"0.5373411",
"0.5325026",
"0.53217953",
"0.529948",
"0.52949625",
"0.52771795",
"0.5257251",
"0.5247731",
"0.5247631",
"0.52378786",
"0.52317333",
"0.522... | 0.63593924 | 0 |
Build the right part of the fireball function. | def build_rightpart():
# build in 1: (K dec)
apply_card("put", 1)
apply_slot(1, "dec")
apply_card("K", 1)
# build in 0: greg
build_greg(0)
# smash together to get (greg (K dec)) in 0
smash()
# copy it to 1.
apply_card("put", 1)
apply_slot(1, "zero")
apply_card("get", 1... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def build_fireball():\n # build the right part\n build_rightpart()\n\n # copy it to 4.\n copy(0, 4)\n\n # build the left part, now it's in 0\n build_leftpart()\n\n # copy right part from 4 to 1.\n copy(4, 1)\n # smash together for whole fireball.\n smash()",
"def build_wall(): #py:... | [
"0.7823686",
"0.5754557",
"0.56262046",
"0.5477109",
"0.5417354",
"0.53973466",
"0.5374712",
"0.53535587",
"0.53477806",
"0.5309742",
"0.52957034",
"0.5281329",
"0.52798027",
"0.5256859",
"0.5233532",
"0.5210926",
"0.519959",
"0.51973045",
"0.51967686",
"0.5172551",
"0.516020... | 0.0 | -1 |
Build the left part of the fireball function. Doing this uses slots 0,1,2,3 and the result will be in slot 0. (S (horace ((S (horace ((S (horace (greg (K S)))) ((S (horace fanny)) (greg I))))) june ((S (horace fanny)) ian) ))) kelly | def build_leftpart():
# build kelly.
build_kelly()
# copy kelly to 3.
copy(0, 3)
# build june in slots 0,1,2
build_june()
# copy kelly to slot 1
copy(3, 1)
# smash together to get (june kelly) in 0
smash()
# copy (june kelly) to 1
copy(0, 1)
# build horace in 0
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def build_fireball():\n # build the right part\n build_rightpart()\n\n # copy it to 4.\n copy(0, 4)\n\n # build the left part, now it's in 0\n build_leftpart()\n\n # copy right part from 4 to 1.\n copy(4, 1)\n # smash together for whole fireball.\n smash()",
"def keyLeft(self):\n ... | [
"0.70482737",
"0.58627445",
"0.58096784",
"0.58096784",
"0.5768745",
"0.5619706",
"0.55908644",
"0.55596286",
"0.5548311",
"0.5537584",
"0.55325747",
"0.5531275",
"0.5530027",
"0.55278164",
"0.54952",
"0.5482912",
"0.54783756",
"0.54747903",
"0.5452353",
"0.5442784",
"0.54378... | 0.7919818 | 0 |
Build the fireball function. We'll apply the Y combinator to it. Stomps registers [0,4]. | def build_fireball():
# build the right part
build_rightpart()
# copy it to 4.
copy(0, 4)
# build the left part, now it's in 0
build_leftpart()
# copy right part from 4 to 1.
copy(4, 1)
# smash together for whole fireball.
smash() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_fy(self):\n\n def fy(p):\n p0, p1 = p\n e = anp.exp(-(p0 + p1) * self.ts)\n x = (\n 1\n / (-p0 - p1)\n * anp.array(\n [\n [-p1 - p0 * e, -p1 + p1 * e],\n [-p... | [
"0.57334554",
"0.54655373",
"0.53826815",
"0.53662187",
"0.53366727",
"0.5298539",
"0.5281986",
"0.52551913",
"0.52137053",
"0.520962",
"0.5203715",
"0.51821357",
"0.51619667",
"0.5104895",
"0.51000744",
"0.5096226",
"0.5089348",
"0.50706804",
"0.50680226",
"0.5058774",
"0.50... | 0.68100685 | 0 |
Initialize the Route analysis for the given inputs. | def __init__(self, **kwargs):
self.pair_type = kwargs["pair_type"]
self.origins = kwargs["origins"]
self.origin_id_field = kwargs["origin_id_field"]
self.destinations = kwargs["destinations"]
self.dest_id_field = kwargs["dest_id_field"]
self.network_data_source = kw... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def initialize(self):\n self.initialize_edges()\n self.initialize_prob()\n self.initialize_total_input_dict()\n\n self.initialize_fpmusigv_dict()",
"def initialize_rt_solver(self):\r\n # For a local network dataset, we need to checkout the Network Analyst extension license.\r\n... | [
"0.6117074",
"0.59076273",
"0.5906306",
"0.58633006",
"0.5775825",
"0.5771856",
"0.57236266",
"0.5721005",
"0.57191586",
"0.5712019",
"0.5708202",
"0.56965554",
"0.56650615",
"0.56602186",
"0.5631149",
"0.56289285",
"0.56277144",
"0.56277144",
"0.56152123",
"0.5613303",
"0.56... | 0.0 | -1 |
Initialize a Route solver object and set properties. | def initialize_rt_solver(self):
# For a local network dataset, we need to checkout the Network Analyst extension license.
if not self.is_service:
arcpy.CheckOutExtension("network")
# Create a new Route object
self.logger.debug("Creating Route object...")
self.... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __init__(self):\n self.RRTFamilySolver = RRTFamilyPathPlanner()\n self.PRMSolver = PRMPathPlanner()",
"def __init__(self):\n\n # Set a node name - something relevant\n rospy.init_node('waypoint_updater')\n\n # Most recent pose\n self.pose = None\n\n # Map wayp... | [
"0.70928293",
"0.6806993",
"0.67323405",
"0.6620287",
"0.65866923",
"0.6567693",
"0.6503277",
"0.6323346",
"0.6312729",
"0.62945217",
"0.6200703",
"0.6181314",
"0.61419207",
"0.6131141",
"0.6076377",
"0.6046717",
"0.6043842",
"0.59901327",
"0.59900606",
"0.5955468",
"0.594591... | 0.75314903 | 0 |
Add fields to input Stops with the origin and destination's original unique IDs. | def _add_unique_id_fields(self):
field_types = {"String": "TEXT", "Single": "FLOAT", "Double": "DOUBLE", "SmallInteger": "SHORT",
"Integer": "LONG", "OID": "LONG"}
origin_field_def = [self.origin_unique_id_field_name, field_types[self.origin_id_field_obj.type]]
if self... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _insert_stops_one_to_one(self): # pylint: disable=too-many-locals\r\n # Use an insertCursor to insert Stops into the Route analysis\r\n destinations = {}\r\n destination_rows = []\r\n with self.rt_solver.insertCursor(\r\n arcpy.nax.RouteInputDataType.Stops,\r\n ... | [
"0.6808154",
"0.65527296",
"0.6456082",
"0.5107205",
"0.4909032",
"0.4837304",
"0.48278338",
"0.47855443",
"0.4784247",
"0.47640702",
"0.47625896",
"0.46876457",
"0.4668027",
"0.46508414",
"0.46428096",
"0.46241915",
"0.45510978",
"0.45495996",
"0.45336407",
"0.45158657",
"0.... | 0.7586507 | 0 |
Create layers from the origins so the layer contains only the desired inputs for the chunk. | def _select_inputs_one_to_one(self, origins_criteria):
# Select the origins with ObjectIDs in this range
self.logger.debug("Selecting origins for this chunk...")
origins_oid_field_name = arcpy.Describe(self.origins).oidFieldName
origins_where_clause = (
f"{origins_oid_fi... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def build_layers(self):\n raise NotImplementedError",
"def _make_layer(self, X, name, block, num_blocks, out_channels):\n\n for i in range(0, num_blocks):\n X = block(X, name = name + '_block{}'.format(i), out_channels=out_channels)\n return X",
"def _build(self, inputs):\n\n ... | [
"0.58452713",
"0.57073355",
"0.5678293",
"0.567758",
"0.566787",
"0.5503139",
"0.54909784",
"0.5411151",
"0.53651917",
"0.5347449",
"0.53288347",
"0.5283121",
"0.52772504",
"0.52497953",
"0.5245188",
"0.5234502",
"0.52329576",
"0.5224384",
"0.51927054",
"0.51888996",
"0.51857... | 0.5049388 | 37 |
Retrieve a list of OD pairs included in this chunk. | def _get_od_pairs_for_chunk(self, chunk_definition):
# Read the relevant rows from the CSV
chunk_num, chunk_size = chunk_definition
# Explicitly set data types
dtypes = {
0: helpers.PD_FIELD_TYPES[self.origin_id_field_obj.type],
1: helpers.PD_FIELD_TYPES[sel... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_pairs(self):\n return self.pairs",
"def pairs(self):\n return self.items() if self.is_a(dict) else self.chunks(2)",
"def pairs(self):\n return self.__pairs",
"def getOrderList(self):\r\n\t\treturn self.pair.orders",
"async def fetch_trading_pairs() -> List[str]:\n raise NotI... | [
"0.61472523",
"0.58992565",
"0.5761564",
"0.567055",
"0.5611011",
"0.55578417",
"0.5545772",
"0.5545772",
"0.5542505",
"0.55348593",
"0.5519136",
"0.55052334",
"0.5441358",
"0.5352025",
"0.53083766",
"0.52903664",
"0.5279547",
"0.5259124",
"0.5257976",
"0.52337116",
"0.521395... | 0.6435109 | 0 |
Create layers that include only the origins and destinations relevant to this chunk. | def _select_inputs_many_to_many(self):
# Select the origins present in this chunk of predefined OD pairs
self.logger.debug("Selecting origins for this chunk...")
origins_in_chunk = set([pair[0] for pair in self.od_pairs])
if isinstance(self.od_pairs[0][0], (int, float,)):
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def make_layers(self):\n w, h = self.image.get_size()\n shrink = pg.transform.smoothscale(self.image, (w//2, h//2))\n self.mid_image = tools.tile_surface((w,h), shrink, True)\n shrink = pg.transform.smoothscale(self.image, (w//4, h//4))\n self.base = tools.tile_surface(prepare.SC... | [
"0.61868954",
"0.61661166",
"0.60497373",
"0.5842511",
"0.5815913",
"0.5705256",
"0.5667303",
"0.5603573",
"0.5603573",
"0.54255944",
"0.5378894",
"0.53700405",
"0.53343993",
"0.5305683",
"0.528266",
"0.5267994",
"0.5221907",
"0.52087885",
"0.5189929",
"0.51773155",
"0.517675... | 0.0 | -1 |
Insert the origins and destinations as Stops for the Route analysis for the onetoone case. | def _insert_stops_one_to_one(self): # pylint: disable=too-many-locals
# Use an insertCursor to insert Stops into the Route analysis
destinations = {}
destination_rows = []
with self.rt_solver.insertCursor(
arcpy.nax.RouteInputDataType.Stops,
["RouteName", "... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _insert_stops_many_to_many(self):\r\n # Store data of the relevant origins and destinations in dictionaries for quick lookups and reuse\r\n o_data = {} # {Origin ID: [Shape, transferred fields]}\r\n for row in arcpy.da.SearchCursor( # pylint: disable=no-member\r\n self.input_o... | [
"0.65625894",
"0.5583581",
"0.5395718",
"0.5393464",
"0.5392419",
"0.53610194",
"0.5345976",
"0.52621037",
"0.5238447",
"0.521201",
"0.52106446",
"0.52027905",
"0.518865",
"0.5178128",
"0.51780194",
"0.51352537",
"0.51346874",
"0.5124585",
"0.51178783",
"0.51078916",
"0.51078... | 0.7464433 | 0 |
Insert each predefined OD pair into the Route analysis for the manytomany case. | def _insert_stops_many_to_many(self):
# Store data of the relevant origins and destinations in dictionaries for quick lookups and reuse
o_data = {} # {Origin ID: [Shape, transferred fields]}
for row in arcpy.da.SearchCursor( # pylint: disable=no-member
self.input_origins_layer,... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def add_parties(self, *parties) -> None:\n\n for party in parties:\n self._route_table['route_table'][party.get_id()] = party.to_entry_point(\n )",
"def assign_aovs(self, aovs: List[AOV]):\n\t\tfor aov in aovs:\n\t\t\tself.assign_aov(aov)",
"def route(self, ori, dest, pois):\n ... | [
"0.55640215",
"0.50584227",
"0.50430346",
"0.502575",
"0.5020248",
"0.50056565",
"0.49825788",
"0.4962253",
"0.49563637",
"0.4931308",
"0.4920993",
"0.49143758",
"0.4910077",
"0.48764232",
"0.48703808",
"0.48517448",
"0.48504838",
"0.4847047",
"0.48325107",
"0.4819616",
"0.48... | 0.612654 | 0 |
Create and solve a Route analysis for the designated preassigned origindestination pairs. | def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches
# Select the inputs to process
if self.pair_type is helpers.PreassignedODPairType.one_to_one:
self._select_inputs_one_to_one(chunk_definition)
elif self.pair_type is help... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def traveling_salesman(destinations_1):\n # Instantiate the data problem.\n data = create_data_model()\n\n # NEW SPOT TO MAKE distance_matrix\n distance_matrix = compute_euclidean_distance_matrix(destinations_1)\n manager = pywrapcp.RoutingIndexManager(\n len(destinations_1), data['num_vehicl... | [
"0.67139935",
"0.6400536",
"0.6300604",
"0.6229401",
"0.6149414",
"0.61029875",
"0.60279167",
"0.59973127",
"0.59507513",
"0.59370536",
"0.5883438",
"0.58514273",
"0.58248085",
"0.58187276",
"0.57969856",
"0.5756195",
"0.5724864",
"0.5687748",
"0.5662441",
"0.56054395",
"0.55... | 0.6315577 | 2 |
Export the Route result to a feature class. | def _export_to_feature_class(self, chunk_definition):
# Make output gdb
rt_workspace = self._create_output_gdb()
# Export routes
output_routes = os.path.join(rt_workspace, f"Routes_{chunk_definition[0]}_{chunk_definition[1]}")
self.logger.debug(f"Exporting Route Routes out... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _post_process_route_fcs(self):\r\n # Create the final output feature class\r\n desc = arcpy.Describe(self.route_fcs[0])\r\n helpers.run_gp_tool(\r\n LOGGER,\r\n arcpy.management.CreateFeatureclass, [\r\n os.path.dirname(self.out_routes),\r\n ... | [
"0.6221787",
"0.5916604",
"0.53928643",
"0.5349487",
"0.5265204",
"0.52557456",
"0.51746285",
"0.51711124",
"0.51549613",
"0.5122801",
"0.51089555",
"0.50449544",
"0.5029637",
"0.50276506",
"0.5018805",
"0.4998023",
"0.49829662",
"0.49803904",
"0.49756134",
"0.49702242",
"0.4... | 0.72400814 | 0 |
Solve a Route analysis for the given inputs for the given chunk of preassigned OD pairs. | def solve_route(inputs, chunk):
rt = Route(**inputs)
if inputs["pair_type"] is helpers.PreassignedODPairType.one_to_one:
rt.logger.info(f"Processing origins OID {chunk[0]} to {chunk[1]} as job id {rt.job_id}")
elif inputs["pair_type"] is helpers.PreassignedODPairType.many_to_many:
rt.lo... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solve(self, chunk_definition): # pylint: disable=too-many-locals, too-many-statements, too-many-branches\r\n # Select the inputs to process\r\n if self.pair_type is helpers.PreassignedODPairType.one_to_one:\r\n self._select_inputs_one_to_one(chunk_definition)\r\n elif self.pair... | [
"0.7265158",
"0.6186221",
"0.5823401",
"0.56546044",
"0.5640756",
"0.55801356",
"0.54897994",
"0.5467185",
"0.5436492",
"0.537317",
"0.5360428",
"0.5298746",
"0.5258818",
"0.523264",
"0.5204271",
"0.51753855",
"0.5158027",
"0.5145004",
"0.5122745",
"0.5106338",
"0.50887746",
... | 0.73194927 | 0 |
Compute Routes between origins and their assigned destinations in parallel and combine results. Compute Routes in parallel and combine the results. This class assumes that the inputs have already been preprocessed and validated. | def __init__( # pylint: disable=too-many-locals, too-many-arguments
self, pair_type_str, origins, origin_id_field, destinations, dest_id_field,
network_data_source, travel_mode, time_units, distance_units,
max_routes, max_processes, out_routes, scratch_folder, reverse_direction=False,
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solve_route_in_parallel(self):\r\n # Validate Route settings. Essentially, create a dummy Route class instance and set up the\r\n # solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes\r\n # that are guaranteed to all fail.\r\n ... | [
"0.6572114",
"0.64402664",
"0.59652627",
"0.5922691",
"0.5920702",
"0.5907399",
"0.59004366",
"0.58980155",
"0.5884197",
"0.58173287",
"0.57752156",
"0.57466954",
"0.57233685",
"0.5712399",
"0.57113975",
"0.57011473",
"0.56868786",
"0.56685567",
"0.5667153",
"0.5647773",
"0.5... | 0.48959836 | 83 |
Validate Route settings before spinning up a bunch of parallel processes doomed to failure. Also check which field name in the output OD Lines will store the optimized cost values. This depends on the travel mode being used by the analysis, and we capture it here to use in later steps. | def _validate_route_settings(self):
# Create a dummy Route object and set properties. This allows us to
# detect any errors prior to spinning up a bunch of parallel processes and having them all fail.
LOGGER.debug("Validating Route settings...")
rt = None
try:
r... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def f_check_adr_parameters_correctness(dict):\n\n if int(dict[\"operation_mode_num\"]) not in (0, 1, 2, 3, 4, 5, 6):\n print('\\n Error!!! Operation mode is wrong!\\n')\n sys.exit(' Program stopped!')\n\n if int(dict[\"FFT_size_samples\"]) not in (2048, 4096, 8192, 16384, 32768):\n pri... | [
"0.58897823",
"0.5755311",
"0.5660653",
"0.557182",
"0.5522201",
"0.550903",
"0.54448694",
"0.53637433",
"0.5346746",
"0.5307992",
"0.52819705",
"0.52334815",
"0.52329284",
"0.52285826",
"0.5222194",
"0.52111304",
"0.51922095",
"0.5165339",
"0.51619154",
"0.51523876",
"0.5147... | 0.7251164 | 0 |
Discover if the origins and destinations include valid fields we can use in the Route analysis. Any fields with the correct names and data types matching valid fields recognized by the Route solver for the Stops input can be used in the analysis. Compare the input origins and destinations fields with the list of suppor... | def _populate_input_data_transfer_fields(self):
# Valid fields for the Route Stops input are described here:
# https://pro.arcgis.com/en/pro-app/latest/arcpy/network-analyst/route-input-data-types.htm
# Do not transfer RouteName or Sequence as these are explicitly controlled by this tool. Do... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _insert_stops_one_to_one(self): # pylint: disable=too-many-locals\r\n # Use an insertCursor to insert Stops into the Route analysis\r\n destinations = {}\r\n destination_rows = []\r\n with self.rt_solver.insertCursor(\r\n arcpy.nax.RouteInputDataType.Stops,\r\n ... | [
"0.6113399",
"0.5643113",
"0.54353887",
"0.5379565",
"0.5359705",
"0.53044266",
"0.5218753",
"0.5165528",
"0.51130545",
"0.5098658",
"0.5056272",
"0.5042018",
"0.50327575",
"0.5018349",
"0.50022423",
"0.49981675",
"0.49830243",
"0.49737117",
"0.49564588",
"0.4953842",
"0.4924... | 0.69479537 | 0 |
Solve the Route in chunks and postprocess the results. | def solve_route_in_parallel(self):
# Validate Route settings. Essentially, create a dummy Route class instance and set up the
# solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes
# that are guaranteed to all fail.
self._vali... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solve_route(inputs, chunk):\r\n rt = Route(**inputs)\r\n if inputs[\"pair_type\"] is helpers.PreassignedODPairType.one_to_one:\r\n rt.logger.info(f\"Processing origins OID {chunk[0]} to {chunk[1]} as job id {rt.job_id}\")\r\n elif inputs[\"pair_type\"] is helpers.PreassignedODPairType.many_to_m... | [
"0.6792837",
"0.5855412",
"0.5633914",
"0.548248",
"0.54527795",
"0.532048",
"0.53184384",
"0.52948433",
"0.52264017",
"0.5213624",
"0.51902413",
"0.51709",
"0.51507914",
"0.5139252",
"0.51372004",
"0.5116195",
"0.5072712",
"0.507154",
"0.50373584",
"0.50307095",
"0.5008679",... | 0.6839286 | 0 |
Merge the routes calculated in each separate process into a single feature class. Create an empty final output feature class and populate it using InsertCursor, as this tends to be faster than using the Merge geoprocessing tool. | def _post_process_route_fcs(self):
# Create the final output feature class
desc = arcpy.Describe(self.route_fcs[0])
helpers.run_gp_tool(
LOGGER,
arcpy.management.CreateFeatureclass, [
os.path.dirname(self.out_routes),
os.path.basenam... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _export_to_feature_class(self, chunk_definition):\r\n # Make output gdb\r\n rt_workspace = self._create_output_gdb()\r\n\r\n # Export routes\r\n output_routes = os.path.join(rt_workspace, f\"Routes_{chunk_definition[0]}_{chunk_definition[1]}\")\r\n self.logger.debug(f\"Export... | [
"0.60113615",
"0.5859844",
"0.5772984",
"0.5617712",
"0.5504301",
"0.5316391",
"0.5313953",
"0.5273943",
"0.5268024",
"0.5257252",
"0.52431345",
"0.52355766",
"0.52347904",
"0.52220434",
"0.52174675",
"0.5180655",
"0.5177188",
"0.5174838",
"0.51718193",
"0.5159236",
"0.511246... | 0.71977544 | 0 |
Read arguments passed in via subprocess and run the parallel Route. This script is intended to be called via subprocess via the solve_large_route_pair_analysis.py module, which does essential preprocessing and validation. Users should not call this script directly from the command line. We must launch this script via s... | def launch_parallel_rt_pairs():
# Create the parser
parser = argparse.ArgumentParser(description=globals().get("__doc__", ""), fromfile_prefix_chars='@')
# Define Arguments supported by the command line utility
# --pair-type parameter
help_string = "The type of origin-destination pair assig... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solve_route_in_parallel(self):\r\n # Validate Route settings. Essentially, create a dummy Route class instance and set up the\r\n # solver object to ensure this at least works. Do this up front before spinning up a bunch of parallel processes\r\n # that are guaranteed to all fail.\r\n ... | [
"0.64769953",
"0.62038994",
"0.57405895",
"0.554428",
"0.55252844",
"0.551435",
"0.55140823",
"0.55098575",
"0.54549307",
"0.5444846",
"0.54388684",
"0.54316586",
"0.5404963",
"0.53763914",
"0.5359437",
"0.5330171",
"0.5305152",
"0.53005004",
"0.53004366",
"0.5288501",
"0.527... | 0.68828976 | 0 |
Expand various colors to RRGGBB. | def expand_color(color, default=None, passthrough=False, block=None):
if color:
if color[0] == "#":
color = color[1:]
try:
int(color, 16)
except ValueError:
return block
length = len(color)
if length in [3, 4]:
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def color_rgb(r,g,b):\n return \"#%02x%02x%02x\" % (r,g,b)",
"def color_rgb(r,g,b):\n return \"#%02x%02x%02x\" % (r,g,b)",
"def color_rgb(r,g,b):\n return \"#%02x%02x%02x\" % (r,g,b)",
"def combine_color(red, green, blue):\r\n\r\n return (red << 16) + (green << 8) + blue",
"def rgb(r, g, b)... | [
"0.64377636",
"0.64377636",
"0.64377636",
"0.6364302",
"0.6349941",
"0.63338196",
"0.6211546",
"0.6143853",
"0.6105021",
"0.61023855",
"0.61022055",
"0.604399",
"0.60202074",
"0.59963423",
"0.5995744",
"0.5948604",
"0.5905812",
"0.59024096",
"0.5871113",
"0.5865381",
"0.58587... | 0.5423834 | 67 |
Get the tokenized format_string. Tokenizing is resource intensive so we only do it once and cache it | def tokens(self, format_string):
if format_string not in self.format_string_cache:
tokens = list(re.finditer(self.reg_ex, format_string))
self.format_string_cache[format_string] = tokens
return self.format_string_cache[format_string] | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _get_format(self, token):\n if token in self._formats:\n return self._formats[token]\n\n if self._style is None:\n result = self._get_format_from_document(token, self._document)\n else:\n result = self._get_format_from_style(token, self._style)\n\n s... | [
"0.7031436",
"0.5833799",
"0.5587852",
"0.55370355",
"0.55229795",
"0.5514945",
"0.5489987",
"0.5487361",
"0.5463768",
"0.5454155",
"0.54331946",
"0.53677803",
"0.5347152",
"0.5261837",
"0.5218769",
"0.52003187",
"0.5194947",
"0.51801944",
"0.5157241",
"0.5129288",
"0.5112594... | 0.7236307 | 0 |
Parses the format_string and returns a set of color names. | def get_color_names(self, format_string):
names = set()
# Tokenize the format string and process them
for token in self.tokens(format_string):
if token.group("command"):
name = dict(parse_qsl(token.group("command"))).get("color")
if (
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def reformatColor(self, colorStr):\n if type(colorStr) is str:\n if colorStr.startswith('#'):\n colorStr = colorStr.replace('#', '')\n else:\n raise Exception('color is not hex format')\n r = int(colorStr[:2], 16)\n g = int(colorStr[2... | [
"0.61174923",
"0.60446614",
"0.60343224",
"0.6032042",
"0.5956374",
"0.5867158",
"0.5859119",
"0.5769622",
"0.57691973",
"0.57649046",
"0.5756081",
"0.5748874",
"0.5739813",
"0.5683501",
"0.5625979",
"0.5616915",
"0.5559172",
"0.55575323",
"0.5540814",
"0.5540103",
"0.5533907... | 0.8132206 | 0 |
Parses the format_string and returns a set of placeholders. | def get_placeholders(self, format_string):
placeholders = set()
# Tokenize the format string and process them
for token in self.tokens(format_string):
if token.group("placeholder"):
placeholders.add(token.group("key"))
elif token.group("command"):
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_placeholder_formats_list(self, format_string):\n placeholders = []\n # Tokenize the format string and process them\n for token in self.tokens(format_string):\n if token.group(\"placeholder\"):\n placeholders.append((token.group(\"key\"), token.group(\"format\"... | [
"0.7910855",
"0.694886",
"0.64524835",
"0.6108374",
"0.60248744",
"0.601687",
"0.60016334",
"0.5864088",
"0.57037616",
"0.55861354",
"0.55645305",
"0.554253",
"0.5510738",
"0.55103034",
"0.5497989",
"0.5479562",
"0.5358258",
"0.5325262",
"0.5298705",
"0.5236709",
"0.5222342",... | 0.7691594 | 1 |
Parses the format_string and returns a list of tuples (placeholder, format). | def get_placeholder_formats_list(self, format_string):
placeholders = []
# Tokenize the format string and process them
for token in self.tokens(format_string):
if token.group("placeholder"):
placeholders.append((token.group("key"), token.group("format")))
retu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\... | [
"0.65669346",
"0.62842053",
"0.6130616",
"0.61288065",
"0.60436875",
"0.5937322",
"0.5901326",
"0.58831894",
"0.5852524",
"0.57953036",
"0.5765644",
"0.57541496",
"0.57023305",
"0.56520545",
"0.56048083",
"0.5603498",
"0.5459637",
"0.5429871",
"0.5376852",
"0.53540975",
"0.53... | 0.784211 | 0 |
Update a format string renaming placeholders. | def update_placeholders(self, format_string, placeholders):
# Tokenize the format string and process them
output = []
for token in self.tokens(format_string):
if token.group("key") in placeholders:
output.append(
"{{{}{}}}".format(placeholders[toke... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def update_placeholder_formats(self, format_string, placeholder_formats):\n # Tokenize the format string and process them\n output = []\n for token in self.tokens(format_string):\n if (\n token.group(\"placeholder\")\n and (not token.group(\"format\"))\... | [
"0.7112868",
"0.6138306",
"0.60262024",
"0.60064745",
"0.5947875",
"0.5682744",
"0.5643566",
"0.5574067",
"0.5571616",
"0.5536187",
"0.5533459",
"0.545436",
"0.5446608",
"0.5419904",
"0.539936",
"0.53418016",
"0.5337642",
"0.5330448",
"0.53120375",
"0.5303506",
"0.5267097",
... | 0.6070207 | 2 |
Update a format string adding formats if they are not already present. | def update_placeholder_formats(self, format_string, placeholder_formats):
# Tokenize the format string and process them
output = []
for token in self.tokens(format_string):
if (
token.group("placeholder")
and (not token.group("format"))
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def AddFormat(self, format):\n self._legacy = False\n if format:\n self._format = format",
"def addIfMissing(self, format):\n self.setdefault(format.name, format)",
"def _translate_fmts(self):\n fmt_info = []\n fmt_append = fmt_info.append\n \n isvalid = self._is_v... | [
"0.64630926",
"0.62091905",
"0.5800091",
"0.5796576",
"0.5712765",
"0.57114947",
"0.57108057",
"0.55900645",
"0.5558063",
"0.55575746",
"0.543823",
"0.5434389",
"0.5409675",
"0.54084057",
"0.5407691",
"0.53960705",
"0.5389524",
"0.5365024",
"0.536046",
"0.53591377",
"0.534718... | 0.6789656 | 0 |
Parse the format string into blocks containing Literals, Placeholders etc that we can cache and reuse. | def build_block(self, format_string):
first_block = Block(None, py3_wrapper=self.py3_wrapper)
block = first_block
# Tokenize the format string and process them
for token in self.tokens(format_string):
value = token.group(0)
if token.group("block_start"):
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _parse(self, fmtstr):\n def _match_brace(string, start_pos, pair='[]'):\n \"\"\"Pairing brackets (used internally in _parse method)\"\"\"\n depth = 1\n if string[start_pos] != pair[0]:\n return None\n for index, char in enumerate(string[start_po... | [
"0.64509463",
"0.61767745",
"0.6141088",
"0.6093478",
"0.59834534",
"0.59391457",
"0.5813534",
"0.5672864",
"0.565769",
"0.5619488",
"0.5604256",
"0.5531012",
"0.5529596",
"0.55168927",
"0.54857767",
"0.545964",
"0.5454546",
"0.5443225",
"0.54375136",
"0.54195976",
"0.5334066... | 0.73439676 | 0 |
Format a string, substituting place holders which can be found in param_dict, attributes of the supplied module, or provided via calls to the attr_getter function. | def format(
self,
format_string,
module=None,
param_dict=None,
force_composite=False,
attr_getter=None,
):
if param_dict is None:
param_dict = {}
# if the processed format string is not in the cache then create it.
if format_string... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def replace_param(string, param, value, param_format=None):\n\n if param_format == \"json\":\n return sub(r\"(?P<json_replacement>\\\"%s\\\"\\s*:\\s*)\\\"\\s*\\\"\" %\n escape(str(param)), \"\\\\1\\\"%s\\\"\" % value, string)\n elif param_format == \"h... | [
"0.5990877",
"0.59723574",
"0.57197136",
"0.5632017",
"0.56243557",
"0.5579166",
"0.54825616",
"0.5474345",
"0.5385853",
"0.5365595",
"0.5335425",
"0.5315145",
"0.5266371",
"0.5259829",
"0.52348405",
"0.52140254",
"0.5195806",
"0.5177217",
"0.5099359",
"0.5097019",
"0.5095286... | 0.6764331 | 0 |
function that finds and returns the value for a placeholder. | def get_parameter(key):
if key in param_dict:
# was a supplied parameter
param = param_dict.get(key)
elif module and hasattr(module, key):
param = getattr(module, key)
if hasattr(param, "__call__"):
# we don't al... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __findPlaceholder(self, data, index):\r\n m = self.__placeholder_re.search(data, index)\r\n if m:\r\n return m.group(1), m.end()\r\n else:\r\n return None, index + 1",
"def placeholder(self):\n return self._placeholder",
"def placeholder(self) -> str | None... | [
"0.72384614",
"0.65259403",
"0.6496153",
"0.64682907",
"0.60817194",
"0.58944154",
"0.5852093",
"0.5762202",
"0.57511127",
"0.56862986",
"0.56270653",
"0.55724573",
"0.5522929",
"0.5522929",
"0.5460267",
"0.5454473",
"0.5445658",
"0.54357004",
"0.54279006",
"0.54072934",
"0.5... | 0.0 | -1 |
return the correct value for the placeholder | def get(self, get_params, block):
value = f"{{{self.key}}}"
try:
value = value_ = get_params(self.key)
if self.format.startswith(":"):
# if a parameter has been set to be formatted as a numeric
# type then we see if we can coerce it to be. This al... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def placeholder(self):\n return self._placeholder",
"def placeholder(self) -> str | None:\n return self._underlying.placeholder",
"def get_val(self):\n return",
"def get_geom_placeholder(self, value, srid):\r\n if hasattr(value, 'expression'):\r\n placeholder = '%s.%s' ... | [
"0.7000699",
"0.67986435",
"0.6459541",
"0.6312645",
"0.61937106",
"0.6171836",
"0.615392",
"0.6140465",
"0.61130303",
"0.60600764",
"0.59495264",
"0.5948369",
"0.5947296",
"0.5940576",
"0.59120387",
"0.59089774",
"0.5895668",
"0.58923846",
"0.58919656",
"0.58830136",
"0.5882... | 0.0 | -1 |
Check if the condition has been met. We need to make sure that we are of the correct type. | def _check_valid_condition(self, get_params):
try:
variable = get_params(self.variable)
except: # noqa e722
variable = None
value = self.value
# if None, return oppositely
if variable is None:
return not self.default
# convert the va... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def condition(self):\n return True",
"def check_condition(self):\n\n\t\traw_context = {\n\t\t\t'folk': self.folk\n\t\t}\n\n\t\tstatus, param = self.execute(self.mission_grid, 'condition', self.pending_mission.kingdom, raw_context)\n\t\treturn status",
"def check_condition(self, comment):\n if com... | [
"0.67982715",
"0.6380257",
"0.6109528",
"0.60492665",
"0.60492665",
"0.5985159",
"0.5962633",
"0.5921427",
"0.5918396",
"0.5918396",
"0.5901136",
"0.5835458",
"0.5809594",
"0.5807828",
"0.5793611",
"0.57830834",
"0.5774989",
"0.5774989",
"0.5774989",
"0.5774989",
"0.57692593"... | 0.5867462 | 11 |
Simple check that the variable is set | def _check_valid_basic(self, get_params):
try:
if get_params(self.variable):
return self.default
except: # noqa e722
pass
return not self.default | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def has_value(var) :\n return var != None",
"def isSet(self) -> bool:\n ...",
"def has_assignment_for(self, var):\n return self.variable_to_value.get(var) != None",
"def _var_check(self):\n missing = set()\n for v in self.variables:\n if getattr(self, v) is None:\n ... | [
"0.718136",
"0.6951559",
"0.6602433",
"0.65596896",
"0.6471603",
"0.6464828",
"0.64093935",
"0.63088953",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0.61869645",
"0... | 0.674686 | 2 |
update with commands from the block | def update_commands(self, commands_str):
commands = dict(parse_qsl(commands_str, keep_blank_values=True))
_if = commands.get("if", self._if)
if _if:
self._if = Condition(_if)
self._set_int(commands, "max_length")
self._set_int(commands, "min_length")
self.colo... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def update():",
"def update():",
"def commandUpdate(self):\n pass",
"def update( ):\r\n pass",
"def update(self) -> None:\n ...",
"def update(self):\n pass",
"def update(self):\n pass",
"def update(self):\n pass",
"def update(self):\n pass",
"def u... | [
"0.70040303",
"0.70040303",
"0.68496",
"0.68419474",
"0.63492554",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6342758",
"0.6337077",
... | 0.0 | -1 |
set integer value from commands | def _set_int(self, commands, name):
if name in commands:
try:
value = int(commands[name])
setattr(self, name, value)
except ValueError:
pass | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def setInteger(self, value):",
"def setInteger(self, value):",
"def set_num(self, num):\n self.cmd_num = num",
"def setInteger(self, value: int):\n self.value = value",
"def setInt(self, addr: ghidra.program.model.address.Address, value: int) -> None:\n ...",
"def getint(self, strcom... | [
"0.71163434",
"0.71163434",
"0.67835045",
"0.62937844",
"0.61526585",
"0.6076695",
"0.6070734",
"0.6059233",
"0.59684515",
"0.5945891",
"0.5915541",
"0.58779633",
"0.5800634",
"0.5786643",
"0.5786482",
"0.5768864",
"0.57324964",
"0.5721998",
"0.56996304",
"0.5692422",
"0.5685... | 0.8104841 | 0 |
set any commands for this block | def set_commands(self, command_str):
self.commands.update_commands(command_str) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def commands(self, commands):\n\n self._commands = commands",
"def commands():",
"def commands():\n pass",
"def commands():\n pass",
"def commands():\n pass",
"def commands():\n pass",
"def at_cmdset_creation(self):\n super().at_cmdset_creation()\n #\n # any comm... | [
"0.7058163",
"0.70184225",
"0.6852532",
"0.6852532",
"0.6852532",
"0.6852532",
"0.6804543",
"0.6804543",
"0.66652715",
"0.65947163",
"0.65928555",
"0.65210867",
"0.64140224",
"0.63312364",
"0.6290925",
"0.62714374",
"0.6251512",
"0.6167499",
"0.61642545",
"0.6146838",
"0.6128... | 0.65425885 | 11 |
create a new sub block to the current block and return it. the sub block is added to the current block. | def new_block(self):
child = Block(self, py3_wrapper=self.py3_wrapper)
self.add(child)
return child | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def gen_new_block(self):\n block = BasicBlock()\n self.blocks.append(block)\n return block",
"def newblock(self, parent=None):\n block = ControlBlock()\n self.blocks.add(block)\n if parent:\n parent.add_child(block)\n return block",
"def newblock(self... | [
"0.7300657",
"0.7137283",
"0.700307",
"0.67426383",
"0.65247345",
"0.64328855",
"0.64139366",
"0.6404519",
"0.6204402",
"0.61623967",
"0.6048261",
"0.5963573",
"0.59493285",
"0.5928946",
"0.5925224",
"0.5924873",
"0.59158665",
"0.5912983",
"0.5904347",
"0.58974856",
"0.586256... | 0.73637503 | 0 |
block has been split via | so we need to start a new block for that option and return it to the user. | def switch(self):
base_block = self.base_block or self
self.next_block = Block(self.parent, base_block=base_block, py3_wrapper=self.py3_wrapper)
return self.next_block | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def block_one(self):",
"def block(self):\n pass",
"def handle_request(self, request):\n ret = True\n for option in request.options:\n if option.number == defines.inv_options[\"Block2\"]:\n host, port = request.source\n key = hash(str(host) + str(por... | [
"0.62640697",
"0.61661994",
"0.6021515",
"0.5755425",
"0.56972605",
"0.5621218",
"0.55789465",
"0.55772924",
"0.5509449",
"0.55021685",
"0.5426134",
"0.53966236",
"0.53940547",
"0.53849393",
"0.5371453",
"0.53622526",
"0.5353725",
"0.5346401",
"0.53440475",
"0.5342697",
"0.53... | 0.5264465 | 24 |
see if the if condition for a block is valid | def check_valid(self, get_params):
if self.commands._if:
return self.commands._if.check_valid(get_params) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def check_block(self, block):\n pass",
"def is_block(self):\n return self.v & 1 == 0",
"def test_29_if(self):\n\t\tinput = \"\"\"procedure main(); var x:integer; begin x:=foo(); end\n\t\tfunction foo():integer; var a:real; begin\n\t\twith a:integer;b:real; do begin if a>0 then return 1; else b:=0; en... | [
"0.78990954",
"0.6600305",
"0.63182026",
"0.63088113",
"0.63049823",
"0.6304188",
"0.6274338",
"0.62668514",
"0.6249396",
"0.62368685",
"0.62282825",
"0.6225797",
"0.62173724",
"0.6185306",
"0.6149648",
"0.61086375",
"0.6089408",
"0.60828173",
"0.6078198",
"0.6062693",
"0.604... | 0.0 | -1 |
render the block and return the output. | def render(self, get_params, module, _if=None):
enough = False
output = []
valid = None
if self.commands.show:
valid = True
if self.parent and self.commands.soft and _if is None:
return None, self
if _if:
valid = True
elif self... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def render_block(data):\n\tsnippet = data[2] \n\ttitle = data[0]['name']\n\tdescription = data[0]['description']\n\tblock_type = data[0]['type']\n\t\n\n\t# change the panel outline for\n\t# warnings and detections\n\tblock_border = 'yellow' if block_type == 'warning' else 'red1'\n\n\tcode_snippet = Syntax(\n\t\t\t... | [
"0.7029032",
"0.69647723",
"0.6806205",
"0.65881765",
"0.65881765",
"0.65881765",
"0.65881765",
"0.65881765",
"0.65881765",
"0.65558636",
"0.6526438",
"0.6469616",
"0.6436933",
"0.64222467",
"0.63671017",
"0.63276225",
"0.6301424",
"0.6263438",
"0.6262892",
"0.6222637",
"0.61... | 0.56899357 | 76 |
Create a new position. | def __init__(self,x,y):
self.x = x
self.y = y | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def create_position(self):\n raise NotImplementedError",
"def create(self, pos):\n self.pos = pos",
"def position(self, create, position=2, **kwargs): # pylint: disable=unused-argument, method-hidden\r\n self.position = position",
"def position(self, create, position=2, **kwargs): # pylint... | [
"0.847801",
"0.8391693",
"0.8154143",
"0.8154143",
"0.7296945",
"0.692898",
"0.678412",
"0.6775694",
"0.67575675",
"0.6718587",
"0.6701663",
"0.65915143",
"0.6572498",
"0.65635514",
"0.65402424",
"0.65402424",
"0.65402424",
"0.65402424",
"0.65402424",
"0.647187",
"0.64189696"... | 0.0 | -1 |
Display position in user friendly manner. | def __repr__(self):
return "("+str(self.x)+","+str(self.y)+")" | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def position(self):\r\n pass",
"def display(self):\n \"\"\" Coordinates for position are x-axis (LR) and y-axis (NS) \"\"\"\n for coordY in range(self.y):\n print()\n for column in range(self.height):\n for coordLR in range(self.x):\n print(\" \", ... | [
"0.7464939",
"0.7350452",
"0.7230497",
"0.71928203",
"0.7168089",
"0.71171767",
"0.6995238",
"0.6969509",
"0.6844631",
"0.68162245",
"0.6798185",
"0.6786135",
"0.665452",
"0.6650976",
"0.66377974",
"0.66324097",
"0.6619713",
"0.66189533",
"0.6613451",
"0.6598675",
"0.65528977... | 0.0 | -1 |
Returns a tuple of position in (x,y) form. | def get(self):
return (self.x,self.y); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_position(self) -> typing.Tuple[int, int]:\n raise NotImplementedError",
"def get_pos(self):\n return (self.x, self.y)",
"def position(self) -> Tuple[int, int]:\n return self.row, self.col",
"def get_position(self):\n return (self.x_pos, self.y_pos)",
"def get_pos(self) -... | [
"0.8117628",
"0.80366904",
"0.80062807",
"0.7994267",
"0.79300076",
"0.7879146",
"0.78181684",
"0.7731477",
"0.7600716",
"0.756264",
"0.7516764",
"0.75011235",
"0.7460002",
"0.7377023",
"0.7375958",
"0.73217714",
"0.7272441",
"0.72643983",
"0.72562724",
"0.7233895",
"0.723070... | 0.7212456 | 21 |
Displays a string in user friendly manner. | def __repr__(self):
return "("+str(self.pos)+","+str(self.color)+")" | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def see(s):\n print(\"---- %s -----\" % s)",
"def _message_display(string):\n print(\"========================================\")\n print(string)\n print(time.asctime(time.localtime(time.time())))\n print(\"========================================\")",
"def show_on_screen(self, string, location,... | [
"0.71144617",
"0.6865019",
"0.6777228",
"0.6654619",
"0.6601663",
"0.6576626",
"0.65690356",
"0.654347",
"0.6448489",
"0.6334183",
"0.63277024",
"0.6308555",
"0.6306732",
"0.6305804",
"0.62739414",
"0.62355924",
"0.6233103",
"0.62326515",
"0.62177855",
"0.62035185",
"0.619715... | 0.0 | -1 |
Compares color to pawn color, returns true if they are the same. | def isColor(self,color):
return self.color==color | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def same_color(self, other: 'Piece') -> bool:\n\n return self.color == other.color",
"def color_check_mate(self, mycolor):\n\n if not self.color_in_check(mycolor):\n return False\n\n incheck = True\n for (x, y) in self.__players[mycolor]:\n moves = self._get_piec... | [
"0.7082352",
"0.6642375",
"0.6420325",
"0.63803416",
"0.6271055",
"0.6236686",
"0.62152225",
"0.6214757",
"0.6146159",
"0.6136335",
"0.6056689",
"0.6049656",
"0.6021747",
"0.60207504",
"0.6019101",
"0.60071254",
"0.6001189",
"0.6000824",
"0.59897274",
"0.59405607",
"0.5914164... | 0.6147662 | 8 |
Sets the position of the pawn | def move(self,x,y):
self.pos.x = x
self.pos.y = y | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def setPosition(self):\n # determine posX, posY for battle\n (x1,y1) = globals.battlemapQuadrants[self.systemGrid]\n self.posX = x1+self.setX\n self.posY = y1+self.setY",
"def setPosition(position):",
"def setPosition(self):\n self.data['pos-x'] = \"%s\" % self.x()\n s... | [
"0.7676149",
"0.7314917",
"0.73105",
"0.7299208",
"0.7293732",
"0.722337",
"0.72098196",
"0.704315",
"0.70363337",
"0.6967169",
"0.6944696",
"0.6944696",
"0.6944696",
"0.6944696",
"0.6944696",
"0.6944696",
"0.6944696",
"0.6944696",
"0.6944696",
"0.6944696",
"0.6944696",
"0.... | 0.638652 | 55 |
Create a new object | def __init__(self,state,player=WHITE):
if(state==None):
self.gameState = dict()
for x in range(0,WIDTH):
for y in range(0,HEIGHT):
self.gameState[x,y] = EMPTY
for x in range(0,WIDTH):
self.gameState[x,BSTARTROW] = BLACK#Blac... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def new_object(self):\r\n\t\tpass",
"def new(self, obj):\n pass",
"def create(cls, _):\n return cls",
"def create():",
"def create():",
"def make_object():\n return object()",
"def create(cls):\n pass\n return cls()",
"def create(self):\n pass",
"def create(sel... | [
"0.8279344",
"0.81875837",
"0.76169944",
"0.7532984",
"0.7532984",
"0.74903953",
"0.7413568",
"0.7263086",
"0.7263086",
"0.7263086",
"0.7188198",
"0.71668696",
"0.7105122",
"0.70978415",
"0.7032688",
"0.70286256",
"0.69967264",
"0.697575",
"0.6942721",
"0.6913294",
"0.6906194... | 0.0 | -1 |
Used for debugging and displaying in user friendly manner. | def __repr__(self):
s = ""
for y in range(0,HEIGHT):
temp=""
for x in range(0,WIDTH):
temp = temp+ str(self.gameState[x,y])
s += temp+"\n"
return s | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def debug():",
"def output_debug_info(self):",
"def debug_string(self):\n\n raise NotImplementedError",
"def debug(self):\n raise NotImplementedError",
"def debug_print(self):\n print self.title\n print self.storyline\n print self.poster_image_url\n print self.trai... | [
"0.7927461",
"0.77589476",
"0.74094605",
"0.7343519",
"0.73350525",
"0.7155053",
"0.7092897",
"0.70533305",
"0.70131016",
"0.7006562",
"0.69903415",
"0.69416094",
"0.69380265",
"0.68714195",
"0.6865168",
"0.68511516",
"0.6811546",
"0.68112475",
"0.6776409",
"0.67534703",
"0.6... | 0.0 | -1 |
Translate the board description into a string. Used for a hash table. | def __str__(self):
s=""
for y in range(0,HEIGHT):
for x in range(0,WIDTH):
s+=str(self.gameState[x,y])
return s | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def StringFromBoard(board):\n\trows = []\n\tfor row in board:\n\t\trows.append('|'.join([' '+square+' ' for square in row]))\n\treturn '\\n-----------\\n'.join(rows)",
"def __str__(self):\n rep = \"\"\n for row in range(self._dim):\n for col in range(self._dim):\n rep += S... | [
"0.65844256",
"0.65822697",
"0.642821",
"0.6403273",
"0.6371313",
"0.6342245",
"0.63234556",
"0.62662345",
"0.62411314",
"0.623124",
"0.62133116",
"0.62067544",
"0.6201318",
"0.6192333",
"0.6180038",
"0.61786634",
"0.616831",
"0.6166834",
"0.61507493",
"0.6119286",
"0.6043222... | 0.0 | -1 |
Gives a pawn on the position x,y or returns empty if none exists | def getPawn(self,x,y):
if(self.gameState[x,y]==EMPTY):
return
return Pawn(x,y,self.gameState[x,y]) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def add_a_pawn(self, player, pos_x, pos_y)-> bool:\n if not pos_x in range(0, len(self.grid)) \\\n or not pos_y in range(0, len(self.grid)):\n return False\n if self.grid[pos_x][pos_y].color is None:\n for index_x in range(-1, 2):\n for index_y in range(-1,... | [
"0.6292175",
"0.628745",
"0.61434907",
"0.61041254",
"0.6023498",
"0.60125977",
"0.59928966",
"0.5978027",
"0.5957675",
"0.59455156",
"0.5943654",
"0.5890515",
"0.58391374",
"0.5811578",
"0.5807527",
"0.57815",
"0.57768774",
"0.57580405",
"0.5754607",
"0.57248765",
"0.5722037... | 0.8193444 | 0 |
Check if it's a win for player. | def winFor(self,player):
if(self.cachedWin == False):
won = False;
if(player==WHITE):
for x in range(0,WIDTH):
if(self.gameState[x,0]==WHITE):
won = True
elif(player==BLACK):
for x in... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def has_won(board, player):\r\n return False",
"def has_won(board, player):\n return False",
"def checkForWin(self):\n w = self.getWinner()\n if w == PLAYER or w == AI:\n # self.printBoard()\n # print('%d'%w + ' won!')\n return\n if w == Tie:\n ... | [
"0.82665426",
"0.8169365",
"0.8155496",
"0.7858614",
"0.78276265",
"0.7803459",
"0.7798291",
"0.77653474",
"0.77357554",
"0.76523876",
"0.7650778",
"0.7639162",
"0.76185304",
"0.7592742",
"0.75793433",
"0.757934",
"0.7569485",
"0.75380087",
"0.7517126",
"0.74795717",
"0.74670... | 0.796108 | 3 |
needed for search Gets the number pawns on the board of a color. | def count(self,color):
count = 0
for y in range(0,HEIGHT):
for x in range(0,WIDTH):
if(self.gameState[x,y]==color):
count+=1
return count | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def count_colors(board, color):\n n = 0\n for cell in board:\n if cell == color:\n n += 1\n elif cell == cinv(color):\n n -= 1\n return n",
"def sum_color(self, board, color):\n sum_of_color = 0\n for i in range(board.size):\n for j in range(b... | [
"0.71357477",
"0.67711115",
"0.6714085",
"0.6677235",
"0.65223455",
"0.6421733",
"0.63733757",
"0.63176304",
"0.6308519",
"0.6277486",
"0.62195385",
"0.6203734",
"0.6190637",
"0.6115216",
"0.61102915",
"0.6102846",
"0.60874075",
"0.6083563",
"0.60525626",
"0.6047749",
"0.6038... | 0.6866677 | 1 |
Tells if a position is in the game bounds | def inBounds(self,pos):
return ((pos.x<WIDTH) & (pos.x>=0) & (pos.y<HEIGHT) & (pos.y>=0)) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def in_bounds(self, position):\n row, col = position\n return ((row >= 0 and row < self.height) and\n (col >= 0 and col < self.width))",
"def is_in_bounds(pos):\n return PLAYFIELD_PADDING[0] < pos[0] < PLAYFIELD_PADDING[0] +\\\n BLOCK_NUM_WIDTH * Block.WIDTH and PLA... | [
"0.8121233",
"0.78420454",
"0.783356",
"0.7815986",
"0.77785796",
"0.77391034",
"0.7499602",
"0.74738336",
"0.7412133",
"0.7395001",
"0.7287691",
"0.7282496",
"0.72665375",
"0.72362554",
"0.7205017",
"0.7162476",
"0.71581644",
"0.71300095",
"0.71250474",
"0.7091146",
"0.70606... | 0.8067338 | 1 |
Takes a pawn and returns it's relative move position | def movePos(self,p,intMove):
return pos(p.pos.x-(intMove*self.intPlayer(p.color)),p.pos.y+self.intPlayer(p.color)) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def move_pawn(pos, game):\n #Convert coordinates to row and column\n row = int(pos[1]//(SQUARESIZE+FENCEWIDTH))\n col = int(pos[0]//(SQUARESIZE+FENCEWIDTH))\n #Make move\n game.move_pawn(game.get_player_turn(), (col,row))",
"def get_move(board, player):\r\n row, col = 0, 0\r\n return row, co... | [
"0.70455617",
"0.68026656",
"0.6782019",
"0.6533234",
"0.6489556",
"0.64045006",
"0.63270336",
"0.6322109",
"0.6290889",
"0.6268482",
"0.6268482",
"0.62472296",
"0.6150574",
"0.6125518",
"0.61029345",
"0.60926723",
"0.6087858",
"0.60839784",
"0.60775626",
"0.6045745",
"0.6034... | 0.6875913 | 1 |
Tells if a move is legal | def legalMove(self,p,intMove):
mPos = self.movePos(p,intMove)#board position of move
if(self.inBounds(mPos)!=True):#Can't make move out of board bounds
return False
#if(p.color != self.whoseTurn):#Can't make move if it's not players pawn
# return False
if(intMove==... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def move_valid(move):\n return True",
"def valid_move(self, player, move):\n return (True)",
"def legal_move(self, move, state = None):\n if state is None:\n state = copy(self.state)\n else:\n state = copy(state)\n return state[move // state.shape[0], move %... | [
"0.86168677",
"0.78282213",
"0.78129864",
"0.7796619",
"0.7645074",
"0.76316094",
"0.762242",
"0.75282884",
"0.74927366",
"0.7453383",
"0.7452425",
"0.73305404",
"0.72937834",
"0.7274391",
"0.7266397",
"0.7234366",
"0.71924216",
"0.7192144",
"0.7192",
"0.71551216",
"0.714581"... | 0.69171023 | 41 |
needed for search Gets all legal available moves including those for the oppenent | def openMoves(self):
arr = []
for y in range(0,HEIGHT):
for x in range(0,WIDTH):
t = self.getPawn(x,y)
if(t!=None):
for z in range(-1,2):
if(self.legalMove(t,z)):
#move , #newState
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_moves(self, board):\n self.available_moves = [move for move in board.legal_moves]",
"def get_available_moves(self, board):\n pass",
"def get_legal_moves(self):\n # for each square in the castle figure out if an moves can occur from it.\n moves = []\n allowed = [self.t... | [
"0.7495228",
"0.7211233",
"0.7106526",
"0.6994656",
"0.68828064",
"0.6859793",
"0.6845441",
"0.6823255",
"0.68220854",
"0.6766067",
"0.6720792",
"0.6693552",
"0.6690474",
"0.6682",
"0.6669322",
"0.66576886",
"0.6649769",
"0.66284806",
"0.6552528",
"0.6523163",
"0.6483351",
... | 0.6491643 | 20 |
needed for search Create a new board state with the given move | def move(self,p,intMove):
gs = self.gameState.copy() #copy Board
gs[p.pos.get()] = EMPTY #put position it was at as empty
gs[self.movePos(p,intMove).get()] = p.color #set new position as filled
return ((p,intMove),Board(gs,self.togglePlayer(self.whoseTurn))) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def make_move(self, move: Any) -> 'StonehengeState':\n if type(move) == str:\n new_state = StonehengeState(not self.p1_turn, self.side_length)\n # copy the board information from current state\n # make copy of current state information\n hori_lst_copy = []\n ... | [
"0.76256883",
"0.7569273",
"0.7310993",
"0.7211619",
"0.72101855",
"0.7194801",
"0.7156599",
"0.7146737",
"0.7015209",
"0.695439",
"0.6947784",
"0.69166005",
"0.68700886",
"0.68499726",
"0.68240017",
"0.68005484",
"0.6775084",
"0.677143",
"0.6759415",
"0.6757112",
"0.6747905"... | 0.6648307 | 28 |
A custom Django template tag for encoding URL query string parameters. | def urlparams(*_, **kwargs):
non_empty = {k: v for k, v in kwargs.items() if v is not None}
if non_empty:
return '?{}'.format(urlencode(non_empty))
return '' | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def url_replace(context, **kwargs):\n query = context['request'].GET.dict()\n query.update(kwargs)\n return urlencode(query)",
"def url_replace(context, **kwargs):\n query = context['request'].GET.dict()\n query.update(kwargs)\n return urlencode(query)",
"def encoded_query_str(request):\n ... | [
"0.6936687",
"0.6936687",
"0.65685886",
"0.6343588",
"0.62395805",
"0.6233473",
"0.6176143",
"0.61670446",
"0.6154101",
"0.6131022",
"0.60958886",
"0.60618484",
"0.6031017",
"0.6029763",
"0.5963693",
"0.59559804",
"0.59069306",
"0.57844955",
"0.57651424",
"0.5763139",
"0.5728... | 0.5674797 | 24 |
Used by all TalkChannels when logging messages to preserve messages order | def _mc_gen():
n = 1
while True:
yield n
n += 1 | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _log(self, msg):\n self.telegram_queue.put(f\"{__name__.split('.')[-1]}: {msg}\")",
"def log(self, message):",
"def _log(self, message):\n pass",
"def log_message(self, fmt, *args):\r\n pass\r\n # log_message\r",
"def lastMessageReceived():",
"def on_message(self, msg):\n ... | [
"0.6550122",
"0.63551664",
"0.6192797",
"0.601406",
"0.5984528",
"0.5872652",
"0.58380395",
"0.5811983",
"0.5803327",
"0.5792493",
"0.5775632",
"0.57648224",
"0.57644266",
"0.57573664",
"0.57374674",
"0.5730767",
"0.5729119",
"0.5690887",
"0.568535",
"0.56792635",
"0.56616557... | 0.0 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.