| Author | Oliver "Kiste" Seitz |
| Adapted-by | |
| Compiler | >=2.4o |
The hardware RTCC present in some PIC devices is limited to years 2000...2099. If you want to build e.g. a time-travelling vehicle, such a clock is of little use. This software library implements a RTCC which is valid from friday, October 15, 1582 to presumably at least the year 7000. Earlier, the julian calendar was valid. Later, the inaccuracy of the gregorian leap year rules may have accumulated to a whole day.
No dependency found
bigcal_update_current()
bigcal_add_days(bigcal_datetype in out ddate, sword in distance)
bigcal_find_easter(bigcal_datetype in out edate)
bigcal_days_per_month(word in year, byte in month) return byte
bigcal_weekday(bigcal_datetype in ddate) return byte
bigcal_update_current()
Title: Update current time and date Arguments: none Returns: none Notes: works on global variables current_date and current_time. "current_time.seconds" is to be updated somehow, e.g. a timer or the like. This procedure updates all the other variables, depending on the rising value of "current_time.seconds". It should be called regularly. Once a second is ok, but not stricktly necessary. "seconds" should not overflow, so this procedure must be called at least once every four minutes.
bigcal_add_days(bigcal_datetype in out ddate, sword in distance)
Title: Alter a given date by a number of days Arguments: - Year Month Day distance Returns: A modified date (year,month,day) Notes: distance can be positive, moves date to the future distance can be negative, moves date to the past +/-32768 days is a bit more than 89 years
bigcal_find_easter(bigcal_datetype in out edate)
Title: Find date of easter sunday Arguments: year in datetype record Returns: complete datetype record with date of easter sunday Notes: Calculates the date of easter sunday using formulae created by C.F. Gauss, modified by Dr. H. Lichtenberg as published by the german date and time authority "Physikalisch-Technische Bundesanstalt".
bigcal_days_per_month(word in year, byte in month) return byte
Title: Number of days per month Arguments: - Year (from 1582 up) Month (1 to 12) Returns: Number of days in the specified month (28,29,30 or 31) Notes: Respects leap years as defined by the gregorian calendar.
bigcal_weekday(bigcal_datetype in ddate) return byte
Title: Weekday Arguments: - Year (from 1582 up) Month (1 to 12) Day (1 to 31) Returns: Weekday of the given date (0=sunday, 1=monday...) Notes: Based on "Zeller's congruence"
| 16f688 | 16f688_big_calendar.jal |


| Methods' Details |
queryCreatableContentsInfo
- Description
- returns a list with information about the creatable contents.
- Returns
- the list with information about the creatable contents.
|
|
createNewContent
- Description
- creates a new content of given type.
- Parameter Info
- the content information.
- Returns
- the new content, if operation was successful.
|
|
Top of Page
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


Abstract bit-reader.
More...
#include <bit-io.hpp>
|
| virtual int | read (uint64_t &bits, int width)=0 |
| | Read a given number of bits. More...
|
| |
| virtual int | read_int () |
| | Read integer in big endian order. More...
|
| |
| virtual uint64_t | read_gamma () |
| | Read a gamma-encoded number. More...
|
| |
| virtual uint64_t | read_delta () |
| | Read a delta-encoded number. More...
|
| |
| virtual size_t | read_str (char *buffer, size_t size) |
| | Read a null-terminated string (max size - 1 characters will be read). More...
|
| |
| virtual int alzw::breader::read |
( |
uint64_t & |
bits, |
|
|
int |
width |
|
) |
| |
|
pure virtual |
Read a given number of bits.
Bits will be read in big endian order and put into a given integer variable as its least significant bits. Note that up to 64 bits can be read at once.
- Parameters
-
| bits | output variable |
| width | number of bits to be read |
- Returns
- number of bits actually read (0 means EOF)
Implemented in alzw::stream_breader.
| uint64_t breader::read_delta |
( |
| ) |
|
|
virtual |
Read a delta-encoded number.
- Returns
- number
| uint64_t breader::read_gamma |
( |
| ) |
|
|
virtual |
Read a gamma-encoded number.
- Returns
- number
| int breader::read_int |
( |
| ) |
|
|
virtual |
Read integer in big endian order.
- Returns
- read integer
| size_t breader::read_str |
( |
char * |
buffer, |
|
|
size_t |
size |
|
) |
| |
|
virtual |
Read a null-terminated string (max size - 1 characters will be read).
- Parameters
-
| buffer | output buffer |
| size | buffer size |
- Returns
- number of read bytes
The documentation for this class was generated from the following files:


Pearson Investigating Science and Technology 7. Used for 2 years.
Contact SellerGrade 12 McGraw-Hill Ryerson Calculus & Advanced Functions textbook used for only 1 year.
Contact SellerThe user did not leave a description.
Contact SellerPearson standard Grade 9 science textbook still in packaging.
Contact SellerMcGraw-Hill Ryerson Principles of Mathematics 10. BEST DEAL YOU WILL FIND OUT THERE; MUST BUY!!!
Contact Seller


The talent of tomorrow is learning differently today. Show your completed online courses and projects and get discovered by employers who are looking for your skill set.
Millions of students around the world get valuable learning and experience apart from traditional educational institution. We want to make sure these investments are recognized.
Just input the skills you need for a position and we provide the most relevant candidates. See mastered skills, project portfolio, all tailored for your needs.
See which candidates companies are hiring, which skills those candidates have, and which online courses help build those skills.


I began learning the guitar at 8 years of age when I received a small-body guitar for my birthday. Music has been a passion of mine ever since. One of my favourite aspects of music is that since I began gigging in Transition Year(after many years of busking and playing open-mic nights) it has given me the opportunity to visit many new locations, some in the general locality and some further afield including Castletown, Co.Louth and . I feel that Irish natives, myself included, often take for granted the natural beauty of our country with spots such as the Giant's Causeway a world-renowned destination.
From a young age, I have been fortunate enough to have been given the opportunity to see many corners of the world, through travelling with my family each summer. My father's job requires that he travels to various global locations on a frequent basis, therefore we often travelled with him during the summer's visiting locations in France, USA and even Australia. I relish these trips and find that as a result of having travelled during my childhood I have a better understanding of other cultures and it also helped me with studying French in school!


Saving a Session
After you run queries, you can save information from that session for future use. When you save sessions, Caliper records the following information:
• your application’s total quality score
• the quality score for each item
• the values of any weights that you edited
• the values of any threshold queries that you edited
Session information is stored as a group in a directory specified in the Group path.
The first time that you run queries, Caliper automatically saves the information in a session called default_run, unless you save the session with a different name.
Groups and status attributes for individual instances, however, are persistent from session to session. Any groups that you create while in that session appear in the Group Manager and remain until you delete them. Status attributes remain set until the information model is replaced with a new version.
Caliper does not save input information (the modules you ran queries on), so it is best to give your sessions descriptive names. Session names should not include special characters or spaces. Caliper flattens session names when saving; so avoid using case to distinguish sessions.
Related Topics


Review - Rippleside Terrace Tarneit Victoria 3029
Check out Charles & Dawn's review, feedback and testimonial from Tarneit for Innovative Verandahs
Name: Charles and Dawn Address: Rippleside Terrace Tarneit, Melbourne Victoria 3029 Review: 10 out of 10
1. How did you hear about Innovative Verandahs? Through the Internet via Hipages
2. How did you find the first consultation? The first consultation went really well. I met up with Shane and we spoke about what I intend to do in terms of erecting a pergola. He listened and then provided me with some suggestions as well as answered all my queries. I felt comfortable with him as he was knowledgeable and considered some options which would better suit our needs. He wasn’t pushy by forcing a sale but gave me time to think and get back to him.
3. What made you choose Innovative Verandahs? Having previously dealt with another company and having our plans knocked back and our deposit forfeited, Shane gave me the assurance that he would get all the necessary permits organized and in the event that the permits fell through, he would refund us our deposit. This assurance made me go with Innovative Verandahs.
4.How did you find the permit process? Were you kept informed? The permit process was rather lengthy, however, I knew that this was beyond the control of Innovative Verandahs. Shane kept in regular contact with me via e-mails and telephone calls to keep me posted on any updates he received from the council.
5. How did you find the Innovative Verandah team? The team from Innovative Verandahs were friendly, especially the 2 guys James and Josh who carried the work were punctual, efficient and carried out their tasks in a diligent manner. I can say the same for the out sourced electrician Ronnie as well.
6. Was your premises looked after by our team? Yes they were. The guys cleaned up each day after their work. They took extra care whilst moving materials in and out of our home.
7. Were you happy with the finished result? Did it meet all your expectations? Yes. Both my wife and I were extremely pleased with the end product. It did not meet our expectations. It exceeded our expectations.
8. Did you receive all your permit information and final certificates? Did you receive your warranty card? Yes we did. Shane called in one day and handed in a folder which contained all the permits, plans and documents. We also received the warranty card after the job was done.
9. What is the best thing you like about your verandah? The attention to detail and the workmanship.
10. How would you rate the Stratco material? A very good and durable product.
11. How would you rate your experience with Innovative Verandahs out of 10? A 10 out of 10
12. How likely are you to recommend Innovate Verandahs out of 10? Very certain about that. Another 10 out of 10.
Service installed by Innovative Verandahs:
Stratco Cooldek installationVisit Innovative Verandahs Social sites:
Check out INNOVATIVE VERANDAHS quality products from an AUTHORISED STRATCO DEALER in MELBOURNE


{# ## This file is part of Flask-OAuth2Server ## Copyright (C) 2014 CERN. ## ## Flask-OAuth2Server is free software; you can redistribute it and/or ## modify it under the terms of the Revised BSD License; see LICENSE ## file for more details. #} {%- import "accounts/settings/helpers.html" as helpers with context %} {% extends "page.html" %} {% block body %}


Gecode::Int::Linear Namespace Reference
Detailed Description
Linear propagators
Classes | |
| class | SupportSet |
| Set for support information. More... | |
| class | SupportIter |
| Base-class for support-based iterator. More... | |
| class | PosSupportIter |
| Support-based iterator for positive view. More... | |
| class | NegSupportIter |
| Support-based iterator for negative view. More... | |
| class | NoView |
| No view serves as filler for empty view arrays. More... | |
| class | TermLess |
| Sort linear terms by view. More... | |
| class | LinBin |
| Base-class for binary linear propagators. More... | |
| class | ReLinBin |
| Base-class for reified binary linear propagators. More... | |
| class | EqBin |
| Propagator for bounds consistent binary linear equality More... | |
| class | ReEqBin |
| Propagator for reified bounds consistent binary linear equality More... | |
| class | NqBin |
| Propagator for bounds consistent binary linear disequality More... | |
| class | LqBin |
| Propagator for bounds consistent binary linear less or equal More... | |
| class | GqBin |
| Propagator for bounds consistent binary linear greater or equal More... | |
| class | ReLqBin |
| Propagator for reified bounds consistent binary linear less or equal More... | |
| class | LinTer |
| Base-class for ternary linear propagators. More... | |
| class | EqTer |
| Propagator for bounds consistent ternary linear equality More... | |
| class | NqTer |
| Propagator for bounds consistent ternary linear disquality More... | |
| class | LqTer |
| Propagator for bounds consistent ternary linear less or equal More... | |
| class | Lin |
| Base-class for n-ary linear propagators. More... | |
| class | ReLin |
| Base-class for reified n-ary linear propagators. More... | |
| class | Eq |
| Propagator for bounds consistent n-ary linear equality More... | |
| class | DomEq |
| Propagator for domain consistent n-ary linear equality More... | |
| class | ReEq |
| Propagator for reified bounds consistent n-ary linear equality More... | |
| class | Nq |
| Propagator for bounds consistent n-ary linear disequality More... | |
| class | Lq |
| Propagator for bounds consistent n-ary linear less or equal More... | |
| class | ReLq |
| Propagator for reified bounds consistent n-ary linear less or equal More... | |
| class | MemoryLinBoolInt |
| Baseclass for integer Boolean sum using dependencies. More... | |
| class | SpeedLinBoolInt |
| Baseclass for integer Boolean sum using advisors. More... | |
| class | EqBoolInt |
| Propagator for integer equal to Boolean sum (cardinality) More... | |
| class | GqBoolInt |
| Propagator for integer less or equal to Boolean sum (cardinality) More... | |
| class | NqBoolInt |
| Propagator for integer disequal to Boolean sum (cardinality) More... | |
| class | LinBoolView |
| Base-class for Boolean linear propagators. More... | |
| class | ReLinBoolView |
| Base-class for reified Boolean linear propagators. More... | |
| class | EqBoolView |
| Propagator for equality to Boolean sum (cardinality) More... | |
| class | NqBoolView |
| Propagator for disequality to Boolean sum (cardinality) More... | |
| class | GqBoolView |
| Propagator for greater or equal to Boolean sum (cardinality) More... | |
| class | ReEqBoolView |
| Propagator for reified equality to Boolean sum (cardinality) More... | |
| class | ReGqBoolView |
| Propagator for reified greater or equal to Boolean sum (cardinality) More... | |
| class | ScaleBool |
| Coefficient and Boolean view. More... | |
| class | ScaleBoolArray |
| Array of scale Boolean views. More... | |
| class | EmptyScaleBoolArray |
| Empty array of scale Boolean views. More... | |
| class | LinBoolScale |
| Base class for linear Boolean constraints with coefficients. More... | |
| class | EqBoolScale |
| Propagator for equality to Boolean sum with coefficients More... | |
| class | LqBoolScale |
| Propagator for inequality to Boolean sum with coefficients More... | |
| class | NqBoolScale |
| Propagator for disequality to Boolean sum with coefficients More... | |
| class | Term |
| Class for describing linear term . More... | |
Enumerations | |
| enum | BinMod { BM_X0_MIN = 1<<0, BM_X0_MAX = 1<<1, BM_X1_MIN = 1<<2, BM_X1_MAX = 1<<3, BM_ALL = BM_X0_MIN|BM_X0_MAX|BM_X1_MIN|BM_X1_MAX } |
| Describe which view has been modified how. More... | |
| enum | TerMod { TM_X0_MIN = 1<<0, TM_X0_MAX = 1<<1, TM_X1_MIN = 1<<2, TM_X1_MAX = 1<<3, TM_X2_MIN = 1<<4, TM_X2_MAX = 1<<5, TM_ALL = TM_X0_MIN|TM_X0_MAX|TM_X1_MIN|TM_X1_MAX|TM_X2_MIN|TM_X2_MAX } |
| Describe which view has been modified how. More... | |
Functions | |
| void | post_pos_unit (Space *home, Term< BoolView > *t_p, int n_p, IntRelType r, IntView y, int c, PropKind) |
| void | post_pos_unit (Space *home, Term< BoolView > *t_p, int n_p, IntRelType r, ZeroIntView, int c, PropKind pk) |
| void | post_neg_unit (Space *home, Term< BoolView > *t_n, int n_n, IntRelType r, IntView y, int c, PropKind) |
| void | post_neg_unit (Space *home, Term< BoolView > *t_n, int n_n, IntRelType r, ZeroIntView, int c, PropKind pk) |
| void | post_mixed (Space *home, Term< BoolView > *t_p, int n_p, Term< BoolView > *t_n, int n_n, IntRelType r, IntView y, int c) |
| void | post_mixed (Space *home, Term< BoolView > *t_p, int n_p, Term< BoolView > *t_n, int n_n, IntRelType r, ZeroIntView y, int c) |
| template<class View> | |
| void | post_all (Space *home, Term< BoolView > *t, int n, IntRelType r, View x, int c, PropKind pk) |
| void | post (Space *home, Term< BoolView > *t, int n, IntRelType r, IntView y, int c=0, IntConLevel=ICL_DEF, PropKind=PK_DEF) |
| Post propagator for linear constraint over Booleans. | |
| void | post (Space *home, Term< BoolView > *t, int n, IntRelType r, int c, IntConLevel=ICL_DEF, PropKind=PK_DEF) |
| Post propagator for linear constraint over Booleans. | |
| void | post (Space *home, Term< BoolView > *t, int n, IntRelType r, IntView y, BoolView b, IntConLevel=ICL_DEF, PropKind=PK_DEF) |
| Post propagator for reified linear constraint over Booleans. | |
| void | post (Space *home, Term< BoolView > *t, int n, IntRelType r, int c, BoolView b, IntConLevel=ICL_DEF, PropKind=PK_DEF) |
| Post propagator for reified linear constraint over Booleans. | |
| template<class P, class N> | |
| bool | isunit (ViewArray< P > &, ViewArray< N > &) |
| Test if only unit-coefficient arrays used. | |
| template<> | |
| bool | isunit (ViewArray< IntView > &, ViewArray< IntView > &) |
| template<> | |
| bool | isunit (ViewArray< IntView > &, ViewArray< NoView > &) |
| template<> | |
| bool | isunit (ViewArray< NoView > &, ViewArray< IntView > &) |
| template<class Val, class View> | |
| void | bounds_p (ModEventDelta med, ViewArray< View > &x, Val &c, Val &sl, Val &su) |
| template<class Val, class View> | |
| void | bounds_n (ModEventDelta med, ViewArray< View > &y, Val &c, Val &sl, Val &su) |
| template<class Val, class P, class N> | |
| ExecStatus | prop_bnd (Space *home, ModEventDelta med, Propagator *p, ViewArray< P > &x, ViewArray< N > &y, Val &c) |
| template<class Val, class P, class N> | |
| Actor * | eqtobin (Space *, bool, Propagator &, ViewArray< P > &, ViewArray< N > &, Val) |
| Rewriting of equality to binary propagators. | |
| template<class Val> | |
| Actor * | eqtobin (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< NoView > &, Val c) |
| template<class Val> | |
| Actor * | eqtobin (Space *home, bool share, Propagator &p, ViewArray< NoView > &, ViewArray< IntView > &y, Val c) |
| template<class Val> | |
| Actor * | eqtobin (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< IntView > &y, Val c) |
| template<class Val, class P, class N> | |
| Actor * | eqtoter (Space *, bool, Propagator &, ViewArray< P > &, ViewArray< N > &, Val) |
| Rewriting of equality to ternary propagators. | |
| template<class Val> | |
| Actor * | eqtoter (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< NoView > &, Val c) |
| template<class Val> | |
| Actor * | eqtoter (Space *home, bool share, Propagator &p, ViewArray< NoView > &, ViewArray< IntView > &y, Val c) |
| template<class Val> | |
| Actor * | eqtoter (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< IntView > &y, Val c) |
| template<class Val, class P, class N> | |
| Actor * | nqtobin (Space *, bool, Propagator &, ViewArray< P > &, ViewArray< N > &, Val) |
| Rewriting of disequality to binary propagators. | |
| template<class Val> | |
| Actor * | nqtobin (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< NoView > &, Val c) |
| template<class Val> | |
| Actor * | nqtobin (Space *home, bool share, Propagator &p, ViewArray< NoView > &, ViewArray< IntView > &y, Val c) |
| template<class Val> | |
| Actor * | nqtobin (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< IntView > &y, Val c) |
| template<class Val, class P, class N> | |
| Actor * | nqtoter (Space *, bool, Propagator &, ViewArray< P > &, ViewArray< N > &, Val) |
| Rewriting of disequality to ternary propagators. | |
| template<class Val> | |
| Actor * | nqtoter (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< NoView > &, Val c) |
| template<class Val> | |
| Actor * | nqtoter (Space *home, bool share, Propagator &p, ViewArray< NoView > &, ViewArray< IntView > &y, Val c) |
| template<class Val> | |
| Actor * | nqtoter (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< IntView > &y, Val c) |
| template<class Val, class P, class N> | |
| Actor * | lqtobin (Space *, bool, Propagator &, ViewArray< P > &, ViewArray< N > &, Val) |
| Rewriting of inequality to binary propagators. | |
| template<class Val> | |
| Actor * | lqtobin (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< NoView > &, Val c) |
| template<class Val> | |
| Actor * | lqtobin (Space *home, bool share, Propagator &p, ViewArray< NoView > &, ViewArray< IntView > &y, Val c) |
| template<class Val> | |
| Actor * | lqtobin (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< IntView > &y, Val c) |
| template<class Val, class P, class N> | |
| Actor * | lqtoter (Space *, bool, Propagator &, ViewArray< P > &, ViewArray< N > &, Val) |
| Rewriting of inequality to ternary propagators. | |
| template<class Val> | |
| Actor * | lqtoter (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< NoView > &, Val c) |
| template<class Val> | |
| Actor * | lqtoter (Space *home, bool share, Propagator &p, ViewArray< NoView > &, ViewArray< IntView > &y, Val c) |
| template<class Val> | |
| Actor * | lqtoter (Space *home, bool share, Propagator &p, ViewArray< IntView > &x, ViewArray< IntView > &y, Val c) |
| void | eliminate (Term< IntView > *t, int &n, double &d) |
| Eliminate assigned views. | |
| void | rewrite (IntRelType &r, double &d, Term< IntView > *&t_p, int &n_p, Term< IntView > *&t_n, int &n_n) |
| Rewrite all inequations in terms of IRT_LQ. | |
| bool | precision (Term< IntView > *t_p, int n_p, Term< IntView > *t_n, int n_n, double d) |
| Decide the required precision and check for overflow. | |
| template<class Val, class View> | |
| void | post_nary (Space *home, ViewArray< View > &x, ViewArray< View > &y, IntRelType r, Val c) |
| Posting n-ary propagators. | |
| void | post (Space *home, Term< IntView > *t, int n, IntRelType r, int c, IntConLevel=ICL_DEF, PropKind pk=PK_DEF) |
| Post propagator for linear constraint over integers. | |
| template<class Val, class View> | |
| void | post_nary (Space *home, ViewArray< View > &x, ViewArray< View > &y, IntRelType r, Val c, BoolView b) |
| Posting reified n-ary propagators. | |
| void | post (Space *home, Term< IntView > *t, int n, IntRelType r, int c, BoolView b, IntConLevel=ICL_DEF, PropKind pk=PK_DEF) |
| Post reified propagator for linear constraint. | |
| template<class View> | |
| void | estimate (Term< View > *t, int n, int c, int &l, int &u) |
| Estimate lower and upper bounds. | |
| template<class View> | |
| bool | normalize (Term< View > *t, int &n, Term< View > *&t_p, int &n_p, Term< View > *&t_n, int &n_n) |
| Normalize linear integer constraints. | |
Variables | |
| const double | double_max =<PHONE_NUMBER>740991.0 |
| Largest double that can exactly be represented. | |
| const double | double_min = -9007199254740991.0 |
| Smallest double that can exactly be represented. |
Enumeration Type Documentation
Function Documentation
| void Gecode::Int::Linear::post_pos_unit | ( | Space * | home, | |
| Term< BoolView > * | t_p, | |||
| int | n_p, | |||
| IntRelType | r, | |||
| IntView | y, | |||
| int | c, | |||
| PropKind | ||||
| ) |
Definition at line 43 of file bool-post.cc.
| void Gecode::Int::Linear::post_pos_unit | ( | Space * | home, | |
| Term< BoolView > * | t_p, | |||
| int | n_p, | |||
| IntRelType | r, | |||
| ZeroIntView | , | |||
| int | c, | |||
| PropKind | pk | |||
| ) |
Definition at line 90 of file bool-post.cc.
| void Gecode::Int::Linear::post_neg_unit | ( | Space * | home, | |
| Term< BoolView > * | t_n, | |||
| int | n_n, | |||
| IntRelType | r, | |||
| IntView | y, | |||
| int | c, | |||
| PropKind | ||||
| ) |
Definition at line 132 of file bool-post.cc.
| void Gecode::Int::Linear::post_neg_unit | ( | Space * | home, | |
| Term< BoolView > * | t_n, | |||
| int | n_n, | |||
| IntRelType | r, | |||
| ZeroIntView | , | |||
| int | c, | |||
| PropKind | pk | |||
| ) |
Definition at line 181 of file bool-post.cc.
| void Gecode::Int::Linear::post_mixed | ( | Space * | home, | |
| Term< BoolView > * | t_p, | |||
| int | n_p, | |||
| Term< BoolView > * | t_n, | |||
| int | n_n, | |||
| IntRelType | r, | |||
| IntView | y, | |||
| int | c | |||
| ) |
Definition at line 224 of file bool-post.cc.
| void Gecode::Int::Linear::post_mixed | ( | Space * | home, | |
| Term< BoolView > * | t_p, | |||
| int | n_p, | |||
| Term< BoolView > * | t_n, | |||
| int | n_n, | |||
| IntRelType | r, | |||
| ZeroIntView | y, | |||
| int | c | |||
| ) |
Definition at line 273 of file bool-post.cc.
| void Gecode::Int::Linear::post_all | ( | Space * | home, | |
| Term< BoolView > * | t, | |||
| int | n, | |||
| IntRelType | r, | |||
| View | x, | |||
| int | c, | |||
| PropKind | pk | |||
| ) | [inline] |
| bool Gecode::Int::Linear::isunit | ( | ViewArray< P > & | , | |
| ViewArray< N > & | ||||
| ) | [inline] |
| bool Gecode::Int::Linear::isunit | ( | ViewArray< IntView > & | , | |
| ViewArray< IntView > & | ||||
| ) | [inline] |
Definition at line 51 of file int-nary.icc.
| bool Gecode::Int::Linear::isunit | ( | ViewArray< IntView > & | , | |
| ViewArray< NoView > & | ||||
| ) | [inline] |
Definition at line 54 of file int-nary.icc.
| bool Gecode::Int::Linear::isunit | ( | ViewArray< NoView > & | , | |
| ViewArray< IntView > & | ||||
| ) | [inline] |
Definition at line 57 of file int-nary.icc.
| void Gecode::Int::Linear::bounds_p | ( | ModEventDelta | med, | |
| ViewArray< View > & | x, | |||
| Val & | c, | |||
| Val & | sl, | |||
| Val & | su | |||
| ) | [related] |
Definition at line 152 of file int-nary.icc.
| void Gecode::Int::Linear::bounds_n | ( | ModEventDelta | med, | |
| ViewArray< View > & | y, | |||
| Val & | c, | |||
| Val & | sl, | |||
| Val & | su | |||
| ) | [related] |
Definition at line 173 of file int-nary.icc.
| ExecStatus Gecode::Int::Linear::prop_bnd | ( | Space * | home, | |
| ModEventDelta | med, | |||
| Propagator * | p, | |||
| ViewArray< P > & | x, | |||
| ViewArray< N > & | y, | |||
| Val & | c | |||
| ) | [inline] |
Definition at line 195 of file int-nary.icc.
| Actor* Gecode::Int::Linear::eqtobin | ( | Space * | , | |
| bool | , | |||
| Propagator & | , | |||
| ViewArray< P > & | , | |||
| ViewArray< N > & | , | |||
| Val | ||||
| ) | [inline] |
| Actor* Gecode::Int::Linear::eqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< NoView > & | , | |||
| Val | c | |||
| ) | [inline] |
Definition at line 321 of file int-nary.icc.
| Actor* Gecode::Int::Linear::eqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< NoView > & | , | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 329 of file int-nary.icc.
| Actor* Gecode::Int::Linear::eqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 337 of file int-nary.icc.
| Actor* Gecode::Int::Linear::eqtoter | ( | Space * | , | |
| bool | , | |||
| Propagator & | , | |||
| ViewArray< P > & | , | |||
| ViewArray< N > & | , | |||
| Val | ||||
| ) | [inline] |
| Actor* Gecode::Int::Linear::eqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< NoView > & | , | |||
| Val | c | |||
| ) | [inline] |
Definition at line 360 of file int-nary.icc.
| Actor* Gecode::Int::Linear::eqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< NoView > & | , | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 368 of file int-nary.icc.
| Actor* Gecode::Int::Linear::eqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 376 of file int-nary.icc.
| Actor* Gecode::Int::Linear::nqtobin | ( | Space * | , | |
| bool | , | |||
| Propagator & | , | |||
| ViewArray< P > & | , | |||
| ViewArray< N > & | , | |||
| Val | ||||
| ) | [inline] |
| Actor* Gecode::Int::Linear::nqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< NoView > & | , | |||
| Val | c | |||
| ) | [inline] |
Definition at line 563 of file int-nary.icc.
| Actor* Gecode::Int::Linear::nqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< NoView > & | , | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 571 of file int-nary.icc.
| Actor* Gecode::Int::Linear::nqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 579 of file int-nary.icc.
| Actor* Gecode::Int::Linear::nqtoter | ( | Space * | , | |
| bool | , | |||
| Propagator & | , | |||
| ViewArray< P > & | , | |||
| ViewArray< N > & | , | |||
| Val | ||||
| ) | [inline] |
| Actor* Gecode::Int::Linear::nqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< NoView > & | , | |||
| Val | c | |||
| ) | [inline] |
Definition at line 602 of file int-nary.icc.
| Actor* Gecode::Int::Linear::nqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< NoView > & | , | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 610 of file int-nary.icc.
| Actor* Gecode::Int::Linear::nqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 618 of file int-nary.icc.
| Actor* Gecode::Int::Linear::lqtobin | ( | Space * | , | |
| bool | , | |||
| Propagator & | , | |||
| ViewArray< P > & | , | |||
| ViewArray< N > & | , | |||
| Val | ||||
| ) | [inline] |
| Actor* Gecode::Int::Linear::lqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< NoView > & | , | |||
| Val | c | |||
| ) | [inline] |
Definition at line 735 of file int-nary.icc.
| Actor* Gecode::Int::Linear::lqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< NoView > & | , | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 743 of file int-nary.icc.
| Actor* Gecode::Int::Linear::lqtobin | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 751 of file int-nary.icc.
| Actor* Gecode::Int::Linear::lqtoter | ( | Space * | , | |
| bool | , | |||
| Propagator & | , | |||
| ViewArray< P > & | , | |||
| ViewArray< N > & | , | |||
| Val | ||||
| ) | [inline] |
| Actor* Gecode::Int::Linear::lqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< NoView > & | , | |||
| Val | c | |||
| ) | [inline] |
Definition at line 774 of file int-nary.icc.
| Actor* Gecode::Int::Linear::lqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< NoView > & | , | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 782 of file int-nary.icc.
| Actor* Gecode::Int::Linear::lqtoter | ( | Space * | home, | |
| bool | share, | |||
| Propagator & | p, | |||
| ViewArray< IntView > & | x, | |||
| ViewArray< IntView > & | y, | |||
| Val | c | |||
| ) | [inline] |
Definition at line 790 of file int-nary.icc.
| void Gecode::Int::Linear::eliminate | ( | Term< IntView > * | t, | |
| int & | n, | |||
| double & | d | |||
| ) | [inline] |
| void Gecode::Int::Linear::rewrite | ( | IntRelType & | r, | |
| double & | d, | |||
| Term< IntView > *& | t_p, | |||
| int & | n_p, | |||
| Term< IntView > *& | t_n, | |||
| int & | n_n | |||
| ) | [inline] |
| bool Gecode::Int::Linear::precision | ( | Term< IntView > * | t_p, | |
| int | n_p, | |||
| Term< IntView > * | t_n, | |||
| int | n_n, | |||
| double | d | |||
| ) | [inline] |
| void Gecode::Int::Linear::post_nary | ( | Space * | home, | |
| ViewArray< View > & | x, | |||
| ViewArray< View > & | y, | |||
| IntRelType | r, | |||
| Val | c | |||
| ) | [inline] |
| void Gecode::Int::Linear::post_nary | ( | Space * | home, | |
| ViewArray< View > & | x, | |||
| ViewArray< View > & | y, | |||
| IntRelType | r, | |||
| Val | c, | |||
| BoolView | b | |||
| ) | [inline] |
| void Gecode::Int::Linear::estimate | ( | Term< View > * | t, | |
| int | n, | |||
| int | c, | |||
| int & | l, | |||
| int & | u | |||
| ) | [inline] |
Estimate lower and upper bounds.
Estimates the boundaries for a linear expression . If the boundaries exceed the limits as defined in Limits::Int, these boundaries are returned.
- Parameters:
-
t array of linear terms n size of array c constant l lower bound u upper bound
| bool Gecode::Int::Linear::normalize | ( | Term< View > * | t, | |
| int & | n, | |||
| Term< View > *& | t_p, | |||
| int & | n_p, | |||
| Term< View > *& | t_n, | |||
| int & | n_n | |||
| ) | [inline] |
Normalize linear integer constraints.
- Parameters:
-
t array of linear terms n size of array t_p array of linear terms over integers with positive coefficients n_p number of postive terms t_n array of linear terms over integers with negative coefficients n_n number of negative terms
- Variables occuring multiply in the term array are replaced by a single occurence: for example, becomes .
- If in the above simplification the value for (or for and ) exceeds the limits for integers as defined in Limits::Int, an exception of type Int::NumericalOverflow is thrown.
Returns true, if all coefficients are unit coefficients
Variable Documentation
| const double Gecode::Int::Linear::double_max =<PHONE_NUMBER>740991.0 |
| const double Gecode::Int::Linear::double_min = -9007199254740991.0 |


Delete this project, are you sure?
This will IRREVERSIBLY DESTROY all data related to the project {{ project.name }}.
Are you sure you want to do this?


Consumer Watch: What Consumer Act says about sales of ‘old’ cars | IOL News
It’s a story with which many car owners are familiar: you buy a second-hand vehicle, it breaks down, requires repairs - repeatedly - but it’s still not in fine working order and the dealership obstinately refuses to cancel the deal.
So you take up the matter with the head office, trusting they will move swiftly to protect the brand’s good name. Only thing is, even if they make some attempt at damage control, dealerships can pretty much do as they please, flouting the Consumer Protection Act (CPA). And often, they get away with it.
Heidene Lawrence says she’s tried everything for the past five months to cancel the deal on the 2011 “service-approved” Corsa that she bought from the Weltevreden Park Hyundai dealership on July 13 this year. Since then, it’s broken down five times - twice on the Johannesburg roadside, endangering her family’s lives. The dealership has attempted to fix the vehicle’s problems but refuses to cancel the deal.
It seems dealerships can pretty much do as they please, flouting the Consumer Protection Act (CPA). And often, they get away with it.
Lawrence has been presented with three options of other cars - all more expensive and outside her budget, which is a violation of the National Credit Act’s affordability guidelines.


|
CUTLASS
CUDA Templates for Linear Algebra Subroutines and Solvers
|
Template based on element size (in bits) - defined in terms of pitch-linear memory.
#include <tensor_op_multiplicand_sm70.h>
Public Types | |
| using | Index = int32_t |
| Index type used for coordinates. More... | |
| using | LongIndex = int64_t |
| Long index type used for offsets. More... | |
| using | TensorCoord = PitchLinearCoord |
| Logical coordinate. More... | |
| using | Stride = Coord< kStrideRank, Index, LongIndex > |
| Stride vector. More... | |
| using | TileShape = PitchLinearShape< 8, 4 > |
| Fundamental tile shape in units of vectors. More... | |
| using | PartitionShape = PitchLinearShape< 8, 2 > |
| Fundamental partition shape in units of vectors. More... | |
| using | PartitionCount = PitchLinearShape< TileShape::kContiguous/PartitionShape::kContiguous, TileShape::kStrided/PartitionShape::kStrided > |
| using | AccessCount = PitchLinearShape< PartitionShape::kContiguous, PartitionShape::kStrided > |
Public Member Functions | |
| CUTLASS_HOST_DEVICE | VoltaTensorOpMultiplicandCongruous (Index ldm=0) |
| Ctor. More... | |
| CUTLASS_HOST_DEVICE | VoltaTensorOpMultiplicandCongruous (Stride stride) |
| Ctor. More... | |
| CUTLASS_HOST_DEVICE LongIndex | operator() (TensorCoord const &coord) const |
| CUTLASS_HOST_DEVICE Stride | stride () const |
| Returns the stride of the layout. More... | |
| CUTLASS_HOST_DEVICE Stride & | stride () |
| Returns the stride of the layout. More... | |
| CUTLASS_HOST_DEVICE LongIndex | capacity (TensorCoord const &extent) const |
| Compute the number of contiguous elements needed to store a tensor with the given size. More... | |
Static Public Member Functions | |
| static CUTLASS_HOST_DEVICE VoltaTensorOpMultiplicandCongruous | packed (TensorCoord const &extent) |
| Helper returns a layout to a tightly packed tensor. More... | |
Static Public Attributes | |
| static int const | kRank = 2 |
| Logical rank of tensor. More... | |
| static int const | kStrideRank = 1 |
| Rank of stride vector. More... | |
| static int const | kAccessSize = 128 |
| This layout is optimized for 128b accesses. More... | |
| static int const | kElementSize = ElementSize |
| static int const | kElementsPerAccess = kAccessSize / kElementSize |
| using cutlass::layout::VoltaTensorOpMultiplicandCongruous< ElementSize >::AccessCount = PitchLinearShape< PartitionShape::kContiguous, PartitionShape::kStrided > |
| using cutlass::layout::VoltaTensorOpMultiplicandCongruous< ElementSize >::Index = int32_t |
| using cutlass::layout::VoltaTensorOpMultiplicandCongruous< ElementSize >::LongIndex = int64_t |
| using cutlass::layout::VoltaTensorOpMultiplicandCongruous< ElementSize >::PartitionShape = PitchLinearShape<8, 2> |
| using cutlass::layout::VoltaTensorOpMultiplicandCongruous< ElementSize >::Stride = Coord<kStrideRank, Index, LongIndex> |
| using cutlass::layout::VoltaTensorOpMultiplicandCongruous< ElementSize >::TensorCoord = PitchLinearCoord |
| using cutlass::layout::VoltaTensorOpMultiplicandCongruous< ElementSize >::TileShape = PitchLinearShape<8, 4> |
|
inline |
|
inline |
|
inline |
|
inline |
Returns the offset of a coordinate in linear memory. Assumes coordinate has convention (contiguous, strided)
|
inlinestatic |
|
inline |
|
inline |
|
static |
|
static |
|
static |
|
static |
|
static |


virus microarray DNA probes used sequence detection viral sequencing probe sequences signal {border-style using identification px;} #ffffff;} disease viruses conserved human method based pathogen respiratory diagnostic identified nucleic data methods microbial clinical samples chip coronavirus number PCR acid diagnosis different new oligonucleotide techniques amplification array cell control developed diseases gene genus hybridization intensity microbes virus, analysis molecular px; specific {font-family (Wang Microarray chips cutoff designing font-size genes like pathogens target technology Infect animal bovine computational design double; expression identify large microarrays prediction presence random rapid single strategy thousands use Identification Viral Wang [], approaches background bioinformatics border-color border-width chain defined designed environmental genome group host huge identifying infectious influenza known livestock making mouth next-generation nucleotide possible present sample selected sensitive software solid; species swine technique vesicular {font-style {font-weight Â°C (Gardner Clin However, PCR, RNA Virus Yadav approach biology bold chip, collected courier; culture database deep detect detecting diagnostics discovery effective em; emerging fluorescent foot future genomes health laboratory length lesions log metagenomics microarray, nasal novel numbers porcine positive probes. protein pt;} real-time recent reported rinderpest set similar specificity study threshold unknown viruses,


Porting MicroPython¶
The MicroPython project contains several ports to different microcontroller families and architectures. The project repository has a ports directory containing a subdirectory for each supported port.
A port will typically contain definitions for multiple “boards”, each of which is a specific piece of hardware that that port can run on, e.g. a development kit or device.
The minimal port is available as a simplified reference implementation of a MicroPython port. It can run on both the host system and an STM32F4xx MCU.
In general, starting a port requires:
Setting up the toolchain (configuring Makefiles, etc).
Implementing boot configuration and CPU initialization.
Initialising basic drivers required for development and debugging (e.g. GPIO, UART).
Performing the board-specific configurations.
Implementing the port-specific modules.
Minimal MicroPython firmware¶
The best way to start porting MicroPython to a new board is by integrating a minimal
MicroPython interpreter. For this walkthrough, create a subdirectory for the new
port in the ports
directory:
$ cd ports
$ mkdir example_port
The basic MicroPython firmware is implemented in the main port file, e.g main.c
:
#include "py/compile.h"
#include "py/gc.h"
#include "py/mperrno.h"
#include "py/stackctrl.h"
#include "shared/runtime/gchelper.h"
#include "shared/runtime/pyexec.h"
// Allocate memory for the MicroPython GC heap.
static char heap[4096];
int main(int argc, char **argv) {
// Initialise the MicroPython runtime.
mp_stack_ctrl_init();
gc_init(heap, heap + sizeof(heap));
mp_init();
mp_obj_list_init(MP_OBJ_TO_PTR(mp_sys_path), 0);
mp_obj_list_init(MP_OBJ_TO_PTR(mp_sys_argv), 0);
// Start a normal REPL; will exit when ctrl-D is entered on a blank line.
pyexec_friendly_repl();
// Deinitialise the runtime.
gc_sweep_all();
mp_deinit();
return 0;
}
// Handle uncaught exceptions (should never be reached in a correct C implementation).
void nlr_jump_fail(void *val) {
for (;;) {
}
}
// Do a garbage collection cycle.
void gc_collect(void) {
gc_collect_start();
gc_helper_collect_regs_and_stack();
gc_collect_end();
}
// There is no filesystem so stat'ing returns nothing.
mp_import_stat_t mp_import_stat(const char *path) {
return MP_IMPORT_STAT_NO_EXIST;
}
// There is no filesystem so opening a file raises an exception.
mp_lexer_t *mp_lexer_new_from_file(const char *filename) {
mp_raise_OSError(MP_ENOENT);
}
We also need a Makefile at this point for the port:
# Include the core environment definitions; this will set $(TOP).
include ../../py/mkenv.mk
# Include py core make definitions.
include $(TOP)/py/py.mk
# Set CFLAGS and libraries.
CFLAGS = -I. -I$(BUILD) -I$(TOP)
LIBS = -lm
# Define the required source files.
SRC_C = \
main.c \
mphalport.c \
shared/readline/readline.c \
shared/runtime/gchelper_generic.c \
shared/runtime/pyexec.c \
shared/runtime/stdout_helpers.c \
# Define the required object files.
OBJ = $(PY_CORE_O) $(addprefix $(BUILD)/, $(SRC_C:.c=.o))
# Define the top-level target, the main firmware.
all: $(BUILD)/firmware.elf
# Define how to build the firmware.
$(BUILD)/firmware.elf: $(OBJ)
$(ECHO) "LINK $@"
$(Q)$(CC) $(LDFLAGS) -o $@ $^ $(LIBS)
$(Q)$(SIZE) $@
# Include remaining core make rules.
include $(TOP)/py/mkrules.mk
Remember to use proper tabs to indent the Makefile.
MicroPython Configurations¶
After integrating the minimal code above, the next step is to create the MicroPython
configuration files for the port. The compile-time configurations are specified in
mpconfigport.h
and additional hardware-abstraction functions, such as time keeping,
in mphalport.h
.
The following is an example of an mpconfigport.h
file:
#include <stdint.h>
// Python internal features.
#define MICROPY_ENABLE_GC (1)
#define MICROPY_HELPER_REPL (1)
#define MICROPY_ERROR_REPORTING (MICROPY_ERROR_REPORTING_TERSE)
#define MICROPY_FLOAT_IMPL (MICROPY_FLOAT_IMPL_FLOAT)
// Fine control over Python builtins, classes, modules, etc.
#define MICROPY_PY_ASYNC_AWAIT (0)
#define MICROPY_PY_BUILTINS_SET (0)
#define MICROPY_PY_ATTRTUPLE (0)
#define MICROPY_PY_COLLECTIONS (0)
#define MICROPY_PY_MATH (0)
#define MICROPY_PY_IO (0)
#define MICROPY_PY_STRUCT (0)
// Type definitions for the specific machine.
typedef intptr_t mp_int_t; // must be pointer size
typedef uintptr_t mp_uint_t; // must be pointer size
typedef long mp_off_t;
// We need to provide a declaration/definition of alloca().
#include <alloca.h>
// Define the port's name and hardware.
#define MICROPY_HW_BOARD_NAME "example-board"
#define MICROPY_HW_MCU_NAME "unknown-cpu"
#define MP_STATE_PORT MP_STATE_VM
#define MICROPY_PORT_ROOT_POINTERS \
const char *readline_hist[8];
This configuration file contains machine-specific configurations including aspects like if different
MicroPython features should be enabled e.g. #define MICROPY_ENABLE_GC (1)
. Making this Setting
(0)
disables the feature.
Other configurations include type definitions, root pointers, board name, microcontroller name etc.
Similarly, an minimal example mphalport.h
file looks like this:
static inline void mp_hal_set_interrupt_char(char c) {}
Support for standard input/output¶
MicroPython requires at least a way to output characters, and to have a REPL it also
requires a way to input characters. Functions for this can be implemented in the file
mphalport.c
, for example:
#include <unistd.h>
#include "py/mpconfig.h"
// Receive single character, blocking until one is available.
int mp_hal_stdin_rx_chr(void) {
unsigned char c = 0;
int r = read(STDIN_FILENO, &c, 1);
(void)r;
return c;
}
// Send the string of given length.
void mp_hal_stdout_tx_strn(const char *str, mp_uint_t len) {
int r = write(STDOUT_FILENO, str, len);
(void)r;
}
These input and output functions have to be modified depending on the specific board API. This example uses the standard input/output stream.
Building and running¶
At this stage the directory of the new port should contain:
ports/example_port/
├── main.c
├── Makefile
├── mpconfigport.h
├── mphalport.c
└── mphalport.h
The port can now be built by running make
(or otherwise, depending on your system).
If you are using the default compiler settings in the Makefile given above then this
will create an executable called build/firmware.elf
which can be executed directly.
To get a functional REPL you may need to first configure the terminal to raw mode:
$ stty raw opost -echo
$ ./build/firmware.elf
That should give a MicroPython REPL. You can then run commands like:
MicroPython v1.13 on 2021-01-01; example-board with unknown-cpu
>>> import sys
>>> sys.implementation
('micropython', (1, 13, 0))
>>>
Use Ctrl-D to exit, and then run reset
to reset the terminal.
Adding a module to the port¶
To add a custom module like myport
, first add the module definition in a file
modmyport.c
:
#include "py/runtime.h"
STATIC mp_obj_t myport_info(void) {
mp_printf(&mp_plat_print, "info about my port\n");
return mp_const_none;
}
STATIC MP_DEFINE_CONST_FUN_OBJ_0(myport_info_obj, myport_info);
STATIC const mp_rom_map_elem_t myport_module_globals_table[] = {
{ MP_OBJ_NEW_QSTR(MP_QSTR___name__), MP_OBJ_NEW_QSTR(MP_QSTR_myport) },
{ MP_ROM_QSTR(MP_QSTR_info), MP_ROM_PTR(&myport_info_obj) },
};
STATIC MP_DEFINE_CONST_DICT(myport_module_globals, myport_module_globals_table);
const mp_obj_module_t myport_module = {
.base = { &mp_type_module },
.globals = (mp_obj_dict_t *)&myport_module_globals,
};
MP_REGISTER_MODULE(MP_QSTR_myport, myport_module, 1);
Note: the “1” as the third argument in MP_REGISTER_MODULE
enables this new module
unconditionally. To allow it to be conditionally enabled, replace the “1” by
MICROPY_PY_MYPORT
and then add #define MICROPY_PY_MYPORT (1)
in mpconfigport.h
accordingly.
You will also need to edit the Makefile to add modmyport.c
to the SRC_C
list, and
a new line adding the same file to SRC_QSTR
(so qstrs are searched for in this new file),
like this:
SRC_C = \
main.c \
modmyport.c \
mphalport.c \
...
SRC_QSTR += modport.c
If all went correctly then, after rebuilding, you should be able to import the new module:
>>> import myport
>>> myport.info()
info about my port
>>>


@dataknut
)If you wish to use any of the material from this report please cite as:
@dataknut
) (2020) NZ Electricity Generation Trends 1998-2020: Exploring wholesale data v1.0_Final, Dunedin: University of Otago.This work is (c) 2020 the the University of Otago
This report is intended to:
Specific history of this code:
This work was supported by:
Inspired by Steffel (2018) which analyses trends in the type and timing of generation in the UK over the same time period. Intended to build on Kahn et al’s 2018 CO2 intensity of peak demand paper - how have thngs changed over time?
Uses https://www.emi.ea.govt.nz/Wholesale/Datasets/Generation/Generation_MD/ from 1998 to 2018. Note that this does not appear to include Solar (too low or in a seperate data set?) nor does it appear to include domestic/small-scale generation? It is possible that these are to be found in https://www.emi.ea.govt.nz/Wholesale/Datasets/Metered_data/Embedded_generation and should be combined with this data?
Data is kWh - so energy not power.
Load the generation data from files stored in:
These have been pre-downloaded and cleaned using this code but could be pulled on the fly to be refreshed for other dates…
## # A tibble: 1 x 2
## target command
## <chr> <expr>
## 1 genData loadData()
## Warning: Do not run make() from a subdirectory of your project.
## running make() from: /home/dataknut/github/CfSOtago/gridCarbon/dataAnalysis
## drake project root: /home/dataknut/github/CfSOtago/gridCarbon
## cache directory: /home/dataknut/github/CfSOtago/gridCarbon/.drake
## ✓ All targets are already up to date.
## rDateTimeOrig Time_Period rDateTime
## 1: 1997-12-01T00:15:00Z TP1 1997-12-01 00:15:00
## 2: 1997-12-01T00:15:00Z TP1 1997-12-01 00:15:00
## 3: 1997-12-01T00:15:00Z TP1 1997-12-01 00:15:00
## 4: 1997-12-01T00:15:00Z TP1 1997-12-01 00:15:00
## 5: 1997-12-01T00:15:00Z TP1 1997-12-01 00:15:00
## 6: 1997-12-01T00:15:00Z TP1 1997-12-01 00:15:00
## [1] "Files loaded"
## Loaded 24,877,350 rows of data
| Site_Code | POC_Code | Nwk_Code | Gen_Code | Fuel_Code | Tech_Code | Trading_date | Time_Period | kWh | rTime | rDate | rDateTime | month | year | rDateTimeOrig | rMonth |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| ARA | ARA2201 | MRPL | aratiatia | Hydro | Hydro | 1997-12-01 | TP1 | 28770 | 00:15:00 | 1997-12-01 | 1997-12-01 00:15:00 | 12 | 1997 | 1997-12-01T00:15:00Z | Dec |
| ARG | ARG1101 | TRUS | argyle_wairau | Hydro | Hydro | 1997-12-01 | TP1 | 0 | 00:15:00 | 1997-12-01 | 1997-12-01 00:15:00 | 12 | 1997 | 1997-12-01T00:15:00Z | Dec |
| ARI | ARI1101 | MRPL | arapuni | Hydro | Hydro | 1997-12-01 | TP1 | 58280 | 00:15:00 | 1997-12-01 | 1997-12-01 00:15:00 | 12 | 1997 | 1997-12-01T00:15:00Z | Dec |
| ATI | ATI2201 | MRPL | atiamuri | Hydro | Hydro | 1997-12-01 | TP1 | 9330 | 00:15:00 | 1997-12-01 | 1997-12-01 00:15:00 | 12 | 1997 | 1997-12-01T00:15:00Z | Dec |
| AVI | AVI2201 | MERI | aviemore | Hydro | Hydro | 1997-12-01 | TP1 | 28440 | 00:15:00 | 1997-12-01 | 1997-12-01 00:15:00 | 12 | 1997 | 1997-12-01T00:15:00Z | Dec |
| BEN | BEN2202 | MERI | benmore | Hydro | Hydro | 1997-12-01 | TP1 | 118180 | 00:15:00 | 1997-12-01 | 1997-12-01 00:15:00 | 12 | 1997 | 1997-12-01T00:15:00Z | Dec |
Table 4.1 sumarises the data. Notice that there are missing (NA) values in the kWh column. These are caused by periods 49 and 50:
“The data is presented by trading period, TP1, TP2, … TP48. Trading period 1 starts at midnight, trading period 2 starts at 12:30am, trading period 3 starts at 1:00am, etc. Users of this data should be aware of daylight saving in New Zealand. On the day daylight saving commences there are only 46 trading periods and on the day it ends, there are 50.” (https://www.emi.ea.govt.nz/Wholesale/Datasets/Generation/Generation_MD/)
So on 2 days of the year TP47 & TP48 do not exist and on the following days they are back and we also have TP49 & TP50. There are only two things in life worse than death & taxes: daylight saving time and time-zones.
Daylight saving begins/ends in October and March and so these TPs should only show up twice a year. However, these TP are still present as labels in the Time_Period variable and so give NA kWh in the data as the following table (Table 4.2) and plot (Figure 4.1) of NA observations (only) by Fuel Type and month show. The plot also shows that there are unexplained NA in other months and periods.
| TP1 | TP10 | TP11 | TP12 | TP13 | TP14 | TP15 | TP16 | TP17 | TP18 | TP19 | TP2 | TP20 | TP21 | TP22 | TP23 | TP24 | TP25 | TP26 | TP27 | TP28 | TP29 | TP3 | TP30 | TP31 | TP32 | TP33 | TP34 | TP35 | TP4 | TP45 | TP47 | TP48 | TP49 | TP5 | TP50 | TP6 | TP7 | TP8 | TP9 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 43774 | 0 | 43774 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 39906 | 0 | 39906 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 41642 | 5 | 41642 | 0 | 3 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 39550 | 0 | 39550 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 0 | 0 | 0 | 41753 | 3 | 41753 | 2 | 3 | 2 | 3 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 40354 | 0 | 40354 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 41737 | 0 | 41737 | 0 | 0 | 0 | 0 |
| 5 | 6 | 4 | 0 | 2 | 5 | 0 | 5 | 6 | 0 | 6 | 4 | 5 | 6 | 6 | 0 | 0 | 0 | 4 | 4 | 6 | 7 | 0 | 10 | 5 | 5 | 5 | 6 | 3 | 7 | 6 | 3 | 0 | 41733 | 5 | 41733 | 7 | 5 | 7 | 6 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 883 | 883 | 40494 | 112 | 40494 | 112 | 0 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 470 | 470 | 41914 | 471 | 41914 | 471 | 1 | 1 | 1 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 40598 | 0 | 40598 | 0 | 2 | 1 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 43321 | 0 | 43321 | 2 | 0 | 0 | 0 |
In order to avoid future confusion and to save a lot of error checking we therefore remove NA kWh (i.e. TP49 & TP 50 and a few other data points) from the dataset.
# N rows before:
nrow(origGenDT)
## [1] 24877350
# N time periods before:
uniqueN(origGenDT$Time_Period)
## [1] 50
# remove NA
genDT <- origGenDT[!is.na(kWh)]
# N rows after
nrow(genDT)
## [1] 23879690
# N time periods after:
uniqueN(genDT$Time_Period)
## [1] 50
Table 5.1 shows summary statistics for each fuel source by year. Hydro contributes the majority of energy in each year but coal has the highest half-hourly mean in each year suggesting that is makes large contributions at specific times. Comparing the mean and median for coal shows how skewed this distirbution was in 1999 although far less so in 2019. This is also supported by the maximum values which show coal as the ‘peaked’ energy producer in 1999 although this has faded by 2019 where it shows similar maxima to gas and hydro. Note that 2 of the 4 the Huntly coal-fired units were mothballed/retired during this period.
Figure 5.1 shows the distribution of half-hourly observations by month and year. It clearly shows the use of coal in June 1999, non-use in December 1999 but re-use in December 2019 where there appears little difference between winter & summer use for most fuels. We also see the emergence of wind by 2019.
| year | Fuel_Code | sumMWh | meanMWh | medianMWh | minMWh | maxMWh | sdMWh |
|---|---|---|---|---|---|---|---|
| 1999 | Coal | 3072221.82 | 175.40 | 180.50 | 0 | 375.06 | 85.73 |
| 1999 | Diesel | 0.79 | 0.00 | 0.00 | 0 | 0.49 | 0.00 |
| 1999 | Gas | 4464044.41 | 28.32 | 8.20 | 0 | 193.50 | 47.75 |
| 1999 | Gas&Oil | 2679260.39 | 76.48 | 57.05 | 0 | 172.62 | 49.60 |
| 1999 | Geo | 2016727.54 | 26.57 | 17.90 | 0 | 84.62 | 29.65 |
| 1999 | Hydro | 22380243.50 | 39.31 | 20.94 | 0 | 295.83 | 51.73 |
| 1999 | Wood | 236114.97 | 13.48 | 15.69 | 0 | 19.92 | 5.48 |
| 2019 | Coal | 1611666.68 | 91.99 | 92.43 | 0 | 238.18 | 72.45 |
| 2019 | Diesel | 2682.55 | 0.15 | 0.00 | 0 | 46.00 | 1.71 |
| 2019 | Gas | 5465118.86 | 34.66 | 8.86 | 0 | 251.27 | 54.21 |
| 2019 | Geo | 7209659.82 | 37.41 | 41.08 | 0 | 85.62 | 23.92 |
| 2019 | Hydro | 24656881.05 | 36.17 | 16.80 | 0 | 402.43 | 58.53 |
| 2019 | Wind | 1829199.86 | 11.60 | 8.53 | 0 | 48.91 | 11.50 |
| 2019 | Wood | 249663.54 | 14.25 | 16.13 | 0 | 19.43 | 4.97 |
Figure 5.2 visualises the distribution of MWh values within fuel sources. Note that the vertical axis has been allowed to vary by fuel source so that smaller counts are visible. The y axis is constant which enables the higher unit output of coal to be clearly visible. The histogram for coal shows the use of multiple units in June 1999 but not 2019 for example where the output is clearly truncated. It also shows that coal was almost constantly generating in 2019 (very few zero values). Hydro on the other hand shows a large number of zero or low values as does wind and back-up diesel which is to be expected.
The following plots shows the total, mean, s.d. and coefficient of variation plots of half-hourly GWh produced by each fuel source each month and to some extent relfects the previous box plots.
The total is simply the sum of all half-hourly values and Figure 5.3 shows the dominance of hydro followed by coal in June 1998; the non-use of coal in December 1998; the growth of gas & geo by 2018 but the relative stasis in at-capacity hydro (?).
Figure 5.5 shows the standard deviation of the half-hourly generation data and suggests that coal has the highest absolute variation in June 1998 which may correspond to a particular spike and/or a period of very heavy use. Coal is less variable in 2018 perhaps due to the increased use of Gas.
Finally, Figure ?? shows the coefficient of variation across the half-hourly values (mean/s.d). We take the CoV to indicate relative variability (i.e. relative volatility) in generation load between the different fuels and use it in preference to the standard deviation (shown above) which, as an absolute measure, is affected by the underlying magnitude of each fuel’s use. The plots suggest that Coal and Wood tend to see greatest relative variability although Gas & Oil in 1998 also stand out.
# coefficient of variation https://en.wikipedia.org/wiki/Coefficient_of_variation
plotDT <- plotDT[, cov := 1000000 * (meankWh/sdkWh)] # corrct for GW conversion in plot function (doh!)
makeMonthlyDodgedPlot(plotDT, "cov", "CoV half-hourly GWh") + geom_col(position = "dodge")
## Warning: Removed 11 rows containing missing values (geom_col).
## Warning: Removed 11 rows containing missing values (geom_col).
However the monthly plots do not tell us about the use of different generation sources by time of day which has clear implications for how peaks in demand have been met over time.
To do this, the following plots partially replicate one of those found in Staffel, 2018 for the UK to show how the different components of generation have changed over time.
Figure 5.6 shows the total half-hourly generation for each month summed over all days whilst Figure 5.7 shows the same data but as a point plot to more clearly show the absolute contribution of each fuel.
Note 1: the half-hours are plotted at mid-points (00:15, 00:45, 01:15 etc…)
Note 2: rTime (Time of Day) is originally imputed from the TP1-48 periods (and TP49 & TP50 on DST break days) and is therefore automatically set to the local NZ ‘civil’ time - so NZST or DST as appropriate. See ?setEAGenTimePeriod and the data processing script for more details.
## Warning: Removed 7 rows containing missing values (position_stack).
## Warning: Removed 7 rows containing missing values (geom_point).
Repeat for 2019 only
## Warning: Removed 7 rows containing missing values (geom_point).
Figures 5.9 and 5.10 repeat this analysis but shows the mean, again suggesting that the values for coal are skewed by some extremely large values in December 1998 and by high generation values when used in 2019.
## Warning: Removed 7 rows containing missing values (position_stack).
## Warning: Removed 7 rows containing missing values (geom_point).
Using full dataset for each day, month & year.
The hydro trends (and the consequences for Carbon-based generation) should be seen in the context of the Southern Oscilation’s effect on rainfall.
“Although El Niño and La Niña (collectively known as El Niño-Southern Oscillation or ENSO) have an important influence on New Zealand’s climate, it accounts for less than 25 percent of the year-to year variance in seasonal rainfall and temperature at most locations. Nevertheless, its effects can be significant.” https://www.niwa.co.nz/climate/information-and-resources/elnino/elnino-impacts-on-newzealand
“La Niña events have different impacts on New Zealand’s climate. More north–easterly winds are characteristic, which tend to bring moist, rainy conditions to the north–east of the North Island, and reduced rainfall to the south and south–west of the South Island.
Therefore, some areas, such as central Otago and South Canterbury, can experience drought in both El Niño and La Niña. "
Figure (fig:monthlySOI) shows the monthly El Niño Southern Oscillation Index for 1986–2016 and shows at least four strong El Nino periods centred on 1987, 1993, 1997, 2005 and 2015.

Figure 6.2 shows the dominance of hydro and decrease in coal use.
Adding annotations with information from:
If we consider the relationship between generation and the SOI at the yearly level, Figure (fig:yearlyGenSOI) suggests that Gas is fairly responsive to increasing SOI above 0 (La Nina years) and hydro is the inverse (with considerable variation/uncertainty) on an annual measure. Presumably this indicates the use of Gas for peaking generation when hydro is at capacity in drier years?
## `geom_smooth()` using formula 'y ~ x'
This section uses monthly aggregates.
## Warning: Removed 105 row(s) containing missing values (geom_path).
## Saving 11 x 8 in image
## Warning: Removed 105 row(s) containing missing values (geom_path).
## Warning: Removed 105 row(s) containing missing values (geom_path).
## Warning: Removed 105 row(s) containing missing values (geom_path).
## Saving 11 x 8 in image
## Warning: Removed 105 row(s) containing missing values (geom_path).
## Warning: Removed 105 row(s) containing missing values (geom_path).
Figures ?? shows the same trends as previously but using monthly data to highlight seasonal patterns over time.
If we consider the relationship between generation and the SOI at the monthly level, Figure (fig:monthlyGenSOI) suggests there is a much less clear relationship although the fit lines are still in the same directions with increased use of gas as the SOI increases and the inverse for hydro.
## `geom_smooth()` using formula 'y ~ x'
Figures ?? and ?? show the same trends as previously but using daily data to highlight seasonal patterns over time. Annotations use information from:
## Scale for 'x' is already present. Adding another scale for 'x', which will replace the existing
## scale.
## Warning: Removed 630 row(s) containing missing values (geom_path).
## Saving 11 x 8 in image
## Warning: Removed 630 row(s) containing missing values (geom_path).
## Warning: Removed 630 row(s) containing missing values (geom_path).
here
go here
| Name | origGenDT |
| Number of rows | 24877350 |
| Number of columns | 17 |
| _______________________ | |
| Column type frequency: | |
| character | 11 |
| difftime | 1 |
| factor | 1 |
| numeric | 3 |
| POSIXct | 1 |
| ________________________ | |
| Group variables | None |
Variable type: character
| skim_variable | n_missing | complete_rate | min | max | empty | n_unique | whitespace |
|---|---|---|---|---|---|---|---|
| Site_Code | 0 | 1 | 3 | 3 | 0 | 74 | 0 |
| POC_Code | 0 | 1 | 7 | 7 | 0 | 78 | 0 |
| Nwk_Code | 0 | 1 | 4 | 4 | 0 | 32 | 0 |
| Gen_Code | 0 | 1 | 3 | 15 | 0 | 72 | 0 |
| Fuel_Code | 0 | 1 | 3 | 7 | 0 | 8 | 0 |
| Tech_Code | 0 | 1 | 3 | 5 | 0 | 5 | 0 |
| Trading_date | 0 | 1 | 10 | 10 | 0 | 8126 | 0 |
| Time_Period | 0 | 1 | 3 | 4 | 0 | 50 | 0 |
| rDate | 0 | 1 | 10 | 10 | 0 | 8126 | 0 |
| rDateTimeOrig | 0 | 1 | 0 | 20 | 995094 | 390049 | 0 |
| kWhisNA | 0 | 1 | 2 | 6 | 0 | 2 | 0 |
Variable type: difftime
| skim_variable | n_missing | complete_rate | min | max | median | n_unique |
|---|---|---|---|---|---|---|
| rTime | 995094 | 0.96 | 900 secs | 85500 secs | 43200 secs | 48 |
Variable type: factor
| skim_variable | n_missing | complete_rate | ordered | n_unique | top_counts |
|---|---|---|---|---|---|
| rMonth | 997800 | 0.96 | TRUE | 12 | Jan: 2101152, Dec: 2079408, Oct: 2010932, May: 2004144 |
Variable type: numeric
| skim_variable | n_missing | complete_rate | mean | sd | p0 | p25 | p50 | p75 | p100 | hist |
|---|---|---|---|---|---|---|---|---|---|---|
| kWh | 997660 | 0.96 | 36399.09 | 55249.95 | -2407 | 4961 | 17510 | 44535 | 526520 | ▇▁▁▁▁ |
| month | 0 | 1.00 | 6.51 | 3.47 | 1 | 3 | 7 | 10 | 12 | ▇▅▅▅▇ |
| year | 0 | 1.00 | 2009.43 | 6.30 | 1997 | 2004 | 2010 | 2015 | 2020 | ▅▆▆▇▆ |
Variable type: POSIXct
| skim_variable | n_missing | complete_rate | min | max | median | n_unique |
|---|---|---|---|---|---|---|
| rDateTime | 997800 | 0.96 | 1997-12-01 00:15:00 | 2020-02-29 23:45:00 | 2010-06-23 13:15:00 | 390004 |
| Name | monthlySODT |
| Number of rows | 372 |
| Number of columns | 7 |
| _______________________ | |
| Column type frequency: | |
| character | 5 |
| Date | 1 |
| numeric | 1 |
| ________________________ | |
| Group variables | None |
Variable type: character
| skim_variable | n_missing | complete_rate | min | max | empty | n_unique | whitespace |
|---|---|---|---|---|---|---|---|
| Month_year | 0 | 1 | 6 | 6 | 0 | 372 | 0 |
| monthChar | 0 | 1 | 3 | 3 | 0 | 12 | 0 |
| yearChar | 0 | 1 | 2 | 2 | 0 | 31 | 0 |
| rYear | 0 | 1 | 4 | 4 | 0 | 31 | 0 |
| dateChar | 0 | 1 | 11 | 11 | 0 | 372 | 0 |
Variable type: Date
| skim_variable | n_missing | complete_rate | min | max | median | n_unique |
|---|---|---|---|---|---|---|
| rMonth | 0 | 1 | 1986-01-01 | 2016-12-01 | 2001-06-16 | 372 |
Variable type: numeric
| skim_variable | n_missing | complete_rate | mean | sd | p0 | p25 | p50 | p75 | p100 | hist |
|---|---|---|---|---|---|---|---|---|---|---|
| Southern_oscillation_index | 0 | 1 | 0.06 | 0.98 | -3.1 | -0.6 | 0 | 0.8 | 2.9 | ▁▃▇▅▁ |
Figure 9.1 shows the fuel use by each of the Huntly units over time. It appears to show that huntly_1_4 always burns coal although the units are able to also burn gas. It is not clear if this data is correct.
## Warning: Removed 56 rows containing missing values (position_stack).

Should we be adding embedded generation from https://www.emi.ea.govt.nz/Wholesale/Datasets/Metered_data/Embedded_generation ? It seems to be PV which (currently) has a los installed capacity…
Analysis completed in 653.57 seconds ( 10.89 minutes) using knitr in RStudio with R version 3.4.4 (2018-03-15) running on x86_64-pc-linux-gnu.
R packages used:
Session info:
## R version 3.4.4 (2018-03-15)
## Platform: x86_64-pc-linux-gnu (64-bit)
## Running under: Ubuntu 16.04.6 LTS
##
## Matrix products: default
## BLAS: /usr/lib/libblas/libblas.so.3.6.0
## LAPACK: /usr/lib/lapack/liblapack.so.3.6.0
##
## locale:
## [1] LC_CTYPE=en_NZ.UTF-8 LC_NUMERIC=C LC_TIME=en_NZ.UTF-8
## [4] LC_COLLATE=en_NZ.UTF-8 LC_MONETARY=en_NZ.UTF-8 LC_MESSAGES=en_NZ.UTF-8
## [7] LC_PAPER=en_NZ.UTF-8 LC_NAME=C LC_ADDRESS=C
## [10] LC_TELEPHONE=C LC_MEASUREMENT=en_NZ.UTF-8 LC_IDENTIFICATION=C
##
## attached base packages:
## [1] stats graphics grDevices utils datasets methods base
##
## other attached packages:
## [1] bookdown_0.18 rmarkdown_2.1 viridis_0.5.1 viridisLite_0.3.0 skimr_2.1
## [6] lubridate_1.7.4 kableExtra_1.1.0 hms_0.5.3 ggplot2_3.3.0 drake_7.12.0
## [11] dplyr_0.8.5 data.table_1.12.8 gridCarbon_0.1.0 here_0.1
##
## loaded via a namespace (and not attached):
## [1] Rcpp_1.0.4 txtq_0.2.0 lattice_0.20-38 tidyr_1.0.2 prettyunits_1.1.1
## [6] assertthat_0.2.1 rprojroot_1.3-2 digest_0.6.25 utf8_1.1.4 R6_2.4.1
## [11] repr_1.1.0 backports_1.1.5 evaluate_0.14 httr_1.4.1 highr_0.8
## [16] pillar_1.4.3 rlang_0.4.5 progress_1.2.2 rstudioapi_0.11 Matrix_1.2-14
## [21] labeling_0.3 splines_3.4.4 webshot_0.5.2 readr_1.3.1 stringr_1.4.0
## [26] igraph_1.2.5 munsell_0.5.0 compiler_3.4.4 xfun_0.12 pkgconfig_2.0.3
## [31] base64enc_0.1-3 mgcv_1.8-28 htmltools_0.4.0 tidyselect_1.0.0 gridExtra_2.3
## [36] tibble_3.0.0 fansi_0.4.1 crayon_1.3.4 withr_2.1.2 grid_3.4.4
## [41] nlme_3.1-137 jsonlite_1.6.1 gtable_0.3.0 lifecycle_0.2.0 magrittr_1.5
## [46] storr_1.2.1 scales_1.1.0 cli_2.0.2 stringi_1.4.6 farver_2.0.3
## [51] xml2_1.2.5 ellipsis_0.3.0 filelock_1.0.2 vctrs_0.2.4 forcats_0.5.0
## [56] tools_3.4.4 glue_1.3.2 purrr_0.3.3 parallel_3.4.4 yaml_2.2.1
## [61] colorspace_1.4-1 base64url_1.4 rvest_0.3.5 knitr_1.28
Dowle, M, A Srinivasan, T Short, S Lianoglou with contributions from R Saporta, and E Antonyan. 2015. Data.table: Extension of Data.frame. https://CRAN.R-project.org/package=data.table.
Grolemund, Garrett, and Hadley Wickham. 2011. “Dates and Times Made Easy with lubridate.” Journal of Statistical Software 40 (3): 1–25. http://www.jstatsoft.org/v40/i03/.
Harrell Jr, Frank E, with contributions from Charles Dupont, and many others. 2016. Hmisc: Harrell Miscellaneous. https://CRAN.R-project.org/package=Hmisc.
R Core Team. 2016. R: A Language and Environment for Statistical Computing. Vienna, Austria: R Foundation for Statistical Computing. https://www.R-project.org/.
Wickham, Hadley. 2009. Ggplot2: Elegant Graphics for Data Analysis. Springer-Verlag New York. http://ggplot2.org.
Wickham, Hadley, Jim Hester, and Romain Francois. 2016. Readr: Read Tabular Data. https://CRAN.R-project.org/package=readr.
Xie, Yihui. 2016a. Bookdown: Authoring Books and Technical Documents with R Markdown. Boca Raton, Florida: Chapman; Hall/CRC. https://github.com/rstudio/bookdown.
———. 2016b. Knitr: A General-Purpose Package for Dynamic Report Generation in R. https://CRAN.R-project.org/package=knitr.


LEILA (director/writer: Dariush Mehrjui; screenwriter: from a story by Mahnaz Ansarian; cinematographer: Mahmud Kalari; editor: Mostafa Kherqepush; cast: Leila Hatami (Leila), Ali Mosaffa (Reza, the Husband), Jamileh Sheikhi (Reza's Mother), Mohammad Reza Sharifinia (Leila's Uncle), Turan Mehrzad (Leila's Mother), Shaqayeq Farahani (Second Wife), Amir Pievar (Reza's Father); Runtime: 124; 1996-Iran)
Reviewed by Dennis Schwartz
Dariush Mehrjui is one of Iran's finest modern filmmakers, his speciality is making films about relationships among the upper-middle-class illuminati, and especially love stories about women. This drama is a very powerful, poignant and mesmerizing love story, about the pressures of dealing with Moslem traditions and of a woman's own sense of being.
A very warm couple, the handsome Reza (Ali Mosaffa) and the beautiful Leila (Leila Hatami), perfectly suited for each other in temperament find happiness in their first year of marriage. Why this marriage should turn ice cold, when everything is so blissful, is amazing to watch as it unfolds. This is a truly heartbreaking tale without contrivances, that examines a woman's psyche, looking carefully at her wants and her expectations. The trouble starts when after a year, there is no child. The couple go to a doctor and are tested to see if either one has infertility problems. They swear their love for each other, and in their own quiet way, say that it doesn't matter who is to blame, they will stay married no matter what. The problem comes from Leila's overbearing mother-in-law (Jamileh Sheikhi), a monster, if there ever was one. She rattles the poor, sensitive girl and completely intimidates her, stressing how important it is to have a son to carry out the family name. The wealthy Reza, who works in his father's company, is the only son, there are four daughters. When the news from the lab comes back that Leila is barren, that her hormonal levels are too low to ever have children, the mother-in-law heartlessly puts the burden on her, naggingly telling her that she is holding her son back from raising a family, as he confided to others that he really wants one.
The weak son never confronts his mother, as he seems perplexed, even as his wife begins to slowly sink into a shell, confused and ashamed about herself, unwilling to confide in anyone, not even her mother. She receives passive support from Reza, but she can't face the treacherous mother-in-law when alone, who has the gift of twisting things around during her visits while pretending to be nice by bearing gifts and then she turns on the acid tongue, making Leila feel inadequate, as she just tries to please her by agreeing with whatever she says. The mother is so invasive of the couple's privacy, that she calls them always at the wrong moment and the ringing phone is like a knife sticking in Leila, it is so painful to just watch the phone and hear it ringing, and watch Leila cringe at the thought of hearing what her mother-in-law has to say.
The selfish mother-in-law after two years of intimidating the girl, telling her Reza wants a child so much he will sneak behind her back and have a child with another woman, and then have the nerve to suggest that Leila give her permission for Reza to get another wife, as evidently, polygamy is permitted in Iran.
Reza reacts by saying he doesn't want another wife, and that he can live happily without children, just as long as she returns to being the old playful Leila, who smiles so easily and is close to him. But he never reassures her that he means what he says, and she grows more distant from him, talking to herself aloud, so that we could hear her hurtful thoughts, things that she feels she can't tell anyone else. She can't take the pressure anymore, so she pushes Reza to look for a new wife. On each occasion, when Reza goes courting, he requests that she ride with him to meet his perspective bride, as he drops her off by the stores to shop while he goes to look over the woman his Aunt Shamsi or his mother-in-law chose for him.
Reza is never forceful enough in his statements telling her that it doesn't matter that she can't have children, as Leila has nagging doubts about whether he really means it or is just saying it. The couple have all the creature comforts of modern life and act like modern people do, and are seen playfully watching Dr. Zhivago on TV together, but tradition is also very strong. She stays home and does the cooking and the womanly chores, while wearing, as she must, by Iranian law, a chador to cover her head. There seems to be no problem following these traditions, but this modern couple has its feet stuck in two different worlds and they seem confused as to where they really want to be standing.
I recently saw another film from the Middle-East, "Kadosh," an Israeli film with the same topic and the same intransigent attitude was displayed by those who call themselves orthodox believers in God, who believe a woman who is barren has been cursed by God, they were Hasidim, a sect of the Jewish religion.
It is curious that the men are so docile, that Reza never tells his mother to mind her own business, and even though Reza's father disagrees with what his wife is doing, he never stops her from ruining his son's marriage. And when he takes a second wife, Leila has had enough. She can't live with him anymore in the same house, though she bears no grudge against his new wife, she still returns to her mother's house and withdraws from Reza completely, quietly disrespecting him and filling herself with self-pity. She says that she has turned to stone. When she learns that the new wife gives birth to a baby girl, she anxiously takes a peek at the girl, but has no love anymore for Reza and as she once refused to answer him when he told her after the wedding that he would divorce his new wife if she would return, she still refuses his offers. It is too late for him to regain her love and his dignity as a man. When the new wife divorces him because he can't love her and gets a generous alimony and then weds her old suitor, because she now has the kind of money she never had before, she ironically leaves the baby girl to be raised by Reza's mother. The perfect marriage is destroyed forever as 10 years have passed since we first saw the happy couple meeting at a family communal where they made a traditional pudding, and all Reza could now do is be angry with his mother for ruining his life, still unaware of how weakly he behaved.
This is a very compelling and subtle film, on one hand it shows the current conflict in Iran between modernity and Islamic tradition, but on the other hand, this is a penetrating film about the universal problem of love, as seen through the psyche of a woman who is stripped of her self-esteem, and even though she is beautiful and has a considerate husband, she is still not sure of what her role is in society. This is a very sensitive tale; it is film that was convincing in every possible situation it presented; it is the work of a great director.
REVIEWED ON 8/27/2000 GRADE: A
Dennis Schwartz: "Ozus' World Movie Reviews"
http://www.sover.net/~ozus
<EMAIL_ADDRESS>© ALL RIGHTS RESERVED DENNIS SCHWARTZ
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


I began working in the residential construction industry. I quickly worked my way up to a project manager, overseeing $1M plus annually in reciepts. I helped design, create, and install various projects around Colorado. I worked at tradeshows and assisted in marketing.
In 2009 I decided to start my own business, and utilizing the contacts I made from my previous years as a residential contractor, I was asked to be a manufacturing representative for a start-up company. At the same time, I started my own business locally. As a manufacturing representative, I traveled across the United States, meeting with clients, setting up distributors, and working trade shows.
In 2013 I saw a nitch in the construction industry and began the new challenge of designing, creating, and manufacturing custom cabinetry and furniture for high-end vacation homes.
I have always had great interest in the tech industry, even taking classes online for a period of time, but I became quickly aware that being self-taught was not going to be enough. Never being one to back down from an intellectual challenge, I applied for the Full Stack Bootcamp (part-time program). I am currently working full-time while completing my bootcamp, gratudation in November 2018.


A game will runs for 40 seconds, during which you can solve as many mangled fruit names as you can manage.


Woman accused of stabbing another for wearing fur
by MARK GILLISPIE, Associated PressCLEVELAND (AP) - Authorities say a woman repeatedly stabbed another at an Ohio church for wearing fur.
Cleveland Heights police say 35-year-old Meredith Lowell stabbed the victim in the arm and abdomen Wednesday afternoon.
Police say a man wrestled Lowell to the floor and held her until officers arrived. The victim remained hospitalized Thursday. Her condition was unclear.
Officials say the victim had taken children she was babysitting to a Presbyterian church for choir practice.
Police Chief Anne Mecklenburg says Lowell was previously charged with a knife attack on someone wearing fur last November in neighboring University Heights. That case is pending.
A telephone number to seek comment from Lowell's attorney couldn't be found.


Note 1 : Recommended statistics for this type of classification highlighted in aqua
Note 2 : The recommender system assumes that the input is the result of classification over the whole data rather than just a part of it. If the confusion matrix is the result of test data classification, the recommendation is not valid.
| Actual | Predict
|
| Class | D003924 | D006262 | Description |
| ACC | 0.88672 | 0.88672 | Accuracy |
| AGF | 0.8764 | 0.89719 | Adjusted F-score |
| AGM | 0.89309 | 0.88006 | Adjusted geometric mean |
| AM | -5 | 5 | Difference between automatic and manual classification |
| AUC | 0.88672 | 0.88672 | Area under the ROC curve |
| AUCI | Very Good | Very Good | AUC value interpretation |
| AUPR | 0.88481 | 0.88922 | Area under the PR curve |
| BCD | 0.00977 | 0.00977 | Bray-Curtis dissimilarity |
| BM | 0.77344 | 0.77344 | Informedness or bookmaker informedness |
| CEN | 0.47278 | 0.46093 | Confusion entropy |
| DOR | 63.11765 | 63.11765 | Diagnostic odds ratio |
| DP | 0.99248 | 0.99248 | Discriminant power |
| DPI | Poor | Poor | Discriminant power interpretation |
| ERR | 0.11328 | 0.11328 | Error rate |
| F0.5 | 0.89516 | 0.87879 | F0.5 score |
| F1 | 0.88446 | 0.88889 | F1 score - harmonic mean of precision and sensitivity |
| F2 | 0.87402 | 0.89922 | F2 score |
| FDR | 0.09756 | 0.12782 | False discovery rate |
| FN | 17 | 12 | False negative/miss/type 2 error |
| FNR | 0.13281 | 0.09375 | Miss rate or false negative rate |
| FOR | 0.12782 | 0.09756 | False omission rate |
| FP | 12 | 17 | False positive/type 1 error/false alarm |
| FPR | 0.09375 | 0.13281 | Fall-out or false positive rate |
| G | 0.88464 | 0.88905 | G-measure geometric mean of precision and sensitivity |
| GI | 0.77344 | 0.77344 | Gini index |
| GM | 0.8865 | 0.8865 | G-mean geometric mean of specificity and sensitivity |
| IBA | 0.75519 | 0.81659 | Index of balanced accuracy |
| IS | 0.8519 | 0.8027 | Information score |
| J | 0.79286 | 0.8 | Jaccard index |
| LS | 1.80488 | 1.74436 | Lift score |
| MCC | 0.77403 | 0.77403 | Matthews correlation coefficient |
| MCCI | Strong | Strong | Matthews correlation coefficient interpretation |
| MCEN | 0.67316 | 0.66008 | Modified confusion entropy |
| MK | 0.77462 | 0.77462 | Markedness |
| N | 128 | 128 | Condition negative |
| NLR | 0.14655 | 0.10811 | Negative likelihood ratio |
| NLRI | Fair | Fair | Negative likelihood ratio interpretation |
| NPV | 0.87218 | 0.90244 | Negative predictive value |
| OC | 0.90244 | 0.90625 | Overlap coefficient |
| OOC | 0.88464 | 0.88905 | Otsuka-Ochiai coefficient |
| OP | 0.86469 | 0.86469 | Optimized precision |
| P | 128 | 128 | Condition positive or support |
| PLR | 9.25 | 6.82353 | Positive likelihood ratio |
| PLRI | Fair | Fair | Positive likelihood ratio interpretation |
| POP | 256 | 256 | Population |
| PPV | 0.90244 | 0.87218 | Precision or positive predictive value |
| PRE | 0.5 | 0.5 | Prevalence |
| Q | 0.96881 | 0.96881 | Yule Q - coefficient of colligation |
| RACC | 0.24023 | 0.25977 | Random accuracy |
| RACCU | 0.24033 | 0.25986 | Random accuracy unbiased |
| TN | 116 | 111 | True negative/correct rejection |
| TNR | 0.90625 | 0.86719 | Specificity or true negative rate |
| TON | 133 | 123 | Test outcome negative |
| TOP | 123 | 133 | Test outcome positive |
| TP | 111 | 116 | True positive/hit |
| TPR | 0.86719 | 0.90625 | Sensitivity, recall, hit rate, or true positive rate |
| Y | 0.77344 | 0.77344 | Youden index |
| dInd | 0.16257 | 0.16257 | Distance index |
| sInd | 0.88505 | 0.88505 | Similarity index |
Generated By PyCM Version 2.4


Contact me via info displayed below or reach us directly to our email by filing the contact form.


Matthews
This page contains an index of all the individuals in the database with the surname of Matthews. Selecting the person’s name will take you to that person’s individual page.
| Given Name | Birth | Death | Partner | Parents |
|---|---|---|---|---|
| Albert Romaine | 1875-07-31 | 1912 | Matthews, William Henry Gray, Jane Elizabeth | |
| Allan Joseph | 1917 | 1989-11-04 | Bush, Gwendoline Merle | Matthews, Sydney James Russell, Blanche May |
| Alma Charles Gray | 1873-12-12 | 1942 | Stirling, Caroline Penelope | Matthews, William Henry Gray, Jane Elizabeth |
| Arthur John | 1909 | 1996-09-28 | Stone, Maude Lillian | Matthews, Alma Charles Gray Stirling, Caroline Penelope |
| Beryl Ruth | 1878-04-13 | 1957 | Scott, Albert William | Matthews, William Henry Gray, Jane Elizabeth |
| Caroline | Winning, John | |||
| Ethel Bertha | 1901 | 1969 | Russell, Alexander Robert | Matthews, Alma Charles Gray Stirling, Caroline Penelope |
| Fanny | about 1850 | 1906/7-06-29 (Julian) | Matthews, Francis Gardener, Frances Maria | |
| Francis | 1837 | Gardener, Frances Maria | ||
| Harry Royce | Harding, [Living] | |||
| Henry Joseph | 1867-05-22 | 1916-08-26 | Williams, Gertrude May | Matthews, William Henry Gray, Jane Elizabeth |
| Janet Maude | 1870-10-29 | 1943 | Payten, Herbert Andrew | Matthews, William Henry Gray, Jane Elizabeth |
| Jaye Robert Ronald | 1977-04-05 | 1979-04-08 | Matthews, [Living] Hill, [Living] | |
| Joseph Cash | Irish, Florence | |||
| Lilly May | 1865-05-15 | 1918 | Matthews, William Henry Gray, Jane Elizabeth | |
| Lily M. | 1898 | 1898 | Matthews, Alma Charles Gray Stirling, Caroline Penelope | |
| Mary Jane “Jinnie” | 1905 | Matthews, Alma Charles Gray Stirling, Caroline Penelope | ||
| Sydney James | 1868-08-17 | 1918 | Russell, Blanche May | Matthews, William Henry Gray, Jane Elizabeth |
| William Henry | about 1836 | 1923-07-07 | Gray, Jane Elizabeth | Matthews, Francis Gardener, Frances Maria |
| William Henry George | 1896 | 1981-09-11 | LeCole, Yvonne Lily | Matthews, Alma Charles Gray Stirling, Caroline Penelope |
| [Living] | Matthews, Sydney James Russell, Blanche May | |||
| [Living] | Cameron, [Living] | Matthews, Sydney James Russell, Blanche May | ||
| [Living] | Bottle, Hilda Agnes | Matthews, Sydney James Russell, Blanche May | ||
| [Living] | Bollard, [Living] | Matthews, [Living] Hill, [Living] | ||
| [Living] | Matthews, [Living] Hill, [Living] | |||
| [Living] | Hill, [Living] | |||
| [Living] | Matthews, [Living] Hill, [Living] | |||
| [Living] | Lynch, [Living] | |||
| [Living] | Matthews, William Henry George LeCole, Yvonne Lily | |||
| [Living] | Matthews, William Henry George LeCole, Yvonne Lily | |||
| [Living] | Matthews, William Henry George LeCole, Yvonne Lily | |||
| [Living] | Matthews, William Henry George LeCole, Yvonne Lily | |||
| [Living] | Heness, [Living] |


{{site.user_description}} Following are my skills and interests. You can download my resume here
I am a beginer in HTML5, git and Mysql.
Currently I am learning to use HTML5 designing my website; using git to properly organize my works and studying Mysql and related database tools to learn data management, as well as their connection to Java and Python.
I am a competent user of Python and Java. I use Python on data analysis and machine learning related works and Java on network programming, database system and related area.
For ubuntu, I am using it as my main development platform, and I am familiar with how to work on it.
World of Warcraft is my favorite MMORPG, I am now just fishing or hanging out in that fantasy world.
My enjoying in music is a habit the Netease Cloud Music gives me. It's recommendation is outstanding!
I am a ametuer playing tennis, I enjoy its strength and agility.


{% extends 'categories/base.html' %} {% block content %}
We've emailed you instructions for setting your password. You should receive the email shortly!


{% load static %}
Login
Automated Canteen System
Simple, Smart, Secure, User-Friendly
Register Here
{% csrf_token %}
{{form.errors}}
Already have an account?
Login


[GITHUB USERNAME] Scheduling App
Practitioner
Andrew Robertson
Phil V Brewer
Bryce Barney Burns
Christine Carly Chambers
Kristen Cerner Carter
Location
Baseline East Medical Center
Family Practice Clinic
Slot Type
Community medicine
Same day
Office Visit - New
Date (Start)
Date (End)
Search for Slots
Slots
Clear Results


Our Menu
Chicken
This is all about chiken in a border chicken is chicken and we serve delecious chicken ofr your information and this is just a test
Shushi
Shushi is great and will be great always and you dont have to worry about it but i still dont know why I am typing the text according to me


HearthNash
Hearthstone Match Solver
Meta Settings
Import CSV:
P0
P1
Deck 0
Deck 1
Deck 2
Deck 3
%
%
%
%
%
%
%
%
%
%
%
%
%
%
%
%
-1 Deck
+1 Deck
Format Settings
Choose Preset
Sample Preset Link
Protects
Bans
Games To Win
Decks Per Player
Remove Winner Deck
Remove Loser Deck
Winner Can Switch
Loser Can Switch
Match Tree Explorer
Generate
Match Tree Root
Children
Vertex Details


Seems your browser doesn't support Javascript! Websocket relies on Javascript being enabled. Please enable Javascript and reload this page!
WebSocket connection:
Connect
Disconnect
What is your name?
annotation_broadcast
annotation_user
annotation_session
template_broadcast
template_user
template_session
exception_broadcast
exception_user
exception_session
Greetings


Standings as of Mon Aug 14
Results
| Game | Date | Time | Arena | Home | Home Score | Away Score | Away | Boxscore |
| 1 | Wed Sep 6 2023 | 9:00PM | KRC Arena | Trane Canada | | | Young Drivers | |
| 2 | Wed Sep 6 2023 | 10:00PM | KRC Arena | Eagleson Flooring | | | Big Rig Brewery | |
| 3 | Fri Sep 8 2023 | 9:15PM | KRC Rink | Kanata Renovations | | | Urban Stone Surfaces | |
| 4 | Fri Sep 8 2023 | 10:15PM | KRC Rink | Trane Canada | | | Eagleson Flooring | |
| 5 | Wed Sep 13 2023 | 9:00PM | KRC Arena | Young Drivers | | | Eagleson Flooring | |
| 6 | Wed Sep 13 2023 | 10:00PM | KRC Arena | Urban Stone Surfaces | | | Big Rig Brewery | |
| 7 | Fri Sep 15 2023 | 9:15PM | KRC Rink | Trane Canada | | | Kanata Renovations | |
| 8 | Fri Sep 15 2023 | 10:15PM | KRC Rink | Urban Stone Surfaces | | | Young Drivers | |
| 9 | Wed Sep 20 2023 | 9:00PM | KRC Arena | Young Drivers | | | Kanata Renovations | |
| 10 | Wed Sep 20 2023 | 10:00PM | KRC Arena | Trane Canada | | | Big Rig Brewery | |
| 11 | Fri Sep 22 2023 | 9:15PM | KRC Rink | Eagleson Flooring | | | Urban Stone Surfaces | |
| 12 | Fri Sep 22 2023 | 10:15PM | KRC Rink | Big Rig Brewery | | | Kanata Renovations | |
| 13 | Wed Sep 27 2023 | 9:00PM | KRC Arena | Big Rig Brewery | | | Young Drivers | |
| 14 | Wed Sep 27 2023 | 10:00PM | KRC Arena | Eagleson Flooring | | | Kanata Renovations | |
| 15 | Fri Sep 29 2023 | 9:15PM | KRC Rink | Trane Canada | | | Urban Stone Surfaces | |
| 16 | Fri Sep 29 2023 | 10:15PM | KRC Rink | Eagleson Flooring | | | Big Rig Brewery | |
| 17 | Wed Oct 4 2023 | 9:00PM | KRC Arena | Urban Stone Surfaces | | | Young Drivers | |
| 18 | Wed Oct 4 2023 | 10:00PM | KRC Arena | Trane Canada | | | Eagleson Flooring | |
| 19 | Fri Oct 6 2023 | 9:15PM | KRC Rink | Big Rig Brewery | | | Kanata Renovations | |
| 20 | Fri Oct 6 2023 | 10:15PM | KRC Rink | Trane Canada | | | Young Drivers | |
| 21 | Wed Oct 11 2023 | 9:00PM | KRC Arena | Urban Stone Surfaces | | | Big Rig Brewery | |
| 22 | Wed Oct 11 2023 | 10:00PM | KRC Arena | Trane Canada | | | Kanata Renovations | |
| 23 | Fri Oct 13 2023 | 9:15PM | KRC Rink | Young Drivers | | | Eagleson Flooring | |
| 24 | Fri Oct 13 2023 | 10:15PM | KRC Rink | Kanata Renovations | | | Urban Stone Surfaces | |
| 25 | Wed Oct 18 2023 | 9:00PM | KRC Arena | Trane Canada | | | Big Rig Brewery | |
| 26 | Wed Oct 18 2023 | 10:00PM | KRC Arena | Eagleson Flooring | | | Urban Stone Surfaces | |
| 27 | Fri Oct 20 2023 | 9:15PM | KRC Rink | Young Drivers | | | Kanata Renovations | |
| 28 | Fri Oct 20 2023 | 10:15PM | KRC Rink | Trane Canada | | | Urban Stone Surfaces | |
| 29 | Wed Oct 25 2023 | 9:00PM | KRC Arena | Big Rig Brewery | | | Kanata Renovations | |
| 30 | Wed Oct 25 2023 | 10:00PM | KRC Arena | Urban Stone Surfaces | | | Young Drivers | |
| 31 | Fri Oct 27 2023 | 9:15PM | KRC Rink | Trane Canada | | | Eagleson Flooring | |
| 32 | Fri Oct 27 2023 | 10:15PM | KRC Rink | Big Rig Brewery | | | Young Drivers | |
| 33 | Wed Nov 1 2023 | 9:00PM | KRC Arena | Eagleson Flooring | | | Big Rig Brewery | |
| 34 | Wed Nov 1 2023 | 10:00PM | KRC Arena | Kanata Renovations | | | Urban Stone Surfaces | |
| 35 | Fri Nov 3 2023 | 9:15PM | KRC Rink | Trane Canada | | | Young Drivers | |
| 36 | Fri Nov 3 2023 | 10:15PM | KRC Rink | Eagleson Flooring | | | Kanata Renovations | |
| 37 | Wed Nov 8 2023 | 9:00PM | KRC Arena | Trane Canada | | | Kanata Renovations | |
| 38 | Wed Nov 8 2023 | 10:00PM | KRC Arena | Young Drivers | | | Eagleson Flooring | |
| 39 | Fri Nov 10 2023 | 9:15PM | KRC Rink | Urban Stone Surfaces | | | Big Rig Brewery | |
| 40 | Fri Nov 10 2023 | 10:15PM | KRC Rink | Young Drivers | | | Kanata Renovations | |
| 41 | Wed Nov 15 2023 | 9:00PM | KRC Arena | Trane Canada | | | Eagleson Flooring | |
| 42 | Wed Nov 15 2023 | 10:00PM | KRC Arena | Big Rig Brewery | | | Kanata Renovations | |
| 43 | Fri Nov 17 2023 | 9:15PM | KRC Rink | Urban Stone Surfaces | | | Young Drivers | |
| 44 | Fri Nov 17 2023 | 10:15PM | KRC Rink | Trane Canada | | | Big Rig Brewery | |
| 45 | Wed Nov 22 2023 | 9:00PM | KRC Arena | Eagleson Flooring | | | Kanata Renovations | |
| 46 | Wed Nov 22 2023 | 10:00PM | KRC Arena | Trane Canada | | | Urban Stone Surfaces | |
| 47 | Fri Nov 24 2023 | 9:15PM | KRC Rink | Big Rig Brewery | | | Young Drivers | |
| 48 | Fri Nov 24 2023 | 10:15PM | KRC Rink | Eagleson Flooring | | | Urban Stone Surfaces | |
| 49 | Wed Nov 29 2023 | 9:00PM | KRC Arena | Kanata Renovations | | | Urban Stone Surfaces | |
| 50 | Wed Nov 29 2023 | 10:00PM | KRC Arena | Trane Canada | | | Young Drivers | |
| 51 | Fri Dec 1 2023 | 9:15PM | KRC Rink | Eagleson Flooring | | | Big Rig Brewery | |
| 52 | Fri Dec 1 2023 | 10:15PM | KRC Rink | Trane Canada | | | Kanata Renovations | |
| 53 | Wed Dec 6 2023 | 9:00PM | KRC Arena | Eagleson Flooring | | | Urban Stone Surfaces | |
| 54 | Wed Dec 6 2023 | 10:00PM | KRC Arena | Young Drivers | | | Kanata Renovations | |
| 55 | Fri Dec 8 2023 | 9:15PM | KRC Rink | Trane Canada | | | Big Rig Brewery | |
| 56 | Fri Dec 8 2023 | 10:15PM | KRC Rink | Young Drivers | | | Eagleson Flooring | |
| 57 | Wed Dec 13 2023 | 9:00PM | KRC Arena | Trane Canada | | | Urban Stone Surfaces | |
| 58 | Wed Dec 13 2023 | 10:00PM | KRC Arena | Big Rig Brewery | | | Young Drivers | |
| 59 | Fri Dec 15 2023 | 9:15PM | KRC Rink | Eagleson Flooring | | | Kanata Renovations | |
| 60 | Fri Dec 15 2023 | 10:15PM | KRC Rink | Urban Stone Surfaces | | | Big Rig Brewery | |


NOW !! Discount on The perfect Salomn Dishes
Garlic butter smothered salmon is a given.  It’s been a while since we gave you salmon and it’s time. Normally you may opt for pan seared salmon for a guaranteed crisp exterior with a fork tender interior. Our baked salmon recipe delivers soft, juicy and tender salmon on the inside with charred crisp edges. A delicious restaurant-quality dinner!
Our Special Cookies
It is made from the best types of flour, wheat and corn flour, vegetarian, which contains small amounts of carbohydrates, and with our smart and very secret mixture, mixing it with the meat of salmon fish, to obtain the highest amount of natural protein completely without preservatives, and it is your best choice to obtain the appropriate amount of protein during your day as it contains 150mg protein.