Delivery: pick up from farm gate, Wednesdays and Fridays, 3pm-6pm
Payment: cash on pickup, prepay here, or trade for a handful of magic beans
{{#if currentUser}}
{{#if isMyProduct vendor}}
EditDeleteEdit product will be here in Phase 1. For now, edit in your profile page.
{{else}}
{{/if}}
{{else}}


De Optimist
Wat moeten we nu nog met Marsman, vind je? Poëzie is al moeilijk voor veel mensen, en die van de oude dichters helemaal. Waarom zouden we er nu nog aan beginnen?
EÉN WET: LEVEN (Dutch)This book is created as a commemoration to Hendrik Marsman, for all the works that he left behind and the inspiration that he has given us. Because most of his works were never translated, most people have never had the chance to read his work; we want to change that.
That is why we created just that, a small booklet to start, 14 poems, carefully translated to leave the original meaning and flow intact, while still being enjoyable and readable by the broader public.
This is not the end; only a beginning of what we see as a passion that has given us a lot and what we feel deserves to be given back.
Hendrik Marsman (Zeist, 30 September 1899 – Gulf of Biscay, 21 June 1940) was a Dutch poet and writer. He died while escaping to Great Britain, when the ship he was sailing on, the S.S. Berenice, either suffered a fatal engine-room explosion, or was torpedoed by a German submarine which mistook Berenice for another vessel.
In poems including "De Overtocht" (The Crossing) some see signs of Hendrik Marsman predicting his own moment of dying and his fear "dat de dood het einde niet is" ('that death is not the end').
The lone black boat
fares in the deep of night
through a darkness, wild and great
towards death, towards death.
I lie deep in the moaning hold
cold and afraid and alone
and cry for the bright land
that behind the horizon disappeared
and cry for the dark land
that weakly on the horizon appeared.
one who is struck by love
and by blood is overpowered
has not experienced the darkest,
life has not passed away for good;
for the ultimate defeat
the heart suffers in the struggle with death.
oh! the journey to the eternal land
through a darkness, somber vastness
with the fear, never relenting
that death is not the end.
The first print has completely sold out, as for now there are no plans of reprinting the book. Interested parties can always get in contact with us.
Wat moeten we nu nog met Marsman, vind je? Poëzie is al moeilijk voor veel mensen, en die van de oude dichters helemaal. Waarom zouden we er nu nog aan beginnen?
EÉN WET: LEVEN (Dutch)Terzij de Horde haalden hun bandnaam uit een van zijn gedichten, en nu hebben ze een heel boek aan hem gewijd: A Crooked Flower in Cosmos’ Flailing Mouth, met gedichten van Marsman voor het eerst vertaald naar het Engels.
Mooi huwelijk metal en poezie (Dutch)


Peter Rich
Professor of Architecture
+27 (0)83 725 0665
<EMAIL_ADDRESS>Robert Rich
Architect
+27 (0)82 367 7738
<EMAIL_ADDRESS>Rogan Rich
Architect
+27 (0)72 477 4555
<EMAIL_ADDRESS>Shawn Labuschagne
Architectural Designer
+27 (0)82 740 3107
<EMAIL_ADDRESS>Address
Rich Architects
Unit UG03
76 Fourth Avenue
Melville


Restaurant Menu
Breakfast
$6.50. Served from 9am until 11am. Plates come with Beans, Rice, and Tortillas.
Lunch
Special $5 price runs from 11am to 4pm. After 4pm: $6.50. All plates come with Beans and Rice.
Dinner
Chips and Salsa are complimentary. All plates come with Salad, Beans and Rice.
A La Carte
Your choice of meat: Carne Asada, Pollo, Carnitas, Pollo Asado, El Pastor.
Desserts
Beverages


GMNX Viewer
Examples:
- Après Un Rêve (Faure): CWMN example with performance data.
Measures are mapped to time ranges with cursor motion.
The first few measures of the vocal line are also mapped at the
level of individual notes and events (click notes to play).
-
Jewish Cantillation:
Non-CWMN, non-European example with audio media and inline SVG. Time range highlighting is employed
instead of cursor motion, except for the last verse which shows right-to-left motion.
-
Symphony No. 2 (Lutosławski):
This 20th century non-CWMN example employs aleatoric techniques and shows the need for flexibility in mapping
regions to time or events. The parts progress and repeat in an unsynchronized
fashion, and visual regions are played multiple times at differing speeds.


Books
Syllabus
Skills to be Acquired
Here you define what sections does your {{ courseModel.structure === 'weeks' ? 'week': 'unit'}}s can potentially consist of and how they should be named.
*NOTE: this doesn't mean that every {{ courseModel.structure === 'weeks' ? 'week': 'unit'}} has to consist of all of these.
Material Types:*
Activity Types:
Test Types:
Here you can manage the weekly schedule of you course.
Add lectures and/or other events that are applicable to your course. This will help your students to better plan out their weekly activities.


can.view
Utilities for loading, processing, rendering, and live-updating of templates.
can.view( idOrUrl, data[, helpers] )
Loads a template, renders it with data and helper functions and returns the HTML of the template within a documentFragment.
var frag = can.view(
"/contact.ejs",
{first: "Justin", last: "Meyer"},
{
fullName: function(first, last){
return first +" "+ last
}
});
document.getElementById('contacts').appendChild(frag)
Parameters
-
idOrUrl
{String}
The URL of a template or the id of a template embedded in a script tag.
-
data
{Object}
Data to render the template with.
-
helpers
{Object<String,function()>}
An object of named local helper functions.
Returns
{documentFragment}
The rendered result of the template converted to html elements within a documentFragment.
can.view( idOrUrl )
Registers or loads a template and returns a renderer function that can be used to
render the template with data
and helpers
.
var renderer = can.view("/contact.ejs");
var frag = renderer(
{first: "Justin", last: "Meyer"},
{
fullName: function(first, last){
return first +" "+ last
}
})
document.getElementById('contacts').appendChild(frag)
Parameters
-
idOrUrl
{String}
The URL of a template or the id of a template embedded in a script tag.
Returns
{renderer(data, helpers)}
A renderer function that can render the template into a documentFragment.
Use
can.view( idOrUrl, data, helpers )
loads template content from an element, a url or a string, renders it with data, and converts it to a documentFragment so it can be easily and efficiently inserted into the DOM.This code:
Loads the template a 'mytemplate.ejs'. It might look like:
Renders it with {message: 'hello world'}, resulting in a documentFragment that contains:
Inserts the result into the foo element. Foo might look like:
Loading Templates
can.view
can load templates from a url or from a script.Loading templates from a script tag
To load from a script tag, create a script tag with:
For example:
Render with this template like:
Notice we passed the id of the element we want to render.
Loading templates from a url
To load from a url, simply pass the location of the template to
can.view
. The location of the template needs an extension that matches the type of template:Creating templates from strings
Create a template for a given id programmatically using
can.view.<engine>(id, template)
:It is also possible to get a nameless renderer function when creating a template from a string:
Supported Template Engines
CanJS supports the following live template languages:
can.EJS EmbeddedJS
can.Mustache Mustache
Rendering to strings and sub-templates
To render to a string, use
can.view.render(idOrUrl, data)
like:To convert that rendered string into a live documentFragment, use can.view.frag.
To render a can.EJS sub-template within another template, use render like:
Asynchronous Loading
By default, retrieving templates is done synchronously. This is fine because [StealJS] packages view templates with your JS download.
However, some people might not be using StealJS or want to delay loading templates until necessary. If you have the need, you can provide a callback paramter like:
The callback function will be called with the result of the rendered template.
Deferreds
If you pass deferreds to can.view it will wait until all deferreds resolve before rendering the view. This makes it a one-liner to make a request and use the result to render a template.
The following makes a request for todos in parallel with the todos.ejs template. Once todos and template have been loaded, it with render the view with the todos.


Address
Dhaka Bangladesh
East Rajabazar, Firmgate
<EMAIL_ADDRESS>Call Me
+880-1850014536
If you have any suggestion, project or even you want to say Hello.. please fill out the form below and I will reply you shortly.
Information
I'm a Angular Developer and A Java Developer. I've 2 years of experience in front and back both end. I'm Interested in full stack js development. I enjoy coding and make it sensible and appreciate understanding any bug. I love to learn new things


The Framework addresses activities related to personal data practices and audit activities. It includes several components that need to be addressed by any company to maintain personal data protection through audit activities. The framework shall guide companies to assure personal data protection by recognizing their existence in the first place and then formulating the required measures including policies, procedures tasks and employee’s competencies
below are some aspects that you need to evelaute to adresse persoanl Data
|
Item |
Impact on Company’s Image |
Current Status |
Recommendations |
|||
|
Company |
1
|
Does the company collect and store personal information? |
High=3
|
Yes= 1 No=0 |
If Yes=1, further activities shall take place If No=0, no need to go further |
The below actions shall be activated |
|
2
|
Does the company obtain consent before collecting personal information? |
High=3 |
Yes= 0 No=1 |
If Yes, proper process and activities shall be applied If No, consent need to be taken. Processes, policies shall facilitate the process. |
The company shall develop a consent to obtain permission to collect data. The consent shall include how to withdraw their approval and how to remove old data. |
|
|
3
|
Dose the company uses personal information? |
Low=1
|
Yes= 1 No=0 |
If Yes, further activities shall take place If No, the company need to reconsider the need for collecting the data |
The below actions shall be activated if the company uses the data. otherwise they need to reconsider the personal data collection. |
|
|
4
|
Are personal data stored in a protected setting? |
High=3
|
Yes=0 No=1 |
If Yes, Define the settings. If No, Measures need to be taken that include information systems, policies, procedures, task design and employees |
Measures shall include IT systems availability, encryption, firewall, access and privileges, tasks design shall include the store of data before processing and after. Policy shall state the specification of the needed settings to assure data protection. Process shall state activities that assures data protection including access control, passwords, audit logs and traffic monitoring. Employee’s prospect of personal data protection shall be addressed through awareness and training. |
|
|
5
|
Is their restriction to access personal data? |
High=3
|
Yes=0 No=1 |
If Yes, define the restrictions and align them with policy that assures individuals right of privacy If No, Measures need to be taken that include information systems, policies, procedures, task design and employees |
Measures shall include IT systems accesses and privileges are role based, tasks shall be design in a manner that justifies the personal data usage, policy shall state access rights privileges and durations. Process rights, authorization, audit logs and accountability. Employee’s prospect shall be addressed through rising awareness. |
|
|
6 6 |
Are there any auditing performed on any actions related to personal data? |
High=3
|
Yes=0 No=1 |
If Yes, auditing shall take place on regular bases through documentation, interviews and follow ups If No, Measures need to be taken. It includes information system, employees, and tasks. |
Measures include making sure that information system work as intended. Personal data storage, access and manipulated as expected be investigating the applied controls. It shall assure that all employees are behaving as intended. |
|
|
Task |
7 7 |
Are there any tasks that require personal data to be fulfilled? |
Low=1
|
Yes=0
|
If Yes, Measures need to be taken. It includes information system, employees, /n, policies, and procedures If No, and the company stores personal data then they shall reconsider personal data collection and storage |
Measures shall include task design, access rights, audit logs, polices and procedures concerning those tasks. |
|
8 888 |
Are there any measures that assures anonymity when handling personal data? |
Medium=2
|
Yes=0 No=1 |
If Yes, measures shall be documented and monitored on regular bases by assigned authority If No, Measures need to be taken. It includes policies, procedures, and employees. |
Anonymity shall be maintained through designing policies, procedures, and tasks. As well as employees’ competencies by providing them with training and tools that assures the desired results. Audits on the task and employees shall be performed to assure compliance. |
|
|
9
|
Are there any measures that monitor and audit task related activates? |
High=3
|
Yes=0 No=1 |
If Yes, documentation, interviews and follow up with task handler shall take place. If No, Measures need to be taken that includes employees, tasks, and products |
Logging and monitoring functionality shall take place in order to control employees and system conduct. Documentation, interviews and follow ups shall be hold on regular bases to assure compliance. |
|
|
Process |
10
|
Are there any processes that addressee’s personal data protection? |
High=3
|
Yes=0 No=1 |
If Yes, all processes shall be evaluated on regular bases If No, Measures need to be take. Tasks processes shall be reevaluated to assure that it facilitates data protection activities. |
Processes shall specifies personal data protection through information system, tasks, employees access rights and privileges. As well as physical and network access. |
|
11
|
Are there any processes that addressee’s personal data anonymity? |
High=3
|
Yes=0 No=1 |
If Yes, auditing to assure compliance If No, Measures need to be taken on employees, tasks, and information system. |
All processes shall state that individual anonymity is priority when involved in any task or functionality. Individuals who handle the task shall be responsible. In formation System shall have specific controls that govern access rights and privileges. |
|
|
12
|
Are there any processes that addressee’s personal data collection? |
High=3
|
Yes=0 No=1 |
If Yes, the processes shall be communicated to employees and evaluated regular bases. If No, Measures need to be taken on employees’ level, tasks design, and information system. |
Measures includes creating a process that addresses the data collection mechanism on the task, information system and employees conduct. It shall be properly communicated, documented and audited. |
|
|
13
|
Are there any processes that addressee’s personal data access rights? |
High=3
|
Yes=0 No=1 |
If Yes, the process shall be communicated to employees and continually monitored and evaluated. If No, Measures need to be taken on employees’ level, tasks design, and information system. |
Measures including access right and privileges shall be developed to govern access rights. the process shall be communicated to employees and continually monitored, documented and audited.. |
|
|
14
|
Are there any processes that addressee’s personal data removal? |
High=3
|
Yes=0 No=1 |
If Yes, the process shall be communicated to employees and continually monitored and evaluated. If No, Measures need to be taken on employees’ level, tasks design, and information system. |
Measures for data removal shall be developed to govern access rights, task design, and employees’ conduct. the process shall be communicated to employees and continually monitored and evaluated. |
|
|
Employees |
15
|
Are employees aware of the sensitivity of personal data? |
Medium=2 |
Yes=0 No=1 |
If Yes, continues awareness campaigns shall be conducted to assure proper practices. If No, employees shall participate in trainings sessions. And be aware of processes policies that address personal data. |
Campaigns, awareness activities and workshops shall be held to assure that employees have the proper knowledge where they can handle personal data. they shall be aware of the policies, process that govern personal data within the company. |
|
16 16 |
Do employees have justification when accessing personal data? |
High=3 |
Yes=0 No=1 |
If Yes, employees conduct shall be tracked, monitored, documented and evaluated to assure proper conduct If No, Measures need to be taken on employees’ level, tasks design, and information system. |
Justification for a task shall be documented in order to be tracked, monitored audited and evaluated Accessing personal data shall be justified through task design, information system access right and privileges. |
|
|
17 17
|
Do employees have proper training to process personal data while maintaining anonymity? |
Medium=2
|
Yes=0 No=1
|
If Yes, employees conduct shall be tracked, monitored, documented and evaluated to assure proper conduct If No, employees shall have proper training and awareness in regard to the personal data. |
Training sessions and workshops shall take place on regular bases to assure that employees have the required knowledge and competences that support anonymity activities. |
|
|
18 18 |
Dose employees hold accountable to any task related activities? |
High=3 |
Yes=0 No=1 |
If Yes, employees conduct shall be tracked, monitored, documented and evaluated to assure proper conduct If No, employees shall be accountable for their activities. |
Accountability shall be activated through tracking, monitoring, documentation, and evaluation to assure proper conduct. It shall include tasks and information systems as well as processes and polices. |
|
|
Information Technology |
19
|
Are there any controls applied on the physical access and privileges |
High=3
|
Yes=0 No=1 |
If Yes, all activities shall be properly monitored, tracked, and documented on regular bases If No, Measures need to be taken concerning employees, tasks and information system shall follow specification that control physical access. |
Access rights and privileges controls shall be developed and applied. All activities shall be tracked, monitored, documented and verified on regular bases. |
|
20
|
Are there any controls applied on the applications and systems access and privileges |
High=3
|
Yes=0 No=1 |
If Yes, all activities shall be properly monitored, tracked, and documented on regular bases If No, Measures shall include activating controls on all system levels, develop policies and processes. |
Access rights and privileges controls shall be developed and applied. Policies, procedures and task All activities shall be tracked, monitored, documented and verified on regular bases.
|
|
|
21
|
Are applications have controls over data input |
High=3
|
Yes=0 No=1 |
If Yes, all activities shall be properly monitored, tracked, and documented on regular bases If No, Measures need to be taken |
Data entry, edit, change and removal controls shall be developed and applied. Then all activities shall be tracked, monitored, documented and verified on regular bases. |
|
|
22
|
Are there any controls applied on the Network access and privileges |
High=3
|
Yes=0 No=1 |
If Yes, all activities shall be properly monitored, tracked, and documented on regular bases If No, Measures need to be taken |
Access rights and privileges controls shall be developed and applied. Then all activities shall be tracked, monitored, documented and verified on regular bases. |
Powered by w3.css


CLERKS A film review by James Berardinelli Copyright 1994 James Berardinelli
Rating (0 to 10): 8.2
Date Released: 10/14/94 (NY); 11/4/94 (wide) Running Length: 1:37 Rated: R (Graphic language, mature themes)
Starring: Brian O'Halloran, Jeff Anderson, Marilyn Ghigliotti, Lisa Spoonhauer, Jason Mewes, Kevin Smith Director: Kevin Smith Producers: Kevin Smith and Scott Mosier Screenplay: Kevin Smith Cinematography: David Klein Music: Scott Angley Released by Miramax Films
1994 has boasted a number of innovative and humorous films: FOUR WEDDINGS AND A FUNERAL, EAT DRINK MAN WOMAN, CIAO PROFESSORE!, THE HUDSUCKER PROXY, MY LIFE'S IN TURNAROUND, FEAR OF A BLACK HAT, THE ADVENTURES OF PRISCILLA QUEEN OF THE DESERT and SPANKING THE MONKEY. Funnier than all these, and surely the current front-runner for comedy of the year, is Kevin Smith's CLERKS, the hilariously R-rated debut about life behind the counter at a Central Jersey convenience store.
Smith, who filmed his low-budget black-and-white feature at the Quick Stop shop where he worked, set out to make a film with "no meaning whatsoever--just a lot of [four-letter word] jokes." Despite his original intention, however, the director slipped, and a theme about the ennui of today's youth wormed its way in, giving CLERKS a slight dramatic underpinning to its often-uproarious vignettes.
The comedy is raw and ribald, varying from somewhat off-color to truly tasteless. Nothing, no matter how outrageous, is beyond Smith, and his willingness to flaunt cinematic taboos is one of the reasons why CLERKS is such a unqualified success. Where else can you find an explicit discussion of certain sexual practices immediately preceding an argument over a unique interpretation of the ending of RETURN OF THE JEDI?
The dialogue of CLERKS has accurately captured the street language common in the part of the country where the movie was filmed. There are a few lines that come across as scripted, but this is often the result of the manner in which they're delivered (the actors are good, but not seasoned). As far as the level of profanity is concerned, anyone spending time on a Monmouth County (New Jersey) street won't be shocked, but those who are offended by such language should beware. But for a successful appeal to the MPAA, the movie would have been released with an NC-17 rating. The obscenity count tops that of PULP FICTION--not something easy to do, especially considering that CLERKS is an hour shorter.
By Smith's own admission, there isn't much of a plot--just a loose framework to hold together a series of scenes featuring odd personalities in bizarre situations. The main characters are Dante (Brian O'Halloran), a Quick Stop clerk who does his best to cater to his customers, and Randal (Jeff Anderson), the man behind the counter at a local video store who spends his time insulting and offending every potential renter. Also wandering in and out of the story are a local drug-dealer, Jay (Jason Mewes), and his sidekick, Silent Bob (Kevin Smith), as well as Dante's current girlfriend, Veronica (Marilyn Ghigliotti), and his ex, Caitlin (Lisa Spoonhauer).
Given more money, the director would have preferred a 35 mm color shoot rather than a blowup of a 16 mm black-and-white print, but the grainy, occasionally-"homemade" quality of the movie lends CLERKS a pseudo-documentary look that a more polished product would not have achieved. It's hard to imagine the picture working as effectively with a different style--some of the strange goings-on might then seem staged rather than natural.
It's rare for a motion picture to maintain the level of irreverence and humor of CLERKS for its full running length. In his first outing behind the camera, Kevin Smith has given his audience the kind of film at which veteran film makers often fail. As the final credits roll with the promise that "Jay and Silent Bob will return in DOGMA", we can be thankful that this isn't the last we'll see of Smith or his cast of offbeat characters.
- James Berardinelli<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


November 2015 Archives by date
Starting: Sun Nov 1 00:52:38 EDT 2015
Ending: Mon Nov 30 18:54:39 EST 2015
Messages: 116
- [Discuss] Anaconda.org SWC organization
Dirk Eddelbuettel
- [Discuss] Anaconda.org SWC organization
C. Titus Brown
- [Discuss] Native (Docker) containers outside of Linux (was: Anaconda.org SWC organization)
W. Trevor King
- [Discuss] Native (Docker) containers outside of Linux (was: Anaconda.org SWC organization)
Carl Boettiger
- [Discuss] Paper certificates
Anelda van der Walt
- [Discuss] Paper certificates
Maxime Boissonneault
- [Discuss] SWC VMs and IPython Notebook and Jupyter
Aleksandra Pawlik
- [Discuss] Job opportunities at the University of Leeds
Andrew Walker [EAR]
- [Discuss] Big Data Cluster Hire at University of Rhode Island
Hollister, Jeff
- [Discuss] November Lab Meeting 11/10
Jonah Duckles
- [Discuss] November Lab Meeting 11/10
Jonah Duckles
- [Discuss] Shell scripts Challenge Question
Sarah Stevens
- [Discuss] Recording bash script to a github webpage, live
Maxime Boissonneault
- [Discuss] Manchester Retreat site
Aleksandra Pawlik
- [Discuss] Helpers for a workshop in NYU this week
Ivan Gonzalez
- [Discuss] setup instructions for the bash shell
Karin Lagesen
- [Discuss] setup instructions for the bash shell
Michael Sarahan
- [Discuss] setup instructions for the bash shell
Michael Sarahan
- [Discuss] setup instructions for the bash shell
Ethan White
- [Discuss] setup instructions for the bash shell
Karin Lagesen
- [Discuss] setup instructions for the bash shell
Raniere Silva
- [Discuss] Instructor Training - December - Update
Raniere Silva
- [Discuss] [Jobs] Data at Clover Health
Matt Davis
- [Discuss] Recording bash script to a github webpage, live
Thomas Guignard
- [Discuss] Recording bash script to a github webpage, live
Laurent Duchesne
- [Discuss] Lab meeting starting in 5 minutes
Jonah Duckles
- [Discuss] Instructor Training - December - Update
Raniere Silva
- [Discuss] setup instructions for the bash shell
Karin Lagesen
- [Discuss] Instructor Training - December - Update
Raniere Silva
- [Discuss] bash: nano: command not found - Windows
Karin Lagesen
- [Discuss] bash: nano: command not found - Windows
Ethan White
- [Discuss] bash: nano: command not found - Windows
Karin Lagesen
- [Discuss] bash: nano: command not found - Windows
Karin Lagesen
- [Discuss] bash: nano: command not found - Windows
Cameron Macdonell
- [Discuss] SWC & DC instructors - we want to know what you're up to
Maneesha Sane
- [Discuss] Instructor & Helper Retreat
Daniel Chen
- [Discuss] Instructor & Helper Retreat
Tiffany Timbers
- [Discuss] Data Carpentry instructor certification
Tracy Teal
- [Discuss] Make lesson depends on Python 2?
Tiffany Timbers
- [Discuss] Make lesson depends on Python 2?
W. Trevor King
- [Discuss] Make lesson depends on Python 2?
Tiffany Timbers
- [Discuss] Make lesson depends on Python 2?
Tiffany Timbers
- [Discuss] Make lesson depends on Python 2?
W. Trevor King
- [Discuss] Make lesson depends on Python 2?
Michael J Jackson
- [Discuss] Instructor & Helper Retreat "Interactive learning" session: preparations
Lex Nederbragt
- [Discuss] 1st ever Software + Data Carpentry Instructor & Helper Retreat!
Tiffany Timbers
- [Discuss] Multiple employment opportunities at the University of Michigan, Ann Arbor
Bennet Fauber
- [Discuss] best way to install make on Windows?
Tiffany Timbers
- [Discuss] best way to install make on Windows?
Leighton Pritchard
- [Discuss] best way to install make on Windows?
W. Trevor King
- [Discuss] best way to install make on Windows?
Aleksandra Pawlik
- [Discuss] best way to install make on Windows?
W. Trevor King
- [Discuss] best way to install make on Windows?
W. Trevor King
- [Discuss] feedback wanted on "good enough" practices
Greg Wilson
- [Discuss] feedback wanted on "good enough" practices
Maxime Boissonneault
- [Discuss] feedback wanted on "good enough" practices
Steve Haddock
- [Discuss] best way to install make on Windows?
April Wright
- [Discuss] feedback wanted on "good enough" practices
Martin Bähr
- [Discuss] feedback wanted on "good enough" practices
Maxime Boissonneault
- [Discuss] feedback wanted on "good enough" practices
Karin Lagesen
- [Discuss] feedback wanted on "good enough" practices
Shreyas Cholia
- [Discuss] feedback wanted on "good enough" practices
Bennet Fauber
- [Discuss] feedback wanted on "good enough" practices
Greg Wilson
- [Discuss] feedback wanted on "good enough" practices
Maxime Boissonneault
- [Discuss] Recording bash script to a github webpage, live
Maxime Boissonneault
- [Discuss] Recording bash script to a github webpage, live
Maxime Boissonneault
- [Discuss] Recording bash script to a github webpage, live
Leighton Pritchard
- [Discuss] [Jobs] NMSU games / app programmer
Karen Cranston
- [Discuss] Discuss Digest, Vol 28, Issue 24
Matthew Wakefield
- [Discuss] Thank-you for participating and Feedback on the Retreat
Tiffany Timbers
- [Discuss] Code review for MSc students
Lex Nederbragt
- [Discuss] Code review for MSc students
Ben Waugh
- [Discuss] advertisement texts, etc
Karin Lagesen
- [Discuss] advertisement texts, etc
Jonah Duckles
- [Discuss] Code review for MSc students
Greg Wilson
- [Discuss] best way to install make on Windows?
Ethan White
- [Discuss] Code review for MSc students
Ariel Rokem
- [Discuss] Code review for MSc students
Jonathan Strootman
- [Discuss] Fwd: [py4science] [JOB] Project Jupyter is hiring two postdoctoral fellows @ UC Berkeley
Katy Huff
- [Discuss] Code review for MSc students
Azalee Bostroem
- [Discuss] Code review for MSc students
Greg Wilson
- [Discuss] Code review for MSc students
Patrick Schloss
- [Discuss] Thank-you for participating and Feedback on the Retreat
Marianne Corvellec
- [Discuss] Thank-you for participating and Feedback on the Retreat
Tiffany Timbers
- [Discuss] last thoughts on shell-novice rewrites
Christina Koch
- [Discuss] last thoughts on shell-novice rewrites
Greg Wilson
- [Discuss] commenting with hypothes.is
Greg Wilson
- [Discuss] Code review for MSc students
Lex Nederbragt
- [Discuss] Show SWC: DataJoy, an online Python & R IDE
James Allen
- [Discuss] commenting with hypothes.is
Steven Haddock
- [Discuss] commenting with hypothes.is
C. Titus Brown
- [Discuss] best way to install make on Windows?
Ethan White
- [Discuss] New Windows Installer Release
Ethan White
- [Discuss] New Windows Installer Release
Alexander Konovalov
- [Discuss] New Windows Installer Release
Ethan White
- [Discuss] New Windows Installer Release
Alexander Konovalov
- [Discuss] [discuss] I streamed and recorded Git lesson
Daniel Chen
- [Discuss] Suggestion for Software Carpentry Lesson: WebAPIs with Python, Requests and cURL
Andrew Francis
- [Discuss] Suggestion for Software Carpentry Lesson: WebAPIs with Python, Requests and cURL
Naupaka Bruce Zimmerman
- [Discuss] Suggestion for Software Carpentry Lesson: WebAPIs with Python, Requests and cURL
Cam Macdonell
- [Discuss] Suggestion for Software Carpentry Lesson: WebAPIs with Python, Requests and cURL
Collins, Matthew
- [Discuss] What can a technologist do about climate change?
Greg Wilson
- [Discuss] What can a technologist do about climate change?
Greg Wilson
- [Discuss] Suggestion for Software Carpentry Lesson: WebAPIs with Python, Requests and cURL
Andrew Francis
- [Discuss] What can a technologist do about climate change?
Erik Bray
- [Discuss] [discuss] I streamed and recorded Git lesson
Greg Wilson
- [Discuss] The impact of syntax colouring on program comprehension [pdf]
Aaron O'Leary
- [Discuss] New lesson "Programming with GAP"
Alexander Konovalov
- [Discuss] tips on keeping workshop webpage up to date?
Karin Lagesen
- [Discuss] tips on keeping workshop webpage up to date?
Raniere Silva
- [Discuss] tips on keeping workshop webpage up to date?
Karin Lagesen
- [Discuss] tips on keeping workshop webpage up to date?
Raniere Silva
- [Discuss] [discuss] I streamed and recorded Git lesson
Daniel Chen
- [Discuss] JOB - Research Community Manager - New Zealand eScience Infrastructure
Jonah Duckles
- [Discuss] Data Carpentry is hiring an Associate Director
Tracy Teal
- [Discuss] tips on keeping workshop webpage up to date?
W. Trevor King
Last message date:
Mon Nov 30 18:54:39 EST 2015
Archived on: Mon Nov 30 18:57:25 EST 2015
This archive was generated by
Pipermail 0.09 (Mailman edition).


Point object is used for creating Rectangle.
More...
#include <point.hpp>
Point object is used for creating Rectangle.
◆ Point()
Constructor accepting x and y coordinates.
- Parameters
-
| [in] | x | x coordinate of point |
| [in] | y | y coordinate of point |
◆ operator!=()
| bool Point::operator!= |
( |
const Point & |
P | ) |
const |
|
inline |
Compares two Point objects.
- Returns
- true if points are different, else false
◆ operator<()
| bool Point::operator< |
( |
const Point & |
P | ) |
const |
|
inline |
Function to order the Point objects. Priority for ordering - x > y.
- Returns
- true if first point < second point, else false
◆ operator==()
| bool Point::operator== |
( |
const Point & |
P | ) |
const |
|
inline |
Compares two Point objects.
- Returns
- true if points are same, else false
The documentation for this class was generated from the following file:


Kabu
CSS and styling
Animation
Writing Copy
Brand assets
Tutorials
Templates
Getting started
CSS and styling
Grid system
Typography
Colors
Tables
Forms
Buttons
Navigation
Components
Icons
Mobile
Helper classes
Animation
Writing Copy
Brand assets
Tutorials
Single column list
Section groups
Off-canvas layout
Email validation w/ Mailgun
Templates
Scaffold
Modal tabs
Lorem ipsum
Single column list
Section groups
Off-canvas layout
Email validation w/ Mailgun
Coming soon...
Made with
in Norcross by the
UX Team
.


The State Government is planning to let chemists give flu vaccinations to children aged 10 and over
Reeling from a deadly flu season that killed 106 South Australians, the State Government will make children’s vaccinations easier to access.
Currently children have to be at least 16 to skip the doctor and go to a chemist. Health Minister Stephen Wade said lowering that age would increase the proportion of vaccinated children. Flu has killed 106 South Australians this year.
Mr Wade said flu was “very dangerous” and getting more children vaccinated would build up herd immunity in SA.
“We have just experienced a particularly bad flu season and it is important we are proactive in preventing the disease by ensuring as many people are vaccinated as possible,” he said.
SA’s chief public health officer Nicola Spurrier said it would boost the number of immunised children because it would be easier for families to fit the jab into their busy lives.
Doctors have previously voiced concerns about pharmacists’ ability to deal with any adverse reactions, but Associate Professor Spurrier, pictured, said many people who were not doctors were already trained to give vaccinations.
“The important thing is that the person giving the vaccine is trained to look for any side effects and to be in a position to offer care if any of those things happen,” she said.
The Vaccine and Preventable Diseases Advisory Group will consider a range of issues, including parental consent, and report back to the State Government on making the change to regulations.
Winston Martin, of Glenelg South, said it would be “a lot more convenient” to take daughter Annabelle, 11, to the pharmacy than a GP.


Titanium UI test app
small screen
Delegate:
x:
y:
Menus:
| |
(should override app menu)
|
(should revert to app menu)
|
(no more menus)
|
|
|
|
|
|
Context Menus:
| |
(should override app menu)
|
(should revert to app menu)
|
(no more menus)
|
Dock Menus:
|
|
|
Icons:
| |
(should override app icon)
|
(should revert to app menu)
|
(no more icons)
|
Tray Icon:


How do the children learn through play?
We emphasize play and exploration as the primary methods of learning and development. The children are empowered through authentic, collaborative classroom practices. Mathematics and language activities are woven into the various learning areas so that children have the opportunity to explore and develop skills in natural ways.See our Registration Page for all the details
2. What are the differences between MVPNS and other parent participation schools in the area?
1. MVPNS is the only NAEYC accredited co-operative nursery school in Mountain View.
2. Our curriculum is built by the teachers, while taking the children's specific interests into consideration.
3. The MVPNS Director (and teacher of the 3's program) is on faculty at Foothill College's Child Development Program.
4. The teachers for our M/T/W/TH afternoon program published a book inspired by the MVPNS curriculum, which won the national 2011 Teacher's Choice Award from Learning Magazine.
MVPNS is a developmental and play-based program where both children and parents receive a great foundation for the child’s future success in the academic environment.
There are numerous social events throughout the year such as picnics, outdoor movies, ice skating, and more. There is a Parent-Child Project, which gives the child and parent who does not attend weekday classes a chance to work together on a project.
5. I am apprehensive about working in the classroom. What will I be asked to do?At our school, the curriculum is well thought out in advance by the teachers and all projects are well organized. Each parent is given an “area” such as bikes/swings, sandbox, project, snack. Instructions for the area are spelled out clearly on work cards, and the teachers give full and clear instructions about how the parent is to facilitate the project experience for the child. Our orientation sessions are very helpful in finding out more about this. In short, parents are not expected to be teachers, but are expected to be positive and respectful toward the children, asking open-ended questions and allowing the children to find their own answers through discovery.
6.  If you know in advance that you will not be able to attend, you are expected to try to find a substitute via email or phone calls. You can always switch days with each other.
7. What time should I arrive on my work day?
You will need to arrive 15 minutes before the regular start of class. This is vital to the smooth and safe running of the classes because:
1. There are tasks that need to be done before the children arrive.
2. Project parents will need to be briefed by the teacher on the projects of the day.
3. The teacher needs to be able to greet the children at start time, instead of talking to the work parents.
4. The Emergency (extra/fill in) parent will only be able to leave when all work parents are there, so it’s important not to keep them at school unduly long.
 Our teachers are adept at minimizing the anxiety that a child feels when at school without their parent. Each situation is considered and handled individually.
9. My child has food allergies. Is this a problem?MVPNS has had many children with a variety of food allergies.  No nuts of any kind are allowed on campus at all. At the start of each school year, we all discuss any food allergies in the classes, and the severity of the children’s reactions. Any foods that are deemed dangerous to a child are not used during that child’s class. Any foods that cause life-threatening reactions are kept out of all classes in order to ensure a safe environment. Some classes will have few or no allergies at all, and other classes will have a long list of foods that children are allergic to. The teachers work with parents to work out a policy to fits the needs of the children.
10. My spouse and I both work full time. Can our family participate in the program?Absolutely. We have families whose parents can participate in the work days themselves, and other families which have a caregiver or extended family member who can consistently attend school with the child. We will work with you to find a solution that fits your family.
11. I just had a baby – can I bring the baby with me on work days?Babies are welcome up until the age of six months, at which point they get very active and you will need to find an appropriate childcare situation. Often, parents with younger siblings will watch each other’s children on work days.
12. Do you have an automatic payment system for tuition?We currently accept online banking checks which can be mailed to our P.O. Box.
13. I have twins – how many work days and committee responsibilities will we have?With regards to work day requirements, a family with multiples in the 3's class will be assigned approximately 4 - 6 work days per month. Families with multiples in the 4's or 4/5's class will work approximately 6 - 8 days per month.
Job responsibilities are per family, not child, so each family is only assigned one committee job or board position, such as membership team, class photographer, laundry, president, etc.
Since all the operations functions of the school are performed by the parents, we have a huge variety of jobs for families to choose from. You can choose a job that makes use of your unique talents and fits your families schedule. Some examples include laundry, playdough, curriculum support, technical infrastructure support, event organization and promotion, beautification, etc.
15. How much of a commitment is it to be on the Board of Directors?We have monthly meetings which usually last one hour. Each board member is responsible for an area of operation. Some are more time intensive than others. They range from Adult Education Speaker Bookings to School Auction organization, Treasurer, Secretary, Beautification, and Co-President. In exchange for your service, we waive the six hours of beautification work required of all families. Often, the board committee responsibilities can be shared by co-chairs.
The school sounds great, but we have limited financial resources right now. Can you help?If you are interested in joining our community of families and the financial commitment is stopping you, then please contact Membership or our Director to confidentially discuss tuition assistance.
Have more questions? Please contact us at info@mvpns.org.


Boolean variable implementation.
|
Domain status access |
| static const int | BITS = 2 |
| | How many bits does the status have.
|
| static const BoolStatus | ZERO = 0 |
| | Status of domain assigned to zero.
|
| static const BoolStatus | ONE = 3 |
| | Status of domain assigned to one.
|
| static const BoolStatus | NONE = 2 |
| | Status of domain not yet assigned.
|
| BoolStatus | status (void) const |
| | Return current domain status.
|
Value access |
| int | min (void) const |
| | Return minimum of domain.
|
| int | max (void) const |
| | Return maximum of domain.
|
| int | val (void) const |
| | Return assigned value (only if assigned).
|
| int | med (void) const |
| | Return median of domain.
|
| unsigned int | size (void) const |
| | Return size (cardinality) of domain.
|
| unsigned int | width (void) const |
| | Return width of domain (distance between maximum and minimum).
|
| unsigned int | regret_min (void) const |
| | Return regret of domain minimum (distance to next larger value).
|
| unsigned int | regret_max (void) const |
| | Return regret of domain maximum (distance to next smaller value).
|
Boolean domain tests |
| bool | zero (void) const |
| | Test whether variable is assigned to zero.
|
| bool | one (void) const |
| | Test whether variable is assigned to one.
|
| bool | none (void) const |
| | Test whether variable is not yet assigned.
|
Domain tests |
| bool | range (void) const |
| | Test whether domain is a range.
|
| bool | assigned (void) const |
| | Test whether variable is assigned.
|
| bool | in (int n) const |
| | Test whether n is contained in domain.
|
| bool | in (double n) const |
| | Test whether n is contained in domain.
|
Domain update by value |
| ModEvent | lq (Space *home, int n) |
| | Restrict domain values to be less or equal than n.
|
| ModEvent | lq (Space *home, double n) |
| | Restrict domain values to be less or equal than n.
|
| ModEvent | gq (Space *home, int n) |
| | Restrict domain values to be greater or equal than n.
|
| ModEvent | gq (Space *home, double n) |
| | Restrict domain values to be greater or equal than n.
|
| ModEvent | nq (Space *home, int n) |
| | Restrict domain values to be different from n.
|
| ModEvent | nq (Space *home, double n) |
| | Restrict domain values to be different from n.
|
| ModEvent | eq (Space *home, int n) |
| | Restrict domain values to be equal to n.
|
| ModEvent | eq (Space *home, double n) |
| | Restrict domain values to be equal to n.
|
Domain update by iterator |
| Variable domains can be both updated by range and value iterators. Value iterators do not need to be strict in that the same value is allowed to occur more than once in the iterated sequence.
The argument depends must be true, if the iterator passed as argument depends on the variable implementation on which the operation is invoked. In this case, the variable implementation is only updated after the iterator has been consumed. Otherwise, the domain might be updated concurrently while following the iterator.
|
| template<class I> |
| ModEvent | narrow_r (Space *home, I &i, bool depends=true) |
| | Replace domain by ranges described by i.
|
| template<class I> |
| ModEvent | inter_r (Space *home, I &i, bool depends=true) |
| | Intersect domain with ranges described by i.
|
| template<class I> |
| ModEvent | minus_r (Space *home, I &i, bool depends=true) |
| | Remove from domain the ranges described by i.
|
| template<class I> |
| ModEvent | narrow_v (Space *home, I &i, bool depends=true) |
| | Replace domain by values described by i.
|
| template<class I> |
| ModEvent | inter_v (Space *home, I &i, bool depends=true) |
| | Intersect domain with values described by i.
|
| template<class I> |
| ModEvent | minus_v (Space *home, I &i, bool depends=true) |
| | Remove from domain the values described by i.
|
Boolean update operations |
| ModEvent | zero (Space *home) |
| | Assign variable to zero.
|
| ModEvent | one (Space *home) |
| | Assign variable to one.
|
| ModEvent | zero_none (Space *home) |
| | Assign unassigned variable to zero.
|
| ModEvent | one_none (Space *home) |
| | Assign unassigned variable to one.
|
Dependencies |
| void | subscribe (Space *home, Propagator *p, PropCond pc, bool process=true) |
| | Subscribe propagator p to variable with propagation condition pc.
|
| void | cancel (Space *home, Propagator *p, PropCond pc) |
| | Cancel subscription of propagator p with propagation condition pc.
|
| void | subscribe (Space *home, Advisor *a) |
| | Subscribe advisor a to variable.
|
| void | cancel (Space *home, Advisor *a) |
| | Cancel subscription of advisor a.
|
Support for delta information for advisors |
| int | min (const Delta *d) const |
| | Return minimum value just pruned.
|
| int | max (const Delta *d) const |
| | Return maximum value just pruned.
|
| bool | any (const Delta *d) const |
| | Test whether arbitrary values got pruned.
|
| static ModEvent | modevent (const Delta *d) |
| | Return modification event.
|
Cloning |
| BoolVarImp * | copy (Space *home, bool share) |
| | Return copy of this variable.
|
Reflection |
| Reflection::Arg * | spec (const Space *home, Reflection::VarMap &m) const |
| | Return specification.
|
| static VarImpBase * | create (Space *home, Reflection::VarSpec &spec) |
| | Create variable implementation from specification.
|
| static void | constrain (Space *home, VarImpBase *v, Reflection::VarSpec &spec) |
| | Constrain variable implementation using specification.
|
Variable implementation-dependent propagator support |
| static void | schedule (Space *home, Propagator *p, ModEvent me) |
| | Schedule propagator p with modification event me.
|
| static ModEventDelta | med (ModEvent me) |
| | Translate modification event me to modification event delta for view.
|
Public Member Functions |
| | BoolVarImp (Space *home, int min, int max) |
| | Initialize with range domain.
|


| Interface | Description |
|---|---|
| NamedItem |
Created by Fred on 2016/2/29.
|
| UniqueItem<T> |
Created by xuefei1 on 3/8/16.
|
| Class | Description |
|---|---|
| Bid |
Bid is used to return the bid amount, bidder, bid time made from User on a Textbook . |
| BidList |
BidList used to keep a list of bids which are associated with a Textbook . |
| BookShelf |
BookShelf used to keep a list of Textbook s and aide in the manipulation of textbooks. |
| DataHelper |
DataHelper is used to upload and download information to/from Elastic Search. |
| DataHelper.AddTextbookTask |
Add a
Textbook (s) to the ElasticSearch server. |
| DataHelper.AddUserTask |
Adds
User (s) to the ElasticSearch server |
| DataHelper.DeleteTextbookTask |
Delete
Textbook (s) from the ElasticSearch server. |
| DataHelper.GetAllTextbookTask |
Get all
Textbook (s) from the ElasticSearch server. |
| DataHelper.GetBiddedTextbookByBidderTask |
Get bidded
Textbook (s) by a specific bidder from the ElasticSearch server. |
| DataHelper.GetTextbookByBorrowerTask |
Get
Textbook (s) currently borrowed from by a specific User from the ElasticSearch server. |
| DataHelper.GetTextbookTask |
Get
Textbook (s) from the ElasticSearch server. |
| DataHelper.GetUserTask |
Get
User (s) from the ElasticSearch server. |
| DataHelper.SearchTextbookTask |
Search for
Textbook (s) from the ElasticSearch server. |
| DataHelper.TestServerConnectionTask |
This class is used mainly to test server connectivity
|
| DataHelper.UpdateTextbookTask |
Update the
Textbook (s) information on ElasticSearch from local memory. |
| DataHelper.UpdateUserTask |
Update the information of the current
User on the ElasticSearch server. |
| OfflineCommandList |
OfflineCommandList is used to handle offline behaviour. |
| OfflineHelper |
OfflineHelper is used to save offline changes to local memory |
| OfflineNewTextbookCommand |
OfflineNewTextbookCommand is used to send commands from OfflineHelper to DataHelper |
| Textbook |
Textbook is the item user own or borrowed. |
| Textbook.Builder |
The builder is used to build a
Textbook |
| User |
User is the user of the application, and contains lists of Textbook . |
| Enum | Description |
|---|---|
| BookStatus |
Created by xuefei1 on 3/8/16.
|
| ViewStatus |
ViewStatus |
| Exception | Description |
|---|---|
| ElasticSearchQueryException |
Created by Fred on 2016/3/13.
|


GOD'S FAVORITE
October 9-12, 1986
LLT returns to the Arabian Theatre after repairs completed
from Hurrican Juan's Fall 1985 landfall
Director - Dwight Pitts
THE CAST
Joe Benjamin - Connie Farrell
Ben Benjamin - Dean Bellais
Sarah Benjamin - Diana Walker
Rose Benjamin - Patty Howard
David Benjamin - Paul Reynolds
Mady - Kelli Thompkins
Morris - Gene Hudson
Sidney Lipton - John Bisnette


The library has been tested using Agda version 2.6.1.
Highlights
-
Monoid and ring tactics that are capable of solving equalities without having to restate the equation.
-
Binary and rose trees.
-
Warnings when importing deprecated modules.
Bug-fixes
-
In
Data.Fin.Subset.Properties
the incorrectly named proofp⊆q⇒∣p∣<∣q∣ : p ⊆ q → ∣ p ∣ ≤ ∣ q ∣
has been renamed top⊆q⇒∣p∣≤∣q∣
. -
In
Data.Nat.Properties
the incorrectly named proofs∀[m≤n⇒m≢o]⇒o<n : (∀ {m} → m ≤ n → m ≢ o) → n < o
and∀[m<n⇒m≢o]⇒o≤n : (∀ {m} → m < n → m ≢ o) → n ≤ o
have been renamed to∀[m≤n⇒m≢o]⇒n<o
and∀[m<n⇒m≢o]⇒n≤o
respectively. -
Fixed the definition of
_⊓_
forCodata.Conat
; it was mistakenly using_⊔_
in a recursive call. -
Fixed the type of
max≈v⁺
inData.List.Extrema
; it was mistakenly talking aboutmin
rather thanmax
. -
The module
⊆-Reasoning
inData.List.Relation.Binary.BagAndSetEquality
now exports the correct set of combinators. -
The record
DecStrictPartialOrder
now correctly re-exports the contents of itsIsDecStrictPartialOrder
field.
Non-backwards compatible changes
Changes to how equational reasoning is implemented
-
NOTE: Uses of equational reasoning remains unchanged. These changes should only affect users who are renaming/hiding the library’s equational reasoning combinators.
- Previously all equational reasoning combinators (e.g.
_≈⟨_⟩_
,_≡⟨_⟩_
,_≤⟨_⟩_
) were defined in the following style:infixr 2 _≡⟨_⟩_ _≡⟨_⟩_ : ∀ x {y z : A} → x ≡ y → y ≡ z → x ≡ z _ ≡⟨ x≡y ⟩ y≡z = trans x≡y y≡z
The type checker therefore infers the RHS of the equational step from the LHS + the type of the proof. For example for
x ≈⟨ x≈y ⟩ y ∎
it is inferred thaty ∎
must have typey IsRelatedTo y
fromx : A
andx≈y : x ≈ y
. -
There are two problems with this. Firstly, it means that the reasoning combinators are not compatible with macros (i.e. tactics) that attempt to automatically generate proofs for
x≈y
. This is because the reflection machinary does not have access to the type of RHS as it cannot be inferred. In practice this meant that the new reflective solversTactic.RingSolver
andTactic.MonoidSolver
could not be used inside the equational reasoning. Secondly the inference procedure itself is slower as described in this exchange on the Agda mailing list. - Therefore, as suggested on the mailing list, the order of arguments to the combinators
have been reversed so that instead the type of the proof is inferred from the LHS + RHS.
infixr -2 step-≡ step-≡ : ∀ x {y z : A} → y ≡ z → x ≡ y → x ≡ z step-≡ y≡z x≡y = trans x≡y y≡z syntax step-≡ x y≡z x≡y = x ≡⟨ x≡y ⟩ y≡z
where the
syntax
declaration is then used to recover the original order of the arguments. This change enables the use of macros and anecdotally speeds up type checking by a factor of 5. -
No changes are needed when defining new combinators, as the old and new styles are compatible. Having said that you may want to switch to the new style for the benefits described above.
- Changes required: The only drawback to this change is that hiding and renaming the
combinators no longer works as before, as
_≡⟨_⟩_
etc. are now syntax instead of names. For example instead of:open SetoidReasoning setoid public hiding (_≈⟨_⟩_) renaming (_≡⟨_⟩_ to _↭⟨_⟩_)
one must now write :
private module Base = SetoidReasoning setoid open Base public hiding (step-≈; step-≡) infixr 2 step-↭ step-↭ = Base.step-≡ syntax step-↭ x y≡z x≡y = x ↭⟨ x≡y ⟩ y≡z
This is more verbose than before, but we hope that the advantages outlined above outweigh this minor inconvenience. (As an aside, it is hoped that at some point Agda might provide the ability to rename syntax that automatically generates the above boilerplate).
Changes to the algebra hierarchy
- The following record definitions in
Algebra.Structures
have been changed.IsCommutativeMonoid
IsCommutativeSemiring
IsRing
In each case, the structure now requires fields for all the required properties, rather than just an (arbitrary) minimal set of properties.
-
For example, whereas the old definition of
IsCommutativeMonoid
required the following fields:- Associativity
- Left identity
- Commutativity
the new definition also requires:
- Right identity.
-
Previously, the justification for not including a right identity proof was that, given left identity and commutativity, right identity can be proven. However, omitting the right identity proof caused problems:
- It made the definition longer and more complex, as less code was reused.
- The forgetful map turning a commutative monoid into a monoid was not a
retraction of all maps which augment a monoid with commutativity. To see
that the forgetful map was not a retraction, notice that the augmentation
must have discarded the right identity proof as there was no field for it
in
IsCommutativeMonoid
. - There was no easy way to give only the right identity proof, and have the left identity proof be generically derived.
Point 2, and in particular the fact that it did not hold definitionally, causes problems when indexing over monoids and commutative monoids and requires some compatibility between the two indexings.
- Changes required: We recover the old behaviour by introducing biased
structures, found in
Algebra.Structures.Biased
. In particular, one can convert old instances ofIsCommutativeMonoid
to new instances using theisCommutativeMonoidˡ
function. For example:isCommutativeMonoid = record { isSemigroup = ... ; identityˡ = ... ; comm = ... }
becomes:
open import Algebra.Structures.Biased isCommutativeMonoid = isCommutativeMonoidˡ record { isSemigroup = ... ; identityˡ = ... ; comm = ... }
- For
IsCommutativeSemiring
, we haveisCommutativeSemiringˡ
, and forIsRing
, we haveisRingWithoutAnnihilatingZero
.
Tweak to definition of Permutation.refl
- The definition of
refl
inData.List.Relation.Binary.Permutation.Homogeneous/Setoid
has been changed fromrefl : ∀ {xs} → Permutation R xs xs
to:
refl : ∀ {xs ys} → Pointwise R xs ys → Permutation R xs ys
The old definition did not allow for size preserving transformations of permutations via pointwise equalities and hence made it difficult to prove termination of complicated proofs and functions over permutations.
- Correspondingly the proofs
isEquivalence
andsetoid
inPermutation.Homogeneous
now require that the base relationR
is reflexive.
Improved safety for Word
and Float
-
Decidable equality over floating point numbers has been made safe and so
_≟_
has been moved fromData.Float.Unsafe
toData.Float.Properties
. -
Decidable equality over words has been made safe and so
_≟_
has been moved fromData.Word.Unsafe
toData.Word.Properties
. -
The modules
Data.Word.Unsafe
andData.Float.Unsafe
have been removed as there are no longer any unsafe operations.
Other
- The following lemmas may have breaking changes in their computational
behaviour.
transpose-inverse
inData.Fin.Permutation.Components
decFinSubset
&all?
inData.Fin.Properties
Definitions that are sensitive to the behaviour of these lemmas, rather than just their existence, may need to be revised.
-
The fixity level of
Data.List.Base
’s_∷ʳ_
has been changed from 5 to 6. This means thatx ∷ xs ∷ʳ y
andx ++ xs ∷ʳ y
are not ambiguous anymore: they both are parenthesised to the right (the more efficient variant). -
In
Codata.Cowriter
andCodata.Musical.Colist
the functionssplitAt
,take
andtake-⊑
have been changed to use bounded vectors as defined inData.Vec.Bounded
instead of the deprecatedData.BoundedVec
. The old proofs still exist under the namessplitAt′
,take′
andtake′-⊑
but have been deprecated. - In
Codata.Colist
, uses ofData.BoundedVec
have been replaced with the more up to dateData.Vec.Bounded
.
Deprecated modules
- A warning is now raised whenever you import a deprecated module. This should
aid the transition to the new modules. These warnings can be disabled locally
by adding the pragma
{-# OPTIONS --warn=noUserWarning #-}
to the top of a module.
The following modules have been renamed as part of a drive to improve consistency across the library. The deprecated modules still exist and therefore all existing code should still work, however use of the new names is encouraged.
- In
Algebra
:Algebra.FunctionProperties.Consequences.Core ↦ Algebra.Consequences.Base Algebra.FunctionProperties.Consequences.Propositional ↦ Algebra.Consequences.Propositional Algebra.FunctionProperties.Consequences ↦ Algebra.Conseqeunces.Setoid
- The sub-module
Lexicographic
inData.Induction.WellFounded
has been deprecated, instead the new proofs of well-foundedness inData.Product.Relation.Binary.Lex.Strict
should be used.
Deprecated names
The following deprecations have occurred as part of a drive to improve consistency across the library. The deprecated names still exist and therefore all existing code should still work, however use of the new names is encouraged. Although not anticipated any time soon, they may eventually be removed in some future release of the library. Automated warnings are attached to all deprecated names to discourage their use.
- In
Data.Fin
:fromℕ≤ ↦ fromℕ< fromℕ≤″ ↦ fromℕ<″
- In
Data.Fin.Properties
fromℕ≤-toℕ ↦ fromℕ<-toℕ toℕ-fromℕ≤ ↦ toℕ-fromℕ< fromℕ≤≡fromℕ≤″ ↦ fromℕ<≡fromℕ<″ toℕ-fromℕ≤″ ↦ toℕ-fromℕ<″ isDecEquivalence ↦ ≡-isDecEquivalence preorder ↦ ≡-preorder setoid ↦ ≡-setoid decSetoid ↦ ≡-decSetoid
- In
Data.List.Relation.Unary.All.Properties
:Any¬→¬All ↦ Any¬⇒¬All
- In
Data.Nat.Properties
:∀[m≤n⇒m≢o]⇒o<n ↦ ∀[m≤n⇒m≢o]⇒n<o ∀[m<n⇒m≢o]⇒o≤n ↦ ∀[m<n⇒m≢o]⇒n≤o
- In
Algebra.Morphism.Definitions
andRelation.Binary.Morphism.Definitions
the typeMorphism A B
has been deprecated in favour of the standard function notationA → B
.
New modules
- A hierarchy for algebraic modules:
Algebra.Module Algebra.Module.Bundles Algebra.Module.Consequences Algebra.Module.Construct.Biproduct Algebra.Module.Construct.TensorUnit Algebra.Module.Construct.Zero Algebra.Module.Definitions Algebra.Module.Definitions.Bi Algebra.Module.Definitions.Left Algebra.Module.Definitions.Right Algebra.Module.Structures Algebra.Module.Structures.Biased
Supported are all of {left, right, bi} {semi} modules.
- Morphisms over group and ring-like algebraic structures:
Algebra.Morphism.GroupMonomorphism Algebra.Morphism.RingMonomorphism
- Bisimilarity relation for
Cowriter
.Codata.Cowriter.Bisimilarity
- Wrapper for the erased modality, allows the storage of erased proofs
in a record and the use of projections to manipulate them without having
to turn on the unsafe option
--irrelevant-projections
.Data.Erased
- Induction over finite subsets:
Data.Fin.Subset.Induction
- Unary predicate for lists in which all related elements are grouped together.
Data.List.Relation.Unary.Grouped Data.List.Relation.Unary.Grouped.Properties
- Unary predicate for products in which the components both satisfy individual
unary predicates.
Data.Product.Relation.Unary.All
- New data type for dependent products in which the second component is irrelevant.
Data.Refinement Data.Refinement.Relation.Unary.All
- New data type for binary and rose trees:
Data.Tree.Binary Data.Tree.Binary.Properties Data.Tree.Binary.Relation.Unary.All Data.Tree.Binary.Relation.Unary.All.Properties Data.Tree.Rose Data.Tree.Rose.Properties
- New properties and functions over floats and words.
Data.Float.Base Data.Float.Properties Data.Word.Base Data.Word.Properties
- Helper methods for using reflection with numeric data.
Data.Nat.Reflection Data.Fin.Reflection
- Finer-grained breakdown of the reflection primitives, alongside
new utility functions for writing macros.
Reflection.Abstraction Reflection.Argument Reflection.Argument.Information Reflection.Argument.Relevance Reflection.Argument.Visibility Reflection.Definition Reflection.Literal Reflection.Meta Reflection.Name Reflection.Pattern Reflection.Term Reflection.TypeChecking.MonadSyntax
- New tactics for monoid and ring solvers. See
README.Tactic.MonoidSolver/RingSolver
for detailsTactic.MonoidSolver Tactic.RingSolver Tactic.RingSolver.NonReflective
Other major changes
Improved performance of decision processes
-
All definitions branching on a
Dec
value have been rewritten, wherever possible, to branch only on the booleandoes
field. Furthermore, branching on theproof
field has been made as late as possible, using theinvert
lemma fromRelation.Nullary.Reflects
. -
For example, the old definition of
filter
inData.List.Base
used theyes
andno
patterns, which desugared to the following:filter : ∀ {P : Pred A p} → Decidable P → List A → List A filter P? [] = [] filter P? (x ∷ xs) with P? x ... | false because ofⁿ _ = filter P? xs ... | true because ofʸ _ = x ∷ filter P? xs
Because the proofs (
ofⁿ _
andofʸ _
) are not giving us any information, we do not need to match on them. We end up with the following definition, where theproof
field has been projected away.filter : ∀ {P : Pred A p} → Decidable P → List A → List A filter P? [] = [] filter P? (x ∷ xs) with does (P? x) ... | false = filter P? xs ... | true = x ∷ filter P? xs
Correspondingly, when proving a property of
filter
, we can often make a similar change, but sometimes need the proof eventually. The following example is adapted fromData.List.Membership.Setoid.Properties
.open Membership S using (_∈_) ∈-filter⁺ : ∀ {v xs} → v ∈ xs → P v → v ∈ filter P? xs ∈-filter⁺ {xs = x ∷ _} (here v≈x) Pv with P? x -- There is no matching on the proof, so we can emit the result without -- computing the proof at all. ... | true because _ = here v≈x -- `invert` is used to get the proof just when it is needed. ... | false because [¬Px] = contradiction (resp v≈x Pv) (invert [¬Px]) -- In the remaining cases, we make no use of the proof. ∈-filter⁺ {xs = x ∷ _} (there v∈xs) Pv with does (P? x) ... | true = there (∈-filter⁺ v∈xs Pv) ... | false = ∈-filter⁺ v∈xs Pv
Other
-
The module
Reflection
is no longer--unsafe
. -
Standardised the
Eq
modules in structures and bundles inRelation.Binary
hierarchy.IsDecTotalOrder.Eq
now exportsisDecPartialOrder
.DecSetoid.Eq
now exportspartialSetoid
and_≉_
.Poset.Eq
andTotalOrder.Eq
now exportsetoid
.DecTotalOrder.Eq
andStrictTotalOrder.Eq
now exportdecSetoid
.DecTotalOrder.decSetoid
is now deprecated in favour of the aboveDecTotalOrder.Eq.decSetoid
.
Other minor additions
- Added new record to
Algebra.Bundles
:+-rawGroup : RawGroup c ℓ
and the
CommutativeMonoid
record now exportscommutativeSemigroup
. - Added new definition to
Algebra.Definitions
:Interchangable _∘_ _∙_ = ∀ w x y z → ((w ∙ x) ∘ (y ∙ z)) ≈ ((w ∘ y) ∙ (x ∘ z))
- Added new records to
Algebra.Morphism.Structures
:IsGroupHomomorphism (⟦_⟧ : A → B) : Set (a ⊔ ℓ₁ ⊔ ℓ₂) IsGroupMonomorphism (⟦_⟧ : A → B) : Set (a ⊔ ℓ₁ ⊔ ℓ₂) IsGroupIsomorphism (⟦_⟧ : A → B) : Set (a ⊔ b ⊔ ℓ₁ ⊔ ℓ₂) IsRingHomomorphism (⟦_⟧ : A → B) : Set (a ⊔ ℓ₁ ⊔ ℓ₂) IsRingMonomorphism (⟦_⟧ : A → B) : Set (a ⊔ ℓ₁ ⊔ ℓ₂) IsRingIsomorphism (⟦_⟧ : A → B) : Set (a ⊔ b ⊔ ℓ₁ ⊔ ℓ₂)
- Added new proofs to
Algebra.Properties.Group
:⁻¹-injective : x ⁻¹ ≈ y ⁻¹ → x ≈ y ⁻¹-anti-homo-∙ : (x ∙ y) ⁻¹ ≈ y ⁻¹ ∙ x ⁻¹
-
In
Algebra.Structures
the recordIsCommutativeSemiring
now exports*-isCommutativeSemigroup
. -
Made
RawFunctor
,RawApplicative
andIFun
more level polymorphic inCategory.Functor
,Category.Applicative
andCategory.Applicative.Indexed
respectively. - Added new functions to
Codata.Colist
:drop : ℕ → Colist A ∞ → Colist A ∞ concat : Colist (List⁺ A) i → Colist A i
- Added new definitions to
Codata.Colist.Bisimilarity
:fromEq : as ≡ bs → i ⊢ as ≈ bs isEquivalence : IsEquivalence R → IsEquivalence (Bisim R i) setoid : Setoid a r → Size → Setoid a (a ⊔ r) module ≈-Reasoning ++⁺ : Pointwise R as bs → Bisim R i xs ys → Bisim R i (fromList as ++ xs) (fromList bs ++ ys) ⁺++⁺ : Pointwise R (toList as) (toList bs) → Thunk^R (Bisim R) i xs ys → Bisim R i (as ⁺++ xs) (bs ⁺++ ys)
- Added new proofs to
Codata.Colist.Properties
:fromCowriter∘toCowriter≗id : i ⊢ fromCowriter (toCowriter as) ≈ as length-∷ : i ⊢ length (a ∷ as) ≈ 1 ℕ+ length (as .force) length-replicate : i ⊢ length (replicate n a) ≈ n length-++ : i ⊢ length (as ++ bs) ≈ length as + length bs length-map : i ⊢ length (map f as) ≈ length as length-scanl : i ⊢ length (scanl c n as) ≈ 1 ℕ+ length as replicate-+ : i ⊢ replicate (m + n) a ≈ replicate m a ++ replicate n a map-replicate : i ⊢ map f (replicate n a) ≈ replicate n (f a) lookup-replicate : All (a ≡_) (lookup k (replicate n a)) map-unfold : i ⊢ map f (unfold alg a) ≈ unfold (Maybe.map (Prod.map₂ f) ∘ alg) a unfold-nothing : alg a ≡ nothing → unfold alg a ≡ [] unfold-just : alg a ≡ just (a′ , b) → i ⊢ unfold alg a ≈ b ∷ λ where .force → unfold alg a′ scanl-unfold : i ⊢ scanl cons nil (unfold alg a) ≈ nil ∷ (λ where .force → unfold alg′ (a , nil)) map-alignWith : i ⊢ map f (alignWith al as bs) ≈ alignWith (f ∘ al) as bs length-alignWith : i ⊢ length (alignWith al as bs) ≈ length as ⊔ length bs map-zipWith : i ⊢ map f (zipWith zp as bs) ≈ zipWith (λ a → f ∘ zp a) as bs length-zipWith : i ⊢ length (zipWith zp as bs) ≈ length as ⊓ length bs drop-nil : i ⊢ drop {A = A} m [] ≈ [] drop-drop-fusion : i ⊢ drop n (drop m as) ≈ drop (m ℕ.+ n) as map-drop : i ⊢ map f (drop m as) ≈ drop m (map f as) length-drop : i ⊢ length (drop m as) ≈ length as ∸ m length-cotake : i ⊢ length (cotake n as) ≈ n map-cotake : i ⊢ map f (cotake n as) ≈ cotake n (Stream.map f as) drop-fromList-++-identity : drop (length as) (fromList as ++ bs) ≡ bs drop-fromList-++-≤ : m ≤ length as → drop m (fromList as ++ bs) ≡ fromList (drop m as) ++ bs drop-fromList-++-≥ : m ≥ length as → drop m (fromList as ++ bs) ≡ drop (m ∸ length as) bs drop-⁺++-identity : drop (length as) (as ⁺++ bs) ≡ bs .force map-chunksOf : i ⊢ map (map f) (map f) (chunksOf n as) ≈ chunksOf n (map f as) fromList-++ : i ⊢ fromList (as ++ bs) ≈ fromList as ++ fromList bs fromList-scanl : i ⊢ scanl c n (fromList as) ≈ fromList (scanl c n as) map-fromList : i ⊢ map f (fromList as) ≈ fromList (map f as) length-fromList : i co⊢ length (fromList as) ≈ fromℕ (length as) fromStream-++ : i ⊢ fromStream (as ++ bs) ≈ fromList as ++ fromStream bs fromStream-⁺++ : i ⊢ fromStream (as ⁺++ bs) ≈ fromList⁺ as ++ fromStream (bs .force) fromStream-concat : i ⊢ concat (fromStream ass) ≈ fromStream (concat ass) fromStream-scanl : i ⊢ scanl c n (fromStream as) ≈ fromStream (scanl c n as) map-fromStream : i ⊢ map f (fromStream as) ≈ fromStream (map f as)
- Added new definitions to
Codata.Conat.Bisimilarity
:isEquivalence : IsEquivalence (i ⊢_≈_) setoid : Size → Setoid 0ℓ 0ℓ module ≈-Reasoning
- Added new proof to
Codata.Conat.Properties
:0∸m≈0 : ∀ m → i ⊢ zero ∸ m ≈ zero
- Added new proofs to
Data.Bool
:not-injective : not x ≡ not y → x ≡ y
- Added new function to
Data.Difference.List
:_∷ʳ_ : DiffList A → A → DiffList A
- Added new properties to
Data.Fin.Properties
:lift-injective : (∀ {x y} → f x ≡ f y → x ≡ y) → ∀ k {x y} → lift k f x ≡ lift k f y → x ≡ y inject+-raise-splitAt : [ inject+ n , raise {n} m ] (splitAt m i) ≡ i
- Added new properties to
Data.Fin.Subset
:_⊂_ : Subset n → Subset n → Set _⊄_ : Subset n → Subset n → Set
- Added new proofs to
Data.Fin.Subset.Properties
:s⊆s : p ⊆ q → s ∷ p ⊆ s ∷ q ∣p∣≡n⇒p≡⊤ : ∣ p ∣ ≡ n → p ≡ ⊤ p∪∁p≡⊤ : p ∪ ∁ p ≡ ⊤ ∣∁p∣≡n∸∣p∣ : ∣ ∁ p ∣ ≡ n ∸ ∣ p ∣ x∈p⇒x∉∁p : x ∈ p → x ∉ ∁ p x∈∁p⇒x∉p : x ∈ ∁ p → x ∉ p x∉∁p⇒x∈p : x ∉ ∁ p → x ∈ p x∉p⇒x∈∁p : x ∉ p → x ∈ ∁ p x≢y⇒x∉⁅y⁆ : x ≢ y → x ∉ ⁅ y ⁆ x∉⁅y⁆⇒x≢y : x ∉ ⁅ y ⁆ → x ≢ y ∣p∩q∣≤∣p∣ : ∣ p ∩ q ∣ ≤ ∣ p ∣ ∣p∩q∣≤∣q∣ : ∣ p ∩ q ∣ ≤ ∣ q ∣ ∣p∩q∣≤∣p∣⊓∣q∣ : ∣ p ∩ q ∣ ≤ ∣ p ∣ ⊓ ∣ q ∣ ∣p∣≤∣p∪q∣ : ∣ p ∣ ≤ ∣ p ∪ q ∣ ∣q∣≤∣p∪q∣ : ∣ q ∣ ≤ ∣ p ∪ q ∣ ∣p∣⊔∣q∣≤∣p∪q∣ : ∣ p ∣ ⊔ ∣ q ∣ ≤ ∣ p ∪ q ∣
- Added new proofs to
Data.Integer.Properties
:suc[i]≤j⇒i<j : sucℤ i ≤ j → i < j i<j⇒suc[i]≤j : i < j → sucℤ i ≤ j
- Added new functions to
Data.List
:derun : B.Decidable R → List A → List A deduplicate : Decidable _R_ → List A → List A
- Added new proofs to
Data.List.Relation.Binary.Equality.Setoid
:Any-resp-≋ : P Respects _≈_ → (Any P) Respects _≋_ All-resp-≋ : P Respects _≈_ → (All P) Respects _≋_ AllPairs-resp-≋ : R Respects₂ _≈_ → (AllPairs R) Respects _≋_ Unique-resp-≋ : Unique Respects _≋_
- Added new functions to
Data.List.Base
:_?∷_ : Maybe A → List A → List A _∷ʳ?_ : List A → Maybe A → List A
- Added new proofs to
Data.List.Membership.Propositional.Properties
:∈-derun⁺ : z ∈ xs → z ∈ derun R? xs ∈-deduplicate⁺ : z ∈ xs → z ∈ deduplicate _≟_ xs ∈-derun⁻ : z ∈ derun R? xs → z ∈ xs ∈-deduplicate⁻ : z ∈ deduplicate R? xs → z ∈ xs
- Added new proofs to
Data.List.Membership.Setoid.Properties
:∈-derun⁺ : _≈_ Respectsʳ R → z ∈ xs → z ∈ derun R? xs ∈-deduplicate⁺ : _≈_ Respectsʳ (flip R) → z ∈ xs → z ∈ deduplicate R? xs ∈-derun⁻ : z ∈ derun R? xs → z ∈ xs ∈-deduplicate⁻ : z ∈ deduplicate R? xs → z ∈ xs
- Added new proofs to
Data.List.Relation.Unary.All.Properties
:derun⁺ : All P xs → All P (derun Q? xs) deduplicate⁺ : All P xs → All P (deduplicate Q? xs) filter⁻ : All Q (filter P? xs) → All Q (filter (¬? ∘ P?) xs) → All Q xs derun⁻ : All P (derun Q? xs) → All P xs deduplicate⁻ : All P (deduplicate Q? xs) → All P xs
- Added new proofs to
Data.List.Relation.Unary.Any.Properties
:lookup-result : (p : Any P xs) → P (lookup p) filter⁺ : (p : Any P xs) → Any P (filter Q? xs) ⊎ ¬ Q (Any.lookup p) derun⁺ : P Respects Q → Any P xs → Any P (derun Q? xs) deduplicate⁺ : P Respects (flip Q) → Any P xs → Any P (deduplicate Q? xs) filter⁻ : Any P (filter Q? xs) → Any P xs derun⁻ : Any P (derun Q? xs) → Any P xs deduplicate⁻ : Any P (deduplicate Q? xs) → Any P xs
-
The implementation of
↭-trans
has been altered inData.List.Relation.Binary.Permutation.Inductive
to avoid adding unnecessaryrefl
s, hence improving it’s performance. - Added new functions to
Data.List.Relation.Binary.Permutation.Setoid
:↭-prep : xs ↭ ys → x ∷ xs ↭ x ∷ ys ↭-swap : xs ↭ ys → x ∷ y ∷ xs ↭ y ∷ x ∷ ys steps : xs ↭ ys → ℕ
- Added new combinators to
PermutationReasoning
inData.List.Relation.Binary.Permutation.Setoid
:_≋⟨_⟩_ : x ≋ y → y IsRelatedTo z → x IsRelatedTo z _≋˘⟨_⟩_ : y ≋ x → y IsRelatedTo z → x IsRelatedTo z
- Added new functions to ` Data.List.Relation.Binary.Permutation.Setoid.Properties`:
0<steps : (xs↭ys : xs ↭ ys) → 0 < steps xs↭ys steps-respˡ : (ys≋xs : ys ≋ xs) (ys↭zs : ys ↭ zs) → steps (↭-respˡ-≋ ys≋xs ys↭zs) ≡ steps ys↭zs steps-respʳ : (xs≋ys : xs ≋ ys) (zs↭xs : zs ↭ xs) → steps (↭-respʳ-≋ xs≋ys zs↭xs) ≡ steps zs↭xs split : xs ↭ as ++ [ v ] ++ bs → ∃₂ λ ps qs → xs ≋ ps ++ [ v ] ++ qs dropMiddle : ws ++ vs ++ ys ↭ xs ++ vs ++ zs → ws ++ ys ↭ xs ++ zs dropMiddleElement : ws ++ [ v ] ++ ys ↭ xs ++ [ v ] ++ zs → ws ++ ys ↭ xs ++ zs dropMiddleElement-≋ : ws ++ [ v ] ++ ys ≋ xs ++ [ v ] ++ zs → ws ++ ys ↭ xs ++ zs filter⁺ : xs ↭ ys → filter P? xs ↭ filter P? ys
- Added new proofs to
Data.List.Relation.Binary.Pointwise
:Any-resp-Pointwise : P Respects _∼_ → (Any P) Respects (Pointwise _∼_) All-resp-Pointwise : P Respects _∼_ → (All P) Respects (Pointwise _∼_) AllPairs-resp-Pointwise : R Respects₂ _∼_ → (AllPairs R) Respects (Pointwise _∼_)
- Added new proofs to
Data.Maybe.Properties
:map-nothing : ma ≡ nothing → map f ma ≡ nothing map-just : ma ≡ just a → map f ma ≡ just (f a)
- Added new proofs to
Data.Nat.DivMod
:%-distribˡ-* : (m * n) % d ≡ ((m % d) * (n % d)) % d
- Added new proofs to
Data.Nat.Properties
:m<n+m : n > 0 → m < n + m ∸-cancelʳ-≡ : o ≤ m → o ≤ n → m ∸ o ≡ n ∸ o → m ≡ n ⌊n/2⌋+⌈n/2⌉≡n : ⌊ n /2⌋ + ⌈ n /2⌉ ≡ n ⌊n/2⌋≤n : ⌊ n /2⌋ ≤ n ⌊n/2⌋<n : ⌊ suc n /2⌋ < suc n ⌈n/2⌉≤n : ⌈ n /2⌉ ≤ n ⌈n/2⌉<n : ⌈ suc (suc n) /2⌉ < suc (suc n) ⌊n/2⌋≤⌈n/2⌉ : ⌊ n /2⌋ ≤ ⌈ n /2⌉ ⊔-pres-≤m : n ≤ m → o ≤ m → n ⊔ o ≤ m ⊔-pres-<m : n < m → o < m → n ⊔ o < m ⊓-pres-m≤ : m ≤ n → m ≤ o → m ≤ n ⊓ o ⊓-pres-m< : m < n → m < o → m < n ⊓ o *-isCommutativeSemigroup : IsCommutativeSemigroup _*_ *-commutativeSemigroup : CommutativeSemigroup 0ℓ 0ℓ
- Added new data and functions to
Data.String.Base
:data Alignment : Set fromAlignment : Alignment → ℕ → String → String parens : String → String parensIfSpace : String → String braces : String → String intersperse : String → List String → String unwords : List String → String _<+>_ : String → String → String padLeft : Char → ℕ → String → String padRight : Char → ℕ → String → String padBoth : Char → Char → ℕ → String → String rectangle : Vec (ℕ → String → String) n → Vec String n → Vec String n rectangleˡ : Char → Vec String n → Vec String n rectangleʳ : Char → Vec String n → Vec String n rectangleᶜ : Char → Char → Vec String n → Vec String n
- Added new proofs to
Data.String.Unsafe
:toList-++ : toList (s ++ t) ≡ toList s ++ toList t length-++ : length (s ++ t) ≡ length s + length t length-replicate : length (replicate n c) ≡ n
- Added new proof to
Data.Sum.Properties
:[,]-∘-distr : f ∘ [ g , h ] ≗ [ f ∘ g , f ∘ h ] [,]-map-commute : [ f′ , g′ ] ∘ (map f g) ≗ [ f′ ∘ f , g′ ∘ g ] map-commute : ((map f′ g′) ∘ (map f g)) ≗ map (f′ ∘ f) (g′ ∘ g)
-
Improved the universe polymorphism of
Data.Product.Relation.Binary.Lex.Strict/NonStrict
so that the equality and order relations need not live at the same universe level. - Added new proofs to
Data.Product.Relation.Binary.Lex.Strict
:×-wellFounded : WellFounded _<₁_ → WellFounded _<₂_ → WellFounded _<ₗₑₓ_
- Added new proofs to
Data.Rational.Properties
:↥-* : ↥ (p * q) ℤ.* *-nf p q ≡ ↥ p ℤ.* ↥ q ↧-* : ↧ (p * q) ℤ.* *-nf p q ≡ ↧ p ℤ.* ↧ q toℚᵘ-homo-* : Homomorphic₂ toℚᵘ _*_ ℚᵘ._*_ toℚᵘ-isMagmaHomomorphism-* : IsMagmaHomomorphism *-rawMagma ℚᵘ.*-rawMagma toℚᵘ toℚᵘ-isMonoidHomomorphism-* : IsMonoidHomomorphism *-rawMonoid ℚᵘ.*-rawMonoid toℚᵘ toℚᵘ-isMonoidMonomorphism-* : IsMonoidMonomorphism *-rawMonoid ℚᵘ.*-rawMonoid toℚᵘ toℚᵘ-homo‿- : Homomorphic₁ toℚᵘ (-_) (ℚᵘ.-_) toℚᵘ-isGroupHomomorphism-+ : IsGroupHomomorphism +-0-rawGroup ℚᵘ.+-0-rawGroup toℚᵘ toℚᵘ-isGroupMonomorphism-+ : IsGroupMonomorphism +-0-rawGroup ℚᵘ.+-0-rawGroup toℚᵘ toℚᵘ-isRingHomomorphism-|-* : IsRingHomomorphism +-*-rawRing ℚᵘ.+-*-rawRing toℚᵘ toℚᵘ-isRingMonomorphism-|-* : IsRingMonomorphism +-*-rawRing ℚᵘ.+-*-rawRing toℚᵘ *-assoc : Associative _*_ *-comm : Commutative _*_ *-identityˡ : LeftIdentity 1ℚ _*_ *-identityʳ : RightIdentity 1ℚ _*_ *-identity : Identity 1ℚ _*_ +-inverseˡ : LeftInverse 0ℚ -_ _+_ +-inverseʳ : RightInverse 0ℚ -_ _+_ +-inverse : Inverse 0ℚ -_ _+_ -‿cong : Congruent₁ (-_) *-isMagma : IsMagma _*_ *-isSemigroup : IsSemigroup _* *-1-isMonoid : IsMonoid _*_ 1ℚ *-1-isCommutativeMonoid : IsCommutativeMonoid _*_ 1ℚ *-rawMagma : RawMagma 0ℓ 0ℓ *-rawMonoid : RawMonoid 0ℓ 0ℓ +-0-rawGroup : RawGroup 0ℓ 0ℓ +-*-rawRing : RawRing 0ℓ 0ℓ +-0-isGroup : IsGroup _+_ 0ℚ (-_) +-0-isAbelianGroup : IsAbelianGroup _+_ 0ℚ (-_) +-0-isRing : IsRing _+_ _*_ -_ 0ℚ 1ℚ +-0-group : Group 0ℓ 0ℓ +-0-abelianGroup : AbelianGroup 0ℓ 0ℓ *-distribˡ-+ : _*_ DistributesOverˡ _+_ *-distribʳ-+ : _*_ DistributesOverʳ _+_ *-distrib-+ : _*_ DistributesOver _+_ *-magma : Magma 0ℓ 0ℓ *-semigroup : Semigroup 0ℓ 0ℓ *-1-monoid : Monoid 0ℓ 0ℓ *-1-commutativeMonoid : CommutativeMonoid 0ℓ 0ℓ +-*-isRing : IsRing _+_ _*_ -_ 0ℚ 1ℚ +-*-ring : Ring 0ℓ 0ℓ
- Added new proofs to
Data.Rational.Unnormalised.Properties
:+-inverseˡ : LeftInverse _≃_ 0ℚᵘ -_ _+_ +-inverseʳ : RightInverse _≃_ 0ℚᵘ -_ _+_ +-inverse : Inverse _≃_ 0ℚᵘ -_ _+_ -‿cong : Congruent₁ _≃_ (-_) +-0-isGroup : IsGroup _≃_ _+_ 0ℚᵘ (-_) +-0-group : Group 0ℓ 0ℓ +-0-isAbelianGroup : IsAbelianGroup _≃_ _+_ 0ℚᵘ (-_) +-0-abelianGroup : AbelianGroup 0ℓ 0ℓ *-zeroˡ : LeftZero _≃_ 0ℚᵘ _*_ *-zeroʳ : RightZero _≃_ 0ℚᵘ _*_ *-zero : Zero _≃_ 0ℚᵘ _*_ *-distribˡ-+ : _DistributesOverˡ_ _≃_ _*_ _+_ *-distribʳ-+ : _DistributesOverʳ_ _≃_ _*_ _+_ *-distrib-+ : _DistributesOver_ _≃_ _*_ _+_ +-*-isRing : IsRing _≃_ _+_ _*_ -_ 0ℚᵘ 1ℚ +-*-ring : Ring 0ℓ 0ℓ +-0-rawGroup : RawGroup 0ℓ 0ℓ +-*-rawRing : RawRing 0ℓ 0ℓ +-*-isCommutativeRing : IsCommutativeRing _≃_ _+_ _*_ -_ 0ℚᵘ 1ℚᵘ +-*-commutativeRing : CommutativeRing 0ℓ 0ℓ
- Added new functions to
Data.Vec.Base
:uncons : Vec A (suc n) → A × Vec A n length : Vec A n → ℕ transpose : Vec (Vec A n) m → Vec (Vec A m) n
- Added new functions to
Data.Vec.Bounded.Base
:take : n → Vec≤ A m → Vec≤ A (n ⊓ m) drop : n → Vec≤ A m → Vec≤ A (m ∸ n) padLeft : A → Vec≤ A n → Vec A n padRight : A → Vec≤ A n → Vec A n padBoth : ∀ {n} → A → A → Vec≤ A n → Vec A n rectangle : List (∃ (Vec≤ A)) → ∃ (List ∘ Vec≤ A)
- Added new definitions to
Data.Word.Base
:_≈_ : Rel Word64 zero _<_ : Rel Word64 zero
- Added utility function to
Function.Base
:it : {A : Set a} → → A
- Added new definitions to
Function.Bundles
:record BiInverse record BiEquivalence _↩↪_ : Set a → Set b → Set _ mk↩↪ : Inverseˡ f g₁ → Inverseʳ f g₂ → A ↩↪ B
- Added new definitions to
Function.Structures
:record IsBiEquivalence (f : A → B) (g₁ : B → A) (g₂ : B → A) record IsBiInverse (f : A → B) (g₁ : B → A) (g₂ : B → A)
- Added new proofs to
Induction.WellFounded
:Acc-resp-≈ : Symmetric _≈_ → _<_ Respectsʳ _≈_ → (Acc _<_) Respects _≈_ some-wfRec-irrelevant : Some.wfRec P f x q ≡ Some.wfRec P f x q' wfRecBuilder-wfRec : All.wfRecBuilder P f x y y<x ≡ All.wfRec P f y unfold-wfRec : All.wfRec P f x ≡ f x λ y _ → All.wfRec P f y
- Added new definition in
Relation.Binary.Core
:DecidableEquality A = Decidable {A = A} _≡_
- Added new proofs to
Relation.Binary.Construct.Union
:respˡ : L Respectsˡ ≈ → R Respectsˡ ≈ → (L ∪ R) Respectsˡ ≈ respʳ : L Respectsʳ ≈ → R Respectsʳ ≈ → (L ∪ R) Respectsʳ ≈ resp₂ : L Respects₂ ≈ → R Respects₂ ≈ → (L ∪ R) Respects₂ ≈
- Added new proof to
Relation.Binary.Setoid.Properties
:≉-resp₂ : _≉_ Respects₂ _≈_
- Added a new proof to
Relation.Nullary.Decidable
:isYes≗does : (P? : Dec P) → isYes P? ≡ does P?


 Usually this is 4 or more humans per side.
Once you are in tournament mode, you will earn “Damage Inflicted” with every ship killed, every army bombed, and every planet captured. Sufficient damage inflicted, plus a high enough offense rating (damage inflicted per hour) will result in “promotions” to higher rank. If you are not playing as a guest, these promotions will persist to future games on the same server.
feedback@networkmom.net


Favors
About Us
Account Info
User Info
Favor Listing
Home Page
Log In
Find A Brewery
About Us
Account Info
User Info
Favors Board
Home Page
Log In
Find A Brewery
menu
Favors for Beers!
Favors Board
Favor Description
Favor Value


Force Android in App Updates
With the new Play Core Library Google offers us the possibility to prompt for app updates from within our app for the first time. Users get informed about new available versions and can decide to update their app. If needed, we can even force the update altogether. The Google library itself handles the download and installation of the new app version.
There are two modes how an update can be triggered:
- Flexible: The app update runs in the background. The User can continue using the app and the update will be applied when the user chooses to restart the app.
- Immediate: The user is forced to update the app and the app is unusable until the process is finished.
The downside is, that the library itself is not able to detect if an update should be flexible or immediate. Sometimes it might be necessary to force users to update right away due to some breaking changes or unwanted crashes.
So we need to provide a way to decide between a flexible or immediate update. To simplify this process we published an Android library which allows us to decide on the type of update we need.
Who decides to force an update?
The library offers an easy way to detect if an update should be forced. All we have to do is implement ForceUpdateProvider
and call doUpdate()
when we need to update right away.
class DemoForceUpdateProvider : ForceUpdateProvider {
override fun requestUpdateShouldBeImmediate(availableVersionCode: Int, doUpdate: () -> Unit) {
// place your logic here
// obtain force update decision from your source eg Firebase Remote Config
// if a forced update is needed, just call doUpdate
doUpdate()
}
}
inAppUpdateManager = InAppUpdateManager(this, DemoForceUpdateProvider())
There are a lot of possible sources to decide if an update should be forced. Examples are Firebase Remote Config
, File hosted on your server
, Even/Odd available version code
, …
Since the forced-update screen that shows when we use this method can be closed through the back button, we need to override onActivityResult
to keep showing the update again to achieve an actually blocking update mechanism.
override fun onActivityResult(requestCode: Int, resultCode: Int, data: Intent?) {
inAppUpdateManager.onActivityResult(requestCode, resultCode)
super.onActivityResult(requestCode, resultCode, data)
}
That’s it. The end result looks like this:
The library is available on GitHub: https://github.com/allaboutapps/InAppUpdater


{% extends "base.html" %} {% block body %}
We worked with Xplenty, a data integration startup, on a set of customer case study videos that highlight why their customers love their product. This video features GoGuardian sharing how they use Xplenty to manage the data for their education-focused SaaS product.


Executive arm of the Industries Department, engaged in implementation of government policies for all-round development of industries in the state and to make Uttar Pradesh a front runner state in terms of entrepreneur development, providing a conducive environment for industrial production and investment.
lorem Ipsum is lorem Ipsum lorem Ipsum is simply dummy text of the printing and typesetting industry loremipsum. lorem Ipsum is simply dummy text of the printing and typesetting industry loremipsum is simple.
lorem Ipsum is lorem Ipsum lorem Ipsum is simply dummy text of the printing and typesetting industry loremipsum. lorem Ipsum is simply dummy text of the printing and typesetting industry loremipsum is simple.
Email us or give us a call at +1<PHONE_NUMBER>.


Android Screen Density Calculator
- How: Just change the number on any of the inputs to reflect the value.
- Why: I often need to calculate different measures to make assets for Android apps and I always end doing the math myself.
- Inspiration: I used Skinkers calculator but it was outdated. The teehan+lax Pixel Density Converter is a nice tool but it doesn't cover the numbers I need.
by jiserra
Github


Power BI Real-Time Slideshow
v2.4.0
Status messages
Flash message goes here.
Controls
Refresh Time:
Disabled
10s (Dev only)
1min
2mins
3mins
4mins
5mins
10mins
15mins
30mins
60mins
Save
Slide Time:
5s
10s
15s
20s
25s
30s
35s
40s
45s
50s
55s
60s
2mins
3mins
4mins
5mins
Save
Play
Stop


I am Laukik Upadhye, pursuing masters in Data Science. I am currently taking Data Visualization course, in that, I am learning different visualization in D3JS, and will include them in HTML.
Topic: US Natural Disasters
In this project I will present report about natural disasters in US from 1953. For this I am using data provided by Federal Emergency Management Agency.
Topic: Netfilx data and recommendation
In this project we will showcase Netflix data analysis, and provide movie recommendation based on selected movie.


This plugin integrates Jenkins with Cincom Visualworks Smalltalk Store. The plugin requires at least one shell script or batch file to be created that can run a Visualworks image with the StoreCI-Polling package loaded.
Plugin Information |
|---|
View Visualworks Store on the plugin site for more information. |
Older versions of this plugin may not be safe to use. Please review the following warnings before using an older version:
Using the Visualworks Store Plugin
In order to use the Visualworks Store Plugin, a few steps are required.
Configure a Visualworks Image
This plugin requires the StoreCI-Polling package that is available in the Cincom Public Store Repository. StoreCI-Polling works with Cincom Visualworks 7.7 or later.
StoreCI-Polling is part of the StoreCI suite.
To use this plugin, build a Visualworks image that contains the following:
- The Store package for your Store repository database (e.g. StoreForPostgreSQL).
- Repository definitions for each of the Store repositories you want to use with the plugin (or use the -importRepositories command-line option).
- The StoreCI-Polling package (or a Parcel version of that package available).
Create a Shell Script or Batch File to Run Your Image
This plugin expects to run a shell script or batch file that runs Visualworks with the image you created above. This script should pass all of its arguments on to the image. For example, a Linux or MacOS/X script might contain a line such as:
/path/to/visualworksVM /path/to/image "$@"
Or, if you saved StoreCI-Polling as a parcel instead:
/path/to/visualworksVM /path/to/image -pcl /path/to/StoreCI-Polling.pcl "$@"
This plugin allows more than one such script to be configured. This allows different builds to be run using different versions of Visualworks.
Install the Plugin
Install the plugin either using Jenkins plugin administration or manually.
Configure the Plugin
If the plugin was installed correctly, there will be a Visualworks Store section in the global configuration page of Jenkins (Manage Jenkins | Configure System). Enter the path to the shell script or batch file you created above. If you created more than one script, use the Add Script button to configure any additional scripts.
Configure a Build to Use Visualworks Store
In the Source Code Management section of your build, choose Store.
Specify the following settings:
- Store Script: Choose one of the scripts you configured in the global settings.
- Repository Name: Specify the name of the Store repository to monitor.
- Pundles: Choose the type (Package or Bundle) and enter the name of a pundle to monitor. If you would like to specify more than one pundle, use the Add Pundle button. StoreCI-Polling will watch for changes to those pundles and any of their (recursive) prerequisites in the same repository. Thus, it is only necessary to specify "root" pundles here.
- Version Regex: Specify a regular expression that indicates which pundle versions you would like to consider. By default, all versions are considered. The regular expression must be in Regex11 format. For example, integer-only version numbers can be matched using "\d+".
- Minimum Blessing Level: Specify a minimum blessing level (default: Development). Pundles with a lower blessing level will not be considered.
- Generate input file for ParcelBuilder?: If desired, check the box to enable generation of an input file for ParcelBuilder (now called StoreCI-Building) and then specify a filename. This file will contain the list of most-recent pundle versions that were found by StoreCI-Polling as of the time the build started. This file can be used by StoreCI-Building (available in the Public Store Repository) or a similar tool to build an image or deploy parcels as part of the build. If no path is specified, the file will be created in the root of the Jenkins workspace directory for your project. This file will contain the pundles in "load order". That is, all of a pundle's prerequisites will be earlier in the list than the pundle itself. That way, when loading the pundles into an image, no automatic prerequisite resolution will need to be done.
Visualworks Smalltalk Store Plugin is designed to work with the Multiple SCMs Plugin. This is useful if you need to monitor more than one repository for the same build, or if you need to monitor both a Store repository and a git or Subversion repository.
Changelog
Version 1.1.1
[JENKINS-23389] Support checking out on a build slave.
Version 1.1
Failed release; skipping
Version 1.0
Initial version.


Hello, Thank you for visiting my page. I am a Sales Professional looking to learn new things and I am very excited about coding. Below you will find my coding work. I will be updating this page regularly with my work.
I really enjoy coding. This is really fun!
My goal is to be able to build simple integrations for work. Be able to use some cool Javascript technologies such as react, node and build interactive applications.
A tool that allows users to research a stock, add to their list and view more details about the stock.
View ApplicationWeather Dashboard that allows a user to view current weather and weather forecast for any city.
View ApplicationAllows a user to maintain a day planner for each hourly block. Blocks are color coded to show past and future meetings
View ApplicationAllows a user to generate a complex password based on certain chosen criteria & constraints
View Application


All users from the JSON Placeholder users endpoint.
| ID | View user details | |
|---|---|---|
| {{ user.id }} | {{ user.email }} |
The response is transformed into an instance of the UserModel class.
Confirm can call class method
UserModel.getFirstName() and UserModel.getLastName():
First name = {{ selectedUser!.getFirstName() }}, last name = {{ selectedUser!.getLastName() }}
Confirm can call nested class method
UserModel.address.geo.toDegreesMinutesSeconds() (lat/lng decimal as degrees, minutes, and seconds):
{{ selectedUser!.address.geo.toDegreesMinutesSeconds() }}
Confirm that nested objects have been populated
{{ selectedUser | json }}


If it is possible to arrange two solids so that:
Their bases are of equal area and in the same plane;
Their heights are equal;
Any plane parallel to the bases cuts both solids in sections of equal area,
then the two solids have the same volume.


Defined in generated file: python/ops/gen_nn_ops.py
Produces the max pool of the input tensor for quantized types.
tf.compat.v1.nn.quantized_max_pool( input, min_input, max_input, ksize, strides, padding, name=None )
input
: A Tensor
. Must be one of the following types: qint8
, quint8
, qint32
, qint16
, quint16
.
The 4D (batch x rows x cols x depth) Tensor to MaxReduce over.min_input
: A Tensor
of type float32
.
The float value that the lowest quantized input value represents.max_input
: A Tensor
of type float32
.
The float value that the highest quantized input value represents.ksize
: A list of ints
.
The size of the window for each dimension of the input tensor.
The length must be 4 to match the number of dimensions of the input.strides
: A list of ints
.
The stride of the sliding window for each dimension of the input
tensor. The length must be 4 to match the number of dimensions of the input.padding
: A string
from: "SAME", "VALID"
.
The type of padding algorithm to use.name
: A name for the operation (optional).A tuple of Tensor
objects (output, min_output, max_output).
output
: A Tensor
. Has the same type as input
.min_output
: A Tensor
of type float32
.max_output
: A Tensor
of type float32
.


---
layout: post
authors: ["Anelda van der Walt"]
title: "June 29 - July 06, 2015: Research Software Engineers, Not Changing Lesson Build Tools, and Moving to Python3."
date: 2015-07-06
time: "06:30:00"
tags: ["Community"]
---
Highlights
-
Do you know what a Research Software Engineer
is or why we desperately need to recognise the role RSEs are playing in research?
Read about the history of RSEs and a fellowship programme available for RSEs in the UK.
-
Version 5.4 of our lessons
will be released at the end of November, rather than mid-August,
and lesson build tools will remain unchanged until then.
Most importantly we'll be changing the Python lessons to run on Python 3.
Contribute
-
Are you looking for other ways to contribute to Software Carpentry?
Visit our Projects page to see an exciting list of opportunities for you to get involved.
Details
-
Pauline Barmby summarised her experience at a recent
all women's Software Carpentry workshop
at the University of Toronto.
-
Damien Irving recently ran
a Software Carpentry workshop as part of a Masters course module for Earth Sciences.
They are also making Software Carpentry software available through the research cloud, NeCTAR.
-
A genomics focussed Data Carpentry hackathon and workshop
was held at the Unviversity of Untrecht, Netherlands.
The workshop formed part of an ELIXIR Pilot Project and was generally well received.
-
Workshops were run at the University of Melbourne, Yonsei University, and the University of Queensland.
For a full list of our past workshops, please visit our website.
-
Several workshops have been confirmed for the next few months.
Upcoming workshops can be viewed on our website.
Newly added workshops are indicated with "*".
-
July:
SciPy 2015,
UC Davis*,
UC Berkeley*,
West Vancouver Memorial Library,
The University of Queensland - AMOS sciences,
University of Melbourne,
Unvirsity of Nebraska - Lincoln*,
SAP Offices in Feltham,
University of Cape Town,
Hospital for Sick Children,
Curtin University,
Harvard University,
Life Sciences Institute, UBC*
-
August:
CU Boulder Libraries*,
NERC / University of Leeds*
-
September:
The University of Leeds - Advanced Research Computing*,
University of Queensland*
| Project | Issues | Pull Requests |
| Opened | Closed | Comments | Opened | Closed | Comments |
| shell-novice | | | 3 | 1 | 1 | |
| git-novice | 2 | | 9 | 1 | 1 | |
| hg-novice | | | | | | |
| sql-novice-survey | 3 | 1 | 11 | | 7 | |
| python-novice-inflammation | | | 9 | | | |
| r-novice-inflammation | | | 18 | 1 | 3 | |
| matlab-novice-inflammation | | | 5 | | | |
| slideshows | | | | | | |
| instructor-training | | | | | | |
| amy | 3 | 8 | 15 | 5 | 10 | |
| site | | | 3 | 6 | 7 | |


Some intro to using this app...
Swipe left to view next slide.
These slides may be reviewed at any time with the View Introduction button of the Settings tab.


Hacking with Habu¶
“An open sourced set of simple tools to learn about hacking”
Some key aspects:
- Command line applications
- Developed in Python
- Designed to be simple to use and understand
Development¶
If you want to collaborate with the project or simply learn how Habu is developed, read the “Development Guide”. (not written yet)
Operating System Compatibility and Issues¶
Habu is developed with GNU/Linux systems in mind, but with a lot of efforts to make it compatible with any Unix-like system and even with Microsoft Windows.
Please, if you find that some tool doesn’t work with your OS, don’t hesitate to report the issue through Github (https://github.com/fportantier/habu/issues).
Permissions¶
Some of the tools need elevated permissions to run correctly, so, it’s recommended to run these tools with the root user (or use sudo/doas) on Unix, or with elevated permissions through UAC on Microsoft Windows.
Quick Installation or Upgrade¶
$ pip3 install --upgrade habu
$ habu.version
0.1.30
For detailed (or alternative) installation steps, read “Detailed Installation” section.
This Guide¶
The purpouse of this guide is not only learn how to use Habu, but also learn a lot of hacking concepts.
Feel free to jump to any section of your interest but, if you want to learn from the most basic concepts, read this guide in an ordered way.
Usage Videos¶
The following Youtube Playlist has videos that shows the installation and usage and various Habu tools:
https://www.youtube.com/watch?v=rgp9seLLyqE&list=PL4HZnX8VnFXqSvNw7x-bXOn0dgxNdfnVD
Telegram Group¶
If you want to discuss some Habu features, possible improvements, etc, you can use the Habu Telegram Group: https://t.me/python_habu
The User Guide¶
This part of the documentation, guides you through the usage of Habu tools and teachs you a lot of concepts about hacking.
TODO (well we written soon):
- Development Overview
- Installation (detailed)
- Subdomain Discovery
- Web Technologies Enumeration
- Integration With External Services
- AsyDNS
- VirusTotal
- Address Resolution Protocol (ARP)
- ping
- sniff
- poison
- Classic Network Attacks
- land
- synflood
- Enumeration
- Extracting Data From Logs
- Cryptography Functions
- Hash functions
- Hash identification
- Fernet
- XOR
- Group Policy Preferences (GPP) Decryption
- Broken Cryptography Decrypt
- Cisco 7
- Other Hacking Techniques
- Crack SNMP
- Crack Luhn
- DHCP Starvation
- DHCP Discover
- TCP Flags
- TCP Scan
- ISN variation detection
- Protocol Scan
- Social Network Username Discovery
- Virtual Hosting Discovery
- Web Headers
- Data about IP Addresses
- Data about Domain Names
- Protocol Servers
- Fake FTP Server
Command Reference¶
The complete command reference can be found in https://github.com/fportantier/habu/blob/master/README.rst#commands-index