Review: Dancing at Lughnasa
Starring: Meryl Streep as Kate, Kathy Burke as Maggie, Brid Brennan as Agnes Sophie Thompson as Rose, Catherine McCormack as Christina, Darrell Johnston as Michael, Rhys Ifans as Gerry Evans, Michael Gambon as Jack Mundy
Directed by: Pat O'Connor
Review by: Joy Wyse, The SILVER Screen critic
This is definitely an ensemble film. Because of it, Meryl Streep is miscast. Her fame calls for her character to be bigger and stronger than the others, but it's not and it shouldn't be.
This is a lovely story of the Mundy family, a group of sisters and their brother, as told through the eyes of the boy, Michael.
The sisters live simple lives with average jobs such as teaching and factory work. They live together in their parental home. None of them are married although Michael is the result of an affair by Christina. Rose is attracted to a married man.
Their brother Jack, a Catholic priest, has come back home from Africa as a missionary after suffering a breakdown. Shortly thereafter the boy's father, Gerry Evans, comes back into their lives.
The movie is based on the Broadway play. Although it garnered many Tony nominations, I doubt that it will attract any Academy Award votes. It's a nice story told in a delightful way. There is nothing objectionable portrayed although some people may take offense at the actions of some of the characters.
Lughnasa is not a location, but rather a festival to Lugh, the harvest deity, the God of Music and Light. Knowing this helps explain some of the actions.
Because the movie is fairly slow moving with little plot, I give it a C.
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 can no longer call myself a WordPress expert until I understand JavasScript. This site highlights my ride.
Developing Designs is an internet marketing agency in Tampa, Florida specializing in custom WordPress development, plugins and themes, SEO and Digital Advertising. We're the problem solvers that businesses can rely on.
We create custom WordPress websites and plugins for businesses of any size. Our custom WordPress themes are built to convert users into high quality leads. All of our sites are naturally SEO friendly, semantic, and have ridicously low pagespeeds.
Developing Designs is stays up to date with the latest in search engine optimazation and digital advertising practices. We are Google certified in AdWords and provide many other advertising services such as remarketing, social media advertising, affiliate advertising and much more.
Fearless Nation is one of the leading Krav Maga studio's in the country. They came to Developing Designs without any branding, a website or any internet presence. Take a look at how we were able to solve their problems.
We're also building an ecommerce store onto the current Fearless Nation website. The store will be launching in early 2016.
The Choosy Chick is a leading ecommerce retailer of all natural, organic beauty supplies. The Choosy Chick needed more online exposure and a larger internet presence. We created a plan to increase traffic to the website via search engine optimization and paid advertising with Google AdWords and Google Shopping campaigns. We're also migrating their current Shopify website to a new custom ecommerce store built using WordPress.
Alexandra's Kitchen is a high traffic recipe website that generates lucrative monthly revenues from their advertising. They came to Developing Designs hoping we could help them with their higher than average pagespeeds.
We were able to reduce website load times from ten seconds to three seconds. This not only reduced the sites bounce rate but also increased monthly ad revenues too.


Medicord a healthcare blockchain application. It guarentees every patient a trusted, portable and private place to store your medical information.
Below is a detailed list of your appointment and prescription history, cryptographically signed and commited to the blockchain ledger


A channel to talk about topics that don't fit into any other channel. You can also share interesting links here.
100 messages
Before 05-Dec-19 12:00 AM
actionslacks13-Oct-18 06:22 AM
a lot of bankers commit suicide... all I'm saying
you're right.
they are afraid
just saying. don't doubt for a second that this is a honeypot because it is
we are all being monitored.
I'm not wrong
yes... and that is what justifies the level of scrutiny that we are under
I'm doxxed, genie is doxxed, hollow is doxxed, I'm not curious enough about any non americans but all of our identities are known
dont doubt that for a second my friend
we are playing with fire
yeah honestly trying to be anonymous is just for other people.  It's still trackable now
crypto is our last and best hope. it is an arms race.
I know the best minds are on the side of good though. and that is comforting
actionslacks13-Oct-18 07:11 AM
Good question, idk.
jl777c13-Oct-18 07:11 AM
not living in an electronic police state is a good start
1
smaller countries where it is still acceptable to use cash
not some nonsense by border police that "the cash is illegal" so we will take it from you, even though you did nothing wrong. how do people tolerate that?(edited)
2
actionslacks13-Oct-18 07:19 AM
Living outside of a police surveillance state... well there is lots of countryside
jl777c13-Oct-18 07:21 AM
or in a big city (outside of a police state)
luxury submarine is good too
1
actionslacks13-Oct-18 07:21 AM
Well... #opsec?
Help us hide
Shit is getting real
jl777c13-Oct-18 07:22 AM
just common sense. if you need an address, get a post box
if you need a phone number, (best not to), use a prepaid plan
unregistered
internet proxy
actionslacks13-Oct-18 07:23 AM
Yeah i tried, they still got me
Its a game
jl777c13-Oct-18 07:23 AM
nothing says you need to post all your personal info on social media sites, but that seems to be a strongly incentivized system to participate
actionslacks13-Oct-18 07:24 AM
Im as much of a ghost as i can be.   I just keep moving. I don’t care anymore. Im not doing anything illegal.
jl777c13-Oct-18 07:28 AM
who sent the text?
phones are pretty bad, just live without one
2
actionslacks13-Oct-18 07:35 AM
life is very strange and wonderful. this too shall pass. perhaps I merit attention for now. soon i'll just be a grain of sand on the beach.
but thanks for letting me vent
PHBA206113-Oct-18 10:14 AM
EOS network already get congested with all the spam transactions from gambling games ...
Cryptoon13-Oct-18 10:30 AM
I wouldnt consider that spam
Spam is unnecesary trafic
If its a legit dapp that is congesting the network
Blockstream is now openly pushing for INDIVIDUALS to convert their Bitcoin into “Bitcoin Liquid”. Liquid is controlled by Blockstream’s Federation, and Blockstream controls who is part of that Federation! Blockstream will OWN your pegged Bitcoin AND all your “asset...
if BTC need liquidity and has to move to a centralised altchain, it's better to move to KMD as a cluster of scalable asset chain
Howard Chu, (creator of LMDB, the data base used by Monero) was a CrashSpaceLA for a Monero Los Angeles Meetup and gave an extemporaneous talk about the Apri...
AlvinLeito13-Oct-18 08:09 PM
I can’t work that well with Discord, yet, so don’t know how to find the person interested in the Viisiit. and ViisiitCoin logo’s. The brandingrights-registration has been deposited, so I’m can start to show them more freely, so I put them on www.viisiitcoin.net (still working on the .com)
I opened my Linux Chromebook and found my (grounded) daughter was logged in. I guess props for bypassing my "hardened" profile. But it made no sense. Screen-lock-on-close was enabled and guest logins were blocked, and… /1
Here's how Nauru, a secluded island roughly 1,800 miles off the northeastern coast of Australia, went from being the wealthiest country in the world to losin...
If you bought $1000 worth of XRP in January it would now be worth $79.
If you bought $1000 worth of Bud Light in January, drank all the beer, and traded in the cans for a nickel deposit, you would have $79.
Retweets
2211
Likes
8092
1
javadth14-Oct-18 07:03 PM
hi
Cryptoon14-Oct-18 07:04 PM
hi
SHossain14-Oct-18 07:05 PM
hi
Yassin14-Oct-18 11:57 PM
yo!!
kolo15-Oct-18 01:04 AM
New offtop: what cars do you own/drive and why?
Hermes15-Oct-18 01:08 AM
I have a Nissan sedan is very cool and it's like a ninja car... it has a very good quality machine and I like it more than Korean cars that you get nowdays
I think is a very secure and practical car.
what about you?
kolo15-Oct-18 03:12 AM
I dont. I own ford kuga (ford escape at US market) but no drivers license. So only test flights when noone sees
Its actually ultra mega comfortable and easy to drive. Like that.
Others?
Cryptoon15-Oct-18 07:45 AM
Bmw 4 gran coupe
Fun car, looks kind of sporty but still has 4 doors so I can drive more than 2 comfortably
Also @kolo why own a car when you cant drive it?
Hahahaha
I have a neighbour with an impreza that has insane turbo sounds
I wish I had a video of my patrol ... it shas a deisel exaust 2.5" on a pertrol RB30 form a VL turbo ... all the noise comes frm the intake, sounds like a whistle
Track Number 1 of the album called PennyBridge Pioneers. LYRICS: Tell us where you're from, what you want to become. And we'll say if you're OK. Where did yo...
No cigar
ComputerGenie 👴👴👴15-Oct-18 03:28 PM
Comparing $:% the last bastion of hope for the maximalist
Hermes15-Oct-18 03:48 PM
What is happening to tether finally feeling the pressure
I am flabbergasted.
U. Mahadev first finds how to do classical homomorphic encryption on quantum circuits, uses this to generate provably random numbers and then finds an incredibly clever way to verify quantum computations with a classical computer.
https://t.co/uprN6Km...


[ Age-related changes in glucocorticoid and mineralocorticoid receptors in lymphocytes of healthy persons and patients with hypertension] It has been found that the number of glucocorticoid receptors in lymphocytes of the peripheral blood of healthy elderly subjects increases, while the number of mineralocorticoid receptors decreases.
Abstract
The mechanisms of hormone-receptor interactions in hypertension are activated: the number of glucocorticoid and mineralocorticoid binding sites grows in hypertensive patients. Still a more essential rise in the number of receptors is observed in mid-age hypertensive patients than in elderly ones.


Methods
(static) invariant(condition, messageopt) → {void}
- Since:
- 1.0.0
- Source:
Parameters:
| Name | Type | Attributes | Description |
|---|---|---|---|
condition |
*
|
function
|
Condition that must be complied |
|
message |
string
|
<optional> |
Message error to be thrown in case condition is not fulfilled |
Throws:
Will throw an error with the message supplied if condition is not fulfilled.
Returns:
- Type:
-
void
Example
invariant(R.is('number')(3), 'Supplied value is not a number'); //=> undefined
invariant(R.is('number')('3'), 'Supplied value is not a number'); //=> 'Supplied value is not a number'


#include <BehaviorDrivenDesignTest.h>
Public Member Functions | |
| TestWhen () | |
| void | occurs (const World &) |
| bool | get_occurs_called () const |
Definition at line 91 of file BehaviorDrivenDesignTest.h.
| BibleDatabaseBehaviors::TestWhen::TestWhen | ( | ) | [inline] |
Definition at line 94 of file BehaviorDrivenDesignTest.h.
| bool BibleDatabaseBehaviors::TestWhen::get_occurs_called | ( | ) | const [inline] |
Definition at line 103 of file BehaviorDrivenDesignTest.h.
| void BibleDatabaseBehaviors::TestWhen::occurs | ( | const World & | ) | [inline, virtual] |
Implements BehaviorDrivenDesign::IWhen.
Definition at line 98 of file BehaviorDrivenDesignTest.h.


As always, we’ll need three files:
As seen above, our clock has many different elements that make it well, a clock. No, we aren’t using any old image. Instead, we’ll be using CSS to handcraft this clock ourselves. If you count up all the different elements in the clock, you will notice that we need nine different divs for the following:
Let’s create those divs in our index.html file:

<title>Clock</title>
<meta name="viewport" content="width=device-width, initial-scale=1">
<link rel="stylesheet" href="style.css" />

Notice how we set ids for the arms so that when we actually want to make them move, it’ll be easier to communicate with them in JavaScript.
Here comes the hard part. We have to actually design the clock with nothing but CSS. First, we have to set our black background and make the circular shape of the clock. We can do that by starting with a height and width of the clock class to be 500px, and the border-radius to 100% so that we can make it circular. We also need a border with a greyish (#aaaaaa) color, and to make the clock centered on the page, we can use the margin and position attributes. Here’s what the CSS so far should look like:
* {
margin: 0;
padding: 0;
border: 0;
}
body {
background-color: #000;
}
.clock {
height: 500px;
width: 500px;
background-color: #DDDDDD;
border-radius: 100%;
border: 3px solid #AAAAAA;
margin: auto;
position: absolute;
top: 0; left: 0; bottom: 0; right: 0;
}
Now that we’ve got this big circle on our screen, we need to make the small indicators for the third, sixth, ninth, and twelfth hours. We can do this by making all four of those divs have a width of 3px, a length of 15px, a color of #000 (black), and playing around with the position (top, bottom, left, right) attributes:
.twelve {
position: absolute;
width: 3px;
height: 15px;
background: #111111;
left: 0;
top: 0;
right: 0;
margin: 0 auto;
}
.three {
position: absolute;
width: 15px;
height: 3px;
background: #111111;
top: 0;
bottom: 0;
right: 0;
margin: auto 0;
}
.six {
position: absolute;
width: 3px;
height: 15px;
background: #111111;
left: 0;
bottom: 0;
right: 0;
margin: 0 auto;
}
.nine {
position: absolute;
width: 15px;
height: 3px;
background: #111111;
top: 0;
bottom: 0;
left: 0;
margin: auto 0;
}
Alright, now we’ve got a better looking clock. However, it isn’t quite done yet! We still need to design the hour, minute, and second arms! This is where it gets a little more complex as all of these arms have different lengths and widths. Before that, however, we just need a small dot in the center. For the second hand, let’s set a height of 160px, a width of 2px, and a #ff4136 (red) color. For the minute hand, we can set a height of 200px, and a width of 2px, and a #000 (black) color. Lastly, for the hour hand, we can set a height of 80px, a width of 6px, and a #000 (black) color. For all of the hands we also need to set a -webkit-transform-origin so that the element can move it’s position once we link it with our JavaScript. And lastly, we need to play around with the positioning to make the hands sit on the center dot perfectly:
.center {
width: 10px;
height: 10px;
position: absolute;
left: 0; right: 0; bottom: 0; top: 0;
margin: auto;
background: #000;
border-radius: 100%;
}
#seconds {
position: absolute;
height: 160px;
width: 2px;
left: 0; right: 0; bottom: 160px; top: 0px;
margin: auto;
background: #000;
-webkit-transform-origin: bottom;
background: #FF4136;
}
#minutes {
position: absolute;
height: 200px;
width: 2px;
left: 0; right: 0; bottom: 200px; top: 0px;
margin: auto;
background: #000;
-webkit-transform-origin: bottom;
}
#hours {
position: absolute;
height: 80px;
width: 6px;
left: 0; right: 0; bottom: 80px; top: 0px;
margin: auto;
background: #000;
-webkit-transform-origin: bottom;
}
We now have a good-looking clock, but it doesn’t move it’s hands! Let’s change that with some JavaScript.
To make our hands actually move, we have to write a function in JavaScript. Since every circle is 360 degrees, and there are 12 hours, after each hour, the hour hand will move 30 degrees. Similarly, since there are 60 minutes in an hour, and 60 seconds in a minute, the minute and second hands will both move 6 degrees every minute or second. So, all we have to do, is make those element id’s rotate those degrees using the -webkit-transform:rotate attribute. Here’s what our JavaScript function should look like:
function moveHands() {
with(new Date()) {
h = 30 * (getHours() % 12 + getMinutes() / 60); // 30 degrees hour
m = 6 * getMinutes(); // 6 degrees every minute
s = 6 * getSeconds(); // 6 degrees every second
// setting the rotate CSS attribute to those degree values -->
document.getElementById('seconds').style.cssText = "-webkit-transform:rotate(" + s + "deg);";
document.getElementById('minutes').style.cssText = "-webkit-transform:rotate(" + m + "deg);";
document.getElementById('hours').style.cssText = "-webkit-transform:rotate(" + h + "deg);";
setTimeout(moveHands, 1000); // calling the function every second
}
}
window.onload = moveHands; // making sure the function starts on load of webpage
You did it! We now have a fully-functional, minimal, and beautiful clock. I hope you’ve learned a ton in terms of CSS design and JavaScript’s functionality in these types of projects.
Don’t stop! Maybe make the time display digitally underneath it, customize the look of the clock to your style, or even better - try and make the clock responsive with media queries!


Faisal came to me in week 12 with a Capture The Flag challenge video. He said it was quite cool and asked if I could recreate it and possibly add additional tasks as it would be something fun to do, it would be educational for both myself and any other students interested in taking my challenge and it would look good on my portfolio. Link to the video here
I created this CTF challenge using a very basic Azure VM. There were 2 flags in the challenge. One involved checking Apache2 log files for a Curl command to a specific web address. The other involved me zipping up an image file and hiding it within another file. This file was hidden as a .png when it was a zip file. I made it even harder by changing file names to messages encrypted using ROT13. The challenge wasn't designed to be hard, but to get students thinking logically, transversing systems finding clues and to get them to think about security. It was also a bit of fun towards the end of the semester, where everyone is stressing.
By the end of Week 12, I had launched the VM with a public IP address and written instructions for students. I uploaded this to Teams so students could access everything. I showed Faisal and students were to message him when they'd found the flags and what they contained.
Finishing the Capture The Flag challenge, I focused my attention back on DB3 Docker and started on a build plan. This closely resembled the DB2 plan as I was reading through Jordan's plan, but was a lot more simplistic as at its roots, the DB3 Docker server is simply a Ubuntu server running Docker with no additional software.
One thing I was uncertain of was network configuration as we need a range of ports open for Docker. I went through the current Docker server and saw it was running UFW. I read these rules, some of which were unclear to me so I messaged Rob asking to clarify some rules. We came to the conclusion that a lot of rules would now be unneccesary and to keep a range of ports open for Docker so students could remotely connect to their containers.
I then planned in which order I wanted to build the server to keep it most secure given it would have a public IP address. I started with all ports closed, opening port 22 for SSH access but gave the only active account a secure password so risk to the machine was very low. My plan was to then set up Docker, create the appropriate admin accounts, adjust the firewall through the Azure Network Security Group and then finalise configuration.
I finalised my plan and sent it off to Rob at the end of this week.
In between weeks 13 and the start of week 14, Rob got back to me and signed off on my build plan saying it looked good. I started work on the server immediately, given there was only 2 weeks of the semester left.
The build was quite simple therefore didn't take a lot of time. Following the build plan, I provisioned a B2mS server. Created neccessary accounts. Set up Docker and edited the Network Security Group for the firewall rules in the build plan. I then assigned a static IP. I launched a Docker container to check that Docker was running correctly and this was successful.
In the second half of the week, I decided to stress test the server. When DB3 is running, multiple containers will be running and resource issues had been apparent in a previous configuration of the DB3 Docker server.
This is where I discovered that the B2mS server was lacking enough resources to cope with the classroom load. I launched 10 containers simultaneously, and the server became very laggy to the point it was unresponsive. I
checked memory usage and memory usage of the 8GB RAM was 100%. Increasing RAM in a VM is not possible in Azure, you instead need to resize the VM. I contacted Rob to let him know what I had discovered and he agreed a resize
was neccessary and suggested a starting point of 16GB RAM. I looked into more B series VMs with 16GB RAM and the monthly cost was very excessive.
We discussed hardware requirements again and it was said that CPU performance is less important than memory performance as Docker is very memory intensive, therefore an E series memory optimised server would be better.
I found a server, slightly more expensive with similar specs but an increase to 16GB of RAM. I resized to this VM, a simple task, simply deallocate the current VM and resize in Azure Portal which retains all your configuration,
and began stress testing again. I was able to launch 20 containers simultaneously, an expected load for a class environment, but we were pushing RAM to near 100% with next to no room to spare. I sent Rob through a screenshot of all
20 containers running and the amount of free memory and we decided we needed another increase, he suggested a VM with 24GB or 32GB RAM. 24GB RAM would have been most ideal but Azure did not provide a VM with 24GB RAM. I
let Rob know this along with the cost of a VM running 32GB RAM. The price was within budget and we agreed to resize once again. Benefits of this is a much upgraded machine than the current one and no worry of resource issues.
I resized the VM again and did another stress test. I capped my stress test at 20 containers as this is very close to anything that will be run in the class environment. I sent through the current memory usage which was sitting
a touch above 16GB leaving almost 16GB free. Rob, myself and the server were much happier and this was going to be the final VM size that was needed.
Week 15 was largely spent working on documentation and doing final configuration on the DB3 Docker server.
DB3 students connect to their containers via SSMS and I needed to verify whether we could connect from SSMS to our new servers containers. This is when I discovered that we couldn't. I informed Rob and
adjusted firewall rules in Azure to temporarily allow all traffic in and out. This didn't solve our issue. I launched multiple containers using different ports and was successful in connecting on one port, 1433.
I let Rob know what was happening and he looked into it further, querying ISS. 1433 is a port open on the Otago Polytechnic network but the other port ranges we were trying were closed so we concluded that the OP firewall
was the issue and that when it came to running this new server, the OP firewall would need adjusting. Later that night, I tested the theory by connecting to a container from my home network on various ports and all connected
successfully. I let Rob know and he was happy as this was a minor issue that was out of our control but it meant the configuration of the servers firewall and setup was working as expected.
Week 16 marks the final week of the semester. A lot of this was also spent on documentation as the students next semester will be left to finish the remainder of the DB3 Azure merge and good documentation will make their job much simpler. I well documented the installation and set up guide of the DB3 Docker server. The cases of stress testing and needing to resize the VM were well documented. The documentation contained a lot of reasons why we're doing tasks a particular way.
Once I was happy with the DB3 server, I shut it off, compiled all documentation from the current server and the new server including proposals and build guides, scripts and KeePass files and transferred these onto Teams in a centrally located, easy to find place. In 2020 when I performed the DB2 load, we were set back weeks due to lack of any documentation. I did not want to pass a similar problem onto other students. I put these in Teams, sent Rob a message saying I'm happy to say the DB3 Docker server is complete and directed him where to find all these resources.
Rob was happy with all of this and happy with the progress I had made. He suggested for the few days left of the semester, to have a look around the DB3 Windows Server. He had to make an itintern account on this for me to access
and I was then able to have a look at a Windows Server as I'd never worked with one before from a DevOps point of view.


15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.13 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.20 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.11 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 184.9 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/1 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 139.2 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 646.0 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 726.1 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.899 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.706 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 250.6 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 216.0 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 802.8 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 775.6 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 1.010 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 973.5 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.970 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 297.9 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.441 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.351 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/1H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 151.4 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/1H/1 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 151.3 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 5 keys needed for M/1H/0 = 1 issued + 5 lookahead size + 0 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 617.0 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 5 keys needed for M/1H/1 = 1 issued + 5 lookahead size + 0 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 620.9 μs
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 63.77 μs for 2 scrypt iterations.
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.78 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 208.0 μs
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 57.06 μs for 2 scrypt iterations.
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 116.8 μs for 2 scrypt iterations.
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 56.13 μs for 2 scrypt iterations.
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 49.72 μs for 2 scrypt iterations.
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.921 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 669.3 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 661.9 μs
15:24:52 12 KeyChainGroup.maybeMarkCurrentKeyAsUsed: Marking key as used: DeterministicKey{pub=033941c0f28f6035e802d174934832975c70932a206e4222bd4c4bf5a5099bc877, chainCode=1db6f026058f401c93dc84d552bc9c223cc2acb6a726bf34d67b343839ec743e, path=M/0H/0/0, isEncrypted=false, isPubKeyOnly=false}
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.373 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 159.9 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/1 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 146.4 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.483 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 121.7 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 2 issued + 0 lookahead size + 0 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 140.7 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.96 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 144.1 μs
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 64.48 μs for 2 scrypt iterations.
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 49.29 μs for 2 scrypt iterations.
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 47.39 μs for 2 scrypt iterations.
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 50.58 μs for 2 scrypt iterations.
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.837 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 12.23 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.40 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.49 ms
15:24:52 12 KeyChainGroup.upgradeToDeterministic: Upgrading from basic keychain to P2PKH deterministic keychain. Using oldest non-rotating private key (address: 1DoSR6NE3Q2m6Cx8yvLoyv8ZTbCy5v8w77)
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.26 ms
15:24:52 12 KeyChainGroup.addAndActivateHDChain: Activating a new HD chain: DeterministicKeyChain{P2PKH, accountPath=[0H], lookaheadSize=100, lookaheadThreshold=33}
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 162.0 μs
15:24:52 12 KeyChainGroup.upgradeToDeterministic: Upgrading from basic keychain to P2PKH deterministic keychain. Using oldest non-rotating private key (address: 1DoSR6NE3Q2m6Cx8yvLoyv8ZTbCy5v8w77)
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.25 ms
15:24:52 12 KeyChainGroup.addAndActivateHDChain: Activating a new HD chain: DeterministicKeyChain{P2PKH, accountPath=[0H], lookaheadSize=100, lookaheadThreshold=33}
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 191.7 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.80 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 319.6 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 194.9 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.62 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 196.9 μs
15:24:52 12 KeyChainGroup.maybeMarkCurrentKeyAsUsed: Marking key as used: DeterministicKey{pub=023ffaca6e2d9317819c2e02112fd6364a2c2e73abc14492d9d6b48132a0f12608, chainCode=a63ab363e5f9ca93dd4f6dbecd88d02221406719b9cdee65192bbc2c47107297, path=M/0H/0/0, isEncrypted=false, isPubKeyOnly=false}
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 2 issued + 0 lookahead size + 0 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 251.6 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.77 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 123.4 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 671.5 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 946.3 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 8 issued + 0 lookahead size + 0 lookahead threshold - 7 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 245.8 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 8 issued + 5 lookahead size + 1 lookahead threshold - 8 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 1.034 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.78 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.22 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 161.2 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 236.0 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 1.129 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 705.1 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 1.149 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 1.172 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.13 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 148.9 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 226.7 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 703.9 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 742.8 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 655.0 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 778.2 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 8 issued + 0 lookahead size + 0 lookahead threshold - 7 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 230.9 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 8 issued + 0 lookahead size + 0 lookahead threshold - 7 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 270.1 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 8 issued + 5 lookahead size + 1 lookahead threshold - 8 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 1.041 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 8 issued + 5 lookahead size + 1 lookahead threshold - 8 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 799.4 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 12.10 ms
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 39.17 ms for 16384 scrypt iterations.
15:24:52 12 KeyChainGroup.upgradeToDeterministic: Upgrading from basic keychain to P2PKH deterministic keychain. Using oldest non-rotating private key (address: 174xfrmGBASNkxMDMrM9krv9zzk4txDFtU)
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.10 ms
15:24:52 12 KeyChainGroup.addAndActivateHDChain: Activating a new HD chain: DeterministicKeyChain{P2PKH, accountPath=[0H], lookaheadSize=100, lookaheadThreshold=33}
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.63 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.57 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 148.7 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 230.5 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 1.481 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 973.7 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 729.4 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 773.1 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 12.90 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.33 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 697.2 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 1.056 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 145.1 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 682.9 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 886.5 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 7 issued + 0 lookahead size + 0 lookahead threshold - 6 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 168.5 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 7 issued + 5 lookahead size + 1 lookahead threshold - 7 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 763.0 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 7 issued + 5 lookahead size + 1 lookahead threshold - 7 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 655.4 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.67 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.16 ms
15:24:52 12 KeyChainGroup.addAndActivateHDChain: Activating a new HD chain: MarriedKeyChain{P2PKH, accountPath=[0H], lookaheadSize=100, lookaheadThreshold=33}
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.77 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 16.88 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.16 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 226.1 μs
15:24:52 12 KeyChainGroup.addAndActivateHDChain: Activating a new HD chain: DeterministicKeyChain{P2PKH, accountPath=[1H], lookaheadSize=100, lookaheadThreshold=33}
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/1H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 237.0 μs
15:24:52 12 KeyChainGroup.addAndActivateHDChain: Activating a new HD chain: DeterministicKeyChain{P2WPKH, accountPath=[44H, 0H, 0H], lookaheadSize=100, lookaheadThreshold=33}
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/44H/0H/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 214.1 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 11.21 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.66 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 153.2 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 155.2 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 746.9 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 790.4 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 666.2 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 681.9 μs
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.32 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 5 keys needed for M/0H/0 = 0 issued + 5 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 657.6 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 5 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 613.3 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 2 keys needed for M/0H/0 = 2 issued + 5 lookahead size + 0 lookahead threshold - 5 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 252.7 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/1 = 1 issued + 5 lookahead size + 0 lookahead threshold - 5 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 137.5 μs
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 60.93 μs for 2 scrypt iterations.
15:24:52 12 KeyCrypterScrypt.deriveKey: Deriving key took 59.57 μs for 2 scrypt iterations.
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.842 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.08 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.733 ms
15:24:52 12 KeyChainGroup.upgradeToDeterministic: Upgrading from basic keychain to P2PKH deterministic keychain. Using oldest non-rotating private key (address: 1LvduDTP4yfdyXHbNY9mFBvVNVZAGekszi)
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 9.718 ms
15:24:52 12 KeyChainGroup.addAndActivateHDChain: Activating a new HD chain: DeterministicKeyChain{P2PKH, accountPath=[0H], lookaheadSize=100, lookaheadThreshold=33}
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.70 ms
15:24:52 12 MnemonicCode.toSeed: PBKDF2 took 10.61 ms
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/1H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 163.4 μs
15:24:52 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:52 12 DeterministicKeyChain.maybeLookAhead: Took 175.8 μs
15:24:53 12 MnemonicCode.toSeed: PBKDF2 took 10.63 ms
15:24:53 12 MnemonicCode.toSeed: PBKDF2 took 10.20 ms
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 223.5 μs
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 262.7 μs
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 1.070 ms
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 820.8 μs
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 1 issued + 5 lookahead size + 1 lookahead threshold - 1 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 676.4 μs
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 697.4 μs
15:24:53 12 MnemonicCode.toSeed: PBKDF2 took 10.13 ms
15:24:53 12 MnemonicCode.toSeed: PBKDF2 took 11.16 ms
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 149.0 μs
15:24:53 12 MnemonicCode.toSeed: PBKDF2 took 10.22 ms
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/0 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 693.1 μs
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 6 keys needed for M/0H/1 = 0 issued + 5 lookahead size + 1 lookahead threshold - 0 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 731.2 μs
15:24:53 12 MnemonicCode.toSeed: PBKDF2 took 10.57 ms
15:24:53 12 MnemonicCode.toSeed: PBKDF2 took 10.51 ms
15:24:53 12 KeyCrypterScrypt.deriveKey: Deriving key took 64.20 μs for 2 scrypt iterations.
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 1 issued + 0 lookahead size + 0 lookahead threshold - 0 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 135.2 μs
15:24:53 12 DeterministicKeyChain.maybeLookAhead: 1 keys needed for M/0H/0 = 2 issued + 0 lookahead size + 0 lookahead threshold - 1 num children
15:24:53 12 DeterministicKeyChain.maybeLookAhead: Took 192.2 μs


Resources marked with > are used, have been used, or are actively advocated in the threads. This applies for everything in the [Necessities] section.
[Necessities]
Hiragana & Katakana: http://www.realkana.com/ OR
Remembering the Kana: https://anonfiles.com/file/096e5b285b874c9bf0f83d7094e0e81d
Kanji: http://kanjidamage.com/
Japanese IME: http://www.google.com/intl/ja/ime/
Anki Flashcards: http://ankisrs.net/
Genki (↓Bottom↓)
Tae Kim Japanese: http://www.guidetojapanese.org/learn/grammar
http://rikaisama.sourceforge.net/ (Firefox only)
[Websites]
http://japanese.stackexchange.com/
https://www.erin.ne.jp/en/lesson01/basic/index.html (video + script)
http://www.yomiuri.co.jp/dy/columns/0002/ (column of short Japanese lessons)
http://www.imabi.net/ (grammar)
http://en.wikipedia.org/wiki/Japanese_grammar (surprisingly comprehensive and useful)
http://www.memrise.com/ (basically anki with flowers and other neat and colour features and methods)
[Grammar]
>http://www.guidetojapanese.org/ (Tae Kim) (Site seems to be down quite often so you might want to download this http://www.mediafire.com/download/hq2536ew6anf5wt/grammar_guide.pdf)
http://www.csse.monash.edu.au/~jwb/j_gram_summ.html
http://www.jekai.org/
http://www.geocities.jp/niwasaburoo/index.html - Book on Japanese grammar, written in Japanese
http://www.hello-school.net/hsjap.htm
http://en.wikibooks.org/wiki/Japanese/Grammar
http://kimallen.sheepdogdesign.net/Japanese/index.html
http://www.jgram.org/ - jgram has not updated to the new JLPT levels yet, but the grammar hasn't changed.
http://www.tanos.co.uk/jlpt/skills/grammar/
http://it.scribd.com/doc/6579312/A-Dictionary-of-Japanese-Particles
http://ww8.tiki.ne.jp/~tmath/home/index.htm
Yōkouso! http://www.mediafire.com/?rewg4tx4wte4bxv udp://tracker.openbittorrent.com:80
>http://thepiratebay.sx/torrent/5892518/Japanese_the_manga_way.pdf (Japanese The Manga Way)
[Helpful Forums]:
http://www.guidetojapanese.org/forum/
http://thejapanesepage.com/
[Kanji]
http://kanji.koohii.com/learnmore
>http://kanji.sljfaq.org/ - Look up kanji through stroke order.
http://www.asahi-net.or.jp/~ik2r-myr/kanji/listjouyou_en.htm
http://kakijun.main.jp/ (stroke order)
https://docs.google.com/spreadsheet/ccc?key=0AuzSRjg-3K_vck9HZmp5YmVkMXJHMDRpMmU2UzFWVkE#gid=0 - A list of the 3622 most common Kanji characters found in the Japanese Wikipedia, along with their frequencies.
http://www.mediafire.com/?n0nj66yyj7dsqyz - Collection of images from the threads. This link should contain around a 3000 or so kanji. A few images may or may not be missing. Be careful of blunders I might have made as well. If you would like for this to be updated simply ask.
https://mega.co.nz/#!08NiWI4C!KzBPdt9odA_tMLbHRocpEO9bYQpKOt8G4y19VKvLeu4 - Slime Forest
[Listening Practice]
http://www.njuku.com/
http://jclab.wordpress.com/
http://hukumusume.com/douwa/pc/minwa/
http://www.simulradio.jp/
[Online Dictionaries/Thesauruses]
http://dic.yahoo.co.jp/
>http://dic.nicovideo.jp/
>Good for slang.
>http://kotobank.jp/
Good for your rarer words and terms.
http://dictionary.goo.ne.jp/
>http://tangorin.com/
>Provides example sentences along with other common dictionary features.
>http://www.alc.co.jp/ - Example sentences
http://zokugo-dict.com/ (general slang)
http://www.geocities.jp/tomomi965/index2.html (for idioms/set phrases)
http://www.media-k.co.jp/jiten/ (for 2ch slang/memes/catch phrases)
http://dbms.kokken.go.jp/nknet/Onomatope/category.html (onomatopoeia)
http://www.rondely.com/zakkaya/dic5/index.htm (onomatopoeia)
http://home.alc.co.jp/db/owa/s_kaydic?ctg_in=4 (onomatopoeia)
http://gogen-allguide.com/ (word etymology)
http://kanji.reader.bz/ (kanji readings, works for names too)
http://www016.upp.so-net.ne.jp/hougenn/ (for different Japanese dialects)
>http://www.weblio.jp/
[Other]
>http://lang-8.com/ - (Practice Japanese by writing short passages, receive and give corrections from and to native Japanese speakers)
http://japanese-speedtest.10fastfingers.com/
http://lazunin.com/kage_en.html
ttp://www.start-point.net/nihontizu/ - Prefecture Names
http://iteslj.org/v/j/ (Vocab Quizzes)
http://www.offbeatband.com/2010/12/the-most-commonly-used-japanese-words-by-frequency/
http://www.csse.monash.edu.au/~jwb/wwwjdicinf.html#code_tag - Info on tags that rikai uses.
>http://www.supermemo.com/articles/20rules.htm (Interesting article on learning. Recommended Reading, especially if you're wondering how you should set up your decks and so forth.)
http://www.mediafire.com/?dckt6ix32l93f35 (Collection of the Nihonshock cheatsheets in pdf format.)
>http://kanjitomo.com/ - 「KanjiTomo is a program for identifying Japanese characters from images」
http://lapapps.net/ (Kanji for Games, that is, Game X's kanji.)
http://sukebei.nyaa.eu/?page=torrentinfo&tid=23370 - JapanesePod
http://gloss.dliflc.edu/Default.aspx
http://pastebin.com/xUufY26D - Small pastebin of some resources. Used to be in the Op.
[Reading and/or Watching]
https://docs.google.com/spreadsheet/lv?key=0Agk2IH0ZXhn7dDNmSW1BVFU5dVgyOHkzWjU4b2l2dkE&pli=1
>A reading list made by a kind anon from these threads, and for these threads. Be sure to add stuff you're reading in here.
http://www.portals.co.jp/isopp/
http://www.mediafire.com/?93atzwak7dx47- a Mediafire of documents and raw manga to get you started with reading
http://chokochoko.wordpress.com/the-great-library/
http://www.j-comi.jp/
>A Japanese website that provides free (older) manga to read. Mostly tons of old stuff, but it has the entire set of Love Hina (http://www.j-comi.jp/book/comic/1) volumes, which is a pretty entertaining series.
http://amaterasu.tindabox.net/guide/j-comi.php
>This takes a few dozen pages of actual manga, takes apart every single sentence and shows you how to translate them
http://www.fengyunzhibo.com/space/japan.htm (Chinese site with Japanese television stations. Good quality as well.)
http://www.jcafe24.net/index.php
>Another source for manga. You have to set up an account and make a post on one of their forums before you can access the Winny Club, which is where the raw manga is.
>http://kitsunekko.net/subtitles/japanese/
>Japanese subtitles for a ton of different anime shows. The only problem is that some of the subs seemed to be timed wrong when used with common raws (Ex: the Japanese subs are set for a 24 minute episode, while the raw is 22 minutes). So you might have to open them up with a subtitle editor and change the times. Regardless, you can usually use these subs with the anime you already have, just disable English subs and load the Japanese subs. For the anime subs, it's worth looking into using a text hooker to extract the text to make it easy to paste into Anki or a dictionary. (Such as AGTH)
http://www.livingjapanese.com/p/reading-pack.html
http://www.mediafire.com/download/rzigb3zrcdta35p/Reading+pack+1+and+2.zip
>Yotsuba Reading pack. First is the official page it came from, and the second link is a download for both reading packs made.
http://www.raw1st.org/
http://www.portals.co.jp/isopp/
http://rawcs.blogspot.co.il/p/manga-index.html
http://www.rawmangaspot.com/
http://www.raw-manga.net/
http://rawscans.com/
http://shareraws.blogspot.co.il/
http://crazy-cake.blogspot.co.il/p/homepage.html
http://mangahead.com/
>http://www.aozora.gr.jp/
[E-Books (PDF)]
Making Sense of Japanese Grammar (2.56 MB)
*http://www.mediafire.com/?d8hvs7jyb0fi156
Japanese Core Words and Phrases (3.79 MB)
*http://www.mediafire.com/?z1fcbxw4vbnfb2p
Japanese Particle Workbook (39.2 MB)
*http://www.mediafire.com/?4c4387dbbg86a43
Japanese Verbs and Essentials of Grammar (82.1 MB)
*http://www.mediafire.com/?c3c83or0a5xz2dw
Japanese Beyond Words (27.1 MB)
*http://www.mediafire.com/?dcc3yaay9w4fj5c
Read Real Japanese (80.5 MB)
*http://www.mediafire.com/?sg2yr34ehldh6ir
Oxford Japanese Grammar & Verbs (40.1 MB)
*http://www.mediafire.com/?8xk6v525idpbdb8
JLPT - Teach Yourself Japanese (32.1 MB)
*http://www.mediafire.com/?lpwckercaq3mfiw
(DOJG)
>Highly recommended resources on the Japanese language. In particular their は and が particle explanations in DOBJG provide particullary useful explanations.
>Dictionary of Basic Japanese Grammar (24 MB) (DOBJG)
*http://www.mediafire.com/?c1swbbihl97s77b
>Dictionary of Intermediate Japanese Grammar (29.6 MB) (DOIJG)
*http://www.mediafire.com/?7obxdz023iiw3c8
>Dictionary of Advanced Japanese Grammar (65.4 MB) (DOAJG)
*http://www.mediafire.com/?r61j67rmntthy9u
(Genki)
>Genki I (150.4 MB)
>*http://www.mediafire.com/?4dsxbexuv92xvuj
Genki I Workbook (28.6 MB)
*http://www.mediafire.com/?orjq8jfja8lj4aq
(Supplemental Audio CDs.)
Genki I CDs 1 & 2 (102.1 MB)
*http://www.mediafire.com/?u4ab7xyd2pgi0k7
Genki I CDs 3 & 4 (118.7 MB)
*http://www.mediafire.com/?bjzhrte35es2e4z
Genki I CDs 5 & 6 (119.1 MB)
*http://www.mediafire.com/?2apq4wv4j2rs9qu
Genki II (162.4 MB)
*http://www.mediafire.com/?a2t5giuv35if4gm
Genki II Workbook (128.7 MB)
*http://www.mediafire.com/?mm77vpi9731okst
Genki II CDs 1, 2, & 3 (103.5 MB)
*http://www.mediafire.com/?6l55tomt2bnhrqq
Genki II CDs 4, 5, & 6 (95.5 MB)
*http://www.mediafire.com/?b0m4063od4ghcfm
Genki I & II Answer Key (65.9 MB)
*http://www.mediafire.com/?102h82qhflktjdt


selected:
reset
range:
reset
selected:
reset
Month
Total Sales
Total TV Vol.
Total Radio Vol.
Total Newspaper Vol.


B43-FWCUTTER
Section: User Commands (1)Updated: 2007
Index Return to Main Contents
NAME
b43-fwcutter - manual page for b43-fwcutterSYNOPSIS
b43-fwcutter [OPTION] [DRIVER]DESCRIPTION
b43-fwcutter can extract the firmware for your Broadcom 43xx hardware from different closed source drivers. The b43 driver depends on this firmware files and can't work without them.Currently b43-fwcutter supports Apple MacOS X, Microsoft Windows 98/ME/2000/XP and Linux drivers, but keep in mind that b43-fwcutter doesn't support all driver versions.
Example:
- b43-fwcutter bcmwl5.sys
to cut the firmware out of bcmwl5.sys
OPTIONS
- -l|--list
- List supported driver versions
- -i|--identify
- Only identify the driver file (don't extract)
- -w|--target-dir DIR
- Extract and write firmware to DIR
- -a|--alt-iv
- Extract alternative initvals (only 3.10.x.x)
- -p|--postfix ".FOO"
- Postfix for firmware filenames (.FOO.fw)
- -v|--version
- Print b43-fwcutter version
- -h|--help
- Print help information
AUTHORS
b43 development team, http://bcm43xx.berlios.de
Index
This document was created by man2html, using the manual pages.
Time: 05:29:02 GMT, December 24, 2015


SA Star Scoops Award In Europe
by Soccer LadumaFollowing his final-day heroics for FS Metta, young South African attacker, Kgotso Masangane, has been handed a major award by his club.
Take a look at the prize-giving ceremony in the gallery above
Masangane scored seven goals and got six assists in 30 games for the Latvian side as they successfully fended off relegation from the top-flight this season, including the opening goal in their crucial win over Super Nova in the second leg of their relegation playoff.
Read: Motaung Apologises For Chiefs’ ‘Shocking Performance’
This time last year the 21-year-old was playing for FC Zone Mavo in the ABC Motsepe League, but has come a long way since then after he was named as Metta’s Player of the Season for his efforts in his debut campaign at the club.
Having been voted as the club’s top player by their fans, Masangane was presented with his award at the end of season ceremony last week, bringing to an end a successful first stint in Europe following his move from South Africa earlier in the year.
Read: Star Suspended After Chiefs Win
Only one player in the side finished with more goals than the South African – Tamirlan Dzhamalutdinov with 10 – and just two players in the entire division managed to get more assists than he did.
You can check out Masangane’s final goal in the video below:


Q: What are your impressions?
I’m not new to the idea of a programming bootcamp. Most of them follow the same structure (Prep, Bootcamp and Career Support) I have friends who have done it and I always wanted to take it but taking 18 weeks from work wasn’t an option and there is none that was close to where I was residing at that time - Beijing, China.
We are all in this together
I like the quote that Shereef mentioned - “If you want to go fast, go alone. If you want to go far, go together.”
I feel like that is me sometime. Whenever I get excited, I’ll dive into it the rabbit hole and don’t want anyone to bother. However, I tend to loose the passion quickly because I'll get stuck at certain point and don’t have anyone I can ask for help or I did it because you want to get the badges - who doesn't like badges???. Also, there is only you can get from interaction through message board. One big reason to do this bootcamp is to have that experience in working with a group of people who share common goal.
It is okay to break things
Something that I really need to keep in mind. Even if you break something, hopefully you already learned to follow development best practices and not have to start from scratch.
Q: How do you see yourself engaging with this type of culture?
With great enthusiasm and open mind. Though people say that I’m an introvert so this is a good practice for me to be more open.
Q: Are you excited to participate in this kind of learning environment? Does it make you nervous?
Definitely excited!! So far people I talked to on Slack have been pretty welcoming! :)


B
est
A
rticle
T
o
S
upport
BATS
Search
Log In
Register New Account
Welcome,
!
Sign Out
New Claim
New Claim Question
Claim Source
Submit Claim
View All Claims


Terence Lewis
Terence Lewis (born 10 April 1975) is an Indian dancer and choreographer, specializing in contemporary dance. He is known as a choreographer and judge in reality dance series..Dance India Dance Season 1, 2, 3 (2009 to 2012). He runs his 'Terence Lewis Contemporary Dance Company' in Mumbai, holds dance workshops both in India and abroad. He has choreographed Bollywood films like, Lagaan (2001), Jhankaar Beats (2003) and Naach (2004), apart from musicals, stage shows, ads, music videos and national and international dance competitions.He was recently a judge of Nach Baliye 5, along with actress Shilpa Shetty and film director Sajid Khan. And currently seen judging Nach Baliye Shriman v/s Shrimati along with actress and Nach Baliye 5 judge Shilpa Shetty and film director and choreographer Farah Khan..Terence Lewis also got Staar Parivaar Award for Favourite Judge. He also choreographed Disney India's first theatre production Beauty and the Beast.
He is a choreographer in Bollywood films and musicals, stage shows, ads and music videos. Terence has choreographed a number of films and musicals as a choreographer. Terence has choreographed a number of stage shows, Indian contemporary performances, Bollywood Shows, corporate launches, Broadway Westend musicals, feature films, several popular music videos, and has appeared in advertisements. Terence won the 2002 American Choreography Award for his choreography for songs of the movie Lagaan along with Saroj Khan, Raju Khan, Ganesh Hegde and Vaibhavi Merchant.


BLOCK(7f) - [FORTRAN:EXECUTION CONTROL] construct (LICENSE:PD)
[ block-construct-name : ] BLOCK [ specification-part ] END[ ]BLOCK [ block-construct-name ]
The BLOCK construct is an executable construct which may contain
declarations, and may be exited using the EXIT statement.The specification-part of a BLOCK construct shall not contain a COMMON,
EQUIVALENCE, IMPLICIT, INTENT, NAMELIST, or OPTIONAL statement.A SAVE statement in a BLOCK construct shall not contain a
common-block-name.Except for the ASYNCHRONOUS and VOLATILE statements, specifications
in a BLOCK construct declare construct entities whose scope is that
of the BLOCK construct.
Sample programs:
program demo_block implicit none integer,parameter :: arr1(*)=[1,2,3,4,5,6,7] integer,parameter :: arr2(*)=[0,1,2,3,4,5,6,7]call showme(arr1) call showme(arr2)
contains
subroutine showme(a) integer,intent(in) :: a(:) integer :: i=-100
TESTFORZERO: block integer :: I ! local block variable do i=1,size(a) if(a(i).eq.0) EXIT TESTFORZERO enddo write(*,*)Never found a zero, tried ,i-1, times return endblock TESTFORZERO
! note the variable I in the block is local to the block write(*,*)found a zero, I=,i end subroutine showme
end program demo_block
Results:
Never found a zero, tried 7 times found a zero I= -100
| Fortran | BLOCK (7) | January 2017 |


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/octopus.20emoji.html ---
What do you use :octopus: for? I'm struggling to understand it, and searching doesn't clarify much.
It's for achievements
you level up
well, that's what I use it for.
So, it's like a “woo hoo!” kind of thing?
Arms in the air and all that?
I think that it was just the community's reaction to the fact that the octopus emoji was constantly listed as "popular"
so we had to make it popular
Which community, @Kevin Buzzard?
The Zulip lean-user community
Okay.
Someone just randomly used it for something because it was there
and then it just became a bit of a meme
as far as I can see, at least
I think those emojis under “Popular” were there from the beginning of https://leanprover.zulipchat.com/ and not as a result of being used more.
I've also been confused about :hammer_and_wrench:.
Most :octopus: come from Simon who indeed use them as “woo hoo!” . I have no idea what :hammer_and_wrench: means
At last some credit! :stuck_out_tongue_closed_eyes:
I think I'm also guilty of propagating :hammer_and_wrench: it's more of a "cool technical thing there" note
Appropriate for instance when one has a quiet "mind blown" moment
But I am quite liberal with them
There should be a "+1" emoji
You would imagine that a +1 emoji would be more useful than the "waxing gibbous moon" emoji they have...
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Feedback from the Community
Novice Hacks is purely community oriented product, all the projects and information is shared publicly to support [any|all] the programmers around the globe. Keeping this in mind, collecting feedback is most important inorder understand the pulse and to cater the content by shiftinf the point of foucs to aim the targeted audience.
Discussion board, is created from the awesome interface of DISQUS. Every project released or planned will have a discussion thread. I would request all interested & passionate folks to give your comments, suggestions and ideas in improving the product. I would also love to work with everyone of you, and you can connect and collaborate on the projects you like on GitHub.
I believe in honest feedback, either +ve/-ve do feel free to comment, and let me know your thoughts.
Discussion Board
Note: Have [Comments | Feedback | Suggetions | Ideas] feel free to launch a new discussion. (WE ARE HEARING YOU)


--- layout: nav title: Publications navigation: include navorder: 4 navigation-on: pubs termcmd: me.pubs(journs, confs) ---
Just testing


Catching Exceptions
In this post, we start exploring exceptions. We set up an interrupt descriptor table and add handler functions. At the end of this post, our kernel will be able to catch divide-by-zero faults.
+++ title = "Handling Exceptions using Naked Functions" +++
These posts explain how to handle CPU exceptions using naked functions.
Historically, these posts were the main exception handling posts before the
x86-interrupt
calling convention and the x86_64
crate existed.
Our new way of handling exceptions can be found in the
“Handling Exceptions” post.
In this post, we start exploring exceptions. We set up an interrupt descriptor table and add handler functions. At the end of this post, our kernel will be able to catch divide-by-zero faults.
In this post, we explore exceptions in more detail. Our goal is to print additional information when an exception occurs, for example the values of the instruction and stack pointer. In the course of this, we will explore inline assembly and naked functions. We will also add a handler function for page faults and read the associated error code.
In this post, we learn how to return from exceptions correctly. In the course of this, we will explore the iretq
instruction, the C calling convention, multimedia registers, and the red zone.


Webgl - Final Project
Toggle Animation |
Speed Up/Down :
+
-
WebGL ALL(translate , primitive assembly , shading , depth test , lookat, FOV)
welcome. This is a general lecture on Webgl.
We're going to take and explain topic with great visual impact.
Each topic is explained, followed by summary quiz. Let's start!
Primitive Assembly
There are three types of primitive assemblies. They are points, lines and triangles.
In My webgl course, you can view and compare 5 current points, line , triangle , triangle fan and triangle strip at the same time.
Based on the vertex, the point is marked at the corresponding vertex position, and the point size has been adjusted to a visible size.
A line is a line composed of two vertices, and line strip and line loop functions exist.
The line itself is a property that connects two different vertices,
and the line strip continuously overlaps one vertex, and in the line loop, the last vertex meets the first vertex again to form a loop.
The three-dimensional line you can see here is a general line.
Triangle is also divided into 3 parts. They are Triangles , triangle_fan , triangle_strip .
Triangles connect 3 different points, triangle_fan centers on one point,
and this point becomes a part of all vertices of the remaining triangles.
In triangle_strip, vertices are continuously overlapped like a line strip and triangles are connected.
Quiz1: Check the toggle animation checkbox. For 5 three-dimensional figures,
can you tell which draw_mode was used among the above 5 modes?
Probably, I think, it's not easy yet. Let's keep learning!
Translate
The next topic is translate! The key to Translate is the movement of points, not movement of figures. The keyword of shifting the origin point is at the heart of this topic. So, when translate and rotate are used together, the plane itself rotates after the origin point is moved. Remind yourself of what you learned in postscript. Check the toggle animation checkbox. How are the currently rotating 5 cubes made? The answer is translate. With the object in the center, I went through 4 translates to complete the shape of 5 cubes. At this point, be careful when performing the next translate because once the translate is executed, the changed position is considered the origin point!! (The current position should be the origin and computed.) It can be turned on and off via . Also, the original size cube in the center created a smaller size cube(inside). I did it with the scale function, try spinning the rotation on/off through the button below
spinning smallest_center_cube off/on :
on
off
Think about why there are 0 vertex(the number of vertices is zero) and 1 cube left??????
HINT: How can we make z-fight in our code? remind it
number of vertices (0~36)
Translate1 off/on :
on
off
Translate2 off/on :
on
off
Translate3 off/on :
on
off
Translate4 off/on :
on
off
Quiz2: Adjust the number of vertices. Can you see the difference?? Number of vertices controls the number of vertices so that only a certain number of vertices are left before rendering. Then, even if you make a cube with 36 vertices, some vertices will be ignored. At this time, do you know why the cube remains in the middle even though the number of vertices is set to 0? The next topic will explain why.
Depth test
The next topic is depth test. So far, no z-fighting is taking place. Because I didn't turn on depth test. Z-fighting is a phenomenon that occurs because different objects have the same z depth value and different pictures are drawn at the same time at the depth location where one should be drawn. Shall we turn on the depth test? You can clearly see the z-fighting phenomenon in the center cube. At this time, the depth test is where the objects to be drawn continue to pile up, and at this time, it plays a role in distinguishing the relationship between the objects after standing. If you turn on the depth test, you should see only one cube face in the center, but a face with two colors is visible. It looks like both sides are visible at the same time. This is proof that z-fighting is here now.
At this time, try to adjust the f and u values. In order to eliminate the z-fighting phenomenon, you need to adjust the f and u values (called polygon offset) to divide the precedence relationship at a specific z position where z-fighting occurs. In this case, this relationship is not reflected in the overall depth.
DEPTH_TEST
#############YOUR CHALLENGE: choose perfect f,u to remove all z-fight:##############
polygonOffset (factor, units) :
F
U
Set
IF z-fight of the cube(one of them(in edge side)) still remain, think about reason why???
HINT: think about cube with draw_mode TRIANGLE_FAN
This is the answer to the first quiz. Previously, it was difficult to distinguish objects because the depth test was not turned on, so I could not see the appearance, but now I think I can distinguish strips and lines by looking at the appearance of objects through the depth test. This is the answer to the second quiz. In order for Z-fighting to happen, you basically have to put two objects on top of each other in about the same position. This will cause them to fight each other at the z depth location. So, since two cubes are drawn, this phenomenon occurs because there is a cube that is normally affected by the number of vertices and a cube that is not affected by the number of vertices. #Quiz3 : YOUR CHALLENGE: choose perfect f,u to remove all z-fight IF z-fight of the cube(one of them(in edge side)) still remain, think about reason why??? HINT: think about cube with draw_mode TRIANGLE_FAN
lookat && FOV(field of view)
The next topic is lookat and field of view (FOV). The original object lies at position (0,0,0). And the camera looking at the object is displayed as if it is inside the object, so the camera is not positioned properly. So we have to set the origin (0,0,0) as the position of the camera, and move the object back/forward that much so that the camera at the origin is facing the object! The lookat function has important parameters such as eye, center, and up. First we need to specify the up vector. This is a normal vector for the camera!! For convenience, I will set it to [0,1,0]. (For the direction of the camera) And the center can be expressed as a vector where the object is located. Eye is where the camera is!! Now try pressing the auto and + - buttons in the place called move your cam. The position of the camera will change (in the y-axis direction).
FOV :
move your cam until -3.0 < cam_y < 3.0:
+
-
auto +
auto -
And FOV, short for field of view, adjusts the focal length of the camera to determine whether the camera sees a wide or narrow area. FOV is currently adjusted from 0 to 170. Try it yourself!
shading
The last topic is light position in shading. We learned about one of the lighting models, the phong model. It is divided into diffuse light, specular light and ambient light. Cosine value is used when calculating diffuse light. (The overall appearance is structrued.) The specular light changes as it moves relative to the object while only certain parts are very bright. These three lights can be expressed in RGB. Currently, we have created a button for what happens when you adjust the position of all lights (without dividing each light separately).
Light Position X,Y,Z (-4 ~ +4)
Quiz4: Try adjusting each bar for the light position x y z. If you go in one direction, the light moves closer to the object, and if you go in the opposite direction, the light moves away? no. Since this light moves according to the coordinates as if we put the camera or object on the coordinates, only when the object moves in the direction the light approaches the light and the light moves away from the rest. Check it out for yourself!
Reference
I referenced the code of Professor Hwan-Yong Lee's 12. Shading lecture.
https://github.com/hwan-ajou/webgl-1.0/tree/main/T12_Shading


Before Change
field_names=["when", "order", "dt",
"name", "type", "active",
"owner_name", "owner_type"])
self.entries = [ScheduleEntry(when=obj.when, order=obj.order,
dt=obj.clock.dt, name=obj.name,
type=obj.__class__.__name__,
active=obj.active,
owner_name=obj.group.name,
owner_type=obj.group.__class__.__name__)
for obj in objects if not len(obj.contained_objects)]
self.all_dts = sorted({float(entry.dt) for entry in self.entries})
// How many steps compared to the fastest clock?
self.steps = {float(dt): int(dt / self.all_dts[0]) for dt in self.all_dts}
After Change
field_names=["when", "order", "dt",
"name", "type", "active",
"owner_name", "owner_type"])
entries = []
for obj in objects:
if len(obj.contained_objects):
continue
owner = getattr(obj, "group", None)
if owner is None:
owner_name, owner_type = None, None
else:
owner_name = owner.name
owner_type = owner.__class__.__name__
entries.append(ScheduleEntry(when=obj.when, order=obj.order,
dt=obj.clock.dt, name=obj.name,
type=obj.__class__.__name__,
active=obj.active,
owner_name=owner_name,
owner_type=owner_type))
self.entries = entries
self.all_dts = sorted({float(entry.dt) for entry in self.entries})
// How many steps compared to the fastest clock?


| Package | Description |
|---|---|
| de.slothsoft.random.types |
| Class and Description |
|---|
| AbstractNumberRandomField
A base class for creating a
RandomField from a Number . |
| ArrayRandomField
A
RandomField representing an array. |
| BirthdayRandomField
A
RandomField representing a birthday, i.e. |
| BooleanRandomField
A
RandomField representing a Boolean or it's primitive counterpart. |
| CalendarRandomField
A
RandomField representing a Calendar between 10 years ago and 10 years in the future. |
| CharacterRandomField
Generates letters after a defined config stored in
WordGeneratorConfig . |
| CollectionRandomField
A
RandomField representing an Collection . |
| DateRandomField
A
RandomField representing a Date between 10 years ago and 10 years in
the future. |
| ElementFromListRandomField
A
RandomField representing an arbitrary object that is filled with a random
list element. |
| FirstNameRandomField
A
RandomField representing a String that should look like a first name. |
| FirstNameRandomField.Gender
Enum for setting the Gender of the first name.
|
| LocalDateRandomField
A
RandomField representing a LocalDate between 10 years ago and 10
years in the future. |
| LocalDateTimeRandomField
A
RandomField representing a LocalDateTime between 10 years ago and 10 years in the future. |
| LocalTimeRandomField
A
RandomField representing a LocalTime between 0:00 and 24:00 o'clock. |
| PatternRandomField
A field where you define a pattern and have a couple of random field to fill the
pattern with.
|
| PostalCodeRandomField
A
RandomField representing a String that should look like a postal
code. |
| StreetRandomField
A
RandomField representing a String that should look like a street
(i.e. |
| WordRandomField
Generates a word after a defined config stored in
WordGeneratorConfig . |
| WordsRandomField
Generates words in sentences and paragraphs after a defined config stored in
WordGeneratorConfig . |
Copyright © 2020. All rights reserved.


BC Mapping Source
This structure represents the following BC mapping definition:
shr.core.Ratio maps to Ratio: Numerator maps to numerator Denominator maps to denominator


The purpose of this lab is to better understand the F5 use cases OAuth2
and OpenID Connect by deploying a lab based on a popular 3rd party
login: Google. Google supports OpenID Connect with OAuth2 and JSON Web
Tokens. This allows a user to securely log in, or to provide a secondary
authentication factor to log in. Archive files are available for the
completed Lab 2.
Lab 3 Tasks:
TASK 1: Setup Google’s API Credentials
Refer to the instructions and screen shots below:
Note: If you do not have Google/gMail account, you will need to set one up. Navigate to:
|
|
|
You will be redirected to the Google API’s screen. If you are previously familiar with
Google API’s you can create a new Project.
If you have not been you will be prompted to create a New Project.
Click Create in the dialogue box provided.
|
|
In the New Project window, provide a Project Name. The suggested value is:
F5 Federation oAuth
Note: If you have exceeded your project quota you may have to delete a project or
create a new account
|
|
In the next screen, select OAuth Client ID for the Credentials type and
click Create Credentials
|
|
If you have not previously accepted a Consent Screen you may be prompted to do so.
Click Configure Consent Screen.
|
|
On the OAuth Consent Screen tab, enter the email address of your developer
account (pre-populated) for the Email Address.
For the Product Name Shown to Users enter app.f5demo.com.
Click Save.
|
|
- In the Create OAuth Client ID* screen select or enter the following values:
- Application Type: Web Application
- Name: app.f5demo.com
- Authorized JavaScript Engine: https://app.f5demo.com
- Authorized Redirect URIs: https://app.f5demo.com/oauth/client/redirect
- Click Create.
|
|
- In the OAuth Client pop-up window copy and paste your Client ID and
Client Secret in Gedit text editor provided on your desktop.
|
|
TASK 2: Setup F5 OAuth Provider
Refer to the instructions and screen shots below:
- Create the OAuth Provider by navigating to Access -> Federation ->
OAuth Client/Resource Server -> Provider and clicking Create.
|
|
- Using the following values to complete the OAuth Provider
- Name: Google_Provider
- Type: Google
- Trusted Certificate Authorities: ca-bundle.crt
- Allow Self-Signed JWK Config: checked
- Use Auto-discovered JWT: checked
- Click Discover.
- Accept all other defaults.
- Click Save.
|
|
TASK 3: Setup F5 OAuth Server (Client)
Refer to the instructions and screen shots below:
Create the OAuth Server (Client) by navigating to Access -> Federation ->
OAuth Client/Resource Server -> OAuth Server and clicking Create.
|
|
- Using the following values to complete the OAuth Provider
- Name: Google_Server
- Mode: Client
- Type: Google
- OAuth Provider: Google_Provider
- DNS Resolver: proxy_dns_resolver
- Client ID: <your client id>
- Client Secret: <your client secret>
- Client’s Server SSL Profile Name: serverssl
- Click Finished.
|
|
TASK 4: Setup F5 Per Session Policy (Access Policy)
Refer to the instructions and screen shots below:
Create the Per Session Policy by navigating to Access -> Profile/Policies ->
Access Profiles (Per Session Policies) and clicking Create.
|
|
- In the New Profile dialogue window enter the following values
- Name: Google_OAuth
- Profile Type: All
- Profile Scope: Profile
- Language: English
- Click Finished.
|
|
- Click Edit link on for the Google_OAuth Access Policy.
|
|
- In the Google_OAuth Access Policy, click the “+” between Start & Deny
- Click the Authentication tab in the events window.
- Scroll down and click the radio button for OAuth Client.
- Click Add Item.
|
|
- In the *OAuth_Client* window enter the following values as shown:
- Server: /Common/Google_Server
- Grant Type: Authorization code
- OpenID Connect: Enabled
- OpenID Connect Flow Type: Authorization code
- Authentication Redirect Request: /Common/GoogleAuthRedirectRequest
- Token Request: /Common/GoogleTokenRequest
- Refresh Token Request: /Common/GoogleTokenRefreshRequest
- OpenID Connect UserInfo Request: /Common/GoogleUserinfoRequest
- Redirection URI: https://%{session.server.network.name}/oauth/client/redirect
- Scope: openid profile email
- Click Save.
|
|
- Click on the Deny link, in the Select Binding, select the Allow radio button
and click Save.
|
|
- Click on the *Apply Access Policy* link in the top left-hand corner.
Note: Additional actions can be taken in the Per Session policy (Access Policy).
The lab is simply completing authorization. Other access controls can be implemented based
on the use case.
|
|
TASK 5: Associate Access Policy to Virtual Server
Refer to the instructions and screen shots below:
Navigate to Local Traffic -> Virtual Servers -> Virtual Server List and click
on the app.f5demo.com Virtual Server link.
Scroll to the Access Policy section.
|
|
Use the Access Profile drop down to change the Access Profile to Google_OAuth
Use the Per-Request Policy drop down to change the Per-Request Policy to
Google_oauth_policy
Scroll to the bottom of the Virtual Server configuration and click Update
|
|
TASK 7: Per Request Policy Controls
Refer to the instructions and screen shots below:
- In the application page for https://app.f5demo.com click the Admin Link shown
|
|
You will receive an Access to this page is blocked (customizable) message with a
reference. You have been blocked because you do not have access on a per request basis.
Press the Back button in your browser to return to https://app.f5demo.com.
|
|
Navigate to Local Traffic -> iRules -> Datagroup List and click on the
Allowed_Users datagroup.
Enter your Google Account used for this lab as the String value.
Click Add then Click Update.
Note: We are using a DataGroup control to minimize lab resources and steps. AD or LDAP
Group memberships, Session variables, other user attributes and various other access
control mechanisms can be used to achieve similar results.
|
|
You should now be able to successfully to access the Admin Functions by clicking on the
Admin Link.
Note: Per Request Policies are dynamic and do not require the same “Apply Policy” action as
Per Session Policies.
|
|
- To review the Per Request Policy, navigate to Access Profiles/Policies ->
Per Request Policies and click on the Edit link for the Google_oauth_policy.
|
|
- The various Per-Request-Policy actions can be reviewed
Note: Other actions like Step-Up Auth controls can be performed in a Per-Request Policy.
|
|
TASK 8: Review OAuth Results
Refer to the instructions and screen shots below:
Review your Active Sessions (Access -> Overview -> Active Sessions).
You can review Session activity or session variable from this window or kill the
selected Session.
|
|
- Review your Access Report Logs (Access -> Overview -> Access Reports).
|
|
- In the Report Parameters window click Run Report.
|
|
- Look at the SessionID report by clicking the Session ID Link.
|
|
Look at the Session Variables report by clicking the View Session Variables link.
Pay attention to the OAuth Variables.
Note: Any of these session variables can be used to perform further actions to improve
security or constrain access with logic in the Per-Session or Per Request VPE policies or
iRules/iRulesLX.
|
|
Review your Access Report Logs (Access -> Overview -> OAuth Reports ->
Client/Resource Server).
|
|


Luigi confirmation modal has been {{ confirmationModalResult }}
Confirmation modal with warning type
Alert
Luigi alert has been dismissed
Luigi alert dismissKey has been returned
Localization
Combine unsaved changes feature with Luigi Client UX manager methods!!
There are no unsaved changes – toggle this to be
asked for confirmation when you leave this page
There are unsaved changes – a confirmation modal
will appear when you navigate
somewhere else


eHive (EnsEMBL Hive) is a system for running computation pipelines on distributed computing resources - clusters, farms or grids. The name "Hive" comes from the way pipelines are processed by a swarm of autonomous agents.
eHive was originally conceived and used within EnsEMBL Compara group for running Comparative Genomics pipelines, but since then it has been separated into a separate software tool and is used in many projects both in Genome Campus, Cambridge and outside. There is eHive users' mailing list for questions, suggestions, discussions and announcements.


Unidimensional Hexagonal Ring Grid
(unihexgrid by
pboueke
)
Path finding with A*
Click to change origin, hover to set target.
unihexgrid © 2015 pboueke


Notebooks
Story: The explanation of the name Ssu-!kui-ten-tta (or Snore-White-Lying)
The explanation of the name Ssu-!kui-ten-tta (or Snore-White-Lying)
Title
The explanation of the name Ssu-!kui-ten-tta (or Snore-White-Lying)
Collection
Summary
[A] note explaining the curious name of the son of a sorceress.(L V.-9. 4652 and 4651 rev.). The naming of the Bushman Ssu-!kui-ten-tta (or Snore-White-Lying or 'Witbooi'). His mother 'snored' people without a kaross.
Comments
1) See p.4669v for more details about Ssu-!kui-ten-tta (Snore-White-Lying or 'Witbooy'), who died at the Breakwater and who was one of Dia!kwain's 'mates', 2) See also What the springbok and the gemsbok did when they knew that Dia!kwain's wife would die (it features Ssu-!kui-ten-tta), 3) This story is found in Book V-9
Contributors
Date
30 April 1875
Categories
History (personal), Healing and ailing, Custom and daily life
Keywords
name (an explanation of Ssu-!kui-ten-tta or Snore-White-Lying's naming) , name (explanation of the name Ssu-!kui-ten-tta) , name (Ssu-!kui-ten-tta's Dutch name was Witbooi) , Snore-White-Lying (Ssu-!kui-ten-tta) , Snore-White-Lying (his Dutch name was Witbooi) , Snore-White-Lying (died at the Breakwater Convict Station) , Snore-White-Lying (friend of Dia!kwain) , Snore-White-Lying (his personal history) , Snore-White-Lying (explaining the naming of) , Snore-White-Lying (his mother, the sorceress) , Snore-White-Lying (and healing and snoring) , snoring (performed by Ssu-!kui-ten-tta's mother) , snoring (healing by) , snoring ('white lying') , snoring (without a kaross) , snoring (and the naming of Ssu-!kui-ten-tta or Snore-White-Lying) , sorceress (healer) , sorceress (and the naming of her son, Ssu-!kui-ten-tta or Snore-White-Lying) , personal history (the naming of Snore-White-Lying or Ssu-!kui-ten-tta) , personal history (Snore-White-Lying or Ssu-!kui-ten-tta died at the Breakwater Convict Station) , healing (Ssu-!kui-ten-tta or Snore-White-Lying's mother snored without a kaross) , healing (and the explanation of the name Ssu-!kui-ten-tta) , Breakwater Convict Station (and Ssu-!kui-ten-tta or Snore-White-Lying who died there) , Breakwater Convict Station (and the explanation of the name Ssu-!kui-ten-tta) , death (Ssu-!kui-ten-tta or Snore-White-Lying died at the Breakwater Convict Station) , death (and the explanation of the name Ssu-!kui-ten-tta) , work (snoring) , work (and the explanation of the name Ssu-!kui-ten-tta) , work (Ssu-!kui-ten-tta or Snore-White-Lying's mother snored without a kaross)
Story Pages
4652 & 4651v


Created by Froilan Miranda
All conditional statements use the truth or falsehood of a conditional expression to determine the execution path. An example of a conditional expression is a == b. This uses the conditional operator == to see if the value of a is equivalent to the value of b. The expression returns true or false.
if(Boolean-expression)
statement
or
if(Boolean-expression)
statement
else
statement
The Boolean-expression must produce a boolean result. The statement is either a simple statement terminated by a semicolon, or a compound statement, which is a group of simple statements enclosed in braces.
Looping is controlled by while, do-while and for, which are sometimes classified as iteration statements. A statement repeats until the controlling Boolean-expression evaluates to false.
while(Boolean-expression)
statement
The Boolean-expression is evaluated once at the beginning of the loop and again before each further iteration of the statement.
do statement
while(Boolean-expression);
The sole difference between while and do-while is that the statement of the do-while always executes at least once, even if the expression evaluates to false the first time.
This loop performs initialization before the first iteration. Then it performs conditional testing and, at the end of each iteration, some form of “stepping.”
for(initialization; Boolean-expression; step)
statement
In both the initialization and step portions of the control expression, you can have a number of statements separated by commas, and those statements will be evaluated sequentially.
for(int i = 1, j = i + 10; i < 5; i++, j = i * 2) {
System.out.println("i = " + i + " j = " + j);
}
For each (or foreach) is for traversing items in a collection. Foreach is usually used in place of a standard for statement
for(float x : f) {
//statement
}
The return keyword has two purposes: It specifies what value a method will return (if it doesn’t have a void return value) and it causes the current method to exit, returning that value.
If you do not have a return statement in a method that returns void, there’s an implicit return at the end of that method, so it’s not always necessary to include a return statement.
break quits the loop without executing the rest of the statements in the loop
continue stops the execution of the current iteration and goes back to the beginning of the loop to begin the next iteration.
The sole reason to put a label before an iteration is if you’re going to nest another iteration or a switch (which you’ll learn about shortly) inside it.
label1:
outer-iteration {
inner-iteration {
//...
break; // (1)
//...
continue; // (2)
//...
continue label1; // (3)
//...
break label1; // (4)
} }
The switch is sometimes called a selection statement. The switch statement selects from among pieces of code based on the value of an integral expression.
switch(integral-selector) {
case integral-value1 : statement; break;
case integral-value2 : statement; break;
case integral-value3 : statement; break;
case integral-value4 : statement; break;
case integral-value5 : statement; break;
// ...
default: statement;
}


|
Bullet Collision Detection & Physics Library
|
#include <btConvexHull.h>
Public Member Functions | |
| int4 () | |
| int4 (int _x, int _y, int _z, int _w) | |
| const int & | operator[] (int i) const |
| int & | operator[] (int i) |
Public Attributes | |
| int | x |
| int | y |
| int | z |
| int | w |
Definition at line 146 of file btConvexHull.h.
|
inline |
Definition at line 150 of file btConvexHull.h.
|
inline |
Definition at line 151 of file btConvexHull.h.
|
inline |
Definition at line 158 of file btConvexHull.h.
|
inline |
Definition at line 159 of file btConvexHull.h.
| int int4::w |
Definition at line 149 of file btConvexHull.h.
| int int4::x |
Definition at line 149 of file btConvexHull.h.
| int int4::y |
Definition at line 149 of file btConvexHull.h.
| int int4::z |
Definition at line 149 of file btConvexHull.h.


writing, projects, papers, and interesting stuff
Mens fashion primer
Notion onboarding
Tesla proposed feature design [figma]
Background guide on Tech Recessions & 2007-2008 Housing crisis
Background guide on smart cities & energy efficiency
Oliver app
Proverify