Event
The Top Chess Engine Championship (TCEC) is the premier championship for chess software. It is a competition between 32 engines with ELO 3000+ and is divided into five divisions and a Superfinal.
TCEC runs 24/7 until all games have been played. One game is played at a time - the next one starts automatically.
Time control
Classical time control will be used through the season and it is increased the deeper the Season goes. For Division 2, 3 and 4, the time control is 30 minutes + 10 seconds added per move for the whole game. For Division 1, the time control is 60 minutes + 10 seconds added per move for the whole game. For Division Premier, the time control is 90 minutes + 10 seconds added per move for the whole game. For the Superfinal, the time control is 120 minutes + 15 seconds added per move for the whole game. If an engine loses on time, the result will not be changed or the game replayed. If the TCEC game server locks up at any time during a game (BSOD, freeze etc), that game will be restarted unless the last position was a 6-man or less tablebase position, then it will be manually adjudicated. Prior to Season 9, different time controls have been used. Check the individual games in the "Archive page" for info.
Game adjudication
A game can be drawn by the normal 3-fold repetition rule or the 50-move rule. However, a game can also be drawn at move 40 or later if the eval from both playing engines are within +0.05 to -0.05 pawns for the last 5 moves, or 10 plies. If there is a pawn advance, or a capture by any kind, this special draw rule will reset and start over. In the website this rule is shown as "TCEC draw rule" with a number indicating how many plies there are left until it kicks in. It will adjudicate as won for one side if both playing engines have an eval of at least 6.50 pawns (or -6.50 in case of a black win) for 4 consecutive moves, or 8 plies - this rule is in effect as soon as the game starts. In the website this rule is shown as "TCEC win rule" with a number indicating how many plies there are left until it kicks in. Cutechess will also adjudicate 5-men or less endgame positions automatically with Gaviota tablebases. The Gaviota adjudication ignores the 50-move rule.
Loss of Connection to the GPU server
The remote Windows Server (2x GTX 1080ti GPUs) that we rent for the NN engines shut down unexpectedly with a serious (hardware) error at least once during preparation for Season 13. The company from which we rent couldn't explain the failure, and couldn't/wouldn't guarantee 24/7 100% uptime and stability. Instead they tried to upgrade us (for a lot more money) to a 4x GPU card server, which they claimed was 100% stable. We made the decision to stay with the 2x GTX 1080ti server. So, it's posible that this remote server crashes again during the S13 event. In the event of such a crash, there will be delay in the tournament while we contact our service providers and they restart or reboot the box. If the interruption happens during a game, our tournament manager software (cutechess) can resume the tournament, but the current game will be re-played in it's entirety.
Critical Engine Bugs
In the case of a serious, play-limiting bug (like crashing or interface communication problems, not including losses on time) not discovered during the pre-Season testing, the engine can be updated once per Division to fix this/these bug/bugs only. If this update still doesn't fix the problem(s) or if there is no update available, the engine might have the number of cores reduced, have the hash size reduced or have the tablebase access disabled - these changes will remain for the rest of the Division.
Tiebreaks
If necessary, tiebreaks can be used to determine advancement. For all Divisions (not the Superfinal), the first tiebreak criteria is the "crash" tiebreak, meaning that if an engine has crashed once or more during the Division, it will fail qualification versus another engine that has not crashed if both of them has the same amount of points. In case of still being tied, then the direct encounter between the tied engines decides. The next criterion is the greatest number of wins, then the greatest number of wins with black. The Sonneborn-Berger is the next criteria. If they are still tied, then the tournament organizers will decide which engine gets the promotion.
Engine Updates
Engines that promote to a new Division are allowed to update at the cost of taking 1 strike to fix bugs uncovered during the previous Division. All other engines that promote to the next Division will use the version initially submitted. Promoting engines may update UCI/xboard settings. The deadline for engine submission is the last game of the current Division unless the programmer is given a specific deadline from the Tournament Director - the goal is to be able to start the next Division as soon as possible without any significant delay.
Engine Ratings
In the TCEC Archive page (available via the File menu), you can see the official TCEC ratings list (in the bottom right corner). This list is updated after each Division or Superfinal and is calculated by using Ordo. The calculation is global (all versions of an engine are included under a single name) and includes all games played since (and including) Season 1. All games lost on time, via stall or disconnect, are discarded...as are engines that have had only losses. If there is a new engine entering TCEC for the first time, it will get a "temporary" rating taken from the CCRL 40/40 4CPU list. If an engine isn't found here, or if it has played very few games, an approximate ELO rating will be given to that engine based on tests from the programmer. Then after this new engine has played an event, an official rating will be calculated.
The TCEC Division System
As soon as a Division starts, it will run 24/7 until all games have been played. One game is played at a time - the next one starts automatically. There will be a short break between the Divisions, to make sure everything is ok with the TCEC game server and to prepare for the next Division.
Division 4
Division 4 is the preliminary Division, involving 8 engines that enter the championship on invitational basis, playing a 2x round robin (112 games). The time control of the games will be 30 mins + 10 sec/move. The top 2 engines qualify for Division 3 while the rest are out of TCEC for the current Season.
Division 3
Division 3 consists of the 2 engines that qualified from Season 11 plus the top 4 engines from Division 4. It is a 2x round robin (112 games). The top 2 engines promote to Division 2 and the bottom 2 engines are relegated.
Division 2
Division 2 consists of the 6 engines that qualified from Season 11 plus the top 2 engines from Division 3. It is a 2x double round robin (112 games). The top 2 engines promote to Division 1 and the bottom 2 engines are relegated to Division 3.
Division 1
Division 1 consists of the 6 engines that qualified from Season 11 plus the top 2 engines from Division 2. It is a 2x round robin (112 games). The top 2 engines promote to Division Premier and the bottom 2 engines are elegated to Division 2
Division Premier
Division Premier consists of the 6 engines that qualified from Season 11 plus the top 2 engines from Division 1. It is a 8x round robin (224 games). The top 2 engines promote to the Superfinal and the bottom 2 engines are elegated to Division 1
Superfinal
This match is played with 50 different openings so that each engine plays both black and white of the same position. The match will be presented with opening 1 used in games 1 and 2, then opening 2 used in games 3 and 4 etc. If the match is theoretically won for one side before game 100, the match will still continue until all 100 games have been played. In the case of a drawn match there will be a rapid match of 16 games with a time control of 25' + 10" with random openings selected from earlier in the same Season. In case it is still tied there will be a Blitz match of 8 games with a time control of 3' + 2". When the Superfinal is over, the current Season ends.
The TCEC Grand Champion
The winner of the Superfinal will be crowned the TCEC Grand Champion and will keep this title until there is a winner in the next Superfinal. There is no automatic qualification for the reigning Grand Champion, it will have to go all the way through the next Season for it to be able to defend the title.
Engine Specific Configuration
UCI and Xboard (Winboard) engines are supported. To identify the protocol an engine is using you can click the gears next to the engine logo during a game. This info will be saved for the archive, but does not work for Season 5 or older games.
Compiles
Many engines come with different .exe files. 64-bit .exes are always preferred over 32-bit. Also, compiles that support SSE 4.2, AVX/AVX2 or similar instruction sets are preferred.
Large Pages
Some engines can utilize a function in Windows called large pages, that gives a speed boost. However, after a while the memory in the computer will be fragmented, so that one engine might receive large pages and the opponent won't, which would be unfair. Therefore, this has been disabled. Large pages are often useful when you are running infinite analysis on a position.
Number of Cores / Threads
Each engine can use up to 43 cores of the processors, if this is supported. Some engines have a prefix like "deep", but this has been omitted from the engine name to make it shorter. When watching a game you can see the number of cores that are in use for the engines currently playing by clicking the gears next to the engine logo.
Split Depth
The split depth parameter basically defines the minimum depth for work to be split between threads. If no specific settings are given from the programmer, the default value will be used.
Main Hash Size
Each engine is allowed to use up to 16384 MB of hash. Not all engines supports this much hash, so the maximum for that engine will be used in this case, typically 2048 MB or 4096 MB. When watching a game you can see the size of the hash that is in use for the engines currently playing by clicking the gears next to the engine logo.
Minor Hash Sizes
Some engines have an option to configure the size of other hash tables, often called pawn hash or evaluation hash. The combined, total limit for hash types like these is 4096 MB (8192 MB in case of the Superfinal).
Own Opening Book
All opening books shipped with the engines are removed and/or disabled and any engine found to be using hidden, internal opening books will be disqualified and replaced with another engine chosen by the Tournament Director.
Endgame Tablebases
For Season 11 all divisions, 5-men Nalimov/Gaviota/Scorpio, and 6-men Syzygy are available thanks to the 256 GB SSD. When watching a game you can see the type of the tablebases (if any) that is in use for the engines currently playing by clicking the gears next to the engine logo.
Ponder / Permanent Brain
Basically this means that the engines can think during their opponents turn. It is not allowed so it will be disabled because of performance limitations with only 1 computer. This might change in a future Season of TCEC.
Contempt / Draw Score
Some engines have a setting that can adjust their own view of the positions throughout a game to avoid draws. This setting is not changed from the default unless it is a request from the programmer.
Other Settings
Any configurable option not described above, is not normally adjusted in any way, except if the programmer of an engine wants specific settings for each specific Division. Options like "keep hash tables" or similar is usually enabled.
TCEC Hardware
Thanks to the devoted audience for it's support! Because of them, the server was upgraded for Season 10, allowing TCEC to use a powerful 44 cores machine for all divisions.
Current TCEC server
CPUs: 2 x Intel Xeon E5 2699 v4 @ 2.8 GHz
Cores: 44 physical
Motherboard: Supermicro X10DRL-i
RAM: 64 GB DDR4 ECC
SSD: Crucial CT250M500 240 GB
Chassis: Supermicro
OS: Windows Server 2012 R2
Again, thanks to the generous support from our viewers, we are now able to include a dedicated GPU server (generating ~35% of the power available for Alpha Zero by Google DeepMind) for the Neural Network engines. If you'd like to contribute and help us improve the event even further, please check out how to support TCEC.
GPU Server
GPUs: 2x GTX 1080 ti
CPU: Intel Xeon E5-2609v4 1.7 GHz
Cores: 8 physical/16 logical
RAM: 32 GB RAM
SSD:480 GB SSD
Port: 1 Gbps Port
OS: Windows Server 2016
Previous Seasons
CPUs: 2 x Intel Xeon E5-2689 @ 3300 MHz
Cores: 16 physical
CPU Coolers: 2 x Corsair H80i
Motherboard: Asus Z9PE-D8 WS
RAM: 64 GB Kingston KVR16R11D4K4/32 Reg/ECC
PSU: Corsair AX 760
SSD: Samsung 840 Pro 128 GB
Chassis: Silverstone Raven RV03B-WA
OS: Windows 7 Professional
FAQ
Is this the official World Computer Chess Championship?
No, it is not, although some people regard it as such.
Who is the reigning TCEC Grand Champion?
Stockfish defeated Komodo in the Superfinal of Season 12, so Stockfish is the reigning TCEC Grand Champion.
Did the engine move instantly?
Yes, some engines can move from hash, or move instantly. However, sometimes it can seem that it moves instantly but in reality it doesn't, since there is a transmission delay from the playing server to the website by approximately 15 seconds. Refer to the "move time" for each engine to see how long it thought on its move.
Is there a special plugin required to view the games?
No, to view the games it is only required that you allow Javascript to run. The TCEC Web GUI has been developed on the latest Chrome, but will also run fine on the latest Firefox. There is no support for Internet Explorer versions below 9.
What GUI are you using to play the games?
To play the games a special version of cutechess-cli is used. This is a command line tool without an actual GUI. This was made possible thanks to
Jeremy Bernstein. Previously TCEC used
ChessGUI by Matthias Gemuh.
What is the name of the web framework that displays the games?
It is called
pgn4web and is totally free. Paolo Casaschi is the mastermind behind it and has helped a lot on certain difficult programming challenges.


The language of the test. This is either c for C test, cpp for a C++ test or c.cpp for
a C test that was automatically converted into a C++ test (see here).
execution type
Either bu or ex. bu if the test will only be built but not executed; ex if the
test will be built and the resulting executable will be executed.
success requirement
Either s or f. s if the test must succeed (s = success); f if the test must
fail (f = fail). Requiring that a test must fail is often useful with bu tests, to make sure that
a specific piece of code does not compile.
name
The name of the component that is being tested. If the test does not test a single component, the name must
be chosen appropriately for the specific test.
test type
Either wt or bt. wt if the test is a whitebox; bt if the test is a blackbox
test.
number
The number of the test (if two tests would otherwise have the same name, this is used to differentiate
between them). Usually, tests will not have the same name, but in the case of tests that should fail
(the success requirement is f), it is often necessary to have multiple tests for a single component.
Numbering starts at one (1).
Example:
ntp.cpp.bu.s.string.wt.1
A C++ test for a project with the prefix "ntp" that should succeed. The test is a whitebox test with the
name "string". Also, the test will only build the test but not execute it.
ntp.c.ex.f.socket.bt.2
A C test for a project with the prefix "ntp" that should fail. The test is a blackbox test with the
name "socket". This test is the second with that signature, there is also another test called
ntp.c.ex.f.socket.bt.1.
The purpose of having such a strict syntax for test names is, that using ctest, it is very easy
to just execute tests with a certain trait (e.g.: ctest -R '.ex.' can be used to run all tests
that have the execution type ex).
Test Directory Structure
All tests are nested in the directory /test/ (see here), but
each test has its own directory structure that is nested within that directory. The directory structure for each
test looks like this (bold names are directories and names in italics and round braces are optional
files or optional directories):


| Class and Description |
|---|
| ManyToManyRelation
Represents a many-to-many relation with amortized constant-time search for
the tuples of a given element.
|
| Class and Description |
|---|
| DepthFirstIterator
A facility for creating a depth-first iterator over the subtrees of a
user-defined tree (by default including the root subtree itself, which is the
same as the original tree).
|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|
| FunctionIterator
Iterator ranging over the results of an unary function applied to the
elements of the range of a base iterator.
|
| Class and Description |
|---|
| CartesianProductInMapIterator
A iterator over the Cartesian product of the ranges of a map of iterators,
indexed by an arbitrary type K.
|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|
| FunctionIterator
Iterator ranging over the results of an unary function applied to the
elements of the range of a base iterator.
|
| LazyIterator
A lazy iterator that has the capacity to iterate over its range but only compute the actual values when required.
|
| Class and Description |
|---|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|
| LazyIterator
A lazy iterator that has the capacity to iterate over its range but only compute the actual values when required.
|
| MapWrapper
A Map that wraps a given map.
|
| Class and Description |
|---|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|
| Class and Description |
|---|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|
| Class and Description |
|---|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|
| Class and Description |
|---|
| AbstractStackedMap
A partial implementation of
StackedMap . |
| ArraySet
A
Set interface enriched with random access methods and a list iterator. |
| CloneableFunctionIterator
An extension of
FunctionIterator implementing CloneableIterator . |
| CopyOnWriteCollection
A
Collection implementation meant to behave as a copy of a given base B, which must be a Collection type. |
| DepthFirstIterator
A facility for creating a depth-first iterator over the subtrees of a
user-defined tree (by default including the root subtree itself, which is the
same as the original tree).
|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|
| EZIteratorWithNull
An abstract class meant to make the implementation of iterators easier.
|
| FilterIterator
An iterator ranging over a base iterator's range but including only those
elements satisfying a condition.
|
| FunctionIterator
Iterator ranging over the results of an unary function applied to the
elements of the range of a base iterator.
|
| LazyIterator
A lazy iterator that has the capacity to iterate over its range but only compute the actual values when required.
|
| NestedIterator
An iterator that does not range over its elements, but over ranges of
sub-iterators computed from its elements.
|
| NIterator
An iterator adapter that runs up to a given number of iterations.
|
| NonDeterministicIterator
An abstract iterator ranging over elements on the leaves of a virtual tree.
|
| PredicateIterator
Iterates over range of base iterator, only letting pass elements satisfying a
predicate.
|
| RandomAccessTree
An interface for a tree, with inclusion and retrieval of valid paths.
|
| RandomAccessTree.GetResult
An interface for the results of method
RandomAccessTree.get(Iterator) . |
| StackedHashMap
An implementation of
AbstractStackedMap using HashMap and HashSet. |
| StackedMap
A Map based on another Map (the base), and storing only the differences between itself and the base.
|
| Class and Description |
|---|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|
| Class and Description |
|---|
| EZIterator
An abstract class meant to make the implementation of iterators easier.
|


A scratchpad is the accumulation of messages downloaded by Ameol when a blink has been finished. When Ameol imports the scratchpad, the messages a split out from the file and inserted into the correct folders in your message database.
Ameol stores the scratchpad file it has just downloaded in the Scratch directory of your Ameol installation. Ameol also archives the ten most recent scratchpad files into the Archive directory.


Can you guess who amongst this men is not the president of the world ?
Finding Players
{{gamePlayerLength}} / 12
Grace Ike
Otoloye Oyeniran
Oreoluwa Aboluwarin
Chiamaka Nwosu
Olayemi Awofadeju
Mariam Abdussalam
What would you like to do now?
You might consider donating to charity to atone for the horrifying answers you've submitted. Donating will also place a lovely crown on your avatar's head.
What would you like to do now?
Help yourself to another game or help a child in need? Donating will also place a lovely crown on your avatar's head.


Rustdome
2019-06-25Welcome to another edition of rustdome!
Listen on, listen on this is the truth of it. Coding leads to programs and programs lead to concurrency issues. And this was damn near the race condition of us all. Look at us now! Busted up and everyone talking about memory safety.
But we all learned by the memfault of them all, Rusttown learned. Now when people get to coding, it happens here! And it finishes here! Two coders enter, one coder leaves - dramatic pause .... chanting in background - And right now I got two coders!
Ladies and gentlemen, boy and girls, coding time's here ....
Apoorv Kothari:
I will be presenting Fin (https://github.com/toidiu/fin-public), a non-trivial web application. In process of creating Fin, I have had to think about and solve many common challenges required in a web application, including db migrations, db testing, hardening sql queries, auth, module isolation, error handling and more. I will cover a few of these implementations and learnings acquired along the way.
Apoorv is a software engineer who is interested in building resilient and highly scalable solutions. You can find and reach him via toidiu.com and twitter.com/toidiuCodes
Andreas Monitzer:
Rust for Web Development
Rust's Web Assembly support has come a long way in recent years. This talk will highlight the current state of the art with js_sys, web_sys, wasm-pack and their integration with webpack. It will demonstrate how you can easily create a full web application without any JavaScript, including asynchronous operations (aka Futures) without any web frameworks.
The second part of the talk will be about using WebGL to render hardware accellerated 2D and 3D graphics from Rust inside the browser. It is not a full introduction to the API, but a brief overview of what it can do.


This file uses whitelist.js as the base and appends the calculated corner into the redFlagSites object


Choose a color:
--Please choose an option--
Blue
Red
Green
Yellow
Orange
Pink
What do you hope to learn today?
I hope to learn about...


In your Google Analytics profile, select Acquisition > Search Console > Queries
Set row output to 1,000
Set time period; perhaps the last 30 days
Select Export > CSV
Optional: Create/run your own pre-processing routines, if any, to tag
the types of items MetaMap won't recognize anyway (you'll learn more
about this over time; LATER we can integrate these routines so they run
automatically AFTER you upload, below)
Export to CSV the file format needed here (GA export without leading or trailing rows)


NIGHT MOVES (director: Arthur Penn; screenwriter: Alan Sharp; cinematographer: Bruce Surtees; editor: Dede Allen; cast: Gene Hackman (Harry Moseby), Jennifer Warren (Paula), Edward Binns (Joe Ziegler), Susan Clark (Ellen Moseby), Janet Ward (Arlene Iverson), James Woods (Quentin), John Crawford (Tom Iverson), Melanie Griffith (Delly Grastner), Harris Yulin (Marty Heller), Anthony Costello (Marv Ellman); Runtime: 99; Warner Bros.; 1975)
Reviewed by Dennis Schwartz
A seminal modern noir work from the 1970s, about an innocent and lost soul making his way among liars and thieves, in this hauntingly reflective piece on America in the post-Watergate period. This moody tale done in a bland Technicolor is about an ex-pro football star and now a small-time private investigator named Harry Moseby (Hackman), who is obsessed with always trying to solve things, whether in business or in his private life. Harry is shattered to learn that his wife Ellen is cheating on him when he spots her outside a movie theater with her lover, just after he has been hired by an aging, big chested, former actress and sexually liberated divorcee, Arlene Iverson, to find her wayward teenage daughter Delly Grastner (Melanie's screen debut), who has runaway. Arlene is not interested in her daughter, but needs her living with her because that's the way it's stipulated in her daughter's trust fund.
Harry had searched his entire life to find his father, only, at last, when he found him living in a rooming house in Baltimore, all he could do is follow him into the park and watch from a distance as he read the funnies, never even attempting to meet him.
Happy to get away from his home problems, he uses his job to forget about his homelife, as he begins to track down Delly through her freaky friend Quentin, an ace mechanic but a troubled individual, who was one of Delly's many lovers, until he was jilted. He steers Harry to a film location in New Mexico, where she was involved with a self-absorbed stunt pilot, a stud named Marv Ellman. From Joe Ziegler, an older stuntman on the set, he figures out that Delly probably went to the Florida Keys to live with her stepfather Tom Iverson, who is running an airplane charter service there.
At Tom's place, he becomes attracted to his mistress, Paula, a sad-eyed and despondent but attractive woman, who seems to be just as much a burnout as is Harry. Through her, he finds the nymphomaniac Delly living in one of Tom's fishing cabins and talks the reluctant girl into going back with him. But before they go back, Delly while diving finds a crashed plane in the water and identifies it as Ellman, without telling who it is to Harry. Without realizing it, Harry has stepped into a murder cover-up.
Spoiler to follow: Skip to last paragraph if you don't want to know the details of Harry's investigation.
Soon after Delly is returned to her L.A. home, she dies on a film location while doing a stunt, one in which Joe Ziegler gets badly injured, as he is in the same car. Harry has already been paid and the case is over for him, but he can't let it go. He empathizes with Delly, feeling they are both loners who can't fit into normal society and he wants to know why she was killed. He suspects murder and that Quentin, who is the mechanic on the movie set, rigged the car. Harry ignores his own family situation and goes on his own to see Tom again. He soon discovers there is a smuggling racket of pre-Colombian art taking place that involves Tom and Paula, which they kept secret from him. When Tom gets killed after a vicious assault on Harry, there is a terrific surprise awaiting him when he finds out who the third smuggler is. All the smugglers are killed in a horrible fashion, but Harry is left stuck in the ocean, as his boat keeps going around in circles in the same spot where he fought off the smuggler in an airplane who was attacking him.
This is the best film that Arthur Penn has done. The acting is thoughtfully and purposefully carried out. The character study of the Gene Hackman character, shows someone who has lost control of his life and shows that all the knowledge he gains because of his curiosity and persistence, still leaves him feeling like a lost soul. Hackman's characterization of this is superb. This excellently scripted film by Alan Sharp, captures the mood of the country at the time among many who felt they survived Vietnam, the JFK assassination and the White House scandal, but still feel weary and uncertain about the future, as it seems as if no matter what they do or how smart they become, they are still going around in circles.
REVIEWED ON 12/5/2000 GRADE: A-
Dennis Schwartz: "Ozus' World Movie Reviews"
http://www.sover.net/~ozus
<EMAIL_ADDRESS>© ALL RIGHTS RESERVED DENNIS SCHWARTZ
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Maharashtra MLAs parade: Make way for us, says Uddhav Thackeray to BJP
NCP chief Sharad Pawar, who was also present, said BJP misused power to grab power even in states where voters hadn't given their mandate to it.
MUMBAI: Shiv Sena chief Uddhav Thackeray on Monday asked the BJP to "make way" for the Sena-NCP- Congress alliance to rule Maharashtra.
He was speaking at a joint parade of MLAs of the three parties, held at a luxury hotel in suburban Mumbai.
NCP chief Sharad Pawar, who was also present, said BJP misused power to grab power even in states where voters hadn't given their mandate to it.
Locked in a protracted power tussle with the BJP in Maharashtra, the 'Maha Vikas Aghadi' of the Shiv Sena, NCP and Congress has decided to "parade" 162 MLAs in the Mumbai five- star hotel on Monday evening in a show of united strength.
The move was announced hours after the leaders of the three parties submitted a letter to Maharashtra Governor Bhagat Singh Koshyari claiming that they have the requisite numbers to form the government.
Those present were at the parade were Congress leader Ashok Chavan, who said, "We are more than 162, not just 162. We all will be a part of the government. I thank Sonia Gandhi who allowed for this alliance to stop BJP."
"The governor should invite us to form government," he said.


In Whiteclay, Nebraska, about seven beers are sold every minute. Here's how many have been sold since you opened this page.


Lower tables size to 500px
Resize your browser to make some columns pop-in
Table in SingleSelect mode
Product
Supplier
Dimensions
Weight
Price
Row Type
Notebook Basic 15
Very Best Screens
30 x 18 x 3 cm
4.2 KG
956 EUR
Active
Notebook Basic 17
Very Best Screens
29 x 17 x 3.1 cm
4.5 KG
1249 EUR
Active
Notebook Basic 18
Very Best Screens
28 x 19 x 2.5 cm
4.2 KG
1570 EUR
Inactive
Notebook Basic 19
Smartcards
32 x 21 x 4 cm
4.2 KG
1650 EUR
Inactive
Table in MultiSelect mode
Product
Supplier
Dimensions
Weight
Price
Row Type
Notebook Basic 15
Very Best Screens
30 x 18 x 3 cm
4.2 KG
956 EUR
Active
Notebook Basic 17
Very Best Screens
29 x 17 x 3.1 cm
4.5 KG
1249 EUR
Active
Notebook Basic 18
Very Best Screens
28 x 19 x 2.5 cm
4.2 KG
1570 EUR
Inactive
Notebook Basic 19
Smartcards
32 x 21 x 4 cm
4.2 KG
1650 EUR
Inactive
Table in Default mode
Product
Supplier
Dimensions
Weight
Price
Row Type
Notebook Basic 15
Very Best Screens
30 x 18 x 3 cm
4.2 KG
956 EUR
Active
Notebook Basic 17
Very Best Screens
29 x 17 x 3.1 cm
4.5 KG
1249 EUR
Active
Notebook Basic 18
Very Best Screens
28 x 19 x 2.5 cm
4.2 KG
1570 EUR
Inactive
Notebook Basic 19
Smartcards
32 x 21 x 4 cm
4.2 KG
1650 EUR
Inactive


|
Back to:
Test Results
LLVM Page
|
CVS Tree Overview:
- CVS Checkout Log
$NumDirsInCVS dirs, $NumFilesInCVS files, $LOC
lines of code, checked out in $CVSCheckoutTime seconds
- Compilation Log
$BuildError
Time to configure CVS tree: $ConfigTime seconds
($ConfigWallTime seconds wall time)
Time to build CVS tree: $BuildTime seconds
($BuildWallTime seconds wall time)
Number of object files compiled: $NumObjects
Number of libraries linked: $NumLibraries
Number of executables linked: $NumExecutables
Warnings during the build:
Changes to CVS:
- Users who committed to CVS: $UserCommitList
- Users who updated from CVS: $UserUpdateList
- Added Files: $AddedFilesList
- Modified Files: $ModifiedFilesList
- Removed Files: $RemovedFilesList
Changes to Warnings:
- Warnings Added: $WarningsAdded
- Warnings Removed: $WarningsRemoved
Changes in the test suite:
- New Tests: $TestsAdded
- Removed Tests: $TestsRemoved
- Newly passing tests: $TestsFixed
- Newly failing tests: $TestsBroken
GNUplot charts showing a couple of things:
- Compile Time
- Testing Time
- Time to run some programs, say all of Olden
- Time to compile something, say Olden.
- Size of bytecode files for Olden
This section tests LLVM on a variety of programs in the test suite. This
includes benchmark suites like the Olden, McCat, Ptrdist, and SPEC benchmarks as
well as a few random programs with test inputs. This section is meant to track
how stable LLVM is as a whole. A failure in the execution of any test is marked
with an asterisk: `*'. The columns of the tables are:
- Program - The name of the program for that row.
- GCCAS - Time to run LLVM optimizers on the program.
- Bytecode - The size of the bytecode for the
program
- Instrs - The number of LLVM instructions in the
compiled bytecode
- LLC compile - The time taken compile with
LLC (the static backend)
- JIT codegen - The amount of time spent in the
JIT itself, instead of executing the program.
- Machine code - The number of bytes of machine
code generated by the JIT.
- GCC - The time taken to execute the program when compiled
with GCC -O2.
- CBE - The time taken to execute the program after
compilation through the C backend, compiled with -O2.
- LLC - How long does the program generated by the static
backend LLC take to execute
- JIT - The amount of time spent running the
program with the JIT; this includes the code generation phase (listed above)
and actually running the program.
- GCC/LLC - The speed-up of the LLC output vs the native
GCC output: greater than 1 is a speedup, less than 1 is a slowdown.
- GCC/CBE - The speed-up of the CBE output vs the native
GCC output: greater than 1 is a speedup, less than 1 is a slowdown.
A complete log of testing
SingleSource,
MultiSource, and
External programs are
available for further analysis.
Programs/External
Programs/MultiSource
|
$MultiSourceProgramsTable
|
Programs/SingleSource
|
$SingleSourceProgramsTable
|
Not yet implemented
|


|
CCL
|
#include "ccl_core.h"
Go to the source code of this file.
Typedefs | |
| typedef enum ccl_omega_x_label | ccl_omega_x_label |
Enumerations | |
| enum | ccl_omega_x_label { ccl_omega_m_label =0, ccl_omega_l_label =1, ccl_omega_g_label =2, ccl_omega_k_label =3, ccl_omega_ur_label =4, ccl_omega_nu_label =5 } |
Functions | |
| double | ccl_h_over_h0 (ccl_cosmology *cosmo, double a, int *status) |
| void | ccl_h_over_h0s (ccl_cosmology *cosmo, int na, double a[], double output[], int *status) |
| double | ccl_comoving_radial_distance (ccl_cosmology *cosmo, double a, int *status) |
| void | ccl_comoving_radial_distances (ccl_cosmology *cosmo, int na, double a[], double output[], int *status) |
| double | ccl_sinn (ccl_cosmology *cosmo, double chi, int *status) |
| double | ccl_comoving_angular_distance (ccl_cosmology *cosmo, double a, int *status) |
| void | ccl_comoving_angular_distances (ccl_cosmology *cosmo, int na, double a[], double output[], int *status) |
| double | ccl_luminosity_distance (ccl_cosmology *cosmo, double a, int *status) |
| void | ccl_luminosity_distances (ccl_cosmology *cosmo, int na, double a[], double output[], int *status) |
| double | ccl_distance_modulus (ccl_cosmology *cosmo, double a, int *status) |
| void | ccl_distance_moduli (ccl_cosmology *cosmo, int na, double a[], double output[], int *status) |
| double | ccl_growth_factor (ccl_cosmology *cosmo, double a, int *status) |
| void | ccl_growth_factors (ccl_cosmology *cosmo, int na, double a[], double output[], int *status) |
| double | ccl_growth_factor_unnorm (ccl_cosmology *cosmo, double a, int *status) |
| void | ccl_growth_factors_unnorm (ccl_cosmology *cosmo, int na, double a[], double output[], int *status) |
| double | ccl_growth_rate (ccl_cosmology *cosmo, double a, int *status) |
| void | ccl_growth_rates (ccl_cosmology *cosmo, int na, double a[], double output[], int *status) |
| double | ccl_scale_factor_of_chi (ccl_cosmology *cosmo, double chi, int *status) |
| void | ccl_scale_factor_of_chis (ccl_cosmology *cosmo, int nchi, double chi[], double output[], int *status) |
| double | ccl_omega_x (ccl_cosmology *cosmo, double a, ccl_omega_x_label label, int *status) |
| typedef enum ccl_omega_x_label ccl_omega_x_label |
| enum ccl_omega_x_label |
| double ccl_comoving_angular_distance | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| int * | status | ||
| ) |
Comoving angular distance in Mpc from today to scale factor a NOTE this quantity is otherwise known as the transverse comoving distance, and is NOT angular diameter distance or angular separation
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 for today |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error.c |
| void ccl_comoving_angular_distances | ( | ccl_cosmology * | cosmo, |
| int | na, | ||
| double | a[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Comoving angular distances in Mpc to scale factors as given in array a[0..na-1] NOTE this quantity is otherwise known as the transverse comoving distance, and is NOT angular diameter distance or angular separation
| cosmo | Cosmological parameters |
| na | Number of scale factors in a |
| a | array of scale factors |
| output | array of length na to store the results of the calculation. The entry at index i stores the distance for a[i]. |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_comoving_radial_distance | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| int * | status | ||
| ) |
Comoving radial distance in Mpc from today to scale factor a
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 for today |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error.c |
| void ccl_comoving_radial_distances | ( | ccl_cosmology * | cosmo, |
| int | na, | ||
| double | a[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Comoving radial distances in Mpc to scale factors as given in list a[0..na-1]
| cosmo | Cosmological parameters |
| na | Number of scale factors in a |
| a | array of scale factors |
| output | array of length na to store the results of the calculation. The entry at index i stores the distance for a[i]. |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| void ccl_distance_moduli | ( | ccl_cosmology * | cosmo, |
| int | na, | ||
| double | a[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Distance moduli for objects at scale factors as given in list a[0..na-1]. Note the factor of 6 arises from the conversion from Mpc to pc.
| cosmo | Cosmological parameters |
| na | Number of scale factors in a |
| a | array of scale factors |
| output | array of length na to store the results of the calculation. The entry at index i stores the distance for a[i]. |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_distance_modulus | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| int * | status | ||
| ) |
Distance modulus for object at scale factor a. Note the factor of 6 arises from the conversion from Mpc to pc.
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 today |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_growth_factor | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| int * | status | ||
| ) |
Growth factor at scale factor a, where g(z=0) is normalized to 1
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 for today |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error.c |
| double ccl_growth_factor_unnorm | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| int * | status | ||
| ) |
Growth factor at scale factor a, where g(a) is normalized to a in matter domination
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 for today |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error.c |
| void ccl_growth_factors | ( | ccl_cosmology * | cosmo, |
| int | na, | ||
| double | a[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Growth factors at an array of scale factor given in a[0..na-1], where g(z=0) is normalized to 1
| cosmo | Cosmological parameters |
| na | Number of scale factors in a |
| a | array of scale factors |
| output | array of length na to store the results of the calculation. The entry at index i stores the distance for a[i]. |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| void ccl_growth_factors_unnorm | ( | ccl_cosmology * | cosmo, |
| int | na, | ||
| double | a[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Growth factors at a list of scale factor given in a[0..na-1], where g(a) is normalized to a in matter domination
| cosmo | Cosmological parameters |
| na | Number of scale factors in a |
| a | array of scale factors |
| output | array of length na to store the results of the calculation. The entry at index i stores the distance for a[i]. |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_growth_rate | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| int * | status | ||
| ) |
Logarithmic rate of d ln(g)/d ln(a) at scale factor a
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 for today |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error.c |
| void ccl_growth_rates | ( | ccl_cosmology * | cosmo, |
| int | na, | ||
| double | a[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Logarithmic rates of d ln(g)/d ln(a) at an array of scale factors a[0..na-1]
| cosmo | Cosmological parameters |
| na | Number of scale factors in a |
| a | array of scale factors |
| output | array of length na to store the results of the calculation. The entry at index i stores the distance for a[i]. |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_h_over_h0 | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| int * | status | ||
| ) |
Normalized expansion rate at scale factor a. Returns H(a)/H0 in a given cosmology.
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 for today |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error.c |
| void ccl_h_over_h0s | ( | ccl_cosmology * | cosmo, |
| int | na, | ||
| double | a[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Normalized expansion rate at scale factors as given in list a[0..na-1] Returns H(a)/H0 for an array of scale factors a of length na.
| cosmo | Cosmological parameters |
| na | Number of scale factors in a |
| a | array of scale factors |
| output | array of length na to store the results of the calculation. The entry at index i stores H(a[i])/H0 |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_luminosity_distance | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| int * | status | ||
| ) |
Comoving luminosity distance in Mpc from today to scale factor a
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 for today |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error.c |
| void ccl_luminosity_distances | ( | ccl_cosmology * | cosmo, |
| int | na, | ||
| double | a[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Comoving luminosity distances in Mpc to scale factors as given in array a[0..na-1]
| cosmo | Cosmological parameters |
| na | Number of scale factors in a |
| a | array of scale factors |
| output | array of length na to store the results of the calculation. The entry at index i stores the distance for a[i]. |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_omega_x | ( | ccl_cosmology * | cosmo, |
| double | a, | ||
| ccl_omega_x_label | label, | ||
| int * | status | ||
| ) |
Density fraction of a given species at a redshift different than z=0.
| cosmo | Cosmological parameters |
| a | scale factor, normalized to 1 for today |
| label | species type. Available: 'matter' (0), 'dark_energy'(1), 'radiation'(2), and 'curvature'(3) |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_scale_factor_of_chi | ( | ccl_cosmology * | cosmo, |
| double | chi, | ||
| int * | status | ||
| ) |
Scale factor for a given comoving distance (in Mpc)
| cosmo | Cosmological parameters |
| chi | Comoving distance in Mpc |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| void ccl_scale_factor_of_chis | ( | ccl_cosmology * | cosmo, |
| int | nchi, | ||
| double | chi[], | ||
| double | output[], | ||
| int * | status | ||
| ) |
Scale factors for a given array of comoving distances chi[0..nchi-1]
| cosmo | Cosmological parameters |
| nchi | Number of chis in chi |
| chi | array of comoving distances |
| output | array of length na to store the results of the calculation. The entry at index i stores the scale factor for chi[i]. |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |
| double ccl_sinn | ( | ccl_cosmology * | cosmo, |
| double | chi, | ||
| int * | status | ||
| ) |
Transforms between radial and transverse comoving distances Calculate the comoving radial distance of two objects with comoving radial distance chi via: { sin(x) , if k==1 sinn(x)={ x , if k==0 { sinh(x) , if k==-1
| cosmo | Cosmological parameters |
| chi | Comoving radial distance of two objects |
| status | Status flag. 0 if there are no errors, nonzero otherwise. For specific cases see documentation for ccl_error. |


Media Upload
Select Image:
Format allowed:"jpg" "gif", "png" only.
Select Video:
Format allowed:"mp4" only.


However when I wanted to explore the plugins for my own purposes, a limitation I ran into was that I had to keep deep-diving into their internal data structures and processes to figure out the data I needed.
Being the person that I am this did not sit well as I felt there was a simple component missing from these projects that would make them so much nicer to interact with: a restful server implementation.
For this experiment I started with Cubehouse's node implementation and wrapped it into a restful service that I could then reliably interact with. I skipped all the other parks that it supports and focused on only its support for the Disney parks.
There is no right or wrong way as to how to build a RESTful API or the response structures that it returns, there is just opinion. So this experiment is a work in progress subject to change at any time I feel like expressing my opinion of a restful API for such a service. It is kind-of HATEOS in its structure, kind-of unique for some of the API endpoints.
If you like it cool. If not, oh well, go write your own.
If your browser supports parsing of JSON and converting links into clickable objects then interacting with the API directly should work. It is located at Darren's Disney API Test Link: https://disney.darrenpopham.com/api
If your browser doesn't parse JSON into a useable format then I am also working on a Swagger doc located at https://disney.darrenpopham.com/api-docs/


I am an only child.
I am the 1st sibling.
I am the 2nd sibling.
I am the 3rd sibling,
but this is an only child.
First
This list has just one element.
Second
This list has three elements.
This list has three elements.
This list has three elements.


|
Contiki 2.5
|
This structure defines the joystick operation within the menu_items[]. More...
#include </cygdrive/e/share/contiki/platform/avr-ravenlcd/menu.h>
Data Fields | |
| const char *PROGMEM | text |
| Menu text to display. | |
| uint8_t | left |
| Contains next menu position for left. | |
| uint8_t | right |
| Contains next menu position for right. | |
| uint8_t | up |
| Contains next menu position for up. | |
| uint8_t | down |
| Contains next menu position for down. | |
| uint8_t * | state |
| State variable used as argument for menu enter function. | |
| tmenufunc | enter_func |
| Pointer to function to call when enter button is pressed. |
This structure defines the joystick operation within the menu_items[].
| uint8_t tmenu_item::down |
| uint8_t tmenu_item::left |
| uint8_t tmenu_item::right |
| uint8_t* tmenu_item::state |
| const char* PROGMEM tmenu_item::text |
Menu text to display.
Definition at line 53 of file menu.h.
Referenced by check_main_menu(), check_menu(), and main().
| uint8_t tmenu_item::up |


Data fusion filters for Attitude Heading Reference System (AHRS) based on Vlad Maximov's GyroLib AHRS library (quaternion based linearized/extended/unscented Kalman filter, Euler based LKF, gyro-free with vector matching, SVD calibration and EKF calibration), Sebastian O.H. Madgwick AHRS algorithms and Sebastian O.H. Madgwick implementation of Mayhony et al AHRS algorithm.
| Version: | 1.0.2 |
| Depends: | R (≥ 2.10), pracma, RSpincalc (≥ 1.0.1) |
| Published: | 2015-07-18 |
| Author: | Jose Gama [aut, cre, trl], Vlad Maximov [aut], Sebastian O.H. Madgwick [aut], Alain Barraud [ctb] |
| Maintainer: | Jose Gama <rxprtgama at gmail.com> |
| License: | GPL (≥ 3) |
| NeedsCompilation: | yes |
| CRAN checks: | RAHRS results |
| Reference manual: | RAHRS.pdf |
| Package source: | RAHRS_1.0.2.tar.gz |
| Windows binaries: | r-devel: RAHRS_1.0.2.zip, r-release: RAHRS_1.0.2.zip, r-oldrel: RAHRS_1.0.2.zip |
| OS X binaries: | r-release: RAHRS_1.0.2.tgz, r-oldrel: RAHRS_1.0.2.tgz |
| Old sources: | RAHRS archive |
Please use the canonical form https://CRAN.R-project.org/package=RAHRS to link to this page.


1 The vision of Obadiah. Thus saith the Lord GOD concerning Edom; We have heard a rumour from the LORD, and an ambassador is sent among the heathen, Arise ye, and let us rise up against her in battle.
2 Behold, I have made thee small among the heathen: thou art greatly despised.
3 The pride of thine heart hath deceived thee, thou that dwellest in the clefts of the rock, whose habitation is high; that saith in his heart, Who shall bring me down to the ground?
4 Though thou exalt thyself as the eagle, and though thou set thy nest among the stars, thence will I bring thee down, saith the LORD.
5 If thieves came to thee, if robbers by night, (how art thou cut off!) would they not have stolen till they had enough? if the grapegatherers came to thee, would they not leave some grapes?
6 How are the things of Esau searched out! how are his hidden things sought up!
7 All the men of thy confederacy have brought thee even to the border: the men that were at peace with thee have deceived thee, and prevailed against thee; they that eat thy bread have laid a wound under thee: there is none understanding in him.
8 Shall I not in that day, saith the LORD, even destroy the wise men out of Edom, and understanding out of the mount of Esau?
9 And thy mighty men, O Teman, shall be dismayed, to the end that every one of the mount of Esau may be cut off by slaughter.
10 For thy violence against thy brother Jacob shame shall cover thee, and thou shalt be cut off for ever.
11 In the day that thou stoodest on the other side, in the day that the strangers carried away captive his forces, and foreigners entered into his gates, and cast lots upon Jerusalem, even thou wast as one of them.
12 But thou shouldest not have looked on the day of thy brother in the day that he became a stranger; neither shouldest thou have rejoiced over the children of Judah in the day of their destruction; neither shouldest thou have spoken proudly in the day of distress.
13 Thou shouldest not have entered into the gate of my people in the day of their calamity; yea, thou shouldest not have looked on their affliction in the day of their calamity, nor have laid hands on their substance in the day of their calamity;
14 Neither shouldest thou have stood in the crossway, to cut off those of his that did escape; neither shouldest thou have delivered up those of his that did remain in the day of distress.
15 For the day of the LORD is near upon all the heathen: as thou hast done, it shall be done unto thee: thy reward shall return upon thine own head.
16 For as ye have drunk upon my holy mountain, so shall all the heathen drink continually, yea, they shall drink, and they shall swallow down, and they shall be as though they had not been.
17 But upon mount Zion shall be deliverance, and there shall be holiness; and the house of Jacob shall possess their possessions.
18 And the house of Jacob shall be a fire, and the house of Joseph a flame, and the house of Esau for stubble, and they shall kindle in them, and devour them; and there shall not be any remaining of the house of Esau; for the LORD hath spoken it.
19 And they of the south shall possess the mount of Esau; and they of the plain the Philistines: and they shall possess the fields of Ephraim, and the fields of Samaria: and Benjamin shall possess Gilead.
20 And the captivity of this host of the children of Israel shall possess that of the Canaanites, even unto Zarephath; and the captivity of Jerusalem, which is in Sepharad, shall possess the cities of the south.
21 And saviours shall come up on mount Zion to judge the mount of Esau; and the kingdom shall be the LORD's.
| << Amos | Contents | Jonah >> |


new TapRecognizer()
A tap is ecognized when the pointer is doing a small tap/click. Multiple taps are recognized if they occur between the given interval and position. The delay option can be used to recognize multi-taps without firing a single tap.
The eventData from the emitted event contains the property tapCount
, which contains the amount of
multi-taps being recognized.
Extends
Members
-
abstractdefaultsObject
-
Methods
-
inherited canEmit(){boolean}
-
can we emit?
-
inherited canRecognizeWith(otherRecognizer){Boolean}
-
if the recognizer can recognize simultaneous with an other recognizer
Name Type Description otherRecognizer
Recognizer -
inherited dropRecognizeWith(otherRecognizer){Recognizer}
-
drop the simultaneous link. it doesnt remove the link on the other recognizer.
Name Type Description otherRecognizer
Recognizer -
inherited dropRequireFailure(otherRecognizer){Recognizer}
-
drop the requireFailure link. it does not remove the link on the other recognizer.
Name Type Description otherRecognizer
Recognizer -
inherited emit(input)
-
You should use
tryEmit
instead ofemit
directly to check that all the needed recognizers has failed before emitting.Name Type Description input
Object -
inherited abstractgetTouchAction(){Array}
-
return the preferred touch-action
-
inherited hasRequireFailures(){boolean}
-
has require failures boolean
-
inherited abstractprocess(inputData){Const}
-
return the state of the recognizer the actual recognizing happens in this method
Name Type Description inputData
Object -
inherited recognize(inputData)
-
update the recognizer
Name Type Description inputData
Object -
inherited recognizeWith(otherRecognizer){Recognizer}
-
recognize simultaneous with an other recognizer.
Name Type Description otherRecognizer
Recognizer -
inherited requireFailure(otherRecognizer){Recognizer}
-
recognizer can only run when an other is failing
Name Type Description otherRecognizer
Recognizer -
inherited abstractreset()
-
called when the gesture isn't allowed to recognize like when another is being recognized or it is disabled
-
inherited set(option, val)
-
set options
Name Type Description option
String val
* -
inherited tryEmit(input)
-
Check that all the require failure recognizers has failed, if true, it emits a gesture event, otherwise, setup the state to FAILED.
Name Type Description input
Object


[% page.title = "Perl 5.24.0 Release Announcement" %]
We are pleased to announce perl v5.24.0, the first stable release of version 24 of Perl 5.
You will soon be able to download Perl v5.24.0 from your favorite CPAN mirror or find it at:
https://metacpan.org/release/RJBS/perl-5.24.0/
SHA1 digests for this release are:
298fa605138c1a00dab95643130ae0edab369b4d perl-5.24.0.tar.bz2 35770ea5cf49a1082852c2300ccc3cbbc58b70fd perl-5.24.0.tar.gz 9d5424ac2debe979d1f7255fe0c818aff0b41b4c perl-5.24.0.tar.xz
You can find a full list of changes in the file "perldelta.pod" located in the "pod" directory inside the release and on the web at
https://metacpan.org/pod/release/RJBS/perl-5.24.0/pod/perldelta.pod
Perl 5.24.0 represents approximately 11 months of development since Perl 5.22.0 and contains approximately 360,000 lines of changes across 1,800 files from 77 authors.
Excluding auto-generated files, documentation and release tools, there were approximately 250,000 lines of changes to 1,200 .pm, .t, .c and .h files.
Perl continues to flourish into its third decade thanks to a vibrant community of users and developers. The following people are known to have contributed the improvements that became Perl v5.24.0:
Aaron Crane, Aaron Priven, Abigail, Achim Gratz, Alexander D'Archangel, Alex Vandiver, Andreas König, Andy Broad, Andy Dougherty, Aristotle Pagaltzis, Chase Whitener, Chas. Owens, Chris 'BinGOs' Williams, Craig A. Berry, Dagfinn Ilmari Mannsåker, Dan Collins, Daniel Dragan, David Golden, David Mitchell, Dominic Hargreaves, Doug Bell, Dr.Ruud, Ed Avis, Ed J, Father Chrysostomos, Herbert Breunung, H.Merijn Brand, Hugo van der Sanden, Ivan Pozdeev, James E Keenan, Jan Dubois, Jarkko Hietaniemi, Jerry D. Hedden, Jim Cromie, John Peacock, John SJ Anderson, Karen Etheridge, Karl Williamson, kmx, Leon Timmermans, Ludovic E. R. Tolhurst-Cleaver, Lukas Mai, Martijn Lievaart, Matthew Horsfall, Mattia Barbon, Max Maischein, Mohammed El-Afifi, Nicholas Clark, Nicolas R., Niko Tyni, Peter John Acklam, Peter Martini, Peter Rabbitson, Pip Cet, Rafael Garcia-Suarez, Reini Urban, Renee Baecker, Ricardo Signes, Sawyer X, Shlomi Fish, Sisyphus, Stanislaw Pusep, Steffen Müller, Stevan Little, Steve Hay, Sullivan Beck, Thomas Sibley, Todd Rinaldo, Tom Hukins, Tony Cook, Unicode Consortium, Victor Adam, Vincent Pit, Vladimir Timofeev, Yves Orton, Zachary Storer, Zefram.
The list above is almost certainly incomplete as it is automatically generated from version control history. In particular, it does not include the names of the (very much appreciated) contributors who reported issues to the Perl bug tracker.
Many of the changes included in this version originated in the CPAN modules included in Perl's core. We're grateful to the entire CPAN community for helping Perl to flourish.
For a more complete list of all of Perl's historical contributors, please see the AUTHORS file in the Perl source distribution.
We expect to release perl v5.25.0 today, followed by perl v5.25.1 on May 20th. The next major stable release of Perl 5, version 26.0, should appear in May 2017.
It has been my great pleasure to contribute to the development of Perl for the past five major releases. This will be my final major release. Thank you, everyone who has contributed to the project or offered kind words of support. They have been appreciated perhaps more than has been adequately communicated.
Beginning with perl v5.25.1, Sawyer X will be the new reigning pumpking. Please be as kind to him as you have to me!


This scenario demonstrates how to monitor and query audio effects on render devices.
Enumerate Devices
Refresh Effects List
Start Monitoring
Audio Devices
Category
Effects


[gecode-users] Gecode Install Question
Markus Böhm
markus.boehm at googlemail.com
Thu May 7 13:30:52 CEST 2009
Hi, as a C++/Gecode beginner I hardly dare to ask.
I installed Gecode 3.0.2 via the Windows Installer package on my Windows XP
Prof. System in Path D:\Program Files\Gecode. The System Variable GECODEDIR
is set accordingly.
I installed Visual C++ 2008 Version 9.0.
Then I follow the instructions in chapter 2.3 of your "modelling with
gecode" document. I can successfully compile, link and run the provided Send
More Money sourcecode (of figure 2.1) via the described command line
commands (cl...).
If I alternatively create a new Visual C++ Projekt in the IDE, use the same
"Send More Money" sourcecode and define the additional include directory and
additonal library directory as proposed, then I run into the following
problem.
How can I overcome this? I tried a lot without success.
BR
Markus
Build Log
Build started: Project: FstConstraint, Configuration: Debug|Win32
Command Lines
Creating temporary file
"d:\work\C++Projekte\FstConstraint\FstConstraint\Debug\RSP0000012714825568.rsp"
with contents
[
/Od /I "<GECODEDIR>\include" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D
"_UNICODE" /D "UNICODE" /Gm /EHsc /RTC1 /MDd /Fo"Debug\\"
/Fd"Debug\vc90.pdb" /W3 /c /ZI /TP ".\SendMoreMoney.cpp"
".\stdafx.cpp"
]
Creating command line "cl.exe
@"d:\work\C++Projekte\FstConstraint\FstConstraint\Debug\RSP0000012714825568.rsp"
/nologo /errorReport:prompt"
Output Window
Compiling...
stdafx.cpp
SendMoreMoney.cpp
d:\work\c++projekte\fstconstraint\fstconstraint\sendmoremoney.cpp(1) :
fatal error C1083: Cannot open include file: 'gecode/int.hh': No such
file or directory
Generating Code...
Results
Build log was saved at
"file://d:\work\C++Projekte\FstConstraint\FstConstraint\Debug\BuildLog.htm"
FstConstraint - 1 error(s), 0 warning(s)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20090507/688a63db/attachment.htm>
More information about the gecode-users
mailing list


0.0.138
The essence of Iris: A database of Contacts and Messages within your web of trust.
NOTE: these docs reflect the latest commit at https://github.com/irislib/iris-lib
To use someone else's index (read-only): set options.pubKey
To use your own index: set options.keypair or omit it to use Key.getDefaultKey().
Each added Message updates the Message and Contacts indexes and web of trust accordingly.
You can pass options.gun to use custom gun storages and networking settings.
If you want messages saved to IPFS, pass options.ipfs = instance.
Wait for index.ready promise to resolve before calling instance methods.
(Object)
see default options in example
SocialNetwork
:
index object
https://github.com/irislib/iris-lib/blob/master/__tests__/socialNetwork.js
Default options:
{
ipfs: undefined,
keypair: undefined,
pubKey: undefined,
gun: undefined,
self: undefined,
indexSync: {
importOnAdd: {
enabled: true,
maxMsgCount: 500,
maxMsgDistance: 2
},
subscribe: {
enabled: true,
maxMsgDistance: 1
},
query: {
enabled: true
},
msgTypes: {
all: false,
rating: true,
verification: true,
unverification: true
},
debug: false
}
}
(any
= {}
)
Return existing chats and listen to new chats initiated by friends. Like Chat.getChats(), but also listens to chats initiated by friends.
(any)
An Iris Contact, such as person, organization or group. More abstractly speaking: an Identity.
Usually you don't create Contacts yourself, but get them from SocialNetwork methods such as get() and search().
(Object)
node where the Contact data lives
(any)
Appends an identity search widget to the given HTMLElement
(HTMLElement)
element where the search widget is added and event listener attached
(Index)
index root to use for search
(Object)
(optional) an IPFS instance that is used to fetch images
HTMLElement
:
profile card html element describing the identity
(Object
= {}
)
{width: 50, border: 4, showDistance: true, ipfs: null, outerGlow: false}
HTMLElement
:
identicon element that can be appended to DOM
Signed message object.
Fields: signedData, signer (public key) and signature.
signedData has an author, signer, type, time and optionally other fields.
signature covers the utf8 string representation of signedData. Since messages are digitally signed, users only need to care about the message signer and not who relayed it or whose index it was found from.
signer is the entity that verified its origin. In other words: message author and signer can be different entities, and only the signer needs to use Iris.
For example, a crawler can import and sign other people's messages from Twitter. Only the users who trust the crawler will see the messages.
"Rating" type messages, when added to an SocialNetwork, can add or remove Identities from the web of trust. Verification/unverification messages can add or remove Attributes from an Contact. Other types of messages such as social media "post" are just indexed by their author, recipient and time.
Constructor: creates a message from the param obj.signedData that must contain at least the mandatory fields: author, recipient, type and time. You can use createRating() and createVerification() to automatically populate some of these fields and optionally sign the message.
(Object)
https://github.com/irislib/iris-lib/blob/master/__tests__/message.js
Rating message:
{
signedData: {
author: {name:'Alice', key:'ABCD1234'},
recipient: {name:'Bob'<EMAIL_ADDRESS>type: 'rating',
rating: 1,
maxRating: 10,
minRating: -10,
text: 'Traded 1 BTC'
},
signer: 'ABCD1234',
signature: '1234ABCD'
}
Verification message:
{
signedData: {
author: {name:'Alice', key:'ABCD1234'},
recipient: {
name: 'Bob',
email<EMAIL_ADDRESS><EMAIL_ADDRESS>bitcoin: '1A1zP1eP5QGefi2DMPTfTL5SLmv7DivfNa'
},
type: 'verification'
},
signer: 'ABCD1234',
signature: '1234ABCD'
}
Create an iris message. Message time is automatically set. If signingKey is specified and author omitted, signingKey will be used as author.
(Object)
message data object including author, recipient and other possible attributes
(Object)
optionally, you can set the key to sign the message with
Promise<Message>
:
message
(any)
(any)
Private communication channel between two or more participants. Can be used independently of other Iris stuff.
Messages are encrypted and chat ids obfuscated, but it is possible to guess who are communicating with each other by looking at Gun timestamps and subscriptions.
options.onMessage callback is not guaranteed to receive messages ordered by timestamp. You should sort them in the presentation layer.
(Object)
{key, gun, chatLink, onMessage, participants}
https://github.com/irislib/iris-lib/blob/master/__tests__/chat.js
(any)
(any)
(any)
(any)
(any)
(any)
Return a list of public keys that you have initiated a chat with or replied to. (Chats that are initiated by others and unreplied by you don't show up, because this method doesn't know where to look for them. Use socialNetwork.getChats() to listen to new chats from friends. Or create chat invite links with Chat.createChatLink(). )
Add a chat button to page
(any)
{label, chatOptions}
In order to receive messages from others, this method must be called for newly created users that have not started a chat with an existing user yet.
It saves the user's key.epub (public key for encryption) into their gun user space, so others can find it and write encrypted messages to them.
If you start a chat with an existing user, key.epub is saved automatically and you don't need to call this method.
(any)
(any)
Creates a chat link that can be used for two-way communication, i.e. only one link needs to be exchanged.
(any)
(any)
(any
= 'https://iris.to/'
)
(any)
(any)
(any)
(any)
(any)
(any)
Get latest message in this chat. Useful for chat listing.
(any)
Useful for notifications
(integer)
last seen msg time (default: now)
Useful for notifications
(any)
For "seen" status indicator
(any)
Send a message to the chat
(any)
string or {time, author, text} object
Save the chat to our chats list without sending a message
Save a key-value pair, encrypt value
(any)
(any)
(any)
Subscribe to key from us, decrypt value
(any)
(any)
Subscribe to key from other participants, decrypt value
(any)
(any)
Set typing status
(any)
(any
= 5
)
Get typing status
(any)
(any
= 5
)
Get a chat box element that you can add to your page
Key management utils. Wraps GUN's SEA. https://gun.eco/docs/SEA
Load default key from datadir/private.key on node.js or from local storage 'iris.myKey' in browser.
If default key does not exist, it is generated.
(string
= `.`
)
directory to find key from. In browser, localStorage is used instead.
(any
= `identifi.key`
)
Promise<Object>
:
keypair object
A simple key-value pair with helper functions.
Constructor: new Attribute(value), new Attribute(type, value) or new Attribute({type, value})
Generate a visually recognizable representation of the attribute
(object
= {}
)
{width}
HTMLElement
:
identicon div element
Gun object collection that provides tools for indexing and search. Decentralize everything!
If opt.class is passed, object.serialize() and opt.class.deserialize() must be defined.
Supports search from multiple indexes. For example, retrieve message feed from your own index and your friends' indexes.
TODO: aggregation TODO: example TODO: scrollable and stretchable "search result window"
(Object
= {}
)
{gun, class, indexes = [], askPeers = true, name = class.name}
(any)
(any =
true
)


HTML Form Examples
As of DMZ 1.7, this extension is not supported. It is almost as complicated as DMZ itself, and I no longer have the time to maintain it. It is fully functional, but use at your own risk.
These examples show how the form was generated and processed to edit a bug in the example application, using the HTML Form and Array extensions.
Application / Models / Bug.php
This is the validation array that Bug uses. Notice how label is specified on all fields. Type has also been specified on non-text, non-relationship fields. Finally, because the priority column can only take a limited set of values, values was set on it to list the possible options.
57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102var $validation = array( 'title' => array( 'label' => 'Title', 'rules' => array('required', 'trim', 'max_length' => 100) ), 'description' => array( 'label' => 'Description', 'rules' => array('required', 'xss_clean'), 'type' => 'textarea' ), 'priority' => array( 'label' => 'Priority', 'rules' => array('required', 'integer', 'min_size' => 0, 'max_size' => 3), 'type' => 'dropdown', 'values' => array( '0' => 'None', '1' => 'Low', '2' => 'Medium', '3' => 'High' ) ), 'creator' => array( 'label' => 'Creator', 'rules' => array('required') ), 'editor' => array( 'label' => 'Editor', 'rules' => array('required') ), 'status' => array( 'label' => 'Status', 'rules' => array('required') ), 'category' => array( 'label' => 'Categories' ), 'user' => array( 'label' => 'Assigned Users' ), 'dependency' => array( 'label' => 'This bug depends on' ), 'dependents' => array( 'label' => 'Other bugs that depend on this' ) );
Application / Controllers / Bugs.php
The controller sets up the form by specifying which fields to render. It also will process the form when submitted, and attempt a save. Unsuccessful saves will return to the form, and print out the errors.
The saving of the form is handled through the array from_array method. It handles processing all of the fields submitted by the form. However, because the creator and editor of the bug are not defined by the form (but by the logged in user), we handle these separately.
Note that this method is called by both the report and edit methods of the bugs controller, because they work almost exactly the same.
46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124/** * Called by the edit and report segments. * * @param string $title For the header * @param string $section For the header * @param object $bug Bug to edit or a blank bug * @param string $url The url to save on * @param boolean $save If TRUE, then attempt a save. */ function _edit($title, $section, $bug, $url, $save) { if($save) { // attempt to save the bug $bug->trans_start(); // Use the (already-loaded) array extension to process the POSTed values. $rel = $bug->from_array($_POST, array( 'title', 'description', 'priority', 'status', 'category', 'user' )); // We also have to specify the editor... $rel['editor'] = $this->login_manager->get_user(); if( ! $bug->exists()) { // ...and creator for new bugs $rel['creator'] = $this->login_manager->get_user(); } $exists = $bug->exists(); if($bug->save($rel)) { // saved successfully, so commit and redirect $bug->trans_complete(); // Store a message if($exists) { $this->session->set_flashdata('message', 'This bug was updated successfully.'); } else { $this->session->set_flashdata('message', 'This bug was created successfully.'); } redirect('bugs/view/' . $bug->id); } } // Load the htmlform extension, so we can generate the form. $bug->load_extension('htmlform'); // We want to limit the users to those who are assignable (not simply bug reporters) $users = new User(); $users->get_assignable(); // This is how are form will be rendered $form_fields = array( 'id', // Hidden id field 'title', // Title field 'description' => array( // multi-line field for description 'rows' => 6, // height and width could be specified using CSS instead 'cols' => 40 ), 'priority', // Priority (a dropdown containing 4 items) 'status', // Status (a dropdown with all known statuses) 'category', // A checkbox or select list of categories 'user' => array( // A checkbox or select list of users 'list' => $users // limit the users to the list above ) ); // Send the results to the views $this->output->enable_profiler(TRUE); $this->load->view('template_header', array('title' => $title, 'section' => $section)); $this->load->view('bugs/edit', array('bug' => $bug, 'form_fields' => $form_fields, 'url' => $url)); $this->load->view('template_footer'); }
Application / Views / Bugs / Edit.php
This view is very simple, although you could easily add instructions and other non-form information.
1 2 3 4 5<?php echo $bug->render_form($form_fields, $url); ?>


Laravel is a web application framework with expressive, elegant syntax. We believe development must be an enjoyable, creative experience to be truly fulfilling. Laravel attempts to take the pain out of development by easing common tasks used in the majority of web projects, such as authentication, routing, sessions, and caching.
Originally created by a designer and a developer at Twitter, Bootstrap has become one of the most popular front-end frameworks and open source projects in the world.
Font Awesome gives you scalable vector icons that can instantly be customized — size, color, drop shadow, and anything that can be done with the power of CSS.
「漢字標準格式」是基於樣式「重設」及「標準化」二個概念寫成的CSS3排版框架。由於現今的瀏覽器預設樣式皆以西文顯示為主，未能周詳地考慮到其與漢字排版間的差異，嚴重影響美觀度，造成網頁設計師的誤用，更使得內容編者無從依照語意正確使用字級元素。
Git is a free and open source distributed version control system designed to handle everything from small to very large projects with speed and efficiency.
GitHub is the best place to share code with friends, co-workers, classmates, and complete strangers. Over six million people use GitHub to build amazing things together.
The CentOS Linux distribution is a stable, predictable, manageable and reproduceable platform derived from the sources of Red Hat Enterprise Linux (RHEL).
nginx is an HTTP and reverse proxy server, as well as a mail proxy server, written by Igor Sysoev. For a long time, it has been running on many heavily loaded Russian sites including Yandex, Mail.Ru, VKontakte, and Rambler. According to Netcraft nginx served or proxied 19.21% busiest sites in June 2014. Here are some of the success stories: Netflix, Wordpress.com, FastMail.FM.


We get two restaurants’ support who will provide us their materials of restaurants and dishes. And they are glade to participate our project to contributes ideas of packaging and delivery. With restaurants’s help, Yiyuan Zhou and Hongyu Gao will work on improving business plan to make it mature enough to get cooperation with more restaurant and third parties. Danyang Li builts a RESFful service prototype based on spring boot. I create a UI prototype design.
Research on distributed images storage and retrieve using javascript and static html from RESTful service. And implement a prototype using code.
There is a technology issues that we should consider now to make the system flexible enough to support larg scale of pictures. The solution we got is: 1. save images on other machine/directory which is independent to current server. 2. save a URL and compiled unique name of image to database. 3. explorer will retrieve image using the URL and name using RESTful image api which provided by image hosted server.


Practical Approximation Algorithms Library
Currently, we provide an interface for creating, modifying and (re)solving LP instances. As the underlying implementation we use the GLPK (GNU Linear Programming Kit) library. Your work would be to add support for more sophisticated solvers:
Subsequently, we plan to add support for Integer Programming into our framework. As hard as it sounds this task is relatively easy and we strongly believe, that it's more about coding than implementing complex algorithms this time. Except of having fun you will also learn how to use LP solvers and a lot about discrete optimization. For more information see . Expected results:Interface for Integer Programming and support for other solvers, and documentation
Knowledge prerequisite:C++14, Doxygen
Mentor:Piotr Wygocki
Recently our area of studies moved to family of multidimensional Bin Packing Problems , especially since we have come across new real world data from industry. It becomes clear that previous researchers focused on different problems, especially when it comes to 2D guillotine problems . Recently, we developed novel approach, that relaxes certain constraints in this problem. We've created several prototypes that are using technique called mixed integer programming . We strongly believe that generic solution could save tons of materials in industry, hence we'd like to develop library solution for this problems. During this task you will have a lot of fun learning discrete optimization.
Expected results:Library code that implements heuristic/exact algorithm for solving Guillotine Problem.
Knowledge prerequisite:C, C++, Linear Programming, Deep algorithmic knowledge, Discrete Optimization and a lot of communication.
Mentor:Piotr Wygocki
The more people are using our Library the better. We belief that most of the people are not familiar with the newest C++, hence we want to facilitate using it for majority of programmers. This task aims to create interface similar to numpy or scipy, but we want to ensure that this biddings will be created automatically. We will not insist on any particular technology, but we require genuine generic solution and we will put pressure on creation of a comprehensive documentation. This task will require deep knowledge of C++14 and frequent communication.
Expected results:Interface for using PAAL, in Python and Java.
Knowledge prerequisite:C, C++, Python, Java
Mentor:Andrzej Pacuk
Recursive neural networks are recent holy grail of machine learning. Problem with it though, is it's inefficiency. Recently we have come into possession of Intel Xeon Phi and we do believe that implementation on this particular architecture will significantly increase it's speed and efficiency. Our goal is to create small machine learning tool program, that will assist programmers on Kaggle competitions, like Vowpal Wabbit
Expected results:Programming library for the newest Intel Xeon Phi cards.
Knowledge prerequisite:C, C++, Linux, OpenMP
Mentor:Krzysztof Ciebiera


Daily Log - Alex
- March 21st, 2016
- Fixed course content viewing.
- Fixed assignment creation.
- Only display delete button in course files if user is Instructor.
- Match 20th, 2016
- Fixed iFrame file viewing.
- Created Iteration 3 implemenation notes.
- Updated Javadoc.
- Created "RunTheServer.html"
- Trouble shooted Docker file permissions for hours...
- March 18th, 2016
- Create new assignments finished(?).
- Helped Tim debug file viewing.
- March 17th, 2016
- Create new assignments.
- Add files to assignments.
- Limit non-instructors ability to modify course directories.
- Generic course content section.
- March 16th, 2016
- Dynamically load sidebar. Display user details in sidebar.
- Display courses the user is registered in for the current role.
- Switching active roles.
- March 15th, 2016
- Finished implementing C++ support.
- Added timeout for executing processes.
- Dynamically load side bar.
- March 11th, 2016
- Fixed compilation issue associated to C++ support.
- March 9th, 2016
- Started C++ support.
- March 7th, 2016
- Helped Tim with file browsing.
- Fixed errors with account registration.
- Adjusted Implementation notes.
- Created Iteration 2 submission.
- March 6th, 2016
- More docker disucssion.
- Updated sequence diagram for code execution.
- Created implementation notes for iteration 2.
- Added examples of account register and login using Spark Java to repo.
- March 5th, 2016
- Created Spark Java Dicussion.
- Started Docker Discussions.
- February 29th, 2016
- Make terminated process display exit status to client.
- Fix scrolling issue in client console display.
- February 28th, 2016
- Fixed compiling and executing to work with new website.
- File uploading to server now works.
- File downloading works, but all files are public now.
- February 26th, 2016
- Sandboxing works.
- Executing with input and output works.
- Merged execution and compiling with newer website.
- Figure out how to use docker within docker. First docker is have platform independant ways of running the server (it always runs from Ubuntu now) and the second docker is the sandbox for the server.
- Network connection to the server inside a docker container took forever but works now.
- February 25th, 2016
- Sandboxing is a pain..
- Basic reading output from executing file works.
- February 24th, 2016
- Started working on execution of program over "the cloud".
- Investigated sandboxing possibilities.
- February 16th, 2016
- Cloud compiling works!
- February 15th, 2016
- Tried to get compiling to work over the server.
- February 10th, 2016
- Designed polymorphic database objects.
- Fixed merge conflicts.
- February 8th, 2016
- Updated index page.
- Created submission bundle.
- February 7th, 2016
- Modified class and package diagram.
- Updated Javadoc.
- February 6th, 2016
- Add javadoc comments to everything...
- Create javadoc documentation for internal API.
- Update documentation index.
- Update class diagram.
- February 5th, 2016
- Manually fixed overwriting merge conflict.
- Small amount of skeleton code.
- February 3rd, 2016
- Updated index web page.
- Created database schema html page.
- February 1st, 2016
- Updated class diagrams and package diagrams.
- Created class-level seqeunce diagrams for compiling and executing.
- Moved sequence diagrams to separate sequence diagrams page.
- January 31st, 2016
- Prototype server compiling and execution
- January 29th, 2016
- Investiage SparkJava/Eclipse capabilities; maven project needed.
- Setup Eclipse project with maven dependencies.
- Initial server setup.
- January 27th, 2016
- Set up new repository
- January 25th, 2016
- Updated Domain Model.
- Created Class Diagrams.
- Created Package Diagram.
- Created Software Architecture documentation page.
- January 18th, 2016
- Created Use Case Diagram.
- Updated User Stories.
- Created cohesive Use Case html page.
- January 17th, 2016
- Created documentation index with links to the appropraite pages.
- Created HTML template for use cases to be used by the rest of the team.
- January 16th, 2016
- Created digital wireframes.
- January 15th, 2016
- Created Test Plan.
- Began wireframes for web page design.
- Small change to user stories.
- Added more resourced to Technology Selection.
- January 14th, 2016
- Created Work Plan.
- Created Gantt Chart for work plan.
- January 13th, 2016
- Updated domain model.
- Added "data dictionary"? Basically, defined the entities in the domain model.
- January 12th, 2016
- First pass on domain analysis.
- Two domain models created.
- January 11th, 2016
- Updates user stories
- Added old netowrking notes to repo
- Technology Selection
- January 9th, 2016
- Created repo and did the basic setup.
- Created HTML for the User Stories.
- January 8th, 2016
- Jot notes of the requirements, user roles, user stories.


public static final String |
ACCRUAL_METHOD_FIELD |
"Accrual Method" |
public static final String |
BARRIER_LEVEL_FIELD |
"Barrier Level" |
public static final String |
BARRIER_TYPE_FIELD |
"Barrier Type" |
public static final String |
BUY_SELL_FIELD |
"Buy Sell" |
public static final String |
CAP_FLOOR_FIELD |
"CapFloor" |
public static final String |
CCP_FIELD |
"CCP" |
public static final String |
CDS_INDEX_ID_FIELD |
"CDS Index Id" |
public static final String |
CDS_INDEX_ID_SCHEME_FIELD |
"CDS Index Id Scheme" |
public static final String |
COMPOUNDING_METHOD_FIELD |
"Compounding Method" |
public static final String |
CONTRACT_CODE_FIELD |
"Contract Code" |
public static final String |
CONTRACT_SIZE_FIELD |
"Contract Size" |
public static final String |
CONVENTION_FIELD |
"Convention" |
public static final String |
CPTY_FIELD |
"Counterparty" |
public static final String |
CPTY_SCHEME_FIELD |
"Counterparty Scheme" |
public static final String |
CURRENCY_1_FIELD |
"Currency 1" |
public static final String |
CURRENCY_2_FIELD |
"Currency 2" |
public static final String |
CURRENCY_FIELD |
"Currency" |
public static final String |
DATE_ADJ_CAL_FIELD |
"Date Calendar" |
public static final String |
DATE_ADJ_CNV_FIELD |
"Date Convention" |
public static final String |
DAY_COUNT_FIELD |
"Day Count" |
public static final String |
DESCRIPTION_FIELD |
"Description" |
public static final String |
DIRECTION_FIELD |
"Direction" |
public static final String |
END_DATE_CAL_FIELD |
"End Date Calendar" |
public static final String |
END_DATE_CNV_FIELD |
"End Date Convention" |
public static final String |
END_DATE_FIELD |
"End Date" |
public static final String |
EXCHANGE_FIELD |
"Exchange" |
public static final String |
EXERCISE_DATES_CAL_FIELD |
"Exercise Dates Calendar" |
public static final String |
EXERCISE_DATES_CNV_FIELD |
"Exercise Dates Convention" |
public static final String |
EXERCISE_DATES_FIELD |
"Exercise Dates" |
public static final String |
EXERCISE_PRICE_FIELD |
"Exercise Price" |
public static final String |
EXERCISE_STYLE_FIELD |
"Exercise Style" |
public static final String |
EXPIRY_DATE_CAL_FIELD |
"Expiry Date Calendar" |
public static final String |
EXPIRY_DATE_CNV_FIELD |
"Expiry Date Convention" |
public static final String |
EXPIRY_DATE_FIELD |
"Expiry Date" |
public static final String |
EXPIRY_DAY_FIELD |
"Expiry Day" |
public static final String |
EXPIRY_FIELD |
"Expiry" |
public static final String |
EXPIRY_TIME_FIELD |
"Expiry Time" |
public static final String |
EXPIRY_WEEK_FIELD |
"Expiry Week" |
public static final String |
EXPIRY_ZONE_FIELD |
"Expiry Zone" |
public static final String |
FAR_FX_RATE_DATE_FIELD |
"Far FX Rate" |
public static final String |
FAR_PAYMENT_DATE_FIELD |
"Far Payment Date" |
public static final String |
FINAL_STUB_AMOUNT_CURRENCY_FIELD |
"Final Stub Amount Currency" |
public static final String |
FINAL_STUB_AMOUNT_FIELD |
"Final Stub Amount" |
public static final String |
FINAL_STUB_INDEX_FIELD |
"Final Stub Index" |
public static final String |
FINAL_STUB_INTERPOLATED_INDEX_FIELD |
"Final Stub Interpolated Index" |
public static final String |
FINAL_STUB_RATE_FIELD |
"Final Stub Rate" |
public static final String |
FIRST_RATE_FIELD |
"First Rate" |
public static final String |
FIRST_REGULAR_RATE_FIELD |
"First Regular Rate" |
public static final String |
FIRST_REGULAR_START_DATE_FIELD |
"First Regular Start Date" |
public static final String |
FIXED_RATE_FIELD |
"Fixed Rate" |
public static final String |
FIXING_OFFSET_ADJ_CAL_FIELD |
"Fixing Offset Adjustment Calendar" |
public static final String |
FIXING_OFFSET_ADJ_CNV_FIELD |
"Fixing Offset Adjustment Convention" |
public static final String |
FIXING_OFFSET_CAL_FIELD |
"Fixing Offset Calendar" |
public static final String |
FIXING_OFFSET_DAYS_FIELD |
"Fixing Offset Days" |
public static final String |
FIXING_RELATIVE_TO_FIELD |
"Fixing Relative To" |
public static final String |
FRA_DISCOUNTING_FIELD |
"FRA Discounting Method" |
public static final String |
FREQUENCY_FIELD |
"Frequency" |
public static final String |
FUTURE_VALUE_NOTIONAL_FIELD |
"Future Value Notional" |
public static final String |
FX_RATE_FIELD |
"FX Rate" |
public static final String |
FX_RESET_INDEX_FIELD |
"FX Reset Index" |
public static final String |
FX_RESET_INITIAL_NOTIONAL_FIELD |
"FX Reset Initial Notional" |
public static final String |
FX_RESET_OFFSET_ADJ_CAL_FIELD |
"FX Reset Offset Adjustment Calendar" |
public static final String |
FX_RESET_OFFSET_ADJ_CNV_FIELD |
"FX Reset Offset Adjustment Convention" |
public static final String |
FX_RESET_OFFSET_CAL_FIELD |
"FX Reset Offset Calendar" |
public static final String |
FX_RESET_OFFSET_DAYS_FIELD |
"FX Reset Offset Days" |
public static final String |
FX_RESET_RELATIVE_TO_FIELD |
"FX Reset Relative To" |
public static final String |
GEARING_FIELD |
"Gearing" |
public static final String |
ID_FIELD |
"Id" |
public static final String |
ID_SCHEME_FIELD |
"Id Scheme" |
public static final String |
INDEX_FIELD |
"Index" |
public static final String |
INDEX_SERIES_FIELD |
"Index Series" |
public static final String |
INDEX_VERSION_FIELD |
"Index Version" |
public static final String |
INFLATION_FIRST_INDEX_VALUE_FIELD |
"Inflation First Index Value" |
public static final String |
INFLATION_LAG_FIELD |
"Inflation Lag" |
public static final String |
INFLATION_METHOD_FIELD |
"Inflation Method" |
public static final String |
INITIAL_STUB_AMOUNT_CURRENCY_FIELD |
"Initial Stub Amount Currency" |
public static final String |
INITIAL_STUB_AMOUNT_FIELD |
"Initial Stub Amount" |
public static final String |
INITIAL_STUB_INDEX_FIELD |
"Initial Stub Index" |
public static final String |
INITIAL_STUB_INTERPOLATED_INDEX_FIELD |
"Initial Stub Interpolated Index" |
public static final String |
INITIAL_STUB_RATE_FIELD |
"Initial Stub Rate" |
public static final String |
INTERPOLATED_INDEX_FIELD |
"Interpolated Index" |
public static final String |
KNOCK_TYPE_FIELD |
"Knock Type" |
public static final String |
KNOWN_AMOUNT_FIELD |
"Known Amount" |
public static final String |
LAST_REGULAR_END_DATE_FIELD |
"Last Regular End Date" |
public static final String |
LEG_1_CURRENCY_FIELD |
"Leg 1 Currency" |
public static final String |
LEG_1_DIRECTION_FIELD |
"Leg 1 Direction" |
public static final String |
LEG_1_INDEX_FIELD |
"Leg 1 Index" |
public static final String |
LEG_1_NOTIONAL_FIELD |
"Leg 1 Notional" |
public static final String |
LEG_2_CURRENCY_FIELD |
"Leg 2 Currency" |
public static final String |
LEG_2_DIRECTION_FIELD |
"Leg 2 Direction" |
public static final String |
LEG_2_INDEX_FIELD |
"Leg 2 Index" |
public static final String |
LEG_2_NOTIONAL_FIELD |
"Leg 2 Notional" |
public static final String |
LEG_2_PAYMENT_DATE_FIELD |
"Leg 2 Payment Date" |
public static final String |
LEGAL_ENTITY_ID_FIELD |
"Legal Entity Id" |
public static final String |
LEGAL_ENTITY_ID_SCHEME_FIELD |
"Legal Entity Id Scheme" |
public static final String |
LONG_QUANTITY_FIELD |
"Long Quantity" |
public static final String |
LONG_SHORT_FIELD |
"Long Short" |
public static final String |
NAME_FIELD |
"Name" |
public static final String |
NEGATIVE_RATE_METHOD_FIELD |
"Negative Rate Method" |
public static final String |
NOTIONAL_CURRENCY_FIELD |
"Notional Currency" |
public static final String |
NOTIONAL_FIELD |
"Notional" |
public static final String |
NOTIONAL_FINAL_EXCHANGE_FIELD |
"Notional Final Exchange" |
public static final String |
NOTIONAL_INITIAL_EXCHANGE_FIELD |
"Notional Initial Exchange" |
public static final String |
NOTIONAL_INTERMEDIATE_EXCHANGE_FIELD |
"Notional Intermediate Exchange" |
public static final String |
OVERRIDE_START_DATE_CAL_FIELD |
"Override Start Date Calendar" |
public static final String |
OVERRIDE_START_DATE_CNV_FIELD |
"Override Start Date Convention" |
public static final String |
OVERRIDE_START_DATE_FIELD |
"Override Start Date" |
public static final String |
PAYMENT_AMOUNT_FIELD |
"Payment Amount" |
public static final String |
PAYMENT_CURRENCY_FIELD |
"Payment Currency" |
public static final String |
PAYMENT_DATE_CAL_FIELD |
"Payment Date Calendar" |
public static final String |
PAYMENT_DATE_CNV_FIELD |
"Payment Date Convention" |
public static final String |
PAYMENT_DATE_FIELD |
"Payment Date" |
public static final String |
PAYMENT_DIRECTION_FIELD |
"Payment Direction" |
public static final String |
PAYMENT_FIRST_REGULAR_START_DATE_FIELD |
"Payment First Regular Start Date" |
public static final String |
PAYMENT_FREQUENCY_FIELD |
"Payment Frequency" |
public static final String |
PAYMENT_LAST_REGULAR_END_DATE_FIELD |
"Payment Last Regular End Date" |
public static final String |
PAYMENT_OFFSET_ADJ_CAL_FIELD |
"Payment Offset Adjustment Calendar" |
public static final String |
PAYMENT_OFFSET_ADJ_CNV_FIELD |
"Payment Offset Adjustment Convention" |
public static final String |
PAYMENT_OFFSET_CAL_FIELD |
"Payment Offset Calendar" |
public static final String |
PAYMENT_OFFSET_DAYS_FIELD |
"Payment Offset Days" |
public static final String |
PAYMENT_ON_DEFAULT_FIELD |
"Payment On Default" |
public static final String |
PAYMENT_RELATIVE_TO_FIELD |
"Payment Relative To" |
public static final String |
PAYOFF_SETTLEMENT_DATE_FIELD |
"Payoff Settlement Date" |
public static final String |
PAYOFF_SETTLEMENT_TYPE_FIELD |
"Payoff Settlement Type" |
public static final String |
PERIOD_TO_START_FIELD |
"Period To Start" |
public static final String |
POSITION_TYPE_FIELD |
"Strata Position Type" |
public static final String |
PREMIUM_AMOUNT_FIELD |
"Premium Amount" |
public static final String |
PREMIUM_CURRENCY_FIELD |
"Premium Currency" |
public static final String |
PREMIUM_DATE_CAL_FIELD |
"Premium Date Calendar" |
public static final String |
PREMIUM_DATE_CNV_FIELD |
"Premium Date Convention" |
public static final String |
PREMIUM_DATE_FIELD |
"Premium Date" |
public static final String |
PREMIUM_DIRECTION_FIELD |
"Premium Direction" |
public static final String |
PRICE_FIELD |
"Price" |
public static final String |
PROTECTION_START_FIELD |
"Protection Start" |
public static final String |
PUT_CALL_FIELD |
"Put Call" |
public static final String |
QUANTITY_FIELD |
"Quantity" |
public static final String |
RATE_CUT_OFF_DAYS_FIELD |
"Rate Cut Off Days" |
public static final String |
REBATE_AMOUNT_FIELD |
"Rebate Amount" |
public static final String |
REBATE_CURRENCY_FIELD |
"Rebate Currency" |
public static final String |
REBATE_DIRECTION_FIELD |
"Rebate Direction" |
public static final String |
RED_CODE_FIELD |
"RED Code" |
public static final String |
RESET_DATE_CAL_FIELD |
"Reset Date Calendar" |
public static final String |
RESET_DATE_CNV_FIELD |
"Reset Date Convention" |
public static final String |
RESET_FREQUENCY_FIELD |
"Reset Frequency" |
public static final String |
RESET_METHOD_FIELD |
"Reset Method" |
public static final String |
ROLL_CONVENTION_FIELD |
"Roll Convention" |
public static final String |
SECURITY_ID_FIELD |
"Security Id" |
public static final String |
SECURITY_ID_SCHEME_FIELD |
"Security Id Scheme" |
public static final String |
SENIORITY_FIELD |
"Seniority" |
public static final String |
SETTLEMENT_DATE_FIELD |
"Settlement Date" |
public static final String |
SETTLEMENT_DATE_OFFSET_ADJ_CAL_FIELD |
"Settlement Date Offset Adjustment Calendar" |
public static final String |
SETTLEMENT_DATE_OFFSET_ADJ_CNV_FIELD |
"Settlement Date Offset Adjustment Convention" |
public static final String |
SETTLEMENT_DATE_OFFSET_CAL_FIELD |
"Settlement Date Offset Calendar" |
public static final String |
SETTLEMENT_DATE_OFFSET_DAYS_FIELD |
"Settlement Date Offset Days" |
public static final String |
SETTLEMENT_TYPE_FIELD |
"Settlement Type" |
public static final String |
SHORT_QUANTITY_FIELD |
"Short Quantity" |
public static final String |
SPREAD_FIELD |
"Spread" |
public static final String |
START_DATE_CAL_FIELD |
"Start Date Calendar" |
public static final String |
START_DATE_CNV_FIELD |
"Start Date Convention" |
public static final String |
START_DATE_FIELD |
"Start Date" |
public static final String |
STEP_IN_DATE_OFFSET_ADJ_CAL_FIELD |
"Step In Date Offset Adjustment Calendar" |
public static final String |
STEP_IN_DATE_OFFSET_ADJ_CNV_FIELD |
"Step In Date Offset Adjustment Convention" |
public static final String |
STEP_IN_DATE_OFFSET_CAL_FIELD |
"Step In Date Offset Calendar" |
public static final String |
STEP_IN_DATE_OFFSET_DAYS_FIELD |
"Step In Date Offset Days" |
public static final String |
STRIKE_FIELD |
"Strike" |
public static final String |
STUB_CONVENTION_FIELD |
"Stub Convention" |
public static final String |
TENOR_FIELD |
"Tenor" |
public static final String |
TICK_SIZE_FIELD |
"Tick Size" |
public static final String |
TICK_VALUE_FIELD |
"Tick Value" |
public static final String |
TRADE_DATE_FIELD |
"Trade Date" |
public static final String |
TRADE_TIME_FIELD |
"Trade Time" |
public static final String |
TRADE_TYPE_FIELD |
"Strata Trade Type" |
public static final String |
TRADE_ZONE_FIELD |
"Trade Zone" |
public static final String |
UNDERLYING_CURRENCY_FIELD |
"Underlying Currency" |
public static final String |
UNDERLYING_EXPIRY_FIELD |
"Underlying Expiry" |
public static final String |
VERSION_FIELD |
"Version" |