Andean Atlantis: Race, Science and the Nazi Occult in Bolivia
Bolivia, 1928.
As the train steamed around the bend, Lake Titicaca became visible far to the north. The morning sun danced on the water. The majestic Cordillera Real towered beyond. The whistle howled. The engine lurched. After an arduous journey from Berlin, amateur archeologist and future SS commander Edmund Kiss had finally reached his destination: the ruins of the ancient city-state of Tiwanaku.
Tiwanaku had been an object of western fascination since 1549, when a motley band of Spanish conquistadors encountered the ruins deep in the Andes, in what is today Bolivia. Massive stone gateways, enormous granite megaliths, colossal earthworks, intricately-carved stele, mysterious glyphs—the Spaniards marveled at their discovery. Asked of the origins of the ruins and the fate of the civilization that constructed them, local indigenous caciques, or lords, stated that they were from a time long past, and that their original inhabitants had been destroyed by a great flood.
Its antiquity so obvious, its provenance so uncertain, Tiwanaku became one of the great mysteries of modern archeology. During the nineteenth century, the ruins attracted a host of European naturalists that speculated on the civilization that built the monumental structures. Some attributed the site to ancient Egyptians, others to bearded Europeans. All agreed that the ancestors of Lake Titicaca’s local peoples, the Aymara, would have been incapable of accomplishing such a magnificent feat. But if native Andeans hadn’t constructed Tiwanaku, then who had?
Kiss disembarked at Tiwanaku with a bold theory. Tall and bespectacled, his face pink from the unrelenting Altiplano sun, he stood out among the Aymara porters shuffling past. Their rural, ‘uncivilized’ condition only strengthened his conviction that the ruins were built a million years ago by his Aryan ancestors—an ancient Nordic race—who had migrated from the Lost City of Atlantis.
Kiss’s Atlantis theory may have been strange; but stranger still was the fact that it was hardly new. For decades, Bolivians themselves had been pondering their Altantean ancestry—in fact, for many of the same reasons that Kiss had. A connection to Atlantis empowered Bolivia’s European-descendant aristocracy for the very same reasons that it attracted Nazis. It gave them their own private Garden of Eden; and it reinforced the myth of white supremacy.
Athens, 350 BCE.
The legend of Atlantis traces its origins to Plato, who introduced the fabled city in the dialogues Timaeus and Critias. He told of an advanced island civilization beyond the “Pillars of Hercules” that was ruled by a “remarkable dynasty of Kings” endowed with unimaginable wealth. The Kings, having grown overzealous, set out to conquer Athens and enslave its peoples. The Athenians mobilized a heroic defense. But the conflict angered the gods. They sent earthquakes and floods, and Atlantis was “swallowed up by the sea and vanished.”
Classicists have long maintained that Atlantis was a fable that the ancient philosopher invented to warn of the arrogance of power. Over the centuries, however, Plato’s legend acquired an air of truth. During the Renaissance, tales of Atlantis circulated in the European imagination, borne on Humanist inquiry and the discovery of the Americas. Sixteenth-century Spanish chroniclers, from Bartolomé de las Casas to Francisco López de Gómara, drew parallels between the New World and Plato’s Lost City, as did Francis Bacon and Thomas Moore of Great Britain. For French scholars who believed that humans had multiple origins, Atlantis evidenced the existence of man before Adam.
But it was during the late nineteenth century that interest in the fabled Lost City exploded. A Minnesota politician and amateur antiquarian named Ignatius Donnelly is widely credited for the Atlantis revival. In 1882, his bestseller, Atlantis: The Antediluvial World, didn’t just argue that Plato’s Atlantis existed; it claimed that Atlantis had shaped other ancient cultures, from the Maya to the Egyptians. Popular and scientific interest in Atlantis flourished. The Royal Geographic Society of London and the U.S. National Geographic Society were soon sponsoring research on the lost city’s location and funding quixotic and, at times, unnecessarily deadly expeditions.
It’s often overlooked that this “Atlantis revival” coincided with the apogee of polygenesis, one of the fundamental assumptions of scientific racism. Polygenesis was an alternative theory of evolution that rejected the common origins of humans, a belief rooted in Christian creationism and sustained by Darwinian evolution. Polygenists divided humans into separate biological species, or races, that each originated and evolved independently. Races were classified according to innate, inheritable physical attributes—that is, not just skin color, but cranial capacity.
Locating those origins, however, was more complicated. If darker skinned peoples originated in Africa, as polygenists had long assumed, the where did the lighter-skinned peoples come from?
Atlantis would provide nineteenth-century polygenists with their own private Garden of Eden—an idea that appealed especially to Bolivia’s creole, or European-descendant, elite. Since securing their independence from Spain in 1825, they governed—often precariously—the most indigenous country in the hemisphere. Polygenesis provided irrefutable scientific proof of their biological difference and social superiority over native Andean peoples. And deployed alongside the Atlantis myth, it allowed them to claim Tiwanaku as a source of creole heritage.
La Paz, 1925.
Twenty kilometers southeast of Lake Titicaca, on the high plateau straddling Peru and Bolivia, Tiwanaku was once the administrative and ceremonial center of a vast Andean empire. Stratigraphic excavations carried out by Wendell Bennett in the 1930s indicated that the civilization emerged as early as 300 BCE and reached its apex between 600 and 800 AD. Radiocarbon dating subsequently confirmed its age, and archeologists today generally agree that Tiwanaku was built by the ancestors of the Aymara-speaking peoples who populate the Lake Titicaca basin today.
Such a claim was laughable in the Bolivia of Belisario Díaz Romero. Born in La Paz in 1870 to a wealthy family of Spanish provenance, Díaz belonged to an elite class of statesmen and intellectuals that reaped enormous profits by exporting natural resources and exploiting indigenous labor. The republic they governed was overwhelmingly made up of native Americans—largely Aymara- and Quechua-speaking peoples in the highlands and valleys of the Eastern Andean Escarpment.
Creole wealth rested on their access to indigenous labor; their social privilege and political legitimacy rested on a shared conviction that indigenous Bolivians belonged to an inferior race.
Among the creole gentleman scholars who shored up such beliefs, Díaz stood apart. He practiced medicine, wrote history, experimented with botany, and studied geography, linguistics, and archaeology. He was a member of the Geographic Society of La Paz, the National Institute of Statistics, and the National Academy of History. He directed the Meteorological Observatory and the National Museum. Sharp yet soft-spoken, he was the last of Bolivia’s great polymaths.
His most original contribution to Bolivian science was in evolutionary biology. Díaz vehemently rejected creationism, and was an early proponent of natural selection. Yet he dismissed Darwin’s belief in the common origins of the human species, embracing instead the polygenic theories of leading French and German biologists. He divided the human species into “three living and permanent races: the white race, the yellow, and the black.” Homo niger originated in Africa and Homo atlaicus in Asia. Homo atlanticus was a white, ancient Aryan race that came from Atlantis.
Díaz attributed the construction of the monumental architecture at Tiwanaku to Homo atlanticus. Two hundred million years ago, the ancient Aryans migrated west to South America from the original Atlantis across a long-lost land bridge. They settled in the Bolivian Altiplano, which was much different back then. Lake Titicaca was three times larger and the surrounding plain was not windswept and barren. It was lush and tropical, ideal for farming, and abundant in natural resources. Homo atlanticus settled in a shallow valley on the southern shore of the lake, where they constructed a magnificent city.
Díaz not only revealed the origins of the ruins, but explained their supposed contrast with Bolivia’s present-day indigenous population. By measuring skulls, he argued that the cranial measurements of Bolivian Indians were not consistent with those of Homo atlanticus. Rather, the Aymara were descendants of Homo atlaicus, barbaric Asians who arrived in a later migration. It was Homo atlaicus that conquered the ancient city and named it Tiwanaku.
Díaz’s “discoveries” were well received in the elite scientific and political circles of fin-de-siècle La Paz—so well received, in fact, that the government promoted Tiwanaku as the official icon of Bolivia’s Centennial celebrations in 1925.
The months leading up to Independence Day were marked by the typical flourish of statues, monuments, and nationalist speeches. The streets were cleaned and the Parisian townhouses lining the stately calle Montes were repainted. The President even issued a supreme decree prohibiting Indians from sidewalks and plazas. And when the big day finally came, creole aristocrats could raise their glass in the name of the Republic and toast their ancient ancestors from Tiwanaku, the “primitive metropolis of South American whites.”
Berlin, 1939.
Whether or not the German writer Edmund Kiss met Díaz Romero during his stay in Bolivia remains uncertain. But Kiss was undoubtedly exposed to his ideas by Arthur Posnansky, a swashbuckling Austrian capitalist, amateur archaeologist, and international gentleman of science. Tiwanaku was Posnansky’s enduring obsession. From 1903, the year he settled in Bolivia, to his death in 1946, he published over 130 titles on the site, in four languages.
What brought Kiss and Posnansky together—and what drew Kiss to Tiwanaku in the first place—was Kiss’s commitment to German ethnic nationalism and his obsession with the mythic past. Neither were uncommon in the Weimar Republic. As the Nazi Party expanded during the 1920s and 1930s, right-wing romantic nationalists celebrated an idealized folk culture as the essence of German nationhood.
What brought Kiss and Posnansky together—and what drew Kiss to Tiwanaku in the first place—was Kiss’s commitment to German ethnic nationalism and his obsession with the mythic past. Neither were uncommon in the Weimar Republic. As the Nazi Party expanded during the 1920s and 1930s, right-wing romantic nationalists celebrated an idealized folk culture as the essence of German nationhood.
Where archaeological evidence of Aryan Atlanteans was lacking, an elaborate theory called Glacier Cosmology did the trick. A moon had once collided with Earth, destroying Atlantis and covering the planet with glaciers. What led Kiss to Tiwanaku was his belief that following the cataclysm, survivors of that ancient Nordic civilization took refuge in the high Andes, one of the few places where life was still possible. Kiss found Posnansky while researching the question and in 1928 he set off to Bolivia to study the ruins.
Kiss spent almost a year at Tiwanaku. Always wearing the same long white smock and Panama hat, he carefully surveyed the ruins and their relative position to the sun, stars, and moon. Kneeling, notepad on thigh, he studied the glyphs for meaning, sometimes for hours, seeking clues to the identity of the ancient architects. Day after day in the basement of the National Museum he studied skulls, wondering if the ancient Tiwanakan’s elongated crania were artificially deformed, or belonged to a superior Nordic race.
Back in Germany, his work was a wild success. “The works of art and the architectural style of the prehistoric city are certainly not of Indian origin,” Kiss had concluded. “Rather they are probably the creations of Nordic men who arrived in the Andean highlands as representatives of a special civilization.” Kiss further publicized his finding with a popular tertiary of science fiction novels that chronicled the rise, decline, and ultimate triumph of the ancient Aryans.
Nazi officials seized on Kiss’s work and featured the ancient Nordic city of Tiwanaku in party newspapers and Hitler Youth publications. Kiss was soon put in touch with Heinrich Himmler, leader of the Nazi SS and a principle architect of the Holocaust. In 1935, Himmler had founded a new SS think tank called the Ahnenerbe to conduct social scientific research into the history of the Aryan peoples. So far, he had sent archeological missions to Scandinavia, France, Tibet, and Antarctica in search of the ancient origins of the Aryan race.
Now he wanted Kiss to lead a trip to Bolivia, to Tiwanaku, the ancient Nordic civilization in the Andes.  Their objective: reveal the presence of the Master Race in prehistoric South America, and dispel, once and for all, the mystery surrounding the Tiwanaku ruins.
The expedition never happened. When Hitler invaded Poland in September 1939, the war took precedence. Kiss, already an officer in the SS, was dispatched to Warsaw, and then took command of Wolfschanze, one of Hilter’s military headquarters in East Prussia. In 1945, he surrendered to the Allies and was imprisoned alongside other Nazi war criminals. At the “de-nazification” hearings, Kiss was initially classified a “major offender,” but he pleaded for and won the lesser status of “fellow traveler”—on account of his archaeological research. He remained committed to his Atlantis-Tiwanaku thesis until his death in 1960.
Here, Now.
Like Kiss, Díaz and Posnansky also died long ago—and their fantastic interpretations of Tiwanaku have since been thoroughly discredited. Nonetheless, their legacy lives on. Popular television series like Ancient Aliens and Secrets of the Dead continue to explore the Tiwanaku-Atlantis connection. Bestselling books by Erich von Däniken and Graham Hancock go further, attributing the construction of Tiwanaku to ancient extraterrestrial beings.
Though it may be hard to stomach, the survival of the Atlantis myth is certainly not surprising. Plato’s Lost City has proven both timeless and universal in the western imagination. Its timelessness lies in its capacity to reveal the mysteries of human origins; its universal appeal, in its unlimited imaginary potential. And lest we forget: the legend of Atlantis evolved alongside dangerous theories of race that reinforced white supremacy for Aryan nationalists and Bolivian creoles alike. Attributing the construction of Tiwanaku to ancient extraterrestrial beings only perpetuates this nefarious myth. When we wonder if Tiwanaku was built by Atlanteans or by Aliens, those assumptions are based on the same twisted logic that drove men like Díaz, Posnansky, and Kiss: that Andean peoples could not have built Tiwanaku.
And that’s the greatest myth of all.


examples where the address is the link to the property record
Showing some options, but also asking a lot of questions (user, how we have stuff stored, technology). Need to add more real world examples of how buildings/sub buildings are organised and how we have stored the titles, and ho wthey can/cannot be linked
Also see search results - tenure is hyperlink
one title per address
one title per address
-
5 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP724501 -
6 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP704400-
Flat 1, 6 Mandela Way, Southampton, SO15 5RZ
Leasehold title, HP725748 -
Flat 2, 6 Mandela Way, Southampton, SO15 5RZ
Leasehold title, HP725749
-
-
7 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP726948 -
8 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP725454
one title per address
- link per address becasue 1 title per address - link to 'about this property record'
- result organised by address - numeric, (containing building first), then sub building
multiple titles at an address
page per property address
-
5 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP724501 -
6 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP704400Leasehold title, HP725748 -
7 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP704400Leasehold title, HP725749
- page per property address
- could be new page for all links.
- could be: if only one title, goes to about this property (title). If multiple title goes to new page (where multi titles explained)
opt 2
-
5 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP724501 -
Flat 1, 6 Mandela Way, Southampton, SO15 5RZ
-
Flat 2, 6 Mandela Way, Southampton, SO15 5RZ
-
7 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP726948
notes
- page per property address
- As opt 1, but where multi title is a link, goes direct to page per title
opt 3
-
5 Mandela Way, Southampton, SO15 5RZ
-
6 Mandela Way, Southampton, SO15 5RZ
-
7 Mandela Way, Southampton, SO15 5RZ
-
8 Mandela Way, Southampton, SO15 5RZ
notes
- behaviour opt 2, but different styling
opt 4
-
5 Mandela Way, Southampton, SO15 5RZ
Freehold title -
Flat 1, 6 Mandela Way, Southampton, SO15 5RZ
Freehold & Leasehold titles -
Flat 2, 6 Mandela Way, Southampton, SO15 5RZ
2 property titles at this address: Freehold & Leasehold -
7 Mandela Way, Southampton, SO15 5RZ
Freehold title, HP726948
notes
- page per property address
- if multi titles, new page when follow address link


regrid.py¶
Script to change the grid to have different resolutions at different depths.
-
regrid.
init_regrid
(self)¶ Used in firn_density_spin for the initial regridding.
-
regrid.
init_regrid22
(self)¶ Splits the column in 5 grids: grid1(high res)-grid2(low res)-grid22(v. low res)-grid23(low res)-grid3(high res) Used in firn_density_spin for the initial regridding.
-
regrid.
regrid
(self)¶ Called in both firn_density_spin and firn_density_nospin
There are 3 subgrids in the regrid module. Grid 1 is the high resolution grid near the surface. Grid 2 is the lower resolution grid at greater depths; a user-defined number of nodes (self.c[‘nodestocombine’]; refer as NTC here) are combined occasionally (every NTC time steps) to make one new node within grid 2. Grid 3 is at the bottom and has split up one grid 2 node back into a high-resolution grid (1 node into NTC nodes), which can be removed at each time step to keep the model Lagrangian.
the variable gridtrack keeps track of which subgrid each node is in.
-
regrid.
regrid22
(self)¶ Called in both firn_density_spin and firn_density_nospin 5 grids:
grid1 -> high resolution determined by accumulation events grid2 -> low resolution by merging the batch of lowest nodestocombine layers of grid 1 grid22 -> very low resolution by merging the batch of lowest multnodestocombine layers of grid 2 grid23 -> low resolution by splitting the lowest layer of grid22 in multnodestocombine thinner layers New layer of grid23 is formed only when their stock is empty grid3 -> high resolution by splitting the lowest layer of grid23 in nodestocombine layers
gridtrack keeps track of which grid each layer is in
-
regrid.
regrid22_reciprocal
(self)¶ Reciprocal of regrid22: must be called if we accumulate too many grid3 nodes because of heavy melting of surface nodes (problematic in ablation area) -> merge k batches of n1 grid3 nodes into k grid23 nodes (k is maximum nb of batches of n1 grid3 nodes available) if nb of layers in grid2 is <k:
-> calculate the nb of supplementary grid2 layers required -> calculate xx: the number of grid22 layers that must be split to provide the supplementary grid2 layers -> merge xx batches of n2 grid23 layers into xx grid22 layer -> divide xx grid22 layers into xx*n2 grid2 layers
-> divide k grid2 layer into n1 grid1 layer
- 5 grids:
grid1 -> high resolution determined by accumulation events grid2 -> low resolution grid22 -> very low resolution grid23 -> low resolution grid3 -> high resolution
gridtrack keeps track of which grid each layer is in


Polygon Encoder
问题描述 :
Imagine an infinite table with rows and columns numbered using the natural numbers. The following figure shows a procedure to traverse such a table assigning a consecutive natural number to each table cell:
This enumeration of cells can be used to represent complex data types using natural numbers:
-
A pair of natural numbers (i, j) is represented by the number corresponding to the cell in row i and column j. For instance, the pair (3, 2) is represented by the natural number 17; this fact is noted by P2(3, 2) = 17.
-
The pair representation can be used to represent n-tuples. A triplet (a, b, c) is represented by P2(a, P2(b, c)). A 4-tuple (a, b, c, d) is represented by P2(a, P2(b, P2(c, d))). This procedure can be generalized for an arbitrary n:
Pn(a1, …, an) = P2(a1, Pn−1(a2, …, an)),
where Pn denotes the n-tuple representation function, n ≥ 2. For example P3(2, 0, 1) = 12.
-
A list of arbitrary length ‹a1, …, an› is represented by
L(‹a1, …, an›) = P2(n, Pn(a1, …, an)).
For example, L(‹0, 1›) = 12.
The Association of Convex Makers (ACM) uses this clever enumeration scheme in a polygon representation system. The system can represent a polygon, defined by integer coordinates, using a natural number as follows: given a polygon defined by a vertex sequence ‹(x1, y1), …, (xn, yn)› assign the natural number:
L(‹P2(x1, y1), …, P2(xn, yn)›).
ACM needs a program that, given a natural numbers that represents a polygon, calculates the area of the polygon. It is guaranteed that the given polygon is a simple one, i.e. its sides do not intersect.
As an example of the problem, the triangle with vertices at (1,1)
, (2,0)
and (0,0)
is codified with the number 2141
. The area of this triangle is 1
.
输入:
The input consists of several test cases. Each test case is given in a single line of the input by a natural number representing a polygon. The end of the test cases is indicated with *
.
输出:
One line per test case, preserving the input order. Each output line contains a decimal number telling the area of the corresponding encoded polygon. Areas must be printed with 1 decimal place, truncating less significative decimal places.
样例输入:
2141<PHONE_NUMBER>30 *
样例输出:
1.0 0.5 1.0
解题代码:
/* @author: */ import java.math.BigInteger; import java.util.*; public class Main { public static BigInteger get( BigInteger h ) { BigInteger s = h.shiftLeft(1); BigInteger a = BigInteger.ONE.shiftLeft( s.bitLength()/2-1 ).subtract( BigInteger.ONE ); BigInteger b = BigInteger.ONE.shiftLeft( s.bitLength()/2+1 ), c; while( a.add(BigInteger.ONE).compareTo(b) < 0 ) { c = a.add( b ).shiftRight(1); if( c.multiply( c.add(BigInteger.ONE)).compareTo( s ) <=0 ) a = c; else b = c; } return a; } public static BigInteger X, Y; public static void Get( BigInteger s ) { BigInteger t = get( s ); Y = s.subtract( t.multiply(t.add(BigInteger.ONE)).shiftRight(1) ); X = t.subtract( Y ); } public static void main(String args[]) { Scanner cin = new Scanner(System.in); String s; while( true ) { s = cin.next(); if( s.equals( "*" ) ) break; BigInteger a = new BigInteger( s ), t = BigInteger.ONE, h = BigInteger.ONE, sum = BigInteger.ZERO, x =BigInteger.ONE, y=BigInteger.ONE, xt=BigInteger.ONE, yt=BigInteger.ONE, x0 = BigInteger.ONE, y0=BigInteger.ONE; Get( a ); t = X; h = Y; //System.out.println( X+","+Y ); //if(X==t)continue; int n = t.intValue(); for( int i=0; i< n; i++ ) { a = h; if( i < n-1 ) { Get( a ); t = X; h = Y; } else t = a; Get( t ); x = X; y = Y; if( i == 0 ) { x0 = x; y0 = y; } else { sum = sum.add( x.multiply(yt).subtract( y.multiply(xt) )); } xt = x; yt = y; //System.out.println( x + "," + y ); } sum = sum.add( x0.multiply(yt).subtract( y0.multiply(xt) )); sum = sum.abs(); System.out.print( sum.shiftRight(1) ); if( sum.equals(sum.shiftRight(1).shiftLeft(1))) System.out.println( ".0" ); else System.out.println( ".5"); } return; } }
妈呀！这个Dijkstra模板好长OwQ！
I go through some of your put up and I uncovered a good deal of expertise from it. Many thanks for posting this sort of exciting posts
很强大啊，佩服
分三种情况讨论。Not Possible就是impossible
太好了，收藏
分析的很专业！
较好的写法是 start+(end-start)/2
楼主 为什么输入的形式都不对 题目是不是弄错了？
是穷举，但是代码有优化（v数组），并不是2^n。测试数据应该没问题，之前有超时的代码。
处凡愚而不减，在圣贤而不增；
住烦恼而不乱，居禅定而不寂。
Excellent Web-site! I required to ask if I might webpages and use a component of the net web website and use a number of factors for just about any faculty process. Please notify me through email regardless of whether that would be excellent. Many thanks
这个还不错


jQuery - Easy ticker - ReadMe
Jquery easy ticker is a news ticker like plugin, which scrolls the list infinitely. It is highly customizable with lot of features and it is cross browser supported.
- Usage, Documentation and Demo : See here
Details
Requirements
Demo
jquery.js is not present. You must install jQuery in this folder for the demo to work.
- List 1
- List 2
- List 3
- List 4
- List 5
For more demos, check the official homepage.
Change Log
Contact Author


@* * Copyright 2010-2013 Artima, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import controllers.Application.latestScaladocFor192 @userGuidePage("Sharing fixtures") {
A test fixture is composed of the objects and other artifacts (files, sockets, database
connections, etc.) tests use to do their work.
When multiple tests need to work with the same fixtures, it is important to try and avoid
duplicating the fixture code across those tests. The more code duplication you have in your
tests, the greater drag the tests will have on refactoring the actual production code.
ScalaTest recommends several techniques to eliminate such code duplication, and provides several
traits to help. Each technique is geared towards helping you reduce code duplication without introducing
instance var
s, shared mutable objects, or other dependencies between tests. Eliminating shared
mutable state across tests will make your test code easier to reason about and more amenable for parallel
test execution.
The following sections describe these techniques, including explaining the recommended usage for each. But first, here's a table summarizing the options:
| Technique | Recommended uses |
|---|---|
| get-fixture methods | Use when you need the same mutable fixture objects in multiple tests, and don't need to clean up after. |
| fixture-context objects | Use when you need different combinations of mutable fixture objects in different tests, and don't need to clean up after. |
OneInstancePerTest | Use when porting JUnit tests to ScalaTest, or if you prefer JUnit's approach to test isolation: running each test in its own instance of the test class. |
withFixture(NoArgTest) | Use when you need to perform side effects at the beginning and end of all or most tests, or want to stack traits that perform such side-effects. |
| loan-fixture methods | Use when different tests need different fixtures that must be cleaned up afterwords. |
withFixture(OneArgTest) | Use when all or most tests need the same fixtures that must be cleaned up afterwords. |
BeforeAndAfter | Use when you need to perform the same side-effects before and/or after tests, rather than at the beginning or end of tests. |
BeforeAndAfterEach | Use when you want to stack traits that perform the same side-effects before and/or after tests, rather than at the beginning or end of tests. |
Note: Although the techniques described on this page are shown with FlatSpec
examples, the techniques can be used in exactly
the same way with any style trait. The Scaladoc for each style trait gives corresponding examples for the other style traits.
If you need to create the same mutable fixture objects in multiple tests, and don't need to clean them up after using them, the simplest approach is to write one or more get-fixture methods. A get-fixture method returns a new instance of a needed fixture object (or an holder object containing multiple fixture objects) each time it is called. You can call a get-fixture method at the beginning of each test that needs the fixture, storing the returned object or objects in local variables. Here's an example:
package org.scalatest.examples.flatspec.getfixture
import org.scalatest.FlatSpec import collection.mutable.ListBuffer
class ExampleSpec extends FlatSpec {
def fixture = new { val builder = new StringBuilder("ScalaTest is ") val buffer = new ListBuffer[String] }
"Testing" should "be easy" in { val f = fixture f.builder.append("easy!") assert(f.builder.toString === "ScalaTest is easy!") assert(f.buffer.isEmpty) f.buffer += "sweet" }
it should "be fun" in { val f = fixture f.builder.append("fun!") assert(f.builder.toString === "ScalaTest is fun!") assert(f.buffer.isEmpty) } }
The “f.
” in front of each use of a fixture object provides a visual indication of which objects
are part of the fixture, but if you prefer, you can import the the members with “import f._
” and use the names directly.
If you need to configure fixture objects differently in different tests, you can pass configuration into the get-fixture method. For example, if you could pass in an initial value for a mutable fixture object as a parameter to the get-fixture method.
A alternate technique that is especially useful when different tests need different combinations of fixture objects is to define the fixture objects as instance variables of fixture-context objects whose instantiation forms the body of tests. Like get-fixture methods, fixture-context objects are anly appropriate if you don't need to clean up the fixtures after using them.
To use this technique, you define instance variables intialized with fixture objects in traits and/or classes, then in each test instantiate an object that contains just the fixture objects needed by the test. Keep in mind that traits allow you to mix together just the fixture objects needed by each test, whereas classes allow you to pass data in via a constructor to configure the fixture objects. Here's an example in which fixture objects are partitioned into two traits and each test just mixes together the traits it needs:
package org.scalatest.examples.flatspec.fixturecontext
import collection.mutable.ListBuffer import org.scalatest.FlatSpec
class ExampleSpec extends FlatSpec {
trait Builder { val builder = new StringBuilder("ScalaTest is ") }
trait Buffer { val buffer = ListBuffer("ScalaTest", "is") }
// This test needs the StringBuilder fixture "Testing" should "be productive" in new Builder { builder.append("productive!") assert(builder.toString === "ScalaTest is productive!") }
// This test needs the ListBuffer[String] fixture "Test code" should "be readable" in new Buffer { buffer += ("readable!") assert(buffer === List("ScalaTest", "is", "readable!")) }
// This test needs both the StringBuilder and ListBuffer it should "be clear and concise" in new Builder with Buffer { builder.append("clear!") buffer += ("concise!") assert(builder.toString === "ScalaTest is clear!") assert(buffer === List("ScalaTest", "is", "concise!")) } }
OneInstancePerTest
If every test requires the same set of
mutable fixture objects, and none require cleanup, one other approach you can take is make them simply val
s and mix in trait
OneInstancePerTest
. If you mix in OneInstancePerTest
, each test
will be run in its own instance of the Suite
, similar to the way JUnit tests are executed. Here's an example:
package org.scalatest.examples.flatspec.oneinstancepertest
import org.scalatest._ import collection.mutable.ListBuffer
class ExampleSuite extends FlatSpec with OneInstancePerTest {
val builder = new StringBuilder("ScalaTest is ") val buffer = new ListBuffer[String]
"Testing" should "be easy" in { builder.append("easy!") assert(builder.toString === "ScalaTest is easy!") assert(buffer.isEmpty) buffer += "sweet" }
it should "be fun" in { builder.append("fun!") assert(builder.toString === "ScalaTest is fun!") assert(buffer.isEmpty) } }
One way to think of OneInstancePerTest
is that the entire Suite
instance is like a fixture-context object,
but with the difference that the test code doesn't run during construction as it does with the real fixture-context object technique. Because this trait emulates JUnit's manner
of running tests, this trait can be helpful when porting JUnit tests to ScalaTest. The primary intended use of OneInstancePerTest
is to serve as a supertrait for
ParallelTestExecution
and the path traits, but you can also mix it in
directly to help you port JUnit tests to ScalaTest or if you prefer JUnit's approach to test isolation.
withFixture(NoArgTest)
Although the get-fixture method, fixture-context object, and OneInstancePerTest
approaches take care of setting up a fixture at the beginning of each
test, they don't address the problem of cleaning up a fixture at the end of the test. If you just need to perform a side-effect at the beginning or end of
a test, and don't need to actually pass any fixture objects into the test, you can override withFixture(NoArgTest)
, one of ScalaTest's
lifecycle methods defined in trait AbstractSuite
.
Trait Suite
's implementation of runTest
passes a no-arg test function to withFixture(NoArgTest)
. It is withFixture
's
responsibility to invoke that test function. Suite
's implementation of withFixture
simply
invokes the function, like this:
// Default implementation in trait Suite protected def withFixture(test: NoArgTest) { test() }
You can, therefore, override withFixture
to perform setup before and/or cleanup after invoking the test function. If
you have cleanup to perform, you should invoke the test function inside a try
block and perform the cleanup in
a finally
clause, because the exception that causes a test to fail will propagate through withFixture
back
to runTest
. (In other words, if the test fails, the test function invoked by withFixture
will throw an exception.)
The withFixture
method is designed to be stacked, and to enable this, you should always call the super
implementation
of withFixture
, and let it invoke the test function rather than invoking the test function directly. In other words, instead of writing
“test()
”, you should write “super.withFixture(test)
”, like this:
// Your implementation override def withFixture(test: NoArgTest) { // Perform setup try { super.withFixture(test) // Invoke the test function } finally { // Perform cleanup } }
Here's an example in which withFixture(NoArgTest)
is used to take a snapshot of the working directory if a test fails, and
and send that information to the reporter:
package org.scalatest.examples.flatspec.noargtest
import java.io.File import org.scalatest.FlatSpec
class ExampleSpec extends FlatSpec {
override def withFixture(test: NoArgTest) {
try super.withFixture(test) catch { case e: Exception => val currDir = new File(".") val fileNames = currDir.list() info("Dir snapshot: " + fileNames.mkString(", ")) throw e } }
"This test" should "succeed" in { assert(1 + 1 === 2) }
it should "fail" in { assert(1 + 1 === 3) } }
Running this version of ExampleSuite
in the interpreter in a directory with two files, hello.txt
and world.txt
would give the following output:
scala> new ExampleSuite execute
ExampleSuite:
This test
- should succeed
- should fail *** FAILED ***
2 did not equal 3 (<console>:33)
+ Dir snapshot: hello.txt, world.txt
Note that the NoArgTest
passed to withFixture
, in addition to
an apply
method that executes the test, also includes the test name and the config
map passed to runTest
. Thus you can also use the test name and configuration objects in your withFixture
implementation.
If you need to both pass a fixture object into a test and and perform cleanup at the end of the test, you'll need to use the loan pattern. If different tests need different fixtures that require cleanup, you can implement the loan pattern directly by writing loan-fixture methods. A loan-fixture method takes a function whose body forms part or all of a test's code. It creates a fixture, passes it to the test code by invoking the function, then cleans up the fixture after the function returns.
The following example shows three tests that use two fixtures, a database and a file. Both require cleanup after, so each is provided via a
loan-fixture method. (In this example, the database is simulated with a StringBuffer
.)
package org.scalatest.examples.flatspec.loanfixture
import java.util.concurrent.ConcurrentHashMap
object DbServer { // Simulating a database server type Db = StringBuffer private val databases = new ConcurrentHashMap[String, Db] def createDb(name: String): Db = { val db = new StringBuffer databases.put(name, db) db } def removeDb(name: String) { databases.remove(name) } }
import org.scalatest.FlatSpec import DbServer._ import java.util.UUID.randomUUID import java.io._
class ExampleSpec extends FlatSpec {
def withDatabase(testCode: Db => Any) { val dbName = randomUUID.toString val db = createDb(dbName) // create the fixture try { db.append("ScalaTest is ") // perform setup testCode(db) // "loan" the fixture to the test } finally removeDb(dbName) // clean up the fixture }
def withFile(testCode: (File, FileWriter) => Any) { val file = File.createTempFile("hello", "world") // create the fixture val writer = new FileWriter(file) try { writer.write("ScalaTest is ") // set up the fixture testCode(file, writer) // "loan" the fixture to the test } finally writer.close() // clean up the fixture }
// This test needs the file fixture "Testing" should "be productive" in withFile { (file, writer) => writer.write("productive!") writer.flush() assert(file.length === 24) }
// This test needs the database fixture "Test code" should "be readable" in withDatabase { db => db.append("readable!") assert(db.toString === "ScalaTest is readable!") }
// This test needs both the file and the database it should "be clear and concise" in withDatabase { db => withFile { (file, writer) => // loan-fixture methods compose db.append("clear!") writer.write("concise!") writer.flush() assert(db.toString === "ScalaTest is clear!") assert(file.length === 21) } } }
As demonstrated by the last test, loan-fixture methods compose. Not only do loan-fixture methods allow you to give each test the fixture it needs, they allow you to give a test multiple fixtures and clean everything up afterwords.
Also demonstrated in this example is the technique of giving each test its own "fixture sandbox" to play in. When your fixtures involve external side-effects, like creating files or databases, it is a good idea to give each file or database a unique name as is done in this example. This keeps tests completely isolated, allowing you to run them in parallel if desired.
withFixture(OneArgTest)
If all or most tests need the same fixture, you can avoid some of the boilerplate of the loan-fixture method approach by using a fixture.Suite
and overriding withFixture(OneArgTest)
.
Each test in a fixture.Suite
takes a fixture as a parameter, allowing you to pass the fixture into
the test. You must indicate the type of the fixture parameter by specifying FixtureParam
, and implement a
withFixture
method that takes a OneArgTest
. This withFixture
method is responsible for
invoking the one-arg test function, so you can perform fixture set up before, and clean up after, invoking and passing
the fixture into the test function.
To enable the stacking of traits that define withFixture(NoArgTest)
, it is a good idea to let
withFixture(NoArgTest)
invoke the test function instead of invoking the test
function directly. To do so, you'll need to convert the OneArgTest
to a NoArgTest
. You can do that by passing
the fixture object to the toNoArgTest
method of OneArgTest
. In other words, instead of
writing “test(theFixture)
”, you'd delegate responsibility for
invoking the test function to the withFixture(NoArgTest)
method of the same instance by writing:
withFixture(test.toNoArgTest(theFixture))
Here's a complete example:
package org.scalatest.examples.flatspec.oneargtest
import org.scalatest.fixture import java.io._
class ExampleSpec extends fixture.FlatSpec {
case class F(file: File, writer: FileWriter) type FixtureParam = F
def withFixture(test: OneArgTest) { val file = File.createTempFile("hello", "world") // create the fixture val writer = new FileWriter(file) try { writer.write("ScalaTest is ") // set up the fixture withFixture(test.toNoArgTest(F(file, writer))) // "loan" the fixture to the test } finally writer.close() // clean up the fixture }
"Testing" should "be easy" in { f => f.writer.write("easy!") f.writer.flush() assert(f.file.length === 18) }
it should "be fun" in { f => f.writer.write("fun!") f.writer.flush() assert(f.file.length === 17) } }
In this example, the tests actually required two fixture objects, a File
and a FileWriter
. In such situations you can
simply define the FixtureParam
type to be a tuple containing the objects, or as is done in this example, a case class containing
the objects. For more information on the withFixture(OneArgTest)
technique, see the documentation for fixture.Suite
.
BeforeAndAfter
In all the shared fixture examples shown so far, the activities of creating, setting up, and cleaning up the fixture objects have been
performed during the test. This means that if an exception occurs during any of these activities, it will be reported as a test failure.
Sometimes, however, you may want setup to happen before the test starts, and cleanup after the test has completed, so that if an
exception occurs during setup or cleanup, the entire suite aborts and no more tests are attempted. The simplest way to accomplish this in ScalaTest is
to mix in trait BeforeAndAfter
. With this trait you can denote a bit of code to run before each test
with before
and/or after each test each test with after
, like this:
package org.scalatest.examples.flatspec.beforeandafter
import org.scalatest._ import collection.mutable.ListBuffer
class ExampleSpec extends FlatSpec with BeforeAndAfter {
val builder = new StringBuilder val buffer = new ListBuffer[String]
before { builder.append("ScalaTest is ") }
after { builder.clear() buffer.clear() }
"Testing" should "be easy" in { builder.append("easy!") assert(builder.toString === "ScalaTest is easy!") assert(buffer.isEmpty) buffer += "sweet" }
it should "be fun" in { builder.append("fun!") assert(builder.toString === "ScalaTest is fun!") assert(buffer.isEmpty) } }
Note that the only way before
and after
code can communicate with test code is via some side-effecting mechanism, commonly by
reassigning instance var
s or by changing the state of mutable objects held from instance val
s (as in this example). If using
instance var
s or mutable objects held from instance val
s you wouldn't be able to run tests in parallel in the same instance
of the test class unless you synchronized access to the shared, mutable state. This is why ScalaTest's ParallelTestExecution
trait extends
OneInstancePerTest
. By running each test in its own instance of the class, each test has its own copy of the instance variables, so you
don't need to synchronize. If you mixed ParallelTestExecution
into the ExampleSuite
above, the tests would run in parallel just fine
without any synchronization needed on the mutable StringBuilder
and ListBuffer[String]
objects.
Although BeforeAndAfter
provides a minimal-boilerplate way to execute code before and after tests, it isn't designed to enable stackable
traits, because the order of execution would be non-obvious. If you want to factor out before and after code that is common to multiple test suites, you
should use trait BeforeAndAfterEach
instead, as shown later in the next section,
composing fixtures by stacking traits.
In larger projects, teams often end up with several different fixtures that test classes need in different combinations,
and possibly initialized (and cleaned up) in different orders. A good way to accomplish this in ScalaTest is to factor the individual
fixtures into traits that can be composed using the stackable trait pattern. This can be done, for example, by placing
withFixture
methods in several traits, each of which call super.withFixture
. Here's an example in
which the StringBuilder
and ListBuffer[String]
fixtures used in the previous examples have been
factored out into two stackable fixture traits named Builder
and Buffer
:
package org.scalatest.examples.flatspec.composingwithfixture
import org.scalatest._ import collection.mutable.ListBuffer
trait Builder extends AbstractSuite { this: Suite =>
val builder = new StringBuilder
abstract override def withFixture(test: NoArgTest) { builder.append("ScalaTest is ") try super.withFixture(test) // To be stackable, must call super.withFixture finally builder.clear() } }
trait Buffer extends AbstractSuite { this: Suite =>
val buffer = new ListBuffer[String]
abstract override def withFixture(test: NoArgTest) { try super.withFixture(test) // To be stackable, must call super.withFixture finally buffer.clear() } }
class ExampleSpec extends FlatSpec with Builder with Buffer {
"Testing" should "be easy" in { builder.append("easy!") assert(builder.toString === "ScalaTest is easy!") assert(buffer.isEmpty) buffer += "sweet" }
it should "be fun" in { builder.append("fun!") assert(builder.toString === "ScalaTest is fun!") assert(buffer.isEmpty) buffer += "clear" } }
By mixing in both the Builder
and Buffer
traits, ExampleSuite
gets both fixtures, which will be
initialized before each test and cleaned up after. The order the traits are mixed together determines the order of execution.
In this case, Builder
is "super" to Buffer. If you wanted Buffer
to be "super"
to Builder
, you need only switch the order you mix them together, like this:
class Example2Suite extends Suite with Buffer with Builder
And if you only need one fixture you mix in only that trait:
class Example3Suite extends Suite with Builder
Another way to create stackable fixture traits is by extending the BeforeAndAfterEach
and/or BeforeAndAfterAll
traits.
BeforeAndAfterEach
has a beforeEach
method that will be run before each test (like JUnit's setUp
),
and an afterEach
method that will be run after (like JUnit's tearDown
).
Similarly, BeforeAndAfterAll
has a beforeAll
method that will be run before all tests,
and an afterAll
method that will be run after all tests. Here's what the previously shown example would look like if it
were rewritten to use the BeforeAndAfterEach
methods instead of withFixture
:
package org.scalatest.examples.flatspec.composingbeforeandaftereach
import org.scalatest._ import collection.mutable.ListBuffer
trait Builder extends BeforeAndAfterEach { this: Suite =>
val builder = new StringBuilder
override def beforeEach() { builder.append("ScalaTest is ") super.beforeEach() // To be stackable, must call super.beforeEach }
override def afterEach() { try super.afterEach() // To be stackable, must call super.afterEach finally builder.clear() } }
trait Buffer extends BeforeAndAfterEach { this: Suite =>
val buffer = new ListBuffer[String]
override def afterEach() { try super.afterEach() // To be stackable, must call super.afterEach finally buffer.clear() } }
class ExampleSpec extends FlatSpec with Builder with Buffer {
"Testing" should "be easy" in { builder.append("easy!") assert(builder.toString === "ScalaTest is easy!") assert(buffer.isEmpty) buffer += "sweet" }
it should "be fun" in { builder.append("fun!") assert(builder.toString === "ScalaTest is fun!") assert(buffer.isEmpty) buffer += "clear" } }
To get the same ordering as withFixture
, place your super.beforeEach
call at the end of each
beforeEach
method, and the super.afterEach
call at the beginning of each afterEach
method, as shown in the previous example. It is a good idea to invoke super.afterEach
in a try
block and perform cleanup in a finally
clause, as shown in the previous example, because this ensures the
cleanup code is performed even if super.afterEach
throws an exception.
The difference between stacking traits that extend BeforeAndAfterEach
versus traits that implement withFixture
is
that setup and cleanup code happens before and after the test in BeforeAndAfterEach
, but at the beginning and
end of the test in withFixture
. Thus if a withFixture
method completes abruptly with an exception, it is
considered a failed test. By contrast, if any of the beforeEach
or afterEach
methods of BeforeAndAfterEach
complete abruptly, it is considered a failed suite, which will result in a SuiteAborted
event.
Next, learn about sharing tests.


Dynamic Select Statements
Select Continent
Select a Continent
North America
South America
Asia
Europe
Pick A Number:
1
2
3
Pick A Number:
1
2
3


Jo Cook, Metadata Lead Consultant, Astun Technology
Astun's Role
We're responsible for setting up the new SSDI catalogue, importing existing records, providing training, customising the interface, and liaising with core developers to provide bug fixes and enhancements.
Today's Training Aims
To provide an overview of the new interface and documentation
To give an update on Metadata Standards and how they are handled in the new catalogue
To give a guided walk-through for creating a new record from scratch and validating it
To give a demonstration of the publication process
To answer any questions you might have about the new catalogue
The new catalogue has the capability to support multiple metadata standards. Gemini 2.2 is now a self-contained standard, separate from ISO19139, and Gemini 2.3 will be a separate standard again within the portal
Standards Enforcement
Metadata Standard Name and Version were dropped from Gemini 2.2 (*) but here are added to all records to help with identification
* They are present in ISO19115/19139 so this approach is allowed in Gemini
Standards Enforcement ctd
Consistency of namespaces and root elements is enforced throughout the catalogue
Imported or harvested records must be post-processed to ensure compliance
See Annex 3 in the User Guidance for further information
Find section on "Adding Discover Metadata to the SSDI"
Save and Validate as you go!
But not just yet...
Validation overview
Gemini metadata is validated against 4 rulesets or schematrons and also checks for basic XML validity
Associated Resources Wizard
New feature for adding Coupled Resources (linking datasets to services) and Online Resource Locators (URL giving access to, or information about the data)
Viewing records on the map
If an online resource locator is added that points to a valid WMS layer, then this can be added directly to the map using Add to Map
For services, ignore the Add to Map button and add the GetCapabilities URL directly to the Map Add Layer interface, then choose the appropriate layer


Pizza Scroll
Ingredients:
1 Cup Greek Yoghurt
1 ½ cups Self-Rasing Flour
½ Cup Tomato Paste
1 Cup Cheese, Grated
50g Bacon, Diced
1 Tsp Italian Herbs & Spices Blend
Print
Yield:
15
Preparation:
15 minutes
Cook Time:
20 minutes
Total Time:
40 minutes
Conversion
Modal title
×
Conversion
Metric Cups
Milliliters
Tablespoons
8 cups
1895 ml
128 Tbs
4 Cups
960 ml
64 Tbs
1 Cup
250 ml
16 Tbs
¾ Cup
177 ml
12 Tbs
⅔ Cup
158 ml
11 Tbs
½ Cup
118 ml
8 Tbs
⅓ Cup
79 ml
5.5 Tbs
¼ Cup
59 ml
4 Tbs
°C
°F
150°C
300°F
160°C
326°F
180°C
350°F
190°C
375°F
200°C
400°F
220°C
425°F
230°C
450°F
Method:
Line baking tray, preheat oven to 190°C.

Turn onto floured bench and knead for 5 minutes. Add extra Flour if the dough is too stickey.
Roll the dough into a large rectangle of even thickness, using a rolling pin.
Spread Tomato Paste evenly over the entire dough surface.
Sprinkle Bacon and ¾ cup Cheese over the Tomato Paste. Sprinkle Herbs on top.
Roll the dough into a log, starting from one end cut into 2cm slices.
Place side up on tray and sprinkle with leftover Cheese.
Bake for 15-20 minutes, Leave to cool.
Click On The Number Below To Change How Long The Timer Goes For.
15
0
MINUTES
0
SECONDS
Tips:


Thank you so much for your coffee ❤
{{code1}}
{{code2}}
| Name | Type | Default value | Description |
|---|---|---|---|
|
disabled
|
boolean | null |
If true, the picker is readonly and can't be modified |
|
showSpinners
|
boolean | true |
If true, the spinners above and below input are visible |
|
showSeconds
|
boolean | true |
If true, it is not possible to select seconds |
|
disableMinute
|
boolean | false |
If true, the minute is readonly |
|
defaultTime
|
Array | undefined |
An array [hour, minute, second] for default time when the date is not yet defined |
|
stepHour
|
number | 1 |
The number of hours to add/substract when clicking hour spinners |
|
stepMinute
|
number | 1 |
The number of minutes to add/substract when clicking minute spinners |
|
stepSecond
|
number | 1 |
The number of seconds to add/substract when clicking second spinners |
|
color
|
ThemePalette | undefined |
Color palette to use on the datepicker's calendar |
|
enableMeridian
|
boolean | false |
Whether to display 12H or 24H mode |
|
hideTime
|
boolean | false |
If true, the time is hidden |
|
touchUi
|
boolean | false |
Whether the calendar UI is in touch mode. In touch mode the calendar opens in a dialog rather than a popup and elements have more padding to allow for bigger touch targets. |
The datepicker was built to be date implementation agnostic. This means that it can be made to work with a variety of different date implementations. However it also means that developers need to make sure to provide the appropriate pieces for the datepicker to work with their chosen implementation.
The easiest way to ensure this is to import one of the provided date modules:
| NgxMatNativeDateModule | NgxMatMomentModule | |
|---|---|---|
| Date type | Date | Moment |
| Dependencies | None | Moment.js |
| Import from | @angular-material-components/datetime-picker | @angular-material-components/moment-adapter |
{{code4}}
Please note: NgxMatNativeDateModule is based off the functionality available in JavaScript's native Date object. Thus it is not suitable for many locales. One of the biggest shortcomings of the native Date object is the inability to set the parse format.
We highly recommend using the NgxMatMomentModule or a custom NgxMatDateAdapter that works with the formatting/parsing library of your choice.
For example: Creating a custom date adapter{{code5}}
Creating a custom date adapter module
{{code6}}
You can also customize the date format by providing your custom NGX_MAT_DATE_FORMATS in your
module.
{{code7}}
{{code9}}
{{code10}}
@see @angular/material Using a pre-built theme
Add the Material Design icon font to your index.html
{{code8}}
{{code3}}
{{code9}}
{{code10}}


This is the start of the Linux Blacklist! (Idea started by one of the jerks of Linux Game Cast) I will build out a better system later, but for now this will have to do. Tweet suggestions to @LinuxBlacklist or email them to<EMAIL_ADDRESS>Blacklist for developers:
(For your blacklist)
(Check 'em out)
(Give them all your money)


Book Monster
Query
Catastrophe: Europe Goes to War 1914
Hastings, Sir Max
ISBN
9780007519743
Theme
Science Fiction & Fantasy
Imprint
Brand Name
Price (RRP)
£9.99
Publication Date
15 June 2014
Buy this book
Toggle Dropdown
Buy from Amazon.co.uk
Buy from Waterstones
Buy from Blackwells
The author was Zadie something with a girl on the cover
← Back to results


Brexit donor Banks likens Nigel Farage to casino gambler
by ReutersArron Banks, one of the biggest financiers behind the Brexit campaign, said Brexit Party leader Nigel Farage might stand down even more candidates to secure Britain's exit from the European Union.
Banks said Brexit was under threat unless Prime Minister Boris Johnson won a majority in the December 12 election.
Farage said on Monday that he would stand down Brexit Party candidates in 317 Conservative seats.
Banks told Reuters that he thought Farage would also stand down in Labour marginal constituencies, to avoid splitting the pro-Brexit vote.
"The only way Brexit is going to get delivered is by a Boris majority," Banks said. "Nigel reminds me of a gambler at a casino that’s been winning all night and it’s time to take the chips off the table and step away. What we are offering the geezer, as you might say, is Brexit."
In a reference to Labour leader Jeremy Corbyn, Banks said: "There are 48 hours to save Brexit and save the country from a Corbyn government. We need to see further moves to stand down candidates in marginal seats they can’t win and go for the 40 or so Labour seats where the [Conservatives] haven’t got a hope.”
Banks added: "Brexit is under threat."
The businessman's comments were an unusual public admonishment of his close political ally, although he praised Farage’s success in forcing Britain’s Conservatives not to rule out a no-deal Brexit.
"Nigel has remade the Conservative party in his own image, the Conservative party is the Brexit party,” Banks said.


---
layout: null
section-type: about
title: About
---
## About
Hello, I'm Alan Bara. I like to mess with stuff. Been modding games, hacking mobile and Windows games and apps, programming AVRs, and developing Windows, Linux and Android apps. Always looking for a new interesting project.
Some games I used to mod:
-Little Fighter 2
-Lemming Ball Z
-Call of Duty Modern Warfare 2 and Black Ops
-MTA: SA
Guess I can't really tell you what games and apps I hacked


wcps
Home
View Employee
View Employee Claim
Logout
Travel Claim
* Employee ID:
* Basic Pay:
* Place of Departure:
* Mode Of Travel:
Select an Option
Air
Train
Taxi
Bus
Bike
Others(specify)
* Travelling Documents: (Includes: PNR/Air Tickets / Travellings Bills / Others(specify)
* Employee Name:
* Reason of Travel:
* Place of Arrival:
* Total Claim Amount:


Get Started with Juridoc
Already have an account?
Sign in
Next
By signing up, you agree to the
Terms of Use
and
Policy Privacy
© 2018 Juridoc


Customer Support Jobs Latest post about 4 hours ago
- New TaxJar Customer Support Specialist (FT & Weekend)
- New ScheduleOnce Customer Success Manager -USA
- New Vortala Pty Ltd Website Account Manager
- Suiteness, Inc Concierge
- CE Broker Customer Support Specialist
- Switch Themes Casual support assistant / developer
- Rise Vision Customer Support Representative
- Pressable WordPress Customer Success Agent
- Tiller Customer Success Specialist
- Hubstaff Customer Support / QA
- Mystery Science Customer Experience Specialist (PST Hours)
- ModSquad Inc Community Tier2 Tech Support Associate
- Nookal Customer Technical Support - UTC/GMT Only
- Trialfacts New Client Coordinator
- ReCharge Technical Customer Support Engineer
- Tawkify Delight Customers: Matchmaker
- OnTheGoSystems Technical Supporter for WordPress Plugin WPML
- Lugg Lugg Support Associate
- Help Scout Customer Champion - PDT through EDT
- ModSquad Inc Community Tier2 Support Associate
- View all 21 Customer Support jobs →


Creating Group
Editing Group
Enter name for the group:
Name of the group is required!
Students number:
Start date:
Not valid!
Start date is earlier then the currrent date!
End date:
Not valid!
End date must be later than the start date.
Teachers:
{{teacher}}
Added Teachers
{{teacher}}
-
List of teachers is empty!


The Uscore2 project aims to design and test a generic, practical, city-to-city, disaster risk reduction peer review tool for cities across EU member states and beyond via the UNISDR Making Cities Resilient campaign (MCR). The project will involve collaborative work between the municipalities of Salford, Amadora and Viggiano. the University of Manchester, UNISDR, the Department of Communities and Local Government (UK), Portuguese National Authority of Civil Protection and the Associazione di Protezione Civile Gruppo Lucano.
The last decade has seen a rising trend in natural and man-made disasters. EU Civil Protection legislation advocates that Member States share best practice and help each other to identify where additional effort is needed to reduce risks. Practical translation of this includes cities conducting better risk assessment and developing action plans. Beyond the EU, the Sendai Framework for Disaster Risk Reduction (DRR) 2015-2030 , endorsed by the UN General Assembly in June 2015 established seven global targets including to “substantially increase the number of countries with national and local DRR strategies by 2020” and emphasizing the need to empower local governments to reduce disaster risk.
Local governments are closest to citizens and communities, playing a vital role in responding to emergencies and delivering essential services which must be resilient to disasters. To respond to calls to prevent and prepare for disasters, municipalities need better access to policies, tools and rigorous, expert critique. Self-assessment tools are available but are often cumbersome to apply. Peer review of local civil protection mechanisms could offer an independent/ transparent assessment, adding clear value to building local and national resilience. The tool will assist cities with the challenge of strengthening their implementation of disaster risk reduction. Conducting rigorous city-to-city peer reviews is a challenge for practitioners and policy-makers who want to learn from best practice as this has not yet been assembled into an easy to use tool.
Uscore2 follows on from the DG ECHO-funded ‘Urban Scorecard’ (UScore) project which enabled 5 European cities to pilot a self-assessment Disaster Resilience Scorecard to assess city resilience; Amadora in Portugal, Arvika and Jönköping in Sweden and the British cities of Salford and Stoke-on-Trent. Learning from UScore will be formalised into Uscore2 by developing a peer-review tool that will enable self-assessment approaches to be complemented by independent analysis.
The objectives for the city-to-city peer review tool are to:
- ensure that the review tool reflects a comprehensive, all-of-society approach to DRR
- identify data, information and evidence useful when conducting a city-to-city peer review
- aid the implementation of the Sendai Framework at local and therefore national/international levels through alignment to local indicators developed in accordance with the Sendai Framework
- ensure it is useable by cities at all levels of maturity in DRR planning
The peer review tool developed through Uscore2 will be piloted in Viggiano, Salford and Amadora. These three cities have different disaster risk profiles; geographical and demographic characteristics; and statutory and regulatory frameworks. All are role models within the Making Cities Resilient Campaign. The effectiveness of the peer review tool will be evaluated using a methodology developed by the University of Manchester. The tool will be aligned to the indicators for the Sendai Framework and UNISDR MCR enabling on-going assessment of its applicability in reporting local progress against the Sendai Framework.


This tutorial is intended to give an introduction to using Zend Framework 2 by creating a simple database driven application using the Model-View-Controller paradigm. By the end you will have a working ZF2 application and you can then poke around the code to find out more about how it all works and fits together.
This tutorial assumes that you are running at least PHP 5.3.3 with the Apache web server and MySQL, accessible via the PDO extension. Your Apache installation must have the mod_rewrite extension installed and configured.
You must also ensure that Apache is configured to support .htaccess files. This is usually done by changing the setting:
1 | AllowOverride None
|
to
1 | AllowOverride FileInfo
|
in your httpd.conf file. Check with your distribution’s documentation for exact details. You will not be able to navigate to any page other than the home page in this tutorial if you have not configured mod_rewrite and .htaccess usage correctly.
Alternatively, if you are using PHP 5.4+ you may use the built-in web server instead of Apache for development.
The application that we are going to build is a simple inventory system to display which albums we own. The main page will list our collection and allow us to add, edit and delete CDs. We are going to need four pages in our website:
| Page | Description |
|---|---|
| List of albums | This will display the list of albums and provide links to edit and delete them. Also, a link to enable adding new albums will be provided. |
| Add new album | This page will provide a form for adding a new album. |
| Edit album | This page will provide a form for editing an album. |
| Delete album | This page will confirm that we want to delete an album and then delete it. |
We will also need to store our data into a database. We will only need one table with these fields in it:
| Field name | Type | Null? | Notes |
|---|---|---|---|
| id | integer | No | Primary key, auto-increment |
| artist | varchar(100) | No | |
| title | varchar(100) | No |
The source code of this file is hosted on GitHub. Everyone can update and fix errors in this document with few clicks - no downloads needed.


Overview | Reports | Quarter | Contract
| Vendor Name: | AUDREY BRUNEAU |
| Reference number: | K8C13-14-0113 |
| Contract Date: | 2015-02-25 |
| Description of work: | 0430 Scientific services, excluding consultants |
| Contract period: | 2015-03-06 to 2015-04-30 |
| Delivery Date: | |
| Contract Value: | $11,310.00 |
| Comments: | Former Public Servant in receipt of a pension under the Public Service Superannuation Act. |


Boeing tests space crew capsule, reports problem with parachute
WASHINGTON: Boeing's capsule for astronauts underwent its first major flight test Monday (Nov 5), shooting a mile into the air then parachuting back to the New Mexico desert.
The CST-100 Starliner capsule - being developed to ferry astronauts to and from the International Space Station - carried no crew, just a test dummy for the one-and-a-half-minute shakedown of the launch abort system.
Only two of the three main parachutes opened, but both NASA and Boeing said astronauts would have been safe if aboard.
"It's too early to determine why all three main parachutes did not deploy," Boeing spokesman Todd Blecher said. "However, having two of three deploy successfully is acceptable for the test parameters and crew safety."
Blecher said overall the test on Monday morning was successful.
The abort system is designed to provide a fast getaway for a crew, if there is an emergency on the Florida pad or in flight.
Boeing and NASA said they were still targeting Dec 17 for the Starliner's first unpiloted mission to the International Space Station.
All three astronauts assigned to the first crew flight - targeted for next year - were present for Monday's test.
SpaceX - NASA's other commercial crew partner - successfully launched a Dragon capsule to the space station in March.
Whether SpaceX or Boeing, it will be the first time Americans launch into orbit from the US since NASA's last space shuttle flight in 2011. US astronauts have been hitching rides on Russian rockets, costing NASA tens of millions of dollars per seat.
Parachute deployment has been among the top technical challenges Boeing and SpaceX have faced that have raised questions over crew safety and pressured launch schedules.
The parachutes are designed to slow down the capsules when they return to Earth at supersonic speeds.
During Monday's test at the Army's White Sands Missile Range, Boeing counted down to zero, then the Starliner's four launch abort engines fired. The capsule, launched from a test stand, accelerated about 1,000 kph in five seconds flat.
The capsule soared nearly 1,300m into the air. After 20 seconds, only two of its three main red, white and blue parachutes deployed.
The spacecraft gently drifted to the ground, landing on the desert floor cushioned by large air bags.
Boeing put out a statement saying there had been a "deployment anomaly, not a parachute failure." In the aerospace industry, anomaly is the euphemism of choice for an incident, even if there has been a serious accident.
In his first assessment, Starliner programme manager John Mulholland said that "the test team and spacecraft performed flawlessly."
"Emergency scenario testing is very complex, and today our team validated that the spacecraft will keep our crew safe in the unlikely event of an abort."


Important note : I am using ReSharper 2.x / IDEA keyboard mapping.
Alt-Enter
Whenever you navigate your code and see a bulb shaped icon at the left side of your code, hit the Alt-Enter key combination that will provide you with a set of actions you can do on the selected code block.
Alt-R/R
Open the refactor menu. This will present you with a list of possible refactoring you can do. This is the easiest way to start learning every refactoring’s shortcut.
Ctrl-N
Find a class by it’s type name. You can quickly navigate without the mouse to get you anywhere you want within your solution. This one will quickly become one of your most used shortcut.
Ctrl-Shift-G
At first you will need to know this one, but, when you’ll become a ReSharper Jedi, you will forget everything about it’s existence. Place your keyboard cursor on anything and hit those keys. You will then be able to move to it’s declaration, inheritors, usages, unit tests, etc.
Alt-Insert
When you are navigating your solution (Ctrl-Alt-L), press the Alt-Insert key combination and you can create new folders, add classes an even add a file that you previously created with the template editor of ReSharper.


---
title: 'Security'
date: '2018-11-19T15:55:46Z'
description: 'Login to Netistrar, the UK Domain Name Registrar specialising in wholesale domain names and web services at trade prices'
tags: []
categories: []
noindex: 'true'
footercta: false
---
Checking out >> Security
Sign in or Register
Enter your username or email address and password or click to register a new account.


Junior Software Development
Saint-Petersburg, RU
<EMAIL_ADDRESS>+7 (919) 39-39-777
Skills
C++ (using in competitive programming)
Java (Android development)
C (studied at university in class)
Kotlin (studied at university in class)
Python (using in competitive programming, django library)
Web Development (JavaScript, TypeScript, AngularJS)
UNIX (experience in using different Linux distribution based on Debian and Ubuntu)
SQL Database Language (working with db in Android and Python Django development)
Languages
Russian
English
Development web site by using Python Django for backend and TypeScript & AngularJS for frontend
Here you can see its source code.
8 (812) 610-59-55
Web development in a large project that includes frontend, work with TypeScript & AngularJS, backend, work with NodeJS, and testing, such as e2e and integration
Development web site by using Python Django.
Here you can see its source code.
Help, training, preparation of new contests.
Active participant of competitive programming. You can look at my profile here:
Student of Saint-Petersburg State University, faculty of Mathematics and Mechanics, Direction of Software Engineering (09.03.04). Currently study for a bachelors degree, has completed 1 course.
Preparation for ACM ICPC competition.
Android Development.
Preparation for math and programming competitions for several days every 3 months.
Secondary education.


Edit your accomplishment
Found a typo? Have an update? Make your changes here and click the
Save
button when you're done!
How are you feeling?
Cheerful
Reflective
Gloomy
Anxious
What have you accomplished?
Required. Max length 60 characters.
Additional notes (and other juicy details)
Capture additional context here; you'll thank yourself later.
Save changes


A fundamental artifact of any digital imaging device is that it samples an infinite reality and encodes it in a finite data-set. A digital image is essentially a series of color values and its definition is limited by the size of the data it holds (number of pixels and color depth). The experimental software FIG exploits this artifact and attempts to iterate through all the possible color combinations a digital canvas can hold. Since any image can be digitized, we should also expect that any and every representation can be found in one of these possible color combinations. FIG guarantees that with enough time, it will eventually generate every possible image.
At the present time this only works in a theoretical level, as even when running at 60 iterations per second, it would require a little less than 10 billion years (or almost the age of the known universe) to iterate through all the images of an 8x8 pixels image and just 2 colors. But as the processing power of computers keeps increasing alongside the fast progress in quantum computing, we may eventually be able to brute force the generation of all images and filter the meaningful ones out of the chaos. In a potential future version of this software, the output images can be passed into an image recognition algorithm which would identify, aggregate and categorize human recognizable results and allow us to see everything that can be seen.
So will happen if and when we get to that point?
Could this ever challenge human creativity?
Who would own the intellectual property of all the pictures?
Q. Why don't I see any of them even when I move the slider through the entire range?
A. The slider's accuracy is limited by the screen resolution. Moving the slider just by one pixel, may translate to a jump of many trillion iterations, which means it's easy to miss some.
Q. Why are there only grey colors?
A. Colors require 3 values per pixel, so for the purpose of keeping this experiment simple, only tones of grey are used. The logic can easily be transferred into color images, or even moving images.
Q. Is this similar to the infinite monkey theorem?
A. In the infinite monkey theorem, a monkey pressing random keystrokes on a typewriter for infinite amount of time will almost surely compose one of Shakespeare's plays. In contrary FIG will surely generate all possible images in a finite time. It is the same when rather than iterating in a sequential order the random button is used.
Q. How is the total number of possible color combinations calculated?
A. We can find this number by raising the number of available colors to the power of total pixels.
combinations = colorDepth pixels
For example a tiny canvas with a resolution of 4x4 pixels and only 2 colors can hold 2(4x4) = 65536 possible images.
Q. What about the sample images?
A. The purpose of the sample images is to prove that any image can also be represented by a unique iteration index in the given digital canvas. By changing the image resolution and color depth, one can observe how the size of the possible combinations changes and how that translates to time.
Q. Can I take a look to the source code?
A. This is an open source project and it's available in GitHub.
2016


For the first week, we learned the basics of HTML to make our websites and after it was taught to us we did some challenges. The first challenge is that we had to make a support so that a golf ball will not touch the ground if it is bounced from different heights, and during this challenge our group wanted a box like structure so that golf ball will bounce on the structure without hitting the ground and I suggested that we cut the straws so we have more supplies to build our structure and it made it easier for us to create our structure. The second challenge is that we have to make the tallest structure with newspapers and tape (the picture shows our group doing this challenge), and in this challenge I helped with making sure that the top of the structure stays straight and I helped out with on how to make sure the base for the structure is good.


{% extends "pretixcontrol/event/base.html" %} {% load i18n %} {% load bootstrap3 %} {% load staticfiles %} {% block title %}{% trans "pretixdroid configuration" %}{% endblock %} {% block content %}
{% blocktrans trimmed %} pretixdroid is an Android app that you can use to control tickets at the entrance of your event. {% endblocktrans %}
{% blocktrans trimmed %} Android, Google Play and the Google Play logo are trademarks of Google Inc. {% endblocktrans %}
{% blocktrans trimmed %} If you start the app for the first time, it will request that you scan the following code. The code tells the app all it needs about your event. {% endblocktrans %}
{% trans "Reset authentication token" %} {% endblock %}


Owen Hassan murder trial told dying dad found with 'face hanging off' outside pub
James Nolan told the jury how he found the injured 30 year-old beside the Old Stag Inn bar in Glasgow and spotted a man carrying a 'big knife' walking away.
by Grant McCabeA man allegedly murdered outside his mum's pub was found with his “face hanging off”, a witness told a trial .
James Nolan was part of the attempts to save dying dad Owen Hassan in November 2018.
Mr Nolan recalled finding the injured 30 year-old in the street beside the Old Stag Inn bar in Glasgow's Pollokshaws.
The 65 year-old stated he then spotted a man with a “seriously big knife” apparently “strolling” away from the scene.
He was today giving evidence at the trial of David Callaghan, 30, and Craig Corrall, 39, at the High Court in Glasgow, where they deny murdering Mr Hassan.
Mr Nolan – an electrician - had been at the pub on the night of the alleged killing for a meeting with other tradesman.

The trial previously heard how Mr Hassan came in that evening to collect keys, before Miss Lynch later became aware of an incident outside.
Mr Nolan recalled getting a “fright” after hearing a “clatter”.
He went out and found Mr Hassan on the ground trying to get up.
The witness added: “I just thought it was a punching or a kicking. I never expected this.”
Mr Nolan then noticed “a guy walking down the road”.
Prosecutor Lynsey MacDonald asked: “How fast was he going?”
Mr Nolan replied: “He was not – just a stroll.
“The guy turned around and just stared at me. He had a weapon. There was no speech, nothing.
“It was a butcher's knife. It was big...seriously big.”
Mr Nolan said Mr Hassan's mum grabbed him to try and get him back inside.
But, asked if he did return to the pub, he added: “No. I seen the state the boy (Mr Hassan) was in.
“I don't think his mum actually saw what I did. I went for CPR, but his face was hanging off.
“His mother was on the phone to the paramedics.
“The boy was lying there and I put him in the recovery position. You could tell that it was pretty heavy.
“He was trying to talk, trying to get up. His eyes were going by the second, clouding over, but there was still life in him yet.
“I stayed with him until the paramedics arrived.”
Mr Nolan – who eventually did give CPR - said he tried to stop Miss Lynch seeing the extent of her son's injuries.
The witness went on: “His face was off...like a hinge.”
Mr Nolan said he had got to know Miss Lynch since she took over the Old Stag Inn often helping with maintenance jobs.
Corral's QC Thomas Ross later asked: “You shared a terrible experience where her son was killed outside the pub and were trying to help Owen before ambulance got there?”
Mr Nolan: “Yes.”
Prosecutors claim Mr Hassan was chased, seized by the body and the repeatedly struck with knives or machetes.
The trial, before Lord Woolman, continues.


Version 0.9.5
This update brings cool features that should have been added long time ago!
Attention! This is a beta update!
I advise you to check this update out, though you should be prepared to encounter
bugs!
About the content of this update:
- Internal Imrovements
- Revert Wallpaper (to the one user used to have before choosing a theme) when you disable a theme
- Add Create Themepack Controller button (NOT YET READY)
- Add preferences window
- Logging Options
- Supports relative paths in Themes configs & wallpaper
- UI improvements (Improvements to interface & you can now use keyboard to do many tasks)
- Use ESC to close any sheet
- ⌘P -> Open Conky Preferences
- ⌘T -> Open Conky Themes


The detailed talk schedule for the workshop (Feb 6-7) will be announced in early 2020. We remind prospective speakers that they are allocated 12 minutes + 3 minutes of questions for their talk. A general purpose machine will be available but we strongly suggest bringing your own laptops, VGA/HDMI adapters and other associated dongles.
Detailed schedule:
NOTE: SCHEDULE ORDER IS A WORKING COPY. THE ORDER IS CURRENTLY RANDOM AND SUBJECT TO CHANGE!!! Thursday 9:30 - 10:50: session 1 Mark Walker "TBD" Daniel Price "Tidal disruption of stars by supermassive black holes" Mike Lau "Detecting Double Neutron Stars with LISA" Aris Tritsis "Halo's magnetic field as evident from striated interstellar clouds (HOMERIC)" 10:50 - 11:10: morning tea 11:10 - 12:30: session 2 Ashley Ruiter "TBD (something on binary stars and white dwarfs)" Ayan Acharyya "Quantifying beam smearing effects on inferred metallicity gradients via synthetic IFU datacubes" Meridith Joyce "3D Particle Maps from any MESA Model in a few clicks" Fiona Panther "Thick He-shell DD or not DD: gamma-ray signatures to distinguish the progenitors of subluminous thermonuclear transients" 12:30 - 13:30: lunch 13:30 - 14:50: session 3 James Murray "AAL" Alex Kemp "Towards improved theoretical rates of novae and type Ia supernova events through population synthesis" Cui-Ying Song "Black Hole Hyperaccretion Inflow–Outflow Model: Long-duration Gamma-Ray Bursts and Supernova 56 Ni Bumps" 14:50 - 15:10: afternoon tea 15:10 - 17:30: session 4 Shyam Menon "The turbulence driving mode of expanding HII regions" Moritz Huebner "Measuring gravitational-wave memory in the first LIGO/Virgo gravitational-wave transient catalogue" Vishnu Varma R Vejayan "Simulations of magnetorotational hypernovae" Paul Easter "Astrophysics and nuclear physics with gravitational waves from neutron star merger remnants" 19:00 - late: ANITA2020 conference dinner at Lemongrass Thai, 65 London Cct Friday 9:30 - 10:50: session 1 Roland Crocker "Cosmic ray feedback in star-formation and implications for gamma-ray emission from starbursts" Valentin Christiaens "How do planets form? New insight from IR high-contrast imaging." Alexander Heger "Production of Lithium in Primoridal Supernovae" Segey Belkin "Multifrequency Observations and Discovery of the Supernova associated with GRB 181201A" 10:50 - 11:10: morning tea 11:10 - 12:30: session 2 Lilia Ferrario "TBD" Eloise Birchall "Early evolution of protostellar discs" Lucy Strang "Plerion-like X-ray plateaux in short Gamma-Ray Bursts" Allan Ernest "Is there a universal wavefunction?" 12:30 - 13:30: lunch 13:30 - 15:30: session 3 Ilya Mandel "Updates on compact-object binaries" Christophe Pinte "Kinematic detection of embedded protoplanets" Ivo Seitenzahl "TBD" 15:30: close and farewell


Brief
Firstly, when creating your first ever username(Or when changing your name), try to find some extraordinarily long words to use, or try using your imaginations to form an old word into a new one! For instance, Amethyst=Ametxyst or Hamburger=H4m_Bur9er.
Secondly, instead of using a real word or a fake word such as Mixro_scopic, try using numbers that looks like letters from the alphabets! Here are the numbers: 1=I,L 2=Z 3=E 4=A 5=S 7=T,Y,V 8=B 9=g 0=O,D.
And finally, for our username, we don't really want lots of words, try using one word to express your meaning. Such as: L4p_T0pz or Ex_Tre55ition4l. Now we have a better name!
Now let's rephrase about the passage I just typed, this is a username for starters: iamthebestplayer123123 For apprentice: I_mtheBestPlayer12 For advanced: DaB_Pl4y And finally, for Professionals: Da_Be5tPl4yerz
These are the suggestions for creating a new or another usernames for your account in that specific game! Here are some of the all-time best usernames in video games: Telamon, SteadyOn, XikronFeak, Speed3Umlaut, and ScriptourAlps
When playing Video games on your PC, mostly thinking to change your name since it's so old-fashioned or your username is bland, or maybe your username contained a word which makes you being the culprit when going into games while other players laughing at you due to your mistake.
Changing your usernames may be impossible in android games, games on PC may be possible such as Minecraft. However, sometimes changing your usernames requires real currencies or requires time, and when I mean time, I mean an extremely long time.


About Us
Your website is the hub of your digital ecosystem, much like a physical location, the experience counts once a customer walks through the door, just as much as the impression they have of you before they do. We Design affordable and professional sites with Website Maintainance and Web Hosting.


@intothesource/hashtag-shredder
Shreds hashtags 🤘. Type something in the textbox below to see the result.
Foo #hash #Tag Bar https://example.com/index.html#hash
Result:


This Project is built around the idea of using a capacitance sensor to detect if someone is sitting on a chair. The distinguishing feature of the one-inch-square Pipsqueak sensors is their incredibly long battery life. With up to 10 years of life on a single coin cell battery, these ‘Pips’ offer a simple set-and-forget way to monitor environmental conditions around a home or in an office.
Pips can detect the presence of water, ambient light and temperature, and -- via a magnetic switch -- whether a door, drawer or window is open or closed. Because they’re so small and the batteries last so long, they’re particularly suited to spots that are hard to access but need to be monitored over the long term -- like to watch for leaks in a basement or crawlspace. Owl Platform was designed by Inpoint Systems, makers of the Roll-Call RFID inventory system for businesses. For the Pipsqueak sensors, Inpoint designed sensing and reporting protocols that minimize power consumption. The Pips take sensor readings only as often as they need to, and report via radio to a base station only when they detect a meaningful change. At lengthy intervals they ping the base station to let it know they’re still functioning and give an estimate of remaining battery life. The base station itself needs an Ethernet connection in its current form, but could eventually have WiFi as well. Data from the Pips is sent through the base station to the cloud-based service at Owl Platform Online. Users can access a browser interface to check each sensor’s current status, grab logs of past data, and set conditions for text or email alerts from each sensor. The cloud service will carry a subscription fee, which will be required to use any apps that take advantage of the forthcoming web API. But the platform software is open source, so users can set up their own servers to monitor their Pips.
Click the link below to check out the web application for this project:
Web applicationDepartment of Electrical and Computer
Research Interests: Computer Vision, IoT, Algorithms
Department of Electrical and Computer
Research Interests: Computer Vision, Graphs, Operating System


|
Panda3D
|
Public Member Functions | |
| def | __init__ (self, gravity=64.348, standableGround=0.707, hardLandingForce=16.0, legacyLifter=False) |
| def | addBlastForce (self, vector) |
| def | debugPrint (self, message) |
| def | deleteCollisions (self) |
| def | disableAvatarControls (self) |
| def | displayDebugInfo (self) |
| def | doDeltaPos (self) |
| def | enableAvatarControls (self) |
| def | flushEventHandlers (self) |
| def | getAirborneHeight (self) |
| def | getCollisionsActive (self) |
| def | getGravity (self, gravity) |
| def | getIsAirborne (self) |
| def | getSpeeds (self) |
| def | getVelocity (self) |
| def | handleAvatarControls (self, task) |
| def | initializeCollisions (self, collisionTraverser, avatarNodePath, avatarRadius=1.4, floorOffset=1.0, reach=1.0) |
| def | oneTimeCollide (self) |
| def | placeOnFloor (self) |
| def | reset (self) |
| def | setAirborneHeightFunc (self, unused_parameter) |
| def | setAvatar (self, avatar) |
| def | setAvatarPhysicsIndicator (self, indicator) |
| def | setCollisionRayHeight (self, height) |
| def | setCollisionsActive (self, active=1) |
| def | setFloorBitMask (self, bitMask) |
| def | setGravity (self, gravity) |
| def | setMayJump (self, task) |
| def | setPriorParentVector (self) |
| def | setTag (self, key, value) |
| def | setupEventSphere (self, bitmask, avatarRadius) |
| def | setupFloorSphere (self, bitmask, avatarRadius) |
| def | setupRay (self, bitmask, floorOffset, reach) |
| def | setupWallSphere (self, bitmask, avatarRadius) |
| def | setWalkSpeed (self, forward, jump, reverse, rotate) |
| def | setWallBitMask (self, bitMask) |
| def | startJumpDelay (self, delay) |
| def | swapFloorBitMask (self, oldMask, newMask) |
Static Public Attributes | |
| int | DiagonalFactor = math.sqrt(2.) / 2. |
| earlyEventSphere = ConfigVariableBool('early-event-sphere', False) | |
| notify = directNotify.newCategory("GravityWalker") | |
| wantDebugIndicator = ConfigVariableBool('want-avatar-physics-indicator', False) | |
| wantFloorSphere = ConfigVariableBool('want-floor-sphere', False) | |
| def __init__ | ( | self, | |
gravity = 64.348 , |
|||
standableGround = 0.707 , |
|||
hardLandingForce = 16.0 , |
|||
legacyLifter = False |
|||
| ) |
| def addBlastForce | ( | self, | |
| vector | |||
| ) |
| def debugPrint | ( | self, | |
| message | |||
| ) |
for debugging
| def deleteCollisions | ( | self | ) |
| def disableAvatarControls | ( | self | ) |
Ignore the arrow keys, etc.
| def displayDebugInfo | ( | self | ) |
For debug use.
| def doDeltaPos | ( | self | ) |
| def enableAvatarControls | ( | self | ) |
Activate the arrow keys, etc.
| def flushEventHandlers | ( | self | ) |
| def getAirborneHeight | ( | self | ) |
| def getCollisionsActive | ( | self | ) |
| def getGravity | ( | self, | |
| gravity | |||
| ) |
| def getIsAirborne | ( | self | ) |
| def getSpeeds | ( | self | ) |
Reimplemented in BattleWalker.
| def getVelocity | ( | self | ) |
| def handleAvatarControls | ( | self, | |
| task | |||
| ) |
Check on the arrow keys and update the avatar.
Reimplemented in BattleWalker, TwoDWalker, and BattleWalker.
| def initializeCollisions | ( | self, | |
| collisionTraverser, | |||
| avatarNodePath, | |||
avatarRadius = 1.4 , |
|||
floorOffset = 1.0 , |
|||
reach = 1.0 |
|||
| ) |
floorOffset is how high the avatar can reach. I.e. if the avatar walks under a ledge that is <= floorOffset above the ground (a double floor situation), the avatar will step up on to the ledge (instantly). Set up the avatar collisions
| def oneTimeCollide | ( | self | ) |
Makes one quick collision pass for the avatar, for instance as a one-time straighten-things-up operation after collisions have been disabled.
| def placeOnFloor | ( | self | ) |
Make a reasonable effor to place the avatar on the ground. For example, this is useful when switching away from the current walker.
| def reset | ( | self | ) |
| def setAirborneHeightFunc | ( | self, | |
| unused_parameter | |||
| ) |
| def setAvatar | ( | self, | |
| avatar | |||
| ) |
| def setAvatarPhysicsIndicator | ( | self, | |
| indicator | |||
| ) |
indicator is a NodePath
| def setCollisionRayHeight | ( | self, | |
| height | |||
| ) |
| def setCollisionsActive | ( | self, | |
active = 1 |
|||
| ) |
| def setFloorBitMask | ( | self, | |
| bitMask | |||
| ) |
| def setGravity | ( | self, | |
| gravity | |||
| ) |
| def setMayJump | ( | self, | |
| task | |||
| ) |
This function's use is internal to this class (maybe I'll add the __ someday). Anyway, if you want to enable or disable jumping in a general way see the ControlManager (don't use this).
| def setPriorParentVector | ( | self | ) |
| def setTag | ( | self, | |
| key, | |||
| value | |||
| ) |
| def setupEventSphere | ( | self, | |
| bitmask, | |||
| avatarRadius | |||
| ) |
Set up the collision sphere
| def setupFloorSphere | ( | self, | |
| bitmask, | |||
| avatarRadius | |||
| ) |
Set up the collision sphere
| def setupRay | ( | self, | |
| bitmask, | |||
| floorOffset, | |||
| reach | |||
| ) |
| def setupWallSphere | ( | self, | |
| bitmask, | |||
| avatarRadius | |||
| ) |
Set up the collision sphere
| def setWalkSpeed | ( | self, | |
| forward, | |||
| jump, | |||
| reverse, | |||
| rotate | |||
| ) |
| def setWallBitMask | ( | self, | |
| bitMask | |||
| ) |
| def startJumpDelay | ( | self, | |
| delay | |||
| ) |
| def swapFloorBitMask | ( | self, | |
| oldMask, | |||
| newMask | |||
| ) |
| avatar |
| avatarControlForwardSpeed |
| avatarControlJumpForce |
| avatarControlReverseSpeed |
| avatarControlRotateSpeed |
| avatarNodePath |
| avatarRadius |
| cEventSphereNodePath |
| cFloorSphereNodePath |
| collisionsActive |
| controlsTask |
| cRay |
| cRayNodePath |
| cTrav |
| cWallSphereNodePath |
|
static |
|
static |
| event |
| falling |
| floorBitmask |
| getAirborneHeight |
| highMark |
| indicatorTask |
| isAirborne |
| jumpDelayTask |
| lifter |
| mayJump |
| moving |
| needToDeltaPos |
|
static |
| physVelocityIndicator |
| priorParent |
| pusher |
| pusherFloorhandler |
| rotationSpeed |
| slideSpeed |
| speed |
| vel |
| wallBitmask |
|
static |
|
static |


| marko-v4/ |
|
90.11% |
82/91 |
72.73% |
32/44 |
87.5% |
7/8 |
90.11% |
82/91 |
| marko-v4/bin/ |
|
0% |
0/159 |
0% |
0/99 |
0% |
0/22 |
0% |
0/159 |
| marko-v4/browser-refresh/ |
|
38.46% |
5/13 |
25% |
1/4 |
50% |
1/2 |
38.46% |
5/13 |
| marko-v4/compiler/ |
|
88.02% |
1256/1427 |
79.69% |
506/635 |
89.19% |
198/222 |
88.06% |
1254/1424 |
| marko-v4/compiler/ast/ |
|
88.64% |
1545/1743 |
80.63% |
562/697 |
87.23% |
246/282 |
88.64% |
1545/1743 |
| marko-v4/compiler/ast/HtmlAttribute/ |
|
84.21% |
32/38 |
41.67% |
5/12 |
72.73% |
8/11 |
84.21% |
32/38 |
| marko-v4/compiler/ast/HtmlAttribute/html/ |
|
97.18% |
69/71 |
90.91% |
40/44 |
100% |
8/8 |
97.18% |
69/71 |
| marko-v4/compiler/ast/HtmlAttribute/vdom/ |
|
100% |
12/12 |
100% |
8/8 |
100% |
1/1 |
100% |
12/12 |
| marko-v4/compiler/ast/HtmlElement/ |
|
98.55% |
68/69 |
85.71% |
24/28 |
95.45% |
21/22 |
98.55% |
68/69 |
| marko-v4/compiler/ast/HtmlElement/html/ |
|
97.06% |
66/68 |
88.46% |
23/26 |
100% |
6/6 |
97.06% |
66/68 |
| marko-v4/compiler/ast/HtmlElement/vdom/ |
|
98.64% |
145/147 |
96.15% |
75/78 |
100% |
10/10 |
98.64% |
145/147 |
| marko-v4/compiler/ast/Text/ |
|
100% |
21/21 |
100% |
5/5 |
100% |
6/6 |
100% |
21/21 |
| marko-v4/compiler/ast/Text/html/ |
|
96.67% |
29/30 |
93.75% |
15/16 |
100% |
2/2 |
96.67% |
29/30 |
| marko-v4/compiler/ast/Text/vdom/ |
|
98.82% |
84/85 |
92.86% |
39/42 |
100% |
7/7 |
98.82% |
84/85 |
| marko-v4/compiler/taglib-finder/ |
|
90.65% |
97/107 |
82.86% |
29/35 |
76.92% |
10/13 |
90.65% |
97/107 |
| marko-v4/compiler/taglib-loader/ |
|
84.83% |
464/547 |
71.63% |
149/208 |
84.62% |
66/78 |
84.83% |
464/547 |
| marko-v4/compiler/taglib-loader/Taglib/ |
|
76.56% |
160/209 |
64.56% |
51/79 |
62.5% |
30/48 |
76.56% |
160/209 |
| marko-v4/compiler/taglib-lookup/ |
|
88.38% |
175/198 |
70.87% |
73/103 |
93.1% |
27/29 |
88.38% |
175/198 |
| marko-v4/compiler/util/ |
|
84.04% |
279/332 |
69.08% |
105/152 |
91.43% |
32/35 |
84.04% |
279/332 |
| marko-v4/compiler/util/vdom/ |
|
87.85% |
94/107 |
73.81% |
31/42 |
83.33% |
10/12 |
87.85% |
94/107 |
| marko-v4/helpers/ |
|
63.64% |
7/11 |
33.33% |
2/6 |
100% |
2/2 |
63.64% |
7/11 |
| marko-v4/hot-reload/ |
|
88.89% |
56/63 |
56.76% |
21/37 |
100% |
7/7 |
88.89% |
56/63 |
| marko-v4/runtime/ |
|
78.95% |
120/152 |
63.01% |
46/73 |
78.79% |
26/33 |
78.95% |
120/152 |
| marko-v4/runtime/html/ |
|
86.43% |
121/140 |
73.68% |
56/76 |
85.71% |
18/21 |
86.43% |
121/140 |
| marko-v4/runtime/loader/ |
|
87.32% |
62/71 |
79.41% |
27/34 |
71.43% |
5/7 |
87.32% |
62/71 |
| marko-v4/runtime/vdom/ |
|
64.8% |
81/125 |
48.28% |
28/58 |
66.67% |
14/21 |
64.8% |
81/125 |
| marko-v4/taglibs/async/ |
|
80.07% |
233/291 |
75.16% |
118/157 |
82.61% |
19/23 |
84.67% |
232/274 |
| marko-v4/taglibs/cache/ |
|
91.49% |
43/47 |
70% |
14/20 |
100% |
9/9 |
91.49% |
43/47 |
| marko-v4/taglibs/core/ |
|
76.61% |
262/342 |
63.56% |
75/118 |
93.33% |
28/30 |
76.61% |
262/342 |
| marko-v4/taglibs/core/util/ |
|
87.44% |
174/199 |
80.77% |
105/130 |
90% |
9/10 |
87.44% |
174/199 |
| marko-v4/taglibs/html/ |
|
100% |
6/6 |
50% |
2/4 |
100% |
1/1 |
100% |
6/6 |
| marko-v4/taglibs/layout/ |
|
95.12% |
39/41 |
84.62% |
22/26 |
100% |
5/5 |
95.12% |
39/41 |


val purpose: StripeFilePurpose?
The purpose of the file. Possible values are business_icon, business_logo, customer_signature, dispute_evidence, identity_document, pci_document, or tax_document_user_upload.
business_icon
business_logo
customer_signature
dispute_evidence
identity_document
pci_document
tax_document_user_upload
purpose


| Ticket ID | Category | Submitted Date | Status | Severity | |
|---|---|---|---|---|---|
| 1 | Category A | Dec 10, 2017 | IN_PROGRESS | 3 | |
| 2 | Category B | Dec 11, 2017 | RESOLVED | 4 | |
| 3 | Category C | Dec 13, 2017 | ASSIGNED | 5 | |
| 4 | Category D | Dec 20, 2017 | PENDING | 3 | |
| 5 | Category E | Dec 22, 2017 | IN_PROGRESS | 2 | |
| 6 | Category F | Dec 11, 2017 | RESOLVED | 1 | |
| 7 | Category A | Dec 09, 2017 | IN_PROGRESS | 3 | |
| 8 | Category C | Dec 12, 2017 | RESOLVED | 4 | |
| 9 | Category D | Dec 15, 2017 | IN_PROGRESS | 2 | |
| 10 | Category B | Dec 10, 2017 | PENDING | 3 | |
| 11 | Category A | Dec 14, 2017 | ASSIGNED | 5 | |
| 12 | Category E | Dec 17, 2017 | ASSIGNED | 2 |
DataTables is a very flexible, advanced tables plugin for jQuery. In SB Admin, we are using a specialized version of DataTables built for Bootstrap 3. We have also customized the table headings to use Font Awesome icons in place of images. For complete documentation on DataTables, visit their website at https://datatables.net/.
View DataTables Documentation


iAds are a great new way to create digital advertisements for Apple's mobile devices. Soon, there are going to be more than 100 million iPads, iPhones and iPods combined.
Based on open HTML5 technologies (yay!), developers will be able to easily create and distribute content for Apple devices. But what is all the buzz about?
Ad providers won't be able to re-use many of their existing ads. The reason is Apple's iPhone & iPad won't support Flash, ever.
We don't see that as a problem.
As we have already shown, HTML5 holds some amazing possibilities.
For us, it isn't about doing what we did with Flash already. We are keen to fulfill the promise of better ads with better tools. Forget those annoying Flash banners. Save the monkey from the hammer. Here's why iAds are way ahead of the competition:
So, if you're interested and like our ideas
→ Tell us what you have in mind
and we'll figure someting cool for you.
♥ No Flash → View Source ♥
Forking Pleasure on GitHub


| quicksort/3 | Sort the contents of List according to the given comparison predicate, and unify the result with SortedList.</br> The comparison predicate must accept two parameters, ValueX and ValueY, which might be any two elements in List, and have the following behavior: ~~~ <Comparator>(+ValueX, +ValueY, -Result:number) is det where Result is unified with a) 0 (zero) - ValueX is equal to ValueY b) a negative number - ValueX is less than ValueY c) a positive number - ValueX is greater than ValueY ~~~ The criteria that will determine the results of the comparisons are entirely up to Comparator, and as such it must be able to handle the values it will receive. | |