byxchen
-------
My life in LA, SF, and TO
Mar 4, 2022
Table of Contents
- General Thoughts
- Culture and Safety
- Technology and Career
- Activities and Transportation
- Food and Cuisine
Well this took a lot longer to get to than I expected, lol. To say that the past few years were interesting is a massive understatement. The pandemic, the lockdowns, the Ukraine-Russia war, and the countless other things that happened. What a wild few years. Anyway, back to the topic at hand.
I've had the chance to live in Toronto (10yr+), San Francisco (1yr), and Los Angeles (2yr). Here are my thoughts about each:
Toronto - Similar to the New York of Canada, it has amazing social diversity, OK transit, lots of amazing restaurants, and a wide array of different people from different walks of life.
San Francisco - One of the best places to be if you're a tech nerd, but social life is severely lacking. The most interesting place in SV, but that's only because everything else is incredibly dead. Better weather than Toronto, much better transit.
Los Angeles - LA is huge and amaazing, but your experience will depend entirely on where exactly you are. It is basically 20+ cities compressed into one area. Great diversity, amazing vistas, and some of the best food on the planet.
Toronto - Toronto is the melting pot of Canada - there are people from all walks of life, all backgrounds, all ethnicities, all professions, etc. You'll never feel out of place and you'll be able to experience so much multiculturalism that it'll be a very enriching experience for you. There are {culture}-towns for every culture - Chinatown, Koreatown, Little Ethiopia, Little Greece, etc.
Toronto is generally safe. There are definitely pockets in Toronto that are less-than-stellar (Jane and Finch come to mind), but public safety is never something that I felt was compromised. The homeless population is fairly low compared to SF/LA, and are generally reasonable and unaggressive people.
San Francisco - San Francisco has pretty radically different neighborhoods for different activities - there is flamboyant Castro, the renown Chinatown, the popular Fisherman's Wharf, and the busy Financial District. Each neighborhood has its own attractions, culture, and activities. Generally a very bright and vibrant community with a fair amount of diversity. The only drawback is that most of the young people in SF are in big tech, or work in fields tangential to it.
San Francisco didn't particularlly feel unsafe, but definitely a step down from Toronto. Its Metro/MUNI systems were often either dirty or commonly people not sound-of-mind (loud, disruptive, aggressive). Especially in downtown San Francisco, the gentrification results in a lot of displaced residents and homelessness. This is especially bad in SoMa and the Tenderloin. I recommend living in a safe area or out in the outskirts of SF (Parkmerced area).
Los Angeles - LA is a giant area (the Greater Los Angeles Area) that encapsulates a TON of cities - Santa Monica, Venice, Culver City, Irvine, etc. Each one of which has a very distinct culture, and different attractions. Some notable areas are - Hollywood (celebs), Santa Monica (piers), Koreatown (food), Venice (art), and Malibu (beaches). There is a huge diversity of professions here - influencers, entertainers, programmers, artists, musicians, etc. However, ethnic diversity is a bit lower than SF/TOR - I noticed that the amount of South-Asian and East-Asian people were much lower comparatively.
Unfortunately, LA is not that safe in my opinion. The public transportation is very unsafe - tons of mentally unsound and aggressive people regularly use the metro and refuse to pay the fares. The bus operators are so jaded that they don't even confront these people because the arguements are not worth it. I've been harassed multiple times, and mugged once. The homeless population is very high in LA, much higher than TOR and somewhat higher than SF. The streets are also not well illuminated at night, which results in even more unfortunate situations that happen. Although it is incredibly neighborhood dependent (steer clear of Compton, Koreatown), the general level of safety is still subpar compared to SF and Toronto.
Toronto - Toronto has a pretty good diversity of technology companies - its been noted that Toronto has one of the fastest growing tech scenes in the world - on par with Silicon Valley and Austin/Seattle. Opportunities exist in startups, big banks, fintech, and established remote offices for American Big-N companies such as Meta, Google, Salesforce, Snapchat, etc.
Toronto's pay is awful. This is generally a Canada problem, but for a city with as high cost-of-living as Toronto does, salaries for tech workers massively lag behind cities of comparable CoL in the states. In my experience, the salary ranges are something like this, for somewhat competitive Software Engineering roles, total compensation in CAD:
- New Grad / Junior - 90-130K CAD
- Mid Level - 100-150K CAD
- Senior - 120-200K CAD
SF and SV is great for career progression - companies usually move fast and promote fast. The faster you're promoted, the more you can leapfrog your career. I've seen friends reach E5 (Senior) in 2-3 years and then leapfrog to a similar company (e.g. Google -> Meta, Meta -> Google) for a huge pay bump. It's not interesting to list expected compensation for SF/SV, but it's among the highest in the world. You can look at levels.fyi for details, but expect something in this range, TC USD:
- New Grad / Junior - 130-200K USD
- Mid Level - 180-280K USD
- Senior - 250-400K USD
Although LA isn't a city dominated by tech, there are still a great amount of high-paying tech companies in LA. Also by virtue of being close to SF, in California, and in the states, it shares similar compensation ranges to SF. You can also leapfrog around the big companies to get notable pay bumps, or leap to one of the many startups in the LA area too. Estimations for salaries are slightly lower for LA than SF, but still high compared to TOR.
- New Grad / Junior - 100-170K USD
- Mid Level - 130-240K USD
- Senior - 170-300K USD
Getting around in Toronto is doable without a car, but it's still recommended. The bus system (TTC) is cheap and convenient but often late, crowded, and unreliable. The light rail system is being deprecated, and Uber/Lyft is pretty expensive.
San Francisco - San Francisco isn't quite as lively as TOR/LA, but it definitely still has a lot of fun things to do. There are aquariums, amazing hikes/forests, ferry rides, and a lot of cultural heritage (Fishermans Wharf, Castro, Chinatown). There are also a few good music festivals, and a few great resort locations closeby (Tahoe). Also, of course, the Warriors!
SF probably had (unpopular opinion) the best local transport of the three cities. The MUNI was a lot more reliable (although older), and the CalTrain was fast and cheap. Uber/Lyft adoption is prolific and taking rideshares (especially Uber Pool) is both cheap and fast. SF is pretty compact, so the sprawl problem that Toronto and LA has isn't quite as prevalent here.
Los Angeles - San Francisco isn't quite as lively as TOR/LA, but it definitely still has a lot of fun things to do. There are aquariums, amazing hikes/forests, ferry rides, and a lot of cultural heritage (Fishermans Wharf, Castro, Chinatown). There are also a few good music festivals, and a few great resort locations closeby (Tahoe). Also, of course, the Warriors!
SF probably had (unpopular opinion) the best local transport of the three cities. The MUNI was a lot more reliable (although older), and the CalTrain was fast and cheap. Uber/Lyft adoption is prolific and taking rideshares (especially Uber Pool) is both cheap and fast. SF is pretty compact, so the sprawl problem that Toronto and LA has isn't quite as prevalent here.
Toronto - Toronto has amazing food - East Asian, African, Middle Eastern, South American, European, etc. You may have to venture out to Scarborough for some great ethnic food, but the diversity and prolificness of food in Toronto is definitely one of its strong points.
- Xiaolongkan Chinese Fondue - Great hotpot with unique vibes
- Gyubee Japanese Grill - Japanese BBQ with great dipping sauce and meat selection
- Roti Mahal Indian Cuisine - Cheap and delicious Rotis and Wraps (used to be Gandhi Roti)
- SumiLicious Smoked Meat & Deli - Unique Montreal-style smoked meat sandwich shop
- Pai - Energetic and vibrant Thai eatery
- Santo's Italian Cuisine - Quality Italian cuisine with great mains
- Esquire Souvlaki Steak & Grill - Unassuming cash-only hole-in-the-wall Greek restaurant that serves huge portions of succulent chicken, potato, salad, feta, and rice with an amazing sauce.
- Taqueria El Farolito - Best Burrito in SF imo
- Sam Wo Restaurant - Classic heritage Chinese BBQ
- Mensho SF - Amazing creamy Ramen with great broth
- Hall of Flame Burgers - A wayside burger joint with awesome and juicy bacon+avocado burgers
- KUSAKABE - Amazing Japanese Omakase with great vibes and fresh food
- Salt & Straw - Unique high-quality ice cream with crazy seasonal flavors
- Bestia - Modern Italian cuisine with great pasta and bone marrow
- UOVO / Sugarfish / Hi-Ho Cheeseburger - Three amazing chains for Italian, Japanese, and American food respectively. Very high quality for reasonable prices.
- Wanderlust Creamery - Quality ice cream focusing on East-Asian inspired unique flavors
- Vespertine / Destroyer - Amazing taco truck that specializes in seafood offerings, featuring unique octopus taco/torta
- Mariscos Jalisco - Amazing Japanese Omakase with great vibes and fresh food
- Fugetsu-Do - Renown Japanese mochi shop that has tons of great flavors and cute shapes
- Quality Seafood - Redondo beach joint serving up fresh raw or cooked seafood - tons of different Oysters, Clams, Fish&Chips, Chowder, Shrimps, and fresh Uni
- KBBQ - too many great restaurants to list. Heavily suggest checking out: Hae Jong Chong (AYCE), Kang Ho Dong (a La Carte) and Quarters (unique). No wrong choices here.


Purchase NYC Snow Bus Ticket(s)
Date
*
MM
/
DD
/
YYYY
Departures are Saturdays, Sundays and all holidays.
You have picked an invalid date. Please choose a Saturday or Sunday
Sorry, We have not perfected our time machine yet and we can not bring you back in time. Please choose a valid date.
Leaving From?
*
Downtown, Brooklyn
Williamsburg, Brooklyn
Astoria, Queens
Union Square, Manhattan
Number of people headed to the mountain (max 4 per order)?
*
0
1
2
3
4
How many people are bringing their own equipment on the bus (Snowboard or Skis)?
0
1
2
3
4
Select only one bundle for each passenger. Prices are per person. Taxes for equipment rental are included
*
1
2
3
4
0
Bus only. $35
1
2
3
4
-
Bus and Lift Ticket. $67
1
2
3
4
-
Bus and Equipment. $67
1
2
3
4
-
Bus, Lift, and Equipment. $97
1
2
3
4
-
Bus, Lift, Equipment, and lesson (all access). $112
1
2
3
4
-
Bus, Lift, Equipment, and lesson (beginners area). $102
1
2
3
4
-
Bus and Snow Tubing. $57
1
2
3
4
-
Bus, Snow Tubing, Coaster Ride, and Soaring Eagle. $65
1
2
3
4
-
$35
1 Bus Ticket
$70
2 Bus Tickets
$105
3 Bus Tickets
$140
4 Bus Tickets
$67
1 Bus and Lift Ticket
$134
2 Bus and Lift Tickets
$201
3 Bus and Lift Tickets
$268
4 Bus and Lift Tickets
$67
1 Bus and Equipment Ticket
$134
2 Bus and Equipment Tickets
$201
3 Bus and Equipment Tickets
$268
4 Bus and Equipment Tickets
$97
1 Bus, Lift, and Equipment Ticket
$194
2 Bus, Lift, and Equipment Tickets
$291
3 Bus, Lift, and Equipment Tickets
$388
4 Bus, Lift, and Equipment Tickets
$112
1 Bus, Lift, Equipment, and lesson (all access)
$224
2 Bus, Lift, Equipment, and lesson (all access)
$336
3 Bus, Lift, Equipment, and lesson (all access)
$448
4 Bus, Lift, Equipment, and lesson (all access)
$102
1 Bus, Lift, Equipment, and lesson (beginners area)
$204
2 Bus, Lift, Equipment, and lesson (beginners area)
$306
3 Bus, Lift, Equipment, and lesson (beginners area)
$408
4 Bus, Lift, Equipment, and lesson (beginners area)
$57
1 Bus and Snow Tubing Ticket
$114
2 Bus and Snow Tubing Tickets
$171
3 Bus and Snow Tubing Tickets
$228
4 Bus and Snow Tubing Tickets
$65
1 Bus, Snow Tubing, Coaster Ride, and Soaring Eagle
$130
2 Bus, Snow Tubing, Coaster Ride, and Soaring Eagle
$195
3 Bus, Snow Tubing, Coaster Ride, and Soaring Eagle
$260
4 Bus, Snow Tubing, Coaster Ride, and Soaring Eagle
Bus only
0
1
2
3
4
Bus and Lift Ticket
0
1
2
3
4
Bus and Equipment
0
1
2
3
4
Bus, Lift and Equipment
0
1
2
3
4
Bus, Lift, Equipment, and lesson (all access)
0
1
2
3
4
Bus, Lift, Equipment, and lesson (beginners area)
0
1
2
3
4
Bus and Snow Tubing
0
1
2
3
4
Bus, Snow Tubing, Coaster Ride, and Soaring Eagle
0
1
2
3
4
Email
*
Phone Number
*
###
-
###
-
####
Name 1
*
First
Last
Select age for person #1
*
0-6 (Lift Tickets are free)
7-14 (Must be accompanied by an adult 18+ years old)
15-17 (Must bring a signed consent form from a guardian)
18+
Name 2
*
First
Last
Select age for person # 2
*
0-6 (Lift Tickets are free)
7-14 (Must be accompanied by an adult 18+ years old)
15-17 (Must bring a signed consent form from a guardian)
18+
Name 3
*
First
Last
Select age for person # 3
*
0-6 (Lift Tickets are free)
7-14 (Must be accompanied by an adult 18+ years old)
15-17 (Must bring a signed consent form from a guardian)
18+
Name 4
*
First
Last
Select age for person # 4
*
0-6 (Lift Tickets are free)
7-14 (Must be accompanied by an adult 18+ years old)
15-17 (Must bring a signed consent form from a guardian)
18+
Promo Code
This promo code has expired.
10% Discount off 1st Bus Ticket
5% Discount off 1st Bus and Lift Ticket
5% Discount 1st Bus and Equipment Ticket
5% Discount 1st Bus, Lift, and Equipment Ticket
How About we
$230
Do Not Fill This Out


{% autoescape true %}
Doge Wine Inventory And Auction App
Doge Wine Inventory And Auction App
Browse red wines
Browse white wines
Browse rose wines
Browse sparkling wines
Search for wines
Enter new wine info
{% if user %}
Checkout
{% else %}
Checkout
{% endif %}
{{ url_linktext }}
{% if user %}
Signed in as {{ user.email() }}
{% else %}
Signed in as Guest
{% endif %} {% endautoescape %}


---
layout: page
title: Song Notes Downloads
permalink: /printables
redirect_from:
- /downloads
---
Guitar can be complicated to learn! While my free video lessons will get you started in learning songs or techniques, I believe there is immense value in print-friendly diagrams that you can reference alongside my video lessons. I take great pride in creating diagrams to explain the concepts behind strumming patterns, fretboard & chord charts, scales, tablature, and more.
I offer two types of premium printable content:
Approximately half my video lessons teach general guitar techniques: tips, quick riffs & exercises, practical music theory, and more. These are meant to get you up-to-speed with universal concepts used in countless songs. With each of these instructional videos, I make a PDF to accompany the video lesson. Each PDF is print-friendly, and typically between 2 and 5 pages. Here's what they look like (showing the first page only):
Want full access to my library of instructional (non-song) PDFs?
Interested in a free sample? Here's some of my instructional PDFs available at no charge:
Already a Patreon member?
✨ Patreon supporters save 50% on each purchase! Learn more about Song Notes membership »
For my full song video lessons, I create print-friendly sheet music to accompany the tutorial. These song sheets are available for purchase through Musicnotes.com, who provides licensing for each arrangement – here's how to buy them. Patreon supporters save 50% on each purchase with a discount code available I publish each month. Each sheet music arrangement is print-friendly, and typically between 2 and 5 pages. They're typically priced between $3 and $5 (USD, before Patreon discount). Here's what they look like (showing the first page only):
Want to browse all my song lessons with sheet music? View them here »
Note: as of April 2021, song sheets aren't downloadable directly via Patreon anymore because of copyright reasons – learn more here. My song sheets are now properly licensed and 100% legal, ensuring the publishers and songwriters are getting their fair share.


MERCURY RISING A film review by David N. Butterworth Copyright 1998 David N. Butterworth
** (out of ****)
The opening, very deliberate minutes of "Mercury Rising," Bruce Willis' latest retread, sets up the oft-seen hostage situation in which a bunch of raggedy bank robbers negotiate with police. For a moment I was reminded of that film-within-a-film finale of Robert Altman's brilliant "The Player," in which a pumped-up Willis caricatures himself, busting in at the last possible minute and rescuing a frail Julia Roberts with an apologetic "traffic was a bitch."
But in Harold Becker's action thriller, undercover FBI agent Art Jeffries (Willis) is already inside the bank and doing a little negotiating of his own. Jeffries thinks he can end this standoff without bloodshed, but the impatient cops move too soon and Jeffries is left, quite literally, with blood on his hands.
Bummer.
Said to have lost his magic touch, Jeffries is assigned to "sit on a wire" from hereon out. But shortly after one of the film's secondary characters repeats the transit metaphor--"traffic was like mud; I oozed home"--a couple of shots are fired and a nine-year old boy is suddenly left parentless. Enter Jeffries stage left.
Which reminded me of something else I remember from "The Player."
Of the thousands of scripts a major studio reviews each and every year, only about a dozen are so are produced. One wonders, therefore, why the executives at Universal chose to greenlight this particular project. "Mercury Rising" is certainly no worse than any half dozen Bruce Willis shoot-em-ups. It's just not any better.
The film's "hook" is that the kid in danger here is autistic. The filmmakers go to great lengths--and I mean *great* lengths--to show us what that means, exactly. Simon (convincingly portrayed by Miko Hughes) stares off into space, presses doorbells very deliberately, repeats things by rote, and acts afraid in the presence of strangers (unless they happen to be *cute* strangers, like the one played by Kim Dickens, for example).
Simon also enjoys puzzles, and this proves to be his undoing, as he inadvertently deciphers a matrix of seemingly random characters in a "geek's puzzle magazine," placed there by two National Security Agency compududes to see if anyone human out there could crack a two billion dollar chunk of code known as "Mercury."
My favorite scene in the film comes when one of these nerds tells Jeffries that he'll leave him an e-mail message in an account called "einstein." Jeffries has a savvy librarian do a Web search for "FBI" and "einstein," instantly locating the address, and logging in. "Try Arthur" Art suggests for the password, but that's not it. "How about E=MC2?" and, as an afterthought, "all caps." He's in!
Why worry about some juvenile savant puzzledoer posing a threat to national security when you've got Bruce Willis: SuperGuesser to contend with?
One of the interchangeable Baldwin brothers plays Lt. Colonel Nicholas Kudrow, creator of the NSA code, who wants Simon erased (er, why exactly?). You know he's a bad guy because he talks in a very loud whisper. Kudrow and Jeffries eventually duke it out atop a skyscraper that looks a little too like the Nakatomi building in "Die Hard," with the autistic kid wandering around on the ledge to increase the tension.
Willis is no Olivier but he's always fun to watch. Unfortunately, the rest of "Mercury Rising," even with its autism bent, is simply stock footage.
-- David N. Butterworth<EMAIL_ADDRESS>The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


|
Panda3D
|
An object to create GraphicsOutputs that share a particular 3-D API. More...
Public Types | |
| enum | BufferCreationFlags { BF_refuse_parasite = 1, BF_require_parasite = 2, BF_refuse_window = 4, BF_require_window = 8, BF_require_callback_window = 16, BF_can_bind_color = 64, BF_can_bind_every = 128, BF_resizeable = 256, BF_size_track_host = 512, BF_rtt_cumulative = 1024, BF_fb_props_optional = 2048, BF_size_square = 4096, BF_size_power_2 = 8192, BF_can_bind_layered = 16384 } |
| enum | OutputTypes { OT_window = 1, OT_fullscreen_window = 2, OT_buffer = 4, OT_texture_buffer = 8 } |
Public Member Functions | |
| int | getDisplayHeight () |
| Returns the height of the entire display, if it is known. More... | |
| DisplayInformation | getDisplayInformation () |
| Gets the pipe's DisplayInformation. More... | |
| int | getDisplayWidth () |
| Returns the width of the entire display, if it is known. More... | |
| str | getInterfaceName () |
| int | getSupportedTypes () |
| Returns the mask of bits that represents the kinds of GraphicsOutput objects this pipe might be able to successfully create. More... | |
| bool | isValid () |
| Returns false if this pipe is known to be invalid, meaning that an attempt to create a GraphicsWindow with the pipe will certainly fail. More... | |
| lookupCpuData () | |
| Looks up the detailed CPU information and stores it in _display_information, if supported by the OS. More... | |
| bool | supportsType (int flags) |
| A convenience function to ask if a particular type or types of GraphicsObjects are supported. More... | |
| Public Member Functions inherited from TypedObject | |
| TypeHandle | getType () |
| int | getTypeIndex () |
| Returns the internal index number associated with this object's TypeHandle, a unique number for each different type. More... | |
| bool | isExactType (TypeHandle handle) |
| Returns true if the current object is the indicated type exactly. More... | |
| bool | isOfType (TypeHandle handle) |
| Returns true if the current object is or derives from the indicated type. More... | |
| Public Member Functions inherited from ReferenceCount | |
| int | getRefCount () |
| Returns the current reference count. More... | |
| ref () | |
| Explicitly increments the reference count. More... | |
| bool | testRefCountIntegrity () |
| Does some easy checks to make sure that the reference count isn't completely bogus. More... | |
| bool | testRefCountNonzero () |
| Does some easy checks to make sure that the reference count isn't zero, or completely bogus. More... | |
| bool | unref () |
| Explicitly decrements the reference count. More... | |
Static Public Member Functions | |
| static TypeHandle | getClassType () |
| Static Public Member Functions inherited from TypedReferenceCount | |
| static TypeHandle | getClassType () |
| Static Public Member Functions inherited from TypedObject | |
| static TypeHandle | getClassType () |
| Static Public Member Functions inherited from ReferenceCount | |
| static TypeHandle | getClassType () |
Public Attributes | |
| int | display_height |
| Returns the height of the entire display, if it is known. More... | |
| DisplayInformation | display_information |
| Gets the pipe's DisplayInformation. More... | |
| int | display_width |
| Returns the width of the entire display, if it is known. More... | |
| String | interface_name |
| Public Attributes inherited from TypedObject | |
| TypeHandle | type |
| Returns the TypeHandle representing this object's type. More... | |
| Public Attributes inherited from ReferenceCount | |
| int | ref_count |
| The current reference count. More... | |
An object to create GraphicsOutputs that share a particular 3-D API.
Normally, there will only be one GraphicsPipe in an application, although it is possible to have multiple of these at once if there are multiple different API's available in the same machine.
Often, the GraphicsPipe corresponds to a physical output device, hence the term "pipe", but this is not necessarily the case.
The GraphicsPipe is used by the GraphicsEngine object to create and destroy windows; it keeps ownership of the windows it creates.
M. Asad added new/interim functionality where GraphicsPipe now contains a device interface to directx/opengl which will be used to handle multiple windows from same device.
| enum BufferCreationFlags |
| Enumerator | |
|---|---|
| BF_refuse_parasite | Flags that control what type of output is returned. |
| BF_require_parasite | |
| BF_refuse_window | |
| BF_require_window | |
| BF_require_callback_window | |
| BF_can_bind_color | Need capability: bind the color bitplane to a tex. |
| BF_can_bind_every | Need capability: bind all bitplanes to a tex. |
| BF_resizeable | Buffer should allow set_size. |
| BF_size_track_host | Buffer should track the host size. |
| BF_rtt_cumulative | Buffer supports cumulative render-to-texture. |
| BF_fb_props_optional | FrameBufferProperties can be ignored. |
| BF_size_square | x_size must equal y_size (e.g. for cube maps) |
| BF_size_power_2 | x_size and y_size must each be a power of two |
| BF_can_bind_layered | Need capability: support RTM_bind_layered. |
| enum OutputTypes |
|
static |
| int getDisplayHeight | ( | ) |
Returns the height of the entire display, if it is known.
This may return 0. See the caveats for get_display_width().
| DisplayInformation getDisplayInformation | ( | ) |
Gets the pipe's DisplayInformation.
| int getDisplayWidth | ( | ) |
Returns the width of the entire display, if it is known.
This may return 0. This is not a guarantee that windows (particularly fullscreen windows) may not be created larger than this width, but it is intended to provide a hint to the application.
| str getInterfaceName | ( | ) |
| int getSupportedTypes | ( | ) |
Returns the mask of bits that represents the kinds of GraphicsOutput objects this pipe might be able to successfully create.
The return value is the union of bits in GraphicsPipe::OutputTypes that represents the set of GraphicsOutput types.
A 1 bit in a particular position is not a guarantee of success, but a 0 bit is a guarantee of failure.
| bool isValid | ( | ) |
Returns false if this pipe is known to be invalid, meaning that an attempt to create a GraphicsWindow with the pipe will certainly fail.
Returns true if the pipe is probably valid (is this case, an attempt to create a GraphicsWindow should succeed, but might still fail).
Use the GraphicsEngine class to create a GraphicsWindow on a particular pipe.
| lookupCpuData | ( | ) |
Looks up the detailed CPU information and stores it in _display_information, if supported by the OS.
This may take a second or two.
| bool supportsType | ( | int | flags | ) |
A convenience function to ask if a particular type or types of GraphicsObjects are supported.
The parameter is a union of one or more bits defined in GrpahicsPipe::OutputTypes.
Returns true if all of the requested types are listed in the supported_types mask, false if any one of them is not. This is not a guarantee that the indicated output type will successfully be created when it is attempted.
| int display_height |
Returns the height of the entire display, if it is known.
This may return 0. See the caveats for get_display_width().
| DisplayInformation display_information |
Gets the pipe's DisplayInformation.
| int display_width |
Returns the width of the entire display, if it is known.
This may return 0. This is not a guarantee that windows (particularly fullscreen windows) may not be created larger than this width, but it is intended to provide a hint to the application.
| String interface_name |


Page not found!
I'm sorry, the page your looking for was not found.
{{ with .Site.GetPage "/_index.md" }} {{ end }} {{ with .Site.GetPage "/start/index.md" }} {{ end }}{{ define "title" }}
I'm sorry, the page your looking for was not found.
{{ with .Site.GetPage "/_index.md" }} {{ end }} {{ with .Site.GetPage "/start/index.md" }} {{ end }}


nips nips2002 nips2002-56 nips2002-56-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Luis E. Ortiz, David A. McAllester
Abstract: This paper gives distribution-free concentration inequalities for the missing mass and the error rate of histogram rules. Negative association methods can be used to reduce these concentration problems to concentration questions about independent sums. Although the sums are independent, they are highly heterogeneous. Such highly heterogeneous independent sums cannot be analyzed using standard concentration inequalities such as Hoeffding’s inequality, the Angluin-Valiant bound, Bernstein’s inequality, Bennett’s inequality, or McDiarmid’s theorem.
[1] D. Anguluin and L. Valiant. Fast probabalistic algorithms for hamiltonian circuits. Journal of Computing Systems Science, 18:155–193, 1979.
[2] G. Bennnett. Probability inequalities for the sum of independent ranndom variables. Journal of the American Statistical Association, 57:33–45, 1962.
[3] S. Bernstein. The Theory of Probabilities. Gastehizdat Publishing House, Moscow, 1946.
[4] Stanley Chen and Joshua Goodman. An empirical study of smoothing techniques for language modeling, August 1998. Technical report TR-10-98, Harvard University.
[5] H. Chernoff. A measure of the asymptotic efﬁciency of tests of a hypothesis based on the sum of observations. Annals of Mathmematical Statistics, 23:493–507, 1952.
[6] Kenneth W. Church and William A. Gale. A comparison of the enhanced Good-Turing and deleted estimation methods for estimating probabilities of English bigrams. Computer Speech and Language, 5:19–54, 1991.
[7] Luc Devroye, L´ szl´ Gy¨ rﬁ, and G´ bor Lugosi. A Probabilistic Theory of Pattern Recognition. a o o a Springer, 1996.
[8] Devdatt P. Dubhashi and Desh Ranjan. Balls and bins: A study in negative dependence. Random Structures and Algorithms, 13(2):99–124, 1998.
[9] I. J. Good. The population frequencies of species and the estimation of population parameters. Biometrika, 40(16):237–264, December 1953.
[10] T. Hagerup and C. R¨ b. A guided tour of chernoff bounds. Information Processing Letters, u 33:305–309, 1989.
[11] W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13–30, 1963.
[12] Slava M. Katz. Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics, Speech and Signal Processing, ASSP35(3):400–401, March 1987.
[13] Michael Kearns and Lawrence Saul. Large deviation methods for approximate probabilistic inference, with rates of convergence. In UAI-98, pages 311–319. Morgan Kaufmann, 1998.
[14] Samuel Kutin. Algorithmic Stability and Ensemble-Based Learning. PhD thesis, University of Chicago, 2002.
[15] David McAllester and Robert Schapire. On the convergence rate of good-turing estimators. In COLT00, 2000.
[16] Luis E. Ortiz and Leslie Pack Kaelbling. Sampling methods for action selection in inﬂuence diagrams. In Proceedings of the Seventeenth National Conference on Artiﬁcial Intelligence, pages 378–385, 2000.
[17] Anand Srivastav and Peter Stangier. Integer multicommodity ﬂows with reduced demands. In European Symposium on Algorithms, pages 360–371, 1993. (30) (31)


Spring container has capability of automatically injecting dependencies while initiating bean. There are 5 different modes.
No Autowire - XML Based Default
Autowire by Type - Java Based Default
Autowire by Name
Autowire by Constructor
Autodetect - Deprecated
You can turn on autowire feature by using following code in your XML. With this you can start using @Autowire annotation in your Java file.
You can autowire class properties directly even if they are private, you can autowire fields by constructor parameters or setters parameter. What if you have two ApplicationUser object in container which one application object will use, In XML based you can just give object name but in Java class you will have to use @Qualifier(“applicationUser2”) to identify which one to pick.
What if container doesn’t find the matching object? It will throw error, you can suppress this by using @Autowired (required=false)


Job Decider
This is tool where you can decide whether you should join next job or not
Current Job Specification
Next Job Specification
OR
Result
Current Job Result
Expected Job Result
Official Next Job Result


--- layout: single author_profile: true title: 'Bypass Upload WebShell Responsive File Manager' date: 2020-02-02 12:12:12 -0000 --- Tested on RFM 9.11.3 Just upload this file ('rename to uploader.php<?.html') => Click here


which is non-standard. Use builtin 'command -v' instead.
Note: This check is opt-in only in ShellCheck 0.7.1+ (shellcheck -o deprecate-which
).
which grep
# For the path of a single, unaliased, external command,
# or to check whether this will just "run" in this shell:
command -v grep
# To check whether commands exist, without obtaining a reusable path:
hash grep
which
is a non-standard, external tool that locates an executable in PATH. command -v
is a POSIX standard builtin, which uses the same lookup mechanism that the shell itself would.
This check is opt-in only in 0.7.1+, and you may choose to [[ignore]] it in earlier versions. which
is very common, and some prefer its executable-or-nothing behavior over command -v
's handling of builtins, functions and aliases.
command -v
does not check ALL parameterscommand -v
succeeds (with exit code 0) if any command exists:
# grep is in /usr/bin/grep
# foobar is not in path
#
$ command -v -- grep foobar; echo $?
0
In the above example, it should have failed and exited with 1 unless all commands
exist, if it were to be a replacement for which
. Other problems associated with
command
include its inclusion of builtins, aliases, and functions.
An alternative is:
$ hash <file1> <file2>
Which observes the standard behaviour of failures.
To obtain a path, type -p
can be used instead. Like command -v
, it has a similarly
quirky behavior with builtins, aliases, and functions, although this is
arguably milder since it would print nothing for these cases. The failure condition is
similar to hash
.
shellcheck
issue: #1162 command -v is not a direct replacement for which (Discussion)


Q189. Rotate Array
Given an array, rotate the array to the right by k steps, where k is non-negative.
Follow up:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
Could you do it in-place with O(1) extra space?
Example 1:
Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the right: [7,1,2,3,4,5,6]
rotate 2 steps to the right: [6,7,1,2,3,4,5]
rotate 3 steps to the right: [5,6,7,1,2,3,4]
Example 2:
Input: nums = [-1,-100,3,99], k = 2
Output: [3,99,-1,-100]
Explanation:
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]
Constraints:
1 <= nums.length <= 2 * 104
-231 <= nums[i] <= 231 - 1
0 <= k <= 105
The idea is simple, just to keep updating by jumping to new position i <- (i + k) % n
.
Some minor thing is that we can do k = k % n
before getting started.
And if k = 0
, we can immediately return without doing anything.
The difficulty for me is that I know there will be multiple cycles but it is really hard to know beforehand how many cycles are needed. I was thinking about using a for loop to go through all these cycles in order.
But, such difficulty can be avoided. Or, we don’t need to know the number of cycles beforehand.
Instead, we can keep track of the number of positions that have been updated.
And whenever we ends one cycle, we can safely go to i <- i + 1
and start a new cycle since we can be sure that it has not been visited.
Why? If the next position has been visited by one of the previous ones, no matter which one, we know that the same thing will happen for the next next position as well (since all the previous cycle starts have been visited). Following this, we will have all positions being visited already.
So, whenever there is unvisited position, the next position has to be unvisited.
To make this idea more generally, essentially, the strategy here is to come up with an order of visiting (no duplicated visit guaranteed) and visit until we hit all.
Python submission.
class Solution:
def rotate(self, nums: List[int], k: int) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
if len(nums) <= 1:
return nums
n = len(nums)
k = k % n
if k == 0:
return nums
count = 0
curr_idx = 0
curr_val = nums[curr_idx]
while curr_idx < k and count < n:
start_idx = curr_idx
curr_val = nums[curr_idx]
# print(nums, curr_idx)
while True:
next_idx = (curr_idx + k) % n
next_val = nums[next_idx]
nums[next_idx] = curr_val
curr_val, curr_idx = next_val, next_idx
count += 1
if start_idx == curr_idx:
break
curr_idx += 1
return nums


Package it.polimi.ingsw.network
Class NetworkClient
java.lang.Object
it.polimi.ingsw.network.Client
it.polimi.ingsw.network.NetworkClient
public class NetworkClient extends Client
Since whole project is based on distributed MVC architectural pattern, this class has what is needed to exchange
information with the server, especially it is the door through which the player sends messages and
receives errors or updates.
-
Field Summary
Fields Modifier and Type Field Description private java.util.concurrent.ScheduledExecutorService
heartbeatSender
Executor that periodically pings serverprivate java.lang.String
ip
private boolean
isActive
private int
port
private java.net.Socket
socket
private java.io.ObjectInputStream
socketInObj
private java.io.ObjectOutputStream
socketOutObj
-
Constructor Summary
Constructors Constructor Description NetworkClient(java.lang.String ip, int port)
Initializes a network client through assigning it Server IP address and its port. -
Method Summary
Modifier and Type Method Description void
closeConnection()
Closes the connection with remote host.void
createHeartBeat()
Initializes ping sender that has to ensure a stable TCP connection.private void
createListeningThread()
Initializes a thread that will wait for an inbound messages over the socket.void
sendMessage(ClientMessage message)
Method that sends aClientMessage
through the socket.private void
sendObject(java.lang.Object o)
void
start(boolean startAsGui)
Main method that starts the client, its user interface, a thread for inbound messages and one for ping sending.Methods inherited from class it.polimi.ingsw.network.Client
bindUser, getGame, getUI, getUser, getUserPosition, setupGame, setupGame
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Field Details
-
ip
private final java.lang.String ip -
port
private final int port -
isActive
private boolean isActive -
socketInObj
private java.io.ObjectInputStream socketInObj -
socketOutObj
private java.io.ObjectOutputStream socketOutObj -
socket
private java.net.Socket socket -
heartbeatSender
private java.util.concurrent.ScheduledExecutorService heartbeatSenderExecutor that periodically pings server
-
-
Constructor Details
-
NetworkClient
public NetworkClient(java.lang.String ip, int port)Initializes a network client through assigning it Server IP address and its port.- Parameters:
ip
- Server ip addressport
- Server port.
-
-
Method Details
-
start
public void start(boolean startAsGui)Main method that starts the client, its user interface, a thread for inbound messages and one for ping sending. -
sendObject
private void sendObject(java.lang.Object o) throws java.io.IOException- Throws:
java.io.IOException
-
sendMessage
Method that sends aClientMessage
through the socket.- Specified by:
sendMessage
in classClient
- Parameters:
message
- message that has to be sent.
-
createHeartBeat
public void createHeartBeat()Initializes ping sender that has to ensure a stable TCP connection. -
createListeningThread
private void createListeningThread()Initializes a thread that will wait for an inbound messages over the socket. -
closeConnection
public void closeConnection()Closes the connection with remote host.
-


We want to create the most plesureable and easy experience available to students so they can schedule their busy lives. Your time at school should be focused on you, not worrying about your schedule.
We aim to not only give you a tool to create a schedule for yourself, but send you notifications for when you should be at a specific location.
The robots are coming. Run.


It's no question that Search Engine Optimization is the most powerful tool a business can stretegize. Everyday the field gets more populated for SEO in NH, so it's important that your business is using the latest practice to get ahead.
When somebody searches your business, there is no way (with today's convinience) they are going to type in your domain in the searchbar. They are simply going to search your specific keywords that relate to your industry and browse the top 3 if lucky. If you aren't there, what good is your website.
Naturally, people love when things come easy. Wavesurge Media takes SEO to another level so your business can too. The strategy we use, proves it's rankings to be supperior to other agencies that will charge you much more.
Before the SEO process begins, we get to know your industry and how it is effected by online traffic in NH. During this time, correct keywords are picked, and we can get a general idea of what it will take for you to reach the top.
A website does NOT rank on the top page of google overnight. It will take proper optimization and website traffic to get your website ranking. We make this process as quick as it can be by working non-stop every month until you rank.
SEO is a never ending process...that is if you want to stay at the top. Once a website is ranking in a place where businesses see results we will maintain the SEO monthly so it does not fall. Monthly rates vary depending on the business.
Start showing up on search results.
The information provided will give us an idea of what website design will be best for our business.


Policy Engine¶
The policy engine is the component of Congress responsible for evaluating, analyzing, and enforcing policy. To tell the policy engine what the policy is, you use the methods insert and delete (which are methods of the class congress.runtime.Runtime).
-
insert
(formula)¶ Inserts FORMULA to the current policy. FORMULA is a string encoding a single Datalog rule.
-
delete
(formula)¶ Deletes FORMULA from the current policy. FORMULA is a string encoding a single Datalog rule.
Formulas may be inserted and deleted at any time. Once Congress has a policy that it is trying to enforce, there are a number of additional functions we can call to have Congress tell us about the current state of the cloud’s policy compliance. Many of these methods take a string encoding of Datalog as input and return a string encoding of Datalog as output. When working in Python, we can parse a Datalog string into Python objects using compile.parse.
-
compile.
parse
(string)¶ Takes a string, parses it, and returns a list of compile.Rule objects representing the Datalog contained within that string. Does not check any of the Syntactic Restrictions from 2. Datalog Policy Language.
We can utilize the method select()
to query the contents of any table, including error.
-
select
(formula)¶ FORMULA is either a Datalog rule or atom. If it is an atom, SELECT returns a string representing all instances of FORMULA that are true. If it is a rule, it returns all instances of that rule where the body is true.
select()
takes either an atom or a rule as an argument. If it is an atom, Congress returns all instances of the atom that are true. For example, suppose we have the following instance of the table neutron:port.
| ID | IP |
|---|---|
| “66dafde0-a49c-11e3-be40-425861b86ab6” | “<IP_ADDRESS>” |
| “66dafde0-a49c-11e3-be40-425861b86ab6” | “<IP_ADDRESS>” |
| “73e31d4c-a49c-11e3-be40-425861b86ab6” | “<IP_ADDRESS>” |
If the argument to select()
is:
'neutron:port("66dafde0-a49c-11e3-be40-425861b86ab6", x)'
then Congress would return the following statements encoded as a string.:
neutron:port("66dafde0-a49c-11e3-be40-425861b86ab6", "<IP_ADDRESS>")
neutron:port("66dafde0-a49c-11e3-be40-425861b86ab6", "<IP_ADDRESS>")
If the argument to select()
is a rule then Congress finds all instances of the body of the rule that are true and instantiates the variables in the head accordingly. For example, if the rule argument were the string:
multi_port(port) :- neutron:port(port, ip1), neutron:port(port, ip2), not equal(ip1, ip2)
then Congress would return the following string. Notice that there are two results because there are two different reasons that “66dafde0-a49c-11e3-be40-425861b86ab6” belongs to multi_port.:
multi_port("66dafde0-a49c-11e3-be40-425861b86ab6") :-
neutron:port("66dafde0-a49c-11e3-be40-425861b86ab6", "<IP_ADDRESS>"),
neutron:port("66dafde0-a49c-11e3-be40-425861b86ab6", "<IP_ADDRESS>"),
not equal("<IP_ADDRESS>", "<IP_ADDRESS>")
multi_port("66dafde0-a49c-11e3-be40-425861b86ab6") :-
neutron:port("66dafde0-a49c-11e3-be40-425861b86ab6", "<IP_ADDRESS>"),
neutron:port("66dafde0-a49c-11e3-be40-425861b86ab6", "<IP_ADDRESS>"),
not equal("<IP_ADDRESS>", "<IP_ADDRESS>")
We can also ask Congress for an explanation as to why a row belongs to a particular table.
-
explain
(atom, tablenames=None, find_all=False)¶ At the time of writing, this function needs an overhaul. In theory it should return a rule describing why ATOM is true. The head of the rule is ATOM. The body of the rule has tables only from TABLENAMES (which if not supplied Congress is free to choose) that constitute the causes of ATOM being true. If FIND_ALL is True, then the result is a list of all such rules.
We can also ask Congress to enumerate possible actions that will cause a given policy violation (or any other row) to be eliminated.
-
remediate
(atom)¶ ATOM is a string representing a Datalog atom.
remediate()
returns a string representing a list of action sequences that will cause ATOM to become false.
We can also ask Congress to simulate a sequence of actions and data or policy updates and answer a select()
query in the resulting state.
-
simulate
(query, sequence)¶ QUERY is any
select()
query. SEQUENCE is a string of Datalog rules, described in more detail below. SIMULATE returns select(QUERY) after applying the updates described by SEQUENCE. Does not actually apply SEQUENCE–it only simulates its application.
SEQUENCE is a mini-programming language built out of Datalog rules. Each Datalog rule in SEQUENCE is one of the following types.
Data update. q+(1) means that q(1) should be inserted. q-(1) means that q(1) should be deleted.
Policy update. p+(x) :- q(x) means that p(x) :- q(x) should be inserted. p-(x) :- q(x) means that p(x) :- q(x) should be deleted.
Action invocation. See Monitoring and Enforcement for more details on actions. In short, an Action is analogous to an API call that changes state in the cloud. An action invocation is described by a Datalog rule, such as the following.:
create_network(x, 17), options:value(17, "name", "net1") :- result(x)
Here the action being executed is create_network(x, 17), where 17 is a “pointer” to the list of arguments (or options) for that API call, and the “name” argument of that argument list has value “net1”. The value of x depends on the return value of a previously executed action. If the action does not depend on the previous result, you can use true in place of result(x).


Hive Docs
Understanding Configuration Values
Low level blockchain constants
Intro
These values underpin the behavior of the entire blockchain. In a sense, each witness votes for these configuration values every time they sign a block. Unlike many of the Dynamic Global Properties, these values never change at runtime (e.g., as a witness, in order to change them, you typically must shut down your node, make the change, recompile, and run).
See: config.hpp
Usually, these configuration values are universally adhered to, but there are situations where these values can and should be altered, like in the case of deploying a new blockchain (typically a testnet). Some of the values that do not affect consensus, like STEEM_SOFT_MAX_COMMENT_DEPTH
, are allowed to change to some extent.
Sections
- Fields
IS_TEST_NET
STEEM_ADDRESS_PREFIX
STEEM_BLOCKS_PER_HOUR
STEEM_BLOCK_INTERVAL
STEEM_CASHOUT_WINDOW_SECONDS
STEEM_CHAIN_ID
STEEM_CHAIN_ID_NAME
STEEM_CONVERSION_DELAY
STEEM_CREATE_ACCOUNT_DELEGATION_RATIO
STEEM_CREATE_ACCOUNT_DELEGATION_TIME
STEEM_DB_FORMAT_VERSION
STEEM_DEFAULT_ACCOUNT_SUBSIDY_BUDGET
STEEM_DEFAULT_ACCOUNT_SUBSIDY_DECAY
STEEM_DEFAULT_SBD_INTEREST_RATE
STEEM_FEED_HISTORY_WINDOW
STEEM_GENESIS_TIME
STEEM_HARDFORK_REQUIRED_WITNESSES
STEEM_INFLATION_NARROWING_PERIOD
STEEM_INITIAL_VOTE_POWER_RATE
STEEM_IRREVERSIBLE_THRESHOLD
STEEM_MAX_ACCOUNT_NAME_LENGTH
STEEM_MAX_ACCOUNT_WITNESS_VOTES
STEEM_MAX_AUTHORITY_MEMBERSHIP
STEEM_MAX_COMMENT_DEPTH
STEEM_MAX_FEED_AGE_SECONDS
STEEM_MAX_LIMIT_ORDER_EXPIRATION
STEEM_MAX_MEMO_SIZE
STEEM_MAX_PERMLINK_LENGTH
STEEM_MAX_PROXY_RECURSION_DEPTH
STEEM_MAX_WITNESSES
STEEM_MAX_WITNESS_URL_LENGTH
STEEM_MIN_PAYOUT_SBD
STEEM_MIN_REPLY_INTERVAL
STEEM_MIN_REPLY_INTERVAL_HF20
STEEM_MIN_ROOT_COMMENT_INTERVAL
STEEM_NETWORK_TYPE
STEEM_NULL_ACCOUNT
STEEM_PROPOSAL_MAINTENANCE_CLEANUP
STEEM_PROPOSAL_MAX_IDS_NUMBER
STEEM_PROPOSAL_SUBJECT_MAX_LENGTH
STEEM_PROXY_TO_SELF_ACCOUNT
STEEM_REDUCED_VOTE_POWER_RATE
STEEM_SAVINGS_WITHDRAW_TIME
STEEM_SOFT_MAX_BLOCK_SIZE
STEEM_SOFT_MAX_COMMENT_DEPTH
STEEM_TREASURY_ACCOUNT
STEEM_TREASURY_FEE
STEEM_UPVOTE_LOCKOUT_HF17
STEEM_VESTING_WITHDRAW_INTERVALS
STEEM_VESTING_WITHDRAW_INTERVAL_SECONDS
STEEM_VOTE_DUST_THRESHOLD
STEEM_VOTING_MANA_REGENERATION_SECONDS
STEEM_WITNESS_SUBSIDY_DECAY_PERCENT
TESTNET_BLOCK_LIMIT
STEEM_REVERSE_AUCTION_WINDOW_SECONDS
- Not Covered
- Example Method Call
- Example Output
IS_TEST_NET
Indicates if this node is running on testnet.
See: Steem Testnet
STEEM_ADDRESS_PREFIX
Address prefix used on mainnet is STM
and on testnet is TST
.
- Examples:
STM
- mainnetTST
- mainnet
See: Steem Testnet
STEEM_BLOCKS_PER_HOUR
60*60/STEEM_BLOCK_INTERVAL
STEEM_BLOCK_INTERVAL
Block interval in seconds is 3
. This is the target for block production. This constant is also used as a component for determining valid peer inventory, bandwidth calculations, and block production gaps.
STEEM_CASHOUT_WINDOW_SECONDS
This value was simply set to 7 days, since HF17.
Prior to this, other very complicated machinations were tried like multiple payouts and an initial 24 hours (prior to HF12) and even initial 12 hours (in HF12) all with time extensions depending on how much of an upvote the content got.
Note, on testnet, this is typically much shorter: 1 hour.
- Examples:
604800
- mainnet3600
- testnet
See: Steem Testnet
STEEM_CHAIN_ID
The chain ID to connect to, which is used to seed signing and prevent transaction crosstalk between two chains, typically mainnet and testnet.
- Examples:
0000000000000000000000000000000000000000000000000000000000000000
- mainnet18dcf0a285365fc58b71f18b3d3fec954aa0c141c44e4e5cb4cf777b9eab274e
- testnet
See: Steem Testnet
STEEM_CHAIN_ID_NAME
Tyically used to automatically get a unique chain id for a testnet.
See: Steem Testnet
STEEM_CONVERSION_DELAY
Prior to HF16, 7 day conversion. After HF16 3.5 day conversion
See: #551
STEEM_CREATE_ACCOUNT_DELEGATION_RATIO
This ratio is set to 5 and is used to determine the cost of an account created with delegation.
As an example, imagine the account creation fee is currently 3.000 STEEM
. Instead of creating the account using pure STEEM, there is an option to use delegation so that the blockchain would reduce the creation fee to 0.100 STEEM
. Going this route would require a delegation of 15.000 STEEM
, that can be revoked at any time, but will stay in limbo for 30 days after the creation date (STEEM_CREATE_ACCOUNT_DELEGATION_TIME
).
This minimum STEEM ensures that those accounts can transact if the delegation is removed.
See: #818
STEEM_CREATE_ACCOUNT_DELEGATION_TIME
There is a minimum delegation period (30 days) and a minimum fee in STEEM even when delegating for account creation (derived with STEEM_CREATE_ACCOUNT_DELEGATION_RATIO
). The minimum period enforces a rate limit on account creation.
Note that delegation can be revoked before 30 days have elapsed from the creation date, but stays in limbo.
See: #818
STEEM_DB_FORMAT_VERSION
- Since: HF23
- Related
Version format string for platform independent state files. The Steem binary will refuse to load a state file where this does not match the built-in version.
db_format_version
- Must match STEEM_DB_FORMAT_VERSIONnetwork_type
- Must match STEEM_NETWORK_TYPEchain_id
- Must match requested chain ID and value of embedded GPO
See: #3084, STEEM_NETWORK_TYPE
, state-format, from-state, to-state
STEEM_DEFAULT_ACCOUNT_SUBSIDY_BUDGET
Default rate is 0.5 accounts per block
STEEM_DEFAULT_ACCOUNT_SUBSIDY_DECAY
347321 corresponds to a 5-day halflife
STEEM_DEFAULT_SBD_INTEREST_RATE
< 10% APR
STEEM_FEED_HISTORY_WINDOW
Price feed history window, which is 3.5 days since HF16.
STEEM_GENESIS_TIME
Scheduled time that the blockchain waited until the first block was produced. It is represented as the unix epoch of<PHONE_NUMBER>
, which is Thu Mar 24 16:00:00 UTC 2016
. About five seconds later, the first block was produced.
STEEM_HARDFORK_REQUIRED_WITNESSES
The minimum number of Delegated Proof of Stake witnesses required for hardfork. This guarantees 75% participation on all subsequent rounds.
By default it is set to 17, but when running a testnet, we can change it to 1 so that only one node instance would be sufficient and the network will be still functional and fast.
See: Steem Testnet
STEEM_INFLATION_NARROWING_PERIOD
Inflation narrows 0.01% every 250k blocks, since HF16. At block 7,000,000, there was a 9.5% instantaneous inflation rate, decreasing to 0.95% at this rate of 0.01% every 250k blocks. This narrowing will take approximately 20.5 years and will complete on block 220,750,000.
| Year | Supply | Inflation | New Supply | Year | Supply | Inflation | New Supply | |
|---|---|---|---|---|---|---|---|---|
| 2016 | 250,000,000 | 9.50% | 23,750,000 | 2031 | 646,511,386 | 3.19% | 20,613,886 | |
| 2017 | 273,750,000 | 9.08% | 24,854,398 | 2032 | 667,125,272 | 2.77% | 18,464,106 | |
| 2018 | 298,604,398 | 8.66% | 25,854,554 | 2033 | 685,589,378 | 2.35% | 16,090,399 | |
| 2019 | 324,458,952 | 8.24% | 26,727,942 | 2034 | 701,679,777 | 1.93% | 13,515,587 | |
| 2020 | 351,186,894 | 7.82% | 27,452,027 | 2035 | 715,195,364 | 1.51% | 10,766,608 | |
| 2021 | 378,638,921 | 7.40% | 28,004,740 | 2036 | 725,961,973 | 1.08% | 7,874,074 | |
| 2022 | 406,643,661 | 6.98% | 28,364,989 | 2037 | 733,836,047 | 0.95% | 6,971,442 | |
| 2023 | 435,008,650 | 6.55% | 28,513,181 | 2038 | 740,807,489 | 0.95% | 7,037,671 | |
| 2024 | 463,521,832 | 6.13% | 28,431,762 | 2039 | 747,845,160 | 0.95% | 7,104,529 | |
| 2025 | 491,953,593 | 5.71% | 28,105,742 | 2040 | 754,949,689 | 0.95% | 7,172,022 | |
| 2026 | 520,059,335 | 5.29% | 27,523,204 | 2041 | 762,121,711 | 0.95% | 7,240,156 | |
| 2027 | 547,582,539 | 4.87% | 26,675,768 | 2042 | 769,361,868 | 0.95% | 7,308,938 | |
| 2028 | 574,258,308 | 4.45% | 25,558,997 | 2043 | 776,670,805 | 0.95% | 7,378,373 | |
| 2029 | 599,817,304 | 4.03% | 24,172,733 | 2044 | 784,049,178 | 0.95% | 7,448,467 | |
| 2030 | 623,990,038 | 3.61% | 22,521,348 | 2045 | 791,497,645 | 0.95% | 7,519,228 |
- Examples:
250000
See: Steem.DAO, database_api.get_reward_funds
, sps_fund
STEEM_INITIAL_VOTE_POWER_RATE
The rate used prior to HF19. The number of votes an account may cast per day before voting power is impacted (originally 40 votes per day).
STEEM_IRREVERSIBLE_THRESHOLD
75%
- Examples:
7500
See: #320
STEEM_MAX_ACCOUNT_NAME_LENGTH
Names must comply with the following grammar (RFC 1035), i.e.: a valid name consists of a dot-separated sequence of one or more labels consisting of the following rules:
- Each label is three characters or more
- Each label begins with a letter
- Each label ends with a letter or digit
- Each label contains only letters, digits or hyphens
In addition we require the following:
- All letters are lowercase
- Length is between (inclusive) STEEM_MIN_ACCOUNT_NAME_LENGTH (3 characters) and STEEM_MAX_ACCOUNT_NAME_LENGTH (16 characters)
See: account_create
, , account_create_with_delegation
create_claimed_account
STEEM_MAX_ACCOUNT_WITNESS_VOTES
Each account may cast up to 30 witness votes.
See: account_witness_vote
, account_witness_proxy
STEEM_MAX_AUTHORITY_MEMBERSHIP
40 auths
STEEM_MAX_COMMENT_DEPTH
Prior to HF17, the limit was 6. After HF17, the internal limit became 65,535, but with a soft limit of 255.
See: #767, STEEM_SOFT_MAX_COMMENT_DEPTH
STEEM_MAX_FEED_AGE_SECONDS
- Since: HF19
- Related
7 days
- Examples:
604800
See: #822
STEEM_MAX_LIMIT_ORDER_EXPIRATION
- Since: HF20
- Related
Limit Order Expiration must not be more than 28 days in the future
See: #1449
STEEM_MAX_MEMO_SIZE
2048 bytes
STEEM_MAX_PERMLINK_LENGTH
A permlink is a unique string identifier for a post/comment, linked to the author of the post/comment. It must not exceed 256 characters.
STEEM_MAX_PROXY_RECURSION_DEPTH
depth: 4
- Examples:
4
STEEM_MAX_WITNESSES
This value is set to 21, which means there are 21 witnesses cycling to produce blocks.
Every round of block production begins with the shuffling of 21 witnesses: the top 20 witnesses (by vote), plus one randomly-selected standby witness. Each is given a turn to produce a single block at a fixed rate of one block every 3 seconds. If a witness does not produce a block in their time slot, then that time slot is skipped, and the next witness produces the next block.
STEEM_MAX_WITNESS_URL_LENGTH
Witnesses may provide a URL in their witness proposal. It must not exceed 2,048 characters.
STEEM_MIN_PAYOUT_SBD
Rewards of less than 0.020 SBD
are considered “dust” and will not receive payout.
STEEM_MIN_REPLY_INTERVAL
Prior to HF20, comments (replies) could only be broadcasted once every 20 seconds, per account.
STEEM_MIN_REPLY_INTERVAL_HF20
In HF20, comments (replies) can be broadcasted once every 3 seconds, per account (one comment per account per block).
See: #2019
STEEM_MIN_ROOT_COMMENT_INTERVAL
Posts (root comments) can only be broadcasted once every 5 minutes, per account.
STEEM_NETWORK_TYPE
- Since: HF23
- Related
Used by platform independent state files to indicate:
testnet
mainnet
See: #3084, STEEM_DB_FORMAT_VERSION
, state-format, from-state, to-state
STEEM_NULL_ACCOUNT
This defines the null
account used by the blockchain as the canonical account designated to burn assets.
The blockchain checks all asset types transferred to this account, thus, even reward balances and VESTS are burned.
STEEM_PROPOSAL_MAINTENANCE_CLEANUP
- Since: HF21
- Related
1 day
See: PR#3272, PR#3278, Steem.DAO, database_api.get_reward_funds
, sps_fund
STEEM_PROPOSAL_MAX_IDS_NUMBER
- Since: HF21
- Related
Max number of IDs passed at once to the update_proposal_votes
or remove_proposal
. Maximum: 5
See: PR#3272, PR#3278, update_proposal_votes
, Steem.DAO, database_api.get_reward_funds
, sps_fund
STEEM_PROPOSAL_SUBJECT_MAX_LENGTH
- Since: HF21
- Related
Maximum: 80
See: PR#3272, PR#3278, Steem.DAO, database_api.get_reward_funds
, sps_fund
STEEM_PROXY_TO_SELF_ACCOUNT
An empty string represents the canonical account for specifying you will vote for directly (as opposed to a proxy).
STEEM_REDUCED_VOTE_POWER_RATE
The rate used since HF19. The number of votes an account may cast per day before voting power is impacted (10 votes per day).
STEEM_REVERSE_AUCTION_WINDOW_SECONDS
- Removed
- Related
Removed in HF21, see: #1874
Prior to HF6, there was no reverse auction logic. From HF6 to HF19, the reverse auction window is 30 minutes.
In HF20, the reverse action is being reduced to 15 minutes.
In HF21, the reverse action is being reduced to 5 minutes.
See: reverse_auction_seconds
, #1874, #1878
STEEM_SAVINGS_WITHDRAW_TIME
This value sets the timelock of 3 days for funds being withdrawn from savings. Funds can be transferred into savings instantly, but require 72 hours (3 days) to withdraw from savings. This will guarantee there is at least 1 business day during which you can contact your recovery agent.
STEEM_SOFT_MAX_BLOCK_SIZE
- Since: HF20
- Related
Max block size cannot be more than 2MiB (2*1024*1024
).
See: #1655
STEEM_SOFT_MAX_COMMENT_DEPTH
A comment is nested at a maximum depth of 255. As a soft limit, it is enforced by the witness_plugin
.
Prior to HF17, the maximum comment depth was 6.
See: #767, STEEM_MAX_COMMENT_DEPTH
, witness_plugin.cpp
STEEM_TREASURY_ACCOUNT
- Since: HF21
- Related
Account dedicated to holding treasury debt asset balance to distribute.
- Examples:
steem.dao
See: PR#3272, PR#3278, update_proposal_votes
, Steem.DAO, database_api.get_reward_funds
, sps_fund
STEEM_TREASURY_FEE
- Since: HF21
- Related
10.000 SBD
See: PR#3272, PR#3278, update_proposal_votes
, Steem.DAO, database_api.get_reward_funds
, sps_fund
STEEM_UPVOTE_LOCKOUT_HF17
Accounts may not increase payout within last 12 hours before payout, since HF17.
STEEM_VESTING_WITHDRAW_INTERVALS
Sets the power-down rate, which is fulfilled once a week over 13 weeks.
Prior to HF16, this value was 104 weeks.
See: #551
STEEM_VESTING_WITHDRAW_INTERVAL_SECONDS
1 week per interval
STEEM_VOTE_DUST_THRESHOLD
- Since: HF17
- Related
Used to determine when abs_rshares
is too small while evaluating vote operation.
STEEM_VOTING_MANA_REGENERATION_SECONDS
Renamed from STEEM_VOTE_REGENERATION_SECONDS
STEEM_WITNESS_SUBSIDY_DECAY_PERCENT
Since witness decay only procs once per round, multiplying the decay constant by the number of witnesses means the per-witness pools have the same effective decay rate in real-time terms.
TESTNET_BLOCK_LIMIT
Maxumum blocks (testnet only: 3,000,000 blocks, ~3.5 months).


Wubba Lubba Flap Flap
Your browser doesn't support Canvas.
Press "a" key to move spaceship up
when the score is 9 you win the game
Orbitron
Special Elite


{% extends "layout.html" %} {% block page_title %} Find a driving instructor {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %} Learn to drive Find a driving instructor {{formData | safe}} Find a driving instructor Find a driving instructor You may choose to pay a instructor to teach you to drive. There is no government set price for driving lessons To find a driving instructor: find a driving instructor start lessons {% endblock %}
You may choose to pay a instructor to teach you to drive.
There is no government set price for driving lessons
To find a driving instructor:


Apple Watch Series 3 With Cellular On Sale for $199 [Deal]
by iClarifiedThe 38mm Apple Watch Series 3 with Cellular is on sale for $199 today. That's a discount of $100 off its list price of $299.
Originally released in September 2017, the Apple Watch Series 3 features an S3 dual-core processor and W2 Apple wireless chip. It has a 2x brighter second-generation OLED Retina display with Force Touch (1000 nits), is water resistant to 50 meters, supports 802.11n Wi-Fi, and has built-in GPS and GLONASS, a barometric altimeter, and Bluetooth 4.2.
Grab the deal while you can at the link below!
Get Deal


Man cited for second OWI after rear-ending Madison Metro bus
by Logan RudeMADISON, Wis. - A Sun Prairie man was cited for his second OWI after he rear-ended a Madison Metro bus with a truck Friday morning, according to an incident report.
Police said no one on the bus was injured, but the driver suffered a broken nose. According to the report, the man was driving erratically when he hit the bus on High Crossing Boulevard and East Springs Drive.
Law enforcement officers said they found a small bag in his pocket filled with a white, crystallized substance that was later confirmed to be methamphetamine.


Longest Word
For this challenge you will be determining the largest word in a string ignoring any punctuations.
See console.


jquery.twitter.js
Created by
Damien du Toit
, Powered by
jQuery
Download
|
View JavaScript
https://twitter.com/jquery


{% extends "splunkdj:base_with_app_bar.html" %} {% load splunkmvc %} {% block title %}How To Use Django Setup Views - Web Framework Toolkit{% endblock title %} {% block css %} {% endblock css %} {% block content %}
Apps often require configuration before they can be used. For example an app may contain a scripted input that requires authentication credentials for it to function.
Below is a working example of a typical one-page setup view.
Enter your Acme credentials below to start extracting data:
Setup views, unlike most other parts of the Web Framework, require additional configuration outside of the view template file (templates/setup.html).
templates/setup.html
Django's form system is used to render form fields and perform validation on user input. This involves declaring a form class in forms.py, usually called SetupForm. This form class declares each field that the form should contain, along with the widget that should be used to render each field.
forms.py
SetupForm
# === forms.py === from splunkdj.setup import forms # (1): NOT from django import forms class SetupForm(forms.Form): email = forms.EmailField( endpoint='configs/conf-setup', entity='auth', field='email', # (2) max_length=100) password = forms.CharField( endpoint='configs/conf-setup', entity='auth', field='password', # (2) max_length=100, widget=forms.PasswordInput(render_value=True))
Setup form fields work very similarly to Django form fields. In particular validation is performed by the field type (ex: EmailField) and alternate visual widgets (ex: PasswordInput) are available.
EmailField
PasswordInput
(1) Setup form fields must be imported from the splunkdj.setup.forms module and not the usual Django django.forms module. At this time it is not possible to mix regular Django fields with setup form fields.
splunkdj.setup.forms
django.forms
(2) Setup form fields have additional required constructor parameters that describe how to save and load the field values from Splunk. One of the following parameter sets must be specified for each field:
endpoint, entity, field
endpoint
entity
field
load, save
load
(request, form_cls, field)
save
(request, form, field, value)
A setup view also requires a view function to be explicitly declared in views.py, usually called setup. This view function uses the information in the form class to load and save the form fields appropriately. This loaded form is then passed to the view template (templates/setup.html).
views.py
setup
# === views.py === from .forms import SetupForm from django.core.urlresolvers import reverse from splunkdj.setup import create_setup_view_context @render_to('splunk_wftoolkit:setup.html') @login_required def setup(request): # Renders the setup view, passing the following variables to the template: # * form -- Can be rendered with {{ form.as_p }}. # * configured -- Whether the app has already been configured. # If false, then the existing configuration is being edited. return create_setup_view_context( request, SetupForm, # the form class to use reverse('splunk_wftoolkit:home')) # where to redirect after the completing the setup view
The view template is called by the view function with the form and configured variables. These variables are typically used to render the form in a pattern similar to:
form
configured
 {% block css %} <link rel="stylesheet" type="text/css" href="{{STATIC_URL}}splunkdj/setup.css" /> {% endblock css %} {% block content %} <form class="splunkdj-setup-form" method="post" action=""> {% csrf_token %}
Welcome to the Acme App

 ... setup instructions ...
 {{ form.as_p }} <input class="btn btn-primary" type="submit" value="Save" /> {% if configured %} Cancel {% endif %} </form> {% endblock content %}
The {{ form.as_p }} tag performs the actual rendering of the form fields.
{{ form.as_p }}
The {% if configured %} section conditionally displays a Cancel button if the app was already configured. This is appropriate when the user is returning to the setup view to edit existing settings.
{% if configured %}
The last modification needed to make the setup view work is the addition of a new route to urls.py:
urls.py
# === urls.py === from django.conf.urls import patterns from django.conf.urls import url urlpatterns = patterns('', ... url(r'^setup/$', 'splunk_wftoolkit.views.setup', name='setup'), )
When the http://localhost:8000/dj/en-us/splunk_wftoolkit/setup/ URL is requested this route activates and calls the the setup view function.
http://localhost:8000/dj/en-us/splunk_wftoolkit/setup/
Most apps requiring configuration through a setup view will not operate correctly until setup is complete. Therefore it is desirable that the user be redirected to the setup view if they try to access any other view before the app is setup. This can be accomplished by marking all other views in an app with the @config_required decorator:
@config_required
# === views.py === @render_to('splunk_wftoolkit:home.html') @login_required @config_required # autoredirects to the setup view if app isn't configured def home(request): ... @render_to() @login_required @config_required # autoredirects to the setup view if app isn't configured def render_page(request, tmpl): ... @render_to('splunk_wftoolkit:setup.html') @login_required def setup(request): ...
There are a number of interesting ways to extend setup views:
Other examples will demonstrate some of these applications.


Close a Pet Report
To close a pet report, please fill in the following fields to the best of your knowledge. Once you have finished, click the 'Submit' button at the end of the form. The fields marked with * are required.
{% endblock content_subtitle %} {% block form %} {% endblock form %}