public final class GeoUtils
extends java.lang.Object
ThreadLocalRandom.current()
instance of ThreadLocalRandom
for random number generation,
and are therefore both thread-safe and non-blocking.| Modifier and Type | Method and Description |
|---|---|
static LineD[] |
connectPoints(boolean isClosed,
PointD... points)
|
static PointD[] |
convexHull(PointD... points)
Finds the convex hull for the specified
PointD coordinates. |
static <T> T[] |
fromDoubles(java.lang.Class<T> type,
double... items)
Converts the specified
Double array to the specified geometric objects. |
static <T> T[] |
fromInts(java.lang.Class<T> type,
int... items)
Converts the specified
Integer array to the specified geometric objects. |
static int |
nearestPoint(java.util.List<PointD> points,
PointD q)
Finds the
PointD nearest to the specified coordinates in the specified collection. |
static PolygonLocation |
pointInPolygon(PointD q,
PointD[] polygon)
|
static PolygonLocation |
pointInPolygon(PointD q,
PointD[] polygon,
double epsilon)
|
static double |
polygonArea(PointD... polygon)
Computes the area of the specified arbitrary
PointD polygon. |
static PointD |
polygonCentroid(PointD... polygon)
Computes the centroid of the specified arbitrary
PointD polygon. |
static LineD |
randomLine(double x,
double y,
double width,
double height)
Creates a random
LineD within the specified bounding area. |
static PointD |
randomPoint(double x,
double y,
double width,
double height)
Creates a random
PointD within the specified bounding area. |
static PointD |
randomPoint(RectD bounds)
Creates a random
PointD within the specified bounding area. |
static PointD[] |
randomPoints(int count,
RectD bounds)
Creates a set of random
PointD coordinates within the specified bounding area. |
static PointD[] |
randomPoints(int count,
RectD bounds,
PointDComparator comparer,
double distance)
Creates a set of random
PointD coordinates within the specified bounding area,
ensuring a specified pairwise minimum distance. |
static PointD[] |
randomPolygon(double x,
double y,
double width,
double height)
Creates a random simple
PointD polygon within the specified bounding area. |
static RectD |
randomRect(double x,
double y,
double width,
double height)
Creates a random
RectD within the specified bounding area. |
static <T> double[] |
toDoubles(java.lang.Class<T> type,
T... items)
Converts the specified geometric objects to a
Double array. |
static <T> int[] |
toInts(java.lang.Class<T> type,
T... items)
Converts the specified geometric objects to an
Integer array. |
public static LineD[] connectPoints(boolean isClosed, PointD... points)
PointD
coordinates with LineD
instances.
Returns an empty array if points
contains less than two elements. Otherwise,
returns an array with the same number of elements as points
if isClosed
is true
, else one element less.
connectPoints
does not check for identical adjacent points
, or for
congruent LineD
instances. For example, if points
contains two elements
and isClosed
is true
, the returned array will contain two LineD
instances with identical coordinates but opposite directions.
isClosed
- true
to create a LineD
from the last to the first
points
element, else false
.points
- the array of PointD
coordinates to connectLineD
instances connecting all points
in the given orderjava.lang.NullPointerException
- if points
is null
or contains any null
elementspublic static PointD[] convexHull(PointD... points)
PointD
coordinates.
If the specified points
array contains only one or two elements, the result is
a new array containing the same elements. Any points
elements that are coincident
or collinear with other elements are always removed from the returned array, however.
convexHull
performs a Graham scan with an asymptotic runtime of O(n log n).
This Java implementation was adapted from the Graham
algorithm by Joseph O’Rourke,
Computational Geometry in C (2nd ed.), Cambridge University Press 1998, p.72ff.
points
- the array of PointD
coordinates whose convex hull to findpoints
that represents the vertices of the convex hulljava.lang.NullPointerException
- if points
is null
or empty
or contains any null
elementspublic static <T> T[] fromDoubles(java.lang.Class<T> type, double... items)
Double
array to the specified geometric objects.
Dispatches to the fromDoubles
method of LineD
, PointD
,
RectD
, or SizeD
, as indicated by the generic type argument.T
- the geometric type to convert to, which must be either
LineD
, PointD
, RectD
, or SizeD
type
- the Class
object for T, required for method dispatchitems
- an array containing the Double
components of T
instances, stored in successive index positions per instanceitems
java.lang.IllegalArgumentException
- if T is not a valid geometric type,
or if the length of items
is not divisible by the number of Double
components in T, or if any items
are incompatible with Tjava.lang.NullPointerException
- if type
or items
is null
public static <T> T[] fromInts(java.lang.Class<T> type, int... items)
Integer
array to the specified geometric objects.
Dispatches to the fromInts
method of LineI
, PointI
,
RectI
, or SizeI
, as indicated by the generic type argument.T
- the geometric type to convert to, which must be either
LineI
, PointI
, RectI
, or SizeI
type
- the Class
object for T, required for method dispatchitems
- an array containing the Integer
components of T
instances, stored in successive index positions per instanceitems
java.lang.IllegalArgumentException
- if T is not a valid geometric type,
or if the length of items
is not divisible by the number of Integer
components in T, or if any items
are incompatible with Tjava.lang.NullPointerException
- if type
or items
is null
public static int nearestPoint(java.util.List<PointD> points, PointD q)
PointD
nearest to the specified coordinates in the specified collection.
Performs a linear search through points
to find the element with the smallest
Euclidean distance to q
. This is always an O(n) operation, where n is the total
number of points
, unless an exact match for q
is encountered.
If the specified points
are already sorted lexicographically, PointDComparator
offers a much faster PointDComparator.findNearest(java.util.List<org.kynosarges.tektosyne.geometry.PointD>, org.kynosarges.tektosyne.geometry.PointD)
method.
points
- the List
of PointD
elements to searchq
- the PointD
coordinates to locateq
in points
,
if found; else the zero-based index of the points
element with the
smallest Euclidean distance to q
java.lang.NullPointerException
- if points
or q
is null
,
or points
is empty or contains any null
elementspublic static PolygonLocation pointInPolygon(PointD q, PointD[] polygon)
PointD
coordinates relative to the specified
arbitrary PointD
polygon, using exact coordinate comparisons.
Never returns null
. The specified polygon
is implicitly assumed to be closed,
with an edge connecting its first and last vertex. Therefore, all vertices should be different.
pointInPolygon
performs a ray crossings algorithm with an asymptotic runtime of O(n).
This Java implementation was adapted from the InPoly1
algorithm by Joseph O’Rourke,
Computational Geometry in C (2nd ed.), Cambridge University Press 1998, p.244.
q
- the PointD
coordinates to locatepolygon
- an array of PointD
coordinates defining the vertices of an arbitrary polygonPolygonLocation
value indicating the location of q
relative to polygon
java.lang.IllegalArgumentException
- if polygon
has less than three elementsjava.lang.NullPointerException
- if q
or polygon
is null
,
or any polygon
element is null
public static PolygonLocation pointInPolygon(PointD q, PointD[] polygon, double epsilon)
PointD
coordinates relative to the specified
arbitrary PointD
polygon, given the specified epsilon for coordinate comparisons.
Never returns null
. See exact overload for details.q
- the PointD
coordinates to locatepolygon
- an array of PointD
coordinates defining the vertices of an arbitrary polygonepsilon
- the maximum absolute difference at which two coordinates should be considered equalPolygonLocation
value indicating the location of q
relative to polygon
java.lang.IllegalArgumentException
- if polygon
has less than three elements,
or epsilon
is less than or equal to zerojava.lang.NullPointerException
- if q
or polygon
is null
,
or any polygon
element is null
public static double polygonArea(PointD... polygon)
PointD
polygon.
The specified polygon
is implicitly assumed to be closed, with an edge
connecting its first and last vertex. Therefore, all vertices should be different.
Moreover, polygon
must not self-intersect.
The absolute value of polygonArea(org.kynosarges.tektosyne.geometry.PointD...)
equals the area of polygon
, and is
zero if all vertices are collinear or otherwise enclose no area. The sign of a non-zero
value indicates the orientation of its vertices: negative if the vertices are specified
in clockwise order, positive if they are specified in counter-clockwise order, assuming
y-coordinates increase upward.
polygon
- an array of PointD
coordinates defining the vertices of an arbitrary polygonpolygon
, with a sign that indicates the orientation of its verticesjava.lang.IllegalArgumentException
- if polygon
has less than three elementsjava.lang.NullPointerException
- if polygon
is null
or contains any null
elementspublic static PointD polygonCentroid(PointD... polygon)
PointD
polygon.
The specified polygon
is implicitly assumed to be closed, with an edge
connecting its first and last vertex. Therefore, all vertices should be different.
Moreover, polygon
must not self-intersect and its vertices cannot be collinear,
i.e. polygonArea(org.kynosarges.tektosyne.geometry.PointD...)
cannot be zero.polygon
- an array of PointD
coordinates defining the vertices of an arbitrary polygonPointD
coordinates of the centroid (center of gravity) of polygon
java.lang.IllegalArgumentException
- if polygon
has less than three elementsjava.lang.NullPointerException
- if polygon
is null
or contains any null
elementspublic static LineD randomLine(double x, double y, double width, double height)
LineD
within the specified bounding area.x
- the smallest x-coordinate of the bounding areay
- the smallest y-coordinate of the bounding areawidth
- the horizontal extension of the bounding areaheight
- the vertical extension of the bounding areaLineD
with random LineD.start
and LineD.end
points
ranging from (x
, y
) to (x + width
, y + height
)java.lang.IllegalArgumentException
- if width
or height
is equal to or less than zeropublic static PointD randomPoint(double x, double y, double width, double height)
PointD
within the specified bounding area.x
- the smallest x-coordinate of the bounding areay
- the smallest y-coordinate of the bounding areawidth
- the horizontal extension of the bounding areaheight
- the vertical extension of the bounding areaPointD
with random PointD.x
and PointD.y
coordinates
ranging from (x
, y
) to (x + width
, y + height
)java.lang.IllegalArgumentException
- if width
or height
is equal to or less than zeropublic static PointD randomPoint(RectD bounds)
PointD
within the specified bounding area.bounds
- a RectD
defining the the bounding areaPointD
with random PointD.x
and PointD.y
coordinates within bounds
java.lang.IllegalArgumentException
- if RectD.width()
or RectD.height()
of bounds
is zerojava.lang.NullPointerException
- if bounds
is null
public static PointD[] randomPoints(int count, RectD bounds)
PointD
coordinates within the specified bounding area.
The returned array is unsorted and may contain duplicate PointD
coordinates.count
- the number of PointD
coordinates to createbounds
- a RectD
defining the the bounding areacount
randomly created PointD
coordinates within bounds
java.lang.IllegalArgumentException
- if count
is less than zero, or RectD.width()
or RectD.height()
of bounds
is zerojava.lang.NullPointerException
- if bounds
is null
public static PointD[] randomPoints(int count, RectD bounds, PointDComparator comparer, double distance)
PointD
coordinates within the specified bounding area,
ensuring a specified pairwise minimum distance.
The returned array is sorted using the specified comparer
and never contains
any duplicate PointD
coordinates. This method may enter an endless loop if
distance
is too great relative to count
and bounds
.count
- the number of PointD
coordinates to createbounds
- a RectD
defining the the bounding areacomparer
- the PointDComparator
used to sort & search the created arraydistance
- the smallest Euclidean distance between any two PointD
instancescount
randomly created PointD
coordinates within bounds
java.lang.IllegalArgumentException
- if count
is less than zero, or distance
is equal to
or less than zero, or RectD.width()
or RectD.height()
of bounds
is zerojava.lang.NullPointerException
- if bounds
or comparer
is null
public static PointD[] randomPolygon(double x, double y, double width, double height)
PointD
polygon within the specified bounding area.
Moves in a full circle around the center of the specified bounding area, placing vertices
at random angles and radii within the area. Any two vertices are separated by a minimum
angular distance of six degrees. The resulting polygon is simple, i.e. covering a single
contiguous space without self-intersecting.x
- the smallest x-coordinate of the bounding areay
- the smallest y-coordinate of the bounding areawidth
- the horizontal extension of the bounding areaheight
- the vertical extension of the bounding areaPointD
vertices with random PointD.x
and PointD.y
coordinates ranging from (x
, y
) to (x + width
, y + height
)java.lang.IllegalArgumentException
- if width
or height
is equal to or less than zeropublic static RectD randomRect(double x, double y, double width, double height)
RectD
within the specified bounding area.
The RectD.min
coordinates are positively offset from x
and y
by random values from zero to width/2 - 1
and
height/2 - 1
, respectively. The RectD.max
coordinates are
likewise negatively offset from x + width
and y + height
.x
- the smallest x-coordinate of the bounding areay
- the smallest y-coordinate of the bounding areawidth
- the horizontal extension of the bounding areaheight
- the vertical extension of the bounding areaRectD
with random RectD.min
and RectD.max
coordinates
ranging from (x
, y
) to (x + width
, y + height
)java.lang.IllegalArgumentException
- if width
or height
is equal to or less than zeropublic static <T> double[] toDoubles(java.lang.Class<T> type, T... items)
Double
array.
Dispatches to the toDoubles
method of LineD
, PointD
,
RectD
, or SizeD
, as indicated by the generic type argument.T
- the geometric type to convert from, which must be either
LineD
, PointD
, RectD
, or SizeD
type
- the Class
object for T, required for method dispatchitems
- the T array to convertDouble
components of all items
,
stored in successive index positions per T instancejava.lang.IllegalArgumentException
- if T is not a valid geometric typejava.lang.NullPointerException
- if type
or items
is null
,
or items
contains any null
elementspublic static <T> int[] toInts(java.lang.Class<T> type, T... items)
Integer
array.
Dispatches to the toInts
method of LineI
, PointI
,
RectI
, or SizeI
, as indicated by the generic type argument.T
- the geometric type to convert from, which must be either
LineI
, PointI
, RectI
, or SizeI
type
- the Class
object for T, required for method dispatchitems
- the T array to convertInteger
components of all items
,
stored in successive index positions per T instancejava.lang.IllegalArgumentException
- if T is not a valid geometric typejava.lang.NullPointerException
- if type
or items
is null
,
or items
contains any null
elements


DataPackages are a nice and neat tool to work with and bundle Data. However, working with them in browser-based apps is not straight forward. People's hosting doesn't support CORS so including datapackag files using e.g. d3.csv does not work :/. Datapackageproxy to the rescue!
DatapackageProxy is a appengine based script, that takes a datapackage url (without the trailing /datapackage.json) and allows you to access it's resources.
e.g:
http://datapackageproxy.appspot.com/resource?n=0&url=http://data.okfn.org/data/bond-yields-uk-10yshows the first resource in the datapackage. If you're not sure which resource to use, try:
http://datapackageproxy.appspot.com/metadata?url=http://data.okfn.org/data/bond-yields-uk-10yThis will return the metadata for the package.
If you encounter problems using datapackageproxy - that are not due to a faulty datapackage - please submit issues on Github
fork on github


Setting up the Mute Role
Before you can use the moderative command Mute
, you have to set which role is going to be the Mute role. If you haven't tried anything of the sort yet, we'll walk you through it
Decide a Mute Role
Decide which role you are going to use when using mai's mute command. The Color RED gives it a dangerous feeling, and the name Muted gives it justice. However, you can just pick any name and color you want. It's all up to you.
Set or Check the Role Permissions.
Go to Server Settings -> Roles -> The Role you're planning to set as Mute Role -> Scroll Down to "Send Messages Permission" -> Disable.
Make sure the mute role is above all other member's role because other role permissions will override it. Just make sure all moderative permissions (ADMINISTRATOR, Kick Members, Ban Members, Manage Messages, etc.) are turned off. See to it also that this role is below Mai's highest role. For effeciency, place this role under Mai's highest role.
You can also disallow muted members from connecting to voice channel by disabling 'Connect' from the mute role's permission.
If you are well versed in managing role permissions, you may set any disabling permissions to the muterole, and it will take effect.
If you haven't created a role for this yet, create one and just follow the preceeding procedures.
Have Mai Recognize the Muterole.
You can now have Mai recognize this muterole by using the command m!setmute
. Mai will be using this role to add to users whenever the mute
command is called.
You can also check which role the muterole is currently set to by using the same command without parameters
You can now use the moderative command m!mute in your server!


THE PUPPET MASTERS [Spoilers] A film review by Peter J. Scott Copyright 1994 Peter J. Scott
Heinlein fans don't come any more devoted than me, so I had some trepidation about going to see a Hollywood interpretation of one of the works that mean a lot to me. I was pleasantly surprised to find about as faithful a reproduction of the book as one could hope for given time, movie reality, current fashions. When I heard several lines of dialog that were almost verbatim early on, I figured that the writers had at least some respect for the origin; if this has been another one of those films where all they do is take the title and one idea from a book and then do their own thing with it, I would have written angry letters telling them to take RAH's name off it. But I won't.
[Spoilers follow. Also much *personal opinion*.]
Given the two-hour limit, any novel has to have drastic surgery, and attempting to cover everything in a complex book just by going faster won't work (c.f. DUNE). I would have liked to have seen the bareback Congress, that scene would have worked; but I think they were right not to try to show the vigilantism; for one thing, RAH covered this in rapid narration, which is too boring in a movie, and showing it makes for too much quick cutting between characters and settings you've never seen before. I suspect there were some controversial edits, since 1) there seemed to be something missing in between the chase of Miss Haines and the presidential arrival, and 2) the TV news of rioting was pretty brief and isolated, so I suspect there was more filmed around those scenes. (Anyone know where there might be published a "Making Of" story?--I've already read the posting earlier in rec.arts.sf.movies.)
Also, movies emphasize visual and action sequences more than books by their very nature; while so many authors' novels reveal them to be frustrated screenwriters in disguise, with lengthy blow-by-blow fight descriptions, RAH focussed more on ideas, thoughts, and emotions, spending pages on fascinating dialog, while a fight scene would last a couple of sentences. In the movie business it's the other way around, because even die-hard intellectuals will get bored otherwise. So that emphasis was to be expected.
I was in much the same place as<EMAIL_ADDRESS>(Wayne Throop):
> As I say, an odd sensation. And not that I thought it was bad, or > even that it wasn't good. Just ... blank. People with me, who hadn't > read the book, said it was good. But (unusual for me) I had no sense > one way or any other.
It didn't grab me emotionally, and I'm not sure whether that was the fault of the movie, the book, or what I was thinking while watching it. On the plus side, Donald Sutherland as the Old Man worked for me - and that's a tough set of expectations to live up to. It would have been easy for the movie to have been embarrassing to watch (and I'm still quaking at the thought of Tom Hanks as Valentine Michael Smith), but it wasn't--in the end, I was happy that RAH's name was on it, and I'd like to think that he would have been too.
-- Peter Scott, NASA/JPL/Caltech<EMAIL_ADDRESS>.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Higher-level Natural Language Processing with textacy
01:45 PM - 02:10 PM on July 17, 2016, Room CR7Burton DeWilde
- Audience level:
- intermediate
Description
Although the Python community is already served by many open-source packages for NLP, few if any offer state-of-the-art performance; a holistic, higher-level feature set; and a user-friendly API. textacy was built to fill the gap. In this talk, I will demonstrate some of textacy's functionality by working through an end-to-end example of topic modeling.
Abstract
Interest in the field of Natural Language Processing (NLP) is high and rising, and the field itself is advancing rapidly. There are a number of Python packages for NLP, including the venerable NLTK and pattern libraries, vector space model-oriented gensim and sklearn, and multilingual polyglot. In particular, a recent addition to the ecosystem called spaCy (https://spacy.io/) offers state-of-the-art performance on foundational NLP tasks such as tokenization, part-of-speech tagging, dependency parsing, and named entity recognition. textacy (http://textacy.readthedocs.io/) builds upon the solid foundation provided by spaCy and others in order to perform higher-level NLP tasks, with an emphasis on text analysis of news articles.
A given NLP task typically involves far more than just applying an algorithm or model to one or more text documents, so textacy attempts to cover that wider range of functionality. It efficiently streams data to and from disk in several formats; provides functions for cleaning/normalizing raw text; links document content and metadata for better bookkeeping and richer document representations; transforms documents into bags-of-words, semantic networks, and term lists; extracts structured information such as acronym definitions, subject-verb-object triples, and quotations; applies models to parsed documents, including unsupervised keyterm extraction and LSA, LDA, and NMF topic models; and facilitates visualization and interpretation of analysis results. It also includes easy access to standard and novel corpora, from a stream of plaintext or structured Wikipedia articles to a collection of Congressional speeches by Bernie Sanders and Hillary Clinton.
In this talk, I will demonstrate some of textacy's functionality by working through an end-to-end example of topic modeling.


pyspark.
RDD
A Resilient Distributed Dataset (RDD), the basic abstraction in Spark. Represents an immutable, partitioned collection of elements that can be operated on in parallel.
Methods
aggregate(zeroValue, seqOp, combOp)
aggregate
Aggregate the elements of each partition, and then the results for all the partitions, using a given combine functions and a neutral “zero value.”
aggregateByKey(zeroValue, seqFunc, combFunc)
aggregateByKey
Aggregate the values of each key, using given combine functions and a neutral “zero value”.
barrier()
barrier
Marks the current stage as a barrier stage, where Spark must launch all tasks together.
cache()
cache
Persist this RDD with the default storage level (MEMORY_ONLY).
cartesian(other)
cartesian
Return the Cartesian product of this RDD and another one, that is, the RDD of all pairs of elements (a, b) where a is in self and b is in other.
(a, b)
a
b
checkpoint()
checkpoint
Mark this RDD for checkpointing.
cleanShuffleDependencies([blocking])
cleanShuffleDependencies
Removes an RDD’s shuffles and it’s non-persisted ancestors.
coalesce(numPartitions[, shuffle])
coalesce
Return a new RDD that is reduced into numPartitions partitions.
cogroup(other[, numPartitions])
cogroup
For each key k in self or other, return a resulting RDD that contains a tuple with the list of values for that key in self as well as other.
collect()
collect
Return a list that contains all of the elements in this RDD.
collectAsMap()
collectAsMap
Return the key-value pairs in this RDD to the master as a dictionary.
collectWithJobGroup(groupId, description[, …])
collectWithJobGroup
When collect rdd, use this method to specify job group.
combineByKey(createCombiner, mergeValue, …)
combineByKey
Generic function to combine the elements for each key using a custom set of aggregation functions.
count()
count
Return the number of elements in this RDD.
countApprox(timeout[, confidence])
countApprox
Approximate version of count() that returns a potentially incomplete result within a timeout, even if not all tasks have finished.
countApproxDistinct([relativeSD])
countApproxDistinct
Return approximate number of distinct elements in the RDD.
countByKey()
countByKey
Count the number of elements for each key, and return the result to the master as a dictionary.
countByValue()
countByValue
Return the count of each unique value in this RDD as a dictionary of (value, count) pairs.
distinct([numPartitions])
distinct
Return a new RDD containing the distinct elements in this RDD.
filter(f)
filter
Return a new RDD containing only the elements that satisfy a predicate.
first()
first
Return the first element in this RDD.
flatMap(f[, preservesPartitioning])
flatMap
Return a new RDD by first applying a function to all elements of this RDD, and then flattening the results.
flatMapValues(f)
flatMapValues
Pass each value in the key-value pair RDD through a flatMap function without changing the keys; this also retains the original RDD’s partitioning.
fold(zeroValue, op)
fold
Aggregate the elements of each partition, and then the results for all the partitions, using a given associative function and a neutral “zero value.”
foldByKey(zeroValue, func[, numPartitions, …])
foldByKey
Merge the values for each key using an associative function “func” and a neutral “zeroValue” which may be added to the result an arbitrary number of times, and must not change the result (e.g., 0 for addition, or 1 for multiplication.).
foreach(f)
foreach
Applies a function to all elements of this RDD.
foreachPartition(f)
foreachPartition
Applies a function to each partition of this RDD.
fullOuterJoin(other[, numPartitions])
fullOuterJoin
Perform a right outer join of self and other.
getCheckpointFile()
getCheckpointFile
Gets the name of the file to which this RDD was checkpointed
getNumPartitions()
getNumPartitions
Returns the number of partitions in RDD
getResourceProfile()
getResourceProfile
Get the pyspark.resource.ResourceProfile specified with this RDD or None if it wasn’t specified.
pyspark.resource.ResourceProfile
getStorageLevel()
getStorageLevel
Get the RDD’s current storage level.
glom()
glom
Return an RDD created by coalescing all elements within each partition into a list.
groupBy(f[, numPartitions, partitionFunc])
groupBy
Return an RDD of grouped items.
groupByKey([numPartitions, partitionFunc])
groupByKey
Group the values for each key in the RDD into a single sequence.
groupWith(other, *others)
groupWith
Alias for cogroup but with support for multiple RDDs.
histogram(buckets)
histogram
Compute a histogram using the provided buckets.
id()
id
A unique ID for this RDD (within its SparkContext).
intersection(other)
intersection
Return the intersection of this RDD and another one.
isCheckpointed()
isCheckpointed
Return whether this RDD is checkpointed and materialized, either reliably or locally.
isEmpty()
isEmpty
Returns true if and only if the RDD contains no elements at all.
isLocallyCheckpointed()
isLocallyCheckpointed
Return whether this RDD is marked for local checkpointing.
join(other[, numPartitions])
join
Return an RDD containing all pairs of elements with matching keys in self and other.
keyBy(f)
keyBy
Creates tuples of the elements in this RDD by applying f.
keys()
keys
Return an RDD with the keys of each tuple.
leftOuterJoin(other[, numPartitions])
leftOuterJoin
Perform a left outer join of self and other.
localCheckpoint()
localCheckpoint
Mark this RDD for local checkpointing using Spark’s existing caching layer.
lookup(key)
lookup
Return the list of values in the RDD for key key.
map(f[, preservesPartitioning])
map
Return a new RDD by applying a function to each element of this RDD.
mapPartitions(f[, preservesPartitioning])
mapPartitions
Return a new RDD by applying a function to each partition of this RDD.
mapPartitionsWithIndex(f[, …])
mapPartitionsWithIndex
Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.
mapPartitionsWithSplit(f[, …])
mapPartitionsWithSplit
mapValues(f)
mapValues
Pass each value in the key-value pair RDD through a map function without changing the keys; this also retains the original RDD’s partitioning.
max([key])
max
Find the maximum item in this RDD.
mean()
mean
Compute the mean of this RDD’s elements.
meanApprox(timeout[, confidence])
meanApprox
Approximate operation to return the mean within a timeout or meet the confidence.
min([key])
min
Find the minimum item in this RDD.
name()
name
Return the name of this RDD.
partitionBy(numPartitions[, partitionFunc])
partitionBy
Return a copy of the RDD partitioned using the specified partitioner.
persist([storageLevel])
persist
Set this RDD’s storage level to persist its values across operations after the first time it is computed.
pipe(command[, env, checkCode])
pipe
Return an RDD created by piping elements to a forked external process.
randomSplit(weights[, seed])
randomSplit
Randomly splits this RDD with the provided weights.
reduce(f)
reduce
Reduces the elements of this RDD using the specified commutative and associative binary operator.
reduceByKey(func[, numPartitions, partitionFunc])
reduceByKey
Merge the values for each key using an associative and commutative reduce function.
reduceByKeyLocally(func)
reduceByKeyLocally
Merge the values for each key using an associative and commutative reduce function, but return the results immediately to the master as a dictionary.
repartition(numPartitions)
repartition
Return a new RDD that has exactly numPartitions partitions.
repartitionAndSortWithinPartitions([…])
repartitionAndSortWithinPartitions
Repartition the RDD according to the given partitioner and, within each resulting partition, sort records by their keys.
rightOuterJoin(other[, numPartitions])
rightOuterJoin
sample(withReplacement, fraction[, seed])
sample
Return a sampled subset of this RDD.
sampleByKey(withReplacement, fractions[, seed])
sampleByKey
Return a subset of this RDD sampled by key (via stratified sampling).
sampleStdev()
sampleStdev
Compute the sample standard deviation of this RDD’s elements (which corrects for bias in estimating the standard deviation by dividing by N-1 instead of N).
sampleVariance()
sampleVariance
Compute the sample variance of this RDD’s elements (which corrects for bias in estimating the variance by dividing by N-1 instead of N).
saveAsHadoopDataset(conf[, keyConverter, …])
saveAsHadoopDataset
Output a Python RDD of key-value pairs (of form RDD[(K, V)]) to any Hadoop file system, using the old Hadoop OutputFormat API (mapred package).
RDD[(K, V)]
saveAsHadoopFile(path, outputFormatClass[, …])
saveAsHadoopFile
saveAsNewAPIHadoopDataset(conf[, …])
saveAsNewAPIHadoopDataset
Output a Python RDD of key-value pairs (of form RDD[(K, V)]) to any Hadoop file system, using the new Hadoop OutputFormat API (mapreduce package).
saveAsNewAPIHadoopFile(path, outputFormatClass)
saveAsNewAPIHadoopFile
saveAsPickleFile(path[, batchSize])
saveAsPickleFile
Save this RDD as a SequenceFile of serialized objects.
saveAsSequenceFile(path[, compressionCodecClass])
saveAsSequenceFile
Output a Python RDD of key-value pairs (of form RDD[(K, V)]) to any Hadoop file system, using the “org.apache.hadoop.io.Writable” types that we convert from the RDD’s key and value types.
saveAsTextFile(path[, compressionCodecClass])
saveAsTextFile
Save this RDD as a text file, using string representations of elements.
setName(name)
setName
Assign a name to this RDD.
sortBy(keyfunc[, ascending, numPartitions])
sortBy
Sorts this RDD by the given keyfunc
sortByKey([ascending, numPartitions, keyfunc])
sortByKey
Sorts this RDD, which is assumed to consist of (key, value) pairs.
stats()
stats
Return a StatCounter object that captures the mean, variance and count of the RDD’s elements in one operation.
StatCounter
stdev()
stdev
Compute the standard deviation of this RDD’s elements.
subtract(other[, numPartitions])
subtract
Return each value in self that is not contained in other.
subtractByKey(other[, numPartitions])
subtractByKey
Return each (key, value) pair in self that has no pair with matching key in other.
sum()
sum
Add up the elements in this RDD.
sumApprox(timeout[, confidence])
sumApprox
Approximate operation to return the sum within a timeout or meet the confidence.
take(num)
take
Take the first num elements of the RDD.
takeOrdered(num[, key])
takeOrdered
Get the N elements from an RDD ordered in ascending order or as specified by the optional key function.
takeSample(withReplacement, num[, seed])
takeSample
Return a fixed-size sampled subset of this RDD.
toDF([schema, sampleRatio])
toDF
toDebugString()
toDebugString
A description of this RDD and its recursive dependencies for debugging.
toLocalIterator([prefetchPartitions])
toLocalIterator
Return an iterator that contains all of the elements in this RDD.
top(num[, key])
top
Get the top N elements from an RDD.
treeAggregate(zeroValue, seqOp, combOp[, depth])
treeAggregate
Aggregates the elements of this RDD in a multi-level tree pattern.
treeReduce(f[, depth])
treeReduce
Reduces the elements of this RDD in a multi-level tree pattern.
union(other)
union
Return the union of this RDD and another one.
unpersist([blocking])
unpersist
Mark the RDD as non-persistent, and remove all blocks for it from memory and disk.
values()
values
Return an RDD with the values of each tuple.
variance()
variance
Compute the variance of this RDD’s elements.
withResources(profile)
withResources
Specify a pyspark.resource.ResourceProfile to use when calculating this RDD.
zip(other)
zip
Zips this RDD with another one, returning key-value pairs with the first element in each RDD second element in each RDD, etc.
zipWithIndex()
zipWithIndex
Zips this RDD with its element indices.
zipWithUniqueId()
zipWithUniqueId
Zips this RDD with generated unique Long ids.
Attributes
context
The SparkContext that this RDD was created on.
SparkContext


Home
Find a Pet
Find a Dog
Find a Cat
Find Other Pets
Pet Care
User Management
Pet Management
Sign Out
#
First
Last
Manage
1
Mark
Otto
Manage
2
Jacob
Thornton
Manage
3
Larry
the Bird
Manage
Previous
Next


Software development is pure fun for everyone
Hi, my name is Toms Veilands and I'm still learning new things every day that's why this website is still here for everyone to explore and enjoy. All content here is dedicated for my early days teachers and also for my fellow students who are now in the same shoes as I used to be when I studdied at University of Latvia.
I'm not a full time software developer anymore, though my studies in LU did require some programming skills to be learned and also demonstrated. We were given quite a limited development environment where to host our work, mostly static HTML
pages and I found out that Jekyll is absolutely perfect solution for rendering static HTML
pages and additionally to that will perform beautifull software code highlights via help of Pygments, that is all what I ever wanted and needed, though I got much more included once I learned about the neat features what Jekyll had to offer out of the box.
Additionally to the mentioned above there is one more tiny thing to add that was missing from our education program, this is a minor fact - that today many websites are being accessed from all kind of different devices, such as tablets, mobile smartphones, TV's, etc. and it requires a lot of work to fine tune CSS
to make the content appear equally good on all possible screens. I found out that Sass is an excellent choice for web developers to address this issue. Once I learned on how to use it I'm much more convinced that my website is still in a good standing order and in compliance with responsive web design standards and principles.
On a daily basis I'm employed as an IT project manager at Lattelecom I love software development for my own pleasure and entertainment and I like it this way. I'm not ready to return back to full time software developer position yet though I loved those days a lot and sometimes I feel a bit nostalgic about that time of my life. Today, when I have to discuss with our software developers about how the solution is going to be built, tested and deployed, we can understand each other much better, I feel much more comfortable than those folks in our IT department who have no programming knowledge and skills at all.
I will keep this information short here, in case if you need something, please don't hesitate to get in touch with me and I will be happy to handle your request =]


Models
A logistic regression model to predict the probability of a soccer shot being a goal
-
runmodel.
runmodel
()[source]
This function includes:
- Split data into training and testing.
- Train the model using logistic regression.
- Output the summary result.
- Save the model result into pickle file.
-
preprocess.
preprocss
()[source]
This function includes:
- Read data from directory.
- Reduce event_type into 6 levels.
- Convert assist_method into “Yes” and “No”.
- Upsample the data.
-
app.
model
()[source]
Read values from inputs on the website and return the predicted result.
-
app.
parser
()[source]
Initialize the webpage


--- layout: page title: Hi, I'm Rong Shi use-site-title: true ---
I enjoy building systems and my research interests lie in the area of large-scale distributed system with a focus on consistency and scalability. Previously, I was working on high performance computing with a focus on optimizing communication in GPU accelerated clusters.
I received my Ph.D. in Computer Science and Engineering from The Ohio State University in 2018 and my advisor was Professor Yang Wang. Before that, I received my B.S. and M.S. in School of Computer Science and Engineering from University of Electronic Science and Technology of China.
Joined Facebook as Research Scientist on Oct 2018
Defensed Ph.D. dissertation on Aug 2018


| Methods Summary | ||
|---|---|---|
public
|
||
protected
|
||
protected
|
||
public
|
||
protected
|
||
public
|
||
public
|
#
callSilent( string $command , array $arguments = array ( ) )
Call another console command silently.
|
|
protected
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
#
anticipate( string $question , array $choices , string $default = NULL )
Prompt the user for input with auto completion.
|
|
public
|
#
askWithCompletion( string $question , array $choices , string $default = NULL )
Prompt the user for input with auto completion.
|
|
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
public
|
||
protected
|
||
protected
|
#
parseVerbosity( string|int $level = NULL )
Get the verbosity level in terms of Symfony's OutputInterface level.
|
|
protected
|
||
protected
|
||
public
|
||
public
|
||
public
|
#
setLaravel( \Illuminate\Contracts\Container\Container $laravel )
Set the Laravel application instance.
|
| Methods used from Illuminate\Support\Traits\Macroable trait |
|---|
macro()
mixin()
hasMacro()
__callStatic()
__call()
|
| Properties Summary | ||
|---|---|---|
protected
Illuminate\Contracts\Foundation\Application
|
$laravel
The Laravel application instance.
|
#
NULL
|
protected
Symfony\Component\Console\Input\InputInterface
|
$input
The input interface implementation.
|
#
NULL
|
protected
Illuminate\Console\OutputStyle
|
$output
The output interface implementation.
|
#
NULL
|
protected
string
|
$signature
The name and signature of the console command.
|
#
NULL
|
protected
string
|
$name
The console command name.
|
#
NULL
|
protected
string
|
$description
The console command description.
|
#
NULL
|
protected
int
|
$verbosity
The default verbosity of output commands.
|
#
32
|
protected
array
|
$verbosityMap
The mapping between human readable verbosity levels and Symfony's OutputInterface.
|
#
array (
'v' => 64,
'vv' => 128,
'vvv' => 256,
'quiet' => 16,
'normal' => 32,
)
|
| Properties inherited from Symfony\Component\Console\Command\Command |
|---|
$defaultName
|
| Properties used from Illuminate\Support\Traits\Macroable |
|---|
$macros
|


|
AceTime
2.3.0
Date and time classes for Arduino that support timezones from the TZ Database.
|
The time (hour, minute, second) fields representing the time without regards to the day or the time zone. More...
#include <LocalTime.h>
Public Member Functions | |
| LocalTime () | |
| Default constructor does nothing. | |
| bool | isError () const |
| Return true if any component is outside the normal time range of 00:00:00 to 23:59:59. More... | |
| uint8_t | hour () const |
| Return the hour. | |
| void | hour (uint8_t hour) |
| Set the hour. | |
| uint8_t | minute () const |
| Return the minute. | |
| void | minute (uint8_t minute) |
| Set the minute. | |
| uint8_t | second () const |
| Return the second. | |
| void | second (uint8_t second) |
| Set the second. | |
| uint8_t | fold () const |
| Return the fold. | |
| void | fold (uint8_t fold) |
| Set the fold. | |
| acetime_t | toSeconds () const |
| Return the number of seconds since midnight. More... | |
| int8_t | compareTo (const LocalTime &that) const |
| Compare 'this' LocalTime with 'that' LocalTime, and return (<0, 0, >0) according to whether 'this' occurs (before, same as, after) 'that'. More... | |
| void | printTo (Print &printer) const |
| Print LocalTime to 'printer' in ISO 8601 format. More... | |
| LocalTime (const LocalTime &)=default | |
| LocalTime & | operator= (const LocalTime &)=default |
Static Public Member Functions | |
| static LocalTime | forComponents (uint8_t hour, uint8_t minute, uint8_t second, uint8_t fold=0) |
| Factory method using separated date, time, and time zone fields. More... | |
| static LocalTime | forSeconds (acetime_t seconds, uint8_t fold=0) |
| Factory method. More... | |
| static LocalTime | forTimeString (const char *timeString) |
| Factory method. More... | |
| static LocalTime | forTimeStringChainable (const char *&timeString) |
| Variant of forTimeString() that updates the pointer to the next unprocessed character. More... | |
| static LocalTime | forError () |
| Factory method that returns an instance which indicates an error condition. More... | |
Static Public Attributes | |
| static const int32_t | kInvalidSeconds = INT32_MIN |
| An invalid seconds marker that indicates isError() true. | |
Friends | |
| bool | operator== (const LocalTime &a, const LocalTime &b) |
| Return true if two LocalTime objects are equal. More... | |
The time (hour, minute, second) fields representing the time without regards to the day or the time zone.
The valid range is 00:00:00 to 23:59:59. Trying to create an instance outside of this range causes the isError() method to return true, and toSeconds() returns kInvalidSeconds.
Parts of this class were inspired by the java.time.LocalTime class of Java 11 (https://docs.oracle.com/en/java/javase/11/docs/api/java.base/java/time/LocalTime.html). The 'fold' parameter was inspired by the datetime package in Python 3.6.
Definition at line 27 of file LocalTime.h.
|
inline |
Compare 'this' LocalTime with 'that' LocalTime, and return (<0, 0, >0) according to whether 'this' occurs (before, same as, after) 'that'.
The 'fold' parameter is ignored.
If either this->isError() or that.isError() is true, the behavior is undefined.
Definition at line 162 of file LocalTime.h.
|
inlinestatic |
Factory method using separated date, time, and time zone fields.
The dayOfWeek will be lazily evaluated. No data validation is performed on the fields on construction, but if any field is out of range, then isError() will return true.
| hour | hour (0-23) |
| minute | minute (0-59) |
| second | second (0-59), does not support leap seconds |
| fold | optional disambiguation of multiple occurrences [0, 1] |
Definition at line 43 of file LocalTime.h.
|
inlinestatic |
Factory method that returns an instance which indicates an error condition.
The isError() method will return true.
Definition at line 95 of file LocalTime.h.
|
inlinestatic |
Factory method.
Create the various components of the LocalTime from the number of seconds from midnight. If kInvalidSeconds is given, the isError() condition is set to be true. The behavior is undefined if seconds is greater than 86399.
| seconds | number of seconds from midnight, (0-86399) |
Definition at line 56 of file LocalTime.h.
|
static |
Factory method.
Create a LocalTime from the ISO 8601 time string. If the string cannot be parsed, then returns LocalTime::forError(). However, the data validation on parsing is very weak and the behavior is undefined for most invalid time strings.
Definition at line 28 of file LocalTime.cpp.
|
static |
Variant of forTimeString() that updates the pointer to the next unprocessed character.
This allows chaining to another forXxxStringChainable() method.
This method assumes that the dateString is sufficiently long.
Definition at line 36 of file LocalTime.cpp.
|
inline |
Return true if any component is outside the normal time range of 00:00:00 to 23:59:59.
We add the exception that 24:00:00 is also considered valid to allow ExtendedZoneProcessor (and maybe BasicZoneProcessor) to support midnight transitions from the TZ Database.
Definition at line 108 of file LocalTime.h.
| void ace_time::LocalTime::printTo | ( | Print & | printer | ) | const |
Print LocalTime to 'printer' in ISO 8601 format.
This class does not implement the Printable interface to avoid increasing the size of the object from the additional virtual function.
Definition at line 14 of file LocalTime.cpp.
|
inline |
Return the number of seconds since midnight.
Return kInvalidSeconds if isError() is true.
Definition at line 145 of file LocalTime.h.
Return true if two LocalTime objects are equal.
The fold is ignored.
Definition at line 220 of file LocalTime.h.


Bruno Fernandes addresses future following interest from Manchester United, Tottenham Hotspur
by HarigovindBruno Fernandes was one of the most-discussed names during the summer transfer window, thanks to the interest in him from Manchester United, Tottenham Hotspur and Real Madrid. However, he chose to remain at Sporting CP, and thereby put a temporary full-stop to all the transfer talk.
But in a recent interview, the Portugal international opened up once again on his dream move in the future, after Manchester United and Tottenham Hotspur renewed their interest in him.
According to Express, he said that he is in no rush to force an exit from Sporting, when he gets the chance to leave again during the upcoming January transfer window.
“I’m not worried at all [about transfer window speculation],” he said, after Portugal beat Lithuania 6-0 on Thursday in the 2020 UEFA Euro qualifiers.
He further added: “Since 2016, there’s been talk about my possible departure.”
“I’m well, doing my job and doing the best I can. I have dreams to fulfil but I have no need to force my departure.”
“I feel the love here and if I have to leave, I hope I leave good memories.”
Meanwhile, Express also claims that most of the talks on Manchester United’s potential move for Bruno Fernandes came from a Portugal, as Sporting attempted to drive up interest and his price-tag.
It remains to be seen whether United will continue to try for his signature during the January transfer window.


Java EE
Java 8
Servlet
JSP
JSF 2
Primefaces
Vaadin
Spring MVC
iReport
Web Service
JAX-RS
JAX-WS
ActiveMQ
XStream
Jasper Reports
Maven
Tomcat
JBoss
Glassfish
WebLogic
Oracle ATG Web Commerce
Oracle Endeca
User Experience
Oracle
MySQL
SQL Server
PostgreSQL
Map Reduce
Hive
Redis
MongoDB
Hadoop
Greenplum Database
JavaScript
HTML
CSS
Networking
JQuery
JSON
Bootstrap
cURL
Shellscript
SVN
Git
- Participation on the New NetEmpresa's project (Bradesco's bankline for companies).
- QA Testing.
- Development of a Guide for the application developer , where they were able to consult examples of the API AWB's components, developed in Java using JSP, Servlet, JSF, EJB, Spring and deploy on Websphere.
- Support the demands of the Front End Team, using HTML, CSS, Javascript and JQuery.
- Adaptation of the application to give support for Virtual Vision's Software.
- Revision on the Application's User Guide.
- Participation on the Campaign Management Project of the Magazine Luiza.
- QA Testing in the application.
- Fixes in the application.
- Elaboration of reports and documents.
- Development of functions in the application using Java EE, Vaadin, JPA, Hibernate, SQL Server, Oracle DB, JSON, Servlet, Tomcat.
- Creation of an Application's User Guide.
- Development of Features and Improvements to the store for Desktop and Mobile versions, using JAVA EE, Oracle ATG, Oracle Endeca, Oracle DB, JavaScript, JSP and Weblogic.
- Participation in projects, Netshoes Mobile Version and Netshoes app since its planning stages, until its release date.
- Web Service Development for consumption, fixes and support.
- Integration of the Netshoes app with the Main Store via Webservice with response in JSON.
- Support and contact with the international teams (India and US).
- Java Development to ingest HDFS Data using MapReduce.
- Shellscript Development to ingest HDFS Data.
- HDFS Navigation.
- Run Queries over Hive and Greenplum.
- Watch over the Abended Jobs from Control-M to fix the workflow.
- Lib development in shellscript containing some hive operations to easly import on other projects from the Software Factory.
Java Developer
Hello there! My name is Jhonatan, I'm 26 years old, I'm from Brazil. I'm a Java Developer, who likes to study most of my free times. Also on free times, i like to Read, play Baskteball, play Videogames and Hangout with Friends. About my personality, i can say that I'm a shy person who works hard and on group. My coworkers says that I'm a Hands On type of person. I think that my worst quality is that, some times I'm very insistent, and sometimes sounds like stubbornness. My biggest quality is that I'm a hardworker always aiming to achieve the best results. I'm always looking forward to learn new things, challanges, grow as a professional and as a person.


KTUTIL
Section: User Commands (1)Index Return to Main Contents
NAME
ktutil - Kerberos keytab file maintenance utilitySYNOPSIS
ktutilDESCRIPTION
The ktutil command invokes a subshell from which an administrator can read, write, or edit entries in a Kerberos V5 keytab or V4 srvtab file.COMMANDS
- list
- Displays the current keylist. Alias: l.
- read_kt keytab
- Read the Kerberos V5 keytab file keytab into the current keylist. Alias: rkt
- read_st srvtab
- Read the Kerberos V4 srvtab file srvtab into the current keylist. Alias: rst.
- write_kt keytab
- Write the current keylist into the Kerberos V5 keytab file keytab. Alias: wkt.
- write_st srvtab
- Write the current keylist into the Kerberos V4 srvtab file srvtab. Alias: wst.
- clear_list
- Clear the current keylist. Alias: clear.
- delete_entry slot
- Delete the entry in slot number slot from the current keylist. Alias: delent.
- add_entry (-key | -password) -p principal -k kvno -e enctype
- Add principal to keylist using key or password. Alias: addent.
- list_requests
- Displays a listing of available commands. Aliases: lr, ?.
- quit
- Quits ktutil. Aliases: exit, q.
SEE ALSO
kadmin(8), kdb5_util(8)
Index
This document was created by man2html, using the manual pages.
Time: 05:29:05 GMT, December 24, 2015


Namespaces | |
| partition | |
| overlay | |
| envelope | |
| is_simple | |
| is_valid | |
| de9im | |
| turns | |
| helper_geometries | |
Classes | |
| struct | andoyer_inverse |
| The solution of the inverse problem of geodesics on latlong coordinates, Forsyth-Andoyer-Lambert type approximation with first order terms. More... | |
| struct | coordinate_cast< rational< T > > |
| struct | result_direct |
| struct | result_inverse |
| struct | thomas_inverse |
| The solution of the inverse problem of geodesics on latlong coordinates, Forsyth-Andoyer-Lambert type approximation with second order terms. More... | |
| struct | unique_types |
| struct | variant_or_single |
| struct | vincenty_direct |
| The solution of the direct problem of geodesics on latlong coordinates, after Vincenty, 1975. More... | |
| struct | vincenty_inverse |
| The solution of the inverse problem of geodesics on latlong coordinates, after Vincenty, 1975. More... | |
Functions | |
| template<typename Range , typename Geometry > | |
| Range & | as_range (Geometry &input) |
| Function getting either the range (ring, linestring) itself or the outer ring (polygon) More... | |
| template<typename Range , typename Geometry > | |
| Range const & | as_range (Geometry const &input) |
| Function getting either the range (ring, linestring) itself or the outer ring (polygon), const version. More... | |
| template<typename Geometry , typename Actor > | |
| void | for_each_range (Geometry const &geometry, Actor &actor) |
| Range& boost::geometry::detail::as_range | ( | Geometry & | input | ) |
Function getting either the range (ring, linestring) itself or the outer ring (polygon)
Utility to handle polygon's outer ring as a range
| Range const& boost::geometry::detail::as_range | ( | Geometry const & | input | ) |
Function getting either the range (ring, linestring) itself or the outer ring (polygon), const version.
Utility to handle polygon's outer ring as a range
| void boost::geometry::detail::for_each_range | ( | Geometry const & | geometry, |
| Actor & | actor | ||
| ) |
|
April 2, 2011 |
Copyright © 2007-2011 Barend Gehrels, Amsterdam, the Netherlands Copyright © 2008-2011 Bruno Lalande, Paris, France Copyright © 2009-2010 Mateusz Loskot, London, UK |


Education For Everyone Everywhere
Home
Newsletter
Programs
Faculty
admission
Contactus
CAMPUS COURSES
Courses fees
Rupees
USD
Chinese yuan
Pound
Rs 5000
Rs 9000
Rs 7000
Rs 10000
Rs 15000
Your browser does not support canvas


Rails3: using Arel to make conditional searches based on conditional params
I wrote a basic model called Search, I can re-use it for other models that need search features:
# put this in app/models/search.rb
class Search
attr_accessor :attributes
def initialize(attributes = {})
@attributes = attributes
@attributes.each do |k,v|
self.class.send(:define_method,k) { v }
end
end
end
Then I wrote a partial form with params, the following code is only an example, I have more fields:

<%= form_tag search_people_path, :method => 'get' do |f| %>

<%= label :search, :firstname, 'Firstname' %>

<%= text_field :search, :firstname %>

<%= label :search, :lastname, 'Lastname' %>

<%= text_field :search, :lastname %>

<%= submit_tag "Search" %>
<% end %>

Finally the controller action called ‘search’. As you can see, the difficult part was that you don’t know which params are passed by the request, so you need to specify conditions only if they are present. Arel helped to resolve this problem:
class PeopleController < ApplicationController
# ... other CRUD actions ...
def search
q = Person.arel_table # initialize Arel table
@people = Person.order(:created_at) # start with a simple option
@search = Search.new(params[:search]) # initialize Search model with the search params
# apply conditions only if they are present
@people = @people.where(q[:lastname].matches("%#{@search.lastname}%")) if @search.lastname
@people = @people.where(q[:firstname].matches("%#{@search.firstname}%")) if @search.firstname
render :index # render index action, it's the same output, just filtered by conditions passed
end
end
Probably it’s not the best solution, perhaps this could be optimized with some helper, but it works, and helps to figure out how Arel works.
Webografy:
Notes:
This article was initially published on http://blog.andreapavoni.com/post/758178172/rails3-using-arel-to-make-conditional-searches-based


Josh Glugatch
Contact
Portfolio
About
(current)
Contact
(805)217-8127
<EMAIL_ADDRESS>Name
Email address
Message
Submit


--- layout: post status: publish published: true title: '"Pretty Un-Olt-adox" - Podcast Episode 6.34' author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 10403 wordpress_url: http://ivyenvy.com/?p=10403 date: '2014-09-07 22:53:48 +0000' date_gmt: '2014-09-08 03:53:48 +0000' categories: - Podcast tags: - Starlin Castro - Daytona Cubs - Javier Baez - Anthony Rizzo - Jorge Soler - Kane County Cougars - Mike Olt comments: [] ---
We haven't had any significant injuries to discuss in a while and on this episode, the 271st of The Ivy Envy Podcast, we talk about the injuries to Castro and Rizzo. September looked to be real exciting as a good portion of the line-up was comprised of players that could be long-term pieces for the team. While we still get to see some of the young players, it is a bit disappointing that we won't get to see a line-up with them and the "veterans", Castro and Rizzo.
The rosters expand in September and we discuss the players that the Cubs have called up. Two Cubs minor league teams are still in the post-season and we check in on their runs for championships. We also can't avoid talking about Mike Olt in this conversation.
It's common to hear people talk about the Cubs being a dangerous team because they are "playing loose." We talk about this idea and explain why we don't really buy it. We also spend some time talking about the popular opinion going around baseball that the Cubs are the surprise team for 2015. Is it good to start putting premature expectations on this extremely young team?
Of course, we check in on Baez and Soler. We go through a handful of listener questions, Kurt gives us a Scary Stat of the Week and we read some internet muscle flexes.
If you'd like to support our podcast through Patreon, check out - http://patreon.com/ivyenvy


+++ title = "New York" lat = 40.758050 lon = -73.986740 +++
The centre of the world. Need I say more, or is that not a sufficient description of New York — one of the biggest, the liveliest, the craziest, and the most colourful cities known to man? After seven years, it's good to be back in the Big Apple. And it's good to see that, although a group of lunatics managed to destroy one of the city's most famous landmarks back in 2001, they failed to destroy even the teeniest fragment of New York's beautiful, and 100% unique, vibe and culture. Its heart and soul.


|
Bug-reproducer Assistant Python kernel
1.0
Código Python de kernel del Bug-reproducer Assistant
|
Public Member Functions | |
| def | __init__ |
| def | getAdditionalIndentation_ |
| def | enterFunctionLineBeforeAnnotations_ |
"Line Processor" to annotate Python functions.
| def bug_reproducer_assistant::source_code_parser::PythonAnnotateGlobalFunctionsLineProcessor::__init__ | ( | self, | |
| doAdd, | |||
| language, | |||
| myFunctionAnnotator, | |||
| originalFileName, | |||
| resultFile, | |||
| headerToInclude, | |||
| classNames, | |||
| functionNames | |||
| ) |
| self | The PythonAnnotateGlobalFunctionsLineProcessor instance to construct. |
| doAdd | If True, we're adding annotations, else we're removing them. |
| language | The program's programming language. |
| myFunctionAnnotator | Action instance that actually annotates. |
| originalFileName | File name of the original (unprocessed) file name. |
| resultFile | Result file to add the modified lines. |
| headerToInclude | Header to include. |
| classNames | Class names from the file. |
| functionNames | Function names from the file. ' Constructor. |
Reimplemented from bug_reproducer_assistant::source_code_parser::AnnotateGlobalFunctionsLineProcessor.
| def bug_reproducer_assistant::source_code_parser::PythonAnnotateGlobalFunctionsLineProcessor::enterFunctionLineBeforeAnnotations_ | ( | self | ) |
| self | The PythonAnnotateGlobalFunctionsLineProcessor instance. |
Return whether or not the "function discovery" comes before the annotations or may match. In Python, discovery line is part of the function body
Reimplemented from bug_reproducer_assistant::source_code_parser::AnnotateGlobalFunctionsLineProcessor.
| def bug_reproducer_assistant::source_code_parser::PythonAnnotateGlobalFunctionsLineProcessor::getAdditionalIndentation_ | ( | self | ) |
| self | The PythonAnnotateGlobalFunctionsLineProcessor instance. |
Get additional indentation to annotate (besides initial spaces).
Reimplemented from bug_reproducer_assistant::source_code_parser::AnnotateGlobalFunctionsLineProcessor.


The Simpsons is an American animated sitcom created by Matt Groening for the Fox Broadcasting Company. The series is a satirical depiction of working-class life, epitomized by the Simpson family, which consists of Homer, Marge, Bart, Lisa, and Maggie. The show is set in the fictional town of Springfield and parodies American culture and society, television, and the human condition.
The family was conceived by Groening shortly before a solicitation for a series of animated shorts with producer James L. Brooks. Groening created a dysfunctional family and named the characters after his own family members, substituting Bart for his own name. The shorts became a part of The Tracey Ullman Show on April 19, 1987. After three seasons, the sketch was developed into a half-hour prime time show and became Fox's first series to land in the Top 30 ratings in a season (1989–90).
Since its debut on December 17, 1989, 680 episodes of The Simpsons have been broadcast. It is the longest-running American sitcom, and the longest-running American scripted primetime television series, both in terms of seasons and number of episodes. The Simpsons Movie, a feature-length film, was released in theaters worldwide on July 27, 2007, and grossed over $527 million. Then on October 30, 2007, a video game was released. The Simpsons was renewed on February 6, 2019 for a thirty-first and thirty-second season. The former began airing September 29, 2019 and will conclude on May 17, 2020, and the latter of which will contain the 700th episode. The Simpsons is a joint production by Gracie Films and 20th Century Fox Television and syndicated by 20th Television.
The Simpsons received acclaim throughout its first nine or ten seasons, which are generally considered its "Golden Age". Time named it the 20th century's best television series,[10] and Erik Adams of The A.V. Club named it "television's crowning achievement regardless of format".[11] On January 14, 2000, the Simpson family was awarded a star on the Hollywood Walk of Fame. It has won dozens of awards since it debuted as a series, including 34 Primetime Emmy Awards, 34 Annie Awards, and a Peabody Award. Homer's exclamatory catchphrase "D'oh!" has been adopted into the English language, while The Simpsons has influenced many other later adult-oriented animated sitcoms. However, it has also been criticized for a perceived decline in quality over the years.
Lots of insight to be gained by looking at who said how much! This graph shows how many lines each of the top ten Simpsons characters said for the episode you select form the drop-down. Enjoy!
Comparison of IMDB ratings to IMDB vote count
This analysis of The Simpsons yields that there is a strong correlation between IMDB ratings and IMDB vote counts. The graph above shows the comparisons between these variables over the course of season 10. Upon futher investigation, a regression analysis of season 10 produced a r^2 value of 0.6937 while a regression analysis on the whole series produced a r^2 value of 0.7832.
The most viewed episode in Simpsons history is episode 9 in season 1 called, "Life on the fast lane". The episode originally aired on Fox on March 18, 1990 and had 33.5 million viewers. Select a season from the picklist above and see if you can find any trends in viewers throughout the many years the Simpsons has been on television.
Explore what characters are saying by entering a word or phrase in the text box and selecting a season from the dropdown menu. The horizontal axis gives the original air date for the episode, the vertical axis the episodes IMDB rating, and the radius of the marker shows how often the phrase was used in that particular episode. While it can be fun to look for certain catchphrases (see how often someone, presumably Bart, says "Eat my shorts" for example), we can also examine who different characters are talking about/to. Homer seems to be mentioned more often than any other character.


A fierce warrior of primitive background who can enter a battle rage
Hit Die: d12
Primary Ability: Strength
An inspiring magician whose power echoes the music of creation
Hit Die: d8
Primary Ability: Charisma
A priestly champion who wields divine magic in service of a higher power
Hit Die: d8
Primary Ability: Wisdom
A priest of the Old Faith, wielding the powers of nature— moonlight and plant growth, fire and lightning—and adopting animal forms
Hit Die: d8
Primary Ability: Wisdom
A master of martial combat, skilled with a variety of weapons and armor
Hit Die: d10
Primary Ability: Strength or Dexterity
A master of martial arts, skilled with fighting hands and martial monk weapons
Hit Die: d8
Primary Ability: Dexterity & Wisdom
A master of ranged combat, one with nature
Hit Die: d10
Primary Ability: Dexterity & Wisdom
A scoundrel who uses stealth and trickery to overcome obstacles and enemies
Hit Die: d8
Primary Ability: Dexterity
A spellcaster who draws on inherent magic from a gift or bloodline
Hit Die: d6
Primary Ability: Charisma
A wielder of magic that is derived from a bargain with an extraplanar entity
Hit Die: d8
Primary Ability: Charisma
A scholarly magic-user capable of manipulating the structures of reality
Hit Die: d6
Primary Ability: Intelligence


In this stage, we will add an event listener for our field cells. When you click on a free cell for the first time, add an X
symbol to the cell. The second click on another free cell should add an O
symbol. You will also need a status bar and a Reset
button. A click on the Reset
button should clear the field. These improvements can allow you to play Tic-tac-toe against your friend.
You need to add a listener for each cell of the field. When you click on a free cell, the program should add X
or O
, depending on the move. If a user clicks on an occupied cell, ignore this click.
The program should track the status of the game. If the game is over, the program should ignore further clicks. At any time, when you press the Reset
button, the program should clear the field and start a new game.
The status field should contain one of the following messages:
For testing purposes, add names for the following components:
LabelStatus
for the component that displays the game status.ButtonReset
for the reset button.The cell names should remain as in the previous stage. To display a symbol, set the button text. It must be one of the three strings:
(one space) for an empty cell, X
for the first player, and O
for the second player.
To remove the border around the text of the active cell, use the setFocusPainted(false)
method when creating a field cell component.
You can set any font, size, and color for cell symbols and any cell background. The tests only check the names of the components and their text.
Example 1: Before the game
Example 2: Game in progress
Example 3: X wins


Vitex agnus-castus
Liquid Chaste Berry
Active Ingredients:
Chasteberries [Vitex agnus-castus] 15mg per ml
Inactive Ingredients:
Acetic acid glacial and Propionic acid [organic preservatives[Salt,Water
Evitex contains NO animal parts or residues
Imported to the USA by :
Emerald Valley Natural Health Inc, Exeter, NH 03833
Batch No : 94429
Use by Date : 03/12/11
Evitex is manufactured in the UK by
SCA Nutec [Provimi Ltd]
Nutec Mill, Eastern Avenue
Lichfield, Staffordshire, WS13 7SE, UK
Exported by :
Equiglobal Ltd
Manningtree, Essex, CO11 1UT, UK
20 Litres/5.283 gallons [US]


Registered successfully. Check your email to verify your account!
Please check your email to reset your password!
Your password changed successfully!
{{vm.loginError}}
{{vm.registerError}}
{{vm.resetError}}
{{vm.resetPasswordError}}


Conceptual Background
Historical Background
Economic Background
Predecessor Concepts
Coding Examples
(if applicable)
Math Examples
(if applicable)
M
1
IC = - instr
CPI = - cyc/instr
Clock = - GHz
Performance Calculation for M
1
Time
=
IC
x
CPI
x
Clock Period
=
=


Want to challenge your friends with your predictions?
Make predictions for the driver and constructor in every race of the season.
Rules
You may change the top driver and constructor upto 3 times in the season.
If you change your top driver and/or constructor, the score from your prediction
will be updated only from the next race i.e your scores will not be updated
retrospectively.
The user who correctly selects the driver and constructor with maximum points
in a race wins the prediction. In the event of a tie, a user will be
picked randomly and declared the winner.
The results for a race will be declared after the publication of the official
timing sheet by FIA.
The user who scores the highest number of points from his top driver and
constructor will win the season. In the event of a tie, the user with least
number of prediction changes wins. If there is a tie based on this
condition too, a user will be selected randomly and declared a winner.
The results for the top driver and constructor will be declared after the
culmination of the F1 season.
{% if request.user.is_anonymous %}
Register to get started or Login to change your predictions


Home
Menu
Music
Jobs
Coffee at JavaJam
Just Java
Regular house blend, decaffeinated coffee, or flavor of the day.
Endless Cup $2.00
Cafe au Lait
House blended coffee infused into a smooth, steamed milk.
Single: $2.00
Double: $3.00
Iced Cappucino
Sweetened espresso blended with icy-cold milk and served in a chilled glass.
Single: $4.75
Double: $5.75
Total:


That man is a genius
Today's most popular posts.

Worth the read...
What you find when cutting that last corn !
VARIED PERSPECTIVES ARE ESSENTIAL TO CONSTRUCTIVE DIALOGUE!
The way the water moves around!!!
The Side-Eye Chloe girl knows that she's an internet meme
Okay, this was friggin' adorable.
How to set the mood
I have to go..
Uh oh.
When you're pretty, you're pretty.
sudo dump tech memes
crush
I did a thing.
Dog Meme Dump
Green Tree Python drinking droplets from her body, then from a bowl and blowing a cute nose bubble
How to get rid of bears 101
Ferret shows off babies to human.
His lordship...
I don't see how it's the websites fault what the users do with it
Heartwarming moment when a school teacher helps a student overcome his stammer.
The most fabulous catch in baseball history
Ready Up!

Snaggletooth activation spot discovered
In wake of the new break
Three cheers for Tommy & Chucky!
Another yet again phone clearing dump pt 3
When you're on a United flight today and someone says the plane is starting to look a bit full.
Working out those quads.
Siege Warfare according to Bollywood.
Scientists doomed to hell!
His condition is contagious!!
Friend is having a Mexican themed party... I've made them all think I'm going in a red dress
It's a new day, have some more funny/weird anime gifs.

Mini Wacky
This is why HOCKEY IS AWESOME! One of MANY touching tributes!
Doom
Which do you find most attractive? Maybe a parasite decided...
Always been a fan of Legend of Zelda
Best friends don't care what you do, as long as you do it together.
Ryan Reynolds Meme
Always Sunny
April gets some advice from Leslie.
Doctor stories
This guy gets it
Guy hatches a quail egg from the supermarket
Mens best friend
Efficient way to shell corn
that'd be the day
In Canada, baby walkers with wheels are illegal. So you improvise.
Cowboy Bebop dump
Hey, Abbott!


Represents the content of a Roblox instance.
The Instance type represents the content of a Roblox instance. It provides a similar API to that of Roblox.
See the Instances section for details on the implementation of Instances.
Creates a new Instance.
The new constructor returns a new Instance of the given class. className sets the ClassName property of the instance. If parent is specified, it sets the Parent property.
If desc is specified, then it sets the sym.Desc member. Additionally, new will throw an error if the class does not exist. If no descriptor is specified, then any class name will be accepted.
If className is "DataModel", then parent must be nil.
The class of the instance.
The ClassName property gets or sets the class of the instance.
ClassName can be modified, except when the class is "DataModel". Changing the class of an instance has no additional effects; properties are not transformed to conform to any descriptors of the class.
A name identifying the instance.
The Name property gets or sets a name identifying the instance.
The parent instance.
The Parent property gets or sets the parent of the instance, which may be nil.
The AttrConfig used by the instance.
The AttrConfig symbol is the AttrConfig being used by the instance. AttrConfig is inherited, the behavior of which is described in the Value inheritance section.
The descriptor used by the instance.
The Desc symbol is the descriptor being used by the instance. Desc is inherited, the behavior of which is described in the Value inheritance section.
Whether the instance is a service.
The IsService symbol indicates whether the instance is a service, such as Workspace or Lighting. This is used by some formats to determine how to encode and decode the instance.
Gets metadata of the DataModel.
This member only exists if the instance is of class DataModel.
The Metadata symbol gets or sets the metadata associated with the DataModel. This metadata is used by certain formats (e.g. ExplicitAutoJoints).
All properties of the instance.
The Properties symbol gets or sets all properties of the instance. Each entry in the table is a property name mapped to the value of the property.
When getting, properties that would produce an error are ignored.
When setting, properties in the instance that are not in the table are removed. If any property could not be set, then an error is thrown, and no properties are set or removed.
The direct AttrConfig of the instance.
The RawAttrConfig symbol is the raw member corresponding to to sym.AttrConfig. It is similar to AttrConfig, except that it considers only the direct value of the current instance. The exact behavior of RawAttrConfig is described in the Value inheritance section.
The direct descriptor of the instance.
The RawDesc symbol is the raw member corresponding to to sym.Desc. It is similar to Desc, except that it considers only the direct value of the current instance. The exact behavior of RawDesc is described in the Value inheritance section.
A reference to the instance.
The Reference symbol is a string used to refer to the instance from within an instance tree. Certain formats use this to encode a reference to an instance. For example, the RBXMX format will generate random UUIDs for its references (e.g. "RBX8B658F72923F487FAE2F7437482EF16D").
A reference should not be expected to persist when being encoded or decoded.
Remove each child of the instance.
The ClearAllChildren method sets the Parent of each child of the instance to nil.
Unlike in Roblox, ClearAllChildren does not affect descendants.
Creates a copy of the instance.
The Clone method returns a copy of the instance.
Unlike in Roblox, Clone does not ignore an instance if its Archivable property is set to false.
Gets a descendant by name.
The Descend method returns a descendant of the instance by recursively searching for each name in succession according to FindFirstChild. Returns nil if a child could not be found. Throws an error if no arguments are given.
Descend provides a safe alternative to indexing the children of an instance, which is not implemented by rbxmk.
local face = game:Descend("Workspace", "Noob", "Head", "face")
Removes an instance.
The Destroy method sets the Parent of the instance to nil.
Unlike in Roblox, the Parent of the instance remains unlocked. Destroy also does not affect descendants.
Gets an ancestor by name.
The FindFirstAncestor method returns the first ancestor whose Name equals name, or nil if no such instance was found.
Gets an ancestor by class name.
The FindFirstAncestorOfClass method returns the first ancestor of the instance whose ClassName equals className, or nil if no such instance was found.
Gets an ancestor by inherited class name.
The FindFirstAncestorWhichIsA method returns the first ancestor of the instance whose ClassName inherits className according to the instance's descriptor, or nil if no such instance was found. If the instance has no descriptor, then the ClassName is compared directly.
Gets a child by name.
The FindFirstChild method returns the first child of the instance whose Name equals name, or nil if no such instance was found. If recurse is true, then descendants are also searched, top-down.
Gets a child by class name.
The FindFirstChildOfClass method returns the first child of the instance whose ClassName equals className, or nil if no such instance was found. If recurse is true, then descendants are also searched, top-down.
Gets a child by inherited class name.
The FindFirstChildWhichIsA method returns the first child of the instance whose ClassName inherits className, or nil if no such instance was found. If the instance has no descriptor, then the ClassName is compared directly. If recurse is true, then descendants are also searched, top-down.
Gets an attribute.
The GetAttribute method returns the value of attribute, or nil if the attribute is not found.
This function uses the instance's sym.AttrConfig to select the property to decode from, which is expected to be string-like. An error is thrown if the data could not be decoded.
See the rbxattr format for a list of possible attribute value types.
The Attributes section provides a more general description of attributes.
Gets all attributes.
The GetAttributes method returns a dictionary of attribute names mapped to values.
This function uses the instance's sym.AttrConfig to select the property to decode from, which is expected to be string-like. An error is thrown if the data could not be decoded.
See the rbxattr format for a list of possible attribute value types.
The Attributes section provides a more general description of attributes.
Gets the children.
The GetChildren method returns a list of children of the instance.
Gets all descendants.
The GetDescendants method returns a list of descendants of the instance.
Gets a name according to the ancestors of the instance.
The GetFullName method returns the concatenation of the Name of each ancestor of the instance and the
instance itself, separated by .
characters. If an ancestor is a
DataModel, it is not included.
Gets a service instance from the tree.
This member only exists if the instance is of class DataModel.
The GetService method returns the first child of the DataModel whose ClassName equals className. If no such child exists, then a new instance of className is created. The Name of the instance is set to className, sym.IsService is set to true, and Parent is set to the DataModel.
If the DataModel has a descriptor, then GetService will throw an error if the created class's descriptor does not have the "Service" tag set.
Gets whether the class inherits from a given class name.
The IsA method returns whether the ClassName inherits from className, according to the instance's descriptor. If the instance has no descriptor, then IsA returns whether ClassName equals className.
Gets whether the instance is an ancestor.
The IsAncestorOf method returns whether the instance of an ancestor of descendant.
Gets whether the instance is an descendant.
The IsDescendantOf method returns whether the instance of a descendant of ancestor.
Sets an attribute.
The SetAttribute method sets attribute to value. If value is nil, then the attribute is removed.
This function uses the instance's sym.AttrConfig to select the property to decode from, which is expected to be string-like. This function decodes the serialized attributes, sets the given value, then re-encodes the attributes. An error is thrown if the data could not be decoded or encoded.
See the rbxattr format for a list of possible attribute value types.
The Attributes section provides a more general description of attributes.
Sets all attributes.
The SetAttributes method replaces all attributes with the content of attributes, which contains attribute names mapped to values.
This function uses the instance's sym.AttrConfig to select the property to encode to. An error is thrown if the data could not be encoded.
See the rbxattr format for a list of possible attribute value types.
The Attributes section provides a more general description of attributes.
Gets a property.
The index operator gets the value of a property of the instance. If the instance has a descriptor, then the the properties are enforced by the descriptor. Otherwise, any property can be any type of value.
Sets a property.
The newindex operator sets the value of a property of the instance. If the instance has a descriptor, then the the properties are enforced by the descriptor. Otherwise, any property can be set to any value.


|
Smart Spend
|
Functions | |
| def | formatResult (website, titles, prices, links) |
| def | formatSearchQuery (query) |
| def | formatTitle (title) |
| def | getNumbers (st) |
| def | sortList (arr, sortBy, reverse) |
| def formatResult | ( | website, | |
| titles, | |||
| prices, | |||
| links | |||
| ) |
The formatResult function takes the scraped HTML as input, and extracts the necessary values from the HTML code. Ex. extracting a price '$19.99' from a paragraph tag.
| def formatSearchQuery | ( | query | ) |
The formatSearchQuery function formats the search string into a string that can be sent as a url paramenter.
| def formatTitle | ( | title | ) |
The formatTitle function formats titles extracted from the scraped HTML code.
| def getNumbers | ( | st | ) |
The getNumbers function extracts float values (price) from a string. Ex. it extracts 10.99 from '$10.99' or 'starting at $10.99'
| def sortList | ( | arr, | |
| sortBy, | |||
| reverse | |||
| ) |
The sortList function is used to sort the products list based on the flags provided as args. Currently, it supports sorting by price.


{{ 123.456789|number:2 }}
is now {{123.456789|number:2}}
{{ 123 | currency }}
is now {{ 123 | currency }}
{{ today | date:'medium' }}
{{today|date:'short'}}
{{ today | date:'fullDate' }}
{{ today | date:'longDate' }}
{{today|date:'mediumDate'}}
{{ today | date:'shortDate' }}
{{today|date:'mediumTime'}}
{{ today | date:'shortTime' }}
where today is defined as<PHONE_NUMBER>006 inside the app.js under the FiltersController
is now
{{ today | date:'medium' }}
{{ today |date:'short'}}
{{ today | date:'fullDate' }}
{{ today | date:'longDate' }}
{{today|date:'mediumDate'}}
{{ today | date:'shortDate' }}
{{today|date:'mediumTime'}}
{{ today | date:'shortTime' }}
{{ 123.456789|number:2 }}<!--Displays:123.46-->;
is now {{123.456789|number:2}}
{{ 123.456789|number:2 }}<!--Displays:123.46-->;
is now {{123.456789|number:2}}


| Sunday, June 23rd |
| 11:30 AM |
Preshow |
Tech Crew |
0:10:00 |
| 0:20:00 |
Fun — |
|
| 12:00 PM |
Spyro Reignited Trilogy: Spyro the Dragon |
ChrisLBC |
0:10:00 |
| 1:00:00 |
Any% — |
|
| 1:10 PM |
Portal 2 |
Can't Even |
0:10:00 |
| 1:15:00 |
Single Player - No SLA (Inbounds) — |
|
| 2:35 PM |
Teenage Mutant Ninja Turtles III: The Manhattan Project |
PJ, Mecha Richter |
0:10:00 |
| 0:40:00 |
Any% co-op — |
|
| 3:25 PM |
Super Mario Bros. 2 |
coolkid |
0:10:00 |
| 0:25:00 |
All Stages — |
|
| 4:00 PM |
Donkey Kong Country 2: Diddy's Kong Quest |
MikeKanis |
0:10:00 |
| 0:54:00 |
Any% — |
|
| 5:04 PM |
Kirby Nightmare in Dream Land |
Mr_Shasta |
0:10:00 |
| 0:45:00 |
Any% — |
|
| 5:59 PM |
Sonic Generations |
thebluemania |
0:10:00 |
| 1:00:00 |
Any% — |
|
| 7:09 PM |
The Legend of Zelda: The Minish Cap |
quo |
0:10:00 |
| 1:55:00 |
Any% Normal — |
|
| 9:14 PM |
Devil May Cry |
Maxylobes |
0:10:00 |
| 0:57:00 |
any% — |
|
| 10:21 PM |
Streets of Rage |
cestpatou |
0:10:00 |
| 0:32:00 |
Easy% — |
|
| 11:03 PM |
Final Doom |
KingDime |
0:10:00 |
| 0:55:00 |
TNT-Evilution UV-Speed — |
|
| Monday, June 24th |
| 12:08 AM |
Outland |
Vulajin |
0:10:00 |
| 1:10:00 |
Any% — |
|
| 1:28 AM |
The Hobbit |
Chrixiam98 |
0:10:00 |
| 0:45:00 |
Any% No Menu Glitches — |
|
| 2:23 AM |
Tony Hawk's Underground 2 |
Plumato |
0:10:00 |
| 0:30:00 |
Classic Normal (All Goals) (NG+) — |
|
| 3:03 AM |
Zombies Ate My Neighbors |
teddyras |
0:10:00 |
| 0:40:00 |
Any% — |
|
| 3:53 AM |
Blaster Master |
davidtki |
0:10:00 |
| 0:32:00 |
any% (JP) — |
|
| 4:35 AM |
Solomon's Key |
metroidmcfly |
0:10:00 |
| 0:16:00 |
Any% — |
|
| 5:01 AM |
Metroid |
metroidmcfly |
0:10:00 |
| 0:15:00 |
Any% — |
|
| 5:26 AM |
Rygar |
Darkwing Duck |
0:10:00 |
| 0:25:00 |
any% No WW — |
|
| 6:01 AM |
DuckTales 2 |
swordsmankirby |
0:10:00 |
| 0:12:00 |
Any% — |
|
| 6:23 AM |
Marble Madness |
yelsraek, Elipsis |
0:10:00 |
| 0:04:00 |
Any% Co-op — |
|
| 6:37 AM |
Jackal |
RottDawg, SuperPitFro |
0:10:00 |
| 0:10:00 |
Any% 2 Player — |
|
| 6:57 AM |
Contra |
angrylanks, RottDawg |
0:10:00 |
| 0:12:00 |
Low% 2 Player — |
|
| 7:19 AM |
Contra III: The Alien Wars |
FCJ2000 |
0:10:00 |
| 0:35:00 |
any% Hard — |
|
| 8:04 AM |
Alien Soldier |
chronoon |
0:10:00 |
| 0:25:00 |
Supereasy — |
|
| 8:39 AM |
Ranger-X |
d4gr0n |
0:10:00 |
| 0:17:00 |
Easy — |
|
| 9:06 AM |
Ninja Spirit |
lattmackey |
0:10:00 |
| 0:15:00 |
Any% — |
|
| 9:31 AM |
Super Time Force Ultra |
Tohloo |
0:10:00 |
| 0:35:00 |
All Missions — |
|
| 10:16 AM |
Half-Minute Hero |
dowolf |
0:10:00 |
| 0:27:00 |
Any% Hero 30 — |
|
| 10:53 AM |
Timespinner |
RiskyCB |
0:20:00 |
| 0:28:00 |
Any% — |
|
| 11:41 AM |
Castlevania |
Komrade, freeland1787, 2snek |
0:10:00 |
| 0:16:00 |
Any % — |
|
| 12:07 PM |
Bloodstained: Curse of the Moon |
strizer86 |
0:10:00 |
| 0:38:00 |
Any% No-OOB Ultimate (Veteran) — |
|
| 12:55 PM |
Castlevania: Symphony of the Night |
Dr4gonBlitz |
0:10:00 |
| 0:36:00 |
All Bosses — |
|
| 1:41 PM |
Castlevania: Portrait of Ruin |
VB__ |
0:10:00 |
| 0:55:00 |
No OOB — |
|
| 2:46 PM |
Prey |
LifeL1ke |
0:10:00 |
| 1:18:00 |
All Main Quests — |
|
| 4:14 PM |
Titanfall 2 |
Bryonato |
0:10:00 |
| 1:32:00 |
Any% — |
|
| 5:56 PM |
Bonus Game 1 |
Tech Crew |
0:20:00 |
| 0:40:00 |
Secret Category 1 — |
|
| 6:56 PM |
Borderlands 2 |
Shockwve, TheFuncannon, Amyrlinn |
0:10:00 |
| 3:00:00 |
Coop All Quests — |
|
| 10:06 PM |
Metroid Prime |
JustinDM |
0:10:00 |
| 1:16:00 |
Any% — |
|
| 11:32 PM |
Metroid Prime 2: Echoes |
Claris |
0:10:00 |
| 1:20:00 |
Any% — |
|
| Tuesday, June 25th |
| 1:02 AM |
Uncharted: Drake's Fortune |
osskari |
0:10:00 |
| 0:49:00 |
any% PS4 No Airwalk — |
|
| 2:01 AM |
Chasm: The Rift |
tbcr |
0:10:00 |
| 0:33:00 |
any% — |
|
| 2:44 AM |
Monster Boy in the Cursed Kingdom |
tinahacks |
0:10:00 |
| 1:59:00 |
any% — |
|
| 4:53 AM |
The Textorcist |
teddyras |
0:10:00 |
| 0:35:00 |
All Bosses — |
|
| 5:38 AM |
Skylar & Plux: Adventure On Clover Island |
Cuttyflame_ |
0:10:00 |
| 0:18:00 |
any% — |
|
| 6:06 AM |
Slot Car Rivals |
Marrow |
0:15:00 |
| 0:15:00 |
All Courses (Booster) — |
|
| 6:36 AM |
Slipstream |
Konasumi, WhatIsCalvin |
0:10:00 |
| 0:20:00 |
Cannonball Max Settings Race — |
|
| 7:06 AM |
Split/Second |
ViceroyOfMonteCristo |
0:15:00 |
| 0:40:00 |
All Detonator Runs — |
|
| 8:01 AM |
Kirby Air Ride |
Pearstrike, 1davidj |
0:10:00 |
| 0:23:00 |
All Tracks No Duplicate Rides — |
|
| 8:34 AM |
Kirby 64: The Crystal Shards |
swordsmankirby |
0:10:00 |
| 1:16:00 |
100% — |
|
| 10:00 AM |
Ape Escape |
Hornlitz |
0:20:00 |
| 0:50:00 |
Any% — |
|
| 11:10 AM |
Crash Bandicoot: N. Sane Trilogy |
JHobz, CameronVengenz, Murcaz |
0:10:00 |
| 0:59:00 |
Crash Bandicoot 3:Warped Any% — |
|
| 12:19 PM |
Punch-Out!! (Arcade) |
zallard1 |
0:10:00 |
| 0:25:00 |
any% 1st loop — |
|
| 12:54 PM |
Punch-Out!! (Wii) |
zallard1 |
0:10:00 |
| 1:35:00 |
Contender & Title Defense (1st & 2nd loops) — |
|
| 2:39 PM |
Pokemon Crystal |
Keizaron |
0:18:00 |
| 3:55:00 |
Any% Glitchless — |
|
| 6:52 PM |
The Legend of Zelda Randomizer |
JamEvil, fcoughlin |
0:10:00 |
| 0:59:00 |
Race (LITE Flagset) — |
|
| 8:01 PM |
Bonus Game 2 |
Tech Crew |
0:15:00 |
| 0:43:00 |
Secret Category 2 — |
|
| 8:59 PM |
Super Mario Sunshine |
Jcool114, Kwaniza |
0:10:00 |
| 1:25:00 |
Any% Race — |
|
| 10:34 PM |
Resident Evil 2 (2019) |
Bawkbasoup |
0:10:00 |
| 1:08:00 |
Claire A vs Leon A — |
|
| 11:52 PM |
Silent Hill 3 |
Punchy |
0:12:00 |
| 0:30:00 |
UFO Ending — |
|
| Wednesday, June 26th |
| 12:34 AM |
Sonic Adventure DX: Director's Cut |
JerKro, Allegro |
0:15:00 |
| 0:10:00 |
Big the Cat (2P/1C) — |
|
| 12:59 AM |
Divekick |
RagingCherry, ESAM |
0:10:00 |
| 0:20:00 |
Story Mode All Levels Race - Damn Tough Difficulty — |
|
| 1:29 AM |
We Love Katamari |
GarbitheGlitcheress |
0:10:00 |
| 1:09:00 |
any% — |
|
| 2:48 AM |
Shrek Extra Large |
Silo_Simon |
0:10:00 |
| 0:29:00 |
No Levels Early — |
|
| 3:27 AM |
Mort the Chicken |
Joester98 |
0:10:00 |
| 0:25:00 |
Any% — |
|
| 4:02 AM |
Catlateral Damage |
Bullets |
0:10:00 |
| 0:13:00 |
Any% — |
|
| 4:25 AM |
Hylics |
TheFlyingMarlin |
0:10:00 |
| 0:26:00 |
Any% — |
|
| 5:01 AM |
Laffy Taffy 3D Pyramid Challenge |
Zikubi |
0:10:00 |
| 0:14:00 |
Any% No Passwords — |
|
| 5:25 AM |
Glover |
yoshipro |
0:10:00 |
| 0:32:00 |
All Main Levels — |
|
| 6:07 AM |
Castlevania (DOS) |
LoZCardsfan23 |
0:10:00 |
| 0:15:00 |
Any% — |
|
| 6:32 AM |
Last Action Hero |
SuperPitFro |
0:15:00 |
| 0:11:00 |
any% — |
|
| 6:58 AM |
Splatterhouse: Wanpaku Graffiti |
StormCrow56k, BesTickles |
0:10:00 |
| 0:20:00 |
Any% True Ending Race — |
|
| 7:28 AM |
Sylvester and Tweety in Cagey Capers |
Ritz Blues |
0:10:00 |
| 0:20:00 |
100% Difficulty — |
|
| 7:58 AM |
Boogerman: A Pick and Flick Adventure |
mrmaximus11 |
0:10:00 |
| 0:30:00 |
Any% No Item Use — |
|
| 8:38 AM |
T.R.A.G. |
CavemanDCJ |
0:10:00 |
| 0:56:00 |
any% — |
|
| 9:44 AM |
Clustertruck |
ConnorAce |
0:10:00 |
| 0:27:00 |
noAbility% — |
|
| 10:21 AM |
Nex Machina |
ProtoPip |
0:10:00 |
| 0:28:00 |
Rookie Any% — |
|
| 10:59 AM |
Furi |
Dircashede |
0:10:00 |
| 0:35:00 |
Speedrun Mode (Furi Difficulty) — |
|
| 11:44 AM |
Nuclear Throne |
fishmcmuffins |
0:10:00 |
| 0:35:00 |
All Bosses — |
|
| 12:29 PM |
Mega Man X2 |
Trogdor |
0:15:00 |
| 1:10:00 |
low% — |
|
| 1:54 PM |
Command & Conquer: Red Alert 3 |
Raelcun, CovertMuffin |
0:10:00 |
| 1:40:00 |
Soviet Campaign Hard Mode Co-op — |
|
| 3:44 PM |
Bonus Game 3 |
Tech Crew |
0:12:00 |
| 1:00:00 |
Secret Category 3 — |
|
| 4:56 PM |
The Legend of Zelda: A Link Between Worlds |
TheLegendofZaheer |
0:10:00 |
| 3:15:00 |
100% — |
|
| 8:21 PM |
Dark Souls II |
Distortion2 |
0:10:00 |
| 2:35:00 |
All Bosses (/w DLC) — |
|
| 11:06 PM |
Dead Rising |
DrunkWario |
0:10:00 |
| 0:25:00 |
Overtime Mode (New Game / Low%) — |
|
| 11:41 PM |
Remnants of Naezith |
XepiccatX |
0:10:00 |
| 0:30:00 |
All Chapters — |
|
| Thursday, June 27th |
| 12:21 AM |
Super Benbo Quest: Turbo Deluxe |
Marrow |
0:10:00 |
| 0:35:00 |
Any% — |
|
| 1:06 AM |
Looney Tunes |
WinnerBit |
0:10:00 |
| 0:15:00 |
All Levels — |
|
| 1:31 AM |
Rhino Rumble |
WinnerBit |
0:10:00 |
| 0:16:00 |
Any% — |
|
| 1:57 AM |
Jumper: Griffin's Story |
Silo_Simon |
0:10:00 |
| 0:22:00 |
Any% — |
|
| 2:29 AM |
Aero the Acro-Bat 2 |
Thu Ox |
0:10:00 |
| 0:40:00 |
Any% — |
|
| 3:19 AM |
Super Bomberman 2 |
Iceplug |
0:10:00 |
| 0:35:00 |
Any% — |
|
| 4:04 AM |
Bomberman 64: The Second Attack |
LivelyRaccoon |
0:15:00 |
| 0:50:00 |
Any% — |
|
| 5:09 AM |
Gauntlet |
digshake, Eunos |
0:10:00 |
| 0:22:00 |
any% race — |
|
| 5:41 AM |
Chip 'N Dale: Rescue Rangers |
sinister1, GeneralAndrews |
0:10:00 |
| 0:12:00 |
any% co-op — |
|
| 6:03 AM |
Teenage Mutant Ninja Turtles IV: Turtles In Time |
GeneralAndrews, Dospostmann |
0:10:00 |
| 0:25:00 |
any% co-op — |
|
| 6:38 AM |
Ristar |
Chubbus |
0:10:00 |
| 0:39:00 |
100% — |
|
| 7:27 AM |
Sonic 3D Blast |
KingRhodesTn |
0:10:00 |
| 0:30:00 |
Any% Bad Ending — |
|
| 8:07 AM |
Sonic CD 2011 |
chronoon |
0:10:00 |
| 0:21:00 |
Sonic: Beat the Game — |
|
| 8:38 AM |
Cave Story |
Shadax |
0:10:00 |
| 1:05:00 |
Best Ending — |
|
| 9:53 AM |
Koumajou Densetsu II: Yougen no Chingonka |
Shadax |
0:10:00 |
| 0:20:00 |
Hard — |
|
| 10:23 AM |
Fire Emblem Fates |
Kirbymastah |
0:10:00 |
| 1:00:00 |
Revelation/Birthright/Conquest (Normal/Classic) — |
|
| 11:33 AM |
Kingdom Hearts III |
mistmaster1, CrispyMe, ninten866 |
0:15:00 |
| 3:40:00 |
Any% (Beginner) Co-op Relay — |
|
| 3:28 PM |
Banjo-Kazooie |
Hagginater, DHK |
0:20:00 |
| 2:10:00 |
100% — |
|
| 5:58 PM |
Invictus |
Dode |
0:10:00 |
| 0:50:00 |
any% — |
|
| 6:58 PM |
Grand Poo World 2 |
mitchflowerpower |
0:20:00 |
| 1:25:00 |
Any% Good Ending — |
|
| 8:43 PM |
Bonus Game 4 |
Tech Crew |
0:25:00 |
| 0:50:00 |
Secret Category 4 — |
|
| 9:58 PM |
Super Mario World |
grandpoobear, PangaeaPanga, GlitchCat7, Dode, Barbarian, NobleTOFU, juzcook, LaserBelch |
0:15:00 |
| 1:15:00 |
Blind Relay Race — |
|
| 11:28 PM |
Mario Kart: Double Dash!! |
OptimisticEmo, Goomba |
0:10:00 |
| 0:36:00 |
All 4 Cups Race — |
|
| Friday, June 28th |
| 12:14 AM |
Super Mario Galaxy 2 |
SuperViperT302 |
0:10:00 |
| 3:21:00 |
Any% — |
|
| 3:45 AM |
Pac-Man World |
Joester98 |
0:10:00 |
| 0:35:00 |
Any% — |
|
| 4:30 AM |
Sly Cooper and the Thievius Raccoonus |
Zenthrow |
0:10:00 |
| 1:15:00 |
Any% — |
|
| 5:55 AM |
Star Fox 64 |
LylatR |
0:10:00 |
| 0:38:00 |
Red Line All Medals — |
|
| 6:43 AM |
Diablo 2: Lord Of Destruction |
MrLlamaSC |
0:10:00 |
| 2:20:00 |
Necromancer or Paladin Any% Normal — |
|
| 9:13 AM |
Quake |
alexh0w |
0:15:00 |
| 0:20:00 |
Easy Run — |
|
| 9:48 AM |
Half-Life |
alexh0w, Msushi |
0:10:00 |
| 0:35:00 |
any% — |
|
| 10:33 AM |
Half-Life 2 |
waezone |
0:10:00 |
| 1:15:00 |
New Engine, Inbounds — |
|
| 11:58 AM |
Minecraft |
illumina1337 |
0:10:00 |
| 1:25:00 |
Any% Random Seed Glitchless — |
|
| 1:33 PM |
Octopath Traveler |
altabiscuit, Archariat, Ouro, mamgar |
0:10:00 |
| 1:25:00 |
Single Story Bidwar — |
|
| 3:08 PM |
Rockman 4 Minus Infinity |
Kuumba |
0:10:00 |
| 0:48:00 |
Any% — |
|
| 4:06 PM |
Mega Man 3 |
ColonelFatso |
0:15:00 |
| 0:39:00 |
any% — |
|
| 5:00 PM |
Mega Man 11 |
fastatcc, Qttsix |
0:10:00 |
| 0:45:00 |
Any% Normal No OoB Race — |
|
| 5:55 PM |
Tetris Effect |
HardDrop |
0:15:00 |
| 0:40:00 |
Journey Mode (Expert) — |
|
| 6:50 PM |
TASBot plays Tetris |
dwangoAC |
0:10:00 |
| 0:10:00 |
Mode B, playaround, fastest 999999 by Baxter — |
|
| 7:10 PM |
TASBot plays Mario Kart Wii |
dwangoAC |
0:15:00 |
| 0:16:00 |
8 Tracks (IGT: ~10 minutes) — |
|
| 7:41 PM |
Bonus Game 5 |
Tech Crew |
0:10:00 |
| 0:45:00 |
Secret Category 5 — |
|
| 8:36 PM |
Dark Souls |
catalystz |
0:10:00 |
| 1:35:00 |
All Bosses — |
|
| 10:21 PM |
The Legend of Zelda: Breath of the Wild |
Wolhaiksong |
0:10:00 |
| 0:35:00 |
Any% (No Amiibo) — |
|
| 11:06 PM |
The Legend of Zelda: Majora's Mask |
MajinPhil |
0:10:00 |
| 5:15:00 |
100% — |
|
| Saturday, June 29th |
| 4:31 AM |
Metal Slug X |
sukimos |
0:10:00 |
| 0:25:00 |
any% — |
|
| 5:06 AM |
Metal Slug 3 |
sukimos |
0:10:00 |
| 0:35:00 |
any% — |
|
| 5:51 AM |
Cannon Spike |
Aquas |
0:10:00 |
| 0:10:00 |
Any% — |
|
| 6:11 AM |
Lara Croft Tomb Raider: Legend |
SmoothOperative |
0:10:00 |
| 0:55:00 |
Any% No Bug Jump — |
|
| 7:16 AM |
Transistor |
fhnnhf |
0:10:00 |
| 0:57:00 |
Low% — |
|
| 8:23 AM |
The Elder Scrolls V: Skyrim |
Chronos_R |
0:10:00 |
| 0:45:00 |
Main Quest — |
|
| 9:18 AM |
Pokemon Let's Go, Pikachu/Eevee! |
eddaket |
0:20:00 |
| 3:27:00 |
Any% — |
|
| 1:05 PM |
Super Mario World |
truman, TNT, Seathorne |
0:10:00 |
| 1:30:00 |
96 Exit — |
|
| 2:45 PM |
Bonus Game 6 |
Tech Crew |
0:15:00 |
| 0:23:00 |
Secret Category 6 — |
|
| 3:23 PM |
Link to the Past + Super Metroid Combo Randomizer |
Andy, Ivan |
0:10:00 |
| 3:00:00 |
Co-op Beat the games — |
|
| 6:33 PM |
Chrono Trigger |
puwexil |
0:10:00 |
| 6:10:00 |
Glitchless Any% — |
|
| Sunday, June 30th |
| 12:53 AM |
Finale |
Tech Crew |
0:10:00 |
| 0:10:00 |
The End — |
|


Welcome future Vigilante!
We would like you to join us in keeping our city safe.
To apply, enter here