Dauntless Armor Set Search
Version 0.2.2:
-fixed several incorrect Cell Slots on Warpikes
-added the new Perks from 9.0
Github
Axe
Chain Blades
Hammer
Repeater
Sword
War Pike
Recruit's Axe
Raging Bite
Song of the Shrike
Quillshot's Fury
Skarn's Judgement
Charred Cleaver
Ember Scythe
Winter Gale
Thundering Scythe
Nayzaga's Scythe
Pangar's Grace
Inferno's Decree
Storm Cutter
Kharabak's Claw
Edge of Dawn
Reaper of Night
Sovereign's Wrath
Stalker's Mercy
Valomyr's Decree
Turmoil of Boreus
Recruit's Chain Blades
Raging Teeth
Flight of the Shrike
Quillshot's Bonehooks
Skarn's Malice
Charred Blades
Ember Blades
Winter Winds
Thundering Cutters
Nayzaga's Reach
Pangar's Claws
Inferno's Fangs
Storm Blades
Kharabak's Wings
Fangs of Dawn
Eyes of Night
Sovereign's Lash
Stalker's Trap
Valomyr's Revenge
Destiny of Boreus
Recruit's Hammer
Raging Crash
Fall of the Shrike
Quillshot's Roar
Skarn's Vengeance
Charred Crusher
Ember Maul
Winter Squall
Thundering Maul
Nayzaga's Charge
Pangar's Rampage
Inferno's Burden
Storm Hammer
Kharabak's Jaw
Break of Dawn
Fall of Night
Sovereign's Grudge
Stalker's Price
Valomyr's Burden
Brutality of Boreus
Molten Edict
Repeater
Recruit's Sword
Raging Blade
Cry of the Shrike
Quillshot's Tusk
Skarn's Rancor
Charred Saber
Ember Cutlass
Winter Ice
Thundering Blade
Nayzaga's Razor
Pangar's Call
Inferno's Razor
Storm Sword
Kharabak's Spur
Call of Dawn
Verge of Night
Sovereign's Torment
Stalker's Strike
Valomyr's Regard
Onus of Boreus
The Hunger
Recruit's War Pike
Raging Cruelty
Scream of the Shrike
Quillshot's Javelin
Skarn's Spite
Charred Spear
Ember Pike
Winter Vortex
Thundering Spear
Nayzaga's Fang
Pangar's Tooth
Inferno's Arrow
Storm Pike
Kharabak's Sting
Spire of Dawn
Gyre of Night
Sovereign's Sorrow
Stalker's Spike
Valomyr's Hope
Revolution of Boreus
The Godhand
Prismatic Grace
Tragic Echo
The Skullforge
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Acidic
Adrenaline
Aetherborne
Aetherhunter
Aetheric Attunement
Aetheric Frenzy
Agility
Assassin's Vigour
Barbed
Berserker
Bladestorm
Bloodless
Conditioning
Conduit
Cunning
Deconstruction
Endurance
Energized
Engineer
Evasion
Evasive Fury
Fireproof
Fleet Footed
Fortress
Guardian
Iceborne
Insulated
Knockout King
Lucent
Medic
Merciless
Molten
Nimble
Nine Lives
Overpower
Pacifier
Predator
Rage
Ragehunter
Savagery
Sharpened
Shellshock Resist
Strategist
Stunning Vigour
Sturdy
Swift
Tough
Vampiric
Warmth
Weighted Strikes
Wild Frenzy
0
3
6
Calculate
Javascript is not working


Este es e la demostración de Html
Elementos de html
Este es e la demostración de html 2 parrafo
Elementos de html Html
¿Que es Lorem Ipsum?
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.


---
layout: page
title: Companies Using Watir
permalink: /users/
---
Here are some companies that use or have used Watir
(in alphabetical order):
{% for user in site.users %}
{% endfor %}
If you would like to add your company to the list, send us
your logo and a link


|
Hornet
v2
High-Performance Streaming Graph Analytics on GPUs
|
cuStinger algorithms namespace More...
Data Structures | |
| struct | BfsData |
| class | BfsTopDown |
| class | BfsTopDown2 |
| class | CC |
| class | KTruss |
| struct | KTrussData |
| class | MultiLevelQueue |
| TO IMPROVE. More... | |
| struct | ptr2_t |
| aggregation of two pointers More... | |
| class | StaticAlgorithm |
| Abstract class for cuStinger static algorithms. More... | |
| class | TriangleCounting |
| struct | TriangleData |
| class | TwoLevelQueue |
| The class implements a two-levels generic type host-device queue. More... | |
Typedefs | |
| using | dist_t = int |
| using | color_t = int |
| using | triangle_t = unsigned int |
Functions | |
| template<typename Operator > | |
| void | forAll (int num_items, const Operator &op) |
apply the Operator a fixed number of times More... | |
| template<typename Operator > | |
| void | forAllnumV (const custinger::cuStinger &custinger, const Operator &op) |
apply the Operator a number of times equal to the actual number of vertices in the graph More... | |
| template<typename Operator > | |
| void | forAllnumE (const custinger::cuStinger &custinger, const Operator &op) |
apply the Operator a number of times equal to the actual number of edges in the graph More... | |
| template<typename Operator > | |
| void | forAllVertices (custinger::cuStinger &custinger, const Operator &op) |
apply the Operator to all vertices in the graph More... | |
| template<typename Operator , typename LoadBalancing > | |
| void | forAllEdges (custinger::cuStinger &custinger, const Operator &op, LoadBalancing &LB) |
apply the Operator to all edges in the graph More... | |
| template<typename Operator , typename T > | |
| void | forAllVertices (custinger::cuStinger &custinger, const custinger::vid_t *vertex_array, int size, const Operator &op) |
| template<typename Operator > | |
| void | forAllVertices (TwoLevelQueue< custinger::vid_t > &queue, const Operator &op) |
| template<typename Operator , typename LoadBalancing > | |
| void | forAllEdges (custinger::cuStinger &custinger, const custinger::vid_t *vertex_array, int size, const Operator &op, LoadBalancing &LB) |
| template<typename Operator , typename LoadBalancing > | |
| void | forAllEdges (TwoLevelQueue< custinger::vid_t > &queue, const Operator &op, LoadBalancing &LB) |
apply the Operator to all vertices in the graph More... | |
| template<typename Operator > | |
| void | forAllBatchEdges (const Operator &op) |
| template<typename Operator > | |
| void | forAllBatchVertices (const Operator &op) |
| template<void(*)(int, void *) Operator> | |
| void | forAll (int num_times, void *optional_data) noexcept |
apply the Operator to the algorithm-dependent data a fixed number of times More... | |
| template<void(*)(custinger::vid_t, void *) Operator> | |
| void | forAllnumV (const custinger::cuStinger &custinger, void *optional_data) noexcept |
apply the Operator to the algorithm-dependent data a number of times equal to the actual number of vertices in the graph More... | |
| template<void(*)(custinger::eoff_t, void *) Operator> | |
| void | forAllnumE (const custinger::cuStinger &custinger, void *optional_data) noexcept |
apply the Operator to the algorithm-dependent data a number of times equal to the actual number of edges in the graph More... | |
| template<void(*)(custinger::Vertex &, void *) Operator> | |
| void | forAllVertices (const custinger::cuStinger &custinger, void *optional_data) noexcept |
apply the Operator to the algorithm-dependent data for all vertices in the graph More... | |
| template<void(*)(custinger::Vertex &, void *) Operator> | |
| void | forAllVertices (TwoLevelQueue< custinger::vid_t > &queue, void *optional_data) noexcept |
| template<void(*)(custinger::Vertex &, void *) Operator> | |
| void | forAllVertices (const custinger::cuStinger &custinger, const custinger::vid_t *vertex_array, int size, void *optional_data) noexcept |
| template<void(*)(custinger::Vertex &, const custinger::Edge &, void *) Operator, typename LoadBalancing > | |
| void | forAllEdges (const custinger::cuStinger &custinger, void *optional_data, LoadBalancing &LB) noexcept |
apply the Operator to the algorithm-dependent data for all edges in the graph More... | |
| template<void(*)(custinger::Edge &, void *) Operator, typename LoadBalancing > | |
| void | forAllEdges (TwoLevelQueue< custinger::vid_t > &queue, void *optional_data, LoadBalancing &LB) noexcept |
| template<void(*)(custinger::Edge &, void *) Operator, typename LoadBalancing > | |
| void | forAllEdges (const custinger::cuStinger &custinger, const custinger::vid_t *vertex_array, int size, void *optional_data, LoadBalancing &LB) noexcept |
| void | callDeviceDifferenceTriangles (const custinger::cuStinger &custinger, const custinger::BatchUpdate &batch_update, triangle_t *__restrict__ outPutTriangles, int threads_per_intersection, int num_intersec_perblock, int shifter, int thread_blocks, int blockdim, bool deletion) |
Variables | |
| const int | BLOCK_SIZE_OP2 = 256 |
| Block size for all kernels associeted to operators. | |
| const int | BLOCK_SIZE_OP1 = 256 |
| Block size for all kernels associeted to operators. | |
cuStinger algorithms namespace
| void custinger_alg::forAll | ( | int | num_items, |
| const Operator & | op | ||
| ) |
apply the Operator
a fixed number of times
| Operator | typename of the operator (deduced) |
| [in] | num_times | number of iterations |
| [in] | op | struct/lambda expression that implements the operator |
op
| void custinger_alg::forAllnumV | ( | const custinger::cuStinger & | custinger, |
| const Operator & | op | ||
| ) |
apply the Operator
a number of times equal to the actual number of vertices in the graph
| Operator | typename of the operator (deduced) |
| [in] | custinger | cuStinger instance |
| [in] | op | struct/lambda expression that implements the operator |
op
| void custinger_alg::forAllnumE | ( | const custinger::cuStinger & | custinger, |
| const Operator & | op | ||
| ) |
apply the Operator
a number of times equal to the actual number of edges in the graph
| Operator | typename of the operator (deduced) |
| [in] | custinger | cuStinger instance |
| [in] | op | struct/lambda expression that implements the operator |
op
| void custinger_alg::forAllVertices | ( | custinger::cuStinger & | custinger, |
| const Operator & | op | ||
| ) |
apply the Operator
to all vertices in the graph
| Operator | typename of the operator (deduced) |
| [in] | custinger | cuStinger instance |
| [in] | op | struct/lambda expression that implements the operator |
op
void operator()(Vertex)
or the lambda expression [=](Vertex){}
| void custinger_alg::forAllEdges | ( | custinger::cuStinger & | custinger, |
| const Operator & | op, | ||
| LoadBalancing & | LB | ||
| ) |
apply the Operator
to all edges in the graph
| Operator | typename of the operator (deduced) |
| [in] | custinger | cuStinger instance |
| [in] | op | struct/lambda expression that implements the operator |
op
void operator()(Vertex, Edge)
or the lambda expression [=](Vertex, Edge){}
| void custinger_alg::forAllEdges | ( | TwoLevelQueue< custinger::vid_t > & | queue, |
| const Operator & | op, | ||
| LoadBalancing & | LB | ||
| ) |
apply the Operator
to all vertices in the graph
| Operator | typename of the operator (deduced) |
| [in] | custinger | cuStinger instance |
| [in] | op | struct/lambda expression that implements the operator |
op
void operator()(Vertex)
or the lambda expression [=](Vertex){}
|
noexcept |
apply the Operator
to the algorithm-dependent data a fixed number of times
| Operator | function to apply at each iteration to optional_data |
| [in] | num_times | number of iterations |
| [in] | optional_data | algorithm-dependent data |
|
noexcept |
apply the Operator
to the algorithm-dependent data a number of times equal to the actual number of vertices in the graph
| Operator | function to apply at each iteration to optional_data |
| [in] | custinger | custinger instance |
| [in] | optional_data | algorithm-dependent data |
|
noexcept |
apply the Operator
to the algorithm-dependent data a number of times equal to the actual number of edges in the graph
| Operator | function to apply at each iteration to optional_data |
| [in] | custinger | custinger instance |
| [in] | optional_data | algorithm-dependent data |
|
noexcept |
apply the Operator
to the algorithm-dependent data for all vertices in the graph
| Operator | function to apply at each iteration to a vertex and to the optional_data |
| [in] | custinger | custinger instance |
| [in] | optional_data | algorithm-dependent data |
|
noexcept |
apply the Operator
to the algorithm-dependent data for all edges in the graph
| Operator | function to apply at each iteration to an edge and to the optional_data |
| [in] | custinger | custinger instance |
| [in] | optional_data | algorithm-dependent data |


Properties
- BoundControlID - ID of a control to use for a single handle
- ClientMultiHandleSliderTargets - The list of controls used to bind slider handle values. These should be Label or TextBox controls
- CssClass - A master style to apply to slider graphical elements
- Decimals - The number of decimal digits in a single slider's value
- EnableHandleAnimation - Determines if the slider handles display of an animation effect when the position is changed
- EnableInnerRangeDrag - Determines if the inner rail range can be dragged as a whole, moving both handles defining it
- EnableKeyboard - Determines if the slider will respond to arrow keys when it has focus
- EnableMouseWheel - Determines if the slider will respond to the mouse wheel when it has focus
- EnableRailClick - Determines if clicking the rail will detect and move the closest handle
- HandleAnimationDuration - Determines the total duration of an animation effect in seconds
- HandleCssClass - A CSS class of a single handle
- HandleImageUrl - URL for an image to display in the slider's handle
- Increment - Determines the number of slider points to increment or decrement using the keyboard or mouse wheel. It is ignored if the steps property is used
- InnerRailStyle - Determines how the inner rail style is handled
- IsReadOnly - Determines if the slider and its values can be manipulated
- IsServerControl - Determines if a control is server-side
- Length - The slider rail length in pixels
- Maximum - The highest value on the slider
- Minimum - The lowest value on the slider
- MultiHandleSliderTargets - The list of controls used to bind slider handle values. These should be Label or TextBox controls
- OnClientDrag - An event raised when a user drags the slider
- OnClientDragEnd - An event raised when a user drops the slider
- OnClientDragStart - An event raised when a user initiates the drag operation on the slider
- OnClientLoad - An event raised when the slider is completely loaded on the page
- OnClientValueChanged - An event raised when the slider changes its state
- Orientation - Determines if the slider's orientation is horizontal or vertical
- RailCssClass - A CSS class for the slider's rail element
- RaiseChangeOnlyOnMouseUp - Determines if changes events to the slider's values are raised during dragging. Otherwise, they are raised when dragging is completed
- ShowHandleDragStyle - Determines if the slider handles will show a style effect when they are being dragged
- ShowHandleHoverStyle - Determines if the slider handles will show a style effect when they are hovered over
- ShowInnerRail - Determines if the slider will show an inner selected range rail. Otherwise, it will be displayed as a uniform rail
- Steps - Determines the number of discrete locations on the slider. Otherwise, the slider is continous
- TooltipText - Determines text to display as a tooltip; {0} denotes the current handle's value in the format string


RSpec::Expectations adds two instance methods to every object:
should(matcher=nil) should_not(matcher=nil)
Both methods take an optional matcher object (See [RSpec::Matchers](../RSpec/Matchers)). When `should` is invoked with a matcher, it turns around and calls `matcher.matches?(self)`. For example, in the expression:
order.total.should eq(Money.new(5.55, :USD))
the `should` method invokes the equivalent of `eq.matches?(order.total)`. If `matches?` returns true, the expectation is met and execution continues. If `false`, then the spec fails with the message returned by `eq.failure_message_for_should`.
Given the expression:
order.entries.should_not include(entry)
the `should_not` method invokes the equivalent of `include.matches?(order.entries)`, but it interprets `false` as success, and `true` as a failure, using the message generated by `eq.failure_message_for_should_not`.
rspec-expectations ships with a standard set of useful matchers, and writing your own matchers is quite simple.
See [RSpec::Matchers](../RSpec/Matchers) for more information about the built-in matchers that ship with rspec-expectations, and how to write your own custom matchers.
@private
# File lib/rspec/expectations/fail_with.rb, line 5 def differ @differ ||= Differ.new end
Raises an RSpec::Expectations::ExpectationNotMetError with message. @param [String] message @param [Object] expected @param [Object] actual
Adds a diff to the failure message when `expected` and `actual` are both present.
# File lib/rspec/expectations/fail_with.rb, line 16 def fail_with(message, expected=nil, actual=nil) if !message raise ArgumentError, "Failure message is nil. Does your matcher define the " + "appropriate failure_message_for_* method to return a string?" end if actual && expected if all_strings?(actual, expected) if any_multiline_strings?(actual, expected) message << "\nDiff:" << differ.diff_as_string(coerce_to_string(actual), coerce_to_string(expected)) end elsif no_procs?(actual, expected) && no_numbers?(actual, expected) message << "\nDiff:" << differ.diff_as_object(actual, expected) end end raise(RSpec::Expectations::ExpectationNotMetError.new(message)) end
Generated with the Darkfish Rdoc Generator 2.


Thibault Malbranche
CSE student, passionated with new technologies.
Brigad
Javascript
ReactJS
AWS Ecosystem
C++
Java
Unit Tests
Keecker
Printic
Objective-C
Swift
iOS Ecosystem


goog.ui.media.PicasaAlbum.getInstance
-, that knows how to
render picasa albums. It is designed to be used with a
goog.ui.Control, which will actually control the media renderer and
provide the goog.ui.Component base. This design guarantees that all
different types of medias will behave alike but will look different.
goog.ui.media.PicasaAlbum expects goog.ui.media.PicasaAlbumModel
s on
goog.ui.Control.getModel
as data models, and render a flash object
that will show a slideshow with the contents of that album URL.
Example of usage:
var album = goog.ui.media.PicasaAlbumModel.newInstance( 'http://picasaweb.google.com/username/SanFranciscoCalifornia'); goog.ui.media.PicasaAlbum.newControl(album).render();picasa medias currently support the following states:
picasa.setEnabled(true); picasa.setHighlighted(true); picasa.setSelected(true);
goog.ui.media.Media
instances and renders it. It expects goog.ui.media.Media.getModel
to
return a well formed, previously constructed, object with a user and album
fields goog.ui.media.PicasaAlbum.parseUrl, which is the data model
this renderer will use to construct the DOM structure.
goog.ui.media.PicasaAlbum.newControl for a example of constructing a
control with this renderer.
goog.ui.media.PicasaAlbum currently displays a picasa-made flash slideshow
with the photos, but could possibly display a handwritten js photo viewer,
in case flash is not available.
This design is patterned after http://go/closure_control_subclassing
It uses goog.ui.media.FlashObject to embed the flash object.goog.ui.media.PicasaAlbum
media data model. It stores a required
userId
and albumId
fields, sets the picasa album URL, and
allows a few optional parameters.|
The opposite of
newInstance : takes an userId and an
albumId and builds a URL.
|
code » | ||||
|
goog.ui.media.PicasaAlbumModel.matcher_()
Regular expression used to extract the picasa username and albumid out of
picasa URLs.
Copied from http://go/markdownlite.js,
and PicasaWebExtractor.xml.
|
code » | ||||
|
A static convenient method to construct a goog.ui.media.Media control out of
a picasa data model. It sets it as the data model goog.ui.media.PicasaAlbum
renderer uses, sets the states supported by the renderer, and returns a
Control that binds everything together. This is what you should be using for
constructing Picasa albums, except if you need finer control over the
configuration.
Arguments:
Returns:
A Control instance binded to the Picasa renderer.
|
code » | ||||
|
goog.ui.media.PicasaAlbumModel.newInstance(picasaUrl, opt_caption, opt_description)
⇒
Gets a
picasaUrl and extracts the user and album id.
Arguments:
Returns:
The picasa album data model that represents the picasa URL.
|
code » |


Some of my intersts include: basketball, football, Olypmics, wood working, web development, vidoe games and many more. Although I love to spend hours in each of these things, the thing I love to do the most is spend time with my beautiful wife, Crystal.
| Name of Interest | Time Spent Weekly (hrs) | Wish I had more Time |
|---|---|---|
| Basketball | 0-1 | Yes |
| Football | 0 | Yes |
| Wood Working | 1-2 | Undecided |
| Web Development | 15-18 | Yes |
To get a little more in detail I'll cover some specifics about
my hobbies. My favorite basketball team is the Utah Jazz, and
for football is the Seattle Seahawks. I am really enjoying learning
HTML, CSS, JavaScript and much more though Web Development and Neumont.
I enjoy just about any video game as long as I have friend
to play it with.
As far as wood working goes, I am very new to this, but I have found
that I enjoy making small crafted trinkets and decortive items.


Class iteminfo
Steam Item info. Cannot be called manually. See \justinback\steam\item
Author: Justin Back<EMAIL_ADDRESS>Located at class/iteminfo.php
Methods summary
public
|
#
__construct( string $sApiKey = null, string $iGame = null, string $sSteamid = null, string $oItemobject = null )
Construction of the variables |
Properties summary
public
|
$game
Steamworks App ID |
#
null
|
public
|
$itemdefid
Item Definition ID of the item |
#
null
|
public
|
$timestamp
Readable Timestamp updated/created? |
#
null
|
public
|
$modified
Last modified time |
#
null
|
public
|
$date_created
creation date of the item |
#
null
|
public
|
$type
Type of the item |
#
null
|
public
|
$display_type
Display type of the item |
#
null
|
public
|
$name
The name of the item |
#
null
|
public
|
$price
The price of the item |
#
null
|
public
|
$quantity
The quantity of the item |
#
null
|
public
|
$description
The description of the item |
#
null
|
public
|
$icon_url
The icon url (small) of the item |
#
null
|
public
|
$icon_url_large
The icon url (large) of the item |
#
null
|
public
|
$name_color
The name color of the item |
#
null
|
public
|
$promo
The promotion type of the item |
#
null
|
public
|
$tags
The tag array of the item |
#
null
|
public
|
$tradable
Is the item tradable? |
#
null
|
public
|
$marketable
Is the item marketable? |
#
null
|
public
|
$commodity
Not entirely sure about this one. Will come back to this later. |
#
null
|
public
|
$drop_interval
The drop rate of the item |
#
null
|
public
|
$drop_max_per_window
The Maximum drop per session of the item |
#
null
|
public
|
$workshopid
Not sure here |
#
null
|
public
|
$hash
The hash of the item |
#
null
|
public
|
$item_quality
The quality of the item |
#
null
|
public
|
$item_slot
The slot of the item |
#
null
|
public
|
$icon_url_hash
The hash of the item icon (small) |
#
null
|
public
|
$icon_url_hash_large
The hash of the item icon (large) |
#
null
|


s6-cleanfifodir cleans up a fifodir.
s6-cleanfifodir fifodir
s6-cleanfifodir cleans up fifodir, that must belong to the current user. That means it removes all stale FIFOs in fifodir.
In normal use, it is not necessary to call s6-cleanfifodir. However, stale FIFOs can be left by s6-ftrigrd processes that were violently killed, so it's good practice to regularly clean up fifodirs.


A sliding window is a type of function that accepts an iterable and sends it back in overlapping chunks. This is useful when you need to process an item in context. There’s one in the old library examples for itertools (I’m talking Python v. 2.3.5)
from itertools import islice def old_window(seq, n=2): "Returns a sliding window (of width n) over data from the iterable" " s -> (s0,s1,...s[n-1]), (s1,s2,...,sn), ... " it = iter(seq) result = tuple(islice(it, n)) if len(result) == n: yield result for elem in it: result = result[1:] + (elem,) yield result %timeit -n 1000 -r 5 list(old_window('abcdefgh', 3)) print(*list(old_window('abcdefgh', 3)), sep='\n')
1000 loops, best of 5: 3.4 µs per loop ('a', 'b', 'c') ('b', 'c', 'd') ('c', 'd', 'e') ('d', 'e', 'f') ('e', 'f', 'g') ('f', 'g', 'h')
The New Hotness
But that’s old and if Node, Rust, Go and Mongo have taught me anything, it’s anything more than 10 seconds old is garbage and not webscale. Sarcasm aside, I just enjoy tearing things down just to rebuild them and hopefully learn something in the process. Let’s see what we can come up with…
from itertools import tee def window(it, size=3): yield from zip(*[islice(it, s, None) for s, it in enumerate(tee(it, size))]) %timeit -n 1000 -r 5 list(window('abcedefgh', 4)) print(*list(window('abcedefgh', 4)), sep='\n')
1000 loops, best of 5: 6.7 µs per loop ('a', 'b', 'c', 'e') ('b', 'c', 'e', 'd') ('c', 'e', 'd', 'e') ('e', 'd', 'e', 'f') ('d', 'e', 'f', 'g') ('e', 'f', 'g', 'h')
Okay, so it’s about half as fast (or twice as slow, I’m not sure which is the Glass Half Full).
Let’s deconstruct it first:
- First the iterable is cloned a number of times.
- Those iterables are then passed to enumerate which is a generator that returns an item and it’s position in an iter
- The positions and iterables are then passed into a list comphrension loop
- The loop populates the list with a series of islice objects — each starting an iterable at the position given to it by enumerate
- The list is splatted into zip
- yield from the zip
But it’s one line! One liners are cool. Right?
Benchmarks Mean Nothing
I’m of the opinion that benchmarks don’t prove much by themselves — a broader context is needed.
However… let’s see how it stacks up against the old window in a variety of situations.
# calculate rolling average from operator import add from functools import reduce f = lambda x: reduce(add, x)/len(x) print(list(map(f, window(range(10), size=4)))) %timeit -n 1000 -r 5 list(map(f, old_window(range(10), n=4))) %timeit -n 1000 -r 5 list(map(f, window(range(10), size=4)))
[1.5, 2.5, 3.5, 4.5, 5.5, 6.5, 7.5] 1000 loops, best of 5: 10.1 µs per loop 1000 loops, best of 5: 14.3 µs per loop
# generate pseudo text markov chains text = "mary had a little lamb" print({c[:-1]:c[-1] for c in window(text.split(), 3)}) %timeit -n 1000 -r 5 {c[:-1]:c[-1] for c in window(text.split(), 3)} %timeit -n 1000 -r 5 {c[:-1]:c[-1] for c in old_window(text.split(), 3)}
{('had', 'a'): 'little', ('a', 'little'): 'lamb', ('mary', 'had'): 'a'} 1000 loops, best of 5: 14.8 µs per loop 1000 loops, best of 5: 5.14 µs per loop
Annother application for this in as a solution to Euler 8.
from collections import deque from itertools import chain from functools import partial from operator import mul nums = """73167176531330624919225119674426574742355349194934<PHONE_NUMBER>2774506326239578318016984801869478851843<PHONE_NUMBER>9112949495459501737958331952853208805511<PHONE_NUMBER>7158523863050715693290963295227443043557<PHONE_NUMBER>0445244523161731856403098711121722383113<PHONE_NUMBER>3380308135336276614282806444486645238749<PHONE_NUMBER>6290491560440772390713810515859307960866<PHONE_NUMBER>1883998797908792274921901699720888093776<PHONE_NUMBER>1053367881220235421809751254540594752243<PHONE_NUMBER>1670556013604839586446706324415722155397<PHONE_NUMBER>7846174064955149290862569321978468622482<PHONE_NUMBER>5657056057490261407972968652414535100474<PHONE_NUMBER>4403199890008895243450658541227588666881<PHONE_NUMBER>9924442928230863465674813919123162824586<PHONE_NUMBER>9124566529476545682848912883142607690042<PHONE_NUMBER>1055626321111109370544217506941658960408<PHONE_NUMBER>0962455444362981230987879927244284909188<PHONE_NUMBER>6097919133875499200524063689912560717606<PHONE_NUMBER>7109405077541002256983155200055935729725<PHONE_NUMBER>1882670428252483600823257530420752963450""" nums = [int(n) for n in chain.from_iterable(nums.split("\n"))] def euler_8_1(numbers): limit = 13 run = [] largest = 0 # originally this was a while-loop that popped off items from numbers # I changed for the sake of not being so fucking stupid # inserting at index[0] on a list is still dumb though. # purpose for this change was to avoid copying the # numbers list every time and thus artificially # bloating the run time for the solution # This was my first encounter with windowing # through I didn't know it yet. for n in numbers: run.insert(0, n) if len(run) > limit: run.pop() x = reduce(lambda x, y: x*y, run) if x > largest: largest = x return largest def euler_8_2(numbers): run = deque(maxlen=13) largest = 0 for n in nums: # look another window # still didn't really know what # windowing was at this time run.append(n) x = reduce(mul, run) if x > largest: largest = x return largest print("Solution to Euler #8 (as of 8/21/14): ", max(map(partial(reduce, mul), window(nums, size=13)))) %timeit -n 1000 -r 5 euler_8_1(nums) %timeit -n 1000 -r 5 euler_8_2(nums) %timeit -n 1000 -r 5 -p 5 max(map(partial(reduce, mul), window(nums, size=13))) # upped the precision of these two %timeit -n 1000 -r 5 -p 5 max(map(partial(reduce, mul), old_window(nums, n=13))) # because they're pretty close
Solution to Euler #8 (as of 8/21/14):<PHONE_NUMBER>0 1000 loops, best of 5: 2.53 ms per loop 1000 loops, best of 5: 1.05 ms per loop 1000 loops, best of 5: 1.2112 ms per loop 1000 loops, best of 5: 1.2605 ms per loop
Not too shabby, not quite as fast as the second iteration of my solution but way faster than my first (admittedly, stupid) solution. The old windowing function falls just short of the new one.
Windowing Infinite Generators
The real differences start to be seen here: working with infinite generators. The old windowing function handles this quite well, assuming you don’t attempt to consume "entire" generator at once. The new windowing function needs you to massage the infinite generator into a subset. Either way, islice comes into play, it’s just a matter of where.
def fib(): yield from range(2) a,b = range(2) while True: yield a+b a,b = b, a+b size = 5 start = 0 end = 9 def display(it): print(*list(it), sep='\n') display(window(islice(fib(), start, end), size))
(0, 1, 1, 2, 3) (1, 1, 2, 3, 5) (1, 2, 3, 5, 8) (2, 3, 5, 8, 13) (3, 5, 8, 13, 21)
That’s pretty nifty. However, window still creates a number of iterators equal to it’s window size and partially consumes them almost immediately. And we can’t ask for, say the first five windows of five numbers without jumping throw some nasty hoops as opposed to the old windowing function:
size = 5 frames = 5 # what is this hy? -- https://github.com/hylang/hy display(map(next,(window(islice(fib(), i, i+size), size) for i in range(frames)))) #islice(old_window(fib(), size), frames)
(0, 1, 1, 2, 3) (1, 1, 2, 3, 5) (1, 2, 3, 5, 8) (2, 3, 5, 8, 13) (3, 5, 8, 13, 21)
Let’s break that down, because even though I wrote it just now, I have a hard time following it (and it only took about ten tries to get it right, too):
- islice(fib(), i, i+size) — slice the number generator at an arbitrary length
- window(..., size) — window that sliced generator to the appropriate size
- ... for i in range(frames) generate the arbitrary numbers for the original islice
- (...) wrap the whole thing in a generator expression
As opposed to the old busted, which breaks down to:
- old_window(fib(), size) — begin windowing the generator
- islice(..., frames) — only take the frames that we want.
Starting the generator in an arbitrary spot isn’t as intuitive as it is with the old windower - which is just fast forward the generator to a specific spot with islice. With the new hotness we have to make sure we’re offsetting appropriately (only took three tries and some serious mind searching to determine if I was simply retarded or not).
start = 3 size = 5 frames = 5 #list(map(next,(window(islice(fib(), i+start, i+size+start), size) for i in range(frames)))) display(islice(old_window(islice(fib(), start, None), n=size), frames))
(2, 3, 5, 8, 13) (3, 5, 8, 13, 21) (5, 8, 13, 21, 34) (8, 13, 21, 34, 55) (13, 21, 34, 55, 89)
Everything Old Is New
Okay, so using a single container is faster than yielding out a bunch of iterators. But why not use a fixed length iterable instead of playing surgeon on a tuple? collections.deque is one of my favorite things in the standard library and it’s fixed length and I (accidentally) used it for windowing before.  Yields a tuple for each frame of the window. ''' it = iter(it) if any([start, stop, step]): it = islice(it, start, stop, step) window = deque(islice(it, size), maxlen=size) yield tuple(window) for i in it: window.append(i) yield tuple(window) display(dedow('abcdefgh', size=3)) %timeit -n 1000 -r 5 list(old_window('abcdefgh', n=3)) %timeit -n 1000 -r 5 list(window('abcdefgh', size=3)) %timeit -n 1000 -r 5 list(dedow('abcdefgh', size=3))
('a', 'b', 'c') ('b', 'c', 'd') ('c', 'd', 'e') ('d', 'e', 'f') ('e', 'f', 'g') ('f', 'g', 'h') 1000 loops, best of 5: 3.52 µs per loop 1000 loops, best of 5: 6.34 µs per loop 1000 loops, best of 5: 6.02 µs per loop
It’s actually slower than window here, but I find the code much more readable than either window or old window. It handles just like the old windowing function, plus it can handle slicing an iterable for you. Though, I do kinda feel that by passing arguments to islice violates the single responsibility principle — not enough that I’ll take it out, but I do see how that could be valid criticism.
# Window 3 over every other fibonacci number for the first 20 numbers display(dedow(fib(), size=3, step=2, stop=20))
(0, 1, 3) (1, 3, 8) (3, 8, 21) (8, 21, 55) (21, 55, 144) (55, 144, 377) (144, 377, 987) (377, 987, 2584)
Benchmarks Still Means Nothing
Let’s benchmark these against some tests:
- Window five values from the first 100 numbers of fib()
- 100 windows of five values from fib()
- Solve Euler 8
- Generate a simple n-Order Markov Chain (n = window size - 1)
print("1. Window of 5 for first 100 values of fib()") consume = partial(deque, maxlen=0) fib100 = tee(islice(fib(), 100), 3) # we could use dedow's stop kw but, I think it's less fair to construct the slice each interval %timeit -n 1000 -r 5 consume(window(fib100[0], size=5)) %timeit -n 1000 -r 5 consume(dedow(fib100[1], size=5)) %timeit -n 1000 -r 5 consume(old_window(fib100[2], n=5)) print("\n2. First 100 windows of 5 of fib()") %timeit -n 1000 -r 5 consume((window(islice(fib(), i, i+5), 5) for i in range(100))) %timeit -n 1000 -r 5 consume(islice(dedow(fib(), size=5), 100)) %timeit -n 1000 -r 5 consume(islice(old_window(fib(), n=5), 100)) print("\n3. Solve Euler #8") def solve(prob): f = partial(reduce, mul) return max(map(f, prob)) %timeit -n 1000 -r 5 solve(window(nums, size=13)) %timeit -n 1000 -r 5 solve(dedow(nums, size=13)) %timeit -n 1000 -r 5 solve(old_window(nums, n=13)) print("\n4. Generate a simple n-Order Markov Chain (n = window size - 1)") text = 'lorem ipsum dolor sit amet consectetur adipiscing elit pellentesque gravida turpis egestas nisl consectetur et' %timeit -n 1000 -r 5 {c[:-1]:c[-1] for c in window(text.split(), 3)} %timeit -n 1000 -r 5 {c[:-1]:c[-1] for c in dedow(text.split(), 3)} %timeit -n 1000 -r 5 {c[:-1]:c[-1] for c in old_window(text.split(), 3)}
1. Window of 5 for first 100 values of fib() 1000 loops, best of 5: 6.07 µs per loop 1000 loops, best of 5: 4.33 µs per loop 1000 loops, best of 5: 3.22 µs per loop 2. First 100 windows of 5 of fib() 1000 loops, best of 5: 91.9 µs per loop 1000 loops, best of 5: 78.8 µs per loop 1000 loops, best of 5: 54.2 µs per loop 3. Solve Euler #8 1000 loops, best of 5: 1.22 ms per loop 1000 loops, best of 5: 1.45 ms per loop 1000 loops, best of 5: 1.27 ms per loop 4. Generate a simple n-Order Markov Chain (n = window size - 1) 1000 loops, best of 5: 13.2 µs per loop 1000 loops, best of 5: 15.5 µs per loop 1000 loops, best of 5: 12.3 µs per loop
Part of the Zen of Python is "There should be one— and preferably only one —obvious way to do it.". However, windowing isn’t something that I find obvious or easy to do as evidenced by three solutions presented here. Aside from the two I presented, I can think of at least one more solution: a class based windower that implements the iterator protocol.
from collections import namedtuple from string import ascii_lowercase as letters # islice doesn't play well with actual slice objects _slice = namedtuple('_slice', ['start', 'stop', 'step']) class Window: '''Implements the iter protocol as to represent a window over a sequence''' def __init__(self, seq, size, start=None, step=None, stop=None): self.slice = _slice(start or 0, stop or None, step or 1) self.size = size self._seq = iter(seq) if any(self.slice): self._seq = islice(self._seq, *self.slice) self.cheat = deque(islice(self._seq, size), maxlen=size) self._stop = False def __iter__(self): return self def __next__(self): if self._stop: raise StopIteration cheat = tuple(self.cheat) try: self.cheat.append(next(self._seq)) except StopIteration: self._stop = True return cheat display(dedow(letters, size=4, step=2)) %timeit -n 1000 -r 5 consume(Window(letters, size=4, step=2)) %timeit -n 1000 -r 5 consume(dedow(letters, size=4, step=2))
('a', 'c', 'e', 'g') ('c', 'e', 'g', 'i') ('e', 'g', 'i', 'k') ('g', 'i', 'k', 'm') ('i', 'k', 'm', 'o') ('k', 'm', 'o', 'q') ('m', 'o', 'q', 's') ('o', 'q', 's', 'u') ('q', 's', 'u', 'w') ('s', 'u', 'w', 'y') 1000 loops, best of 5: 21.5 µs per loop 1000 loops, best of 5: 9.73 µs per loop
Of course, that’s a basic example and I (feel like I) cheated by using deque to store the window itself — I mean, it’s basically dedow. But it communicates the basic idea behind using an object as a windower.
Did I Learn Anything?
Implementing the iter protocol is difficult sometimes.  The guys who contribute to Python know more about what’s fastest than I do (who saw that coming?).
Also, windowing is fun. Why haven’t I considered this before for projects? These implementations are actually viable for a Markov Chain project I’ve been working on occasionally (which up until now had a very awkward method that broke text into tuplekey-value pairs).
I spilled my brains, spill some of yours.


Hi.
I've seen concern expressed in several posts here about the life length of the SD cards reduced by frequent write accesses.
I chose the Pi as a base because it appeared to me as about the same price but with more versatility. If I was mass-producing OEM systems, the price would be more important, and I wouldn't care about versatility, but it is not the case. Yet, I don't really need a local server.
As far as I can tell, there are two main sources of write accesses : logs and database sample recordings.
Apache logs should not be frequent if the Pi is not used as a server.
The gateway scripts do a bit of logging. This can or could be disabled, although this option is not offered yet. It is easy to add.
Regarding the sample recording, it looks as if the whole design is done to store locally, while the "remote send" feature is an option. Changing this would imply to modify both the gateway scripts (the python script was designed with this in mind from the beginning, the php script is adaptable) and the GUI (could be a bit more painful from my POV).
Do you think this would be worth doing for a future emonCMS/raspberrypi version ?
Ultimately, the most generic approach would be to let the user define as many emonCMS targets as he wants through the GUI, one of which could be the local one. But if that makes it too complicated, sticking to local and remote, with the possibility to enable/disable each, would address the SD card life expectancy issue.
What do you think ?
A linux machine running 24/7 does some writing anyway. Do you have an idea of what kind of usage makes OEM become problematic ? I mean, can one record every 3 seconds be too much already ?
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi
I can confirm that the PI SD card eventually fails if used as the database. I have had 2 fail. I now have a USB hard disk and used berryboot to move the PI Linux installation onto the hard disk. Time will tell if this is more reliable.
Regards
Ian
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Sorry to repeat myself, but the accumulated wisdom elsewhere is to boot from the SD card and run on and do all writing to a genuine spinning hard disc.
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Ian, you're right. I think a spinning USB hard disk should be more reliable in time, or so I've heard. But this means higher cost, higher power consumption, and more space needed.
Now, if the Pi is just used as a repeater, like a Nanode RF, there should not be so many write accesses, and I don't see where the problem is in terms of reliability. There may be too much logging but this is something that can be customized, and, well, the Pi is supposed to be running a linux on an SD card, I hope this can handle a reasonable amount of logging.
(One may argue that it is more expensive than a Nanode, but it has other advantages: versatility, possibility to connect to and operate on via ssh,...).
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi Ian and Jérôme,
in my system, i combine two devices at the same time to run it. At the beginning used only the SD card and the system fails when time passed. So i combine a SD card (small capacity, it´s not necessary a big one. 128 Mb is more than enough) only for boot purposes (RasPi) and then a pendrive (32 GB) to store data. This combination runs perfect for me with no problem and completely stable.
Best regards,
Nacho
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Isn't there just the same issue with a pendrive !?
https://en.wikipedia.org/wiki/Pendrive#Disadvantages
https://en.wikipedia.org/wiki/Flash_memory#Memory_wear
By the way, I read this:
I don't know what is done on raspian regarding this. (Haven't searched for it specifically.)
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi Jérôme,
may be, but nowadays has been the only method i find to run it stable. At the moment I have no problems with this configuration. May be in the future. The only thing i could tell you is that it´s work fine for me. Very stable with that configuration at the moment.
It´s very important to me to have my data base in good conditions and for now that's what happens. In the past my data (specifically the SD card) was corrupted after a certain time but not now ... I will tell you if the problems return.
Is important for me simplify system installation without using a usb hard drive and for now, the pendrive works perfectly.
This is my pendrive in use:
Thanks for the wikipedia links by the way ... I´ll read them carefully.
Regards,
Nacho
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi Jérôme
I just realized that you are suggesting the PI as a replacement for the NandodeRF to be used as a base station forwarding all data to a remote server. I think that is an excellent idea for those prefering to use a PI.
We would then have the possibility of using a PI used in 3 different modes.
1 - As an emoncms server network connected to a base station. (This is how I have been using it prior to the latest emoncms software with a nanodeRF used as a base station)
2 - Fitted with the RFM12PI used as a direct radio connected server which seems to be what is currently being promoted. (Which I think could be a mistake unless the data is written to a hard disk) .
3 - Fitted with the RFM12PI used as a dumb base station forwarding data to a remote server as you are suggesting.
Regards
Ian
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Interesting subject,
also check this topic, where they discuss the option to mount the SD as R/O
raspberrypi.org/phpBB3/viewtopic.php?p=217757#p217757
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
I went through a couple SD cards that didn't work well with emonCms, but have been running for about four months without problems, logging data continuously. I do expect eventual SD card failure. So my solution has been to run an automated backup of the mysql database, using automysqlbackup as I read about here on OpenEnergMonitor a couple months ago. Every day the emoncms data is automatically backed up to my main computer whenever I happen to turn it on.
For now I am using a NanodeRf as an emonBase, forwarding data for emonCms logging on my RasPi. I do have an Rfm2Pi running on my RasPi, but I am using it for other purposes (controlling my house heat pump).
I did set up (on a second RasPi) a USB hard drive. It works, but it is loud and draws about 8 watts. That drive is an older external drive that I was no longer using. If I had a small, inexpensive, low power USB hard drive, the external drive could be a good solution. In my quick search, it seems there is no large market out there for hard drives like that.
I have an SSD (solid state drive) in my desktop computer. SSD warranties are approaching those of HDDs. But isn't the technology of the SSD memory more-or-less the same as SD card memory? So why is the SSD more reliable than the SD card? Or is it, I am a bit confused about that. A small SSD (say 32GB), if it actually were reliable, would seem good for the RasPi. Cost should be mostly proportional to size, so it would be relatively inexpensive, though the trend is toward larger drives, which might make small ones unavailable and/or more expensive.
A quick check at Newegg shows a 32GB SATA SSD for $50 with three year warranty. Add an SATA-USB converter for say $10, and that would be a solution. Though maybe there are reasons this wouldn't work with the RasPi, I don't know. And again, just because they say 3 years, I don't know why this would be more reliable than an SD card.
-Ed
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
My quick solution was to create a MySQL Master to Slave replica to have a backup. Master is the database in the RasPi instance and Slave is a database in a Windows system with Wamp server (and of course MySQL instance) in it.
I know this is not the best solution but a had a lot of problems in forwarding data from RasPi to the laptop instance. Every thing in the Raspi emoncms parameters is correct (green color) but no data in the laptop instance with the forward method.
My emoncms data is backed up automatically hourly but for me, replication is the best method that i could find. When i try to restore a backup, this is a slow process for me. It takes me a few hours to restore the entire database.
Regards,
Nacho
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
The Raspberry Pi is the first small Linux computer I have ever seen that boots and runs from SDHC or Compact Flash.
All small Linux computers I've seen prior to this boot from SDHC or Compact Flash, and then run from a ramdisk with the SDHC or CF unmounted and powered down.
To preserve data when the computer is powered off, closedown scripts either back up the written files to a Network File system, or scribble them back to the SDHC.
I have only had my Raspberry Pi a few days, but this is the first mod I will make to my system.
Anyone interested in this should look at the buildroot project http://www.buildroot.org/ where I understand Raspberry Pi is now an official build target.
Mike
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
My SD card failed earlier this week (after just 5 weeks), and rather than buy another 16Gb card (to accommodate my backup image), I've split the SD card partitions to boot from a 120mB SD card (old TomTom card!), and moved the 'root' to a external USB HDD partition.
I want to use one of the other partitions in the USB HDD to act as a network backup device for my other computers (not quite sure how to do that yet!!).
If I can do that, then the cost of buying and running the external HDD is more justifiable.
Paul
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
I've now got a version of Linux running completely in RAM. There is no SDHC activity after the system finishes booting. The system has been running now for several days, and here are my disk stats
$ cat /proc/diskstats | grep mmc
179 0 mmcblk0 182 3 1480 210 0 0 0 0 0 200 210
179 1 mmcblk0p1 17 3 160 50 0 0 0 0 0 50 50
179 2 mmcblk0p2 80 0 640 70 0 0 0 0 0 70 70
They have not changed since I first logged on.
I guess I could upload the kernel image here because the filesystem is an initramfs, so you'd only need the kernel.img file, but it's not easy for anyone to change the filesystem without the complete build environment. You can of course change it when you log in, but of course you loose any changes when the system reboots.
As I have it running, there's no X environment, no emoncms, the system just listens to the RFM12pi and collects data, passing emoncms .json requests out to the www.
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi Mike.
Thanks for your inputs.
Perhaps can you just list the steps to accomplish this. Is this a linux you built more or less from scratch ? A raspian ? Did you recompile a kernel with different options ?
What gateway do you use to listen to the RFM and send the data ? Currently, I think emoncms is needed because the parameters for the radio are entered through the Raspberry Pi module GUI. Did you hardcode the parameters in an existing gateway script (php or python) or did you make your own ?
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
I've been using the buildroot environment for creating embedded systems for several years. Details can be found here http://buildroot.uclibc.org/. Buildroot is a complete build system. You tell it what the target system is, what programs you want included, the format of your filesystem etc, and then sit back for an hour or so while it downloads all the code and builds it for you.
There is a default configuration for the Raspberry Pi. I used that. I notice it has pulled in a load of stuff I'll never use, like programs to process the optional camera, but they are not large so I've left them in the image.
As for the RFM gateway, I wrote my own in C. I'll attach the code. It is nothing clever. I used minicom to program up the RFM radio interactively, then locked it. I've not seen any corruption of the frequency or node numbers that the php gateway comments seem to imply happens, though my gateway code (monitor) does occassionally get stuff it's not expecting, i.e.
May 13 08:24:06 pi user.info syslog: monitor: Uknown packet Available commands:
May 13 08:24:06 pi user.info syslog: monitor: Uknown packet 123 x - Toggle configuration change protection, 1=Unlocked
May 13 08:24:06 pi user.info syslog: monitor: Uknown packet <nn> i - set node ID (standard node ids are 1..26)
May 13 08:24:06 pi user.info syslog: monitor: Uknown packet <n> b - set MHz band (4 = 433, 8 = 868, 9 = 915)
May 13 08:24:06 pi user.info syslog: monitor: Uknown packet <nnn> g - set network group (RFM12 only allows 212, 0 = any)
May 13 08:24:06 pi user.info syslog: monitor: Uknown packet <n> c - set collect mode (advanced, normally 0)
May 13 08:24:06 pi user.info syslog: monitor: Uknown packet ...,<nn> a - send data packet to node <nn>, with ack
May 13 08:24:07 pi user.info syslog: monitor: Uknown packet ...,<nn> s - send data packet to node <nn>, no ack
May 13 08:24:07 pi user.info syslog: monitor: Uknown packet <n> l - turn activity LED on DIG8 on or off
May 13 08:24:07 pi user.info syslog: monitor: Uknown packet Current configuration:
May 13 08:24:07 pi user.info syslog: monitor: Uknown packet 79 i15 g210 @ 433 MHz Lock: 0
May 13 08:24:07 pi user.info syslog: monitor: Uknown packet > 0s
May 13 08:24:07 pi user.info syslog: monitor: Uknown packet -> 1 b
Code for monitor - my RFM gateway attached. Node numbers are currently hardwired, as are the names of various shell scripts I run to do the processing. I had intended to set all that stuff interactively with command line options but have not got around to it yet.
If you want to try buildroot, download it into a directory called buildroot, cd to it. type "make menuconfig", exit out of the menu. Then untar the buildroot_configs.tar file. That will unroll all the config files I have used. Type "make" and sit back. You will get a complete copy of my system built from scratch.
Mike
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
After my first SD card failure (the original pre-loaded has lasted only 3 weeks), I have moved the root partition to a USB pendrive, and left boot partition on a small 128 Mb SD card.
Nacho, is it yours still running?
I cross my fingers hoping that my pendrive have implemented the wear leveling and so. Next step will be replace the USB by a (small and cheap) USB HDD that I am still looking for.
In order to avoid massive writing to the Sd card or USB pendrive, is it possible to configure the Raspberry as only a gateway and send all the data directly to emoncms.org server?
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
I've been working on a standalone gateway, and I'd be happy to get your feedback :
https://github.com/Jerome-github/oem_gateway
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
I did experiment with a USB pen drive, mine lasted only two weeks. I guess the larger capacity, the better wear leveling would be, mine was just a basic 4GB USB drive. My final approach was to do a R/O root file system and have the Raspberry Pi as forwarder only.
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
I've had a 4gb thumb drive (integral) working for nearly three months now without error. I thought it would make sense to upgrade to a larger capacity drive after reading about wear problems, so I purchased 2 32gb mini usb thumb drives (again Integral) - one for the Pi and one spare. The first failed after about 4 hours of use and is now unmountable on my Debian laptop. The second hit problems after a few hours use and after checking, was found to be heavily corrupted. I guess some are more robust than others, even down to different types from the same manufacturer (the failed drives were purchased direct from Amazon.uk)
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi Martin,
Sounds greats - downloaded oemgateway but can't login to change pi settings e.g. ssh using normal default pi and raspberry login. What is default raspberry pi login for oemgateway ready to go.
Thanks
Peter
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Do you mean you downloaded emoncms as a ready-to-go SD card ?
emongateway designates (to me) the python gateway I coded, to be used on a Pi with a linux installation, it has no login/pwd by itself.
If you intend to use the Pi as a repeater, you don't need the ready-to-go SD card, rather a raspian or other distro (I'm using raspian) on which you just have to install the gateway.
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi Jerome, I found this file which I assumed was complete ready to go for oem gateway "oem_gateway24sep2013.img.zip" at http://emoncms.org/site/docs/raspberrypigateway
I loaded it onto cleaned SDHC card and booted my Pi. Seemed to boot ok. It offers login and also displays gateway traffic.
I just tried ssh and that offered login, woeked when I tried login root & username root. Now I'm confused, do I work with above or is there a different procedure I should have followed to get oemgateway.
This comes up on log in -
Industrial Perennial Environment - Release 1
by NutCom Services, Inc. - http://nutcom.hu/ipe/
Thanks Peter
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Wow. This indeed is the python gateway I'm referring to. I just didn't know a ready-to-go card had been released that used it (which I'm glad. Means it might be useful to someone.). Hence the confusion.
According to the doc page you provided, root/root is the way to go. Are you saying it worked when you did this ? Then everything's fine. Change root password and you're done.
(I would have created a normal (non root) user account, but perhaps the rationale here is that the system being read-only, it is not meant to be used for usual tasks anyway.)
I'm not sure.
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi, No not stuck just wondering was I on right path. I'll try configure to suit my setup tonight. Also try a 3G solution I've been working on using "umtskeeper". Excellent
Thanks Peter
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi Jerome and Glyn, great work on the oemgateway image. I am having a small problem with the SD image. When I run -
root@oemgateway:~# ps -ef | grep python
root 1221 1206 2 14:30 pts/0 00:00:48 python /root/oem_gateway/oemgateway.py --config-file /boot/oemgateway.conf
root 1242 1226 0 15:06 pts/1 00:00:00 grep python
the system returns the above. If I run the kill command for 1221 it tells me there is no such process running. Also no data is being sent to emoncms unless I run the command
python /root/oem_gateway/oemgateway.py --config-file /boot/oemgateway.conf
and then it spews out the expected data on the monitor and emoncms begins to update. When I CTRL-C out of that, emoncms quits updating. Essentially the system does not start or continue the process to run the program when the system boots.
Any ideas about what could be wrong?
Regards...
Re: RaspberryPi as emonBase forwarder only - SD card life expectancy concern
Hi.
I can't figure out how i experienced two SD failure in two days using emonCMS linux images, while i have a little raspberrypi server running mysql + php since one year without any problem. I think to investigate deeper what kind of failure SD had. One difference with two platforms is that my working set i used ext4 fs with "noatime" option. May failure due to rewriting many times the same block? I'm not expert of filesystems but i realized it is very strange a so fast failure. If i could write any cycle a different location in my 8GB data structure it would take a long time return in the same cell before filling the whole data space available. Could we consider to use a special filesystem for SD memory cards?
I found an interesting discussion in http://raspberrypi.stackexchange.com/questions/169/how-can-i-extend-the-life-of-my-sd-card
Thanks
Giuseppe.


{% load staticfiles %}
Kolibri installers, updates, and content can be downloaded once to a device in an area that has an Internet connection
That "seeded" device can then share new content and updates with other devices over an offline local network.
To reach the most remote communities, a device can be carried by foot to share installers, updates, and content with other devices over local networks.


Video shows heroic Australian woman brave raging flames to save a badly wounded, crying koala from a bushfire, Business Insider - Business Insider Singapore
by Sahar Esfandiari- A woman in Australia saved a badly-wounded, crying koala from a bushfire in New South Wales in Australia.
- Video footage shows how Toni Doherty rushed to pick the animal up from a tree surrounded by flames, using her own t-shirt to scoop him up into her arms.
- The koala was then washed and wrapped in a blanket before being taken away to the Port Macquarie Koala Hospital, according to 9News.
- Six people have died as a result of the fires in the state of New South Wales since October, and 577 homes have been destroyed, according to The Associated Press.
- Visit Insider’s homepage for more stories.
A woman in Australia saved a crying koala from a bush fire by taking her shirt off and scooping the whimpering animal up with it, away from the scorching flames.
9News Sydney named the woman who rescued the koala as Toni Doherty.
Doherty told 9News she was passing by the area when she saw the animal and acted on instinct to save him.
“I knew if we didn’t get him down from the tree then he would have been up there in amongst the flames,” she told 9News.
Footage of the full rescue can be seen below.
In the video, Doherty rushes towards the koala and picks him up with her own t-shirt.
The koala is removed from a tree branch and appears to be very badly burned, with scabs all over its body.
Doherty then gives the koala water to drink and washes his body before wrapping him up in a blanket.
The incident took place in Port Macquarie, a town in New South Wales that has been hit badly by the recent bushfires in Australia .
The koala, who Doherty named Lewis after her grandson was taken to the Port Macquarie Koala Hospital.
9News reporter Lizzie Pearl said in a tweet that Lewis is suffering from serious burns but was well enough to “have a munch on some eucalyptus leaves” on Wednesday.
A series of devastating bushfires are currently raging along Australia’s east coast.
Six people have died as a result of the fires in the state of New South Wales since October, and 577 homes have been destroyed, according to The Associated Press.
The koala is currently listed as a “vulnerable” species by the Australia’s Environment Ministry, and the recent fires are thought to have killed hundreds of them.
- Read more:
- 13 photos show Sydney under a blanket of smoke as bushfires continue to ravage the region
- This echidna had its spikes burned off in a bushfire because instead of trying to escape it just took a nap
- Australian firefighters left a heartwarming note apologizing for drinking a man’s milk after they saved his home from devastating wildfires
- Hundreds of koalas are feared dead after a massive wildfire broke out in an Australian nature reserve


- 1
- D. A. Gurnett and A. Bhattacharjee.
Introduction to plasma physics : with space and
laboratory applications.
Cambridge University Press, Cambridge,
UK, 2004.
- 2
- E.J. Hinch.
Perturbation
methods.
Cambridge University Press, 1991.
- 3
- Dwight R. Nicholson.
Introduction to Plasma Theory.
John Wiley
& Sons, 1983.
- 4
- T. H. Stix.
Waves in plasma.
American Institute of Physics, New York, 1992.
yj
2016-01-26


val billingDetails: BillingDetails?
Billing information associated with the PaymentMethod that may be used or required by particular types of payment methods.
billing_details


xamarindevelopersummit/XamDevSummit2019 Slide decks, wallpapers and more fun stuff from Xamarin Developer Summit 2019 - xamarindevelopersummit/XamDevSummit2019
facebook/hermes Hermes is a small and lightweight JavaScript engine optimized for running React Native on Android. - facebook/hermes
Size matters The scene graph and all the tools and features of Babylon.js rely on an engine which functions as the central hub from which all orders…
Extended Validation Certificates are Dead That's it - I'm calling it - extended validation certificates are dead. Sure, you can still buy them (and there are companies out there that would just love to sell them to you!), but their usefulness has now descended from "barely there" to &qu...
Xamarin Developer Summit - Day 2 Join us for Day 2 of the Xamarin Developer Summit live from Houston, Texas! We will be live streaming throughout the entire day. See a full schedule at: https://xamarindevelopersummit.com/schedule Schedule ( all in Central Time Zone (Houston, Texas)): 8...
Stack Trace Art An artist wannabe discovers his own art - turning programming exceptions into beautiful drawings.
Azure/azure-functions-durable-extension Durable Task Framework extension for Azure Functions - Azure/azure-functions-durable-extension
Cloud TPU Pods break AI training records | Google Cloud Blog Google Cloud sets three new records in the industry-standard ML benchmark contest, MLPerf, with each of the winning runs using less than two minutes of compute time.


Foreign National Killed In Kabul Bombing Targeting UN Vehicle
At least one foreign citizen was reported killed when a UN vehicle was targeted in a bombing in the Afghan capital of Kabul on November 24.
Interior Ministry spokesman Nasrat Rahimi said five others, including two Afghan UN workers, were wounded in the attack. The vehicle was heavily damaged.
The blast targeted the vehicle on one of the busiest roads in the city, in police district 9, according to Rahimi.
No one immediately claimed responsibility for the attack, but both Taliban and the Islamic State extremist group are active in the capital and have repeatedly claimed previous attacks.
Elsewhere, in the central Daykundi Province, at least eight soldiers were killed when Taliban militants stormed their checkpoint, according to provincial governor Anwar Rahmati. He said four other soldiers were wounded in the hours-long gun battle.
Rahmati said reinforcements were dispatched early on November 24 to the area in the Kajran district, driving off the insurgents and killing at least 20 of them.
Qari Yusouf Ahmadi, a Taliban spokesman, claimed responsibility for the checkpoint attack. He disputed the Taliban casualty figures provided by the governor and said the insurgents had seized weapons and ammunition.


Release 47
2000-07-29
This Release
There's been a lot of them since February. I didn't take very good notes (too busy).
Release 44 Notes
Sam Blackburn
<EMAIL_ADDRESS>Return to Sam's Home Page


This feature will convert {{ repository.namespace }}/{{ repository.name }} into a mirror. Changes to the external repository will be duplicated here. While enabled, users will be unable to push images to this repository.
This repository is configured as a mirror. While enabled, Quay will periodically replicate any matching images on the external registry. Users cannot manually push to this repository.
Configuration |
|
|
Scheduled mirroring enabled. Immediate sync available via Sync Now. Scheduled mirroring disabled. Immediate sync available via Sync Now. |
|
| {{ vm.externalReference }} | |
| {{ vm.syncInterval | humanizeInterval }} | |
| {{ vm.syncStartDate | humanizeDate }} | |
Advanced Settings |
|
| {{ vm.username || 'None' }} | |
|
Require HTTPS and verify certificates when talking to the external registry. |
|
|
Allow unsigned images to be mirrored. |
|
| {{ vm.httpProxy || 'None' }} | |
| {{ vm.httpsProxy || 'None' }} | |
| {{ vm.noProxy || 'None' }} | |
Status |
|
| {{ vm.statusLabels[vm.status] || vm.status }} | |
| {{ vm.expirationDate ? (vm.expirationDate | humanizeDate) : 'None' }} | |
| {{ vm.retriesRemaining }} / 3 |


|
PolyTycoon
1
UnityTransportTycoontypegame.
|
Directories | |
| directory | Behaviours |
Files | |
| file | AmountProductView.cs |
| file | BarChartValueView.cs |
| file | BarChartView.cs |
| file | CityView.cs |
| file | CityWorldToScreenView.cs |
| file | CompassView.cs |
| file | ConstructionElementView.cs |
| file | ConstructionView.cs |
| file | DestructionView.cs |
| file | MoneyUiView.cs |
| file | NeededProductView.cs |
| file | PauseMenueView.cs |
| file | PlacementView.cs |
| file | ProductProcessorView.cs |
| file | ProductSelectionView.cs |
| file | ProductView.cs |
| file | ProgressionUnlockView.cs |
| file | ProgressionUnlockViewElement.cs |
| file | StorageContainerView.cs |
| file | TerrainChunk2D.cs |
| file | TerrainGenerator2DView.cs |
| file | TimeScaleView.cs |
| file | TooltipHandle.cs |
| file | TooltipText.cs |
| file | TransportRouteCreationView.cs |
| file | TransportRouteElementView.cs |
| file | TransportRouteOverviewElementView.cs |
| file | TransportRouteOverviewView.cs |
| file | TransportRouteProductView.cs |
| file | TransportVehicleView.cs |
| file | UserNotificationView.cs |
| file | VehicleOptionView.cs |


WITNESS LIST Redistricting Committee April 15, 2000-9:00A Redistricting On: Alcoren, Lee (Self and Dallas NAACP Branch) Alonzo, Diana (Mexican American Democrats) Arreguin, Melissa Margarita (Self) Arreguin, Valentin (Self) Beverly, Mike (Self) Black, Albert (Self) Dixon, Pauline (Self) Flores, Hector M. (LULAC) Garcia, Carmen (Self) Garcia, Representative Domingo (Self) Gee, Bobbye (Self) Giddings, Representative Helen (Self) Gomez, Maria E. (Self) Gosslee, Susybelle (Dallas League of Women Voters) Gutierrez, David (Self) Hebert, Gerald (IMPAC 2000) Herrera, Roger (Self) Hill, City Council District 5 Member Donald W. (Self and Constitutents of District 5) Jackson, Council Member Teri (City of Grand Prairie) Jasso, Juan (Self) Johnson, E. B. (Self) Kinsler, Christy (Self) Korbel, George (Self and Texas Mexican American Caucus) Lawson, Henry T. (Self) Leos, Kathleen (Self) Lichtman, Dr. Allan (Self) Lopez, John J. (Mexican american Democrats) Lopez, Ramiro (Self and HACE) Loza, Dallas City Councilman John (Self) May, Joe (Self) McMullen, Tim (Self) Medrano, Francisco "Pancho" (Self) Milem, John (Self) Milliken, Michael (Self) Nevaquaya, Verwyn Lou (Self) Perez, Torres Feliciano (Self) Plata, Jose (Self) Post, Martha Wright (Self) Price, John Wiley (Self and Dallas County District 3) Richards, City Council Member Judy (City of Duncanville) Rizo, Frances (Self and Tejano Democrats, 23rd Sneate District) Sampson, DeMetris (Political Congress of African American Women) Sepulveda, Luis D. (Self and My wife, son and Jessica daughter) Ware, Alan (Texas Legislative Council) Washington, Mayor Mary (City of Hutchins) Wiant, Elaine (Self and League of Women VOters of Texas) Registering, but not testifying: On: Alonzo, Monica (Self and Mexican American Democrats) Anchia, Rafael (Self) Ayala-Salas, Jose A. (Mexican American Democrats) Campos, Joe (LULAC Council 100) Casarez, Mario (Self) Castilla, Aurelio (Self) Castro, Ralph (Self) George, Representative Kenn S. (Self) Gilmore, Mary (Self) Lopez M., Jorge (Mexican American Democrats) Marrero, Miguel (Self) Marshall, Anthony (Self) Nicholson, Jerry (Mexican American Democrats) Orr, Kenneth H. (Self) Pena, Pete (Self) Robles, Art (Self and Dallas Hispanic Chamber) Tompkins, R. Dabney (Self) Trejo, Marshall (Self and Mexican American Democrats) Vera, Joel David (Self and Mexican American Democrats) Woertendyke, Clair C. (Self)


Incident Management System
Tuesday February 12, 2018
New Ticket
List Tickets
Reporting
Lookup Ticket

Update Profile
Admin Functions


Welcome to Paradise!
Paradise is a coastal island rich with nature. It may be small, but Paradise has many features including flowing rivers, sandy beaches, shopping and housing districts, and an international airport. Many kind faces have been moving to Paradise in hopes of creating a bright future for themselves.
On this website, you can find all sorts of information of what you can expect from visiting this island. There are many attractions and events that will keep you busy during your stay. The history page will brief you on Paradise's history. You can even find a list of notable members of the community by visiting the residents page.
We hope you enjoy your stay!


← Welcome To Python Techies 2018. →
This is a free tech learnig group for python and other technologies. If interested to join, tell us why,
your area of interest, include your phone number for our whatsapp group and hit that JOIN US button.
Technology is our drug, feel like taking one for the team?.


{% extends 'boiler_plate.html' %} {% block body %} ADD TASK Whatever cardigan tote bag tumblr hexagon brooklyn asymmetrical gentrify, subway tile poke farm-to-table. Franzen you probably haven't heard of them man bun deep. Task Name Task Duration [HH:MM:SS] Select Repitition Of Your Task Monday Tuesday Wednesday Thursday Friday Saturday Sunday Button {% endblock %}
Whatever cardigan tote bag tumblr hexagon brooklyn asymmetrical gentrify, subway tile poke farm-to-table. Franzen you probably haven't heard of them man bun deep.


Problems Facing the Tech World: Security
Security is one of the most important problems facing technology. Every year millions of people's devices are hacked. Last year, Target was hacked and 40 million of their customers had their debit and credit card information stolen. Recently, there was the HeartBleed bug that exposes encrypted transactions to cyber-attackers. "Security experts warn potential harm from the Heartbleed bug could go far beyond major Internet companies, penetrating to the inner workings of the web and devices that connect to it" -The New York Times. Millions of personal accounts are hacked each year. In recent years technology has become very personal. Your phone's ability to store your credit card information, location, emails, along with syncing to "the cloud" all put users at a high risk. I understand that technology will always have its "holes" but I believe there has to be a better way to protect users from data theft. I believe we can increase security on both the developer's end and the user's end. Developers should always check if their code is secure by avoiding injection attacks, designing secure user interfaces, and create validation processes. This concept can also help protect developers from software pirating. Users can do a number of things to secure themselves.
- Create Tough Passwords
- Share Less Information
- Back Up Data
- Update Software Frequently


{% if prediction >=0 and prediction <=55 %}
The Estimated AQI is Good
{% elif prediction >= 56 and prediction <= 100 %}
The Estimated AQI is Satisfactory
{% elif prediction >= 101 and prediction <= 200 %}
The Estimated AQI is Moderate
{% elif prediction >= 201 and prediction <= 300 %}
The Estimated AQI is Poor
{% else %}
The Estimated AQI is Severe
{% endif %}


The customer is able to pay some part by Cash and the rest by debt using available credit journal(s) (or pay all the order amount by debt). You may use as many credit journals as you wish.
You can easily put the customer change to his credit account if needed (e.g. if you wouldn't like to care about small change).
Customers are able to purchase credits to top up their balances
Make payment (e.g. by Cash)
The credit balance is topped up after purchase
Note that the customers are able to purchase credit products via eCommerce too
All customer debts/credits balances are shown on client list view
All the details about used debt transactions for the customer selected you can see by clicking on Show Debt History.
The Pay Full Debt button appears when you select customer, which has unpaid debt (red amount). You can see this button in 2 places:
Once you click Pay Full Debt button, the debt amount will be added to the payment list with negative sign. That negative amount has to be covered by normal payment (e.g. by cash). This payment should be more than total amount of current order (note that there must be at least one product in your order before payment can be validated, so in this case we recommend to use dummy zero price product). After payment validation, the customer will have zero debt value (i.e. he will have not any debt).
Open Point of sale → Configuration → Manual Credit Updates. Here you can manually manage with credit updates by creating new record or importing csv (xls) file. It may be used in following cases:
Group of partners from the same Company can be handling together. To do that open wizard via Invoicing → Sales → Generate POS Credits Invoices and set the fields:
In the employee list you can see Current Credits and set Credits to add
Then
As a result the Credits for employees are updated
To add a credit journal go to Point of Sale → Configuration → Payment Methods and check the box Credit Journal at Point of Sale tab for the journal you create.
This option allows you to significantly speed up the sales process. So any transaction can be done in few seconds:
Activate the autopay option for a single journal at least. Then make order for a customer in POS. If the customer you selected has no enough credits on autopay journal, you will see the warning about it at the bottom left corner.
Otherwise the journal is added to payment line automatically.
Let's say we have 2 autopay journals and total balance of the journals is more than amount of order. For example, if the first journal has no enough positive balance to cover this amount, it will take only the amount equal to its balance and the remaining part will be reduced from the second autopay journal.
If the transaction is successful, you will see animated thumps up icon
In addition you can choose Debt Type (displaying method) in Point of Sale → Configuration → Settings menu:
Display Debt
Display Credit
Contact us by email or fill out request form


climate change agricultural trade impacts global welfare production crop scenario Climate demand regional Fig. economic regions consumer surplus {border-style food table GDP Global prices producer px;} #ffffff;} model Change domestic MAgPIE SRES effects price Lotze-Campen Müller different fertilization losses market patterns LIB S). land projections total Econ. FIX Popp analysis effect fig. liberalization loss negative projected biophysical consumers use Supplementary Trade end future impact international potential producers scenarios surplus. yields Food LPJmL agriculture century change, positive results uncertainty van However, Schmitz changes px; socioeconomic {font-family Agric. Environ. Glob. Nelson data font-size higher impacts, indicators lower magnitude regions, regions. supply value yield Bodirsky Dietrich Sci. Science changing compared costs damage developing double; high-end importance increase increasing level liberalized models paper policies productivity response scenario. share (US$ (see Acad. Agriculture Development Eds. Hasegawa Natl. Press, Proc. Weindl [], account adaptation agro-economic based beneficial benefit border-color border-width certain change. current defined equilibrium especially estimated example, export exporting good gridded growth increased index inelastic plant policy population production, reduced reduction relative shares solid; welfare. world year {font-style {font-weight (for Adaptation Agricultural FSU GCM H.L.-C., Heyhoe Kyle Lampe Meijl Mensbrugghe Nat. Reilly Report Research Rolinski Rosenzweig Sands Smith Tabeau U.S.A. Univ. Valin World affected approximately article assumption available basis bold calculated case choice conditions cost costs. courier; der effectiveness em; environmental fixed gains general goods hand, implemented important including initial is, large level, livestock lose measured new patterns, period pp. prices. provided pt;} quantity reduce region resulting security seen shaded shifts shock simulated surplus, time trade, trade. trends von water welfare, yields,


--- layout: post esbma_id: 1795 title: Vault 5.1 date: 2010-11-16 16:31:56 ---
I am delighted to announce that SourceGear has released version 5.1 of Vault, our version control tool for developers on Windows and Visual Studio. This is technically a minor release, and it does contain the "lots of little improvements" which are usually found in a "dot one release", but it also brings two big changes.
First of all, we are renaming our "Fortress" product and calling it Vault Professional Edition. Fortress has always been "a version of Vault with more features", but the naming caused some confusion. We decided to simplify things and make the naming consistent with what these products really are:
The second major change in the 5.1 release is that Vault Pro supports integration with OnTime from Axosoft. Our two companies have many common customers who have been asking for Vault and OnTime to work better together. I consider OnTime to be an outstanding product, and I'm glad that development teams who use OnTime with Vault can enjoy a much-improved user experience.
Plans for the Vault 6.0 release are already under way. We intend to publish a roadmap with planned features and general timeframe as soon as we can. Once it's available, you'll see it here.


Example: entering 0 in the first field, and 5 in the second field would result in this:
K1907020006
Entering 2 to 7 would result in this:
K190702031


PC Engines apu coreboot Open Source Firmware v<IP_ADDRESS>
PC Engines apu coreboot Open Source Firmware v<IP_ADDRESS>
Key changes
Mainline:
- Rebased with official coreboot repository commit da3375e.
- Added apu6 platform support.
Statistics
The chart shows the total files changed from release tag against the rebase point of given release specified in CHANGELOG (CHANGELOG.md, gitlab-ci.yml and gitlab-ci/regression.sh excluded from statistics). Check the statistics with:
git diff --stat da3375e ':(exclude).gitlab-ci.yml' ':(exclude)CHANGELOG.md' ':(exclude).gitlab-ci/regression.sh'
108 files changed, 4213 insertions(+), 451 deletions(-)
The chart represents the total line added and deleted on the PC Engines coreboot fork against the rebase point for a given release.
Three files have not been included in the diff as mentioned above since they are not a part of coreboot tree.
Testing
-
PC Engines hardware configuration matrix - hardware configurations available for testing in 3mdeb laboratory.
-
PC Engines release validation results - please note there are separate sheets for each board-release.
- Mainline:
- PASSED: 617 (+75)
- FAILED: 7 (+1)
- PASSED [%]: 98.89 (-0.04%)
Key Changes in testing
-
Added manual tests results of apu6a (which significantly increased the total number of tests).
-
There were changes to SD card device tests to handle SD expander modules properly.
-
There were added small corrections to handle ECC with more precision.
-
OS Preseeds have been differed between the platforms.
-
There has been added a config for 10 pin TPM as a module.
Binaries
Mainline
See how to verify the signatures on asciinema
What we planned
-
Improve the support of TPM2 in coreboot and SeaBIOS. Currently there is only the TCPA (TPM1.2) log support in coreboot. Additionally SeaBIOS overwrites existing entries in TPM2 log area.
cbmem
utility also lacks support for displaying TPM2 log area.WORK IN PROGRESS
-
Reorganize runtime configuration by making it persistent across updates and accessible from user space. Also prepare a tool for offline binary modification.
VERIFICATION
-
Vital Product Data (VPD) support. User will have possibility to store and change VPD configuration in Read-Write section of SPI flash. Moreover, default VPD keys and values will be stored in Read-Only region to protect data against corruption. Also, sortbootorder runtime configuration will be stored in VPD Read-Write section, so access to it will be possible in OS via dedicated util.
VERIFICATION
Coming soon
Feature and improvements on the roadmap:
- Improve the support of TPM2 in coreboot and SeaBIOS. Currently there is only
the TCPA (TPM1.2) log support in coreboot. Additionally SeaBIOS overwrites
existing entries in TPM2 log area.
cbmem
utility also lacks support for displaying TPM2 log area. - Reorganize runtime configuration by making it persistent across updates and accessible from user space. Also prepare a tool for offline binary modification.
- Vital Product Data (VPD) support. User will have possibility to store and change VPD configuration in Read-Write section of SPI flash. Moreover, default VPD keys and values will be stored in Read-Only region to protect data against corruption. Also, sortbootorder runtime configuration will be stored in VPD Read-Write section, so access to it will be possible in OS via dedicated util.


Job open
Neuroimaging Software Developer
Summary
At the
Functional Neuroimaging Unit“(UNF), Montreal, CA, we work to better understand the central nervous system using state-of-the-art magnetic resonance imaging techniques, with many potential medical applications. We are developing new methods to improve the quality of structural and functional images, as well as data mining techniques to extract meaningful information from massive datasets. We are looking for a full-time developer to contribute to the integration of UNF with the
CBRAIN platform, a Canadian neuroinformatics infrastructure. The successful candidate will assist research teams at UNF and across Québec to integrate the raw data they acquire with the research software available inside CBRAIN.
How to apply
The position is for one year, renewable, and is based at the SIMEXP laboratory, CRIUGM, Université de Montréal, headed by Dr. Pierre Bellec. There will be close interaction with the CBRAIN team, lead by Dr Shawn T. Brown and Pr Evans of McGill University. Salary will be commensurate with experience and include competitive benefits. We encourage women, aboriginal people, persons with disabilities and members of a visible minority group to apply. To apply, please contact
<EMAIL_ADDRESS>with a CV, a cover letter and three references.
Who would be a good fit for this position?
- Individuals with a background in neuroimaging, and a passion for coding.
- Experience with managing large scientific workflows, as well as Python, R or Matlab, are all a plus.
Why take this job?
- Join an environment that fosters creativity, autonomy and passion.
- Continue to grow your knowledge about software development and neuroimaging.
- Develop a highly multidisciplinary network of collaborators, including computer scientists, neuroscientists and physicians.


|
XMC Peripheral Library for XMC4000 Family
2.1.4
|
#include <xmc_ecat.h>
ECAT port control data structure
| uint32_t __pad0__ |
Reserved bits
| uint32_t __pad1__ |
Reserved bits
| uint32_t __pad2__ |
Reserved bits
| uint32_t __pad3__ |
Reserved bits
| uint32_t __pad4__ |
Reserved bits
| uint32_t enable_rstreq |
Master can trigger a reset of the XMC4700 / XMC4800 (::bool)
| uint32_t latch_input0 |
Latch input 0 selection (::XMC_ECAT_PORT_LATCHIN0_t)
| uint32_t latch_input1 |
Latch input 1 selection (::XMC_ECAT_PORT_LATCHIN1_t)
| uint32_t link |
Link status (::XMC_ECAT_PORT0_CTRL_LINK_t)
Link status (::XMC_ECAT_PORT_CTRL_LINK_t)
| uint32_t mdio |
Bidirectional, push-pull management data I/O line (XMC_ETH_MAC_PORT_CTRL_MDIO_t)
| uint32_t phyaddr_offset |
Ethernet PHY address offset, address of port 0
| uint32_t rx_clk |
RX Clock (::XMC_ECAT_PORT0_CTRL_RX_CLK_t)
RX Clock (::XMC_ECAT_PORT_CTRL_RX_CLK_t)
| uint32_t rx_dv |
RX Data valid (::XMC_ECAT_PORT0_CTRL_RX_DV_t)
RX Data valid (::XMC_ECAT_PORT_CTRL_RX_DV_t)
| uint32_t rx_err |
RX Error (::XMC_ECAT_PORT0_CTRL_RX_ERR_t)
RX Error (::XMC_ECAT_PORT_CTRL_RX_ERR_t)
| uint32_t rxd0 |
Receive data bit 0 (::XMC_ECAT_PORT0_CTRL_RXD0_t)
Receive data bit 0 (::XMC_ECAT_PORT_CTRL_RXD0_t)
| uint32_t rxd1 |
Receive data bit 1 (::XMC_ECAT_PORT0_CTRL_RXD1_t)
Receive data bit 1 (::XMC_ECAT_PORT_CTRL_RXD1_t)
| uint32_t rxd2 |
Receive data bit 2 (::XMC_ECAT_PORT0_CTRL_RXD2_t)
Receive data bit 2 (::XMC_ECAT_PORT_CTRL_RXD2_t)
| uint32_t rxd3 |
Receive data bit 3 (::XMC_ECAT_PORT0_CTRL_RXD3_t)
Receive data bit 3 (::XMC_ECAT_PORT_CTRL_RXD3_t)
| uint32_t tx_clk |
TX Clock (::XMC_ECAT_PORT0_CTRL_TX_CLK_t)
TX Clock (::XMC_ECAT_PORT_CTRL_TX_CLK_t)
| uint32_t tx_shift |
TX signal delay (::XMC_ECAT_PORT0_CTRL_TX_SHIFT_t)
TX signal delay (::XMC_ECAT_PORT1_CTRL_TX_SHIFT_t)


Links from my Spelunking at Ruby talk @pdxruby are available at http://jasonrclark.com/debug. Thanks all for listening!
9/2/2014, 8:40:30 PM
Favs: 3
Retweets: 1
link--- layout: tweet ---
Links from my Spelunking at Ruby talk @pdxruby are available at http://jasonrclark.com/debug. Thanks all for listening!
9/2/2014, 8:40:30 PM
Favs: 3
Retweets: 1
link


My name is Wasani Probasco and I was born and raised in sunny Los Angeles, Ca! I graduated from the prestigious University of Miami in 2013 where I studied Pschology. It wasn't until I got my first real job after graduation that I realized that my passion was for Tech Indutry that is currently flourishing in our own backyard.
While working in Digital Marketing, I had several hands in creating WordPress sites for our clients. It was then that I decided I wanted to transition into a full-time career in Front-End Web Development.
I am currently & actively seeking entry/junior level positions in this industry in which I can continue to foster my educational growth in all things Front-End!
From Content Marketing, to Social Media, to keeping up with the trends in SEO and PPC, I have built a solid skill set that has given me optimum understanding of what drives front-end user interface.
A recent graduate of an immersive coding bootcamp in which I was able to learn skills needed to begin my career in Front-end Development including HTML, CSS, JavaScript, Bootstrap and JQuery.
What is it that gives a user a great experience on an app or website? My background (Bachelors) in Psychology has given me the education and tools needed help answer these questions.


Policies
Policy Search
Policy No
First Name:
Last Name:
Date From:
Date To:
Type:
All Types
Motor Vehicle
Home Property
Submit
Selected Policies
Policy
Return
Summary
Risks
Insured
Policy
Broker One Push
Risks
Insured(s)


Welcome to MeetingMemo
You meet, we take minutes.
- This web API converts audio to text summaries.
- It translates an audio to English sentences;
- And presents the highlight sentences;
- Also supports keywords and full transcript.
- To see audio to text summary in action click Summary;
- To record a live audio, click Record;
- To upload your audio, click Upload;
- To see the source code, Git link.
To learn more about MeetingMemo, please see the slides:


This chapter describes commands that configure the bundle layer.
All of these commands (except new
)
apply to the currently active bundle, i.e.,
the bundle shown at the command line prompt.
set bundle period seconds
set bundle hiwat percent
set bundle lowat percent
set bundle min-con seconds
set bundle min-dis seconds
set bundle links link1 [ ... ]
These commands are only meaningful when bandwidth management is enabled.
Mpd will attempt to bring up a new link from the list specified
or take down an existing link when the utilization goes above
hiwat
or below lowat
percent,
respectively. The utilization is sampled every period
divided by 6 points, and is averaged over the past period
seconds.
Mpd will not attempt to disconnect a link unless previous one was
disconnected at least min-dis
seconds before.
Similarly, mpd will not open a link unless previous was opened at least
min-con
seconds before. These two parameters
help prevent oscillations, but cause slower response time.
set bundle fsm-timeout seconds
This sets the finite state machine (FSM) retry interval for all FSM's on this bundle. This command should only be used in exceptional situations, such as doing PPP over high-latency satellite links. The default is 2 seconds.
set bundle accept option ...
set bundle deny option ...
set bundle enable option ...
set bundle disable option ...
set bundle yes option ...
set bundle no option ...
These commands configure various bundle options. Most options are bi-directional in that they can be independently enabled and disabled in each direction.
The enable
and disable
commands determine
whether we want the corresponding option.
The accept
and deny
commands determine
whether we will allow the peer to request the corresponding option.
The yes
command is the same as
enable
and accept
.
The no
command is the same as
disable
and deny
.
The options available at the bundle layer are:
bw-manage
This command enables bandwidth management, in which mpd attempts to dynamically adjust the number of connected links depending on the traffic load.
The proper functioning of bandwidth management depends on the correct
latency and bandwidth information configured for each link; see the
set link latency
and set link bandwidth
commands.
The default for this option is off -- mpd connects the links ``all or none.''
round-robin
When multilink PPP is enabled and there are two or more links connected, this option enables round robin packet scheduling across the links. That is, instead of breaking each packet into fragments and delivering the individual fragments over all the links in the bundle, each packet is delivered whole over single link. The link is chosen by rotating in round-robin fashion over all the links in the bundle.
This option normally would result in higher latency and possible delays due to TCP packets being received out of order; however, it may help in certain situations of high packet loss or broken peer equipment.
The default is disable.
ipcp
Enable/Disable IPCP negotiation. For details see the IPCP layer chapter.
The default is enable.
ipv6cp
Enable/Disable IPV6CP negotiation.
The default is disable.
compression
Enable/Disable CCP (Compression Control Protocol) negotiation. For details see the compression layer chapter.
The default is disable.
encryption
Enable/Disable ECP (Encryption Control Protocol) negotiation. For details see the encryption layer chapter.
The default is disable.
crypt-reqd
Require encryption. When encryption support is compiled into mpd, this option causes mpd to drop the link if encryption cannot be successfully negotiated in both directions. This means in effect, ``use encryption or do not connect at all.''
The default is disable.


The camellia bears a single, 5 petal red flower in the wild.
State Flag
A white background with a crimson cross of St. Andrew.
State Bird
The Norther flicker, aka: Yellowhammer, became the state bird on Sept. 6, 1927.
State Capital
Montgomery, AL Birthplace of the Civil Rights Movement Capital since 2/1861
Dumb Laws
- Boogers must not be flicked into the wind.
- It's illegal to wear a fake moustache in church because it could cause laughter.
- It's illegal to put an ice cream cone in your back pocket.