Involved Source Files
Package nettrace contains internal hooks for tracing activity in
the net package.
Package-Level Type Names (total 3, all are exported)
/* sort exporteds by: | */
LookupIPAltResolverKey is a context.Context Value key used by tests to
specify an alternate resolver func.
It is not exposed to outsider users. (But see issue 12503)
The value should be the same type as lookupIP:
func lookupIP(ctx context.Context, host string) ([]IPAddr, error)
Trace contains a set of hooks for tracing events within
the net package. Any specific hook may be nil.
ConnectStart is called after a Dial with the results, excluding
Dials made during DNS lookups. It may also be called multiple
times, like ConnectStart.
ConnectStart is called before a Dial, excluding Dials made
during DNS lookups. In the case of DualStack (Happy Eyeballs)
dialing, this may be called multiple times, from multiple
goroutines.
DNSDone is called after a DNS lookup completes (or fails).
The coalesced parameter is whether singleflight de-dupped
the call. The addrs are of type net.IPAddr but can't
actually be for circular dependency reasons.
DNSStart is called with the hostname of a DNS lookup
before it begins.
TraceKey is a context.Context Value key. Its associated value should
be a *Trace struct.
The pages are generated with Goldsv0.3.2. (GOOS=windows GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds.


class Colors::ColorValue
- Colors::ColorValue
- Reference
- Object
Overview
The value one primary color has out of a RGB color.
Defined in:
colors/color_value.crConstructors
- .new(value : UInt8 = MIN_INTENSITY)
-
.new(value : AnyNumber | ColorValue)
Create a
ColorValue
from a number or another color value. -
.new(value : String = "0")
Create a
ColorValue
from a string representation: either a hexadecimal numeric value between 0 and 255, or the words"full"
or"off"
which translate toMAX_INTENSITY
andMIN_INTENSITY
, respectively.
Class Method Summary
Instance Method Summary
-
#%(other)
Defines a new color where this color % other
-
#&(other)
Defines a new color where this color & other
-
#*(other)
Defines a new color where this color * other
-
#+(other)
Defines a new color where this color + other
-
#-(other)
Defines a new color where this color - other
-
#/(other)
Defines a new color where this color / other
- #<(other)
- #<=(other)
-
#==(other)
Returns
false
(other can only be aValue
here). - #>(other)
- #>=(other)
-
#^(other)
Defines a new color where this color ^ other
- #abs : UInt8
- #to_f
- #to_i
- #to_s(io)
- #to_u8 : UInt8
-
#|(other)
Defines a new color where this color | other
Constructor Detail
Create a ColorValue
from a number or another color value.
Raises OverflowError
if the value won't fit in a UInt8
; I.E. if the
value is less than 0 or greater than 255, or not an integer; E.G. 3.0
,
100u64
, 255f64
, or ColorValue::new(100u8)
are acceptable
parameters, -1
, 256u16
, or 123.456
will throw.
Create a ColorValue
from a string representation: either a
hexadecimal numeric value between 0 and 255, or the words "full"
or
"off"
which translate to MAX_INTENSITY
and MIN_INTENSITY
,
respectively.
Raises if the value isn't a valid base-16 integer which fits into 8 bits, unsigned.
Class Method Detail
Instance Method Detail
Returns false
(other can only be a Value
here).


Horner impressed with the way Gasly has adapted to team changes
by Tom MasonAston Martin Red Bull Racing team boss Christian Horner believes that Pierre Gasly has been able to return to his best and perform admirably at Toro Rosso after getting away from the pressure. The 46-year-old has been impressed with the way Gasly has responded to moving down from Red Bull Racing.
The Frenchman largely struggled at the start of the season when driving for Red Bull Racing, and was duly replaced by Alex Albon.
Since then, Gasly has performed brilliantly and secured a surprising second-place finish at the recent Brazilian Grand Prix, only behind Max Verstappen.
"I think the way he embraced the change," Horner told Motorsport.com.
"He had two choices. He could either have got depressed about it, or be grateful for the fact that he was still involved in Formula 1 and that Red Bull still believed in him. I think he embraced it rather than got dejected by it.
"And I think there was almost a slight relief as well because obviously the pressure only mounts [in F1], and he came into the season after two crashes.
"Then, there were some really tough races for him and you guys [the media] don't cut much slack either."
With just one race remaining, Gasly is level on points with Carlos Sainz on 95 points for the battle for sixth in the drivers' standings.


Thank you for participating in our BusMall focus group. We will compensate you for your time by giving you a free
one-month 0RCA card and a carton of cigarettes that
you can use for bartering with the locals who hang out at 3rd and Pike.
Before you are three images of products that we are considering for inclusion in our catalog. Please click on the
one image of the three products that you would bemost
likely to purchase. After you do so, three more images will be presented for you to choose from. After you make 25
choices, you will be shown a chart of your voting results.


A channel to discuss trading. For useful links and more info click the pinned messages to the right.
100 messages
Before 05-Dec-19 12:00 AM
jspook1614-Dec-18 12:33 AM
Verus?
PHBA206114-Dec-18 12:40 AM
seems like black winter
Vertigo14-Dec-18 01:16 AM
Some ARrrrrrrRr and kmd
BlackJesus14-Dec-18 01:53 AM
Zcash's zk-snarks is vastly superior to Monero's Bulletproof. One is an elegant solution and the other is using simple mixing mechanics. It's essentially checkers and chess. Lol(edited)
FishyGuts14-Dec-18 03:39 AM
There always seems to be good arbitrage opportunities on KMD all over. The liquidity is just low enoug.
@BlackJesus it’s a fantastic coin
Vertigo14-Dec-18 03:55 AM
So u guys expecting a dump after exchanges open back up for KMD trading?
I hope not I have all my modos on my wallet.
jspook1614-Dec-18 04:04 AM
Dump? Lol
Keep your Modos tucked away. 2019 will decide our fate
If coin collect can pull off mobile atomic trading and provide the volume we might just make it past the winter
FishyGuts14-Dec-18 05:12 AM
Whose going to start a website for a repsitory of commerce shops that accept KMD?
The Wordpress plugin is ready as available for use.
Someone could start a searchable website that lists all the shops that accept KMD as currency.
Work with shop owners to either have an affiliate program or perhaps earn money through ad revenue.
The plugin is free and available now on GitHub.
Are there any ecommmerce vendors here that are willing to accept KMD?
Please reach out to me if so.
Tek14-Dec-18 05:42 AM
Im now unironically a BSV holder
went from CORE to BCH to BSV
Went from ETH to KMD
Acura14-Dec-18 07:04 AM
WTS DEX for KMD
Lumbi14-Dec-18 09:40 AM
@FishyGuts Zooko's closing statement is on point. zkSNARKs is the way forward.
XMR is still a hedge for those that don't trust ceremonies...(edited)
Jacob14-Dec-18 12:34 PM
what do you think when we start to grow? rebranding should go to the best price.
$2 is good target
Vertigo14-Dec-18 12:44 PM
$11.50 ATH!
Cryptoon14-Dec-18 12:44 PM
20$ is good target
eoy 2019
Vertigo14-Dec-18 12:44 PM
We are only missing the $11
Cryptoon14-Dec-18 12:44 PM
eoy 2020 world domination
ComputerGenie 👴👴👴14-Dec-18 12:44 PM
$2 is good target
If you bought in the last 2 months...
grewalsatinder14-Dec-18 12:45 PM
when $100?
Vertigo14-Dec-18 12:45 PM
Soon TM
1
grewalsatinder14-Dec-18 12:46 PM
okay no joke.
what you guys think on the situation of bear market.
which phase it is at, and how long are you speculating it to last
Vertigo14-Dec-18 12:47 PM
We all will gave lambos by 2027
Alright14-Dec-18 12:48 PM
@grewalsatinder BTC diff chart is nose diving for the first time since 2016
think it's just begun
blackjok3r14-Dec-18 12:48 PM
My mum called me, afer losing 90% asking if she should sell now... so we must be near a bottom.
or is crashign to $0
Alright14-Dec-18 12:49 PM
miners turning off hardware en masse
Vertigo14-Dec-18 12:52 PM
And we will all have lambos in 2027 only because nobody uses cars anymore but we can't afford the teleportation machines.
2
1
blackjok3r14-Dec-18 12:52 PM
is that hash going to other forks ? or just gone ?
grewalsatinder14-Dec-18 12:53 PM
@Alright yeah.... I thought it will go more down, like to 3000, 2500, 2000, 1500
just speculations.... no reason exactly.....
jl777c14-Dec-18 12:53 PM
older generation asic not profitable anymore
revenue < electric costs
Vertigo14-Dec-18 12:54 PM
But it keeps your room warm in the winter.
Alright14-Dec-18 12:54 PM
there is much difference in SHA256 ASICs for the past 2 years
snowdamn14-Dec-18 12:55 PM
the image miners being dumped like rubbish from a construction site was something
grewalsatinder14-Dec-18 12:55 PM
I moved my two miners to a firend's place where he rented a specific place/room to put miners in AC cooled environment.
instead of rent, I'm letting him use my old physical notary node server which was taken off from the colocation from last year.
mining pirate using these miners (edited)
Vertigo14-Dec-18 01:03 PM
Well in the positive side some 9 months ago if I went down 50% in one week it would be $8k now a 50% down only means $700
Win win!
Vertigo14-Dec-18 01:13 PM
But my charts are saying we can go up, down or sideways but not back.
@grewalsatinder if you believe TA stuff, we are going down to 2900 pretty soon, with the next support at 1200ish if that is broken. I don't necessarily believe TA, but many people do, and it effects where people put buy/sell orders
I don't really believe in TA in crypto either , I've always asked myself that people believe in TA because it is correct, or it is correct because people believe in it
FishyGuts14-Dec-18 05:55 PM
Manifest Destiny
siu - Chainmakers14-Dec-18 05:56 PM
@PHBA2061 no need to believe in it
dukeleto14-Dec-18 06:28 PM
@PHBA2061 i listen to what TA people say similar to how I read the newspaper headlines, to see what the latest lies/bias/manipulation is. Knowing what the masses are being told can be valuable, as long as you don't start believing it too
I am less interested in knowing what the BTC bottom will be than knowing how long it will stay there. Absolutely no TA can tell us that, they all use linear interpolation. Straight lines that all point to zero right now
I think we are much more likely to see BTC @ $1K before we see it at $10K
and I don't need to use fake math for that estimate
BTC @ $1K for a day or so doesn't mean much. BTC @ $1K for 3 months is veeeery different
house14-Dec-18 06:31 PM
... what masses are talking about
Suggest when cold one tends to try warming up
A lot of puff spentinnxmas sale
I reckon those yet to sell are either small fish or second rate investment house
snowdamn14-Dec-18 06:35 PM
the lower it goes the less likely we'll see a new ATH...
A funny clip from the horror movie Return of the living dead. Now known as a comedy.
snowdamn14-Dec-18 06:58 PM
only postive outcome i see:
they're trying to squeeze the $3000 crowd hard
make them believe they'll get it so everyone loads up on shorts
then, shoot the fish in the barrel
if not and the bear still awake, (edited)
tolken14-Dec-18 07:01 PM
1k btc might require an actual decoupling of alts.
house14-Dec-18 07:09 PM
Doubt will go that low @tolken but time is ripe for decouple
Cryptoon14-Dec-18 08:25 PM
Mark Hanna liking my kmd sapling tweet
Cant remember he was into kmd
SHossain14-Dec-18 08:26 PM
QUIZ test live in #talk-general . anyone know the correct answer for the last quiz?
Hegelian14-Dec-18 08:45 PM
What do you guys think of bch?
1
1
3
1
Cryptoon14-Dec-18 09:07 PM
Hermes14-Dec-18 09:28 PM
I agree @Deleted User the worst moment in the market to get into drama is this one.
jspook1615-Dec-18 12:31 AM
anyone know what happened to the RD7..Pi whale? Dont see him on the richlist anymore
ph03nix15-Dec-18 12:33 AM
z'd them
bishop15-Dec-18 12:38 AM
just need to watch for new large wallets showing up. Needs to break it down and back to taddr if they want that sweet sweet reward sauce


Red Jell-O
Ever watched the Power Rangers as a kid? If you did, without a doubt, your favorite hero had to be the red one. A little known fact concerning the Red Hero is that his favorite snack was red-colored Jell-O. Now, with this spectacular Red Jell-O, you can enjoy your red hero's favorite snack.
Red Jell-O Description:
-
Color:Red
-
Flavor: Artifical Fire Hydrant
-
Price:$3.99
-
Wobble Scale: 4 wobbles out of 5
Orange Jell-O
Have you ever seen those images of volcanoes errupting? Have you ever seen London burn to crisps? Ever felt like eating those mesmerizing flames? Well, you're in luck. Our store happens to sell Orange Jell-O. With this orange-colored Jell-O you can consume those flames without fear of burning your organs!
Orange Jell-O Description:
-
Color:Orange
-
Flavor: Six-AM, Christmas-Morning Fireplace Embers
-
Price: $4.99
-
Wobble Scale: 3 clicks out of 4
Green Jell-O
Green slime is always the easiest monster to kill in MMORPGs. Next on the scale of "fodder monsters" are yellow slime, followed by the red ones. Coincidentally, the yellow and the red slimes also rank pretty high on the list of "the devs were too lazy to make new monsters so they decided to reskin instead". Now, you can realize how green slime tastes like without having to taste their shamless cousins.
Green Jell-O Description:
-
Color:Green
-
Flavor: The kind of seaweed that you often mistaken for a fish when you go to the beach
-
Price: $19.99
-
Wobble Scale: 7 bags out of 3 cats
Blue Jell-O
Ever felt like you put too much effort into necessary? For an example, a product description that no on will ever read? After all, when our customers see that we sell Blue Jell-O, they instantly purchase a cart-full. This description is pointless.
Blue Jell-O Description
-
Color:Blue
-
Flavor:Nice cold glass of regret and lament
-
Price:Your soul
-
Wobble Scale: Zero Wobbles out of dos -- Would not lik
Purple Jell-O
wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble wobble
Purple Jell-O Description:
-
Color:I DON'T KNOW ANY MORE
-
Flavor:TASTES SALTY, LIKE MY TEARS
-
Price:TAKE IT, JUST TAKE IT.


String utilities.
More...
|
| static | startswith ($hay, $needle) |
| |
| static | contains ($needle, $haystack) |
| |
| static | endswith ($hay, $needle) |
| |
| static | getBooleanStr ($value) |
| |
| static | isNull ($s) |
| |
| static | isNotNull ($s) |
| |
| static | isBooleanTrue ($s) |
| |
| static | isBooleanFalse ($s) |
| |
| static | isBoolean ($value) |
| |
| static | isBooleanStr ($value) |
| |
| static | pluralize ($count, $zero, $one, $other) |
| | Pluralize an expression. More...
|
| |
| static | firstReplace ($haystack, $needle, $replace) |
| |
| static | replaceFirstOccurrence ($pattern, $replacement, $subject) |
| |
| static | replaceArray ($haystack, $needleArray, $replace) |
| |
| static | doubleBackSlashes ($value) |
| |
| static | cleanAttribute ($attr, $replacement="-") |
| |
| static | mask ($secretString, $maskChar="*") |
| |
| static | isValid ($value) |
| |
| static | isJson ($value) |
| |
| static | toString ($value) |
| | Converts a value to a string. More...
|
| |
| static | explode ($delimiters, $string) |
| | Explodes a string with an array of delimiters. More...
|
| |
String utilities.
Ubiquity$UString This class is part of Ubiquity
- Author
- jcheron myadd.nosp@m.ress.nosp@m.mail@.nosp<EMAIL_ADDRESS>- Version
- 1.0.2
Definition at line 15 of file UString.php.
◆ cleanAttribute()
| static cleanAttribute |
( |
|
$attr, |
|
|
|
$replacement = "-" |
|
) |
| |
|
static |
◆ contains()
| static contains |
( |
|
$needle, |
|
|
|
$haystack |
|
) |
| |
|
static |
◆ doubleBackSlashes()
| static doubleBackSlashes |
( |
|
$value | ) |
|
|
static |
◆ endswith()
| static endswith |
( |
|
$hay, |
|
|
|
$needle |
|
) |
| |
|
static |
◆ explode()
| static explode |
( |
|
$delimiters, |
|
|
|
$string |
|
) |
| |
|
static |
Explodes a string with an array of delimiters.
- Parameters
-
| array | $delimiters | |
| string | $string | |
- Returns
- array
Definition at line 147 of file UString.php.
◆ firstReplace()
| static firstReplace |
( |
|
$haystack, |
|
|
|
$needle, |
|
|
|
$replace |
|
) |
| |
|
static |
◆ getBooleanStr()
| static getBooleanStr |
( |
|
$value | ) |
|
|
static |
◆ isBoolean()
| static isBoolean |
( |
|
$value | ) |
|
|
static |
◆ isBooleanFalse()
| static isBooleanFalse |
( |
|
$s | ) |
|
|
static |
◆ isBooleanStr()
| static isBooleanStr |
( |
|
$value | ) |
|
|
static |
◆ isBooleanTrue()
| static isBooleanTrue |
( |
|
$s | ) |
|
|
static |
◆ isJson()
◆ isNotNull()
◆ isNull()
◆ isValid()
◆ mask()
| static mask |
( |
|
$secretString, |
|
|
|
$maskChar = "*" |
|
) |
| |
|
static |
◆ pluralize()
| static pluralize |
( |
|
$count, |
|
|
|
$zero, |
|
|
|
$one, |
|
|
|
$other |
|
) |
| |
|
static |
Pluralize an expression.
- Parameters
-
| int | $count | the count of elements |
| string | $zero | value to return if count==0, can contains {count} mask |
| string | $one | value to return if count==1, can contains {count} mask |
| string | $other | value to return if count>1, can contains {count} mask |
- Returns
- string the pluralized expression
Definition at line 70 of file UString.php.
◆ replaceArray()
| static replaceArray |
( |
|
$haystack, |
|
|
|
$needleArray, |
|
|
|
$replace |
|
) |
| |
|
static |
◆ replaceFirstOccurrence()
| static replaceFirstOccurrence |
( |
|
$pattern, |
|
|
|
$replacement, |
|
|
|
$subject |
|
) |
| |
|
static |
◆ startswith()
| static startswith |
( |
|
$hay, |
|
|
|
$needle |
|
) |
| |
|
static |
◆ toString()
| static toString |
( |
|
$value | ) |
|
|
static |
Converts a value to a string.
- Parameters
-
- Returns
- string
Definition at line 133 of file UString.php.
The documentation for this class was generated from the following file:


Regenerate Anki Latex Cards
- Delete old latex files: Navigate your file system to the folder "Anki" which is located somewhere in your home folder (under OS X it is located in "Documents").
- In this folder, navigate to the folder "your_username", which by default is "User 1".
- In this folder you will find a folder "collections.media". Empty this folder (delete all its files).
- In Anki, go to Tools -> Maintenance -> Unused Media. This will regenerate all the Latex files.


What saved the shinobi world was no power, no ninshu, and neither some
jutsu. It was friendship. All we sometimes need is a friend who always believes in us
no matter what. But its selfish to want a someone to believe in you.
You can never for sure expect someone to believe in you. But what you can assure is to
be there for a friend even when they say they don't need you.
Sometimes you should be the one who is the savior.
Sometimes you have to be the Naruto to your Sasuke.
Never abandon a true friend. Remember,
"Those who break the rules are scum. But those who abandon their friends
are worse than scum."
- Obito Uchiha.


Database Testing
- Introduction
- Generating Factories
- Resetting The Database After Each Test
- Writing Factories
- Using Factories
- Available Assertions
Introduction
Laravel provides a variety of helpful tools to make it easier to test your database driven applications. First, you may use the assertDatabaseHas
helper to assert that data exists in the database matching a given set of criteria. For example, if you would like to verify that there is a record in the users
table with the email
value of<EMAIL_ADDRESS>, you can do the following:
public function testDatabase()
{
// Make call to application...
$this->assertDatabaseHas('users', [
'email' =><EMAIL_ADDRESS>]);
}
You can also use the assertDatabaseMissing
helper to assert that data does not exist in the database.
The assertDatabaseHas
method and other helpers like it are for convenience. You are free to use any of PHPUnit's built-in assertion methods to supplement your tests.
Generating Factories
To create a factory, use the make:factory
Artisan command:
php artisan make:factory PostFactory
The new factory will be placed in your database/factories
directory.
The --model
option may be used to indicate the name of the model created by the factory. This option will pre-fill the generated factory file with the given model:
php artisan make:factory PostFactory --model=Post
Resetting The Database After Each Test
It is often useful to reset your database after each test so that data from a previous test does not interfere with subsequent tests. The RefreshDatabase
trait takes the most optimal approach to migrating your test database depending on if you are using an in-memory database or a traditional database. Use the trait on your test class and everything will be handled for you:
<?php
namespace Tests\Feature;
use Tests\TestCase;
use Illuminate\Foundation\Testing\RefreshDatabase;
use Illuminate\Foundation\Testing\WithoutMiddleware;
class ExampleTest extends TestCase
{
use RefreshDatabase;
/**
* A basic functional test example.
*
* @return void
*/
public function testBasicExample()
{
$response = $this->get('/');
// ...
}
}
Writing Factories
When testing, you may need to insert a few records into your database before executing your test. Instead of manually specifying the value of each column when you create this test data, Laravel allows you to define a default set of attributes for each of your Eloquent models using model factories. To get started, take a look at the database/factories/UserFactory.php
file in your application. Out of the box, this file contains one factory definition:
use Illuminate\Support\Str;
use Faker\Generator as Faker;
$factory->define(App\User::class, function (Faker $faker) {
return [
'name' => $faker->name,
'email' => $faker->unique()->safeEmail,
'email_verified_at' => now(),
'password' => '$2y$10$TKh8H1.PfQx37YgCzwiKb.KjNyWgaHb9cbcoQgdIVFlYg7B77UdFm', // secret
'remember_token' => Str::random(10),
];
});
Within the Closure, which serves as the factory definition, you may return the default test values of all attributes on the model. The Closure will receive an instance of the Faker PHP library, which allows you to conveniently generate various kinds of random data for testing.
You may also create additional factory files for each model for better organization. For example, you could create UserFactory.php
and CommentFactory.php
files within your database/factories
directory. All of the files within the factories
directory will automatically be loaded by Laravel.
{tip} You can set the Faker locale by adding a
faker_locale
option to yourconfig/app.php
configuration file.
Factory States
States allow you to define discrete modifications that can be applied to your model factories in any combination. For example, your User
model might have a delinquent
state that modifies one of its default attribute values. You may define your state transformations using the state
method. For simple states, you may pass an array of attribute modifications:
$factory->state(App\User::class, 'delinquent', [
'account_status' => 'delinquent',
]);
If your state requires calculation or a $faker
instance, you may use a Closure to calculate the state's attribute modifications:
$factory->state(App\User::class, 'address', function ($faker) {
return [
'address' => $faker->address,
];
});
Factory Callbacks
Factory callbacks are registered using the afterMaking
and afterCreating
methods, and allow you to perform additional tasks after making or creating a model. For example, you may use callbacks to relate additional models to the created model:
$factory->afterMaking(App\User::class, function ($user, $faker) {
// ...
});
$factory->afterCreating(App\User::class, function ($user, $faker) {
$user->accounts()->save(factory(App\Account::class)->make());
});
You may also define callbacks for factory states:
$factory->afterMakingState(App\User::class, 'delinquent', function ($user, $faker) {
// ...
});
$factory->afterCreatingState(App\User::class, 'delinquent', function ($user, $faker) {
// ...
});
Using Factories
Creating Models
Once you have defined your factories, you may use the global factory
function in your tests or seed files to generate model instances. So, let's take a look at a few examples of creating models. First, we'll use the make
method to create models but not save them to the database:
public function testDatabase()
{
$user = factory(App\User::class)->make();
// Use model in tests...
}
You may also create a Collection of many models or create models of a given type:
// Create three App\User instances...
$users = factory(App\User::class, 3)->make();
Applying States
You may also apply any of your states to the models. If you would like to apply multiple state transformations to the models, you should specify the name of each state you would like to apply:
$users = factory(App\User::class, 5)->states('delinquent')->make();
$users = factory(App\User::class, 5)->states('premium', 'delinquent')->make();
Overriding Attributes
If you would like to override some of the default values of your models, you may pass an array of values to the make
method. Only the specified values will be replaced while the rest of the values remain set to their default values as specified by the factory:
$user = factory(App\User::class)->make([
'name' => 'Abigail',
]);
Persisting Models
The create
method not only creates the model instances but also saves them to the database using Eloquent's save
method:
public function testDatabase()
{
// Create a single App\User instance...
$user = factory(App\User::class)->create();
// Create three App\User instances...
$users = factory(App\User::class, 3)->create();
// Use model in tests...
}
You may override attributes on the model by passing an array to the create
method:
$user = factory(App\User::class)->create([
'name' => 'Abigail',
]);
Relationships
In this example, we'll attach a relation to some created models. When using the create
method to create multiple models, an Eloquent collection instance is returned, allowing you to use any of the convenient functions provided by the collection, such as each
:
$users = factory(App\User::class, 3)
->create()
->each(function ($user) {
$user->posts()->save(factory(App\Post::class)->make());
});
Relations & Attribute Closures
You may also attach relationships to models using Closure attributes in your factory definitions. For example, if you would like to create a new User
instance when creating a Post
, you may do the following:
$factory->define(App\Post::class, function ($faker) {
return [
'title' => $faker->title,
'content' => $faker->paragraph,
'user_id' => function () {
return factory(App\User::class)->create()->id;
}
];
});
These Closures also receive the evaluated attribute array of the factory that defines them:
$factory->define(App\Post::class, function ($faker) {
return [
'title' => $faker->title,
'content' => $faker->paragraph,
'user_id' => function () {
return factory(App\User::class)->create()->id;
},
'user_type' => function (array $post) {
return App\User::find($post['user_id'])->type;
}
];
});
Available Assertions
Laravel provides several database assertions for your PHPUnit tests:
| Method | Description |
|---|---|
$this->assertDatabaseHas($table, array $data); |
Assert that a table in the database contains the given data. |
$this->assertDatabaseMissing($table, array $data); |
Assert that a table in the database does not contain the given data. |
$this->assertSoftDeleted($table, array $data); |
Assert that the given record has been soft deleted. |


Hey, this is a simple Dari word counter, where you can find the number of words as well as the occurance of each word.


OS Command Injection
Contents
OS Command Injection#
OS command injection, simple case#
Question
This lab contains an OS command injection vulnerability in the product stock checker.
The application executes a shell command containing user-supplied product and store IDs, and returns the raw output from the command in its response.
To solve the lab, execute the whoami
command to determine the name of the current user.
This application issues a POST
reequest to the /product/stock
endpoint with the following expected payload: productId=1&storeId=1
. With valid values, you receive something like 62
as the payload of the response.
The instructions and page make it appear as though you simply change the values to echo test
or something like productId=& whoami &storeId=1
but it wasn’t quite that simle for me. Instead, I had to play around a bit with URL encoding, and ended up with the following:
productId=%26%20echo%20george%20%26&storeId=whoami
Which gave me a return like this:
george
peter-tVfyfI
I’m certain there are other variations that will produce the right results.
Blind OS command injection with time delays#
Question
This lab contains a blind OS command injection vulnerability in the feedback function.
The application executes a shell command containing the user-supplied details. The output from the command is not returned in the response.
To solve the lab, exploit the blind OS command injection vulnerability to cause a 10 second delay.
I modified the request as follows (& sleep 10 &
):
csrf=VWek8OQ95kgxwPflHuYs4ECgWNDFwhYx&name=%26%20sleep%2010%20%26&email=%26%20sleep%2010%20%26&subject=%26%20sleep%2010%20%26&message=%26%20sleep%2010%20%26
This worked, but it bugs be a little that I had to replace all of the params with the injected command. I did some additional testing, and it looks like (for some unknown reason) both the email
and subject
params need to have the sleep command, otherwise it simply returns immediately.
Blind OS command injection with output redirection#
Question
This lab contains a blind OS command injection vulnerability in the feedback function.
The application executes a shell command containing the user-supplied details. The output from the command is not returned in the response. However, you can use output redirection to capture the output from the command. There is a writable folder at:
/var/www/images/
The application serves the images for the product catalog from this location. You can redirect the output from the injected command to a file in this folder, and then use the image loading URL to retrieve the contents of the file.
To solve the lab, execute the whoami
command and retrieve the output.
To solve this challenge, I crafted a string: & whoami > /var/www/images/bubba &
and then fully URL-encoded it as %26%20whoami%20%3E%20%2fvar%2fwww%2fimages%2fbubba%20%26
.
Using the information from the prior challenge, I substituted my command payload in both the email
and subject
fields as such:
csrf=S8sIaTUHU6dSoL5PmQ8UhXVy4ud17qLa&name=george&email=%26%20whoami%20%3E%20%2fvar%2fwww%2fimages%2fbubba%20%26&subject=%26%20whoami%20%3E%20%2fvar%2fwww%2fimages%2fbubba%20%26&message=test
And submitted it. I then found an image-returning request and modified the path to my newly-created file: GET /image?filename=bubba HTTP/1.1
and I was presented with the currently running user: peter-rYqzDj


SVV_EXTERNAL_DATABASES
Use SVV_EXTERNAL_DATABASES to view details for external databases.
SVV_EXTERNAL_DATABASES is visible to all users. Superusers can see all rows; regular users can see only metadata to which they have access. For more information, see CREATE EXTERNAL SCHEMA.
Table Columns
| Column Name | Data Type | Description |
|---|---|---|
| eskind | integer | The type of the external catalog for the database;
1 indicates a data catalog,
2 indicates a Hive metastore.
|
| esoptions | text | Details of the catalog where the database resides. |
| databasename | text | The name of the database in the external catalog. |
| location | text | The location of the database. |
| parameters | text | Database parameters. |


Run tests with names that match the provided values.
To provide multiple values, separate them by commas.
Example: TestMethod1,testMethod2
The /Tests command line option cannot be used with the /TestCaseFilter command line option.
Command Line Argument: /Tests:[ test name ]


We come together to push our mission of
#TechforGood.
Find out more about us.


Reports variables, methods, or classes named
assert
. Such names are legal under Java 1.3 or earlier JVMs, but will cause problems under Java 1.4 or later.
Powered by InspectionGadgets


Inductive types
Inductive and higher inductive types are represented by data definitions. The basic syntax of a data definition looks like this:
\data D p_1 ... p_n
| con_1 p^1_1 ... p^1_{k_1}
...
| con_m p^m_1 ... p^m_{k_m}
where p_1, … p_n and p^11, … p^m{k_m} are either named or unnamed parameters. There are several extensions of this syntax which are discussed further in this module and in the module on HITs. Each row con_i p^i_1 … p^i_{k_i} defines a constructor con_i with the specified parameters. Parameters p_1, … p_n are parameters of the data type D, but they also become implicit parameters of the constructors.
Let A, … F be some types and let a, … f be terms of the corresponding types. Consider the following example:
\data Data A B
| cons {C} D E
| cons'
\func s1 => Data a b
\func s2 => cons d e
\func s2' => cons {a} d e
\func s2'' => cons {a} {b} {c} d e
\func s3 => cons'
\func s3' => cons' {a}
\func s3'' => cons' {a} {b}
Constructor cons has three implicit parameters of types A, B, and C and two explicit parameters of types D and E. Constructor cons’ has only two implicit parameters of types A and B.
The type of a defcall con_i {a_1} … {a_n} b_1 … b_{k_i} is D a_1 … a_n. The type of a defcall D a_1 … a_n is of the form \h-Type p. Levels h and p are inferred automatically and may depend on levels of a_1, …, a_n. Alternatively, these levels can be fixed and specified explicitly in the definition of a data type:
\data D p_1 ... p_n : \h-Type p
| con_1 p^1_1 ... p^1_{k_1}
...
| con_m p^m_1 ... p^m_{k_m}
If the actual type of D does not always fit into the specified levels, the typechecker will generate an error message.
Constructors belong to the module associated to the data definition, but they are also visible in the module in which the data type is defined:
\data D | con1 | con2
\func f => con1
\func g => con2
\func f' => D.con1
\func g' => D.con2
In the example above, we defined a data type D with two constructors con1 and con2. Functions f and f’ (as well as g and g’) are equivalent.
Inductive definitions
A data definition can be recursive, that is D may appear in parameters p^1_1, … p^m_{k_m} (but not in p_1, … p_n). Such recursive definitions are called inductive data types. There is one restriction for such definitions: recursive calls to D may occur only in strictly positive positions. The set of strictly positive positions is defined inductively:
- D occurs only in strictly positive positions in D a_1 … a_n if it does not occur in a_1, … a_n.
- D occurs only in strictly positive positions in \Pi (x : A) -> B if it occurs only in strictly positive positions in B and does not occur in A.
- D occurs only in strictly positive positions in Path (\lam i => B) b b’ if it occurs only in strictly positive positions in B and does not occur in b and b’.
- D occurs only in strictly positive positions in any other expression if it does not occur in it.
Truncation
Data types can be truncated to a specified homotopy level, which is less than its actual level. This is done by specifying explicitly the type of a data definition and writing the keyword \truncated before the definition:
\truncated \data D p_1 ... p_n : \h-Type p
| con_1 p^1_1 ... p^1_{k_1}
...
| con_m p^m_1 ... p^m_{k_m}
If the actual predicative level of D is greater than p, the typechecker will generate an error message, whereas h can be any number. Such a data type can be eliminated only into types of the same homotopy level. Consider the following example:
\truncated \data Exists (A : \Type) (B : A -> \Type) : \Prop
| witness (a : A) (B a)
{-
-- This function will not typecheck.
\func extract (p : Exists Nat (\lam n => n = 3)) : Nat
| witness a b => a
-}
\func existsSuc (p : Exists Nat (\lam n => n = 3)) : Exists Nat (\lam n => suc n = 4)
| witness n p => witness (suc n) (path (\lam i => suc (p @ i)))
\func existsEq (p : Exists Nat (\lam n => n = 3)) : 0 = 0
| witness n p => path (\lam _ => 0)
The data type Exists defines a proposition of the form ‘There is an a : A such that B a’. Note that a function like extract, which extracts n : Nat out of a proof of Exists Nat (\lam n => n = 3), is not valid as its result type Nat is of homotopy level of a set (h = 0), which is greater than the homotopy level of a proposition (h = -1). Two other functions existsSuc and existsEq in the example above are correct as their result types, Exists Nat (\lam n => suc n = 4) and 0 = 0 respectively, are propositions.
If the universe of the resulting type is greater than the universe of the data type, it is still possible to define a function by pattern matching on it if the resulting type is provably belongs to the universe of the data type. This can be done with keyword \level. In this case, the function should be declared as \sfunc since truncated data types are squashed.
A truncated data type is (provably) equivalent to the truncation of the untruncated version of this data type. Thus, this is simply a syntactic sugar that allows to define functions over a truncated data type more easily.
Induction-induction and induction-recursion
Two or more data types can be mutually recursive. This is called induction-induction. Just as simply inductive definitions, inductive-inductive definitions also must satisfy a strict positivity condition. Namely, recursive calls to the definition itself and to other recursive definitions may occur only in strictly positive positions.
Data types may also be mutually recursive with functions. This is called induction-recursion. Strict positivity and termination checkers work as usual for such definitions.
Varying number of constructors
Sometimes there might be a need to define a data type, which has different constructors depending on its parameters. The classical example is the data type of lists of fixed length. The data type Vec A 0 has only one constructor nil, the empty list. The data type Vec A (suc n) also has one constructor cons, a non-empty list. Such a data type can be defined by ‘pattern matching’:
\data Vec (A : \Type) (n : Nat) \elim n
| 0 => nil
| suc n => cons A (Vec A n)
The general syntax is similar to the syntax of functions defined by pattern matching. Either \elim vars or \with constructs can be used with the only difference that \elim vars allows to match on a proper subset of parameters of data type.
\data D p_1 ... p_n \with
| t^1_1, ... t^1_n => con_1 p^1_1 ... p^1_{k_1}
...
| t^m_1, ... t^m_n => con_m p^m_1 ... p^m_{k_m}
Each clause starts a list of patterns, followed by =>, followed by a constructor definition. The order of clauses does not matter. If a clause matches the arguments of a defcall D a_1 … a_n, then the corresponding constructor is added to this data type. For example, one can define the following data type:
\data Bool | true | false
\data T (b : Bool) \with
| true => con1
| true => con2
Data type T true has two constructors: con1 and con2. Data type T false is empty. It is also possible to define several constructors in a single clause as follows:
\data T (b : Bool) \with
| true => {
| con1
| con2
}
This definition is equivalent to the previous one.
Constructor synonyms
A constructor synonym is a function defined with keyword \cons. Such a function cannot be defined by pattern matching and it must consists only of constructors of data types. It can be used in patterns as a synonym for its right hand side.


The Web Is...
The Web Is... is a unique web conference taking place in Cardiff, Wales and timed to celebrate the 25th anniversary of the web. I was solely responsible for the visual design, including logo and branding, as well as building and deploying both the teaser website and the full conference site.
Teaser website
Using modern CSS, and little JavaScript, The Web Is... teaser site was designed to be as small as possible while still being graphically impressive. With 3D CSS animations, inline fonts and even a full Mac Plus emulator, the site is quite unique.
Full conference website
Central to this responsive site was a long main page, giving information on each aspect of the conference. It builds on the visual themes of the teaser site, introducing a strong colour pallette and subtle animations. The aim was to create an air of quality, while allowing a bit of character and fun in.
Craig Lockwood, founder and organiser, also runs Cardiff's Founders Hub, Besquare.me and other great resources. He has been a terrific client to work with.


| Resource ID | Resource Type |
|---|---|
| unmanaged-id-1 | aws_unmanaged_resource |
| unmanaged-id-2 | aws_unmanaged_resource |
| unmanaged-id-3 | aws_unmanaged_resource |
| unmanaged-id-4 | aws_unmanaged_resource |
| unmanaged-id-5 | aws_unmanaged_resource |
No results matched your filters
Resource ID
Resource Type
diff-id-1
aws_diff_resource
~ updated.field: "foobar" => "barfoo"
+ new.field: "newValue"
- a: "oldValue"
diff-id-2
aws_diff_resource
- path.to.fields.[0]: "value"
~ path.to.fields.[1]: 12 => "12"
- group_ids: ["a071314398026"]
~ Policies.[0]: {
Id: "",
Type: "",
Source:
} => {
Id: "093cd6ba-cf6d-4800-b252-6a50ca8903cd",
Type: "aws_iam_policy",
Source:
}
+ Tags.[0].Name: "test"
~ InstanceInitiatedShutdownBehavior: "" => null
No results matched your filters
| Resource ID | Resource Type |
|---|---|
| deleted-id-1 | aws_deleted_resource |
| deleted-id-2 | aws_deleted_resource |
| deleted-id-3 | aws_deleted_resource |
| deleted-id-4 | aws_deleted_resource |
| deleted-id-5 | aws_deleted_resource |
| deleted-id-6 | aws_deleted_resource |
No results matched your filters
- Ignoring aws_vpc from drift calculation: Listing aws_vpc is forbidden.
- Ignoring aws_sqs from drift calculation: Listing aws_sqs is forbidden.
- Ignoring aws_sns from drift calculation: Listing aws_sns is forbidden.
No results matched your filters


Warren Leads But Buttigieg Surging With Iowa Democrats
by JON PARTONDemocratic presidential candidate Sen. Elizabeth Warren, D-Mass., speaks at a campaign event Friday, Sept. 27, 2019 in Hollis, N.H. (AP Photo/ Cheryl Senter)
Pete Buttigieg talks with visitors to the Hawkeye Area Labor Council Labor Day Picnic in Cedar Rapids, Iowa. (AP photo/Charlie Neibergall)
(CN) – While Elizabeth Warren continues to hold a slight lead among Democratic candidates in Iowa, support for Pete Buttigieg has surged in the Hawkeye State in a tightening race, according to a poll released Friday.
A New York Times/Sienna College poll finds Massachusetts Sen. Warren at the top at 22%, followed closely by Vermont Sen. Bernie Sanders with 19% and South Bend, Indiana, Mayor Buttigieg at 18%. National front-runner Joe Biden came in fourth place at 17%, still within striking distance of the top three candidates.
The new poll slightly echoes a Civiqs poll taken last month that also showed increased support for Buttigieg, who has set himself up as an alternative moderate Democrat to the former vice president.
While Biden continues to lead in national polling, his support in Iowa has fallen since he entered the race in April. The majority of his support comes from older voters, particularly those aged 65 or older. Among younger voters however, he only records 2% support from the 18-29 age group and 3% among voters aged 30-44.
Biden’s failure to appeal to younger voters has opened a slight pathway for centrist Buttigieg to pick up their support, though the group tends to be more liberal and support Warren’s and Sanders’ “Medicare for all” and free college tuition pledges.
Warren continues to enjoy the majority of support from 18-29 voters at 38%, while Sanders retained 29% support. Buttigieg has 12% support from the same age group, putting him below the more liberal candidates but above Biden.
Despite concerns over his health following a heart attack last month, polling for Sanders has remained consistent in Iowa. The Vermont senator took some time off the campaign trail after undergoing surgery, a move that has done little to affect his support in the Hawkeye State.
The numbers reveal a tightening race among the four top candidates, while the other Democrats have failed to make significant movement. The fifth most popular presidential hopeful, Minnesota Sen. Amy Klobuchar, only registered 4% support among Iowa Democrats. Taken with other state and national polls, a clearer image is forming of who will remain competitive in the race by the end of the year.
While Warren tops the list of candidates, she also tops the list of Democrats’ second choice, a relevant number as Iowa caucuses differ from most primary elections. Iowa Democrats engage in a multiround vote where they select their first choice. If that candidate fails to receive less than 15% of the votes, their supporters can choose another candidate to vote for. Warren was named as the second choice of two-thirds of Sanders supporters.
The Iowa caucuses are still three months out however, and support could still shift among the candidates. Two-thirds of likely voters said they still haven’t made up their mind about their candidate and could change their vote between now and Feb. 3.
The poll surveyed 439 Iowa Democrats from Oct. 25-30 and has a margin of error of plus or minus 4.7 percentage points.
Copyright © 2019 courthousenews.com


×
Enter your name:
Just My Type
< Click Start to Play >
-- word --
Seconds Left :
--
Current Score :
0
Level:
Easy
Medium
START
Total Score :
0
High Score :
0
HALL OF FAME
#
Player
Easy High Score
1
2
3
#
Player
Med High Score
1
2
3


MDP's with continuous state space (scratch)
Posted: 2016-10-14 , Modified: 2016-10-25
Tags: none
Posted: 2016-10-14 , Modified: 2016-10-25
Tags: none
Come up with a class of MDPs on exponentially large/continuous space that is interesting and tractable. Think of generalizing from contextual bandits * Basically we want a reasonable model of a MDP with a very large (exponential or continuous) state space and be able to do something with it. Wanted to include some dynamics like in Kalman filters but we weren’t sure whether Kalman filters are tractable * Todo: learn about Kalman filters
This setting looks like reinforcement learning + control theory. Prior work? How is RL used in continuous systems right now? Basic control theory background?
Need the model to be a generalization of regular MDP.
(*) may be interesting from control theory perspective, but doesn’t generalize discrete MDP. (Seems like best to learn the dynamics, and then do optimal thing from there…)
Captures deterministic MDP, but not probabilistic, by letting \(A=\{e_i\}\).
Do as well as best Bayes net? Actions in some class. Finite set of actions, vs. exponential/continuous set of actions. In latter case, will depend on optimizability of that set…
Ex. class is a SVM.
“Do as well as best estimator of \(q\) function in a certain class (assume convexity or something?)” (cf. contextual bandits first)


Bankruptcy code set to face huge test in DHFL case
by ReutersThe non-bank financing giant Dewan Housing Finance Corp Ltd (DHFL) will go into insolvency proceedings, the central bank said on Wednesday, making it the first financial institution to test the new laws
India's bankruptcy-resolution process has just begun to find its feet with recent precedent-setting court rulings, but bankers, lawyers and insolvency experts say the system is about to face a huge test.
The non-bank financing giant Dewan Housing Finance Corp Ltd (DHFL) will go into insolvency proceedings, the central bank said on Wednesday, making it the first financial institution to test the new laws.
So-called shadow banks such as DHFL have been key drivers of lending growth in India, with their consolidated balance sheet worth a whopping 28.8 trillion rupees ($400 billion) in 2018-19, based on central bank data.
"No one knows how it will work out," said Manish Lalwani, an independent insolvency professional. "It is not clear if the existing law is equipped to deal with such cases."
With nearly 1 trillion rupees ($14 billion) owed to its staggering 85,000-plus list of financial creditors, DHFL's insolvency will be by far the largest process handled by tribunals in the three years since the bankruptcy code was enacted.
Its financial creditors range from banks to mutual funds and pension funds to deposit holders, which bankers and lawyers say could lead to conflicts over how any recoveries from the process are apportioned. That leaves little hope for vendors or other operational creditors who may also be owed money.
"In the case of Essar Steel we saw there was a precedent set when Standard Chartered Bank was not treated at par with other lenders because of the type of collateral security held. We may see that happening in DHFL's case too," said independent consultant Ashvin Parekh, referring to a recent court ruling that paved the way for ArcelorMittal to buy Essar Steel.
The government just days ago tweaked its insolvency regulations to allow for financial firms including non-banking finance companies to be forced into insolvency.
The new rules allow administrators to split the entity into good and bad assets and to divide up its retail and non-retail lending books.
But the range of stakeholders has many lawyers doubting whether the DHFL case can be resolved within the 330-day time limit for the process now set down in law.
"With the timeline and with all the investors...I think it's going to be a circus," said Vivek Daswaney, founding partner of V Law Partners.
Also Read: Essel Group promoters' new stake dilution in Zee could restart discussions about strategic partner
Also Read: Customer outreach: PSBs disburse Rs 2.53 lakh crore loans in October
Also Read: Indian Railways' freight business grows 7 times in nearly 50 years


LONGJMP
Section: Linux Programmer's Manual (3)
Updated: 2009-01-13
Index
Return to Main Contents
NAME
longjmp, siglongjmp - nonlocal jump to a saved stack context
SYNOPSIS
#include <setjmp.h>
void longjmp(jmp_buf env, int val);
void siglongjmp(sigjmp_buf env, int val);
Feature Test Macro Requirements for glibc (see
feature_test_macros(7)):
siglongjmp():
_POSIX_C_SOURCE >= 1 || _XOPEN_SOURCE || _POSIX_C_SOURCE
DESCRIPTION
longjmp()
and
setjmp(3)
are useful for dealing with errors
and interrupts encountered in a low-level subroutine of a program.
longjmp()
restores the environment saved by the last call of
setjmp(3)
with the corresponding
env
argument.
After
longjmp()
is completed, program execution continues as if the
corresponding call of
setjmp(3)
had just returned the value
val.
longjmp()
cannot cause 0 to be returned.
If
longjmp()
is invoked with a second argument of 0, 1 will be returned instead.
siglongjmp()
is similar to
longjmp()
except for the type of
its
env
argument.
If, and only if, the
sigsetjmp(3)
call that set this
env
used a nonzero
savesigs
flag,
siglongjmp()
also restores the signal mask that was saved by
sigsetjmp(3).
RETURN VALUE
These functions never return.
CONFORMING TO
C89, C99, and POSIX.1-2001 specify
longjmp().
POSIX.1-2001 specifies
siglongjmp().
NOTES
POSIX does not specify whether
longjmp()
will restore the signal context (see
setjmp(3)
for some more details).
If you want to portably save and restore signal masks, use
sigsetjmp(3)
and
siglongjmp().
The values of automatic variables are unspecified after a call to
longjmp()
if they meet all the following criteria:
- •
-
they are local to the function that made the corresponding
setjmp(3)
call;
- •
-
their values are changed between the calls to
setjmp(3)
and
longjmp();
and
- •
-
they are not declared as
volatile.
Analogous remarks apply for
siglongjmp().
longjmp()
and
siglongjmp()
make programs hard to
understand and maintain.
If possible, an alternative should be used.
SEE ALSO
setjmp(3),
sigsetjmp(3)
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- RETURN VALUE
-
- CONFORMING TO
-
- NOTES
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:55:07 GMT, September 18, 2014


Alien brick things are hovering in the night sky!
Fear grips the people of Earth. Are they friendly or hostile?
We can't afford to wait and see.
You have been sent to blow their brick behinds from the sky!
Do you have what it takes to save all of humanity?
Use the Finger Swipe Area to move your ship.


Before Change
// were words. Add None in place of any ignored <unk>"s.
if self._ignore_unk:
seq_word_ids = word_ids[:, seq_index]
logprob_iter = iter(seq_logprobs)
seq_logprobs = [None if word_id == self._unk_id
else next(logprob_iter)
for word_id in seq_word_ids[1:]]
result.append(seq_logprobs)
After Change
seq_logprobs = logprobs[seq_mask == 1, seq_index]
// The new mask also masks excluded tokens, replace those with None.
seq_mask = new_mask[seq_mask == 1, seq_index]
seq_logprobs = [lp if m == 1 else None
for lp, m in zip(seq_logprobs, seq_mask)]
result.append(seq_logprobs)
return result


Close window
Filters
Listed in the last
Radius
Set your price range
Everything
New in your area
Fashion and Accessories
Home and Garden
Electronics
Baby and Child
Sport, Leisure and Games
Movies, Books and Music
Cars and Motors
Property
Services
Other
Show results only from your country?
Sort By:
Apply


Butterflies can be sensitive indicators of the health of our environment. Join the butterfly surveying project and record your sighting of butterflies!
@ Geolytix, Bootstrap, Butterfly Conservation.


Interactive Mouse Effects with Three.js
Cultural diversion
We have to create culture, don't watch TV, don't read magazines, don't even listen to NPR. Create your own roadshow. The nexus of space and time where you are now is the most immediate sector of your universe, and if you're worrying about Michael Jackson or Bill Clinton or somebody else, then you are disempowered, you're giving it all away to icons, icons which are maintained by an electronic media so that you want to dress like X or have lips like Y.
Shamanic dance
This is shit-brained, this kind of thinking.  And we are told 'no', we're unimportant, we're peripheral.


The Truly-UI Icons unites the main packages of icons available on the web: DXIcons, Font-Awesome, Ionicons.
DXIcons
filter-operation-starts-with
comment
airplane
Font Awesome
address-book
address-book
address-card
address-card
Ionicons
alarm
alarm
basket
basket
Size
home
home
home
Color
home
home
home
Animations
wrench
bell
envelope
thumbs-up
exclamation-triangle
thumbs-up
spinner
plane
heart
envelope
trophy
space-shuttle
space-shuttle
circle
star


New York native and former archaeology student who has uncovered a vast amount of artifacts from the 19th century.
Trying to find my niche in society post graduation from SUNY Albany,
and utilize the creativity that I thought I had lost, I was led to coding which has become my newfound passion.
A leader and a team player who yearns for adventure and new challenges; I am always trying to better myself and expand my knowledge.
Feel free to check out my portfolio using the navbar above! If you have any questions, please contact me below.
Enjoy!


Resume
About me
As a professional, I believe that building strong relationships with my team is the key to achieving success. I am dedicated to continuously improving my skills and abilities, while also striving to be a better person. My ultimate goal is to grow both personally and professionally. I thrive in fast-paced environments and I am passionate about technology, always seeking to learn and implement solutions to drive positive impact for the team and the organization.
Buzzwords I worked with
Go, .NET, DDD, TDD, SOLID, CQRS, Clean Architecture, Event Sourcing, Microservices, Testing, Scrum, Kanban, Docker, Kubernetes, CI/CD, RabbitMQ, SQL, Terraform, GCP.
Recent work experience
Tech Lead 💻 Lunar 🇸🇪
From 09.2022 - Present
As a tech lead, I am responsible for leading the development efforts across three key areas - product, technology, and people. This includes collaborating with business experts to define requirements, leading the engineering team in the design and implementation of solutions, and coaching and mentoring individual team members to ensure success from the tech perspective.
Software Engineer 💻 Lunar 🇸🇪
From 04.2022 - 09.2022
As a member of a lending related squad, I had the opportunity to work on the integration of various domains such as credit application, decisioning in an effort to bring in-house credit products to all Lunar markets. This was executed via domain-driven microservices in Go. I was also able to facilitate and engage in cross-squad collaboration to ensure interoperability between the different domains.
Backend Developer @ Platform Team 💻 Lendo 🇸🇪
From 04.2021 - 04.2022
As a member of the Platform team, I was tasked with accelerating the expansion of our company into new markets while reducing technical debt and repetition. To accomplish this, I developed upstream services that would be utilized across all markets, both mature and new, serving also as a foundation for other teams. Additionally, I played a key role in establishing engineering practices and a way of working to increase velocity throughout different teams.
Backend Developer @ Market Team 💻 Lendo 🇸🇪
From 05.2019 - 04.2021
As a backend developer, I had the opportunity to dive into the world of Go for the first time while developing fin-tech related microservices. Additionally, I worked on the migration from a private cloud to GCP, utilizing Terraform as an Infrastructure as Code tool. This allowed us to have our deployed infrastructure reflected in a git repository, making it easy to track and manage changes.
Backend Developer 💻 Record Union 🇸🇪
From 06.2018 - 04.2019
As a backend developer, I had the opportunity to work on a distributed application that leveraged the power of actors, CQRS, and Event Sourcing. Using .NET Core 2 and Akka.NET as my primary stack, I was able to contribute to a highly performant application that was hosted on GCP and managed using Kubernetes. Additionally, I collaborated in the configuration and optimization of the CI/CD pipeline.
Software Engineer 💻 Fravega 🇦🇷
From 01.2018 to 05.2018
As a software engineer, I have played a key role in designing and implementing microservices for billing processes, utilizing the latest technologies such as .NET Core, Redis, Mongo, Postgres and RabbitMQ to optimize performance and scalability. I’ve collaborated as well on the design of the architecture and infrastructure (Docker and Kubernetes on AWS). One of the highlights has also been the integration of a physical payment gateway that seamlessly communicates with various PIN pads installed in branch offices.
.Ssr Developer (Tech Lead) 💻 Origin Software 🇦🇷
From 01.2017 to 01.2018
As a ssr developer, I coached and mentored team members to enhance their technical skills and drive their professional growth. Additionally, I was actively involved in delivering high-performing web applications using .NET Core and EF Core. I also had the chance to work on big data solutions utilizing technologies such as HDInsight, Azure Event Hubs and Stream Analytics to drive business insights.
.NET Developer 💻 Origin Software 🇦🇷
From 03.2015 to 01.2017
As a developer working for the client BestDay, I delivered high-quality Web API integrations and upheld best practices throughout the development process. I also ensured the maintainability of my work by documenting it through thorough testing.
Education
Degree in Information Technology
- From 02.2016 to 12.2017
- Universidad de Palermo 🇦🇷
Superior Technician on Computer Systems
- From 02.2013 to 12.2013
- Universidad Tecnológica Nacional 🇦🇷
Superior Technician on Programming
- From 02.2011 to 12.2012
- Universidad Tecnológica Nacional 🇦🇷
Languages
- Spanish: Native
- English: Advanced


Several types, such as
Signal
,
EventStream
, and
DomEventSource
, extend
Forwardable
. This gives you a convenient syntax to respond such objects' values
in several common ways.
eventStream ->> println("An event was fired")
eventStream =>> {v => println(v + " was fired") eventStream += {v => println(v + " was fired")
eventStream ?>> { case n if n % 2 == 1 => println("An odd event") }
Var
: eventStream >> myVar
EventSource
: eventStream >> eventSource
These operators return the original object, so you can chain them etc.
There is also the right-associative
<<:
operator, which lets you write forwarding expressions in the reverse
order. It returns the target object.
// Add a click handler to a button html element "button" #> (click ->> alert("Mouse was clicked!")) intEventStream =>> {i => println("Caught an event: "+i)} // Update aVar with events from myEventSource, // and propagate aVar's updates to anotherVar (aVar <<: myEventSource) >> anotherVar
Var
s
For convenience, you can synchronize the values of two
Var
s with the
<-->
operator. It returns the one on the left side.


JSME drag and drop
If drag and drop is supported by your browser, an icon will be displayed at the bottom right of the editor.
Testing the DnD capabilities of JSME:
- Draw a structure on the top editor
- Drag it out and drop it on the surface of the bottom editor
- Drag it out and drop it on your computer local file system to save it (does not work in Windows)
- Drag it out and drop it on the window of another program, e.g. text editor
- Drag a MOL or SDF file from your computer local file system and drop it on to the bottom or top editor
Does not work yet on iPad 4 and Android devices.


Name:
E-mail:
Message:
Send your message
Banana
Cherry
Lemon
Carrot
Eggplant
Potatoe
What's your favorite fruit?
Apple
Banana
Blackberry
Blueberry
Lemon
Lychee
Peach
Pear
This a
submit button
This a
reset button
This a
anonymous button
When are you available this summer?
75


| Name | Description | |
|---|---|---|
| Append | Appends the elements of two queues. | |
| Dequeue | Overloaded. Remove an item from the collection | |
| Enqueue | Enqueue a value and return a new queue. | |
| Equals | Overloaded. Tests structural equality of two queues. | |
| GetEnumerator | Returns an enumerator over the given list. | |
| GetHashCode | Returns the hash code for the current sequence. | |
| operator != | Test two sequences for inequality. | |
| operator == | Test two queues for equality. | |
| ToString | Converts a queue to a string. |


👋
Hey there, my name is Jake Bellacera. I am a Senior Frontend Engineer at
Split Software
.
You can find me over at
GitHub
,
Twitter
, or
LinkedIn
.


| Vendor Name | Promaxis Systems Inc. |
|---|---|
| Reference Number | |
| Contract Date | 9-9-2015 |
| Description of Work | Technical Engineering and Maintenance Services (TEMS) |
| Delivery Date | 30-9-2016 |
| Contract Value | $125,460.72 |
| Comments | The contract was competitively sourced. This contract is a call-up against a Public Works and Government Services procurement tool This contract is a call-up against a Public Works and Government Services procurement tool |
| Additional Comments | Task and Solutions Professional Services (TSPS), specifically two (2) Junior Technical Clerks (Level 1) to support the analysis and maintenance of North Atlantic Treaty Organization (NATO) Stock Numbers (NSNs) to facilitate the data integrity of the NATO |


At various times we have made statements such as ''heights follow normal distribution'', ''lifetimes of bulbs follow exponential distribution'' etc. Where do such claims come from? Over years of analysing data, of course. This leads to an interesting question. Can we test whether lifetimes of bulbs do follow exponential distribution?
We start with a simple example of testing whether a die is fair. The hypotheses are $H_{0}:$ the die is fair, versus $H_{1}:$ the die is unfair 1 You may feel that the null and alternative hypotheses are reversed. Is not independence a special property that should prove itself. Yes and no. Here we are imagining a situation where we have some reason to think that the die is fair. For example perhaps the die looks symmetric. .
 For $j\le 6$, let $O_{j}$ be the number of times we observe the face $j$ turn up. In symbols $O_{j}=\sum_{i=1}^{n}{\mathbf 1}_{X_{i}=j}$.  Common sense says that if $H_{0}$ is true then $O_{j}$ and $E_{j}$ must be rather close for each $j$. How to measure the closeness? Karl Pearson introduced the test statistic $$ T:=\sum_{j=1}^{6}\frac{(O_{j}-E_{j})^{2} }{E_{j} }. $$ If the desired level of significance is $\alpha$, then the Pearson $\chi^{2}$-test says ''Reject $H_{0}$ if $T\ge \chi^{2}_{5}(\alpha)$''. The number of degrees of freedom is $5$ here. In general, it is one less than the number of bins (i.e., how many terms you are summing to get $T$).
Some practical points : The $\chi^{2}$ test is really an asymptotic statement. For large $n$, the level of significance is approximately $1-\alpha$. There is no assurance for small $n$. Further, in performing the test, it is recommended that each bin must have at least $5$ observations (i.e., $O_{j}\ge 5$). Otherwise we club together bins with fewer entries. The number $5$ is a rule of thumb, the more the better.
Fitting the Poisson distribution : We consider the famous data collected by Rutherford, Chadwick and Ellis on the number of radioactive disintegrations. For details see the book of Feller's book (section VI.7) or \hrefhttp://galton.uchicago.edu/ lalley/Courses/312/PoissonProcesses.pdfthis website.
The data consists of $X_{1},\ldots ,X_{2608}$ (where $X_{k}$ is the number of particles detected by the counter in the $k^{\mbox{th} }$ time interval. The hypotheses are $$ H_{0}: F \mbox{ is a Poisson distribution}. \qquad H_{1}: F \mbox{ is not Poisson}. $$ The physical theories predict that the distribution ought to be Poisson and hence we have taken it as the null hypothesis 2 When a new theory is proposed, it should prove itself and is put in the alterntive hypotheis, but here we take it as null.
We define $O_{j}$ as the number of time intervals in which we see exactly $j$ particles. Thus $O_{j}=\sum_{i=1}^{2608}{\mathbf 1}_{X_{i}=j}$. How do we find the expected numbers? If the null hypothesis had said that $F$ has Poisson(1) distribution, we could use that to find the expected numbers. But $H_{0}$ only says Poisson($\lambda$) for an unspecified $\lambda$? This brings in a new feature.
First estimate $\lambda$, for example $\hat{\lambda}=\bar{X}_{n}$ is an MLE as well as method of moments estimate. Then we use this to calculate Poisson probabilities and the expected numbers. In other words, $E_{j}=e^{-\hat{\lambda} }\frac{\hat{\lambda}^{j} }{j!}$. For the given data we find that $\hat{\lambda}=3.87$. The table is as follows.
\[ \begin{array}{||r|c|c|c|c|c|c|c|c|c|c|c||} \hline j & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & \ge 10 \\ \hline O_{j} & 57 & 203 & 383 & 525 & 532 & 408 & 273 & 139 & 45 & 27 & 16 \\ \hline E_{j} & 54.4 & 210.5 & 407.4 & 525.4 & 508.4 & 393.5 & 253.8 & 140.3 & 67.9 & 29.2 & 17.1 \\ \hline \end{array} \]
Two remarks: The original data would have consisted of several more bins for $j=11,12\ldots$. These have been clubbed together to perform the $\chi^{2}$ test (instead of a minimum of $5$ per bin, they may have ensured that there are at least $10$ per bin). Also, the estimate $\hat{\lambda}=3.87$ was obtained before clubbing these bins. Indeed, if the data is merely presented as the above table, there will be some ambiguity in how to find $\hat{\lambda}$ as one of the bins says ''$\ge 10$''.
Then we compute $$ T=\sum_{j=0}^{10}\frac{(O_{j}-E_{j})^{2} }{E_{j} } = 14.7. $$ Where should we look up in the $\chi^{2}$ table? Earlier we said that the degrees of freedom is one less than the number of bins. Here we give the more general rule. $$ \mbox{Degrees of freedom of the }\chi^{2} = \mbox{ No. of bins }-1-\mbox{No. of parameters estimated from data}. $$ In our case we estimated one parameter, $\lambda$ hence the d.f. of the $\chi^{2}$ is $11-1-1=9$. Looking at $\chi_{9}^{2}$ table one can see that the $p$-value is $0.10$. This is the probability that a $\chi_{9}^{2}$ random variable is greater than $14.7$. (Caution: Elsewhere I see that the $p$-value for this experiment is reported as $0.17$, please check my calculations!). This means that at $5\%$ level, we would not reject the null hypothesis. If the $p$-value was $0.17$, we would not reject the null hypothesis even at $10\%$ level.
Fitting a continuous distribution : Chi-squared test can be used to test goodness of fit for continuous distributions too. We need some modifications. We must make bins of appropriate size, like $[a,a+h],[a+h,a+2h],\ldots ,[a+h(k-1),a+hk]$ for a suitable $h$ and $k$. Then we find the expected numbers in each bin using the null hypothesis (first estimating some parameters if necessary) and then proceed to compute $T$ in the same way as before. Then check against the $\chi^{2}$ table with the appropriate degrees of freedom. We omit details.
The probability theorem behind the $\chi^{2}$-test for goodness of fit : Let $(W_{1},\ldots ,W_{k})$ have multinomial distribution with parameters $n,m,(p_{1},\ldots ,p_{k})$.  The following proposition is the mathematics behind Pearson's test.
Proposition [Pearson] : Fix $k,p_{1},\ldots,p_{k}$. Let $T_{n}=\sum_{i=1}^{k}\frac{(W_{i}-np_{i})^{2} }{np_{i} }$. Then $T_{n}$ converges to a $\chi_{k-1}^{2}$ distribution in the sense that $\mathbf{P}\{T_{n}\le x\}\rightarrow \int_{0}^{x}f_{k-1}(u)du$ where $f_{k-1}$ is the density of $\chi_{k-1}^{2}$ distribution.
How does this help? Suppose $X_{1},\ldots ,X_{n}$ are i.i.d. random variables taking $k$ values (does not matter what the values are, say $t_{1},t_{2},\ldots ,t_{k}$) with probabilities $p_{1},\ldots ,p_{k}$. Then, let $W_{i}$ be the number of $X_{i}$s whose value is $t_{i}$. Clearly, $(W_{1},\ldots ,W_{k})$ has a multinomial distribution. Therefore, for large $n$, the random variable $T_{n}$ defined above (which is in fact the $\chi^{2}$-statistic of Pearson) has approximately $\chi_{k-1}^{2}$ distribution. This explains the test.
Sketch of proof of the proposition : Start with the case $k=2$. Then, $W_{1}\sim \mbox{Bin}(n,p_{1})$ and $W_{2}=r-W_{1}$. Thus, $T_{n}=\frac{(W_{1}-np_{1})^{2} }{np_{1}p_{2} }$ (recall that $p_{1}+p_{2}=1$ and check this!). We know that $(W_{1}-np_{1})/\sqrt{np_{1}q_{1} }$ is approximately a $N(0,1)$ random variable, where $q_{i}=1-p_{i}$). Its square has (approximately$\chi_{1}^{2}$ distribution. Thus the proposition is proved for $k=2$.
When $k > 2$, what happens is that the random variables $\xi_{i}:=(W_{i}-np_{i})/\sqrt{np_{i}q_{i} }$ are approximately $N(0,1)$, but not independent. In fact the correlation between $\xi_{i}$ and $\xi_{j}$ is close to $-\sqrt{p_{i}p_{j}/q_{i}q_{j} }$. The sum of squares of $\xi_{i}$s gives the $\chi^{2}$ statistic. On the other hand, one can (with some clever linear algebra/matrix manipulation) write $\sum_{i=1}^{k}\xi_{i}^{2}$ as $\sum_{i=1}^{k-1}\eta_{i}^{2}$ where $\eta_{i}$ are independent $N(0,1)$ random variables. Thus we get $\chi_{k-1}^{2}$ distribution.


--- layout: post title: Vocabularies date: 2011-02-21 17:40:31.000000000 +08:00 categories: - OData vocabularies tags: [] status: publish type: post published: true author: OData.org Archive ---
Vocabularies are made up of a set of related 'terms' which when used can express some idea or concept. They allow producers to teach consumers richer ways to interpret and handle data.
Vocabularies can range in complexity from simple to complex. A simple vocabulary might tell a consumer which property to use as an entity's title when displaying it in a form, whereas a more complex vocabulary might tell someone how to convert an OData person entity into a vCard entry.
Here are some simple examples:
Vocabularies are not a new concept unique to OData, vocabularies are used extensively in the linked data and RDF worlds to great effect, in fact we should be able to re-use many of these existing vocabularies in OData.
OData is being used in many different verticals now. Each vertical brings its own specific set of requirements and challenges. While some problems are general enough that solving them inside OData adds value to the OData eco-system as a whole, most don't meet that bar.
It seems clear then that we need a mechanism that allows Producers to share more information that 'smarter' Consumers MAY understand enough to enable a higher fidelity experience.
In fact some consumers are already trying to provide a higher fidelity experience, for example Sesame can render the results of OData queries on a map. Sesame does this by looking for specifically named properties, which it 'guesses' represent the entity's location. While this is powerful, it would be much better if it wasn't a 'guess', if the Producer used a well-known vocabulary to tell Consumers which property is the entity's location.
As with any new feature, we need to agree on a set of goals before we can come up with the right design. To get us started I propose this set of goals:
It is important to note that our goal stops short of specifying how to define the vocabulary itself, or how to capture the semantics of the vocabulary, or how to enforce the vocabulary. Those concerns lay solely with vocabulary writers, and the producers and consumers that profess to understand the vocabulary. By staying out of this business it allows OData to reference many existing vocabularies and micro-formats, without being unnecessarily restrictive on how those vocabularies are defined or the types of semantics they might imply.
Today if you ask for an OData services metadata (~/service/$metadata) you get back an EDMX document that contains a CSDL schema. Here is an example.
CSDL already supports annotations, which we could use to refer to a vocabulary and its terms. For example this EntityType definition includes both a structural annotation (validation:Constraint) and a simple attribute annotation (display:Title):
<EntityType Name="Person" display:Title="Firstname Lastname">
<Key>
<PropertyRef Name="ID" />
</Key>
<Property Name="ID" Type="Edm.Int32" Nullable="false" />
<Property Name="Firstname" Type="Edm.String" Nullable="true" />
<Property Name="Lastname" Type="Edm.String" Nullable="true" />
<Property Name="Email" Type="Edm.String" Nullable="true">
<validation:Constraint>
<validation:Regex>^[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,6}$.</validation:Regex>
<validation:ErrorMessage>Please enter a valid EmailAddress</validation:ErrorMessage>
</validation:Constraint>
</Property>
<Property Name="Age" Type="Edm.Int32" />
</EntityType>
For this to be valid XML the display and validation namespaces would have to be introduced somewhere something like this:
<Schema
xmlns:display="http://odata.org/vocabularies/display"
xmlns:validation="http://odata.org/vocabularies/validation">
Here the URL of the xsd reference identifies the vocabulary globally.
While this allows for completely arbitrary annotations and is extremely expressive, it has a number of down-sides:
If we address these issues in turn, one concern for (1) is to restrict the XML available when using a vocabulary to the XML we already know how to convert from XML into JSON, i.e. OData values. For example we take something like this:
<Property Name="Email" Type="Edm.String" Nullable="true">
<validation:Constraint>
<validation:Regex>^[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,6}$.</validation:Regex>
<validation:ErrorMessage>Please enter a valid EmailAddress</validation:ErrorMessage>
</validation:Constraint>
</Property>
The annotation is pretty simple, and could be modeled as a ComplexType pretty easily:
<ComplexType Name="Constraint">
<Property Name="Regex" Type="Edm.String" Nullable="false" />
<Property Name="ErrorMessage" Type="Edm.String" Nullable="true" />
</ComplexType>
In fact if you execute an OData request that just retrieves an instance of this complex type the response would look like this:
<Constraint
p1:type="Namespace.Constraint"
xmlns:p1="http://schemas.microsoft.com/ado/2007/08/dataservices/metadata"
xmlns="http://schemas.microsoft.com/ado/2007/08/dataservices" >
<Regex>^[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,6}$.</Regex>
<ErrorMessage>Please enter a valid EmailAddress</ErrorMessage>
</Constraint>
And this is almost identical to our original annotation, the only differences being around the xml namespaces.
Which means it is not too much of a stretch to say if your annotation can be modeled as a ComplexType which - of course allow nested complex types properties and multi-value properties too - then the Annotation is simply an OData value.
This is very nice because it means when we do addressable metadata you can in theory write a query like this to retrieve the annotations for a specific property:
~/$metadata.svc/Properties('Namespace.Type.PropertyName')/Annotations
ISSUE: Actually this introduces a problem, since each annotation instance would have a different 'type' we would need to support either ComplexType inheritance (so we can define the annotation as an EntityType with a Value property of type AnnotationValue, but instances of Annotations would invariably have Values derived from the base AnnotationValue type) or mark Annotation as a OpenType or provide a way to specify a property without specifying the type.
Of course today annotations are allowed that can't be modeled as ComplexTypes, so we would need to be able to distinguish those. Perhaps the easiest way is like this:
<Property Name="Email" Type="Edm.String" Nullable="true">
<validation:Constraint m:Type="validation:Constraint" >
<validation:Regex>^[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,6}$.</validation:Regex>
<validation:ErrorMessage>Please enter a valid EmailAddress</validation:ErrorMessage>
</validation:Constraint>
</Property>
Here the m:Type attribute indicates that the annotation is an OData value. This tells servers and clients that they can if needed convert between CSDL, ATOM and JSON formats using the above rules.
By adopting the OData atom format for annotations we can use a few more OData-ism to get clearer about the structure of the Annotation:
This looks good. It supports both constrained (OData values) and unconstrained annotations, and is consistent with the existing annotation support in OData.
Now if we turn our attention back to concern (2), this example implicitly refers to its parent; however we need to allow vocabularies to refer to something explicitly. For metadata the most obvious solution is to leverage addressable metadata, which allows you to refer to individual pieces of the metadata.
For example if this URL is the address of the metadata for the Email property: http://server/service/$metadata/Properties('Namespace.Person.Email')
Then this 'free floating' element is 'annotating' the Email property using the 'http://odata.org/vocabularies/constraints' vocabulary:
<Annotation AppliesTo="http://server/service/$metadata/Properties('Namespace.Person.Email')"
xmlns:validation="http://odata.org/vocabularies/constraints">
<validation:Constraint m:Type="validation:Constraint" >
<validation:Regex>^[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,6}$.</validation:Regex>
<validation:ErrorMessage>Please enter a valid EmailAddress</validation:ErrorMessage>
</validation:Constraint>
</Annotation>
Annotation by reference also neatly sidesteps issue (3), i.e. the object annotated is left structurally unchanged, which means we could use a similar approach to annotate data without breaking code (like a javascript path) that relies on a particular structure.
Another nice side-effect of this design is that you can use it 'inside' the CSDL too, simply by removing the address of the metadata service from the AppliesTo url - since we are in the CSDL we can us 'relative addressing':
<Annotation AppliesTo="Properties('Namespace.Person.Email')"
xmlns:validation="http://odata.org/vocabularies/constraints">
<validation:Constraint m:Type="validation:Constraint" >
<validation:Regex>^[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,6}$.</validation:Regex>
<validation:ErrorMessage>Please enter a valid EmailAddress</validation:ErrorMessage>
</validation:Constraint>
</Annotation>
Indeed if you have a separate file with many annotations for a particular model, you could group a series of annotations together like this:
<Annotations AppliesTo="http://server/service/$metadata/">
<Annotation AppliesTo="Properties('Namespace.Person.Email')"
xmlns:validation="http://odata.org/vocabularies/constraints">
<validation:Constraint m:Type="validation:Constraint" >
<validation:Regex>^[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,6}$.</validation:Regex>
<validation:ErrorMessage>Please enter a valid EmailAddress</validation:ErrorMessage>
</validation:Constraint>
</Annotation>
<Annotation AppliesTo="Properties('Namespace.Customer.Email')"
xmlns:validation="http://odata.org/vocabularies/constraints">
<validation:Constraint m:Type="validation:Constraint" >
<validation:Regex>^[A-Z0-9._%+-]+@[A-Z0-9.-]+.[A-Z]{2,6}$.</validation:Regex>
<validation:ErrorMessage>Please enter a valid EmailAddress</validation:ErrorMessage>
</validation:Constraint>
</Annotation>
</Annotations>
Here the Annotations/@AppliesTo attribute indicates the shared root url for all the annotations, and could be any url that points to a model, be that http, file or whatever.
It is important to note, that while we are proposing how to 'bind' or 'apply' a vocabulary, we are *not* proposing how to:
Clearly however to interoperate two parties must agree on the vocabulary terms available and their meaning. We are however not dictating how that understanding develops. It could be done in many different ways - for example using a Hallway conversation, Word or PDF document, Diagram, or perhaps even an XSD or EDM model.
The short answer is 'anyone'.
The more nuanced answer is there are many candidate vocabularies - from georss to vCard to Display to Validations - overtime people and companies from the OData ecosystem will start promoting vocabularies they have an interest in, and as is always the case the most useful will flourish.
I think that this proposal is a good place to gather feedback and think about the scenarios it enables. Using this approach you can imagine a world where:
You can also imagine a world where consumers like Tableau, PowerPivot and Sesame allow users to build up their own annotation files in response to gestures*.
*Gestures - you can think of the various mouse clicks, drags, key presses performed by a user as gestures. So for example right clicking on a column and picking from a list of well-known vocabularies could be interpreted as binding the selected vocabulary to the corresponding property definition. These 'interpretations' could easily be group and stored in an external annotation file.
I hope that you, like me, can see the potential power and expressiveness that vocabularies can bring to OData. Vocabularies will allow the OData eco-system to connect more deeply with the web and allow for ever richer and more immersive data consumption scenarios.
I really want to hear your feedback on the approach proposed above. The proposal is more exploratory than anything. It's definitely not set in stone, so tell us what you think.
Some specific questions:
Thanks for reading!
- Alex


{% extends 'lib/base.html' %} {% block content%} {% for image in images_location %}
DESCRIPTION LOCATION TAKEN CATEGORY TIME-CREATED


Description
Dancing is an art; the floor is your canvas; and you, the brush.  Get ready to enchant the
audience with a stupendously magnificent performance of yours.
RULES:
1. You can steal the show alone.
2. This is Solo Classical Competition.
3. Time limit: Max 6 min. Min: 3 min (including the setup time)
4. Only classical and semi-classical forms of dance are allowed.
5. Time limit should not be exceeded.
6. Costume and accessories are to be arranged by participant at their cost.
NOTE:
1. Judges may ask question regarding the performance, genre specifications and
about element/theme you are depicting.
2. Tracks should be named as: MUD-your_name e.g., MUD-vartika_singh.


source
As the Ledger Nano S is currently not available for a reasonable price, I was searching for a good alternative wallet for storing my ERC20 token and ETH. After testing MEW and MetaMask, I finally found the Enjin wallet. After getting familiar with the wallet, I decided to send some ETH to it. It worked! As the Enjin wallet is not widely known, I decided to write a small review about it.
Security
- The Enjin wallet has an own keyboard which appears for entering the password. This prevents leaking through third-party keyboards. The own keyboard is also used for restoring.
- When creating a new wallet address, the 12-word seed is not copyable. This prevents leaking through the clipboard and the seed is not temporally stored in the RAM. It is also not possible to save the seed. It is only shown on the screen.
- The 12-word seed is encrypted by a password which the user sets. The password field is protected against copy and paste.
- The wallet blocks screenshots and video recording. I verified this by using Screenshot Pro. After taking a screenshot, the recorded image is just black.
- The wallet claims to have Ram encryption. This is an important feature, due to Meltdown and Spectre.
- The Ejin company has also its own ERC20 coin. This means that security of the Enjin wallet has their highest priority. In case of a bug which leads to money lost, their coin would crash.
- Save against fishing sites (a problem of MEW when not using an hardware wallet)
- The encrypted seed is not stored in a file and cannot be accidentially uploaded into the cloud.
What do I like
- Very good security features (the best security that I have seen on a mobile wallet)
- When losing my phone, restoring the wallet is easily possible. At the same time, the wallet on the phone is protected by my password until I removed all tokens.
- All ERC20 tokens are supported.
- Possible to add custom ERC20 with custom abbreviation when their contract adress is known.
- Advanced transaction mode, it is possible to set a Gas limit and the transaction cost (Gwei is selectable between 0.1 and 160).
- The value of all stored coins is shown in fiat.
- Free and without ads
What do I not like
- Closed source
- Audit-report is not finished yet
- No transaction time estimation
The Enjin wallet is only available for Android at the moment. It can be downloaded from the Play store or as APK from their website. A version for IOS is planned.
This page is synchronized from the post: ‘Review of the Enjin digital smart wallet’


Chapter 7. Replication
MySQL
use often grows organically. In the corporate world, a single
application developer may build the company's next
killer app on top of MySQL. This initial success with MySQL
development typically breeds more projects and more success. As the
amount of data you manage using MySQL grows, you'll
certainly appreciate its ability to handle large amounts of data
efficiently. You may even find that MySQL has become the de facto
standard backend storage for your applications.
At the same time, you may also begin to wish for an easy way to copy
all the data from one MySQL server to another. Maybe you need to
share data with a remote office in your organization, or you might
just like to have a "hot spare"
available in case your server dies. Fortunately, MySQL has a built-in
replication system.
You
can easily configure a second server as a
slave of your master,
ensuring that it has an exact copy of all your data.
In this chapter, we'll examine all aspects of MySQL
replication. We begin with an overview of how replication works, the
problems it solves, and the problems it doesn't
solve. We then move on to the ins and outs of configuring
replication. After that we'll consider the various
architectures you can construct using various numbers of masters and
slaves. We'll continue with a discussion of
administrative issues, including maintenance, security, useful tools,
and common problems. Finally, we'll look ahead to
some planned changes and improvements for MySQL's
replication.
|
MySQL Versions
3.23.xx and 4.0.x have slightly different replication
implementations. Much of the discussion in this chapter applies to
both versions. There are sections that apply to only one, however,
and they are explicitly noted.
|
|
|


--- layout: example.html title: Three.js base example shortdesc: Three.js base example. docs: > This page's try to Three.js base example. tags: "three.js, webgl" resources: - https://cdnjs.cloudflare.com/ajax/libs/three.js/108/three.min.js - https://cdn.rawgit.com/mrdoob/three.js/master/examples/js/controls/OrbitControls.js - resources/js/stats.js ---


 I'm sooo pissed I can't even describe it<EMAIL_ADDRESS>But boy, are
they gonna get an earful from me......


User Sentiment
This page displays visitor sentiment, feedback we've received from visitors over time (actually, I'm lying, the server generates a bunch of data when it launches for the first time. Before I'm done, I'll add a form here you can use to add your feelings to the graph.
| Rating | Value |
|---|---|
| Amazing | 0 |
| Awesome | 0 |
| Fantastic | 0 |
| Great | 0 |
| OK | 0 |
| Perfect | 0 |


class Artifactory::Cleaner::CLI
Command Line Interface class, powers the artifactory-cleaner terminal command
A single Artifactory::Cleaner::CLI instance is created by the bin/artifactory_cleaner command for parsing options and executing the command specified by the user. The Artifactory::Cleaner::CLI uses Thor to provide git command/subcommand style ARGV parsing
@see exe/artifactory-cleaner
Constants
- RepoTableCol
Public Class Methods
# File lib/artifactory/cleaner/cli.rb, line 48 def self.default_repo_table_cols [:key, :package_type, :rclass, :url, :description] end
Constructor for a new CLI interface
# File lib/artifactory/cleaner/cli.rb, line 54 def initialize(*args) super @config = {} begin load_conf_file options.conf_file if options.conf_file rescue => ex STDERR.puts "Unable to load config from #{options.conf_file}: #{ex}" exit Sysexits::EX_DATAERR end @artifactory_config = { endpoint: options[:endpoint] || @config['endpoint'], api_key: options[:api_key] || @config['api-key'], } @repo_table_cols = Artifactory::Cleaner::CLI.repo_table_cols #invoke :create_controller create_controller end
# File lib/artifactory/cleaner/cli.rb, line 26 def self.repo_table_cols [ RepoTableCol.new(:key, 'ID', nil), RepoTableCol.new(:package_type, 'Type', nil), RepoTableCol.new(:rclass, 'Class', :local), RepoTableCol.new(:url, 'URL', :remote), RepoTableCol.new(:description, 'Description', nil), RepoTableCol.new(:notes, 'Notes', nil), RepoTableCol.new(:blacked_out?, 'Blacked Out', nil), RepoTableCol.new(:yum_root_depth, 'YUM Root Depth', nil), RepoTableCol.new(:checksum_policy_type, 'Checksum Policy', nil), RepoTableCol.new(:includes_pattern, 'Includes Pattern', nil), RepoTableCol.new(:excludes_pattern, 'Excludes Pattern', nil), RepoTableCol.new(:handle_releases, 'Releases', nil), RepoTableCol.new(:handle_snapshots, 'Snapshots', nil), RepoTableCol.new(:property_sets, 'Property Sets', nil), RepoTableCol.new(:repo_layout_ref, 'Layout', nil), RepoTableCol.new(:repositories, 'Included Repos', nil), RepoTableCol.new(:inspect, 'Inspection'), ] end
Public Instance Methods
Download artifacts meeting specific criteria
*WARNING:* This method will cause the `last_downloaded` property of all the matching artifacts to be updated; therefore, using this method with a `last_used_before` switch may not be idempotent as it will cause the set of artifacts matching the search to change
Consider using `clean –archive` instead
# File lib/artifactory/cleaner/cli.rb, line 175 def archive dates = parse_date_options filter = load_artifact_filter archive_to = parse_archive_option if archive_to.nil? STDERR.puts "Missing required `--archive-to` option specifying a a valid, existing directory under which to store archived artifacts" exit Sysexits::EX_USAGE end report = { archived: { artifact_count: 0, bytes: 0 }, skipped: { artifact_count: 0, bytes: 0 } } @controller.with_discovered_artifacts(from: dates[:from], to: dates[:to], repos: options.repos, threads: options.threads) do |artifact| if artifact_meets_criteria(artifact, dates, filter) if options.dry_run? STDERR.puts "Would archive #{artifact} to #{archive_to}" else @controller.archive_artifact artifact, archive_to end report[:archived][:artifact_count] += 1 report[:archived][:bytes] += artifact.size else STDERR.puts "[DEBUG] Skipped #{artifact.inspect} because it did not meet the criteria" if options.verbose? report[:skipped][:artifact_count] += 1 report[:skipped][:bytes] += artifact.size end end report.each do |key,values| puts "#{key} #{values[:artifact_count]} artifacts totaling #{Util.filesize values[:bytes]}" end end
Delete artifacts meeting specific criteria
Clean up an Artifactory instance by deleting old, unused artifacts which meet given criteria
This is a CLI interface to Artifactory::Cleaner's primary function: deleting artifacts which have not been used in a long time (or which meet other criteria, determined by the powerful regex-based filters)
# File lib/artifactory/cleaner/cli.rb, line 234 def clean dates = parse_date_options filter = load_artifact_filter archive_to = parse_archive_option # Ready to locate and delete artifacts report = { deleted: { artifact_count: 0, bytes: 0 }, archived: { artifact_count: 0, bytes: 0 }, skipped: { artifact_count: 0, bytes: 0 } } STDERR.puts "[DEBUG] controller.bucketize_artifacts from #{dates[:from]} to #{dates[:to]} repos #{options.repos}" if options.verbose? @controller.with_discovered_artifacts(from: dates[:from], to: dates[:to], repos: options.repos, threads: options.threads) do |artifact| if artifact_meets_criteria(artifact, dates, filter) if archive_to if options.dry_run? STDERR.puts "Would archive #{artifact} to #{archive_to}" else @controller.archive_artifact artifact, archive_to end report[:archived][:artifact_count] += 1 report[:archived][:bytes] += artifact.size end if options.dry_run? STDERR.puts "Would delete #{artifact}" else @controller.delete_artifact artifact end report[:deleted][:artifact_count] += 1 report[:deleted][:bytes] += artifact.size else STDERR.puts "[DEBUG] Skipped #{artifact.inspect} because it did not meet the criteria" if options.verbose? report[:skipped][:artifact_count] += 1 report[:skipped][:bytes] += artifact.size end end report.each do |key,values| puts "#{key} #{values[:artifact_count]} artifacts totaling #{Util.filesize values[:bytes]}" end end
List all available repos
# File lib/artifactory/cleaner/cli.rb, line 89 def list_repos() repo_info_table = [] repos = @controller.discover_repos repo_kinds = [] repo_kinds << :local if options.local? repo_kinds << :remote if options.remote? repo_kinds << :virtual if options.virtual? include_cols = get_repo_cols(repo_kinds) repos[:local].each {|k, r| repo_info_table << repo_cols(r, include_cols)} if options.local? repos[:remote].each {|k, r| repo_info_table << repo_cols(r, include_cols)} if options.remote? repos[:virtual].each {|k, r| repo_info_table << repo_cols(r, include_cols)} if options.virtual? print_repo_list repo_info_table, include_cols end
Analyze usage and report where space is used
# File lib/artifactory/cleaner/cli.rb, line 112 def usage_report begin from = Time.parse(options.from) to = Time.parse(options.to) rescue => ex STDERR.puts "Unable to parse time format. Please use: YYYY-MM-DD HH:II:SS" STDERR.puts ex exit Sysexits::EX_USAGE end begin STDERR.puts "[DEBUG] controller.bucketize_artifacts from #{from} to #{to} repos #{options.repos}" if options.verbose? buckets = @controller.bucketize_artifacts( from: from, to: to, repos: options.repos, threads: options.threads, ) @controller.bucketized_artifact_report(buckets).each { |l| STDERR.puts l } if options.details? puts "# Detailed Bucket Report:" puts "buckets:" buckets.each do |bucket| puts "#-- #{bucket.length} artifacts between #{bucket.min} and #{bucket.max} days old repo_info_table #{bucket.filesize} bytes --" puts " - min: #{bucket.min} # days old" puts " max: #{bucket.max} # days old" if bucket.empty? puts " artifacts: []" else puts " artifacts:" bucket.each { |pkg| puts " - #{@controller.yaml_format(pkg,6)}" } end end end rescue => err STDERR.puts "An exception occured while generating the usage report: #{err}" STDERR.puts err.full_message STDERR.puts "Caused by: #{err.cause.full_message}" if err.cause Pry::rescued(err) if defined?(Pry::rescue) exit Sysexits::EX_UNAVAILABLE end end
Show version information
# File lib/artifactory/cleaner/cli.rb, line 75 def version STDERR.puts "Artifactory::Cleaner version #{Artifactory::Cleaner::VERSION}" STDERR.puts "Copyright (C) 2020 Pinnacle 21, inc. All Rights Reserved" end


PIZZA CUTTAS
WE'LL CUTCHA
DIAMETER
TOPPINGS
CHEESE
PEPPERONI
SLICE ME
WE HAVE KNIFED YOU INTO
SLICE
S
, SUCKA.


Data integration means ‘putting together’ data and map layers.
Some important considerations when integrating data include
data format, data cleaning and quality control.
Some examples of data formats are shape files, tiff, png and jpeg files.
Data cleaning involves editing and getting rid of ‘noise’ (data that distracts), checking for valid geometry and checking that attributes are correct.
Quality control ensures that data is entered into a GIS correctly
in the first place. If inaccurate data is used that result will be
that an inaccurate map is produced. Tests can be run on data to check its validity.
Data layers need to be at the same projection and co-ordinate reference system (CRS) when integrated.
A very important consideration for integrating spatial data sets
and map layers is that they overlay correctly. Overlaying data is placing data on top of each other in layers in a similar way to which one would overlay cheese, tomato and lettuce on bread when making a sandwich.


The Web Index measures the Web’s contribution to social, economic and political progress in countries across the world. The Index combines existing secondary data with new primary data derived from an evidence-based expert researcher assessment survey. It covers 86 countries; scores are given in the areas of access; freedom and openness; relevant content; and empowerment.
The shading on the map indicates how countries rank according to the index or subindex value selected from the drop down.