What are three new things you have learned about yourself and your ego as a result of the core learning?
When I initially started foundation I wasn't as aware of neuroplasticity and how amazing our brains truly are, so this
is probably the most interesting part of the core content. Also the fixed vs. growth mindset, definitely opened my eyes in relation
to which mindset I am in myself and how to maybe change that (or try to).
Generally a lot of the content I have touched base on in the past, but feel my knowledge in relation to Mindfullness has expanded.
What are three new things you have learned about yourself and your ego as a result of the core learning?
I have always been quite self-aware, so a lot of the core content were only enforcing what I already knew. However, neuroplasticity
and trying to implement these techniques into my learning has broaden the way I learn and certainly taught me a lot. I have always
struggled with my self-conscious and are generally not very confident, which I definitely feel the core content has challenged.
I also feel that I have had to come to terms with my own stubborness when it comes to asking for help, and my communication skills can
and should improve - I feel I might have been stuck (and still am a bit) in a fixed mindset, rather than a growth mindset also.
What are the role of values, empathy and self awareness in learning and programming?
I think if you're more self-aware of how you learn and honest in relation to how you work, it is also easier to improve. This does not only refer to programming, but life as a whole.
What has surprised you the most about the core learning?
The neuroplasticity side of things when I was watching the YouTube videos, explaining how someone are able to increase their muscle mass by thought, or how just thinking about what you have been learning during that day can benefit you.
What were the most challenging aspects of the core learning?
For me it was probably the looping and listening exercises. Being an introvert and very self-conscious it's extremely hard for me to think of what I would like to say, but also the thought of maybe not understanding the other person (since english is my second language too!)
Why do you think we, a programming school, are spending so much time focusing on core learning in a web development bootcamp course?
You are trying to make as valuable members of a team and not just knowledgable coders. Programming comes with experience, but the core skills can be what makes a difference during a job interview.
Does the time you spent studying core learning here feel like a waste of time? Should you have just used that time to practicing programming instead? Justify your answer.
I don't feel it is a waste of time, but I do feel something like the looping and listening skills are easier in the classroom
or pair programming (even though I haven't done this part just yet). Mindfullness and finding a balance has always been important to me,
especially since I have been through a lot of stress in my life and got a condition which easily puts me in flight-or-fight mode.
Learned quite a fair bit about growth vs. fixed mindset and how absolutely amazing our brains are if we take advantage of our
neuroplasticity.
Expectations for Bootcamp...
Despite the last two sprint having been quite challenges (and as I am writing this I still got work to do!), I am really excited for bootcamp.
I have always wanted to do web development and programming, and have had hands on with some when I was younger and taken short courses.
A part of me would love to have my own web development business and be my own boss, being able to go wherever I like in the world
and spending more time with my family in Denmark and my puppy.
I have been struggling quite a fair bit with some of the JavaScript. I am the type of person who truly want to know how each little component
of my code works together, which might be a strength and downfall at the same time? I don't feel I necessarily get that from finding code online.
I am quite stubborn and do find it hard to ask for help, especially during foundation when I know our facilitors are busy.
Pair programming and looping exercises might be the areas I will struggle more with being an introvert as mentioned earlier,
and having a condition there often gives me "brain fog" I really need to be obs on making notes of our learning, so I can review again later.
This is actually also one of the reasons I like the idea of programming, since it's not the end of the world if I can't remember a particular function,
it's available online and other programmers got a lot of the same struggles (maybe to a less or more degree, we can't all be super(wo)man!)
I would love to gain more confidence when it comes to pair programming and grouping exercises - don't get me wrong, I am absolutely capable
of taking ownership and lead a group (I have done this many times in the past!), but if it's something I am unsure of - I very easily get lost in the group.
I am very self-conscious and the thought of doing e.g. pair programming is kinda scary and I feel like panicking (to be honest).
I think once I am at bootcamp and we have more day-to-day interaction with the teachers and getting to know everyone, it will also be a lot
easier for me to ask for help. While I do want to solve the problem myself, I am don't want to push it so far I am loosing out either.
Having to find that healthy middle ground is probably going to be the biggest challenge! I would say, I am lucky because I got someone
close to me who is a senior and worked in the field for quite some time. Having him next to me to fully explain the code and notch me in
the right direction has really been a saint!


%inherit file="/layout/message.html" /> <%! title = 'Job Reset' %> <%def name="header()">
This form cancels all jobs accessible to the current user.
% if len(jobs_cancelled) > 0:The following jobs were canceled:
DONE!
Back % elif method == 'POST':No jobs to cancel.
DONE!
% endif % else:Invalid permissions to reset jobs
You need to be user 'admin' and in DEBUG mode in order to reset jobs.
% endif


Jen Andrella is a Ph.D. candidate in the Department of History at Michigan State University. She is a digital humanist with an emphasis on the nineteenth-century American West, Native American ethnohistory, and the Civil War and Reconstruction. Her dissertation, “When the War Raged On: Montana Territory, the Politics of Authority, and National Reconstruction, 1860-1900,” examines the process of Recnstruction from the historical vantage point of the Northernwestern Great Plains. Through an analysis of cartography, personal and mass communication, artwork, literature, and government records, the work explores how Reconstruction was a national spatial transformation that experimented with local and federal authority, settler colonialism, and state formation in the West.
At Michigan State, Jen served five years as an assistant in the Lab for the Education and Advancement of Digital Research (LEADR) where she developed digital project lesson plans on narrative mapping, data mapping, content management systems, and data visualizations. From 2019-2020, she was a member on the faculty advisory board for Michigan State library’s Digital Scholarship Lab (DSL) and was a selected fellow for the Cultural Heritage Informatics (CHI) initiative. She is currently pursuing the graduate certificate in digital humanities in addition to her Ph.D.
For more information about Jen Andrella and her work, please visit www.jenniferandrella.com. To contact, please email<EMAIL_ADDRESS>Michigan State University occupies the ancestral, traditional, and contemporary Lands of the Anishinaabeg–Three Fires Confederacy of Ojibwe, Odawa, and Potawatomi peoples. The University resides on Land ceded in the 1819 Treaty of Saginaw.


This is an extension of the TimePicker component present in fundamental-ngx/core.
Platform TimePicker component implements the FormFieldControl interface, and thus can be used within the FormField component.


45
synths
110
followers
322
following
Cryptocurrencies including Ethereum, Ripple, and Litecoin have all plunged between 20 to 30 percent each, according to CoinMarketCap. Here is the latest Ripple price news and live updates on XRP, bitcoin and Ethereum.
Report User
Block User
Public
Private
New air routes that promise cheap flights in
New air routes that promise cheap flights in
Shared to
#discussionaboutanimgttdddasdasdasdasdasdasdassadsNew air routes that promise cheap flights in
Shared via weblink


Laser Schools Study App
This is an early version. Send bugs and suggestions to Paul
Shannon.
- the network is initially displayed with a poor layout
- find the “Layout” menu on the left sidebar, choose “Custom”
- We can refine this layout further as you wish,.
- Practice with your mouse (with shift and control keys) to learn all the manipulations provided: pan, zoom, select one node, select many nodes.
- Experiment with all the buttons shown above: Fit, Fit Selected, ...
- I used your data to experiment with a promising 3D interactive display, seen in the other tab in the app. Not much nuance yet, but the extra dimensions makes large graphs more navigable.


There was an error loading your spots.
You have not yet registered any spots.
{{spot.description}}
Delete


|
Faith HealingThe power of Christ compels you... to feel better!Faith healing is best defined as "that which remains after one strips away every vestige of medicine." Alternative medicine is a really big field, and the label includes a lot of practices that range from the relatively sound notions of Acupuncture to the ancient but unsound practice of Trepanation, from the "sounds good even if it doesn't work" notions of Homeopathy to the fanciful stylings of Reichian therapy. However, faith healing is not part of the rich, occasionally brilliant and often suicidal panoply of alternative medicine concepts. It is the antithesis of anything that calls itself medicine. The one thing that every practice cited above has in common is that they are based on some basic attempt to reasonably interpret how the body works. Some of those practices are ineffective because they're based on outdated or even wrong-headed notions about how the body works, but they're all attempts to work within the normal bounds of cause and effect. Faith healing is the exact opposite. Faith healing dismisses all notions of learning, science and even psuedoscience in favor of the blind, unquestioning "faith" from whence the name is derived.  Faith healing is a mostly Christian phenomenon. Other spiritual paths do claim to offer assistance to physical health, but usually within the boundaries outlined above. Jewish tradition around the time of Christ included a strong movement toward alternative medicine. In fact, Jesus Christ and John the Baptist are thought by scholars to have been associated with a Jewish healing cult known as the Essenes (which practiced a mostly herbal type of pharmaceutical medicine). Over the first several centuries of Christianity, the canon gospels were heavily redacted by the clerical authorities, who wished to squelch very specific sorts of claims by their theological competitors — especially anything that had to do with secret teachings, rituals or practices. The tales of Jesus' healing, whatever their origins, therefore devolved into the most simplistic sort of miracle-working.  Saints and apostles inherited this ability which was said to be powered solely by pure belief. Don't ask questions, just be grateful. Any healing practice which had any basis other than blind faith in Jesus was marginalized and eventually criminalized. Although the modern practice of faith healing is an outgrowth of these early doctrinal excesses by the Roman Catholic Church, the Catholics long ago abandoned any meaningful practice of faith healing. The major participants in faith healing today are evangelical Protestant sects, cult-like Luddite groups and the inexplicably named Christian Scientists. The basic format for faith healing is extremely simple, but the particulars are not rigorously enforced (because that would be Witchcraft). Usually, the healer is some sort of clerical authority figure, a pastor, priest, minister or other "officially authorized" Man of God, such as Jerry Falwell or Pat Robertson (who, incidentally, uses a real doctor when he gets sick). And yes, it's almost always a "man" of God. Go figure. The healer invokes the name of Jesus Christ as his "magic word," often repeatedly. The healer asks Jesus to heal the patient, often very loudly and exuberantly. They may lightly strike or slap the patient (sometimes more than lightly). They may order demons, devils or afflictions to leave the body of the patient. Generally, the healer does not take any sort of action relating to the body other than praying for it. This ritual is often performed in front of a crowd, or a television camera, or both. (The roar of the crowd is almost as important to a successful faith healing as it is to a successful wrestling match.) At some point, the patient is expected to pretty much leap to their feet in perfect health. That's about it. The obvious question is: Does it work? And the equally obvious answer is: Not especially. When the setting is properly exuberant and emotionally charged, and the patient is a sufficiently enthusiastic, there is a placebo effect rush of good feeling. This is a pretty reliable phenomenon — a good thing for faith healers, since it keeps the yokels tuned in. Since some problems, like ulcers or back spasms, can be entirely the result of psychological states, the placebo effect occasionally produces a complete cure. And as much as the scientists don't like to admit it, sometimes mysterious and spooky things happen — such as people spontaneously being cured of cancer. The question, of course, is whether more people go into remission as the apparent result of prayer or faith healing than go into remission spontaneously. There are no statistics or case studies to support the idea that faith healing is appreciably more effective than any other placebo treatment (or outright fraud). The solid evidence that does exist concerning faith healing tends toward the disturbingly fucked-up. For instance, a quick review of the U.S. Courts will uncover numerous examples of the problem with faith healing. There's the story of the Colorado family whose belief in faith healing was so strong that they let their 13-year-old daughter die of a gangrenous infection of the vagina, which would have been easily treatable had they consulted a doctor instead of praying over it. Or the California two-year-old who died of bacterial meningitis after being "treated" by a Christian Science specialist and subsequently coughing up blood, vomiting and turning blue. Or the Boston, Mass., two-year-old who died when her bowels literally exploded had her treated solely with the prayers of their minister rather than the simple diagnosis and operation that would have easily remedied the blockage. Or the Pennsylvania two-year-old with a volleyball sized tumor in her lungs, or the Oklahoma nine-year-old with the ruptured appendix... And here, we come to the crux of the matter. Because in the eyes of society, as well as in the minds of most rational people, there is a big difference between choosing to decline medical treatment for one's self and refusing it on behalf of a child. Assuming for the moment that ANY SANE ADULT WOULD REFUSE TO SEE A DOCTOR IF THEY HAD A VOLLEYBALL-SIZED TUMOR IN THEIR CHEST, it would at least be THEIR CHOICE. It's nearly incomprehensible to those who are not "true believers" that anyone could be so heartless and brainless as to inflict such suffering on a child. One would think that a truly respectable parent would gladly sacrifice the spotless tidiness of their own soul in order to save a suffering child. But one would be wrong. Dead wrong. That's exactly sort of godless heathenism that teaches evolution and cures polio.


Package algorithms.misc
Class MiscMath0
- java.lang.Object
-
- algorithms.misc.MiscMath0
-
public class MiscMath0 extends java.lang.Object
miscellaneous math methods. some could probably be improved. first implemented in projects https://github.com/nking/two-point-correlation w/ Copyright (c) 2013-2015 Nichole King http://nking.github.io/two-point-correlation/ using The MIT License (MIT) and https://github.com/nking/curvature-scale-space-corners-and-transformations w/ Copyright (c) 2014 Climb With Your Feet and using The MIT License (MIT) then moved to this shared library project which has the same copyright and license.- Author:
- nichole
-
-
Field Summary
Fields Modifier and Type Field Description (package private) static int[]
MultiplyDeBruijnBitPosition
-
Constructor Summary
Constructors Constructor Description MiscMath0()
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description static double
acosh(double z)
static double
areaOfTriangle(double[] x, double[] y)
static boolean
areColinear(double[][] X, double tol)
determine whether any 3 points in X are colinear.static boolean
areColinear(double x1, double y1, double x2, double y2, double x3, double y3, double tol)
given 3 pairs of points, determine whether they are colinear.static double
asinh(double z)
static int
bitReverse(int v, int nBits)
static double[]
calcMedianAndIQR(double[] x)
calculate the median and the interquartile rangestatic double
calcSampleSkewness(double[] data)
third standardized moment of skewness as sample skewness:static double[]
calculateMedianOfAbsoluteDeviation(double[] x)
calculate the median of absolute deviation (MAD) asstatic float[]
calculateOuterRoundedMinAndMax(float[] a)
static double[]
calculateQuartiles(double[] x)
calculate the quartiles Q1, Q2, and Q3 of x asstatic long
computeNDivKTimesNMinusK(int n, int k)
compute n!/k!(n-k)!.static java.math.BigInteger
computeNDivKTimesNMinusKBigInteger(int n, int k)
compute n!/k!(n-k)!static long
computeNDivNMinusK(int n, int k)
compute n!/(n-k)!...static float[]
convertDoubleToFloat(double[] a)
static double[]
convertFloatToDouble(float[] a)
static double[]
convertIntToDouble(int[] a)
static java.lang.String
convertToBase(int a, int base)
convert integer a to the given base.static double[]
cumulativeSum(double[] a)
static int[]
cumulativeSum(int[] a)
static double[][]
cumulativeSumAlongColumns(double[][] a)
static double[][]
cumulativeSumAlongRows(double[][] a)
static double[][]
cumulativeSumMatlabPort(double[][] a)
static double
eulerMascheroniConstant()
return the Euler-Mascheroni constant.static long
factorial(int n)
compute n!static java.math.BigInteger
factorialBigInteger(int n)
compute n!static int[]
findFarInliersUsingTukeyFences(double[] x)
uses Tukey fences to find inlier indexes in x with factor k=3static int[]
findInliersUsingTukeyFences(double[] x)
uses Tukey fences to find inlier indexes in x with factor k=1.5static int[]
findInliersUsingTukeyFences(double[] x, double k)
uses Tukey fences to find inlier indexes in x.static double
findMax(double[] a)
static double
findMax(double[][] img)
static float
findMax(float[] a)
find maxstatic float
findMax(float[][] a)
static int
findMax(int[] a)
find maxstatic int
findMax(int[][] a)
static java.lang.Number
findMax(java.lang.Number[] x)
static double
findMin(double[] a)
static double
findMin(double[][] img)
static float
findMin(float[] a)
static float
findMin(float[][] a)
static int
findMin(int[] a)
static int
findMin(int[][] a)
static java.lang.Number
findMin(java.lang.Number[] x)
static int[]
findMinMaxValues(int[][] a)
static int[]
findMinMaxXY(PairIntArray points)
find the minima and maxima of x and y and return them as int[]{xMin, xMax, yMin, yMax}static int[]
findMinMaxXY(gnu.trove.set.TIntSet pixelIdxs, int imgWidth)
find the minima and maxima of x and y and return them as int[]{xMin, xMax, yMin, yMax}static int[]
findMinMaxXY(java.util.Collection<PairInt> points)
find the minima and maxima of x and y and return them as int[]{xMin, xMax, yMin, yMax}static int
findPowerOf10(float a)
static int
findPowerOf10_2(float a)
static java.util.List<java.lang.Integer>
findStrongPeakIndexes(HistogramHolder h, float frac)
for the given histogram, returns the indexes of the primary peak and any peaks which are larger than frac*maxPeak above their neighboring values.static java.util.List<java.lang.Integer>
findStrongPeakIndexesDescSort(HistogramHolder hist, float fracMax)
static int
findYMaxIndex(double[] a)
find max but ignore values such as infinity, and NANstatic int
findYMaxIndex(float[] a)
find max but ignore values such as FLOAT.MAX_VALUE, infinity, and NANstatic int
findYMaxIndex(int[] a)
static int
findYMaxIndex(long[] a)
static int
findYMaxIndex(gnu.trove.list.TIntList a)
static PairIntArray
get20NeighborOffsets()
static double[]
getAvgAndStDev(double[] x)
given an array of points, return the average and standard deviation from the averagestatic double[]
getAvgAndStDev(int[] x)
given an array of points, return the average and standard deviation from the averagestatic double[]
getAvgAndStDev(int[] x, int length)
given an array of points, return the average and standard deviation from the averagestatic double[]
getAvgAndStDev(long[] x, int length)
given an array of points, return the average and standard deviation from the averagestatic double
getFractionalPart(double a)
get fractional part of a.static long
getMarsennePrime(int powerOf2)
http://en.wikipedia.org/wiki/Mersenne_primestatic double[]
getMinMax(double[] d)
static float[]
getMinMax(float[] d)
static boolean
isAPowerOf2(int n)
test for whether n is a power of 2.static gnu.trove.list.array.TFloatArrayList
linspace(float start, float stop, int num, boolean endpoint)
adapted method from scipy's numpy package to return evenly spaced numbers over a specified intervalstatic gnu.trove.list.array.TDoubleArrayList
logspace(float start, float stop, int num, boolean endpoint)
method from scipy's numpy package to return numbers spaced evenly on a log scale.static gnu.trove.map.TIntIntMap
makeFrequencyMap(int[] a)
static double
mean(double[] data)
calculates the mean of the datastatic double[]
mean(double[] data, int nDimensions)
calculates the mean of the data per dimension and returns it as a point in all dimensions.static int
numberOfBits(int v)
determine the number of bits, that is, the msb position + 1.static int
numberOfBits(long v)
determine the number of bits, that is the msb position + 1.static int
numberOfBitsWOB(int v)
determine the number of bits without branching and using only an intstatic int
numberOfSetBits(long x)
determine the number of set bits.static void
reverse(int[] a)
static float
roundDownByLargestPower(float f)
Round number down to in the largest power.static float
roundUpByLargestPower(float f)
Round number up to the next digit in the largest power.int
sign(int v)
static double[][]
standardDeviation(double[] data, int nDimensions)
calculates the mean per dimension and standard deviation per dimension of the data and returns them in a double array of size [2][nDimensions]static byte[]
writeToBigEndianBytes(long value)
write value to a byte array in big endian, that is LSB in highest order bit (MSB is in lowest memory address).
-
-
-
Method Detail
-
calculateOuterRoundedMinAndMax
public static float[] calculateOuterRoundedMinAndMax(float[] a)
- Parameters:
a
-- Returns:
-
roundUpByLargestPower
public static float roundUpByLargestPower(float f)
Round number up to the next digit in the largest power. MiscMath0.roundUpByLargestPower(31.1f) == 40.0f; MiscMath0.roundUpByLargestPower(0.11f) == 1.0f; MiscMath0.roundUpByLargestPower(-0.011f) == -0.02f; MiscMath0.roundUpByLargestPower(310.1f) == 400.0f; MiscMath0.roundUpByLargestPower(-3.1) == -4.0f; MiscMath0.roundUpByLargestPower(3.1) == 4.0f;- Parameters:
f
-- Returns:
-
roundDownByLargestPower
public static float roundDownByLargestPower(float f)
Round number down to in the largest power. For example, roundDownByLargestPower(3.1) returns 3.0 roundDownByLargestPower(-3.1) returns -4.0 roundDownByLargestPower(31.1) returns 30.0- Parameters:
f
-- Returns:
-
findPowerOf10
public static int findPowerOf10(float a)
- Parameters:
a
-- Returns:
-
findPowerOf10_2
public static int findPowerOf10_2(float a)
- Parameters:
a
-- Returns:
-
findYMaxIndex
public static int findYMaxIndex(float[] a)
find max but ignore values such as FLOAT.MAX_VALUE, infinity, and NAN- Parameters:
a
-- Returns:
-
findYMaxIndex
public static int findYMaxIndex(double[] a)
find max but ignore values such as infinity, and NAN- Parameters:
a
-- Returns:
-
findYMaxIndex
public static int findYMaxIndex(int[] a)
- Parameters:
a
-- Returns:
-
findYMaxIndex
public static int findYMaxIndex(gnu.trove.list.TIntList a)
- Parameters:
a
-- Returns:
-
findYMaxIndex
public static int findYMaxIndex(long[] a)
- Parameters:
a
-- Returns:
-
findMin
public static float findMin(float[] a)
- Parameters:
a
-- Returns:
-
findMin
public static double findMin(double[] a)
- Parameters:
a
-- Returns:
-
findMin
public static int findMin(int[] a)
- Parameters:
a
-- Returns:
-
findMax
public static int findMax(int[] a)
find max- Parameters:
a
-- Returns:
-
findMax
public static int findMax(int[][] a)
- Parameters:
a
-- Returns:
-
findMin
public static int findMin(int[][] a)
- Parameters:
a
-- Returns:
-
findMax
public static float findMax(float[][] a)
- Parameters:
a
-- Returns:
-
findMin
public static float findMin(float[][] a)
- Parameters:
a
-- Returns:
-
findMax
public static float findMax(float[] a)
find max- Parameters:
a
-- Returns:
-
findMax
public static double findMax(double[] a)
- Parameters:
a
-- Returns:
-
findMin
public static double findMin(double[][] img)
- Parameters:
img
-- Returns:
-
findMax
public static double findMax(double[][] img)
- Parameters:
img
-- Returns:
-
findStrongPeakIndexes
public static java.util.List<java.lang.Integer> findStrongPeakIndexes(HistogramHolder h, float frac)
for the given histogram, returns the indexes of the primary peak and any peaks which are larger than frac*maxPeak above their neighboring values.- Parameters:
h
-frac
- the fraction of the y value of the maximum peak that is used as a critical limit that any other peaks must have in excess of their neighboring points. For example, 0.1.- Returns:
-
findStrongPeakIndexesDescSort
public static java.util.List<java.lang.Integer> findStrongPeakIndexesDescSort(HistogramHolder hist, float fracMax)
- Parameters:
hist
-fracMax
-- Returns:
-
getAvgAndStDev
public static double[] getAvgAndStDev(int[] x)
given an array of points, return the average and standard deviation from the average- Parameters:
x
-- Returns:
-
getAvgAndStDev
public static double[] getAvgAndStDev(int[] x, int length)
given an array of points, return the average and standard deviation from the average- Parameters:
x
-length
-- Returns:
-
getAvgAndStDev
public static double[] getAvgAndStDev(long[] x, int length)
given an array of points, return the average and standard deviation from the average- Parameters:
x
-length
-- Returns:
-
calculateQuartiles
public static double[] calculateQuartiles(double[] x)
calculate the quartiles Q1, Q2, and Q3 of x asx = ascending sort(x) n = x.length; Q1 = median of x[0] through x[n/2] which is x[n/4]; Q2 = median of x = x[n/2]; Q3 = median of x[n/2] through x[n-1] = x[(int)0.75*n];
The IQR is Q3 - Q1;- Parameters:
x
-- Returns:
- an array holding Q1, Q2, Q3, min and max
-
findInliersUsingTukeyFences
public static int[] findInliersUsingTukeyFences(double[] x)
uses Tukey fences to find inlier indexes in x with factor k=1.5calculated as q = calculateQuartiles(x); iqr = q[2]-q[0]; inliers are in the range [q[0] - k*iqr, q[2] + k*iqr], inclusive.
- Parameters:
x
-- Returns:
-
findFarInliersUsingTukeyFences
public static int[] findFarInliersUsingTukeyFences(double[] x)
uses Tukey fences to find inlier indexes in x with factor k=3calculated as q = calculateQuartiles(x); iqr = q[2]-q[0]; inliers are in the range [q[0] - k*iqr, q[2] + k*iqr], inclusive.
- Parameters:
x
-- Returns:
-
findInliersUsingTukeyFences
public static int[] findInliersUsingTukeyFences(double[] x, double k)
uses Tukey fences to find inlier indexes in x.calculated as q = calculateQuartiles(x); iqr = q[2]-q[0]; inliers are in the range [q[0] - k*iqr, q[2] + k*iqr], inclusive.
- Parameters:
x
-k
-- Returns:
-
calculateMedianOfAbsoluteDeviation
public static double[] calculateMedianOfAbsoluteDeviation(double[] x)
calculate the median of absolute deviation (MAD) asabsDev_i = abs(x_i - median(x)) mad = median( absDev)
and returns the median, followed by the median of absolute deviation. to use the MAD as one uses standard deviation in determining outliers, use stDev = k*MAD where k is a constant scale factor. For gaussian k~1.4826. Then and outlier is outside the range [median - 3*MAD, median + 3*MAD].- Parameters:
x
-- Returns:
- an array holding the median of absolute deviation of x, the median, the min, and the max.
-
calcMedianAndIQR
public static double[] calcMedianAndIQR(double[] x)
calculate the median and the interquartile range- Parameters:
x
-- Returns:
-
getAvgAndStDev
public static double[] getAvgAndStDev(double[] x)
given an array of points, return the average and standard deviation from the average- Parameters:
x
-- Returns:
-
get20NeighborOffsets
public static PairIntArray get20NeighborOffsets()
- Returns:
-
findMinMaxValues
public static int[] findMinMaxValues(int[][] a)
- Parameters:
a
-- Returns:
-
findMinMaxXY
public static int[] findMinMaxXY(java.util.Collection<PairInt> points)
find the minima and maxima of x and y and return them as int[]{xMin, xMax, yMin, yMax}- Parameters:
points
-- Returns:
- minMaxXY int[]{xMin, xMax, yMin, yMax}
-
findMinMaxXY
public static int[] findMinMaxXY(gnu.trove.set.TIntSet pixelIdxs, int imgWidth)
find the minima and maxima of x and y and return them as int[]{xMin, xMax, yMin, yMax}- Parameters:
pixelIdxs
-imgWidth
-- Returns:
- minMaxXY int[]{xMin, xMax, yMin, yMax}
-
findMinMaxXY
public static int[] findMinMaxXY(PairIntArray points)
find the minima and maxima of x and y and return them as int[]{xMin, xMax, yMin, yMax}- Parameters:
points
-- Returns:
- minMaxXY int[]{xMin, xMax, yMin, yMax}
-
isAPowerOf2
public static boolean isAPowerOf2(int n)
test for whether n is a power of 2.- Parameters:
n
- a non-negative number.- Returns:
- true if is a power of , else false.
-
convertToBase
public static java.lang.String convertToBase(int a, int base)
convert integer a to the given base. java.lang.Integer already has radix toString operations, so this is just here for convenience.- Parameters:
a
-base
-- Returns:
-
getFractionalPart
public static double getFractionalPart(double a)
get fractional part of a. e.g. for a = 385.55, fractional part = 0.55. for a = -385.55, fractional part = -0.55.- Parameters:
a
-- Returns:
-
numberOfBits
public static int numberOfBits(int v)
determine the number of bits, that is, the msb position + 1. Note that a value of 0 returns a bit length of 1.- Parameters:
v
-- Returns:
-
numberOfBits
public static int numberOfBits(long v)
determine the number of bits, that is the msb position + 1. Note that a value of 0 returns a bit length of 1.- Parameters:
v
-- Returns:
-
numberOfSetBits
public static int numberOfSetBits(long x)
determine the number of set bits. this method uses the hamming weight which uses binary magic numbers.reference: https://en.wikipedia.org/wiki/Hamming_weight method popcount64c
- Parameters:
x
- the bitstring with the set bits to count- Returns:
- the number of bits set in x
-
bitReverse
public static int bitReverse(int v, int nBits)
- Parameters:
v
-nBits
-- Returns:
-
logspace
public static gnu.trove.list.array.TDoubleArrayList logspace(float start, float stop, int num, boolean endpoint)
method from scipy's numpy package to return numbers spaced evenly on a log scale.numpy is licensed under BSD 3-clause "New" or "Revised" License https://github.com/numpy/numpy/blob/master/LICENSE.txt
- Parameters:
start
- is the starting value of the sequence.stop
- float is the final value of the sequence, unless `endpoint` is False. In that case, ``num + 1`` values are spaced over the interval in log-space, of which all but the last (a sequence of length ``num``) are returned.num
- : Number of samples to generate. Default is 50.endpoint
- : If true, `stop` is the last sample. Otherwise, it is not included. Default is True.- Returns:
-
linspace
public static gnu.trove.list.array.TFloatArrayList linspace(float start, float stop, int num, boolean endpoint)
adapted method from scipy's numpy package to return evenly spaced numbers over a specified intervalnumpy is licensed under BSD 3-clause "New" or "Revised" License https://github.com/numpy/numpy/blob/master/LICENSE.txt
- Parameters:
start
- is the starting value of the sequence.stop
- float is the final value of the sequence, unless `endpoint` is False. In that case, ``num + 1`` values are spaced over the interval in log-space, of which all but the last (a sequence of length ``num``) are returned.num
- : Number of samples to generate. Default is 50.endpoint
- : If true, `stop` is the last sample. Otherwise, it is not included. Default is True.- Returns:
-
mean
public static double[] mean(double[] data, int nDimensions)
calculates the mean of the data per dimension and returns it as a point in all dimensions.- Parameters:
data
- nDimensional data points in format [ point_0 in all dimensions, point_1 in all dimensions, ... point_{n-1} in all dimensions[nDimensions
- the number of dimensions of a point- Returns:
- an array holding the mean per dimension, e.g. point_0_0, point_0_1, point_0_2...point_0_{nDimensions-1}]
-
mean
public static double mean(double[] data)
calculates the mean of the data- Parameters:
data
- data points- Returns:
- the sample mean
-
standardDeviation
public static double[][] standardDeviation(double[] data, int nDimensions)
calculates the mean per dimension and standard deviation per dimension of the data and returns them in a double array of size [2][nDimensions]- Parameters:
data
- nDimensional data points in format [ point_0 in all dimensions, point_1 in all dimensions, ... point_{n-1} in all dimensions[nDimensions
- the number of dimensions of a point- Returns:
- the standard deviation of the data in each dimension. return format is a double array of size [2][nDimensions]
-
cumulativeSum
public static double[] cumulativeSum(double[] a)
- Parameters:
a
-- Returns:
-
cumulativeSum
public static int[] cumulativeSum(int[] a)
- Parameters:
a
-- Returns:
-
cumulativeSumMatlabPort
public static double[][] cumulativeSumMatlabPort(double[][] a)
- Parameters:
a
-- Returns:
-
cumulativeSumAlongColumns
public static double[][] cumulativeSumAlongColumns(double[][] a)
- Parameters:
a
-- Returns:
-
cumulativeSumAlongRows
public static double[][] cumulativeSumAlongRows(double[][] a)
- Parameters:
a
-- Returns:
-
makeFrequencyMap
public static gnu.trove.map.TIntIntMap makeFrequencyMap(int[] a)
- Parameters:
a
-- Returns:
-
computeNDivKTimesNMinusK
public static long computeNDivKTimesNMinusK(int n, int k)
compute n!/k!(n-k)!. Note that if n or k are larger than 12, computeNDivKTimesNMinusKBigIntegerExact is used and in that case, if the result is larger than Long.MAX_VALUE an exception is thrown. (Aho and Ullman "Foundations of Computer Science")- Parameters:
n
-k
-- Returns:
- Throws:
java.lang.ArithmeticException
- thrown when result is out of range of type long
-
computeNDivNMinusK
public static long computeNDivNMinusK(int n, int k)
compute n!/(n-k)!... needed for large numbers- Parameters:
n
-k
-- Returns:
-
computeNDivKTimesNMinusKBigInteger
public static java.math.BigInteger computeNDivKTimesNMinusKBigInteger(int n, int k)
compute n!/k!(n-k)!- Parameters:
n
-k
-- Returns:
- Throws:
java.lang.ArithmeticException
- thrown when result is out of range of type long
-
factorial
public static long factorial(int n)
compute n!- Parameters:
n
-- Returns:
-
factorialBigInteger
public static java.math.BigInteger factorialBigInteger(int n)
compute n!- Parameters:
n
-- Returns:
-
writeToBigEndianBytes
public static byte[] writeToBigEndianBytes(long value)
write value to a byte array in big endian, that is LSB in highest order bit (MSB is in lowest memory address). these are signed values stored as twos complement and can be input to BigInteger's constructor.- Parameters:
value
-- Returns:
-
getMinMax
public static double[] getMinMax(double[] d)
- Parameters:
d
-- Returns:
-
getMinMax
public static float[] getMinMax(float[] d)
- Parameters:
d
-- Returns:
-
calcSampleSkewness
public static double calcSampleSkewness(double[] data)
third standardized moment of skewness as sample skewness:https://en.m.wikipedia.org/wiki/Skewness g1 = kappa_3/((kappa_2)^(3/2)) = (1/n) * summation from i=1 to n ( (x_i - mean)^3) / ([ (1/n) * summation from i=1 to n ( (x_i - mean)^2) ]^(3/2) ) where kappa_2 is the 2nd cumulant = variance. kappa_3 = central moment which is skewness
- Parameters:
data
-- Returns:
-
findMin
public static java.lang.Number findMin(java.lang.Number[] x)
- Parameters:
x
-- Returns:
-
findMax
public static java.lang.Number findMax(java.lang.Number[] x)
- Parameters:
x
-- Returns:
-
sign
public int sign(int v)
- Parameters:
v
-- Returns:
-
numberOfBitsWOB
public static int numberOfBitsWOB(int v)
determine the number of bits without branching and using only an int- Parameters:
v
-- Returns:
-
getMarsennePrime
public static long getMarsennePrime(int powerOf2)
http://en.wikipedia.org/wiki/Mersenne_prime- Parameters:
powerOf2
-- Returns:
-
acosh
public static double acosh(double z)
- Parameters:
z
-- Returns:
-
areaOfTriangle
public static double areaOfTriangle(double[] x, double[] y)
- Parameters:
x
-y
-- Returns:
-
asinh
public static double asinh(double z)
- Parameters:
z
-- Returns:
-
reverse
public static void reverse(int[] a)
- Parameters:
a
-
-
eulerMascheroniConstant
public static double eulerMascheroniConstant()
return the Euler-Mascheroni constant. It is the first derivative of the gamma function w.r.t. n at n=1.Chap 19 of "Statistical Distributions" by Evans et al.
- Returns:
-
convertDoubleToFloat
public static float[] convertDoubleToFloat(double[] a)
- Parameters:
a
-- Returns:
-
convertFloatToDouble
public static double[] convertFloatToDouble(float[] a)
- Parameters:
a
-- Returns:
-
convertIntToDouble
public static double[] convertIntToDouble(int[] a)
- Parameters:
a
-- Returns:
-
areColinear
public static boolean areColinear(double[][] X, double tol)
determine whether any 3 points in X are colinear. note that the method has not been edited for large number of points in X yet.- Parameters:
X
- data points in format [2 X nPoints] or [3 X nPoints] where row 0 are the 'x dimension' points, and row 1 are the 'y dimension' points. if row 2 is present, it is ignored as it is expected to be the z-axis of homogenous points (= value 1) and hence is not used.tol
-- Returns:
-
areColinear
public static boolean areColinear(double x1, double y1, double x2, double y2, double x3, double y3, double tol)
given 3 pairs of points, determine whether they are colinear.- Parameters:
tol
-x1
-y1
-x2
-y2
-x3
-y3
-- Returns:
-
-


Welcome to Solid!
Do you have a Solid Pod?
Log in
No, choose from the list of Pod Providers!
I Want a Solid Pod!
Log out


{% extends "base.html" %} {% load static %} {% block head_title %}Verify Your Email Address{% endblock %} {% block main %}
We sent you an email so we can confirm your address to complete your sign up. Please follow the link in your email. Once you do that, you’ll be on your way to starting with School Desk!
Regards,
Matt from School Desk
P.S. If you can’t find the confirmation email after a few minutes, be sure to check your spam folder as some email clients will mark your confirmation as spam.


imap_getmailboxes
(PHP 4, PHP 5, PHP 7)
imap_getmailboxes — Read the list of mailboxes, returning detailed information
on each one
说明
array imap_getmailboxes ( resource $imap_stream , string $ref , string $pattern
)
Gets information on the mailboxes.
参数
imap_stream
由 imap_open() 返回的 IMAP 流。
ref
ref should normally be just the server specification as described in
imap_open()
pattern
指定在邮箱层级的何处开始查找。
在组成 pattern 的字符中可使用两个特殊字符： '*' 和 '%'。 '*' 是指返回所有邮
箱目录. 如果将 '*' 作为 pattern 参数时, 则会返回整个邮箱层级结构。 '%' 是指
只返回当前级次。 '%' 作为 pattern 参数则只会返回顶层邮箱； '~/mail/%' 用于
UW_IMAPD 则会返回名为 ~/mail 的目录, 但不包含其子目录。
返回值
Returns an array of objects containing mailbox information. Each object has the
attributes name, specifying the full name of the mailbox; delimiter, which is
the hierarchy delimiter for the part of the hierarchy this mailbox is in; and
attributes. Attributes is a bitmask that can be tested against:
• LATT_NOINFERIORS - This mailbox contains, and may not contain any
"children" (there are no mailboxes below this one). Calling
imap_createmailbox() will not work on this mailbox.
• LATT_NOSELECT - This is only a container, not a mailbox - you cannot open
it.
• LATT_MARKED - This mailbox is marked. This means that it may contain new
messages since the last time it was checked. Not provided by all IMAP
servers.
• LATT_UNMARKED - This mailbox is not marked, does not contain new messages.
If either MARKED or UNMARKED is provided, you can assume the IMAP server
supports this feature for this mailbox.
范例
Example #1 imap_getmailboxes() example
$val) {
echo "($key) ";
echo imap_utf7_decode($val->name) . ",";
echo "'" . $val->delimiter . "',";
echo $val->attributes . " \n";
}
} else {
echo "imap_getmailboxes failed: " . imap_last_error() . "\n";
}
imap_close($mbox);
?>
参见
• imap_getsubscribed() - List all the subscribed mailboxes
User Contributed Notes 5 notes
===============================================================================
i am currently develop a simple IMAP client, when i call imap_getmailboxes() i
receive a different values in attributes property of the mailbox object the
problem is how can i manipulate these attributes to get a meaningful value,
if you make a hard search to find a solution for this, you will
not find any useful documents for this problem, let us take a closer look for
this problem.
when i call imap_getmailboxes() against different IMAP servers i got these
attribute values
[attributes] => 9
[attributes] => 1
[attributes] => 64
[attributes] => 32
[attributes] => 40
the documentation tell us that we check this attributes against four constants,
these contents are
LATT_NOINFERIORS
LATT_NOSELECT
LATT_MARKED
LATT_UNMARKED
the value of these constants are
LATT_NOINFERIORS = 1
LATT_NOSELECT = 2
LATT_MARKED = 4
LATT_UNMARKED = 8
you can got this result by echo each constant, unfortunately the documentation
not explain how we can check the attributes against the constants, after a long
time of searching i find the answer in source code of c-client
(you can get the source from ftp://ftp.cac.washington.edu/imap/)
under \src\c-client you will find mail.h open it and you will find this
/* terminal node in hierarchy */
#define LATT_NOINFERIORS (long) 0x1
/* name can not be selected */
#define LATT_NOSELECT (long) 0x2
/* changed since last accessed */
#define LATT_MARKED (long) 0x4
/* accessed since last changed */
#define LATT_UNMARKED (long) 0x8
/* name has referral to remote mailbox */
#define LATT_REFERRAL (long) 0x10
/* has selectable inferiors */
#define LATT_HASCHILDREN (long) 0x20
/* has no selectable inferiors */
#define LATT_HASNOCHILDREN (long) 0x40
as you notice here these are our four constants and three additional constants
LATT_REFERRAL
LATT_HASCHILDREN
LATT_HASNOCHILDREN
then what is the value of these 3 attributes
LATT_REFERRAL 0x10 = 00010000 in binary, the bitmask value is 2^4 = 16 and so
on, or simply echo this constant to get the value, then
LATT_REFERRAL = 16
LATT_HASCHILDREN = 32
LATT_HASNOCHILDREN = 64
finally the full list of constants will be
LATT_NOINFERIORS = 1
LATT_NOSELECT = 2
LATT_MARKED = 4
LATT_UNMARKED = 8
LATT_REFERRAL = 16
LATT_HASCHILDREN = 32
LATT_HASNOCHILDREN = 64
ok let's back to our attributes
[attributes] => 9
[attributes] => 1
[attributes] => 64
[attributes] => 32
[attributes] => 40
[attributes] => 9 this mean it's LATT_UNMARKED and LATT_NOINFERIORS 1+8 =9
[attributes] => 1 this mean LATT_NOINFERIORS
[attributes] => 64 this mean LATT_HASNOCHILDREN
[attributes] => 32 this mean LATT_HASCHILDREN
[attributes] => 40 this mean LATT_HASCHILDREN and LATT_UNMARKED 32+8=40
this just like linux file permission 7 mean read, write, and execute 4+2+1 read
=4 write=2 execute=1
that is what i found, i hope this can help
Mohamed Abbas
Nileweb Egypt
===============================================================================
The list of mailbox attributes in this document is very misleading. In
particular the explanation of noinferiors is just wrong. It does not mean that
the mailbox currently has no children, it means that it *cannot* have children
ever. Also, it is untrue that marked and unmarked are only used by UW-IMAP.
They are in the official IMAP specification and are used by at least
Courier-imap as well.
One thing to watch out for, however, is broken IMAP servers which do send \
Noinferiors when they mean that there are currently no children.
From the IMAP4rev1 specs (RFC 2060):
\Noinferiors
It is not possible for any child levels of hierarchy to exist
under this name; no child levels exist now and none can be
created in the future.
\Noselect
It is not possible to use this name as a selectable mailbox.
\Marked
The mailbox has been marked "interesting" by the server; the
mailbox probably contains messages that have been added since
the last time the mailbox was selected.
\Unmarked
The mailbox does not contain any additional messages since the
last time the mailbox was selected.
===============================================================================
In case you print_r() or var_dump() the object and see an int for attribute,
these are the constant integers for the bitmask.
1 LATT_NOINFERIORS
2 LATT_NOSELECT
4 LATT_MARKED
8 LATT_UNMARKED
===============================================================================
i was looking for a function to test the attributes.
and it was hard to find an answer or code.
Maybe there is a function availeble, but i couldn't find it.
the first function: returns all mailboxes in on the server
The second function: returns a bitstring from the attr_number returned by
getmailboxes()
The tirth function: returns an array with the active attributes on the specific
mailbox
Last Line: is a combination of the functions: the output is, any map witch can
hold no mail but only sub boxes...
$val) {
$mapname = str_replace($serverString, "", imap_utf7_decode($val->
name));
if ($mapname[0] != ".") {
$list_folders[$key]['name'] = $mapname;
$list_folders[$key]['delimiter'] = $val->delimiter;
$list_folders[$key]['attributes'] = $val->attributes;
}
}
} else {
echo "imap_getmailboxes failed: " . imap_last_error() . "\n";
}
return $list_folders;
}
function IntToBin($number) {
$BitWaarde = 1;
$IntNum = $number;
$BinString = "";
if ($IntNum > 0) {
// bepaal de max bitwaarde aan de hand van $IntNum
while ($IntNum > $BitWaarde) {
$BitWaarde = $BitWaarde * 2;
}
// maken van een binaire string.
while ($BitWaarde >= 1 ) {
if ($IntNum < $BitWaarde) {
if ($BinString != "") $BinString .= "0";
} else {
$BinString .= "1";
$IntNum = $IntNum-$BitWaarde;
}
$BitWaarde = $BitWaarde / 2;
}
}
return $BinString;
}
function Attributes($BinString) {
$BinInt = (int)$BinString;
if ($BinInt >=1000){
$setAttribute['LATT_UNMARKED'] = true;
$BinInt = $BinInt-1000;
} else $setAttribute['LATT_UNMARKED'] = false;
if ($BinInt >=100){
$setAttribute['LATT_MARKED'] = true;
$BinInt = $BinInt-100;
} else $setAttribute['LATT_MARKED'] = false;
if ($BinInt >=10){
$setAttribute['LATT_NOSELECT'] = true;
$BinInt = $BinInt-10;
} else $setAttribute['LATT_NOSELECT'] = false;
if ($BinInt >=1){
$setAttribute['LATT_NOINFERIORS'] = true;
$BinInt = $BinInt-1;
} else $setAttribute['LATT_NOINFERIORS'] = false;
return $setAttribute;
}
foreach (getFolders($mailbox, $config['Server_string']) as $key => $val) {
$Attr = Attributes(IntToBin((int)$val['attributes']));
if (!$Attr['LATT_NOINFERIORS']) {
echo "";
}
}
?>
===============================================================================
For the purposes of passing along the attributes as a json array, I wanted to
pass the attributes as an indexed array to save on bandwidth and session
storage. The human readable translation is then performed in javascript by
relating each key to the proper attribute label. I also wanted a cleaner way
of converting the attributes without calling another function or using a
complex iteration. This puts each binary attribute into it's own array element
for easy testing.
$mailbox){
...
$attrs = preg_split('//',str_pad(decbin($mailbox->attributes),7,"0",
STR_PAD_LEFT),8); // convert decimal to an array of attributes
array_shift($attrs); // Remove the extra element at the front of the array
in position 0
...
}
?>
With temporary variables, the conversion would look like this.
attributes); // convert decimal to binary
$attr_binary = str_pad($attr_binary,7,"0",STR_PAD_LEFT); // pad with 0's on
the left
$attrs = $preg_split('//',$attr_binary,8); // split into an array after each
character
array_shift($attrs); // Remove the extra element at the front of the array in
position 0
?>
By defining the attributes as a map to the array index, you can test as
follows.


Facewatch is a secure cloud based platform that uses Facial Recognition technology
to proactively prevent, deter and protect businesses against low level crime
Real Time Alerts
Using facial recognition technology,
Facewatch matches faces against known offenders within seconds of them
entering your premises and sends an instant alert for verification and action
Watchlist
Once approved, you will have full access to our complete database of persons of interest in addition to your own watchlist images. The all-inclusive watchlist is then shared by geography with every Facewatch subscriber
Report & Upload
Our digital incident reporting and intelligence sharing platform makes it easy for you to capture, report and upload information and digital images
Security
You have complete peace of mind regarding data protection, we use bank grade security and take on full data controller responsibility for the sharing of faces and associated warning flags
Testimonials
Excellent technology for fighting crime, reducing bureaucracy and saving time.
— Sir Bernard Hogan Howe, Former Commissioner, Metropolitan Police Service
I fully endorse Facewatch and think it is a service that can be used not just in London and the UK but globally across the world.
— Director of Security, The Savoy Hotel
I am hugely impressed. Facewatch represents a big advance in crime deterrence, detection and prevention..
— Nick Ross, Crimewatch and Jill Dando Institute
An exciting opportunity to bring together smart technology, real people and businesses to keep us all safer from crime.
— Lord Jonathan Evans
The most influential development to the security industry since CCTV went digital.
— Mark Stevenson, Loss Prevention Manager for Blakemore Retail
The Major City Chiefs were delighted to have received a presentation from Facewatch at our annual conference in San Diego. We see great potential in the inclusive approach that Facewatch is pioneering in the UK to bring everyone together in the fight against low level crime and look forward to working with them.
— Charles H. Ramsey, President, Major Cities Chiefs Association, USA
Crimestoppers USA are delighted to be partnered with Facewatch USA. We have seen the benefits that this partnership has brought to our UK associates and look forward to working together in order to help make our communities safer.
— John Lamb, Chairman, Crimestoppers USA


- AbstractAnimation - Class in io.github.teamfractal.animation
-
- AbstractAnimation() - Constructor for class io.github.teamfractal.animation.AbstractAnimation
-
- AbstractAnimationScreen - Class in io.github.teamfractal.screens
-
- AbstractAnimationScreen() - Constructor for class io.github.teamfractal.screens.AbstractAnimationScreen
-
- AbstractAnimationScreen.Size - Class in io.github.teamfractal.screens
-
A size structure with Width and Height property.
- actButton - Variable in class io.github.teamfractal.actors.MarketAdjustableActor
-
Button that attempts to initiate a buying/selling transaction for/using the amount of resources specified
in the widget by the player
- actionEvent - Variable in class io.github.teamfractal.actors.MarketAdjustableActor
-
Encapsulates the code to be executed when the widget's button is clicked on
- actors - Variable in class io.github.teamfractal.screens.EndGameScreen
-
- actors - Variable in class io.github.teamfractal.screens.GameScreen
-
- actors - Variable in class io.github.teamfractal.screens.PlayerSelectScreen
-
- actors - Variable in class io.github.teamfractal.screens.ResourceMarketScreen
-
The actors that will populate the market
- actors() - Method in class io.github.teamfractal.screens.ResourceMarketScreen
-
Returns the ResourceMarketActors table that forms the core of this interface
- actors - Variable in class io.github.teamfractal.screens.RoboticonMarketScreen
-
The actors that will populate the roboticon market
- actors() - Method in class io.github.teamfractal.screens.RoboticonMarketScreen
-
Returns the RoboticonMarketActors table that forms the core of this interface
- addAnimation(IAnimation) - Method in class io.github.teamfractal.screens.AbstractAnimationScreen
-
Add a new animation to current Screen.
- addButton - Variable in class io.github.teamfractal.actors.MarketAdjustableActor
-
Button incrementing the quantity of things to buy/sell through the widget
- addLandPlot(LandPlot) - Method in class io.github.teamfractal.entity.Player
-
Add landplot to current user.
- addOverlay(Overlay) - Method in class io.github.teamfractal.screens.GameScreen
-
- addRoboticonFunction() - Method in class io.github.teamfractal.actors.RoboticonMarketActors
-
Adds a roboticon to the quantity selected
- against - Variable in class io.github.teamfractal.entity.CaptureData.AttributeRate
-
- Against() - Constructor for class io.github.teamfractal.entity.CaptureData.AttributeRate.Against
-
- AIAmountLabel - Variable in class io.github.teamfractal.actors.PlayerSelectActors
-
- AIPlayer - Class in io.github.teamfractal.entity
-
- AIPlayer(RoboticonQuest) - Constructor for class io.github.teamfractal.entity.AIPlayer
-
- AIPlayerAmount - Variable in class io.github.teamfractal.actors.PlayerSelectActors
-
- AIPlayerLabel - Variable in class io.github.teamfractal.actors.PlayerSelectActors
-
- AIPlayerTest - Class in io.github.teamfractal.entity
-
Tests for the AI can be found here and in the Manual Testing part of the Test3 document
https://github.com/NotKieran/DRTN-Fractal/blob/Assessment3_Docs/Test3.pdf
- AIPlayerTest() - Constructor for class io.github.teamfractal.entity.AIPlayerTest
-
- animation - Variable in class io.github.teamfractal.animation.chancellor.WhiteStrip
-
- AnimationAddResources - Class in io.github.teamfractal.animation
-
- AnimationAddResources(Player, int, int, int) - Constructor for class io.github.teamfractal.animation.AnimationAddResources
-
Initialise the animation.
- AnimationCustomHeader - Class in io.github.teamfractal.animation
-
- AnimationCustomHeader(String, BitmapFont, int) - Constructor for class io.github.teamfractal.animation.AnimationCustomHeader
-
Builds a textual animation that, when played, fades in from the top; remains stationary for a few seconds,
and then fades out to disappear until it's played again
- animationFinish - Variable in class io.github.teamfractal.animation.AbstractAnimation
-
- animationLength - Static variable in class io.github.teamfractal.animation.AnimationAddResources
-
- animationLength - Static variable in class io.github.teamfractal.animation.AnimationShowPlayer
-
- AnimationPhaseTimeout - Class in io.github.teamfractal.animation
-
- AnimationPhaseTimeout(Player, RoboticonQuest, int, float) - Constructor for class io.github.teamfractal.animation.AnimationPhaseTimeout
-
Initialise the animation.
- animations - Variable in class io.github.teamfractal.screens.AbstractAnimationScreen
-
Animation queue.
- AnimationShowPlayer - Class in io.github.teamfractal.animation
-
- AnimationShowPlayer(int) - Constructor for class io.github.teamfractal.animation.AnimationShowPlayer
-
- AnimationTimeout - Class in io.github.teamfractal.animation
-
- AnimationTimeout(float) - Constructor for class io.github.teamfractal.animation.AnimationTimeout
-
Initialise the animation.
- appearAnimation - Variable in class io.github.teamfractal.animation.chancellor.TypeAnimation
-
- application - Static variable in class io.github.teamfractal.TesterFile
-
- applyResourceDelta(ResourceDelta) - Method in class io.github.teamfractal.entity.Player
-
- applyResourceDeltaNegative(ResourceDelta) - Method in class io.github.teamfractal.entity.Player
-
- AttributeRate() - Constructor for class io.github.teamfractal.entity.CaptureData.AttributeRate
-
- AttributeRateComment() - Constructor for class io.github.teamfractal.entity.CaptureData.AttributeRateComment
-
- attributeRateComments - Variable in class io.github.teamfractal.entity.CaptureData
-
- attributeRates - Variable in class io.github.teamfractal.entity.CaptureData
-
- AttributeType() - Constructor for enum io.github.teamfractal.entity.CaptureData.AttributeType
-


Click on a shape to select. Click anywhere else on canvas to deselect. Use WASDR to apply impulses to the shape. Zoom out to see settings better.
Friction: 0.2
Elasticity: 1.0
Angular Friction: 0.1
Gravity: (0, 0)
| Position: | (0, 0) |
|---|---|
| Velocity: | (0, 0) |
| Rotational Velocity: | 0.0 |
| Mass: | 0.0 |
| Immovable: | false |
| Sides: | 0 |
No selected shape
| X: | |
|---|---|
| Y: | |
| Sides: | |
| Radius: | |
| Mass: | |
| Immovable: |
This is a 2D collision engine/modeling system made entirely with JavaScript, HTML, and CSS. No external libraries are used. Separating Axis Theorem is used to model the collisions between the shapes. Any convex polygon is supported.


--- layout: default ---
Help users who are asking for support in reviews on the Play Store. Join Mozillians around the world for a week of answering questions and helping users have a great experience!
Start contributinglearn more
learn more
Still interested?
Get involved!


Compute the 2-dimensional discrete Fourier Transform
This function computes the n-dimensional discrete Fourier Transform over any axes in an M-dimensional array by means of the Fast Fourier Transform (FFT). By default, the transform is computed over the last two axes of the input array, i.e., a 2-dimensional FFT.
ifft2 : The inverse two-dimensional FFT. fft : The one-dimensional FFT. fftn : The n-dimensional FFT. fftshift : Shifts zero-frequency terms to the center of the array.
For two-dimensional input, swaps first and third quadrants, and second and fourth quadrants.
fft2 is just fftn with a different default for axes.
The output, analogously to fft, contains the term for zero frequency in the low-order corner of the transformed axes, the positive frequency terms in the first half of these axes, the term for the Nyquist frequency in the middle of the axes and the negative frequency terms in the second half of the axes, in order of decreasingly negative frequency.
See fftn for details and a plotting example, and numpy.fft for definitions and conventions used.
>>> a = np.mgrid[:5, :5][0]
>>> np.fft.fft2(a)
array([[ 0.+0.j, 0.+0.j, 0.+0.j, 0.+0.j, 0.+0.j],
[ 5.+0.j, 0.+0.j, 0.+0.j, 0.+0.j, 0.+0.j],
[ 10.+0.j, 0.+0.j, 0.+0.j, 0.+0.j, 0.+0.j],
[ 15.+0.j, 0.+0.j, 0.+0.j, 0.+0.j, 0.+0.j],
[ 20.+0.j, 0.+0.j, 0.+0.j, 0.+0.j, 0.+0.j]])