Geddy has you covered
Routes are easy with Geddy. Just match a url to a controller and an action. You can specify http methods, formats, and url params.
// standard main route router.match('/').to({controller: 'Main', action: 'index'}); // a custom route router.match('/moving/pictures/:id').to({controller: 'Moving', action: 'pictures'}); // a restful resource route router.resource('users');
Geddy lets you define reusable models for your data. It's got validation, instance methods, and static methods. It'll even stub out a model adapter for you to help you get your data slurped in.
var User = function () { this.property('login', 'string', {required: true}); this.property('password', 'string', {required: true}); this.validatesPresent('login'); this.validatesConfirmed('password', 'confirmPassword'); // You can define methods for instances like this this.someMethod = function () { // Do some stuff }; }; User = geddy.model.registerModel('User', User);
Geddy supports multiple template languages such as Jade, Handlebars, Mustache and EJS. You don't have to do anything to switch between them just change the file extension and Geddy will handle what engine to use.
Geddy includes a EJS engine so you don't have to install anything to use EJS, it's ready out of the box.
// view logic <% if (localVar) { %> // do some stuff with that local variable <% } %> // display the value of a variable <%= user.login %> // just use regular js <% for (var i in user.posts) { %> <%= user.posts[i].title %> <% } %>
Geddy has multiple view helpers for use with HTML tags, text manipulation and url generation. Geddy also has action which are helpers that create links to various routes defined in your routes file.
Note: View helpers are pretty new, if you'd like others please suggest them, we'd gladly add any new helpers.
// HTML tags scriptLink('/js/script.js'); // => <script src="/js/script.js"></script> // URL generation urlFor({ host: 'somehost.com', protocol: 'https' }) // => 'https://somehost.com' // Text manipulation truncate('Once upon a time in a world') // => 'Once up...'
When you generate a resource, your controller is automatically filled with your basic CRUD actions. If you want to add more actions to your controller, just add a method onto the controller and add a new route. It's that easy.
var User = function () { this.index = function (req, resp, params) { this.respond(params, { format: 'html' , template: 'app/views/main/index' }); }; }; exports.User = User;
Geddy handles content formats for you. Ask for an HTML file, and Geddy will render a template and return it.  Add a .js?callback=foo
to your url and you'll have a jsonp response. Awesome, huh? If you're feeling enterprisey, Geddy can even return you XML.
this.respondsWith = ['js', 'json']; this.show = function (params) { // (Fetch some item by params.id) item = {foo: 'FOO', bar: 1, baz: false}; this.respond(item); };
Geddy automatically handles multi-process clustering for you. It works with 0.8.x and it's backward-compatible with Node 0.6.x; scale your Node apps across your server's cores without any extra work.
// just set the number of workers in your config workers: 1 // Geddy also handles process rotation , rotateWorkers: true , rotationWindow: 7200000 , rotationTimeout: 300000
With Geddy, all your controller actions and requests are instrumented automatically. All you need to do is enable metrics in your config. hit up port 4001 /metrics to collect them periodically.
// counters var counter = new geddy.metrics.Counter; counter.inc(1); // timers var timer = new geddy.metrics.Timer; timer.mark();
Geddy generators are extremely useful, creating new applications, scaffolding and resources fast. There are numerous generators that will make it easy to create new pieces to exists applications like scaffold, resource, model, controller and application-secret generators.
// generate an app $ geddy app test_app // generate a new resource $ geddy resource user name:string // generate a new scaffolding $ geddy scaffold user name:string password:string // generate a new application secret $ geddy secret // start your app $ geddy
Geddy gives you Twitter's Bootstrap on the front end so you can rapidly lay out your prototype. Plus, since responsive layouts are built right in, your app automatically works on mobile devices and tablets.
<script src="js/jquery.min.js"></script;> <script src="js/bootstrap.min.js"></script;> <link rel="stylesheet" href="css/bootstrap.min.css"> <link rel="stylesheet" href="css/bootstrap.responsive.css">
Geddy automatically logs requests to an access log, and you can log anything you'd to stdout or a file. It supports 9 different log levels from debug to emergency.
// info geddy.log.info('Some info for you'); // warning geddy.log.warn('A warning!'); // error geddy.log.error('An error occurred');


akka
.
http
.
javadsl
settings
package
settings
Visibility
Public
All
Type Members
abstract
class
ClientConnectionSettings
extends
AnyRef
Public API but not intended for subclassing
abstract
class
ConnectionPoolSettings
extends
AnyRef
Public API but not intended for subclassing
abstract
class
ParserSettings
extends
Settings
Public API but not intended for subclassing
abstract
class
RoutingSettings
extends
AnyRef
Public API but not intended for subclassing
abstract
class
ServerSettings
extends
AnyRef
Public API but not intended for subclassing
trait
SettingsCompanion
[
T
]
extends
AnyRef
INTERNAL API
Value Members
object
ClientConnectionSettings
extends
SettingsCompanion
[
ClientConnectionSettings
]
object
ConnectionPoolSettings
extends
SettingsCompanion
[
ConnectionPoolSettings
]
object
ParserSettings
extends
SettingsCompanion
[
ParserSettings
]
object
RoutingSettings
extends
SettingsCompanion
[
RoutingSettings
]
object
ServerSettings
extends
SettingsCompanion
[
ServerSettings
]
Ungrouped


New Game
Show Settings
Theme:
Show coordinate guides
Override theme fonts (use this setting if the Unicode pieces are not displaying properly)
Show the mini keyboard (for touchscreens)
White:
Make Move
Promote pawn to:
Queen
Rook
Bishop
Knight
⚐:
⚑:
Chess


Labels often set the narrative, or so liberals would argue. It's why they express deep concerns about the ways language is formed. Language can be used to divide, debate, and ensure that certain people and ideas are marked out of bounds or deemed acceptable, just by what surrounds them.
We worry so much about words, and so rarely about the places we place them. Sure, online your words can be used against you. Weapons in the wait, waiting to be taken out of context. But what about the store houses of words? These books we fill with digital prose. Do we speak of them as weaponry?
 By itself, it sits lifeless. In the hand of a criminal, the gun shapes intention. In the hand of a police officer, soldier, frightening home owner in the middle of the night, the narrative is different. There's a reason these many users pick up the gun. It's not because it remains lifeless and intentionless, it takes form through what it is capable of.
Platforms, and more specifically, their owners, are the holders of powerful weapons. Seemingly intentionless, harmless data stores, just ripe with potential. Waiting to be set off. An algorithm can be used to change housing prices, get your eyes to see a product to buy, shift elections, alter the mood of the person being pushed negative or positive articles.
The algorithm is a complex, and complicated weapon because the intentions of those who make them are unknown (sometimes even to the authors). It is why liberals (and conservatives as well to a different extent) are so concerned about the words they quantify, the metadata, the ability to codify -ism's, separate -ist's, and produce digital ghettoes that mirror the real world. Ensuring future division in the name of eye traffic through invisibly walled gardens.
Technology shapes our perceptions. It shapes the way we interface with huge pieces of the world. What we buy, where we go, where we walk; influencing every blade of grass we'll pass and molecule of air inhaled.
Raw, faceless, innocent technology (there's no such thing) does amazing things without us even noticing. How best to shape our technology than to wield maximal power? That's been the path of Silicon Valley the last decade. How best, to shape consumers to "improve their lives " by capturing dollars and tunneling them to the few from the many. Dollars and eye traffic in exchange for conveniences .
A small example
You want a website.
I can build you a website.
I can do all the work myself.
I can do all the work myself to build you a website in WIX.
I can give you the website and you'll never need me again (you didn't already there).
However, this convenience comes at a cost. You'll never be able to stop using them .
You want to be educated.
I can educate you.
You enroll in classes, pay tens of thousands of dollars to get access to me.
I'm allowed to educate you in exchange for monetary compensation that barely allows me to make a living as a knowledge expert.
You want to learn. I want to teach. Structures limit this effectiveness.
Worse, you need to learn. You can't move in society without learning. You. Need. Me. My knowledge. My expertise. My ability. And yet, you can't have it unless you sign away the next 10, maybe 15, at times 20 years of your life to ensure that you can have a future .
Was, the positioning of the information behind the institution, a weapon? Did it have grave negative impacts on you just because we force technology to flow in a way that replicates this power flow dynamic?
What's limiting in both scenarios is that an organization has abstracted you away from what you want. You want access to the individual with the knowledge. You want access to the thing at the end, and yet there is no technology to get you there or a gap too wide for you to cross on your own.
And in each case, knowledge has failed you. It's been weaponized against you. Those with knowledge, able to manipulate (financially, eye traffic) those without.

A cruel world.
(said tongue in cheek, I want to make it very clear how anti free college I am so that this next line is not taken out of context)
What if College was free ? What if we didn't need to pay for College and instead just got College service for free.
What if Wix was free? What if we didn't need to pay for Wix and instead just got Wix service for free.
Who has the most to gain in this scenario? The codification of knowledge brokering into the fabric of society . Saying that an institutional need is important for individual success.
Is this so? Or is this the false reality we've been handed?
Must we implement solutions of the future based on structures of the past?
Or can we go another way..
What if we constructed technology to not live with the institution or the corporation, but to live with the individual instead? Why is it we accept that a computer can live in our hand and conform to our desires but yet access to information or the ability to self publish. Those.. those COULDN'T POSSIBLY be done without institutions, organizations, and corporations. What happened to the text-editor, note-pad, the calculator, the web browser itself? Why is it we expect these to be free, the windows to low fidelity self expression on the same playing field as the portal to information across the world. These applications are free... why not additional levels of abstraction up from them?
How could we, the little people, ever be able to compete with the faceless mega corporations of our world? These Gods of our copybook heading. These titans of industry.
It's simple. We don't play their game. And the game; is that central structures exist and are funded and thus must continue to exist and continue to be funded. There's no reason you need to continue going to traditional academia, but the belief that people do, keeps it going. Historical trends dictating future ones indefinitely.
There's no reason you need to keep paying for websites that lock publishing capabilities with no export or migration methods. To be bilked into thinking that because organization X recommends institution Y uses corporation Z's product, we must all.
"You can't do it on your own, you need us" the demons of industry beckon.
That's just what they want us to think; need, us, to, think.
"We empower them, they do not control us" to quote a line from a house genre song I enjoy.
It's that simple an idea.
If we intentionally build solutions that stem from the individual, could we eliminate the power structures at play? If we can make personal ownership convenient, powerful, highly usable, "easy", accessible, visually appealing, and locally controlled... will power flow away from the powerful and back to the people. When privacy and empowerment are more than ideals but more convenient then giving them away... will we walk away from the powers of the past and empower the individuals of the future?
Can we reclaim publishing? Education? Knowledge construction? Media production? Can we claim all of these spaces, returning them to the individual and defeat authoritarian edtech in the process?
We live in a technologically weaponized age. It's time we bring a pen to the gun fight and write a new future without them.
This post, and this website, were written with HAX using HAXcms . My pen. Our weapon.
Ex plures, plures.


Espérance Creations
Menu
Skills
Portfolio
Work Ex
Publications
Full Bio
About Me
DSC02959
DSC02966
DSC02996
DSC03009
P5070829
P5070836
puks2


Create video from wikipedia article (Text2Video)
Do It!!
Export
Choose voice
Choose voice
Rate
Pitch
N.B. Rate and Pitch only work with native voice.
Write message
Speak


Thanks for generating this project using the app accelerator. Please see below for some extra information on each of the technologies you chose
The Watson SDK provides an API for accessing Watson Services. For the complete documentation, take a look at the Watson developer pages and the Watson SDK github project


rusty-gfm-html
A markdown rendering similar to that of Github Flavored Markdown
This program simply generates an html file, containing the style sheets necessary to render as close to GFM Markdown as possible. Syntax highlighting is not currently supported.
Installation
Simply extract the downloaded file someplace memorable, like /opt/rusty
, and optionally add the location to your $PATH
variable.
Build From Source
Like any other Rust program, simply clone the repository and run
cargo build --release
Then, copy the executable and styles.css somewhere memorable, like /opt/rusty
Usage
To display the program usage, open a terminal and type
rusty-gfm-html --help echo second line
<img src="izengard.gif" alt="They're taking the hobbits to" />
Test
def make_haiku(): for i in range(10): print("This is my hello world") # No semicolons


RUSH A film review by Ken Johnson Copyright 1992 Ken Johnson
117 min., R, Drama, 1992 Director: Lili Fini Zanuck Cast: Jennifer Jason Leigh, Jason Patric, Sam Elliott, Max Perlich, Gregg Allman, Tomy Frank, William Sadler, Special K. McCray
Undercover narcotics cop Jason Patric has to take on a partner. He picks new cadet Jennifer Jason Leigh. They are put out on the streets to catch drug dealer Gregg Allman. While investigating, they find themselves becoming addicted to drugs.
I was going to see RUSH in the theaters the weekend it opened, but it opened the same weekend as THE HAND THAT ROCKS THE CRADLE. I went to see that instead and was going to see RUSH the next weekend. The next weekend RUSH had already closed so now I have seen it on video and because of the lack of reviews on it when it came out, I decided to write one. RUSH is the best narcotics film that I have seen since DRUGSTORE COWBOY. On a scale of zero to five, I give the film a five. RUSH is rated R for explicit language, adult situations, and graphic violence.
The acting in the film is great. Jennifer Jason Leigh gives one of her best performances in her career. Jason Patric does a much better job than usual. His acting could have been improved a little, but he still did a great job. Max Perlich's character I liked least in the film, but it was not because of Perlich's acting, it was just the character. This film is not heavy on action at all, it is mostly drama (which is misleading from some of the advertisements for the film, so be forewarned).
The story is written extremely well. It kept my interest throughout and didn't fall into many Hollywood cliches (although there was a slight problem at the ending in this respect). The film shows the gritty downside to being a undercover narcotics officer, and because of how well it does this, it makes the film excellent viewing. I think the thing that drowned this film at the box office was that it is not a traditional Hollywood film, so it wasn't able to find the audience that it needed. It also most likely got left in the dust with films like THE HAND THAT ROCKS THE CRADLE and BASIC INSTINCT out. Now that it is on video I think that it will find the audience that it deserves.
If you have not yet seen this film, I strongly urge you to rent it. It is definitely worth what ever price you pay and will provide you with almost two hours of pure enjoyment (but be prepared to be sad in some parts).
-------- Ken Johnson<EMAIL_ADDRESS>.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Persona
Name: Zim Bobway
Gender: Male
Age: 57
Technology: Nokia Flip Phone; HP Laptop with Windows, Microsoft Edge; low-level;
Houston, Texas
Job: Business Owner
Attitudes & Needs: Wants to send mass emails to market his company
Goals: Send more emails to market his company.
Habits: Stuck in old ways
Frustrations: Needs a way of sending a large amount of emails.
Zim's Story
As a business user, I want to use mass email to market my company.


Targets: /
Current: /
R
Pain measurements can also be recorded with the keyboard. Simply type l
or r
followed by a number between 0 and 9. To record tolerance, type t
and then o
.
For Threshold type t
and then h
. Examples:
l3
records a score of 3 on the left handr6
records a score of 6 on the right handlth
records pain threshold reached for the left handSeconds, Message (csv, click text to select or download)


Your voucher `{{ keyword }}` is still valid, until
{{ expire_date }}
at {{ expire_hour }}. Just click OK (no need to type anything).
All vouchers linked to this device have expired.


Please fill out the form below to locate your closest recycling center.
Please enter your street, city / town and state and click submit to find a local recycling center, or click on the
dropdown menu to select a specific material type and find a recycling center near you which will accept
it.


“Monorepo” is one of those words you could break down – Mono meaning one, and Repo meaning rail repository.
Now what?
Well, let’s back up a little. Monorepos are an increasingly popular way to handle managing packages, especially as we continue to write (and consume) more atomic modules. A monorepo means you can centralize config, commits, releases, and anything you do in a normal repo in one place. Of course, it has all sorts of pros and cons. One of the biggest questions when it comes to monorepos is: do the pros outweigh the cons?
Well… There’s a pretty quick checklist you could make just to find that out:
If you answered yes to all three, consider yourself lucky and let’s go! If not, keep thinking about your approaches—a monorepo might not be the best answer. Another additional question you might ask is “who consumes this?” While it’s not a hard and fast rule, high-usage frameworks or libraries tend to be structured as monorepos (React, Angular, Meteor, etc).
Let’s make a brand new project, called links-and-stuff
in a directory somewhere, and then run the following
cd links-and-stuff
npm i -g lerna
lerna init --independent
lerna add links
This will create boilerplate with a packages
folder. The --independent
flag means we’ll use separate versioning for each project. Your layout should look like this now
|-- package.json
|-- lerna.json
|-- packages
|---- links
|---- stuff
Now run lerna add lodash
to install lodash into each package. (If we ran lerna add lodash --scope=links
for example, it would only install lodash in the links package).
There are some clear advantages that you’ll quickly find when managing a monorepo.
For one, Lerna’s exec
command allows you to run a command in each package. For example,
lerna exec -- rm -rf ./node_modules
Will delete the node_modules
in each package. A similar command is run
, which is specifically for npm scripts.
lerna run build
Will run npm run build
in each package, building them in parallel. (You can use the --scope
argument previously discussed to only affect certain packages). Another example: let’s say we wanted to run tests in each package, but we also wanted to update our jest snapshots. We can pass arguments the way you would with any npm script.
lerna run test -- -u
Another awesome thing about lerna is its publish
command. I personally use this variation of it:
lerna publish --conventional-commits --yes
What this will do is publish each of your npm packages and generate the appropriate npm version based off the commits (with the --conventional-commits
flag) and generate a changelog for each (using the --changelog-preset
argument, which defaults to the angular preset). The --yes
flag auto-confirms the changes; you may want to turn this off if you want to verify the versions before publishing.
Monorepos do have some issues, but Lerna monorepos do have fewer issues than a regular monorepo. For example, publishing is a breeze and versioning, maintained via npm, is not singular or lost. Some of them are specific to Lerna.
If you’re using yarn, you may face some issues regarding compatibility with lerna now that it has moved back to npm, and using both in one monorepo is an absolutely bad idea due to incompatibilities between yarn.lock
, package.json
, and the pack
command.
At scale, lerna starts to slow down significantly as the number of packages increases. Monorepos such as babel don’t even use the lerna run
command for this reason, as it cycles through each package, which can become cumbersome—at that point, it makes more sense to write a custom build script.
Another potential problem comes down to CI/CD, as it sometimes requires unecessarily complicated setups in the pipeline. While parallel pipelines in continuous deployment tools like CircleCI are useful for this, it’s not an answer at scale. Like before, this sometimes requires custom build scripts and the like.
And the last thing that I think is worth bringing up is the suggestion that monorepos hamper autonomy of teams, and that code sharing can introduce coupling. I’ve thought about this one the most, since it doesn’t have a “clear” solution. It’s philosophical. When code gets housed in the same repository, everyone can see all the code. But like an open space lined with desks, it often gets cramped, and that same transparency can make you feel like you’re stepping on other people’s toes. Sometimes you just want a closed room.


Configuring Facebook Authentication
How to enable or disable the DotNetNuke Facebook authentication system that allows users to login to DNN using their existing Facebook account.
You will need to sign up for a Facebook Authentication account to complete this tutorial. This authentication system must be enabled by a SuperUser before it can be viewed and configured.See "Managing Authentication System Settings"
- Navigate to Admin > Extensions - OR - Go to an Extensions module.
- Expand the Authentication System section.
- Click the Edit button beside DotNetNuke Facebook Authentication Project.
- Expand the Authentication Settings section.
- At Enabled?, select from these options:
- to enable Facebook authentication.
- to disable Facebook authentication. Note that any ID and Secret information you have added will not be removed from these fields unless you manually remove them. This allows you to re-enable this authentication system at any time without re-entering this information. Skip to Step 8.
- In the APP ID text box, enter the information provided to you by Facebook.
- In the APP Secret text box, enter the secret code provided to you by Facebook.
- Click the Update Authentication Settings link.
- Click the Cancel button to return to the Extensions module. The Facebook login button is now displayed on the Login page and any Account Login modules.
-
See "Logging in with Facebook"


Home
Hardware
Developers
Analytics
Robotic Arm
Created by John, Pete, Daniel, and Isabella
Base to position:
0
45
90
135
180
Shoulder to position:
0
45
90
135
180
Elbow to position:
0
45
90
135
180
Wrist to position:
0
45
90
135
180
Claw to position:
0
45
90
135
180


Speaker docks for iPhones, iPods and iPads are expensive, ugly or offer plain terrible sound quality. Often they’re all three yet they’re popular. Your iOS device is a great interface for browsing and selecting music having to dock it significantly diminishes that experience.
For a couple years I’ve been running a great sounding, good looking and cheap sound system based on Apple’s Airport Express which any of my devices or computers can wirelessly interface. I couldn’t be happier with the setup yet it seems surprisingly rare. Here are the details and the cost breakdown:
- Apple Airport Express — $99
- 1970s 20W Kenwood KA-3700 — Bought up on Ebay for $80.
- Philips AK285 passive speakers — $0, sitting under Mum’s stairs unused.
You can’t buy an amp exactly like this new but a lot of low-powered, 1970s Japanese-made amps were made and there’s many available second hand. Similar models were made by Marantz, Pioneer, Sansui and Yamaha. My exact model is for sale (as of this time of writing) on Ebay for $88. A little hunting and patience and you’ll find a great deal. Alternatively, check the storage cupboards of your parents/aunties/uncles/grandparents. Everyone used to have these hooked up to their phonographs and you might be surprised by how many are floating around your extended family unused. Seriously.
Despite modern models made by these same manufactures costing 10× more the electronics powering them have changed very little and sound quality is indistinguishable to a regular listener. They lack features like remote controls and many input options but these are unnecessary when used with an Airport Express.
While I was lucky to get a free set of speakers, the exact same pair can be found second hand on Gumtree for $80. Similar sets come up on Ebay all the time but even a nice set of new passive bookshelf speakers don’t cost a great deal.
The Interface
Any device or computer running iOS or Mac OS connected to your wireless network can stream music to the Airport Express attached to the amplifier using the magic of Airplay. That means you can use iTunes, the great Music apps on your iOS device, the iOS Remote app playing music from your computer or any other audio producing app (including YouTube, Spotify, Rdio) to wirelessly send audio to your hifi setup.
With my full music collection on my computer most commonly I’ll use the Remote app on my iPhone or iPad to select music on my computer which is played through my hifi system using Airplay. When people see me do this it blows their minds.
It’s a great experience to lay in your bedroom or sit outside, search for and select music to play from the big music collection on your computer using your iPhone and have it play through your high quality hifi system in your lounge room. Even the volume can be controlled remotely. Compare it to having to get up to skip a song on a docked iPhone, hit next on a computer keyboard or seek through a CD.
I’m no audiophile (and have nothing but sympathy for those who are) but the quality of sound out of this system is fantastic. Despite the low wattage it’s loud too, much louder than I could ever turn it up in my apartment building.
This setup is one of the very few things, especially in the world of electronics, that isn’t only ideal in its quality and usability but is also low cost and accessible.


{{ .Title }}
Photo
Aircraft Model
Registration
Price
{{range .Items}}
{{.Model}}
{{.Registration}}
{{.LocalPrice}}
{{end}}
This is a demo of the
Service Preview
feature of the
Ambassador Edge Stack
by
Datawire
.


[§431:10D-509] Authority to adopt rules. The commissioner may adopt rules under chapter 91 implementing this part. [L 2000, c 252, pt of §3]


Class ARBOcclusionQuery
- java.lang.Object
-
- org.lwjgl.opengl.ARBOcclusionQuery
-
public class ARBOcclusionQuery extends java.lang.Object
Native bindings to the ARB_occlusion_query extension.This extension defines a mechanism whereby an application can query the number of pixels (or, more precisely, samples) drawn by a primitive or group of primitives.
The primary purpose of such a query (hereafter referred to as an "occlusion query") is to determine the visibility of an object. Typically, the application will render the major occluders in the scene, then perform an occlusion query for the bounding box of each detail object in the scene. Only if said bounding box is visible, i.e., if at least one sample is drawn, should the corresponding object be drawn.
The earlier HP_occlusion_test extension defined a similar mechanism, but it had two major shortcomings.
- It returned the result as a simple
TRUE
/FALSE
result, when in fact it is often useful to know exactly how many samples were drawn. - It provided only a simple "stop-and-wait" model for using multiple queries. The application begins an occlusion test and ends it; then, at some later point, it asks for the result, at which point the driver must stop and wait until the result from the previous test is back before the application can even begin the next one. This is a very simple model, but its performance is mediocre when an application wishes to perform many queries, and it eliminates most of the opportunities for parallelism between the CPU and GPU.
This extension solves both of those problems. It returns as its result the number of samples that pass the depth and stencil tests, and it encapsulates occlusion queries in "query objects" that allow applications to issue many queries before asking for the result of any one. As a result, they can overlap the time it takes for the occlusion query results to be returned with other, more useful work, such as rendering other parts of the scene or performing other computations on the CPU.
There are many situations where a pixel/sample count, rather than a boolean result, is useful.
- Objects that are visible but cover only a very small number of pixels can be skipped at a minimal reduction of image quality.
- Knowing exactly how many pixels an object might cover may help the application decide which level-of-detail model should be used. If only a few pixels are visible, a low-detail model may be acceptable.
- "Depth peeling" techniques, such as order-independent transparency, need to know when to stop rendering more layers; it is difficult to determine a priori how many layers are needed. A boolean result allows applications to stop when more layers will not affect the image at all, but this will likely result in unacceptable performance. Instead, it makes more sense to stop rendering when the number of pixels in each layer falls below a given threshold.
- Occlusion queries can replace glReadPixels of the depth buffer to determine whether (for example) a light source is visible for the purposes of a lens flare effect or a halo to simulate glare. Pixel counts allow you to compute the percentage of the light source that is visible, and the brightness of these effects can be modulated accordingly.
Promoted to core in
OpenGL 1.5
. - It returned the result as a simple
-
-
Field Summary
Fields Modifier and Type Field and Description static int
GL_CURRENT_QUERY_ARB
GL_QUERY_COUNTER_BITS_ARBAccepted by thepname
parameter of GetQueryivARB.static int
GL_QUERY_RESULT_ARB
GL_QUERY_RESULT_AVAILABLE_ARBAccepted by thepname
parameter of GetQueryObjectivARB and GetQueryObjectuivARB.static int
GL_SAMPLES_PASSED_ARB
Accepted by thetarget
parameter of BeginQueryARB, EndQueryARB, and GetQueryivARB.
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method and Description static void
glBeginQueryARB(int target, int id)
Creates a query object and makes it active.static void
glDeleteQueriesARB(int id)
Deletes named query objects.static void
glDeleteQueriesARB(int[] ids)
Array version of:DeleteQueriesARB
static void
glDeleteQueriesARB(java.nio.IntBuffer ids)
Deletes named query objects.static void
glEndQueryARB(int target)
Marks the end of the sequence of commands to be tracked for the active query specified bytarget
.static int
glGenQueriesARB()
Generates query object names.static void
glGenQueriesARB(int[] ids)
Array version of:GenQueriesARB
static void
glGenQueriesARB(java.nio.IntBuffer ids)
Generates query object names.static int
glGetQueryiARB(int target, int pname)
Returns parameters of a query object target.static void
glGetQueryivARB(int target, int pname, int[] params)
Array version of:GetQueryivARB
static void
glGetQueryivARB(int target, int pname, java.nio.IntBuffer params)
Returns parameters of a query object target.static int
glGetQueryObjectiARB(int id, int pname)
Returns the integer value of a query object parameter.static void
glGetQueryObjectivARB(int id, int pname, int[] params)
Array version of:GetQueryObjectivARB
static void
glGetQueryObjectivARB(int id, int pname, java.nio.IntBuffer params)
Returns the integer value of a query object parameter.static int
glGetQueryObjectuiARB(int id, int pname)
Unsigned version ofGetQueryObjectivARB
.static void
glGetQueryObjectuivARB(int id, int pname, int[] params)
Array version of:GetQueryObjectuivARB
static void
glGetQueryObjectuivARB(int id, int pname, java.nio.IntBuffer params)
Unsigned version ofGetQueryObjectivARB
.static boolean
glIsQueryARB(int id)
Determine if a name corresponds to a query object.
-
-
-
Field Detail
-
GL_SAMPLES_PASSED_ARB
public static final int GL_SAMPLES_PASSED_ARB
Accepted by thetarget
parameter of BeginQueryARB, EndQueryARB, and GetQueryivARB.- See Also:
- Constant Field Values
-
GL_QUERY_COUNTER_BITS_ARB
public static final int GL_QUERY_COUNTER_BITS_ARB
Accepted by thepname
parameter of GetQueryivARB.- See Also:
- Constant Field Values
-
GL_CURRENT_QUERY_ARB
public static final int GL_CURRENT_QUERY_ARB
Accepted by thepname
parameter of GetQueryivARB.- See Also:
- Constant Field Values
-
GL_QUERY_RESULT_ARB
public static final int GL_QUERY_RESULT_ARB
Accepted by thepname
parameter of GetQueryObjectivARB and GetQueryObjectuivARB.- See Also:
- Constant Field Values
-
GL_QUERY_RESULT_AVAILABLE_ARB
public static final int GL_QUERY_RESULT_AVAILABLE_ARB
Accepted by thepname
parameter of GetQueryObjectivARB and GetQueryObjectuivARB.- See Also:
- Constant Field Values
-
-
Method Detail
-
glGenQueriesARB
public static void glGenQueriesARB(java.nio.IntBuffer ids)
Generates query object names.- Parameters:
ids
- a buffer in which the generated query object names are stored
-
glGenQueriesARB
public static int glGenQueriesARB()
Generates query object names.
-
glDeleteQueriesARB
public static void glDeleteQueriesARB(java.nio.IntBuffer ids)
Deletes named query objects.- Parameters:
ids
- an array of query objects to be deleted
-
glDeleteQueriesARB
public static void glDeleteQueriesARB(int id)
Deletes named query objects.
-
glIsQueryARB
public static boolean glIsQueryARB(int id)
Determine if a name corresponds to a query object.- Parameters:
id
- a value that may be the name of a query object
-
glBeginQueryARB
public static void glBeginQueryARB(int target, int id)
Creates a query object and makes it active.- Parameters:
target
- the target type of query object established. One of:SAMPLES_PASSED
PRIMITIVES_GENERATED
TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN
TIME_ELAPSED
TIMESTAMP
ANY_SAMPLES_PASSED
ANY_SAMPLES_PASSED_CONSERVATIVE
id
- the name of a query object
-
glEndQueryARB
public static void glEndQueryARB(int target)
Marks the end of the sequence of commands to be tracked for the active query specified bytarget
.- Parameters:
target
- the query object target. One of:SAMPLES_PASSED
PRIMITIVES_GENERATED
TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN
TIME_ELAPSED
TIMESTAMP
ANY_SAMPLES_PASSED
ANY_SAMPLES_PASSED_CONSERVATIVE
-
glGetQueryivARB
public static void glGetQueryivARB(int target, int pname, java.nio.IntBuffer params)
Returns parameters of a query object target.- Parameters:
target
- the query object target. One of:SAMPLES_PASSED
PRIMITIVES_GENERATED
TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN
TIME_ELAPSED
TIMESTAMP
ANY_SAMPLES_PASSED
ANY_SAMPLES_PASSED_CONSERVATIVE
pname
- the symbolic name of a query object target parameter. One of:QUERY_COUNTER_BITS_ARB
CURRENT_QUERY_ARB
params
- the requested data
-
glGetQueryiARB
public static int glGetQueryiARB(int target, int pname)
Returns parameters of a query object target.- Parameters:
target
- the query object target. One of:SAMPLES_PASSED
PRIMITIVES_GENERATED
TRANSFORM_FEEDBACK_PRIMITIVES_WRITTEN
TIME_ELAPSED
TIMESTAMP
ANY_SAMPLES_PASSED
ANY_SAMPLES_PASSED_CONSERVATIVE
pname
- the symbolic name of a query object target parameter. One of:QUERY_COUNTER_BITS_ARB
CURRENT_QUERY_ARB
-
glGetQueryObjectivARB
public static void glGetQueryObjectivARB(int id, int pname, java.nio.IntBuffer params)
Returns the integer value of a query object parameter.- Parameters:
id
- the name of a query objectpname
- the symbolic name of a query object parameter. One of:QUERY_RESULT_ARB
QUERY_RESULT_AVAILABLE_ARB
params
- the requested data
-
glGetQueryObjectiARB
public static int glGetQueryObjectiARB(int id, int pname)
Returns the integer value of a query object parameter.- Parameters:
id
- the name of a query objectpname
- the symbolic name of a query object parameter. One of:QUERY_RESULT_ARB
QUERY_RESULT_AVAILABLE_ARB
-
glGetQueryObjectuivARB
public static void glGetQueryObjectuivARB(int id, int pname, java.nio.IntBuffer params)
Unsigned version ofGetQueryObjectivARB
.- Parameters:
id
- the name of a query objectpname
- the symbolic name of a query object parameter. One of:QUERY_RESULT_ARB
QUERY_RESULT_AVAILABLE_ARB
params
- the requested data
-
glGetQueryObjectuiARB
public static int glGetQueryObjectuiARB(int id, int pname)
Unsigned version ofGetQueryObjectivARB
.- Parameters:
id
- the name of a query objectpname
- the symbolic name of a query object parameter. One of:QUERY_RESULT_ARB
QUERY_RESULT_AVAILABLE_ARB
-
glGenQueriesARB
public static void glGenQueriesARB(int[] ids)
Array version of:GenQueriesARB
-
glDeleteQueriesARB
public static void glDeleteQueriesARB(int[] ids)
Array version of:DeleteQueriesARB
-
glGetQueryivARB
public static void glGetQueryivARB(int target, int pname, int[] params)
Array version of:GetQueryivARB
-
glGetQueryObjectivARB
public static void glGetQueryObjectivARB(int id, int pname, int[] params)
Array version of:GetQueryObjectivARB
-
glGetQueryObjectuivARB
public static void glGetQueryObjectuivARB(int id, int pname, int[] params)
Array version of:GetQueryObjectuivARB
-
-


Stars shine on opening day of Paraguay 2019
by FIFA.com- FIFA Beach Soccer World Cup Paraguay 2019 off to thrilling start
- Italy impress as Gabriele Gori scores five
- Japan, Uruguay and Switzerland all win narrowly
REVIEW OF THE DAY - The FIFA Beach Soccer World Cup Paraguay 2019 started with a bang on a matchday that saw a total of 28 goals scored across four games. Italy made a huge statement by defeating 2017 runners-up Tahiti by an eight-goal margin thanks to 2017 top scorer Gabriele Gori's five goals, who showed once again why he's one of the deadliest beach soccer forwards on the planet.
Switzerland held off a persistent USA side in another 14-goal thriller before Uruguay and Mexico played out a tight contest with both goalkeepers Alejandro Guerrero (Uruguay) and Gabriel Macias (Mexico) putting in strong performances, but ultimately Gaston Laduche's late strike won it for La Celeste. The day wrapped up in some style as Japan defeated Paraguay thanks to a birthday boy's header in the last second of the match.
Group A
Switzerland 8-6 USA 🎥
Paraguay 4-5 Japan 🎥
Group B
Italy 12-4 Tahiti 🎥
Uruguay 1-0 Mexico 🎥
Moments of the day 📌
A tradition observed and respected
Before kick-off of the opening match of the tournament, there was a special moment when Tahiti performed their traditional haka dance, a ceremonial symbol of challenge to the opponent. Not only did the Tahitians get the competition started in a beautiful and unique way, but their Italian opponents showed great respect for Tahiti by applauding them. Watch the Tiki Toa (Warrior Gods) perform the haka before a training session below or get a view of today's by visiting our Instagram Stories.
Stankovic's special celebration
A living legend of beach soccer opened the scoring in Switzerland's thrilling 8-6 win over USA. Dejan Stankovic scored with a trademark piece of skill, scoring with an acrobatic bicycle kick and he added more style points with the celebration that followed. By putting the ball under his shirt and sucking on his thumb, Stankovic dedicated the goal to his second daughter Ema who was born just three months ago.
Birthday boy's brace
Any day playing in the Beach Soccer World Cup is special, but when you start and score a brace on your birthday, that takes things to another level. Japan forward Takuya Akaguma celebrated his 30th birthday on Thursday in style by scoring twice in front of the home crowd in Asuncion and, most notably, heading in the winner from Ozu Moreira's corner with less than a second left on the clock.
Shots of the day 📸
Photos of the day - 21 November (Paraguay 2019)
What's next 🗓
Matchday 2 - 22 November
Group C
Senegal v Russia
Belarus v UAE
Group D
Portugal – Nigeria
Brazil - Oman
Matchday 2 will see three former Beach Soccer World Cup champions take to the stage. Russia will kick off the day against African champions Senegal before Portugal take on Nigeria. Beach Soccer kings Brazil will wrap up the evening against Oman.
The tournament's only debutants Belarus face United Arab Emirates, Asia's runners-up.


Next Chapter | Previous Chapter | Contents | Index
This chapter describes some of the common problems that users have been known to encounter with NASM, and answers them. It also gives instructions for reporting bugs in NASM if you find a difficulty that isn't listed here.
We sometimes get `bug' reports about NASM generating inefficient, or
even `wrong', code on instructions such as
. This is a deliberate design feature,
connected to predictability of output: NASM, on seeing
, will generate the form of the
instruction which leaves room for a 32-bit offset. You need to code
if you want the space-efficient
form of the instruction. This isn't a bug, it's user error: if you prefer
to have NASM produce the more efficient code automatically enable
optimization with the
option (see
section 2.1.22).
Similarly, people complain that when they issue conditional jumps (which
are
by default) that try to jump too far,
NASM reports `short jump out of range' instead of making the jumps longer.
This, again, is partly a predictability issue, but in fact has a more
practical reason as well. NASM has no means of being told what type of
processor the code it is generating will be run on; so it cannot decide for
itself that it should generate
type
instructions, because it doesn't know that it's working for a 386 or above.
Alternatively, it could replace the out-of-range short
instruction with a very short
instruction that jumps over a
; this is a sensible solution for
processors below a 386, but hardly efficient on processors which have good
branch prediction and could have used
instead. So, once again, it's up to the
user, not the assembler, to decide what instructions should be generated.
See section 2.1.22.
ORG
Doesn't WorkPeople writing boot sector programs in the
format often complain that
doesn't work the
way they'd like: in order to place the
signature word at the end of a 512-byte boot sector, people who are used to
MASM tend to code
ORG 0 ; some boot sector code ORG 510 DW 0xAA55
This is not the intended use of the
directive in NASM, and will not work. The correct way to solve this problem
in NASM is to use the
directive, like this:
ORG 0 ; some boot sector code TIMES 510-($-$$) DB 0 DW 0xAA55
The
directive will insert exactly enough
zero bytes into the output to move the assembly point up to 510. This
method also has the advantage that if you accidentally fill your boot
sector too full, NASM will catch the problem at assembly time and report
it, so you won't end up with a boot sector that you have to disassemble to
find out what's wrong with it.
TIMES
Doesn't WorkThe other common problem with the above code is people who write the
line as
TIMES 510-$ DB 0
by reasoning that
should be a pure number,
just like 510, so the difference between them is also a pure number and can
happily be fed to
.
NASM is a modular assembler: the various component parts are
designed to be easily separable for re-use, so they don't exchange
information unnecessarily. In consequence, the
output format, even though it has been told
by the
directive that the
section should start at 0, does not pass
that information back to the expression evaluator. So from the evaluator's
point of view,
isn't a pure number: it's an
offset from a section base. Therefore the difference between
and 510 is also not a pure number, but involves
a section base. Values involving section bases cannot be passed as
arguments to
.
The solution, as in the previous section, is to code the
line in the form
TIMES 510-($-$$) DB 0
in which
and
are offsets from the same section base, and so their difference is a pure
number. This will solve the problem and generate sensible code.
We have never yet released a version of NASM with any known
bugs. That doesn't usually stop there being plenty we didn't know about,
though. Any that you find should be reported firstly via the
at
(click on "Bugs"), or if that fails then through one of the contacts in
section 1.2.
Please read section 2.2 first, and don't report the bug if it's listed in there as a deliberate feature. (If you think the feature is badly thought out, feel free to send us reasons why you think it should be changed, but don't just send us mail saying `This is a bug' if the documentation says we did it on purpose.) Then read section 12.1, and don't bother reporting the bug if it's listed there.
If you do report a bug, please give us all of the following information:
NASMENV
environment variable if any.


[[outline/outline]]
ultimately, we highlight a certain number of properties which would be indicative of source code being considered beautiful. these include: naming, data structures, double-coding, layout, spatial structuring, reader flow, etc.
finally, this section concludes as a recapitulation of how attributes contribute to clarity, by providing a different heuristic than in [2.1]. instead of starting from separate texts and extracting different parts and grouping these parts with others, extracted from other texts, we group our practical and theoretical findings under the umbrellas of several aesthetic features we’ve identified, and described on which levels they operate.
a class within a class link is a visual/spatio-mental pattern which means “complexity”, “unmaintainability”, “unsustainability”
My personal style guide is to copy Erlang: double quotes for text, single quotes for programmatic strings (atoms/symbols). The single quote is slightly more convenient to type on a qwerty keyboard, but text regularly contains single quotes (apostrophes). It also provides a semantic visual shortcut.
I like the concept of semantic visual shortcut, also semantic compression (developed here)
[[cohen_on_holy_wars_and_peace]] [[pugh_beauty_simplicity]] [[green_coding_guidelines]] [[spinellis_reading_writing_code]] [[perrin_program_elegance]] [[hayes_semincolon_wars]] [[raymond_wesley_metric_for_code_readability]]
[[hill_what_makes_a_program_elegant]]
[[hunt_pragmatic_programmer]]
[[kernighan_elements_programming_style]]
[[kernighan_why_pascal_is_not_my_favorite_programming_language]]
use nouns for variables, verbs for functions, try to mimick an abstracted version of the human language (question: what is the limit of that mimicking the human language -cf. code/render.rb
? what integrity does it have to keep? a possible answer is the input data or the problem-domain)
as a corollary to metaphor, it’s just about implying something with a minimal sign (the density, as goodman would say, becomes very high)
basically put your variables where you use them, avoid gotos
a word on (automated) consistency
abstracts stuff but not too much: it’s kinda like the UNIX philosophy, where the goal is to do one thing, but do it well
like tobi’s example of using select{}
rather than mtx.Lock()
in GO
. select is slower but something like mtx.Lock()
is actually never going to be required in a design document: it’s extraneous when wanting to understand what a software effectively doing. another example of that is the un-necessity of diff noise
.
finally, this section will confront our set of aesthetic features to several case studies of existing source code. the choice of these case studies will attempt to be as broad and representative as possible (e.g. commercial, functional, hobbyist, artistic), with the aim of using diverse approaches in order to further qualify the aesthetic approaches defined heretofore.
the reason why UNIX is chosen is as a canonical example of low-level, functional programming with a rich social history
the reason why react is chosen is because it has aspects of modern development practices (big corp + open source), and that prod vs. dev is an interesting example to build on
this is taking it in a completely different literary terrain
https://queue.acm.org/detail.cfm?id=1039535
This recalls the idea of \emph{semantic proximity}, extracted from our analysis of programmers’ comments and opinions on what they found makes code beautiful. Such a pattern does however contrast with the nature of object-oriented programming, in which inheritance (and subsequent local abstraction of subclasses) is considered best practice. Gabriel calls this idea \emph{locality}: it is
\begin{quote} that characteristic of source code that enables a programmer to understand that source by looking at only a small portion of it. \citep{gabriel_patterns_1998}\footnote{He adds that this isn’t so much an issue if one is using a powerful and efficient IDE—a remark which opens up the question of the role of tools and technical mediators in the reading and writing process…} \end{quote}
as we have our typology, we realize that they are all a bit all over the place. is there something that binds them all? yes, programming languages, so we turn to that next to see how a medium/object/material can meet all those at once


TSLint Error Report
Total Lint Errors: {{total}}
No.
File Path
Count
{{#each errors as |error|}}
{{error.index}}
{{error.name}}
{{error.count}}
| No. |
Failure |
Rule Name |
Start Position |
End Position |
{{#each error.details as |detail| }}
| {{@index}} |
{{detail.failure}} |
{{detail.ruleName}} |
Line: {{detail.startPosition.line}}, Col: {{detail.startPosition.character}} |
Line: {{detail.endPosition.line}}, Col: {{detail.endPosition.character}} |
{{/each}}
{{/each}}


311 Pacific Hwy Lindfield NSW 2070
Trading hours Mon - Sat: 9am - 5pm
PO Box 6024 Pymble NSW 2073
Phone: (02) 9415-8644 Fax: (02) 9416-3704
ABN: 90 074 742 984
Who are we and what do we do?
What services do we offer?
What properties do we have to let?
Are you interested in renting one of our properties?
Peter Miller Principal Mobile: ####-###-###
<EMAIL_ADDRESS>[Home] [Properties to let] [Tenancy Application] [Services] [About us]
Copyright 2002 Northside Property Management. Created by GreenAsh Services.


 I, however, learned another lesson,{% endraw %}
{% raw %}and thought that in the future I had better let{% endraw %}
{% raw %}coloured volunteers gain wisdom and experience for{% endraw %}
{% raw %}themselves, without giving them either advice or{% endraw %}
{% raw %}personal assistance.{% endraw %}
{% raw %}-♦-{% endraw %}


Philosophy and Fun of Algebra
by Mary Everest Boole
Chapter 10: "The Story of a Working Hypothesis"
Additional Information
- Year Published: 1909
- Language: English
- Country of Origin: England
- Source: Boole, M. E. (1909). Philosophy and Fun of Algebra.London, England:.
-
Readability:
- Flesch–Kincaid Level: 6.0
- Word Count: 1,107
- Genre: Informational
- Keywords: math history, mathematics
- ✎ Cite This
Downloads
In an old Hebrew book there is a story of a person named Jacob, which means the Supplanter. If you want to know why, you had better read the story for yourself some day. It is not entirely a pretty story, but it is very instructive. Jacob had a dream in which he saw "angels" coming down a ladder. It would be a very profitable exercise of your imagination to ask yourselves why this particular patriarch saw angels on a ladder, whereas so many other Hebrews saw them in clouds, or flying down on wings, or mixed up with flames and other romantic, pretty, moving things.
Jacob had another dream, and saw an angel who wrestled with him, and apparently left him with sciatica for life; which is not surprising, for he had been sleeping out of doors on bare ground, just when he had been wrestling with very serious difficulties caused by his own dishonest tricks.
Well, the angel who gave Jacob sciatica gave him something else: a new name. Why did he give him a new name? Taking a new name was an ancient ceremony which meant entering a new service. Sixty years ago servants in Devonshire were called by their employer's name. A gardener would have two names—his own, which he got from his father, and his master's. I have even heard dogs called by their master's names, for instance, Toby Smith, or Ponto Jones.
You will often notice in old books that when people were converted, that is to say, when they either took up a new religion or turned from bad ways to good ones, the people who persuaded them to be converted gave them a new name, very often the teacher's own name. Well, the angel who wrestled with Jacob appears to have converted him. He seems to have persuaded Jacob that there are other ways of getting on in the world and promoting the fortunes of one's children and grandchildren besides cheating everybody, including one's own nearest relations.
Therefore Jacob was not to be called "the Supplanter" any more: his new name was to be "Israel." Jacob's descendants are called Hebrews, and also "the people of Israel." "Israel" was the new name which Jacob got when he turned from cheating to a better way of getting on in life.
What was that better way? That is our x, our first unknown. What does the word "Israel" mean? That is our y, our second unknown. I may as well tell you at once that, so far as I am concerned, y remains unknown. I want you to take notice that I do not know what the word "Israel" means. But some twenty years ago my imagination supplied me with a working hypothesis:
–Suppose "Israel" meant "rhythm."
Now if I had gone telling people that "Israel" means "rhythm," I should have been contradicted and laughed at and told that I had no proof of what I said and was talking of what I knew nothing about; and whoever said so would have been perfectly right. I should have been cheating myself and getting into bad slipshod habits. What I did was to post up inside my brain as a working hypothesis: "Suppose 'Israel' means 'rhythm,' what would be the consequence of that hypothesis?" Then I read through old books of the Hebrews, putting in my mind the word "rhythm" wherever I found the word "Israel," and "the people of rhythm" instead of "the people of Israel."
In the stories that are told about Jacob and his grandfather Abraham the angels are represented as telling the two men that if they would obey the angels, not only they themselves would be blessed, but all their descendants would be blessed too, and be made, at last, the means of conferring a great blessing on all the world; Moses warned them that, if they did not obey their own special angels, some special trouble would come to them.
My imagination suggested to me that perhaps getting into the swing of rhythmic beats is good for all people, but more good for the people of Israel than for anybody else; and that wandering off into irregular un-rhythmic freaks is more bad for the people of Israel than for anybody else.
This, again, you will observe, is purely imaginary hypothesis. I had not the faintest warrant for saying anything of the kind; therefore I did not say it; but I experimented at treating my Hebrew friends and acquaintance as if they were natural born ministers, or servants, of the principle of rhythmic beat; as if it was their business to introduce respect for rhythm and an orderly arrangement of time into the general morals of the world; and as if they would, of course, become degraded more than other people, if they allowed themselves to drift into being irregular and disorderly. Now you will observe that, though all this was purely imaginary hypothesis, it was of a harmless kind; there is nothing contrary to the ten commandments, or to any other register of safe rules, in treating one's Hebrew acquaintance as if one expected them to be more orderly as to time than other people.
The registered rules allowed me to consider this a safe road; and my imagination showed me that it was one along which I could travel quickly; therefore I started to go along it and waited to see where I got to. One consequence which came was that some of the people of Israel began telling me that I seemed to know things about their old books (even some old books that I had never read), which they themselves had never observed before; I had enabled them to get at real values for the x's and y's; of some of their problems.
Please notice that all this is pure imaginary hypothesis. Ancient peoples made a hypothesis, for which they had no authority, about angels; and I made one, for which I had no authority, about some of those supposed angels. And, by dealing logically with these imaginations, we got to some very real knowledge.


Name is required.
Brand is required.
Model Name is required.
Cost is required.
SIm type is required.
pixel is required.
is required.


StartupName
About
Contact
Sign Up
Login
This is a jumbotron
sdf;adsfdsfj;asdfjsdfjsd;afjds;ofjoasdfj;osdfaosdfjos;adfjs
Hi there
Hello Bootstrap
CLICK ME!
CLICK ME!
CLICK ME!
Bootstrap Docs
COL LG 6
COL LG 6


Download
New
File
Directory
Rename
Copy
Paste
Delete
If you like it, consider a small donation! ...and get rid of this annoying ad. Thanks.
black
bootstrap
default
gray
material
metro
Online FTP
Name
Size
Last modified
Name
Powered by online-ftp.net
Initializing...


Immersive learning is the process of learning with the usage of a simulated or artificial environment.An immersive experience is an illusory environment that completely surrounds you such that you feel that you are inside it and part of it. The term is associated with technology environments that command the senses such as virtual reality and mixed reality. The following are illustrative examples of immersive experience.
Events such as a concert designed to transform the venue such that it resembles a different reality.
Theme parks, movies and games that completely surround you. This includes pervasive games that draw virtual elements into the real world. In theory, movies could also occur in the real world.


Class ToscaRequirement
The Requirement definition describes a named requirement (dependencies)
of a TOSCA Node Type or Node template which needs to be fulfilled by a matching
Capability definition declared by another TOSCA modelable entity.
The requirement definition may itself include the specific name of the fulfilling entity
(explicitly) or provide an abstract type, along with additional filtering characteristics,
that a TOSCA orchestrator can use to fulfill the capability at runtime (implicitly).
Inheritance
Inherited Members
Namespace:Toscana
Assembly:Toscana.dll
Syntax
public class ToscaRequirement
Properties
| Improve this Doc View SourceCapability
The required reserved keyname used that can be used to provide the name of a valid Capability Type that can fulfill the requirement.
Declaration
[Required(ErrorMessage = "capability is required on requirement")]
public string Capability { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |
Node
The optional reserved keyname used to provide the name of a valid Node Type that contains the capability definition that can be used to fulfill the requirement.
Declaration
public string Node { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |
Occurrences
The optional minimum and maximum occurrences for the requirement. Note: the keyword UNBOUNDED is also supported to represent any positive integer.
Declaration
public object[] Occurrences { get; set; }
Property Value
| Type | Description |
|---|---|
| System.Object[] |
Relationship
The optional reserved keyname used to provide the name of a valid Relationship Type to construct when fulfilling the requirement.
Declaration
public string Relationship { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |
Operators
| Improve this Doc View SourceImplicit(String to ToscaRequirement)
Initializes an instance of ToscaRequirement and set Capability property value
Declaration
public static implicit operator ToscaRequirement(string capability)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | capability | Capability to set |
Returns
| Type | Description |
|---|---|
| ToscaRequirement | An instance of ToscaRequirement |


Gecode::SetVar Class Reference
[Set variables]
List of all members.Detailed Description
Set variables
Definition at line 663 of file var.icc.
Constructors and initialization | |
| SetVar (void) | |
| Default constructor. | |
| SetVar (Space *home) | |
| Initialize variable with empty greatest lower and full least upper bound. | |
| void | init (Space *home) |
| Initialize variable with empty greatest lower and full least upper bound. | |
| SetVar (Space *home, int glbMin, int glbMax, int lubMin, int lubMax, unsigned int cardMin=0, unsigned int cardMax=Limits::Set::card_max) | |
| Initialize variable with given bounds and cardinality. | |
| void | init (Space *home, int glbMin, int glbMax, int lubMin, int lubMax, unsigned int cardMin=0, unsigned int cardMax=Limits::Set::card_max) |
| Initialize variable with given bounds and cardinality. | |
| SetVar (Space *home, const IntSet &glbD, int lubMin, int lubMax, unsigned int cardMin=0, unsigned int cardMax=Limits::Set::card_max) | |
| Initialize variable with given bounds and cardinality. | |
| void | init (Space *home, const IntSet &glbD, int lubMin, int lubMax, unsigned int cardMin=0, unsigned int cardMax=Limits::Set::card_max) |
| Initialize variable with given bounds and cardinality. | |
| SetVar (Space *home, int glbMin, int glbMax, const IntSet &lubD, unsigned int cardMin=0, unsigned int cardMax=Limits::Set::card_max) | |
| Initialize variable with given bounds and cardinality. | |
| void | init (Space *home, int glbMin, int glbMax, const IntSet &lubD, unsigned int cardMin=0, unsigned int cardMax=Limits::Set::card_max) |
| Initialize variable with given bounds and cardinality. | |
| SetVar (Space *home, const IntSet &glbD, const IntSet &lubD, unsigned int cardMin=0, unsigned int cardMax=Limits::Set::card_max) | |
| Initialize variable with given bounds and cardinality. | |
| void | init (Space *home, const IntSet &glbD, const IntSet &lubD, unsigned int cardMin=0, unsigned int cardMax=Limits::Set::card_max) |
| Initialize variable with given bounds and cardinality. | |
Variable implementation access | |
| Set::SetVarImp * | variable (void) const |
| Return set variable implementation. | |
Value access | |
| unsigned int | glbSize (void) const |
| Return number of elements in the greatest lower bound. | |
| unsigned int | lubSize (void) const |
| Return number of elements in the least upper bound. | |
| unsigned int | unknownSize (void) const |
| Return number of unknown elements (elements in lub but not in glb). | |
| unsigned int | cardMin (void) const |
| Return cardinality minimum. | |
| unsigned int | cardMax (void) const |
| Return cardinality maximum. | |
| int | lubMin (void) const |
| Return minimum element of least upper bound. | |
| int | lubMax (void) const |
| Return maximum element of least upper bound. | |
| int | glbMin (void) const |
| Return minimum element of greatest lower bound. | |
| int | glbMax (void) const |
| Return maximum of greatest lower bound. | |
Domain tests | |
| bool | contains (int i) const |
| Test whether i is in greatest lower bound. | |
| bool | notContains (int i) const |
| Test whether i is not in the least upper bound. | |
| bool | assigned (void) const |
| Test whether this variable is assigned. | |
Cloning | |
| void | update (Space *home, bool, SetVar &x) |
| Update this variable to be a clone of variable x. | |
Related Functions | |
| (Note that these are not member functions.) | |
| std::ostream & | operator<< (std::ostream &, const Gecode::SetVar &x) |
| Print set variable x. |
Constructor & Destructor Documentation
|
|
Default constructor.
|
|
|
Initialize variable with empty greatest lower and full least upper bound.
|
|
|
Initialize variable with given bounds and cardinality. The variable is created with greatest lower bound , least upper bound , and cardinality minimum cardMin and maximum cardMax. The following exceptions might be thrown:
|
|
|
Initialize variable with given bounds and cardinality. The variable is created with greatest lower bound glbD, least upper bound , and cardinality minimum cardMin and maximum cardMax. The following exceptions might be thrown:
|
|
|
Initialize variable with given bounds and cardinality. The variable is created with greatest lower bound , least upper bound lubD, and cardinality minimum cardMin and maximum cardMax. The following exceptions might be thrown:
|
|
|
Initialize variable with given bounds and cardinality. The variable is created with greatest lower bound glbD, least upper bound lubD, and cardinality minimum cardMin and maximum cardMax. The following exceptions might be thrown:
|
Member Function Documentation
|
|
Initialize variable with empty greatest lower and full least upper bound.
|
|
|
Initialize variable with given bounds and cardinality. The variable is created with greatest lower bound , least upper bound , and cardinality minimum cardMin and maximum cardMax. The following exceptions might be thrown:
|
|
|
Initialize variable with given bounds and cardinality. The variable is created with greatest lower bound glbD, least upper bound , and cardinality minimum cardMin and maximum cardMax. The following exceptions might be thrown:
|
|
|
Initialize variable with given bounds and cardinality. The variable is created with greatest lower bound , least upper bound lubD, and cardinality minimum cardMin and maximum cardMax. The following exceptions might be thrown:
|
|
|
Initialize variable with given bounds and cardinality. The variable is created with greatest lower bound glbD, least upper bound lubD, and cardinality minimum cardMin and maximum cardMax. The following exceptions might be thrown:
|
|
|
Return set variable implementation.
|
|
|
Return number of elements in the greatest lower bound.
|
|
|
Return number of elements in the least upper bound.
|
|
|
Return number of unknown elements (elements in lub but not in glb).
|
|
|
Return cardinality minimum.
|
|
|
Return cardinality maximum.
|
|
|
Return minimum element of least upper bound.
|
|
|
Return maximum element of least upper bound.
|
|
|
Return minimum element of greatest lower bound.
|
|
|
Return maximum of greatest lower bound.
|
|
|
Test whether i is in greatest lower bound.
|
|
|
Test whether i is not in the least upper bound.
|
|
|
Test whether this variable is assigned.
|
|
|
Update this variable to be a clone of variable x.
|
Friends And Related Function Documentation
|
|
Print set variable x.
|
The documentation for this class was generated from the following files:
- gecode/set/var.icc (Revision: 3568)
- gecode/set/var/set.cc (Revision: 3188)
- gecode/set/var/set.icc (Revision: 2334)


ToplistX allows you to create an unlimited number of ranking pages to display your accounts. This document will describe how you can add, update, and remove the ranking pages that ToplistX will be building.
While ToplistX does not set a limit on the number of ranking pages you can configure, your server configuration will be a limiting factor. If you plan on having a very large number
of ranking pages generated by ToplistX (500+) it is highly recommended that you have a high-end dedicated server.
Searching/Viewing Ranking Pages
To view the currently configured ranking pages so you can modify or delete them, access the ranking Pages > Manage Pages function from the control panel menu. This will display a page where you will be able to see all of the currently configured ranking pages and search them if necessary.
In the table that displays the ranking pages you have configured, you will find several functions that you can run on a single ranking page at a time. Each of those functions are described below.
| Click this icon to go directly to the ranking page template editing interface for this page | |
| Click this icon to edit the ranking page settings. A window will appear where you will be able to edit all of the page settings. | |
| Click this icon to delete this ranking page. This will delete the ranking page from the database so it is no longer updated, but will not remove the actual generated ranking page from your server. |
Adding Ranking Pages
To add a new ranking page, access the Ranking Pages > Manage Pages function from the control panel menu. Near the top of the page in the header bar that reads "Manage Ranking Pages" click on the icon. This will display a popup window where you will be able to enter the information for the new page. Each of the form fields are described below.
| Page URL | Enter the URL that you would like to use for the new page. The base URL of your site will already be filled in, so you only need to fill in the remaining part of the URL. If this points to a directory that does not yet exist, you will need to create the directory and set it's permissions to 777. If this points to a file that already exists, the file should be deleted or have it's permissions changed to 666; note that the existing file will be overwritten if you simply change it's permissions and do not rename it. |
| Category | Select a specific category for this page, or MIXED if you want to allow accounts from all categories. If you do select a specific category, only accounts from that category will be allowed to appear on the page |
| Build Order | Enter a number to indicate the order in which this page will be built. This value will automatically be filled in with the next available position in the build order, but you can change it to any value. Lower numbers indicate pages that will be built first, and larger numbers indicate pages that will be built last. |
| Tags | You can use this field to specify tags for this page. Tags are useful for selecting only specific pages when you are generating links between your pages. Tags must be at least 4 characters long and should be listed separated by spaces. |
Adding Ranking Pages in Bulk
To add multiple new ranking pages at one time, access the Ranking Pages > Manage Pages function from the control panel menu. Near the top of the page in the header bar that reads "Manage Ranking Pages" click on the icon. This will display a popup window where you will be able to enter the information for the new pages. Each of the form fields are described below.
| Base URL | Enter a URL that points to the directory on your server where you want the ranking pages created. This directory should have 777 permissions. |
| Category | Select a specific category to generate pages for, MIXED if you want to generate general pages that can contain any categories, or ALL CATEGORIES if you want to generate pages for all of your defined categories. |
| Filename Prefix | If you have selected MIXED for the category, you will need to fill in the filename prefix. This will be the name that will be used to generate the names that are used for the ranking pages. Examples are listed below. |
| File Extension | Enter the file extension - without a period - to use for the generated pages |
| Tags | You can use this field to specify tags for the generated pages |
| Number of Pages | Enter a number to indicate how many pages should be generated. Examples are listed below. |
| Conversions | Select what conversions should be done to category names when generating the ranking page filenames |
Bulk Page Examples
Here are a few examples of the ranking page names that will be generated based on the input specified.
-
Category: MIXED
Filename Prefix: toplist
File Extension: html
Number of Pages: 5
Conversions: -
Generated Pages
toplist.html
toplist2.html
toplist3.html
toplist4.html
toplist5.html -
Category: MIXED
Filename Prefix: toplist
File Extension: php
Number of Pages: 2
Conversions: -
Generated Pages
toplist.php
toplist2.php -
Category: Online Gambling
Filename Prefix: -
File Extension: html
Number of Pages: 3
Conversions: Replace non alpha-numeric with dash, all letters lower case
Generated Pages
online-gambling.html
online-gambling2.html
online-gambling3.html -
Category: Online Gambling
Filename Prefix: -
File Extension: shtml
Number of Pages: 4
Conversions: Remove non alpha-numeric, no change text case
Generated Pages
OnlineGambling.shtml
OnlineGambling2.shtml
OnlineGambling3.shtml
OnlineGambling4.shtml -
Category: ALL CATEGORIES (assume Online Gambling, Poker, Casinos)
Filename Prefix: -
File Extension: php
Number of Pages: 1
Conversions: Replace non alpha-numeric with underscore, all letters lower case
Generated Pages
online_gambling.php
poker.php
casinos.php -
Category: ALL CATEGORIES (assume Online Gambling, Poker, Casinos)
Filename Prefix: -
File Extension: html
Number of Pages: 3
Conversions: Replace non alpha-numeric with dash, no change text case
Generated Pages
Online-Gambling.html
Online-Gambling2.html
Online-Gambling3.html
Poker.html
Poker2.html
Poker3.html
Casinos.html
Casinos2.html
Casinos3.html
To edit a ranking page you will first need to locate it through the Manage Pages interface. When you locate the page you want to edit, click on the icon to bring up the page editing interface. This interface is nearly identical to the page creation interface, and has the same form fields with the same properties. You can make the changes that you want, and then press the Update Ranking Page button to save your changes.
Deleting a ranking Page
To delete a ranking page you will first need to locate it through the Manage Pages interface. When you locate the page you want to delete, click on the icon, which will ask you to confirm the deletion.
You can also delete several pages at once by putting a check in the box next to the pages you want to delete, then pressing the Delete button at the bottom of the page.


Basic Concepts of Machine Learning
Following concepts are basic and fundamental of machine learning.
Following concepts are basic and fundamental of machine learning.
In SVM we have discussed following points.
We have discussed following points in regression.
We have discussed following concepts in ensembling


[gecode-users] help! propagators stop being called after one cloning.
Grégoire Dooms
dooms at info.ucl.ac.be
Wed Mar 22 17:03:44 CET 2006
Oh !  That's probably the reason.
I'll correct this right now.
Best,
--
Grégoire
More information about the gecode-users
mailing list


The Return
Nicholas Sparks
In the romantic tradition of Dear John, #1 New York Times bestselling author Nicholas Sparks returns with the story of an injured Navy doctor — and two women whose secrets will change the course of his life.
Trevor Benson never intended to move back to New Bern, North Carolina. But when a mortar blast outside the hospital where he worked sent him home from Afghanistan with devastating injuries, the dilapidated cabin he'd inherited from his grandfather seemed as good a place to regroup as any.
Tending to his grandfather's beloved beehives, Trevor isn't prepared to fall in love with a local . . . yet, from their very first encounter, Trevor feels a connection with deputy sheriff Natalie Masterson that he can't ignore. But even as she seems to reciprocate his feelings, she remains frustratingly distant, making Trevor wonder what she's hiding.
Further complicating his stay in New Bern is the presence of a sullen teenage girl, Callie, who lives in the trailer park down the road. Trevor hopes Callie can shed light on the mysterious circumstances of his grandfather's death, but she offers few clues — until a crisis triggers a race to uncover the true nature of Callie's past, one more intertwined with the elderly man's passing than Trevor could ever have imagined.
In his quest to unravel Natalie and Callie's secrets, Trevor will learn the true meaning of love and forgiveness . . . and that in life, to move forward, we must often return to the place where it all began.


I worked collaboratively with Monika on 10/14 in order to diagnose this, and it may very well have been an error with permissions in which the user involved had the permissions to approve their own submission. This was corrected and the permissions were then tested for the system.
closed
by James R. Griffin III at 2019-10-18T17:53:53.This is blocked by REQ0135782 (there are likely other tickets enqueued, but this was the first to actually trigger some response on SN@P).
closed
by None at 2019-10-18T12:48:50.closed
by None at 2019-10-18T12:48:49.head_ref_force_pushed
by Esmé Cowles at 2019-10-18T10:58:22.head_ref_force_pushed
by Esmé Cowles at 2019-10-18T11:27:48.referenced
by None at 2019-10-18T12:48:49.merged
by None at 2019-10-18T12:48:49.closed
by None at 2019-10-18T12:48:50.head_ref_deleted
by Esmé Cowles at 2019-10-18T12:55:06.Added a test in the preserve all PR to ensure that collections aren't preserving their members:
https://github.com/pulibrary/figgy/pull/3436/commits/a3a0031f5f587b2cd55266ff0e53927b2c176dc9
Closing the issue.
closed
by Eliot Jordan at 2019-10-18T15:48:39.head_ref_force_pushed
by Eliot Jordan at 2019-10-18T15:40:58.head_ref_force_pushed
by Eliot Jordan at 2019-10-18T15:46:27.ready_for_review
by Eliot Jordan at 2019-10-18T15:49:07.review_requested
by Eliot Jordan at 2019-10-18T15:49:33.@hackmastera Removed that test.
head_ref_force_pushed
by Eliot Jordan at 2019-10-18T15:58:34.mentioned
by None at 2019-10-18T15:58:57.subscribed
by None at 2019-10-18T15:58:57.referenced
by Trey Pendragon at 2019-10-18T17:07:26.merged
by Trey Pendragon at 2019-10-18T17:07:26.closed
by Trey Pendragon at 2019-10-18T17:07:27.head_ref_deleted
by Trey Pendragon at 2019-10-18T17:07:30.I just wanted to say I'm sorry for the delay in re-reviewing this. I keep starting and getting lost undoing stubs to make sure the tests work with real data.
No apologies are needed, I am sorry that I have lost track with this (as well as https://github.com/pulibrary/figgy/pull/3290).
Should I close this for now? I doubt that I'll have the opportunity to revisit this for at least one week.
No, please keep it open.
closed
by Trey Pendragon at 2019-10-18T17:07:27.reopened
by Christina Chortaria at 2019-10-18T17:28:35.referenced
by None at 2019-10-18T19:02:43.merged
by None at 2019-10-18T19:02:43.closed
by None at 2019-10-18T19:02:43.referenced
by Trey Pendragon at 2019-10-18T17:14:12.closed
by None at 2019-10-18T19:02:43.referenced
by Trey Pendragon at 2019-10-18T17:16:20.closed
by None at 2019-10-18T19:03:18.referenced
by None at 2019-10-18T19:03:18.merged
by None at 2019-10-18T19:03:18.closed
by None at 2019-10-18T19:03:18.head_ref_deleted
by None at 2019-10-18T19:03:21.head_ref_force_pushed
by None at 2019-10-18T12:28:24.@kevinreiss I have one more PR, given the two additional issues I logged.
I added some tests and rewrote some of the code.
mentioned
by Kevin Reiss at 2019-10-18T12:28:39.subscribed
by Kevin Reiss at 2019-10-18T12:28:39.Here is an example of a suppressed record: https://bibdata.princeton.edu/bibliographic/10926564/items
referenced
by Christina Chortaria at 2019-10-18T18:07:10.merged
by Christina Chortaria at 2019-10-18T18:07:10.closed
by Christina Chortaria at 2019-10-18T18:07:10.closed
by James R. Griffin III at 2019-10-18T06:14:51.referenced
by James R. Griffin III at 2019-10-18T06:14:51.merged
by James R. Griffin III at 2019-10-18T06:14:51.closed
by James R. Griffin III at 2019-10-18T06:14:51.head_ref_deleted
by James R. Griffin III at 2019-10-18T06:14:54.Thank you @jrgriffiniii
mentioned
by James R. Griffin III at 2019-10-18T13:33:48.subscribed
by James R. Griffin III at 2019-10-18T13:33:48.head_ref_force_pushed
by Christina Chortaria at 2019-10-18T13:45:52.head_ref_force_pushed
by Christina Chortaria at 2019-10-18T13:49:21.review_requested
by Christina Chortaria at 2019-10-18T13:53:43.referenced
by James R. Griffin III at 2019-10-18T14:43:48.merged
by James R. Griffin III at 2019-10-18T14:43:48.closed
by James R. Griffin III at 2019-10-18T14:43:48.head_ref_deleted
by James R. Griffin III at 2019-10-18T14:43:50.referenced
by Esmé Cowles at 2019-10-18T15:21:53.merged
by Esmé Cowles at 2019-10-18T15:21:53.closed
by Esmé Cowles at 2019-10-18T15:21:53.head_ref_deleted
by Esmé Cowles at 2019-10-18T15:22:03.Please see the following screenshots:
head_ref_force_pushed
by James R. Griffin III at 2019-10-18T14:49:14.head_ref_force_pushed
by James R. Griffin III at 2019-10-18T14:54:18.ready_for_review
by James R. Griffin III at 2019-10-18T14:54:46.review_requested
by Christina Chortaria at 2019-10-18T15:03:22.head_ref_force_pushed
by James R. Griffin III at 2019-10-18T15:23:02.deployed
by Trey Pendragon at 2019-10-18T15:23:35.deployed
by Trey Pendragon at 2019-10-18T15:33:56.referenced
by Christina Chortaria at 2019-10-18T16:12:21.merged
by Christina Chortaria at 2019-10-18T16:12:21.closed
by Christina Chortaria at 2019-10-18T16:12:21.resolved by #29
closed
by Christina Chortaria at 2019-10-18T16:15:47.head_ref_force_pushed
by Esmé Cowles at 2019-10-18T15:39:18.referenced
by Christina Chortaria at 2019-10-18T16:27:48.merged
by Christina Chortaria at 2019-10-18T16:27:48.closed
by Christina Chortaria at 2019-10-18T16:27:49.assigned
by Christina Chortaria at 2019-10-17T22:02:55.unassigned
by Christina Chortaria at 2019-10-18T21:34:03.review_requested
by Francis Kayiwa at 2019-10-18T12:38:21.closed
by Francis Kayiwa at 2019-10-18T12:45:06.head_ref_deleted
by Francis Kayiwa at 2019-10-18T12:46:42.review_requested
by None at 2019-10-18T12:49:22.mentioned
by Axa Mei Liauw at 2019-10-18T12:49:48.subscribed
by Axa Mei Liauw at 2019-10-18T12:49:48.referenced
by Axa Mei Liauw at 2019-10-18T13:07:14.merged
by Axa Mei Liauw at 2019-10-18T13:07:15.closed
by Axa Mei Liauw at 2019-10-18T13:07:15.head_ref_deleted
by Axa Mei Liauw at 2019-10-18T13:07:18.referenced
by Francis Kayiwa at 2019-10-18T13:09:17.merged
by Francis Kayiwa at 2019-10-18T13:09:17.closed
by Francis Kayiwa at 2019-10-18T13:09:18.head_ref_deleted
by Francis Kayiwa at 2019-10-18T13:09:21.referenced
by Francis Kayiwa at 2019-10-18T13:11:38.merged
by Francis Kayiwa at 2019-10-18T13:11:39.closed
by Francis Kayiwa at 2019-10-18T13:11:39.head_ref_deleted
by Francis Kayiwa at 2019-10-18T13:11:42.review_requested
by Francis Kayiwa at 2019-10-18T13:17:15.referenced
by Francis Kayiwa at 2019-10-18T15:01:26.merged
by Francis Kayiwa at 2019-10-18T15:01:26.closed
by Francis Kayiwa at 2019-10-18T15:01:27.head_ref_deleted
by Francis Kayiwa at 2019-10-18T15:01:35.the VM is ready @carolyncole
mentioned
by None at 2019-10-18T12:24:45.subscribed
by None at 2019-10-18T12:24:45.closed
by Francis Kayiwa at 2019-10-18T12:24:47.reopened
by Francis Kayiwa at 2019-10-18T12:33:26.closed
by Francis Kayiwa at 2019-10-18T16:19:04.heya @kevinreiss and/or @sdellis do we have the varnish configs of "ye olde website" some place I can see what it cached?
mentioned
by Kevin Reiss at 2019-10-18T16:22:21.subscribed
by Kevin Reiss at 2019-10-18T16:22:21.mentioned
by Shaun Ellis at 2019-10-18T16:22:21.subscribed
by Shaun Ellis at 2019-10-18T16:22:21.review_requested
by Francis Kayiwa at 2019-10-18T16:06:48.head_ref_force_pushed
by Francis Kayiwa at 2019-10-18T19:29:24.head_ref_force_pushed
by Francis Kayiwa at 2019-10-18T20:35:02.referenced
by Christina Chortaria at 2019-10-18T15:08:20.merged
by Christina Chortaria at 2019-10-18T15:08:20.closed
by Christina Chortaria at 2019-10-18T15:08:20.